[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Theorem fwd-in-istore-lpt
⊦ n ∈ istore ∧ abs-istore(avol, lpt, istore) → n < # lpt ∧ lpt[n].ref-size = istore[n].ref-size ∧ lpt[n].flags = LP_INDEX_NODES
Type: A user defined theorem
Validity: The proof is valid.
Features: forward, localforward,
Comment:
Used by:
refine-add-ind
,
refine-allocate-ind
,
refine-deallocate-gnd
,
refine-get-iblock-refsize
,
refine-read-ind
,
refine-set-iblock-refsize
,
refine-sync
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 7
Used lemmas:
Used spec theorems:
persistence-base
/
abs-istore-def
Used simplifier rules:
ablock
/index-store/
elim
lprops
/
elim
elem-index
/gc-heap-base/
sel-01-M01
ablock
/index-store/
sel-03
elem-index
/gc-heap-base/
sel-01-M03
nat-basic
/
f