[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-single-FO-one-pending
⊦ abs(h, rs, p) ∧ allReadsOK(h) ∧ onePendingW(t, l0, p) ∧ FOFollowsW(t, p(l0)) ∧ isPersistFO(n, p(l)) ∧ ¬ FO(t) ∈ p(l) -p n ∧ FO(t) ∈ p(l) ∧ ¬ t ∈ rs(l) → ((h | l) | t) | false = []
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: 12
Proof steps: 17
Used lemmas:
abs-loc-no-w-last-fo-then-no-pending
,
abs-def
,
Used spec theorems:
PLIB-preds
/
allReadsOK-def
FLITPSC-preds
/
noPendingW
FLITPSC-preds
/
onePendingW
Used simplifier rules:
list-del
/
delpos-get-fw
FLITPSCweak-preds
/
one-pending-del-persist-FO-no-pending
FLITPSCweak-preds
/
isPersistFO-del-no-W-stable