[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 fin-frag
frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s0, a. stepf(s, a, s0))))(σ, β), ⌜n⌝ < # σ, ∀ a, s. ¬ stepf(σ[n], a, s) ⊦ β ^ = (β to n)^
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
IO-IOplus-equiv-aux
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 17
Proof steps: 42
Used lemmas:
Used spec theorems:
remtau
/
remtau-tofin-strong
IOtrace
/
frag
Used simplifier rules:
nat-basic
/
succ
nat-inf
/
less-succ-leq
nat-inf
/
add-assoc
nat-inf
/
add-comm
nat
/
le-ls-simp
nat
/
lels
stream
/IOstatestream/
zero-len
remtau
/
remtau-empty
stream
/actionstream/
to-zero
stream
/actionstream/
zero-len
nat
/
lez-01
nat-basic
/
c
nat-basic
/
a
nat-inf
/
add-fin
nat-basic
/
l-02
nat-inf
/
ls-natinf-to-nat-2-1
nat-inf
/
lsle-trans
nat-basic
/
ref
nat-basic
/
s-04
nat
/
lep-02
nat-basic
/
oz
nat-basic
/
lf-01
nat-basic
/
f
nat
/
eqle-one
nat
/
les
nat
/
le-def
nat-inf
/
eqls-succ