[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-replay-lpt-unchanged
n = # lpt ⊦ avol-replay-lpt-unchanged(avol0, avol1, lpt, nx) → (abs-istore(avol1, replay-lpt(lpt, nx, n), remove-refsize0(istore)) ↔ abs-istore(avol0, replay-lpt(lpt, nx, n), remove-refsize0(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: 7
Proof steps: 33
Used lemmas:
replay-lpt-at
,
avol-replay-lpt-unchanged
,
replay-lpt-size
,
abs-istore-def
,
Used spec theorems:
Used simplifier rules:
oelem
/nat-set/
irreflexivity
ablock
/index-store/
elim
lprops
/
elim
nat-basic
/
f
ablock-store-inv
/index-store/
at-remove-refsize0
ablock-store-inv
/index-store/
in-remove-refsize0
ablock
/index-store/
sel-03
nat
/
le-def
nat-basic
/
lf-02
nat-basic
/
lf-01
nat-basic
/
lf
oelem
/nat-set/
transitivity
nat-basic
/
ls-02
nat
/
ler
elem-index
/gc-heap-base/
sel-02
lprops
/
upd-05
elem-index
/gc-heap-base/
sel-01-M01
elem-index
/gc-heap-base/
sel-01-M03
nat
/
fle
lprops
/
disj-03
lprops
/
inj