[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-persistFO-weak
⊦ allReadsOK(h) ∧ isPersistFO(n, p(l)) ∧ abs(h, rs, p) → abs(h, rs, p(l := p(l) -p n))
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
FLITPSCweak-refines-PLIB
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 10
Used lemmas:
absloc-persistFO
,
abs-def-reduce
,
Used spec theorems:
Used simplifier rules:
list-data
/
elim-add
list
/
a
list
/
in-rec
list
/
e
list
/
app-02
list
/
in-14
list
/
c
RWevent
/
test-dotRque-W
PLIB-preds
/
allReadsOK-no-initial-unpersisted-read