[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-set-lebsize
n < # avol ⊦ lpt[n] = mklp(n0, n1, LP_INDEX_NODES, n2) ∧ abs-istore(avol, lpt, istore) → abs-istore(avol, lpt[n, mklp(n0, LEB_SIZE, LP_INDEX_NODES, n2)], istore)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
persistence-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 17
Used lemmas:
abs-istore-def
,
Used spec theorems:
abs-leb
/encoding-index-node/
abs-leb-def
Used simplifier rules:
array
/lp-array/
Size-put
ablock
/index-store/
elim
lprops
/
elim
ablock
/index-store/
sel-03
array
/lp-array/
Put-other
store
/index-store-ablock-store-nat-store/
notmemlookup
nat
/
lels
nat-basic
/
f
lprops
/
inj
array
/lp-array/
Put-same
abs-list
/encoding-index-node/
abs-nodes-elems-adr-length
aleb
/
ex
aleb
/
test-02
aleb
/
sel
ablock
/index-store/
sel-01
ablock
/index-store/
sel-02
elem-index
/gc-heap-base/
sel-01-M02
abs-list
/encoding-index-node/
abs-nodes-unique-weak
abs-list
/encoding-index-node/
abs-nodes-strong-imp-weak