[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 avol-replay-lpt-unchanged-write-right
n < # avol1 ⊦ avol-replay-lpt-unchanged(avol0, avol1, lpt, nx) → (avol-replay-lpt-unchanged(avol0, avol1[n, aleb], lpt, nx) ↔ ¬(aleb ≠ avol0[n] ∧ (n ∈ nx ∨ lpt[n].ref-size ≠ 0 ∨ lpt[n].flags = LP_FREE)))
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
persistence-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 11
Used lemmas:
avol-replay-lpt-unchanged
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
array
/avolume/
Size-put
lprops
/
elim
nat-basic
/
lf-01
array
/avolume/
Put-same
lprops
/
inj
array
/avolume/
Put-other
elem-index
/gc-heap-base/
sel-01-M01
elem-index
/gc-heap-base/
sel-01-M03