| 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 12919 | . . 3 ⊢ ℕ = (ℤ≥‘1) | |
| 2 | 1zzd 12642 | . . 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 46680 | . . 3 ⊢ (𝜑 → 𝐹 ∈ (ℂ–cn→ℂ)) |
| 8 | 1rp 13038 | . . . . . . . 8 ⊢ 1 ∈ ℝ+ | |
| 9 | 8 | a1i 11 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 1 ∈ ℝ+) |
| 10 | nnrp 13046 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℝ+) | |
| 11 | 9, 10 | rpdivcld 13095 | . . . . . 6 ⊢ (𝑛 ∈ ℕ → (1 / 𝑛) ∈ ℝ+) |
| 12 | 11 | rpcnd 13080 | . . . . 5 ⊢ (𝑛 ∈ ℕ → (1 / 𝑛) ∈ ℂ) |
| 13 | 12 | adantl 487 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1 / 𝑛) ∈ ℂ) |
| 14 | fprodaddrecnncnvlem.g | . . . 4 ⊢ 𝐺 = (𝑛 ∈ ℕ ↦ (1 / 𝑛)) | |
| 15 | 13, 14 | fmptd 7113 | . . 3 ⊢ (𝜑 → 𝐺:ℕ⟶ℂ) |
| 16 | 1cnd 11219 | . . . . 5 ⊢ (𝜑 → 1 ∈ ℂ) | |
| 17 | divcnv 15932 | . . . . 5 ⊢ (1 ∈ ℂ → (𝑛 ∈ ℕ ↦ (1 / 𝑛)) ⇝ 0) | |
| 18 | 16, 17 | syl 18 | . . . 4 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ (1 / 𝑛)) ⇝ 0) |
| 19 | 14 | a1i 11 | . . . . 5 ⊢ (𝜑 → 𝐺 = (𝑛 ∈ ℕ ↦ (1 / 𝑛))) |
| 20 | 19 | breq1d 5121 | . . . 4 ⊢ (𝜑 → (𝐺 ⇝ 0 ↔ (𝑛 ∈ ℕ ↦ (1 / 𝑛)) ⇝ 0)) |
| 21 | 18, 20 | mpbird 260 | . . 3 ⊢ (𝜑 → 𝐺 ⇝ 0) |
| 22 | 0cnd 11216 | . . 3 ⊢ (𝜑 → 0 ∈ ℂ) | |
| 23 | 1, 2, 7, 15, 21, 22 | climcncf 25112 | . 2 ⊢ (𝜑 → (𝐹 ∘ 𝐺) ⇝ (𝐹‘0)) |
| 24 | nfv 1947 | . . . . . . . 8 ⊢ Ⅎ𝑘 𝑥 ∈ ℂ | |
| 25 | 3, 24 | nfan 1932 | . . . . . . 7 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑥 ∈ ℂ) |
| 26 | 4 | adantr 486 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → 𝐴 ∈ Fin) |
| 27 | 5 | adantlr 728 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
| 28 | simplr 781 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑘 ∈ 𝐴) → 𝑥 ∈ ℂ) | |
| 29 | 27, 28 | addcld 11245 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑘 ∈ 𝐴) → (𝐵 + 𝑥) ∈ ℂ) |
| 30 | 25, 26, 29 | fprodclf 16071 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ∏𝑘 ∈ 𝐴 (𝐵 + 𝑥) ∈ ℂ) |
| 31 | 30, 6 | fmptd 7113 | . . . . 5 ⊢ (𝜑 → 𝐹:ℂ⟶ℂ) |
| 32 | fcompt 7133 | . . . . 5 ⊢ ((𝐹:ℂ⟶ℂ ∧ 𝐺:ℕ⟶ℂ) → (𝐹 ∘ 𝐺) = (𝑛 ∈ ℕ ↦ (𝐹‘(𝐺‘𝑛)))) | |
| 33 | 31, 15, 32 | syl2anc 596 | . . . 4 ⊢ (𝜑 → (𝐹 ∘ 𝐺) = (𝑛 ∈ ℕ ↦ (𝐹‘(𝐺‘𝑛)))) |
| 34 | fprodaddrecnncnvlem.s | . . . . . 6 ⊢ 𝑆 = (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛))) | |
| 35 | 34 | a1i 11 | . . . . 5 ⊢ (𝜑 → 𝑆 = (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛)))) |
| 36 | id 23 | . . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℕ) | |
| 37 | 14 | fvmpt2 7005 | . . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ ∧ (1 / 𝑛) ∈ ℂ) → (𝐺‘𝑛) = (1 / 𝑛)) |
| 38 | 36, 12, 37 | syl2anc 596 | . . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → (𝐺‘𝑛) = (1 / 𝑛)) |
| 39 | 38 | fveq2d 6889 | . . . . . . . 8 ⊢ (𝑛 ∈ ℕ → (𝐹‘(𝐺‘𝑛)) = (𝐹‘(1 / 𝑛))) |
| 40 | 39 | adantl 487 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘(𝐺‘𝑛)) = (𝐹‘(1 / 𝑛))) |
| 41 | oveq2 7427 | . . . . . . . . 9 ⊢ (𝑥 = (1 / 𝑛) → (𝐵 + 𝑥) = (𝐵 + (1 / 𝑛))) | |
| 42 | 41 | prodeq2ad 46368 | . . . . . . . 8 ⊢ (𝑥 = (1 / 𝑛) → ∏𝑘 ∈ 𝐴 (𝐵 + 𝑥) = ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛))) |
| 43 | prodex 15984 | . . . . . . . . 9 ⊢ ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛)) ∈ V | |
| 44 | 43 | a1i 11 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛)) ∈ V) |
| 45 | 6, 42, 13, 44 | fvmptd3 7017 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘(1 / 𝑛)) = ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛))) |
| 46 | 40, 45 | eqtr2d 2801 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛)) = (𝐹‘(𝐺‘𝑛))) |
| 47 | 46 | mpteq2dva 5206 | . . . . 5 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝐴 (𝐵 + (1 / 𝑛))) = (𝑛 ∈ ℕ ↦ (𝐹‘(𝐺‘𝑛)))) |
| 48 | 35, 47 | eqtrd 2800 | . . . 4 ⊢ (𝜑 → 𝑆 = (𝑛 ∈ ℕ ↦ (𝐹‘(𝐺‘𝑛)))) |
| 49 | 33, 48 | eqtr4d 2803 | . . 3 ⊢ (𝜑 → (𝐹 ∘ 𝐺) = 𝑆) |
| 50 | 6 | a1i 11 | . . . 4 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ ℂ ↦ ∏𝑘 ∈ 𝐴 (𝐵 + 𝑥))) |
| 51 | nfv 1947 | . . . . . . 7 ⊢ Ⅎ𝑘 𝑥 = 0 | |
| 52 | 3, 51 | nfan 1932 | . . . . . 6 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑥 = 0) |
| 53 | oveq2 7427 | . . . . . . . . 9 ⊢ (𝑥 = 0 → (𝐵 + 𝑥) = (𝐵 + 0)) | |
| 54 | 53 | ad2antlr 740 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 0) ∧ 𝑘 ∈ 𝐴) → (𝐵 + 𝑥) = (𝐵 + 0)) |
| 55 | 5 | addridd 11427 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐵 + 0) = 𝐵) |
| 56 | 55 | adantlr 728 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 0) ∧ 𝑘 ∈ 𝐴) → (𝐵 + 0) = 𝐵) |
| 57 | 54, 56 | eqtrd 2800 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 = 0) ∧ 𝑘 ∈ 𝐴) → (𝐵 + 𝑥) = 𝐵) |
| 58 | 57 | ex 418 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 0) → (𝑘 ∈ 𝐴 → (𝐵 + 𝑥) = 𝐵)) |
| 59 | 52, 58 | ralrimi 3265 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 0) → ∀𝑘 ∈ 𝐴 (𝐵 + 𝑥) = 𝐵) |
| 60 | 59 | prodeq2d 16000 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 0) → ∏𝑘 ∈ 𝐴 (𝐵 + 𝑥) = ∏𝑘 ∈ 𝐴 𝐵) |
| 61 | prodex 15984 | . . . . 5 ⊢ ∏𝑘 ∈ 𝐴 𝐵 ∈ V | |
| 62 | 61 | a1i 11 | . . . 4 ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 ∈ V) |
| 63 | 50, 60, 22, 62 | fvmptd 7001 | . . 3 ⊢ (𝜑 → (𝐹‘0) = ∏𝑘 ∈ 𝐴 𝐵) |
| 64 | 49, 63 | breq12d 5124 | . 2 ⊢ (𝜑 → ((𝐹 ∘ 𝐺) ⇝ (𝐹‘0) ↔ 𝑆 ⇝ ∏𝑘 ∈ 𝐴 𝐵)) |
| 65 | 23, 64 | mpbid 235 | 1 ⊢ (𝜑 → 𝑆 ⇝ ∏𝑘 ∈ 𝐴 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 Ⅎwnf 1816 ∈ wcel 2146 Vcvv 3457 class class class wbr 5111 ↦ cmpt 5194 ∘ ccom 5667 ⟶wf 6536 ‘cfv 6540 (class class class)co 7419 Fincfn 8949 ℂcc 11115 0cc0 11117 1c1 11118 + caddc 11120 / cdiv 11888 ℕcn 12250 ℝ+crp 13034 ⇝ cli 15561 ∏cprod 15982 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-inf2 9617 ax-cnex 11173 ax-resscn 11174 ax-1cn 11175 ax-icn 11176 ax-addcl 11177 ax-addrcl 11178 ax-mulcl 11179 ax-mulrcl 11180 ax-mulcom 11181 ax-addass 11182 ax-mulass 11183 ax-distr 11184 ax-i2m1 11185 ax-1ne0 11186 ax-1rid 11187 ax-rnegex 11188 ax-rrecex 11189 ax-cnre 11190 ax-pre-lttri 11191 ax-pre-lttrn 11192 ax-pre-ltadd 11193 ax-pre-mulgt0 11194 ax-pre-sup 11195 ax-addf 11196 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-iin 4961 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-of 7684 df-om 7869 df-1st 7992 df-2nd 7993 df-supp 8163 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-2o 8460 df-er 8700 df-map 8832 df-pm 8833 df-ixp 8902 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-fsupp 9329 df-fi 9378 df-sup 9409 df-inf 9410 df-oi 9479 df-card 9941 df-pnf 11262 df-mnf 11263 df-xr 11264 df-ltxr 11265 df-le 11266 df-sub 11460 df-neg 11461 df-div 11889 df-nn 12251 df-2 12320 df-3 12321 df-4 12322 df-5 12323 df-6 12324 df-7 12325 df-8 12326 df-9 12327 df-n0 12522 df-z 12609 df-dec 12730 df-uz 12881 df-q 12991 df-rp 13035 df-xneg 13155 df-xadd 13156 df-xmul 13157 df-icc 13397 df-fz 13554 df-fzo 13702 df-fl 13845 df-seq 14058 df-exp 14118 df-hash 14387 df-cj 15176 df-re 15177 df-im 15178 df-sqrt 15312 df-abs 15313 df-clim 15565 df-rlim 15566 df-prod 15983 df-struct 17231 df-sets 17248 df-slot 17266 df-ndx 17278 df-base 17294 df-ress 17315 df-plusg 17347 df-mulr 17348 df-starv 17349 df-sca 17350 df-vsca 17351 df-ip 17352 df-tset 17353 df-ple 17354 df-ds 17356 df-unif 17357 df-hom 17358 df-cco 17359 df-rest 17499 df-topn 17500 df-0g 17518 df-gsum 17519 df-topgen 17520 df-pt 17521 df-prds 17524 df-xrs 17580 df-qtop 17585 df-imas 17586 df-xps 17588 df-mre 17662 df-mrc 17663 df-acs 17665 df-mgm 18722 df-sgrp 18811 df-mnd 18827 df-submnd 18881 df-mulg 19180 df-cntz 19433 df-cmn 19898 df-psmet 21566 df-xmet 21567 df-met 21568 df-bl 21569 df-mopn 21570 df-cnfld 21575 df-top 23103 df-topon 23120 df-topsp 23142 df-bases 23155 df-cn 23436 df-cnp 23437 df-tx 23772 df-hmeo 23965 df-xms 24530 df-ms 24531 df-tms 24532 df-cncf 25090 |
| This theorem is used by: fprodaddrecnncnv 46684 |
| Copyright terms: Public domain | W3C validator |