[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 IO-IOplus-equiv
⊦ C_≡T_A(IOAut(startf, stepf), IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s0, a. stepf(s, a, s0))))
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:
IO-IOplus-equiv-aux
,
Used spec theorems:
IOrefine-def
/IOrefine-IO-IO/
equiv-def
Used simplifier rules: