| 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 12788 | . . 3 ⊢ ℕ = (ℤ≥‘1) | |
| 2 | 1zzd 12520 | . . 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 46092 | . . 3 ⊢ (𝜑 → 𝐹 ∈ (ℂ–cn→ℂ)) |
| 8 | 1rp 12907 | . . . . . . . 8 ⊢ 1 ∈ ℝ+ | |
| 9 | 8 | a1i 11 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 1 ∈ ℝ+) |
| 10 | nnrp 12915 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℝ+) | |
| 11 | 9, 10 | rpdivcld 12964 | . . . . . 6 ⊢ (𝑛 ∈ ℕ → (1 / 𝑛) ∈ ℝ+) |
| 12 | 11 | rpcnd 12949 | . . . . 5 ⊢ (𝑛 ∈ ℕ → (1 / 𝑛) ∈ ℂ) |
| 13 | 12 | adantl 481 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1 / 𝑛) ∈ ℂ) |
| 14 | fprodaddrecnncnvlem.g | . . . 4 ⊢ 𝐺 = (𝑛 ∈ ℕ ↦ (1 / 𝑛)) | |
| 15 | 13, 14 | fmptd 7057 | . . 3 ⊢ (𝜑 → 𝐺:ℕ⟶ℂ) |
| 16 | 1cnd 11125 | . . . . 5 ⊢ (𝜑 → 1 ∈ ℂ) | |
| 17 | divcnv 15774 | . . . . 5 ⊢ (1 ∈ ℂ → (𝑛 ∈ ℕ ↦ (1 / 𝑛)) ⇝ 0) | |
| 18 | 16, 17 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ (1 / 𝑛)) ⇝ 0) |
| 19 | 14 | a1i 11 | . . . . 5 ⊢ (𝜑 → 𝐺 = (𝑛 ∈ ℕ ↦ (1 / 𝑛))) |
| 20 | 19 | breq1d 5106 | . . . 4 ⊢ (𝜑 → (𝐺 ⇝ 0 ↔ (𝑛 ∈ ℕ ↦ (1 / 𝑛)) ⇝ 0)) |
| 21 | 18, 20 | mpbird 257 | . . 3 ⊢ (𝜑 → 𝐺 ⇝ 0) |
| 22 | 0cnd 11123 | . . 3 ⊢ (𝜑 → 0 ∈ ℂ) | |
| 23 | 1, 2, 7, 15, 21, 22 | climcncf 24847 | . 2 ⊢ (𝜑 → (𝐹 ∘ 𝐺) ⇝ (𝐹‘0)) |
| 24 | nfv 1915 | . . . . . . . 8 ⊢ Ⅎ𝑘 𝑥 ∈ ℂ | |
| 25 | 3, 24 | nfan 1900 | . . . . . . 7 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑥 ∈ ℂ) |
| 26 | 4 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → 𝐴 ∈ Fin) |
| 27 | 5 | adantlr 715 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
| 28 | simplr 768 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑘 ∈ 𝐴) → 𝑥 ∈ ℂ) | |
| 29 | 27, 28 | addcld 11149 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑘 ∈ 𝐴) → (𝐵 + 𝑥) ∈ ℂ) |
| 30 | 25, 26, 29 | fprodclf 15913 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ∏𝑘 ∈ 𝐴 (𝐵 + 𝑥) ∈ ℂ) |
| 31 | 30, 6 | fmptd 7057 | . . . . 5 ⊢ (𝜑 → 𝐹:ℂ⟶ℂ) |
| 32 | fcompt 7076 | . . . . 5 ⊢ ((𝐹:ℂ⟶ℂ ∧ 𝐺:ℕ⟶ℂ) → (𝐹 ∘ 𝐺) = (𝑛 ∈ ℕ ↦ (𝐹‘(𝐺‘𝑛)))) | |
| 33 | 31, 15, 32 | syl2anc 584 | . . . 4 ⊢ (𝜑 → (𝐹 ∘ 𝐺) = (𝑛 ∈ ℕ ↦ (𝐹‘(𝐺‘𝑛)))) |
| 34 | fprodaddrecnncnvlem.s | . . . . . 6 ⊢ 𝑆 = (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛))) | |
| 35 | 34 | a1i 11 | . . . . 5 ⊢ (𝜑 → 𝑆 = (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛)))) |
| 36 | id 22 | . . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℕ) | |
| 37 | 14 | fvmpt2 6950 | . . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ ∧ (1 / 𝑛) ∈ ℂ) → (𝐺‘𝑛) = (1 / 𝑛)) |
| 38 | 36, 12, 37 | syl2anc 584 | . . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → (𝐺‘𝑛) = (1 / 𝑛)) |
| 39 | 38 | fveq2d 6836 | . . . . . . . 8 ⊢ (𝑛 ∈ ℕ → (𝐹‘(𝐺‘𝑛)) = (𝐹‘(1 / 𝑛))) |
| 40 | 39 | adantl 481 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘(𝐺‘𝑛)) = (𝐹‘(1 / 𝑛))) |
| 41 | oveq2 7364 | . . . . . . . . 9 ⊢ (𝑥 = (1 / 𝑛) → (𝐵 + 𝑥) = (𝐵 + (1 / 𝑛))) | |
| 42 | 41 | prodeq2ad 45780 | . . . . . . . 8 ⊢ (𝑥 = (1 / 𝑛) → ∏𝑘 ∈ 𝐴 (𝐵 + 𝑥) = ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛))) |
| 43 | prodex 15826 | . . . . . . . . 9 ⊢ ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛)) ∈ V | |
| 44 | 43 | a1i 11 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛)) ∈ V) |
| 45 | 6, 42, 13, 44 | fvmptd3 6962 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘(1 / 𝑛)) = ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛))) |
| 46 | 40, 45 | eqtr2d 2770 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛)) = (𝐹‘(𝐺‘𝑛))) |
| 47 | 46 | mpteq2dva 5189 | . . . . 5 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛))) = (𝑛 ∈ ℕ ↦ (𝐹‘(𝐺‘𝑛)))) |
| 48 | 35, 47 | eqtrd 2769 | . . . 4 ⊢ (𝜑 → 𝑆 = (𝑛 ∈ ℕ ↦ (𝐹‘(𝐺‘𝑛)))) |
| 49 | 33, 48 | eqtr4d 2772 | . . 3 ⊢ (𝜑 → (𝐹 ∘ 𝐺) = 𝑆) |
| 50 | 6 | a1i 11 | . . . 4 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ ℂ ↦ ∏𝑘 ∈ 𝐴 (𝐵 + 𝑥))) |
| 51 | nfv 1915 | . . . . . . 7 ⊢ Ⅎ𝑘 𝑥 = 0 | |
| 52 | 3, 51 | nfan 1900 | . . . . . 6 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑥 = 0) |
| 53 | oveq2 7364 | . . . . . . . . 9 ⊢ (𝑥 = 0 → (𝐵 + 𝑥) = (𝐵 + 0)) | |
| 54 | 53 | ad2antlr 727 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 0) ∧ 𝑘 ∈ 𝐴) → (𝐵 + 𝑥) = (𝐵 + 0)) |
| 55 | 5 | addridd 11331 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐵 + 0) = 𝐵) |
| 56 | 55 | adantlr 715 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 0) ∧ 𝑘 ∈ 𝐴) → (𝐵 + 0) = 𝐵) |
| 57 | 54, 56 | eqtrd 2769 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 = 0) ∧ 𝑘 ∈ 𝐴) → (𝐵 + 𝑥) = 𝐵) |
| 58 | 57 | ex 412 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 0) → (𝑘 ∈ 𝐴 → (𝐵 + 𝑥) = 𝐵)) |
| 59 | 52, 58 | ralrimi 3232 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 0) → ∀𝑘 ∈ 𝐴 (𝐵 + 𝑥) = 𝐵) |
| 60 | 59 | prodeq2d 15842 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 0) → ∏𝑘 ∈ 𝐴 (𝐵 + 𝑥) = ∏𝑘 ∈ 𝐴 𝐵) |
| 61 | prodex 15826 | . . . . 5 ⊢ ∏𝑘 ∈ 𝐴 𝐵 ∈ V | |
| 62 | 61 | a1i 11 | . . . 4 ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 ∈ V) |
| 63 | 50, 60, 22, 62 | fvmptd 6946 | . . 3 ⊢ (𝜑 → (𝐹‘0) = ∏𝑘 ∈ 𝐴 𝐵) |
| 64 | 49, 63 | breq12d 5109 | . 2 ⊢ (𝜑 → ((𝐹 ∘ 𝐺) ⇝ (𝐹‘0) ↔ 𝑆 ⇝ ∏𝑘 ∈ 𝐴 𝐵)) |
| 65 | 23, 64 | mpbid 232 | 1 ⊢ (𝜑 → 𝑆 ⇝ ∏𝑘 ∈ 𝐴 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 Ⅎwnf 1784 ∈ wcel 2113 Vcvv 3438 class class class wbr 5096 ↦ cmpt 5177 ∘ ccom 5626 ⟶wf 6486 ‘cfv 6490 (class class class)co 7356 Fincfn 8881 ℂcc 11022 0cc0 11024 1c1 11025 + caddc 11027 / cdiv 11792 ℕcn 12143 ℝ+crp 12903 ⇝ cli 15405 ∏cprod 15824 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-inf2 9548 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101 ax-pre-sup 11102 ax-addf 11103 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-tp 4583 df-op 4585 df-uni 4862 df-int 4901 df-iun 4946 df-iin 4947 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-se 5576 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-isom 6499 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-of 7620 df-om 7807 df-1st 7931 df-2nd 7932 df-supp 8101 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-2o 8396 df-er 8633 df-map 8763 df-pm 8764 df-ixp 8834 df-en 8882 df-dom 8883 df-sdom 8884 df-fin 8885 df-fsupp 9263 df-fi 9312 df-sup 9343 df-inf 9344 df-oi 9413 df-card 9849 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-div 11793 df-nn 12144 df-2 12206 df-3 12207 df-4 12208 df-5 12209 df-6 12210 df-7 12211 df-8 12212 df-9 12213 df-n0 12400 df-z 12487 df-dec 12606 df-uz 12750 df-q 12860 df-rp 12904 df-xneg 13024 df-xadd 13025 df-xmul 13026 df-icc 13266 df-fz 13422 df-fzo 13569 df-fl 13710 df-seq 13923 df-exp 13983 df-hash 14252 df-cj 15020 df-re 15021 df-im 15022 df-sqrt 15156 df-abs 15157 df-clim 15409 df-rlim 15410 df-prod 15825 df-struct 17072 df-sets 17089 df-slot 17107 df-ndx 17119 df-base 17135 df-ress 17156 df-plusg 17188 df-mulr 17189 df-starv 17190 df-sca 17191 df-vsca 17192 df-ip 17193 df-tset 17194 df-ple 17195 df-ds 17197 df-unif 17198 df-hom 17199 df-cco 17200 df-rest 17340 df-topn 17341 df-0g 17359 df-gsum 17360 df-topgen 17361 df-pt 17362 df-prds 17365 df-xrs 17421 df-qtop 17426 df-imas 17427 df-xps 17429 df-mre 17503 df-mrc 17504 df-acs 17506 df-mgm 18563 df-sgrp 18642 df-mnd 18658 df-submnd 18707 df-mulg 18996 df-cntz 19244 df-cmn 19709 df-psmet 21299 df-xmet 21300 df-met 21301 df-bl 21302 df-mopn 21303 df-cnfld 21308 df-top 22836 df-topon 22853 df-topsp 22875 df-bases 22888 df-cn 23169 df-cnp 23170 df-tx 23504 df-hmeo 23697 df-xms 24262 df-ms 24263 df-tms 24264 df-cncf 24825 |
| This theorem is referenced by: fprodaddrecnncnv 46096 |
| Copyright terms: Public domain | W3C validator |