[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-firstPersistW-firstVolWrite-correct-loc
⊦ abs(h, rs, p) ∧ firstPersistW(p(l)) < # p(l) ∧ h[firstVolWrite(l, h)] = (e, bv) → e.l = l
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
abs-persist-firstPersistW
,
Used by units in proved state:
FLITPSCweak-refines-PLIB
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 27
Used lemmas:
absloc-recR
,
absloc-base
,
abs-def
,
Used spec theorems:
Used simplifier rules:
list-data
/
l
nat-basic
/
f
PLIB-preds
/
restrict-l-empty
PLIB-preds
/
restrict-b-empty
PLIB-preds
/
events-empty
FLITPSCweak-preds
/
firstPersistW-lt-filter-W-empty
nat-basic
/
refl-Nat
list
/
a
PLIB-preds
/
events-append
PLIB-preds
/
restrict-b-append
PLIB-preds
/
restrict-l-one
PLIB-preds
/
restrict-l-append
list
/
c
RWevent
/
sel-R-dotl
nat-basic
/
c
nat-basic
/
a
list-del
/
get-succ
PLIB-preds
/
first-vol-write-rec-read
PLIB-preds
/
restrict-bool-one
PLIB-preds
/
events-one
list
/
Nil
RWevent
/
sel-W-dotl
PLIB-preds
/
first-vol-write-rec-write-unpersisted
list-del
/
get-zero
PLIB-preds
/
first-vol-write-rec-write-persisted
PLIB-preds
/
first-vol-write-rec-write-other