[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-gstore-idcircle
lpf ≠ LP_GROUP_NODES ⊦ # lpt = # avol0 ∧ n < # lpt ∧ id○(avol0, avol1, n) ∧ abs-gstore(avol0, lpt, gstore, ginval) ∧ lpt[n] = mklp(m0, m1, lpf, m2) → abs-gstore(avol1, lpt, gstore, ginval)
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: 6
Proof steps: 17
Used lemmas:
abs-gstore-def
,
Used spec theorems:
abs-leb
/encoding-group-node/
abs-leb-def
array-copy
/avolume/
Idexcept
Used simplifier rules:
array-copy
/avolume/
idexcept-size
nat-basic
/
f
ablock
/group-store/
elim
lprops
/
elim
nat-basic
/
lf-01
ablock
/group-store/
sel-03
elem-index
/gc-heap-base/
sel-01-M01
elem-index
/gc-heap-base/
sel-01-M03
abs-list
/encoding-group-node/
abs-nodes-elems-adr-length
aleb
/
ex
elem-index
/gc-heap-base/
sel-01-M02
ablock
/group-store/
sel-02
ablock
/group-store/
sel-01
aleb
/
test-02
aleb
/
sel
lprops
/
inj