[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(start, step, ext))(σ, α) ∧ ¬ # α < ⌜n⌝ → frag*(IOAut(start, step, ext))(σ.take(n + 1), α.take(n))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
frag-to-fin
,
frag-to-inf
,
Used by units in proved state:
weakfin-startfin-IObackward-INV-is-leqrefine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 7
Used lemmas:
fragstar
,
frag
,
Used spec theorems:
stream
/
size-to
Used simplifier rules:
nat-basic
/
succ
IO-Aut-data
/
sel-IOAut-dotstep
stream
/
get-to
stream
/
size-to
nat-basic
/
s-04
nat-basic
/
ls-02
nat-basic
/
l
nat-inf
/
add-fin
nat-basic
/
a
nat-basic
/
c
stream
/
size-succ
nat-inf
/
add-assoc
nat-inf
/
add-comm
nat-basic
/
f
nat-inf
/
lele-trans
nat-inf
/
less-fin
nat
/
lels
nat
/
ls-le-simp
nat-inf
/
eqsucc-ls
nat-inf
/
less-inf1
nat-inf
/
add-inf2
nat-inf
/
less-inf2