[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-1b
IOAut?(IOAut(startf, stepf)) ⊦ forest(can(beh(IOAut(startf, stepf))), λ al. beh(IOAut(startf, stepf))(⌜al⌝ ))
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: 2
Proof steps: 3
Used lemmas:
Used spec theorems:
can
/
lemma-2-8-1-b
beh
/
lemma_2-5-1
Used simplifier rules: