[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-aux
⊦ trace(IOAut(startf, stepf))(β) ↔ trace(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:
IO-IOplus-equiv
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 23
Proof steps: 48
Used lemmas:
fin-frag
,
Used spec theorems:
IOtrace
/
trace
IOtrace
/
frag
Used simplifier rules:
IOtrace
/
exec
nat-basic
/
succ
nat-inf
/
eqls-ls-notls
nat-inf
/
add-comm
nat-inf
/
add-assoc
stream
/IOstatestream/
get-to
stream
/IOstatestream/
size-succ
nat-basic
/
c
nat-basic
/
a
nat-inf
/
add-fin
nat-basic
/
oz
nat-basic
/
zero
nat-basic
/
f
nat-basic
/
l
stream
/actionstream/
get-to
nat-inf
/
ls-le
nat-basic
/
ls-02
nat-basic
/
s-04
nat-inf
/
less-fin
stream
/actionstream/
size-to
nat-inf
/
inj
nat-inf
/
add-all-zero
nat-inf
/
add-cancel-num-03
stream
/IOstatestream/
size-to
nat-inf
/
lsle-trans