[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 writersOk
⊦ writersOk(bq, p, writers) ↔ (∀ l, t. (t ∈ writers(l) → (∀ l0. l0 ≠ l → ¬ t ∈ writers(l0))) ∧ (¬ t ∈ writers(l) → p(l) |W | t = [] ∧ bq(t) |WL l = []))
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
writersOk-add-FO
,
writersOk-add-SF
,
writersOk-empty-bq
,
writersOk-persist
,
writersOk-prop-FO
,
writersOk-prop-W
,
writersok-add-pending
,
writersok-add-writer
,
writersok-rm-writer
,
Used by units in proved state:
FLIT-refines-FLITPSCweak
,
FLIT-proofs
,
Proof exists?: No