[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 id-idx-abs-gstore
⊦ id-idx(lpt0, lpt1) → (abs-gstore(avol, lpt1, gstore, ginval) ↔ abs-gstore(avol, lpt0, gstore, ginval))
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
persistence-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 12
Proof steps: 37
Used lemmas:
abs-gstore-def
,
Used spec theorems:
index-array
/gc-heap-base/
id-idx
abs-leb
/encoding-group-node/
abs-leb-def
Used simplifier rules:
ablock
/group-store/
elim
lprops
/
elim
ablock
/group-store/
sel-03
elem-index
/gc-heap-base/
sel-01-M03
elem-index
/gc-heap-base/
sel-01-M01
elem-index
/gc-heap-base/
sel-01-M02
ablock
/group-store/
sel-02
ablock
/group-store/
sel-01
aleb
/
ex
nat-basic
/
lf-01
abs-list
/encoding-group-node/
abs-nodes-elems-adr-length
nat-basic
/
f
aleb
/
sel
aleb
/
test-02
store
/group-store-ablock-store-nat-store/
notmemlookup