[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 FOs
⊦ rfo.FOs? ↔ (∀ t. rfo(t).forall(.FO?))
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
FOs-not-leading-W
,
FOs-not-one-SF
,
FOs-not-one-W
,
readFOsOk-add-FO
,
readFOsOk-add-writer
,
readFOsOk-empty-rfo-while-writing
,
readFOsOk-not-leading-W
,
readFOsOk-not-one-SF
,
readFOsOk-not-one-W
,
readFOsOk-prop-FO
,
readFOsOk-rm-writer
,
Used by units in proved state:
FLIT-proofs
,
Proof exists?: No