[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-3b
⊦ forest(IOAut(startf, stepf)) → (∀ s. ∃ β. after(IOAut(startf, stepf))(β, s))
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: 4
Proof steps: 9
Used lemmas:
after
,
forest
,
Used spec theorems:
Used simplifier rules:
stream-basic
/actionstream/
test-02
stream-basic
/actionstream/
stream-fin-forward
stream
/IOstatestream/
sel-fin
IOtrace
/
exec
IOtrace
/
execstar
stream-basic
/IOstatestream/
sel-02