[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 finiteinvisiblenondet
⊦ fin(IOAut(startf, stepf)) ↔ (∃ sl. ∀ s. startf(s) ↔ s ∈ sl) ∧ (∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl)
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
lemma_2-2-2
,
Used by units in proved state:
can-refines-traceprop
,
beh
,
Proof exists?: No