[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 frag-to
⊦ frag(IOAut(startf, stepf))(σ, α) ∧ ¬ # α < ⌜n⌝ → frag*(IOAut(startf, stepf))(σ to n + 1, α to n)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
frag-to-1
,
frag-to-fin
,
Used by units in proved state:
can-refines-traceprop
,
restricted-refine-implies-forward
,
beh
,
IOrefine-def
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 12
Used lemmas:
frag
,
fragstar
,
Used spec theorems:
stream
/IOstatestream/
size-to
stream
/IOstatestream/
get-to
Used simplifier rules:
stream
/actionstream/
fin-to
nat-basic
/
succ
stream
/actionstream/
get-to
nat-inf
/
less-fin
stream
/actionstream/
size-to
nat-inf
/
add-fin
nat-basic
/
a
nat-basic
/
c
nat-inf
/
add-cancel-num-03
nat-inf
/
add-all-zero
nat-inf
/
inj
nat-inf
/
add-assoc
nat-inf
/
add-comm
stream
/IOstatestream/
size-succ
nat-inf
/
eqsucc-ls
nat-inf
/
lele-trans
nat-inf
/
add-inf2
nat-inf
/
less-inf1
stream
/IOstatestream/
size-to
nat-basic
/
f
nat-basic
/
s-04
nat-basic
/
ls-02
nat-basic
/
l
stream
/IOstatestream/
get-to
nat-inf
/
less-inf2
nat
/
lels
nat
/
ls-le-simp