[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 lemma_2-2-2
⊦ fin(IOAut(startf, stepf)) → (∀ β. ∃ sl. ∀ s. after(IOAut(startf, stepf))(β, s) ↔ s ∈ sl)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 15
Proof steps: 34
Used lemmas:
lemma_2-2-2-aux
,
after
,
finiteinvisiblenondet
,
Used spec theorems:
Used simplifier rules:
IOtrace
/
fragstar
IOtrace
/
exec
IOtrace
/
execstar
stream-basic
/actionstream/
test-02
stream-basic
/actionstream/
stream-fin-forward
list
/IOstatestream/
in-empty
remtau
/
trace-fin