[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 abs-istore-idcircle
lpf ≠ LP_INDEX_NODES ⊦ # lpt = # avol0 ∧ n < # lpt ∧ id○(avol0, avol1, n) ∧ abs-istore(avol0, lpt, istore) ∧ lpt[n] = mklp(m0, m1, lpf, m2) → abs-istore(avol1, lpt, istore)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 12
Used lemmas:
abs-istore-def
,
Used spec theorems:
array-copy
/avolume/
Idexcept
Used simplifier rules:
array-copy
/avolume/
idexcept-size
nat-basic
/
f
lprops
/
elim
ablock
/index-store/
elim
nat-basic
/
lf-01
ablock
/index-store/
sel-03
elem-index
/gc-heap-base/
sel-01-M01
elem-index
/gc-heap-base/
sel-01-M03
lprops
/
inj