[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 to-addone
⊦ ⌜m + 1⌝ < # α → (ext !(α.take(m)) + ext !(α[m] ') = ext !(α.take(m + 1)) ↔ true)
Type: A user defined theorem
Validity: The proof is valid.
Features: lss, ss,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 8
Used lemmas:
finremtau-append
,
Used spec theorems:
stream
/
get-append-notls
stream
/
hd-selzero
Used simplifier rules:
nat-basic
/
c
nat-basic
/
a
nat-inf
/
add-fin
nat-inf
/
ls-trans
nat-inf
/
ls-natinf-to-nat-2-1
nat-basic
/
l-02
nat-inf
/
add-assoc
nat-inf
/
add-comm
stream
/
elim-fromto
nat-inf
/
add-not-less
stream
/
append-assoc
stream
/
size-fin
stream
/
size-append
stream
/
size-empty-equiv
nat-inf
/
onels-neqzero
nat-inf
/
add-ls-cancel-01
list
/
a
list
/
len-01
stream
/
append-to-addsize-01
stream
/
get-append-ls
stream
/
sel-fin
nat-inf
/
less-fin
nat-basic
/
refl-Nat
nat
/
ler
nat
/
lels
nat
/
zero
nat-inf
/
sel-rqui-dotn
stream
/
cons-append
stream
/
toone-cons
stream
/
elim-hd-tl