[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 lim-allprefixes
⊦ lim(⌜λ n. ⌜nf.take(n)⌝ ⌝ ) = ⌜nf⌝
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: 11
Proof steps: 17
Used lemmas:
mon-allprefixes
,
lim-def
,
Used spec theorems:
list-last
/
prefix
list-getput
/
extension
stream
/
prefix-def
stream
/
add-list-fun-def
Used simplifier rules:
stream
/
prefix-bothfin-listprefix
stream
/
sel-inf
nat-inf
/
less-inf2
stream
/
size-inf
stream
/
fun-nonempty
stream
/
to-fin
nat-inf
/
less-fin
stream
/
size-fin
stream-basic
/
disj-rqui-rqui0
list
/
len
stream
/
size-inf-to
list
/
a
nat-basic
/
eq-02
nat-basic
/
z-01
nat-basic
/
a
nat-basic
/
c
stream
/
to-inf
nat-inf
/
less-inf1
stream-basic
/
inj-rqui0
stream-basic
/
sel-rqui0-dotf
stream
/
infapp-embed
stream-basic
/
elim-finp-suc
stream
/
append-assoc
stream
/
append-fin-is-inf
nat-basic
/
s-04
stream
/
get-infto
nat-basic
/
refl-Nat