psercn2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > psercn2		Structured version Visualization version GIF version

Theorem psercn2 25582

Description: Since by pserulm 25581 the series converges uniformly, it is also continuous by ulmcn 25558. (Contributed by Mario Carneiro, 3-Mar-2015.)

**Hypotheses**
Ref	Expression
pserf.g	⊢ 𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ₀ ↦ ((𝐴‘𝑛) · (𝑥↑𝑛))))
pserf.f	⊢ 𝐹 = (𝑦 ∈ 𝑆 ↦ Σ𝑗 ∈ ℕ₀ ((𝐺‘𝑦)‘𝑗))
pserf.a	⊢ (𝜑 → 𝐴:ℕ₀⟶ℂ)
pserf.r	⊢ 𝑅 = sup({𝑟 ∈ ℝ ∣ seq0( + , (𝐺‘𝑟)) ∈ dom ⇝ }, ℝ^*, < )
pserulm.h	⊢ 𝐻 = (𝑖 ∈ ℕ₀ ↦ (𝑦 ∈ 𝑆 ↦ (seq0( + , (𝐺‘𝑦))‘𝑖)))
pserulm.m	⊢ (𝜑 → 𝑀 ∈ ℝ)
pserulm.l	⊢ (𝜑 → 𝑀 < 𝑅)
pserulm.y	⊢ (𝜑 → 𝑆 ⊆ (^◡abs “ (0[,]𝑀)))

**Assertion**
Ref	Expression
psercn2	⊢ (𝜑 → 𝐹 ∈ (𝑆–cn→ℂ))

Distinct variable groups: 𝑗,𝑛,𝑟,𝑥,𝑦,𝐴 𝑖,𝑗,𝑦,𝐻 𝑖,𝑀,𝑗,𝑦 𝑥,𝑖,𝑟 𝑖,𝐺,𝑗,𝑟,𝑦 𝑆,𝑖,𝑗,𝑦 𝜑,𝑖,𝑗,𝑦 Allowed substitution hints: 𝜑(𝑥,𝑛,𝑟) 𝐴(𝑖) 𝑅(𝑥,𝑦,𝑖,𝑗,𝑛,𝑟) 𝑆(𝑥,𝑛,𝑟) 𝐹(𝑥,𝑦,𝑖,𝑗,𝑛,𝑟) 𝐺(𝑥,𝑛) 𝐻(𝑥,𝑛,𝑟) 𝑀(𝑥,𝑛,𝑟)

