[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-firstVolWrite-head
⊦ abs(h, rs, p) ∧ p(l) = W(v, t) ' + fowl → h[firstVolWrite(l, h)] = (W(t, l, v), false)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 29
Used lemmas:
absloc-recW-W
,
absloc-recR
,
absloc-base
,
abs-def
,
Used spec theorems:
Used simplifier rules:
list
/
a
list
/
in-14
list
/
in-rec
PLIB-preds
/
restrict-l-empty
PLIB-preds
/
restrict-b-empty
PLIB-preds
/
events-empty
FLITPSC-preds
/
filter-w-write
list
/
app-02
list
/
e
PLIB-preds
/
events-append
PLIB-preds
/
restrict-b-append
PLIB-preds
/
restrict-l-one
PLIB-preds
/
restrict-l-append
list
/
c
PLIB-preds
/
restrict-bool-one
PLIB-preds
/
events-one
PLIB-preds
/
first-vol-write-rec-write-unpersisted
list-del
/
get-zero
RWevent
/
sel-W-dotl
FOW
/
disj-FO-W
RWevent
/
sel-R-dotl
nat-basic
/
c
nat-basic
/
a
list-del
/
get-succ
PLIB-preds
/
first-vol-write-rec-read
list
/
Nil
PLIB-preds
/
first-vol-write-rec-write-persisted
PLIB-preds
/
first-vol-write-rec-write-other