Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > psercn2 | Structured version Visualization version GIF version |
Description: Since by pserulm 25013 the series converges uniformly, it is also continuous by ulmcn 24990. (Contributed by Mario Carneiro, 3-Mar-2015.) |
Ref | Expression |
---|---|
pserf.g | ⊢ 𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴‘𝑛) · (𝑥↑𝑛)))) |
pserf.f | ⊢ 𝐹 = (𝑦 ∈ 𝑆 ↦ Σ𝑗 ∈ ℕ0 ((𝐺‘𝑦)‘𝑗)) |
pserf.a | ⊢ (𝜑 → 𝐴:ℕ0⟶ℂ) |
pserf.r | ⊢ 𝑅 = sup({𝑟 ∈ ℝ ∣ seq0( + , (𝐺‘𝑟)) ∈ dom ⇝ }, ℝ*, < ) |
pserulm.h | ⊢ 𝐻 = (𝑖 ∈ ℕ0 ↦ (𝑦 ∈ 𝑆 ↦ (seq0( + , (𝐺‘𝑦))‘𝑖))) |
pserulm.m | ⊢ (𝜑 → 𝑀 ∈ ℝ) |
pserulm.l | ⊢ (𝜑 → 𝑀 < 𝑅) |
pserulm.y | ⊢ (𝜑 → 𝑆 ⊆ (◡abs “ (0[,]𝑀))) |
Ref | Expression |
---|---|
psercn2 | ⊢ (𝜑 → 𝐹 ∈ (𝑆–cn→ℂ)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nn0uz 12283 | . 2 ⊢ ℕ0 = (ℤ≥‘0) | |
2 | 0zd 11996 | . 2 ⊢ (𝜑 → 0 ∈ ℤ) | |
3 | pserulm.y | . . . . . . 7 ⊢ (𝜑 → 𝑆 ⊆ (◡abs “ (0[,]𝑀))) | |
4 | cnvimass 5952 | . . . . . . . 8 ⊢ (◡abs “ (0[,]𝑀)) ⊆ dom abs | |
5 | absf 14700 | . . . . . . . . 9 ⊢ abs:ℂ⟶ℝ | |
6 | 5 | fdmi 6527 | . . . . . . . 8 ⊢ dom abs = ℂ |
7 | 4, 6 | sseqtri 4006 | . . . . . . 7 ⊢ (◡abs “ (0[,]𝑀)) ⊆ ℂ |
8 | 3, 7 | sstrdi 3982 | . . . . . 6 ⊢ (𝜑 → 𝑆 ⊆ ℂ) |
9 | 8 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ0) → 𝑆 ⊆ ℂ) |
10 | 9 | resmptd 5911 | . . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ0) → ((𝑦 ∈ ℂ ↦ (seq0( + , (𝐺‘𝑦))‘𝑖)) ↾ 𝑆) = (𝑦 ∈ 𝑆 ↦ (seq0( + , (𝐺‘𝑦))‘𝑖))) |
11 | simplr 767 | . . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑖 ∈ ℕ0) ∧ 𝑦 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑖)) → 𝑦 ∈ ℂ) | |
12 | elfznn0 13003 | . . . . . . . . . 10 ⊢ (𝑘 ∈ (0...𝑖) → 𝑘 ∈ ℕ0) | |
13 | 12 | adantl 484 | . . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑖 ∈ ℕ0) ∧ 𝑦 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑖)) → 𝑘 ∈ ℕ0) |
14 | pserf.g | . . . . . . . . . 10 ⊢ 𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴‘𝑛) · (𝑥↑𝑛)))) | |
15 | 14 | pserval2 25002 | . . . . . . . . 9 ⊢ ((𝑦 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → ((𝐺‘𝑦)‘𝑘) = ((𝐴‘𝑘) · (𝑦↑𝑘))) |
16 | 11, 13, 15 | syl2anc 586 | . . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑖 ∈ ℕ0) ∧ 𝑦 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑖)) → ((𝐺‘𝑦)‘𝑘) = ((𝐴‘𝑘) · (𝑦↑𝑘))) |
17 | simpr 487 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ0) → 𝑖 ∈ ℕ0) | |
18 | 17, 1 | eleqtrdi 2926 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ0) → 𝑖 ∈ (ℤ≥‘0)) |
19 | 18 | adantr 483 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ0) ∧ 𝑦 ∈ ℂ) → 𝑖 ∈ (ℤ≥‘0)) |
20 | pserf.a | . . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴:ℕ0⟶ℂ) | |
21 | 20 | adantr 483 | . . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ0) → 𝐴:ℕ0⟶ℂ) |
22 | 21 | ffvelrnda 6854 | . . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ0) ∧ 𝑘 ∈ ℕ0) → (𝐴‘𝑘) ∈ ℂ) |
23 | 22 | adantlr 713 | . . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑖 ∈ ℕ0) ∧ 𝑦 ∈ ℂ) ∧ 𝑘 ∈ ℕ0) → (𝐴‘𝑘) ∈ ℂ) |
24 | expcl 13450 | . . . . . . . . . . 11 ⊢ ((𝑦 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (𝑦↑𝑘) ∈ ℂ) | |
25 | 24 | adantll 712 | . . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑖 ∈ ℕ0) ∧ 𝑦 ∈ ℂ) ∧ 𝑘 ∈ ℕ0) → (𝑦↑𝑘) ∈ ℂ) |
26 | 23, 25 | mulcld 10664 | . . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑖 ∈ ℕ0) ∧ 𝑦 ∈ ℂ) ∧ 𝑘 ∈ ℕ0) → ((𝐴‘𝑘) · (𝑦↑𝑘)) ∈ ℂ) |
27 | 12, 26 | sylan2 594 | . . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑖 ∈ ℕ0) ∧ 𝑦 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑖)) → ((𝐴‘𝑘) · (𝑦↑𝑘)) ∈ ℂ) |
28 | 16, 19, 27 | fsumser 15090 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ0) ∧ 𝑦 ∈ ℂ) → Σ𝑘 ∈ (0...𝑖)((𝐴‘𝑘) · (𝑦↑𝑘)) = (seq0( + , (𝐺‘𝑦))‘𝑖)) |
29 | 28 | mpteq2dva 5164 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ0) → (𝑦 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑖)((𝐴‘𝑘) · (𝑦↑𝑘))) = (𝑦 ∈ ℂ ↦ (seq0( + , (𝐺‘𝑦))‘𝑖))) |
30 | eqid 2824 | . . . . . . . 8 ⊢ (TopOpen‘ℂfld) = (TopOpen‘ℂfld) | |
31 | 30 | cnfldtopon 23394 | . . . . . . . . 9 ⊢ (TopOpen‘ℂfld) ∈ (TopOn‘ℂ) |
32 | 31 | a1i 11 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ0) → (TopOpen‘ℂfld) ∈ (TopOn‘ℂ)) |
33 | fzfid 13344 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ0) → (0...𝑖) ∈ Fin) | |
34 | 31 | a1i 11 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ0) ∧ 𝑘 ∈ (0...𝑖)) → (TopOpen‘ℂfld) ∈ (TopOn‘ℂ)) |
35 | ffvelrn 6852 | . . . . . . . . . . 11 ⊢ ((𝐴:ℕ0⟶ℂ ∧ 𝑘 ∈ ℕ0) → (𝐴‘𝑘) ∈ ℂ) | |
36 | 21, 12, 35 | syl2an 597 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ0) ∧ 𝑘 ∈ (0...𝑖)) → (𝐴‘𝑘) ∈ ℂ) |
37 | 34, 34, 36 | cnmptc 22273 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ0) ∧ 𝑘 ∈ (0...𝑖)) → (𝑦 ∈ ℂ ↦ (𝐴‘𝑘)) ∈ ((TopOpen‘ℂfld) Cn (TopOpen‘ℂfld))) |
38 | 12 | adantl 484 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ0) ∧ 𝑘 ∈ (0...𝑖)) → 𝑘 ∈ ℕ0) |
39 | 30 | expcn 23483 | . . . . . . . . . 10 ⊢ (𝑘 ∈ ℕ0 → (𝑦 ∈ ℂ ↦ (𝑦↑𝑘)) ∈ ((TopOpen‘ℂfld) Cn (TopOpen‘ℂfld))) |
40 | 38, 39 | syl 17 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ0) ∧ 𝑘 ∈ (0...𝑖)) → (𝑦 ∈ ℂ ↦ (𝑦↑𝑘)) ∈ ((TopOpen‘ℂfld) Cn (TopOpen‘ℂfld))) |
41 | 30 | mulcn 23478 | . . . . . . . . . 10 ⊢ · ∈ (((TopOpen‘ℂfld) ×t (TopOpen‘ℂfld)) Cn (TopOpen‘ℂfld)) |
42 | 41 | a1i 11 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ0) ∧ 𝑘 ∈ (0...𝑖)) → · ∈ (((TopOpen‘ℂfld) ×t (TopOpen‘ℂfld)) Cn (TopOpen‘ℂfld))) |
43 | 34, 37, 40, 42 | cnmpt12f 22277 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ0) ∧ 𝑘 ∈ (0...𝑖)) → (𝑦 ∈ ℂ ↦ ((𝐴‘𝑘) · (𝑦↑𝑘))) ∈ ((TopOpen‘ℂfld) Cn (TopOpen‘ℂfld))) |
44 | 30, 32, 33, 43 | fsumcn 23481 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ0) → (𝑦 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑖)((𝐴‘𝑘) · (𝑦↑𝑘))) ∈ ((TopOpen‘ℂfld) Cn (TopOpen‘ℂfld))) |
45 | 30 | cncfcn1 23521 | . . . . . . 7 ⊢ (ℂ–cn→ℂ) = ((TopOpen‘ℂfld) Cn (TopOpen‘ℂfld)) |
46 | 44, 45 | eleqtrrdi 2927 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ0) → (𝑦 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑖)((𝐴‘𝑘) · (𝑦↑𝑘))) ∈ (ℂ–cn→ℂ)) |
47 | 29, 46 | eqeltrrd 2917 | . . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ0) → (𝑦 ∈ ℂ ↦ (seq0( + , (𝐺‘𝑦))‘𝑖)) ∈ (ℂ–cn→ℂ)) |
48 | rescncf 23508 | . . . . 5 ⊢ (𝑆 ⊆ ℂ → ((𝑦 ∈ ℂ ↦ (seq0( + , (𝐺‘𝑦))‘𝑖)) ∈ (ℂ–cn→ℂ) → ((𝑦 ∈ ℂ ↦ (seq0( + , (𝐺‘𝑦))‘𝑖)) ↾ 𝑆) ∈ (𝑆–cn→ℂ))) | |
49 | 9, 47, 48 | sylc 65 | . . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ0) → ((𝑦 ∈ ℂ ↦ (seq0( + , (𝐺‘𝑦))‘𝑖)) ↾ 𝑆) ∈ (𝑆–cn→ℂ)) |
50 | 10, 49 | eqeltrrd 2917 | . . 3 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ0) → (𝑦 ∈ 𝑆 ↦ (seq0( + , (𝐺‘𝑦))‘𝑖)) ∈ (𝑆–cn→ℂ)) |
51 | pserulm.h | . . 3 ⊢ 𝐻 = (𝑖 ∈ ℕ0 ↦ (𝑦 ∈ 𝑆 ↦ (seq0( + , (𝐺‘𝑦))‘𝑖))) | |
52 | 50, 51 | fmptd 6881 | . 2 ⊢ (𝜑 → 𝐻:ℕ0⟶(𝑆–cn→ℂ)) |
53 | pserf.f | . . 3 ⊢ 𝐹 = (𝑦 ∈ 𝑆 ↦ Σ𝑗 ∈ ℕ0 ((𝐺‘𝑦)‘𝑗)) | |
54 | pserf.r | . . 3 ⊢ 𝑅 = sup({𝑟 ∈ ℝ ∣ seq0( + , (𝐺‘𝑟)) ∈ dom ⇝ }, ℝ*, < ) | |
55 | pserulm.m | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℝ) | |
56 | pserulm.l | . . 3 ⊢ (𝜑 → 𝑀 < 𝑅) | |
57 | 14, 53, 20, 54, 51, 55, 56, 3 | pserulm 25013 | . 2 ⊢ (𝜑 → 𝐻(⇝𝑢‘𝑆)𝐹) |
58 | 1, 2, 52, 57 | ulmcn 24990 | 1 ⊢ (𝜑 → 𝐹 ∈ (𝑆–cn→ℂ)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1536 ∈ wcel 2113 {crab 3145 ⊆ wss 3939 class class class wbr 5069 ↦ cmpt 5149 ◡ccnv 5557 dom cdm 5558 ↾ cres 5560 “ cima 5561 ⟶wf 6354 ‘cfv 6358 (class class class)co 7159 supcsup 8907 ℂcc 10538 ℝcr 10539 0cc0 10540 + caddc 10543 · cmul 10545 ℝ*cxr 10677 < clt 10678 ℕ0cn0 11900 ℤ≥cuz 12246 [,]cicc 12744 ...cfz 12895 seqcseq 13372 ↑cexp 13432 abscabs 14596 ⇝ cli 14844 Σcsu 15045 TopOpenctopn 16698 ℂfldccnfld 20548 TopOnctopon 21521 Cn ccn 21835 ×t ctx 22171 –cn→ccncf 23487 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-inf2 9107 ax-cnex 10596 ax-resscn 10597 ax-1cn 10598 ax-icn 10599 ax-addcl 10600 ax-addrcl 10601 ax-mulcl 10602 ax-mulrcl 10603 ax-mulcom 10604 ax-addass 10605 ax-mulass 10606 ax-distr 10607 ax-i2m1 10608 ax-1ne0 10609 ax-1rid 10610 ax-rnegex 10611 ax-rrecex 10612 ax-cnre 10613 ax-pre-lttri 10614 ax-pre-lttrn 10615 ax-pre-ltadd 10616 ax-pre-mulgt0 10617 ax-pre-sup 10618 ax-addf 10619 ax-mulf 10620 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-fal 1549 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-reu 3148 df-rmo 3149 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-int 4880 df-iun 4924 df-iin 4925 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-se 5518 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-isom 6367 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-of 7412 df-om 7584 df-1st 7692 df-2nd 7693 df-supp 7834 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-1o 8105 df-2o 8106 df-oadd 8109 df-er 8292 df-map 8411 df-pm 8412 df-ixp 8465 df-en 8513 df-dom 8514 df-sdom 8515 df-fin 8516 df-fsupp 8837 df-fi 8878 df-sup 8909 df-inf 8910 df-oi 8977 df-card 9371 df-pnf 10680 df-mnf 10681 df-xr 10682 df-ltxr 10683 df-le 10684 df-sub 10875 df-neg 10876 df-div 11301 df-nn 11642 df-2 11703 df-3 11704 df-4 11705 df-5 11706 df-6 11707 df-7 11708 df-8 11709 df-9 11710 df-n0 11901 df-z 11985 df-dec 12102 df-uz 12247 df-q 12352 df-rp 12393 df-xneg 12510 df-xadd 12511 df-xmul 12512 df-ico 12747 df-icc 12748 df-fz 12896 df-fzo 13037 df-fl 13165 df-seq 13373 df-exp 13433 df-hash 13694 df-cj 14461 df-re 14462 df-im 14463 df-sqrt 14597 df-abs 14598 df-limsup 14831 df-clim 14848 df-rlim 14849 df-sum 15046 df-struct 16488 df-ndx 16489 df-slot 16490 df-base 16492 df-sets 16493 df-ress 16494 df-plusg 16581 df-mulr 16582 df-starv 16583 df-sca 16584 df-vsca 16585 df-ip 16586 df-tset 16587 df-ple 16588 df-ds 16590 df-unif 16591 df-hom 16592 df-cco 16593 df-rest 16699 df-topn 16700 df-0g 16718 df-gsum 16719 df-topgen 16720 df-pt 16721 df-prds 16724 df-xrs 16778 df-qtop 16783 df-imas 16784 df-xps 16786 df-mre 16860 df-mrc 16861 df-acs 16863 df-mgm 17855 df-sgrp 17904 df-mnd 17915 df-submnd 17960 df-mulg 18228 df-cntz 18450 df-cmn 18911 df-psmet 20540 df-xmet 20541 df-met 20542 df-bl 20543 df-mopn 20544 df-cnfld 20549 df-top 21505 df-topon 21522 df-topsp 21544 df-bases 21557 df-cn 21838 df-cnp 21839 df-tx 22173 df-hmeo 22366 df-xms 22933 df-ms 22934 df-tms 22935 df-cncf 23489 df-ulm 24968 |
This theorem is referenced by: psercn 25017 |
Copyright terms: Public domain | W3C validator |