[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 FOFollowsW-def
⊦ FOFollowsW(t, fowl) ↔ (∀ n. n < # fowl ∧ fowl[n].W? ∧ fowl[n].tid = t → (∃ n0. n < n0 ∧ n0 < # fowl ∧ fowl[n0] = FO(t)))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
fo-follows-last
,
one-pending-no-fo-no-pending
,
relyp-fo-follows-w-stable
,
Used by units in proved state:
FLITPSCweak-proofs
,
FLITPSCweak-preds
,
Proof exists?: No