![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > fprodaddrecnncnvlem | Structured version Visualization version GIF version |
Description: The sequence 𝑆 of finite products, where every factor is added an "always smaller" amount, converges to the finite product of the factors. (Contributed by Glauco Siliprandi, 8-Apr-2021.) |
Ref | Expression |
---|---|
fprodaddrecnncnvlem.k | ⊢ Ⅎ𝑘𝜑 |
fprodaddrecnncnvlem.a | ⊢ (𝜑 → 𝐴 ∈ Fin) |
fprodaddrecnncnvlem.b | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
fprodaddrecnncnvlem.s | ⊢ 𝑆 = (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛))) |
fprodaddrecnncnvlem.f | ⊢ 𝐹 = (𝑥 ∈ ℂ ↦ ∏𝑘 ∈ 𝐴 (𝐵 + 𝑥)) |
fprodaddrecnncnvlem.g | ⊢ 𝐺 = (𝑛 ∈ ℕ ↦ (1 / 𝑛)) |
Ref | Expression |
---|---|
fprodaddrecnncnvlem | ⊢ (𝜑 → 𝑆 ⇝ ∏𝑘 ∈ 𝐴 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nnuz 12946 | . . 3 ⊢ ℕ = (ℤ≥‘1) | |
2 | 1zzd 12674 | . . 3 ⊢ (𝜑 → 1 ∈ ℤ) | |
3 | fprodaddrecnncnvlem.k | . . . 4 ⊢ Ⅎ𝑘𝜑 | |
4 | fprodaddrecnncnvlem.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
5 | fprodaddrecnncnvlem.b | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) | |
6 | fprodaddrecnncnvlem.f | . . . 4 ⊢ 𝐹 = (𝑥 ∈ ℂ ↦ ∏𝑘 ∈ 𝐴 (𝐵 + 𝑥)) | |
7 | 3, 4, 5, 6 | fprodadd2cncf 45827 | . . 3 ⊢ (𝜑 → 𝐹 ∈ (ℂ–cn→ℂ)) |
8 | 1rp 13061 | . . . . . . . 8 ⊢ 1 ∈ ℝ+ | |
9 | 8 | a1i 11 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 1 ∈ ℝ+) |
10 | nnrp 13068 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℝ+) | |
11 | 9, 10 | rpdivcld 13116 | . . . . . 6 ⊢ (𝑛 ∈ ℕ → (1 / 𝑛) ∈ ℝ+) |
12 | 11 | rpcnd 13101 | . . . . 5 ⊢ (𝑛 ∈ ℕ → (1 / 𝑛) ∈ ℂ) |
13 | 12 | adantl 481 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1 / 𝑛) ∈ ℂ) |
14 | fprodaddrecnncnvlem.g | . . . 4 ⊢ 𝐺 = (𝑛 ∈ ℕ ↦ (1 / 𝑛)) | |
15 | 13, 14 | fmptd 7148 | . . 3 ⊢ (𝜑 → 𝐺:ℕ⟶ℂ) |
16 | 1cnd 11285 | . . . . 5 ⊢ (𝜑 → 1 ∈ ℂ) | |
17 | divcnv 15901 | . . . . 5 ⊢ (1 ∈ ℂ → (𝑛 ∈ ℕ ↦ (1 / 𝑛)) ⇝ 0) | |
18 | 16, 17 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ (1 / 𝑛)) ⇝ 0) |
19 | 14 | a1i 11 | . . . . 5 ⊢ (𝜑 → 𝐺 = (𝑛 ∈ ℕ ↦ (1 / 𝑛))) |
20 | 19 | breq1d 5176 | . . . 4 ⊢ (𝜑 → (𝐺 ⇝ 0 ↔ (𝑛 ∈ ℕ ↦ (1 / 𝑛)) ⇝ 0)) |
21 | 18, 20 | mpbird 257 | . . 3 ⊢ (𝜑 → 𝐺 ⇝ 0) |
22 | 0cnd 11283 | . . 3 ⊢ (𝜑 → 0 ∈ ℂ) | |
23 | 1, 2, 7, 15, 21, 22 | climcncf 24945 | . 2 ⊢ (𝜑 → (𝐹 ∘ 𝐺) ⇝ (𝐹‘0)) |
24 | nfv 1913 | . . . . . . . 8 ⊢ Ⅎ𝑘 𝑥 ∈ ℂ | |
25 | 3, 24 | nfan 1898 | . . . . . . 7 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑥 ∈ ℂ) |
26 | 4 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → 𝐴 ∈ Fin) |
27 | 5 | adantlr 714 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
28 | simplr 768 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑘 ∈ 𝐴) → 𝑥 ∈ ℂ) | |
29 | 27, 28 | addcld 11309 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑘 ∈ 𝐴) → (𝐵 + 𝑥) ∈ ℂ) |
30 | 25, 26, 29 | fprodclf 16040 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ∏𝑘 ∈ 𝐴 (𝐵 + 𝑥) ∈ ℂ) |
31 | 30, 6 | fmptd 7148 | . . . . 5 ⊢ (𝜑 → 𝐹:ℂ⟶ℂ) |
32 | fcompt 7167 | . . . . 5 ⊢ ((𝐹:ℂ⟶ℂ ∧ 𝐺:ℕ⟶ℂ) → (𝐹 ∘ 𝐺) = (𝑛 ∈ ℕ ↦ (𝐹‘(𝐺‘𝑛)))) | |
33 | 31, 15, 32 | syl2anc 583 | . . . 4 ⊢ (𝜑 → (𝐹 ∘ 𝐺) = (𝑛 ∈ ℕ ↦ (𝐹‘(𝐺‘𝑛)))) |
34 | fprodaddrecnncnvlem.s | . . . . . 6 ⊢ 𝑆 = (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛))) | |
35 | 34 | a1i 11 | . . . . 5 ⊢ (𝜑 → 𝑆 = (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛)))) |
36 | id 22 | . . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℕ) | |
37 | 14 | fvmpt2 7040 | . . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ ∧ (1 / 𝑛) ∈ ℂ) → (𝐺‘𝑛) = (1 / 𝑛)) |
38 | 36, 12, 37 | syl2anc 583 | . . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → (𝐺‘𝑛) = (1 / 𝑛)) |
39 | 38 | fveq2d 6924 | . . . . . . . 8 ⊢ (𝑛 ∈ ℕ → (𝐹‘(𝐺‘𝑛)) = (𝐹‘(1 / 𝑛))) |
40 | 39 | adantl 481 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘(𝐺‘𝑛)) = (𝐹‘(1 / 𝑛))) |
41 | oveq2 7456 | . . . . . . . . 9 ⊢ (𝑥 = (1 / 𝑛) → (𝐵 + 𝑥) = (𝐵 + (1 / 𝑛))) | |
42 | 41 | prodeq2ad 45513 | . . . . . . . 8 ⊢ (𝑥 = (1 / 𝑛) → ∏𝑘 ∈ 𝐴 (𝐵 + 𝑥) = ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛))) |
43 | prodex 15953 | . . . . . . . . 9 ⊢ ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛)) ∈ V | |
44 | 43 | a1i 11 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛)) ∈ V) |
45 | 6, 42, 13, 44 | fvmptd3 7052 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘(1 / 𝑛)) = ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛))) |
46 | 40, 45 | eqtr2d 2781 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛)) = (𝐹‘(𝐺‘𝑛))) |
47 | 46 | mpteq2dva 5266 | . . . . 5 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛))) = (𝑛 ∈ ℕ ↦ (𝐹‘(𝐺‘𝑛)))) |
48 | 35, 47 | eqtrd 2780 | . . . 4 ⊢ (𝜑 → 𝑆 = (𝑛 ∈ ℕ ↦ (𝐹‘(𝐺‘𝑛)))) |
49 | 33, 48 | eqtr4d 2783 | . . 3 ⊢ (𝜑 → (𝐹 ∘ 𝐺) = 𝑆) |
50 | 6 | a1i 11 | . . . 4 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ ℂ ↦ ∏𝑘 ∈ 𝐴 (𝐵 + 𝑥))) |
51 | nfv 1913 | . . . . . . 7 ⊢ Ⅎ𝑘 𝑥 = 0 | |
52 | 3, 51 | nfan 1898 | . . . . . 6 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑥 = 0) |
53 | oveq2 7456 | . . . . . . . . 9 ⊢ (𝑥 = 0 → (𝐵 + 𝑥) = (𝐵 + 0)) | |
54 | 53 | ad2antlr 726 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 0) ∧ 𝑘 ∈ 𝐴) → (𝐵 + 𝑥) = (𝐵 + 0)) |
55 | 5 | addridd 11490 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐵 + 0) = 𝐵) |
56 | 55 | adantlr 714 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 0) ∧ 𝑘 ∈ 𝐴) → (𝐵 + 0) = 𝐵) |
57 | 54, 56 | eqtrd 2780 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 = 0) ∧ 𝑘 ∈ 𝐴) → (𝐵 + 𝑥) = 𝐵) |
58 | 57 | ex 412 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 0) → (𝑘 ∈ 𝐴 → (𝐵 + 𝑥) = 𝐵)) |
59 | 52, 58 | ralrimi 3263 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 0) → ∀𝑘 ∈ 𝐴 (𝐵 + 𝑥) = 𝐵) |
60 | 59 | prodeq2d 15969 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 0) → ∏𝑘 ∈ 𝐴 (𝐵 + 𝑥) = ∏𝑘 ∈ 𝐴 𝐵) |
61 | prodex 15953 | . . . . 5 ⊢ ∏𝑘 ∈ 𝐴 𝐵 ∈ V | |
62 | 61 | a1i 11 | . . . 4 ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 ∈ V) |
63 | 50, 60, 22, 62 | fvmptd 7036 | . . 3 ⊢ (𝜑 → (𝐹‘0) = ∏𝑘 ∈ 𝐴 𝐵) |
64 | 49, 63 | breq12d 5179 | . 2 ⊢ (𝜑 → ((𝐹 ∘ 𝐺) ⇝ (𝐹‘0) ↔ 𝑆 ⇝ ∏𝑘 ∈ 𝐴 𝐵)) |
65 | 23, 64 | mpbid 232 | 1 ⊢ (𝜑 → 𝑆 ⇝ ∏𝑘 ∈ 𝐴 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 Ⅎwnf 1781 ∈ wcel 2108 Vcvv 3488 class class class wbr 5166 ↦ cmpt 5249 ∘ ccom 5704 ⟶wf 6569 ‘cfv 6573 (class class class)co 7448 Fincfn 9003 ℂcc 11182 0cc0 11184 1c1 11185 + caddc 11187 / cdiv 11947 ℕcn 12293 ℝ+crp 13057 ⇝ cli 15530 ∏cprod 15951 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-inf2 9710 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 ax-pre-sup 11262 ax-addf 11263 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-tp 4653 df-op 4655 df-uni 4932 df-int 4971 df-iun 5017 df-iin 5018 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-se 5653 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-isom 6582 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-of 7714 df-om 7904 df-1st 8030 df-2nd 8031 df-supp 8202 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-1o 8522 df-2o 8523 df-er 8763 df-map 8886 df-pm 8887 df-ixp 8956 df-en 9004 df-dom 9005 df-sdom 9006 df-fin 9007 df-fsupp 9432 df-fi 9480 df-sup 9511 df-inf 9512 df-oi 9579 df-card 10008 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-div 11948 df-nn 12294 df-2 12356 df-3 12357 df-4 12358 df-5 12359 df-6 12360 df-7 12361 df-8 12362 df-9 12363 df-n0 12554 df-z 12640 df-dec 12759 df-uz 12904 df-q 13014 df-rp 13058 df-xneg 13175 df-xadd 13176 df-xmul 13177 df-icc 13414 df-fz 13568 df-fzo 13712 df-fl 13843 df-seq 14053 df-exp 14113 df-hash 14380 df-cj 15148 df-re 15149 df-im 15150 df-sqrt 15284 df-abs 15285 df-clim 15534 df-rlim 15535 df-prod 15952 df-struct 17194 df-sets 17211 df-slot 17229 df-ndx 17241 df-base 17259 df-ress 17288 df-plusg 17324 df-mulr 17325 df-starv 17326 df-sca 17327 df-vsca 17328 df-ip 17329 df-tset 17330 df-ple 17331 df-ds 17333 df-unif 17334 df-hom 17335 df-cco 17336 df-rest 17482 df-topn 17483 df-0g 17501 df-gsum 17502 df-topgen 17503 df-pt 17504 df-prds 17507 df-xrs 17562 df-qtop 17567 df-imas 17568 df-xps 17570 df-mre 17644 df-mrc 17645 df-acs 17647 df-mgm 18678 df-sgrp 18757 df-mnd 18773 df-submnd 18819 df-mulg 19108 df-cntz 19357 df-cmn 19824 df-psmet 21379 df-xmet 21380 df-met 21381 df-bl 21382 df-mopn 21383 df-cnfld 21388 df-top 22921 df-topon 22938 df-topsp 22960 df-bases 22974 df-cn 23256 df-cnp 23257 df-tx 23591 df-hmeo 23784 df-xms 24351 df-ms 24352 df-tms 24353 df-cncf 24923 |
This theorem is referenced by: fprodaddrecnncnv 45831 |
Copyright terms: Public domain | W3C validator |