[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 allfragto-frag
# σ = # α + ⌜1⌝ , ∀ n. ¬ # α < ⌜n⌝ → frag*(IOAut(start, step, ext))(σ.take(n + 1), α.take(n)) ⊦ frag(IOAut(start, step, ext))(σ, α)
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: 6
Proof steps: 12
Used lemmas:
frag
,
Used spec theorems:
stream
/
size-to
Used simplifier rules:
nat-basic
/
succ
nat-basic
/
a
nat-basic
/
c
nat-inf
/
add-comm
nat-inf
/
add-assoc
stream
/
size-succ
nat-inf
/
add-fin
stream
/
sel-fin
stream
/
get-to
nat-basic
/
s-04
nat-inf
/
less-fin
nat-inf
/
less-succ-leq
stream
/
size-to
stream
/
size-to-02
nat-inf
/
eq-natinf-to-nat-2-1
nat-inf
/
num-add
nat-basic
/
refl-Nat
nat-basic
/
l-01
nat-basic
/
l
nat-inf
/
lsle-trans
nat-inf
/
lels-trans
nat-inf
/
ls-irref
nat-inf
/
add-ls-cancel-num-04