[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 cont-rel-thm
⊦ pcont(lift(alp))(f) ∧ mon(⌜λ n. ⌜alf(n)⌝ ⌝ ) ∧ (∀ n. alp(alf(n))) ∧ lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )) ∧ pfxclosed(alp) → lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) = f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ ))
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: 23
Used lemmas:
lift-pred-inf
,
pfxclosed-def
,
pfxclosedl-def
,
lift-pred-fin
,
mon-relative-def
,
cont-relative-def
,
cont-relative-thm
,
Used spec theorems:
stream
/
prefix-def
Used simplifier rules:
stream
/
prefix-bothfin-listprefix
stream
/
elim-fromto-inf
stream
/
infapp-embed
stream
/
append-assoc
stream
/
appinf-sel
stream
/
append-split-fin
stream
/
not-prefix-inf-fin
stream
/
prefix-inf-inf-equal