[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-h-p-nowritesh-allpersisted-aux
⊦ fowl |W = [] ∧ allReadsOK(h) ∧ absloc(events((h | l) | false), rset, fowl) → ((h | l) | t) | false = []
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
abs-h-p-nowritesh-allpersisted
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 5
Used lemmas:
absloc-base
,
absloc-nowritesp-nowritesh
,
Used spec theorems:
PLIB-preds
/
allReadsOK-nowrites-allpersisted
PLIB-preds
/
restrict-t-b-swap
Used simplifier rules:
PLIB-preds
/
events-empty
PLIB-preds
/
restrict-t-empty