[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 infinite-append-lem
⊦ ∀ n. ∃ nf, ii. ii(0) = 0 ∧ (∀ m. m < n → ii(m + 1) = ii(m) + # lf(m) ∧ (nf from ii(m)) to # lf(m) = lf(m) ∧ (∀ m0. m0 ≤ m → ii(m0) ≤ ii(m)))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
infinite-append
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 23
Proof steps: 59
Used lemmas:
Used spec theorems:
stream
/
from-nf
list-del
/
extension
Used simplifier rules:
nat-basic1
/
zero-01
nat-basic2
/
succ
nat
/
eq-01
nat
/
lels-02
nat
/
ls-02
nat
/
ls-01
nat-basic1
/
one-01
nat
/
elim-pred-c
nat-basic2
/
l-01
nat
/
elim-sub
nat
/
lep
nat-basic2
/
l
nat-basic2
/
oz
nat-basic2
/
s
list-data
/
l
nat-basic1
/
ref-1
nat
/
ler
nat-basic2
/
eq
nat-basic2
/
eq-01
nat-basic1
/
lf-02
nat-basic2
/
l-05
nat-basic2
/
l-02
nat-basic2
/
l-06
nat
/
le-ls-simp
nat
/
fle
nat
/
let
stream
/
get-from-inf
stream
/
get-infto
nat
/
lels
stream
/
size-inf-to
nat
/
fle-01
nat-basic1
/
f
nat
/
lels-01
nat
/
succ-01
nat-basic1
/
ls-02
nat-basic2
/
a
nat-basic2
/
c
nat
/
ls-le-simp