[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 definedness-PSCPERSIST_W
⊦ (ctrok(gs.ctr, gs.writers) ∧ writersOk(gs.p, gs.writers) ∧ pendingOk(gs.p)) ∧ firstPersistW(gs.p(l)) < # gs.p(l) → (∀ l0. (l = l0 ⊃ gs.p(l)[firstPersistW(gs.p(l))].W? ∧ firstPersistW(gs.p(l)) < # gs.p(l);true))
Type: A proof obligation
Validity: The proof is valid.
Features:
Comment:
Used by:
FLITPSCInv-thm
,
other-FLITPSCLInv
,
rely-FLITPSCLInv
,
stable-FLITPSCLInv
,
step-FLITPSCLInv
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 2
Used lemmas:
Used spec theorems:
Used simplifier rules:
FLITPSCweak-preds
/
at-firstPersistW-is-W