[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-in-p-when-firstVolWrite-in-h
⊦ abs(h, rs, p) → (firstPersistW(p(l)) < # p(l) ↔ firstVolWrite(l, h) < # h)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 13
Proof steps: 42
Used lemmas:
absloc-recR
,
absloc-recW-W
,
absloc-recW-FO
,
absloc-recW-empty
,
abs-def
,
abs-firstPersistW-is-in-hist
,
Used spec theorems:
Used simplifier rules:
nat
/
lels
PLIB-preds
/
first-vol-write-size
PLIB-preds
/
restrict-W-empty
PLIB-preds
/
restrict-l-empty
PLIB-preds
/
restrict-b-empty
list
/
a
PLIB-preds
/
events-append
PLIB-preds
/
restrict-b-append
PLIB-preds
/
restrict-l-one
PLIB-preds
/
restrict-l-append
list
/
c
list
/
app-02
PLIB-preds
/
restrict-write-one
PLIB-preds
/
restrict-W-append
RWevent
/
elim-W
RWevent
/
test-dotWque-W
PLIB-preds
/
events-one
PLIB-preds
/
restrict-bool-one
list
/
e
list-data
/
size-nil
FLITPSCweak-preds
/
firstPersistW-base
nat-basic
/
f
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
nat-basic
/
succ
list
/
len-05
FLITPSCweak-preds
/
firstPersistW-rec-W
nat-basic
/
less-zero
nat-basic
/
s-04
FLITPSCweak-preds
/
firstPersistW-rec-FO
RWevent
/
sel-R-dotl
RWevent
/
sel-W-dotl
list
/
Nil
PLIB-preds
/
events-empty