[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-9-4
IOAut?(IOAut(startf, stepf)), fin(IOAut(startf, stepf)) ⊦ C_≤T_A(IOAut(startf, stepf), can(beh(IOAut(startf, stepf))))
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: 3
Proof steps: 7
Used lemmas:
lemma-2-8-3
,
Used spec theorems:
IOrefine-equiv-behrefine
/IOrefine-IO-ALIO/
lemma_2-5-3c
beh
/
lemma_2-5-1
Used simplifier rules:
IO-Automaton
/
isIOAut-def