[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-avol-change-other
lpf ≠ LP_INDEX_NODES ⊦ lpt[n] = mklp(n0, n1, lpf, n2) → (abs-istore(avol[n, aleb], lpt, istore) ↔ abs-istore(avol, lpt, istore))
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: 0
Proof steps: 53
Used lemmas:
abs-istore-def
,
Used spec theorems:
Used simplifier rules:
ablock
/index-store/
elim
lprops
/
elim
store
/index-store-ablock-store-nat-store/
notmemlookup
nat
/
lels
nat
/
le-ls-simp
lprops
/
inj
nat-basic
/
f
elem-index
/gc-heap-base/
sel-01-M01
ablock
/index-store/
sel-03
elem-index
/gc-heap-base/
sel-01-M03
array
/avolume/
Put-other