Proof of Theorem psercn2 Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nn0uz 12620	. 2 ⊢ ℕ₀ = (ℤ_≥‘0)
2		0zd 12331	. 2 ⊢ (𝜑 → 0 ∈ ℤ)
3		pserulm.y	. . . . . . 7 ⊢ (𝜑 → 𝑆 ⊆ (^◡abs “ (0[,]𝑀)))
4		cnvimass 5989	. . . . . . . 8 ⊢ (^◡abs “ (0[,]𝑀)) ⊆ dom abs
5		absf 15049	. . . . . . . . 9 ⊢ abs:ℂ⟶ℝ
6	5	fdmi 6612	. . . . . . . 8 ⊢ dom abs = ℂ
7	4, 6	sseqtri 3957	. . . . . . 7 ⊢ (^◡abs “ (0[,]𝑀)) ⊆ ℂ
8	3, 7	sstrdi 3933	. . . . . 6 ⊢ (𝜑 → 𝑆 ⊆ ℂ)
9	8	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → 𝑆 ⊆ ℂ)
10	9	resmptd 5948	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → ((𝑦 ∈ ℂ ↦ (seq0( + , (𝐺‘𝑦))‘𝑖)) ↾ 𝑆) = (𝑦 ∈ 𝑆 ↦ (seq0( + , (𝐺‘𝑦))‘𝑖)))
11		simplr 766	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑖 ∈ ℕ₀) ∧ 𝑦 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑖)) → 𝑦 ∈ ℂ)
12		elfznn0 13349	. . . . . . . . . 10 ⊢ (𝑘 ∈ (0...𝑖) → 𝑘 ∈ ℕ₀)
13	12	adantl 482	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑖 ∈ ℕ₀) ∧ 𝑦 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑖)) → 𝑘 ∈ ℕ₀)
14		pserf.g	. . . . . . . . . 10 ⊢ 𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ₀ ↦ ((𝐴‘𝑛) · (𝑥↑𝑛))))
15	14	pserval2 25570	. . . . . . . . 9 ⊢ ((𝑦 ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → ((𝐺‘𝑦)‘𝑘) = ((𝐴‘𝑘) · (𝑦↑𝑘)))
16	11, 13, 15	syl2anc 584	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑖 ∈ ℕ₀) ∧ 𝑦 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑖)) → ((𝐺‘𝑦)‘𝑘) = ((𝐴‘𝑘) · (𝑦↑𝑘)))
17		simpr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → 𝑖 ∈ ℕ₀)
18	17, 1	eleqtrdi 2849	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → 𝑖 ∈ (ℤ_≥‘0))
19	18	adantr 481	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ₀) ∧ 𝑦 ∈ ℂ) → 𝑖 ∈ (ℤ_≥‘0))
20		pserf.a	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴:ℕ₀⟶ℂ)
21	20	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → 𝐴:ℕ₀⟶ℂ)
22	21	ffvelrnda 6961	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ₀) ∧ 𝑘 ∈ ℕ₀) → (𝐴‘𝑘) ∈ ℂ)
23	22	adantlr 712	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑖 ∈ ℕ₀) ∧ 𝑦 ∈ ℂ) ∧ 𝑘 ∈ ℕ₀) → (𝐴‘𝑘) ∈ ℂ)
24		expcl 13800	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → (𝑦↑𝑘) ∈ ℂ)
25	24	adantll 711	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑖 ∈ ℕ₀) ∧ 𝑦 ∈ ℂ) ∧ 𝑘 ∈ ℕ₀) → (𝑦↑𝑘) ∈ ℂ)
26	23, 25	mulcld 10995	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑖 ∈ ℕ₀) ∧ 𝑦 ∈ ℂ) ∧ 𝑘 ∈ ℕ₀) → ((𝐴‘𝑘) · (𝑦↑𝑘)) ∈ ℂ)
27	12, 26	sylan2 593	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑖 ∈ ℕ₀) ∧ 𝑦 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑖)) → ((𝐴‘𝑘) · (𝑦↑𝑘)) ∈ ℂ)
28	16, 19, 27	fsumser 15442	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ₀) ∧ 𝑦 ∈ ℂ) → Σ𝑘 ∈ (0...𝑖)((𝐴‘𝑘) · (𝑦↑𝑘)) = (seq0( + , (𝐺‘𝑦))‘𝑖))
29	28	mpteq2dva 5174	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → (𝑦 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑖)((𝐴‘𝑘) · (𝑦↑𝑘))) = (𝑦 ∈ ℂ ↦ (seq0( + , (𝐺‘𝑦))‘𝑖)))
30		eqid 2738	. . . . . . . 8 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
31	30	cnfldtopon 23946	. . . . . . . . 9 ⊢ (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ)
32	31	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ))
33		fzfid 13693	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → (0...𝑖) ∈ Fin)
34	31	a1i 11	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ₀) ∧ 𝑘 ∈ (0...𝑖)) → (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ))
35		ffvelrn 6959	. . . . . . . . . . 11 ⊢ ((𝐴:ℕ₀⟶ℂ ∧ 𝑘 ∈ ℕ₀) → (𝐴‘𝑘) ∈ ℂ)
36	21, 12, 35	syl2an 596	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ₀) ∧ 𝑘 ∈ (0...𝑖)) → (𝐴‘𝑘) ∈ ℂ)
37	34, 34, 36	cnmptc 22813	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ₀) ∧ 𝑘 ∈ (0...𝑖)) → (𝑦 ∈ ℂ ↦ (𝐴‘𝑘)) ∈ ((TopOpen‘ℂ_fld) Cn (TopOpen‘ℂ_fld)))
38	12	adantl 482	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ₀) ∧ 𝑘 ∈ (0...𝑖)) → 𝑘 ∈ ℕ₀)
39	30	expcn 24035	. . . . . . . . . 10 ⊢ (𝑘 ∈ ℕ₀ → (𝑦 ∈ ℂ ↦ (𝑦↑𝑘)) ∈ ((TopOpen‘ℂ_fld) Cn (TopOpen‘ℂ_fld)))
40	38, 39	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ₀) ∧ 𝑘 ∈ (0...𝑖)) → (𝑦 ∈ ℂ ↦ (𝑦↑𝑘)) ∈ ((TopOpen‘ℂ_fld) Cn (TopOpen‘ℂ_fld)))
41	30	mulcn 24030	. . . . . . . . . 10 ⊢ · ∈ (((TopOpen‘ℂ_fld) ×_t (TopOpen‘ℂ_fld)) Cn (TopOpen‘ℂ_fld))
42	41	a1i 11	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ₀) ∧ 𝑘 ∈ (0...𝑖)) → · ∈ (((TopOpen‘ℂ_fld) ×_t (TopOpen‘ℂ_fld)) Cn (TopOpen‘ℂ_fld)))
43	34, 37, 40, 42	cnmpt12f 22817	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ₀) ∧ 𝑘 ∈ (0...𝑖)) → (𝑦 ∈ ℂ ↦ ((𝐴‘𝑘) · (𝑦↑𝑘))) ∈ ((TopOpen‘ℂ_fld) Cn (TopOpen‘ℂ_fld)))
44	30, 32, 33, 43	fsumcn 24033	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → (𝑦 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑖)((𝐴‘𝑘) · (𝑦↑𝑘))) ∈ ((TopOpen‘ℂ_fld) Cn (TopOpen‘ℂ_fld)))
45	30	cncfcn1 24074	. . . . . . 7 ⊢ (ℂ–cn→ℂ) = ((TopOpen‘ℂ_fld) Cn (TopOpen‘ℂ_fld))
46	44, 45	eleqtrrdi 2850	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → (𝑦 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑖)((𝐴‘𝑘) · (𝑦↑𝑘))) ∈ (ℂ–cn→ℂ))
47	29, 46	eqeltrrd 2840	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → (𝑦 ∈ ℂ ↦ (seq0( + , (𝐺‘𝑦))‘𝑖)) ∈ (ℂ–cn→ℂ))
48		rescncf 24060	. . . . 5 ⊢ (𝑆 ⊆ ℂ → ((𝑦 ∈ ℂ ↦ (seq0( + , (𝐺‘𝑦))‘𝑖)) ∈ (ℂ–cn→ℂ) → ((𝑦 ∈ ℂ ↦ (seq0( + , (𝐺‘𝑦))‘𝑖)) ↾ 𝑆) ∈ (𝑆–cn→ℂ)))
49	9, 47, 48	sylc 65	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → ((𝑦 ∈ ℂ ↦ (seq0( + , (𝐺‘𝑦))‘𝑖)) ↾ 𝑆) ∈ (𝑆–cn→ℂ))
50	10, 49	eqeltrrd 2840	. . 3 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → (𝑦 ∈ 𝑆 ↦ (seq0( + , (𝐺‘𝑦))‘𝑖)) ∈ (𝑆–cn→ℂ))
51		pserulm.h	. . 3 ⊢ 𝐻 = (𝑖 ∈ ℕ₀ ↦ (𝑦 ∈ 𝑆 ↦ (seq0( + , (𝐺‘𝑦))‘𝑖)))
52	50, 51	fmptd 6988	. 2 ⊢ (𝜑 → 𝐻:ℕ₀⟶(𝑆–cn→ℂ))
53		pserf.f	. . 3 ⊢ 𝐹 = (𝑦 ∈ 𝑆 ↦ Σ𝑗 ∈ ℕ₀ ((𝐺‘𝑦)‘𝑗))
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 25581	. 2 ⊢ (𝜑 → 𝐻(⇝_𝑢‘𝑆)𝐹)
58	1, 2, 52, 57	ulmcn 25558	1 ⊢ (𝜑 → 𝐹 ∈ (𝑆–cn→ℂ))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 {crab 3068 ⊆ wss 3887 class class class wbr 5074 ↦ cmpt 5157 ^◡ccnv 5588 dom cdm 5589 ↾ cres 5591 “ cima 5592 ⟶wf 6429 ‘cfv 6433 (class class class)co 7275 supcsup 9199 ℂcc 10869 ℝcr 10870 0cc0 10871 + caddc 10874 · cmul 10876 ℝ^*cxr 11008 < clt 11009 ℕ₀cn0 12233 ℤ_≥cuz 12582 [,]cicc 13082 ...cfz 13239 seqcseq 13721 ↑cexp 13782 abscabs 14945 ⇝ cli 15193 Σcsu 15397 TopOpenctopn 17132 ℂ_fldccnfld 20597 TopOnctopon 22059 Cn ccn 22375 ×_t ctx 22711 –cn→ccncf 24039

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-inf2 9399 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 ax-pre-sup 10949 ax-addf 10950 ax-mulf 10951

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-iin 4927 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-se 5545 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-isom 6442 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-of 7533 df-om 7713 df-1st 7831 df-2nd 7832 df-supp 7978 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-2o 8298 df-er 8498 df-map 8617 df-pm 8618 df-ixp 8686 df-en 8734 df-dom 8735 df-sdom 8736 df-fin 8737 df-fsupp 9129 df-fi 9170 df-sup 9201 df-inf 9202 df-oi 9269 df-card 9697 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-div 11633 df-nn 11974 df-2 12036 df-3 12037 df-4 12038 df-5 12039 df-6 12040 df-7 12041 df-8 12042 df-9 12043 df-n0 12234 df-z 12320 df-dec 12438 df-uz 12583 df-q 12689 df-rp 12731 df-xneg 12848 df-xadd 12849 df-xmul 12850 df-ico 13085 df-icc 13086 df-fz 13240 df-fzo 13383 df-fl 13512 df-seq 13722 df-exp 13783 df-hash 14045 df-cj 14810 df-re 14811 df-im 14812 df-sqrt 14946 df-abs 14947 df-limsup 15180 df-clim 15197 df-rlim 15198 df-sum 15398 df-struct 16848 df-sets 16865 df-slot 16883 df-ndx 16895 df-base 16913 df-ress 16942 df-plusg 16975 df-mulr 16976 df-starv 16977 df-sca 16978 df-vsca 16979 df-ip 16980 df-tset 16981 df-ple 16982 df-ds 16984 df-unif 16985 df-hom 16986 df-cco 16987 df-rest 17133 df-topn 17134 df-0g 17152 df-gsum 17153 df-topgen 17154 df-pt 17155 df-prds 17158 df-xrs 17213 df-qtop 17218 df-imas 17219 df-xps 17221 df-mre 17295 df-mrc 17296 df-acs 17298 df-mgm 18326 df-sgrp 18375 df-mnd 18386 df-submnd 18431 df-mulg 18701 df-cntz 18923 df-cmn 19388 df-psmet 20589 df-xmet 20590 df-met 20591 df-bl 20592 df-mopn 20593 df-cnfld 20598 df-top 22043 df-topon 22060 df-topsp 22082 df-bases 22096 df-cn 22378 df-cnp 22379 df-tx 22713 df-hmeo 22906 df-xms 23473 df-ms 23474 df-tms 23475 df-cncf 24041 df-ulm 25536

This theorem is referenced by: psercn 25585

W3C validator