| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > fprodsubrecnncnvlem | Structured version Visualization version GIF version | ||
| Description: The sequence 𝑆 of finite products, where every factor is subtracted an "always smaller" amount, converges to the finite product of the factors. (Contributed by Glauco Siliprandi, 8-Apr-2021.) |
| Ref | Expression |
|---|---|
| fprodsubrecnncnvlem.k | ⊢ Ⅎ𝑘𝜑 |
| fprodsubrecnncnvlem.a | ⊢ (𝜑 → 𝐴 ∈ Fin) |
| fprodsubrecnncnvlem.b | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
| fprodsubrecnncnvlem.s | ⊢ 𝑆 = (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝐴 (𝐵 − (1 / 𝑛))) |
| fprodsubrecnncnvlem.f | ⊢ 𝐹 = (𝑥 ∈ ℂ ↦ ∏𝑘 ∈ 𝐴 (𝐵 − 𝑥)) |
| fprodsubrecnncnvlem.g | ⊢ 𝐺 = (𝑛 ∈ ℕ ↦ (1 / 𝑛)) |
| Ref | Expression |
|---|---|
| fprodsubrecnncnvlem | ⊢ (𝜑 → 𝑆 ⇝ ∏𝑘 ∈ 𝐴 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnuz 12836 | . . 3 ⊢ ℕ = (ℤ≥‘1) | |
| 2 | 1zzd 12564 | . . 3 ⊢ (𝜑 → 1 ∈ ℤ) | |
| 3 | fprodsubrecnncnvlem.k | . . . 4 ⊢ Ⅎ𝑘𝜑 | |
| 4 | fprodsubrecnncnvlem.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
| 5 | fprodsubrecnncnvlem.b | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) | |
| 6 | fprodsubrecnncnvlem.f | . . . 4 ⊢ 𝐹 = (𝑥 ∈ ℂ ↦ ∏𝑘 ∈ 𝐴 (𝐵 − 𝑥)) | |
| 7 | 3, 4, 5, 6 | fprodsub2cncf 45903 | . . 3 ⊢ (𝜑 → 𝐹 ∈ (ℂ–cn→ℂ)) |
| 8 | 1rp 12955 | . . . . . . . 8 ⊢ 1 ∈ ℝ+ | |
| 9 | 8 | a1i 11 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 1 ∈ ℝ+) |
| 10 | nnrp 12963 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℝ+) | |
| 11 | 9, 10 | rpdivcld 13012 | . . . . . 6 ⊢ (𝑛 ∈ ℕ → (1 / 𝑛) ∈ ℝ+) |
| 12 | 11 | rpcnd 12997 | . . . . 5 ⊢ (𝑛 ∈ ℕ → (1 / 𝑛) ∈ ℂ) |
| 13 | 12 | adantl 481 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1 / 𝑛) ∈ ℂ) |
| 14 | fprodsubrecnncnvlem.g | . . . 4 ⊢ 𝐺 = (𝑛 ∈ ℕ ↦ (1 / 𝑛)) | |
| 15 | 13, 14 | fmptd 7086 | . . 3 ⊢ (𝜑 → 𝐺:ℕ⟶ℂ) |
| 16 | 1cnd 11169 | . . . . 5 ⊢ (𝜑 → 1 ∈ ℂ) | |
| 17 | divcnv 15819 | . . . . 5 ⊢ (1 ∈ ℂ → (𝑛 ∈ ℕ ↦ (1 / 𝑛)) ⇝ 0) | |
| 18 | 16, 17 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ (1 / 𝑛)) ⇝ 0) |
| 19 | 14 | a1i 11 | . . . . 5 ⊢ (𝜑 → 𝐺 = (𝑛 ∈ ℕ ↦ (1 / 𝑛))) |
| 20 | 19 | breq1d 5117 | . . . 4 ⊢ (𝜑 → (𝐺 ⇝ 0 ↔ (𝑛 ∈ ℕ ↦ (1 / 𝑛)) ⇝ 0)) |
| 21 | 18, 20 | mpbird 257 | . . 3 ⊢ (𝜑 → 𝐺 ⇝ 0) |
| 22 | 0cnd 11167 | . . 3 ⊢ (𝜑 → 0 ∈ ℂ) | |
| 23 | 1, 2, 7, 15, 21, 22 | climcncf 24793 | . 2 ⊢ (𝜑 → (𝐹 ∘ 𝐺) ⇝ (𝐹‘0)) |
| 24 | nfv 1914 | . . . . . . . 8 ⊢ Ⅎ𝑘 𝑥 ∈ ℂ | |
| 25 | 3, 24 | nfan 1899 | . . . . . . 7 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑥 ∈ ℂ) |
| 26 | 4 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → 𝐴 ∈ Fin) |
| 27 | 5 | adantlr 715 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
| 28 | simplr 768 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑘 ∈ 𝐴) → 𝑥 ∈ ℂ) | |
| 29 | 27, 28 | subcld 11533 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑘 ∈ 𝐴) → (𝐵 − 𝑥) ∈ ℂ) |
| 30 | 25, 26, 29 | fprodclf 15958 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ∏𝑘 ∈ 𝐴 (𝐵 − 𝑥) ∈ ℂ) |
| 31 | 30, 6 | fmptd 7086 | . . . . 5 ⊢ (𝜑 → 𝐹:ℂ⟶ℂ) |
| 32 | fcompt 7105 | . . . . 5 ⊢ ((𝐹:ℂ⟶ℂ ∧ 𝐺:ℕ⟶ℂ) → (𝐹 ∘ 𝐺) = (𝑛 ∈ ℕ ↦ (𝐹‘(𝐺‘𝑛)))) | |
| 33 | 31, 15, 32 | syl2anc 584 | . . . 4 ⊢ (𝜑 → (𝐹 ∘ 𝐺) = (𝑛 ∈ ℕ ↦ (𝐹‘(𝐺‘𝑛)))) |
| 34 | fprodsubrecnncnvlem.s | . . . . . 6 ⊢ 𝑆 = (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝐴 (𝐵 − (1 / 𝑛))) | |
| 35 | 34 | a1i 11 | . . . . 5 ⊢ (𝜑 → 𝑆 = (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝐴 (𝐵 − (1 / 𝑛)))) |
| 36 | id 22 | . . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℕ) | |
| 37 | 14 | fvmpt2 6979 | . . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ ∧ (1 / 𝑛) ∈ ℂ) → (𝐺‘𝑛) = (1 / 𝑛)) |
| 38 | 36, 12, 37 | syl2anc 584 | . . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → (𝐺‘𝑛) = (1 / 𝑛)) |
| 39 | 38 | fveq2d 6862 | . . . . . . . 8 ⊢ (𝑛 ∈ ℕ → (𝐹‘(𝐺‘𝑛)) = (𝐹‘(1 / 𝑛))) |
| 40 | 39 | adantl 481 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘(𝐺‘𝑛)) = (𝐹‘(1 / 𝑛))) |
| 41 | oveq2 7395 | . . . . . . . . 9 ⊢ (𝑥 = (1 / 𝑛) → (𝐵 − 𝑥) = (𝐵 − (1 / 𝑛))) | |
| 42 | 41 | prodeq2ad 45590 | . . . . . . . 8 ⊢ (𝑥 = (1 / 𝑛) → ∏𝑘 ∈ 𝐴 (𝐵 − 𝑥) = ∏𝑘 ∈ 𝐴 (𝐵 − (1 / 𝑛))) |
| 43 | prodex 15871 | . . . . . . . . 9 ⊢ ∏𝑘 ∈ 𝐴 (𝐵 − (1 / 𝑛)) ∈ V | |
| 44 | 43 | a1i 11 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∏𝑘 ∈ 𝐴 (𝐵 − (1 / 𝑛)) ∈ V) |
| 45 | 6, 42, 13, 44 | fvmptd3 6991 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘(1 / 𝑛)) = ∏𝑘 ∈ 𝐴 (𝐵 − (1 / 𝑛))) |
| 46 | 40, 45 | eqtr2d 2765 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∏𝑘 ∈ 𝐴 (𝐵 − (1 / 𝑛)) = (𝐹‘(𝐺‘𝑛))) |
| 47 | 46 | mpteq2dva 5200 | . . . . 5 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝐴 (𝐵 − (1 / 𝑛))) = (𝑛 ∈ ℕ ↦ (𝐹‘(𝐺‘𝑛)))) |
| 48 | 35, 47 | eqtrd 2764 | . . . 4 ⊢ (𝜑 → 𝑆 = (𝑛 ∈ ℕ ↦ (𝐹‘(𝐺‘𝑛)))) |
| 49 | 33, 48 | eqtr4d 2767 | . . 3 ⊢ (𝜑 → (𝐹 ∘ 𝐺) = 𝑆) |
| 50 | 6 | a1i 11 | . . . 4 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ ℂ ↦ ∏𝑘 ∈ 𝐴 (𝐵 − 𝑥))) |
| 51 | nfv 1914 | . . . . . . 7 ⊢ Ⅎ𝑘 𝑥 = 0 | |
| 52 | 3, 51 | nfan 1899 | . . . . . 6 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑥 = 0) |
| 53 | oveq2 7395 | . . . . . . . . 9 ⊢ (𝑥 = 0 → (𝐵 − 𝑥) = (𝐵 − 0)) | |
| 54 | 53 | ad2antlr 727 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 0) ∧ 𝑘 ∈ 𝐴) → (𝐵 − 𝑥) = (𝐵 − 0)) |
| 55 | 5 | subid1d 11522 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐵 − 0) = 𝐵) |
| 56 | 55 | adantlr 715 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 0) ∧ 𝑘 ∈ 𝐴) → (𝐵 − 0) = 𝐵) |
| 57 | 54, 56 | eqtrd 2764 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 = 0) ∧ 𝑘 ∈ 𝐴) → (𝐵 − 𝑥) = 𝐵) |
| 58 | 57 | ex 412 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 0) → (𝑘 ∈ 𝐴 → (𝐵 − 𝑥) = 𝐵)) |
| 59 | 52, 58 | ralrimi 3235 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 0) → ∀𝑘 ∈ 𝐴 (𝐵 − 𝑥) = 𝐵) |
| 60 | 59 | prodeq2d 15887 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 0) → ∏𝑘 ∈ 𝐴 (𝐵 − 𝑥) = ∏𝑘 ∈ 𝐴 𝐵) |
| 61 | prodex 15871 | . . . . 5 ⊢ ∏𝑘 ∈ 𝐴 𝐵 ∈ V | |
| 62 | 61 | a1i 11 | . . . 4 ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 ∈ V) |
| 63 | 50, 60, 22, 62 | fvmptd 6975 | . . 3 ⊢ (𝜑 → (𝐹‘0) = ∏𝑘 ∈ 𝐴 𝐵) |
| 64 | 49, 63 | breq12d 5120 | . 2 ⊢ (𝜑 → ((𝐹 ∘ 𝐺) ⇝ (𝐹‘0) ↔ 𝑆 ⇝ ∏𝑘 ∈ 𝐴 𝐵)) |
| 65 | 23, 64 | mpbid 232 | 1 ⊢ (𝜑 → 𝑆 ⇝ ∏𝑘 ∈ 𝐴 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 Ⅎwnf 1783 ∈ wcel 2109 Vcvv 3447 class class class wbr 5107 ↦ cmpt 5188 ∘ ccom 5642 ⟶wf 6507 ‘cfv 6511 (class class class)co 7387 Fincfn 8918 ℂcc 11066 0cc0 11068 1c1 11069 − cmin 11405 / cdiv 11835 ℕcn 12186 ℝ+crp 12951 ⇝ cli 15450 ∏cprod 15869 |
| 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 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-inf2 9594 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 ax-pre-sup 11146 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-uni 4872 df-int 4911 df-iun 4957 df-iin 4958 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-se 5592 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-isom 6520 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-of 7653 df-om 7843 df-1st 7968 df-2nd 7969 df-supp 8140 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-1o 8434 df-2o 8435 df-er 8671 df-map 8801 df-pm 8802 df-ixp 8871 df-en 8919 df-dom 8920 df-sdom 8921 df-fin 8922 df-fsupp 9313 df-fi 9362 df-sup 9393 df-inf 9394 df-oi 9463 df-card 9892 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-div 11836 df-nn 12187 df-2 12249 df-3 12250 df-4 12251 df-5 12252 df-6 12253 df-7 12254 df-8 12255 df-9 12256 df-n0 12443 df-z 12530 df-dec 12650 df-uz 12794 df-q 12908 df-rp 12952 df-xneg 13072 df-xadd 13073 df-xmul 13074 df-icc 13313 df-fz 13469 df-fzo 13616 df-fl 13754 df-seq 13967 df-exp 14027 df-hash 14296 df-cj 15065 df-re 15066 df-im 15067 df-sqrt 15201 df-abs 15202 df-clim 15454 df-rlim 15455 df-prod 15870 df-struct 17117 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-ress 17201 df-plusg 17233 df-mulr 17234 df-starv 17235 df-sca 17236 df-vsca 17237 df-ip 17238 df-tset 17239 df-ple 17240 df-ds 17242 df-unif 17243 df-hom 17244 df-cco 17245 df-rest 17385 df-topn 17386 df-0g 17404 df-gsum 17405 df-topgen 17406 df-pt 17407 df-prds 17410 df-xrs 17465 df-qtop 17470 df-imas 17471 df-xps 17473 df-mre 17547 df-mrc 17548 df-acs 17550 df-mgm 18567 df-sgrp 18646 df-mnd 18662 df-submnd 18711 df-mulg 19000 df-cntz 19249 df-cmn 19712 df-psmet 21256 df-xmet 21257 df-met 21258 df-bl 21259 df-mopn 21260 df-cnfld 21265 df-top 22781 df-topon 22798 df-topsp 22820 df-bases 22833 df-cn 23114 df-cnp 23115 df-tx 23449 df-hmeo 23642 df-xms 24208 df-ms 24209 df-tms 24210 df-cncf 24771 |
| This theorem is referenced by: fprodsubrecnncnv 45906 |
| Copyright terms: Public domain | W3C validator |