![]() |
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 12012 | . . 3 ⊢ ℕ = (ℤ≥‘1) | |
2 | 1zzd 11743 | . . 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 40908 | . . 3 ⊢ (𝜑 → 𝐹 ∈ (ℂ–cn→ℂ)) |
8 | 1rp 12123 | . . . . . . . 8 ⊢ 1 ∈ ℝ+ | |
9 | 8 | a1i 11 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 1 ∈ ℝ+) |
10 | nnrp 12132 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℝ+) | |
11 | 9, 10 | rpdivcld 12180 | . . . . . 6 ⊢ (𝑛 ∈ ℕ → (1 / 𝑛) ∈ ℝ+) |
12 | 11 | rpcnd 12165 | . . . . 5 ⊢ (𝑛 ∈ ℕ → (1 / 𝑛) ∈ ℂ) |
13 | 12 | adantl 475 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1 / 𝑛) ∈ ℂ) |
14 | fprodsubrecnncnvlem.g | . . . 4 ⊢ 𝐺 = (𝑛 ∈ ℕ ↦ (1 / 𝑛)) | |
15 | 13, 14 | fmptd 6638 | . . 3 ⊢ (𝜑 → 𝐺:ℕ⟶ℂ) |
16 | 1cnd 10358 | . . . . 5 ⊢ (𝜑 → 1 ∈ ℂ) | |
17 | divcnv 14966 | . . . . 5 ⊢ (1 ∈ ℂ → (𝑛 ∈ ℕ ↦ (1 / 𝑛)) ⇝ 0) | |
18 | 16, 17 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ (1 / 𝑛)) ⇝ 0) |
19 | 14 | a1i 11 | . . . . 5 ⊢ (𝜑 → 𝐺 = (𝑛 ∈ ℕ ↦ (1 / 𝑛))) |
20 | 19 | breq1d 4885 | . . . 4 ⊢ (𝜑 → (𝐺 ⇝ 0 ↔ (𝑛 ∈ ℕ ↦ (1 / 𝑛)) ⇝ 0)) |
21 | 18, 20 | mpbird 249 | . . 3 ⊢ (𝜑 → 𝐺 ⇝ 0) |
22 | 0cnd 10356 | . . 3 ⊢ (𝜑 → 0 ∈ ℂ) | |
23 | 1, 2, 7, 15, 21, 22 | climcncf 23080 | . 2 ⊢ (𝜑 → (𝐹 ∘ 𝐺) ⇝ (𝐹‘0)) |
24 | nfv 2013 | . . . . . . . 8 ⊢ Ⅎ𝑘 𝑥 ∈ ℂ | |
25 | 3, 24 | nfan 2002 | . . . . . . 7 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑥 ∈ ℂ) |
26 | 4 | adantr 474 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → 𝐴 ∈ Fin) |
27 | 5 | adantlr 706 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
28 | simplr 785 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑘 ∈ 𝐴) → 𝑥 ∈ ℂ) | |
29 | 27, 28 | subcld 10720 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑘 ∈ 𝐴) → (𝐵 − 𝑥) ∈ ℂ) |
30 | 25, 26, 29 | fprodclf 15102 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ∏𝑘 ∈ 𝐴 (𝐵 − 𝑥) ∈ ℂ) |
31 | 30, 6 | fmptd 6638 | . . . . 5 ⊢ (𝜑 → 𝐹:ℂ⟶ℂ) |
32 | fcompt 6655 | . . . . 5 ⊢ ((𝐹:ℂ⟶ℂ ∧ 𝐺:ℕ⟶ℂ) → (𝐹 ∘ 𝐺) = (𝑛 ∈ ℕ ↦ (𝐹‘(𝐺‘𝑛)))) | |
33 | 31, 15, 32 | syl2anc 579 | . . . 4 ⊢ (𝜑 → (𝐹 ∘ 𝐺) = (𝑛 ∈ ℕ ↦ (𝐹‘(𝐺‘𝑛)))) |
34 | fprodsubrecnncnvlem.s | . . . . . 6 ⊢ 𝑆 = (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝐴 (𝐵 − (1 / 𝑛))) | |
35 | 34 | a1i 11 | . . . . 5 ⊢ (𝜑 → 𝑆 = (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝐴 (𝐵 − (1 / 𝑛)))) |
36 | id 22 | . . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℕ) | |
37 | 14 | fvmpt2 6543 | . . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ ∧ (1 / 𝑛) ∈ ℂ) → (𝐺‘𝑛) = (1 / 𝑛)) |
38 | 36, 12, 37 | syl2anc 579 | . . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → (𝐺‘𝑛) = (1 / 𝑛)) |
39 | 38 | fveq2d 6441 | . . . . . . . 8 ⊢ (𝑛 ∈ ℕ → (𝐹‘(𝐺‘𝑛)) = (𝐹‘(1 / 𝑛))) |
40 | 39 | adantl 475 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘(𝐺‘𝑛)) = (𝐹‘(1 / 𝑛))) |
41 | oveq2 6918 | . . . . . . . . 9 ⊢ (𝑥 = (1 / 𝑛) → (𝐵 − 𝑥) = (𝐵 − (1 / 𝑛))) | |
42 | 41 | prodeq2ad 40613 | . . . . . . . 8 ⊢ (𝑥 = (1 / 𝑛) → ∏𝑘 ∈ 𝐴 (𝐵 − 𝑥) = ∏𝑘 ∈ 𝐴 (𝐵 − (1 / 𝑛))) |
43 | prodex 15017 | . . . . . . . . 9 ⊢ ∏𝑘 ∈ 𝐴 (𝐵 − (1 / 𝑛)) ∈ V | |
44 | 43 | a1i 11 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∏𝑘 ∈ 𝐴 (𝐵 − (1 / 𝑛)) ∈ V) |
45 | 6, 42, 13, 44 | fvmptd3 6555 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘(1 / 𝑛)) = ∏𝑘 ∈ 𝐴 (𝐵 − (1 / 𝑛))) |
46 | 40, 45 | eqtr2d 2862 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∏𝑘 ∈ 𝐴 (𝐵 − (1 / 𝑛)) = (𝐹‘(𝐺‘𝑛))) |
47 | 46 | mpteq2dva 4969 | . . . . 5 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ ∏𝑘 ∈ 𝐴 (𝐵 − (1 / 𝑛))) = (𝑛 ∈ ℕ ↦ (𝐹‘(𝐺‘𝑛)))) |
48 | 35, 47 | eqtrd 2861 | . . . 4 ⊢ (𝜑 → 𝑆 = (𝑛 ∈ ℕ ↦ (𝐹‘(𝐺‘𝑛)))) |
49 | 33, 48 | eqtr4d 2864 | . . 3 ⊢ (𝜑 → (𝐹 ∘ 𝐺) = 𝑆) |
50 | 6 | a1i 11 | . . . 4 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ ℂ ↦ ∏𝑘 ∈ 𝐴 (𝐵 − 𝑥))) |
51 | nfv 2013 | . . . . . . 7 ⊢ Ⅎ𝑘 𝑥 = 0 | |
52 | 3, 51 | nfan 2002 | . . . . . 6 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑥 = 0) |
53 | oveq2 6918 | . . . . . . . . 9 ⊢ (𝑥 = 0 → (𝐵 − 𝑥) = (𝐵 − 0)) | |
54 | 53 | ad2antlr 718 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 0) ∧ 𝑘 ∈ 𝐴) → (𝐵 − 𝑥) = (𝐵 − 0)) |
55 | 5 | subid1d 10709 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐵 − 0) = 𝐵) |
56 | 55 | adantlr 706 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 0) ∧ 𝑘 ∈ 𝐴) → (𝐵 − 0) = 𝐵) |
57 | 54, 56 | eqtrd 2861 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 = 0) ∧ 𝑘 ∈ 𝐴) → (𝐵 − 𝑥) = 𝐵) |
58 | 57 | ex 403 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 0) → (𝑘 ∈ 𝐴 → (𝐵 − 𝑥) = 𝐵)) |
59 | 52, 58 | ralrimi 3166 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 0) → ∀𝑘 ∈ 𝐴 (𝐵 − 𝑥) = 𝐵) |
60 | 59 | prodeq2d 15032 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 0) → ∏𝑘 ∈ 𝐴 (𝐵 − 𝑥) = ∏𝑘 ∈ 𝐴 𝐵) |
61 | prodex 15017 | . . . . 5 ⊢ ∏𝑘 ∈ 𝐴 𝐵 ∈ V | |
62 | 61 | a1i 11 | . . . 4 ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 ∈ V) |
63 | 50, 60, 22, 62 | fvmptd 6539 | . . 3 ⊢ (𝜑 → (𝐹‘0) = ∏𝑘 ∈ 𝐴 𝐵) |
64 | 49, 63 | breq12d 4888 | . 2 ⊢ (𝜑 → ((𝐹 ∘ 𝐺) ⇝ (𝐹‘0) ↔ 𝑆 ⇝ ∏𝑘 ∈ 𝐴 𝐵)) |
65 | 23, 64 | mpbid 224 | 1 ⊢ (𝜑 → 𝑆 ⇝ ∏𝑘 ∈ 𝐴 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 386 = wceq 1656 Ⅎwnf 1882 ∈ wcel 2164 Vcvv 3414 class class class wbr 4875 ↦ cmpt 4954 ∘ ccom 5350 ⟶wf 6123 ‘cfv 6127 (class class class)co 6910 Fincfn 8228 ℂcc 10257 0cc0 10259 1c1 10260 − cmin 10592 / cdiv 11016 ℕcn 11357 ℝ+crp 12119 ⇝ cli 14599 ∏cprod 15015 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1894 ax-4 1908 ax-5 2009 ax-6 2075 ax-7 2112 ax-8 2166 ax-9 2173 ax-10 2192 ax-11 2207 ax-12 2220 ax-13 2389 ax-ext 2803 ax-rep 4996 ax-sep 5007 ax-nul 5015 ax-pow 5067 ax-pr 5129 ax-un 7214 ax-inf2 8822 ax-cnex 10315 ax-resscn 10316 ax-1cn 10317 ax-icn 10318 ax-addcl 10319 ax-addrcl 10320 ax-mulcl 10321 ax-mulrcl 10322 ax-mulcom 10323 ax-addass 10324 ax-mulass 10325 ax-distr 10326 ax-i2m1 10327 ax-1ne0 10328 ax-1rid 10329 ax-rnegex 10330 ax-rrecex 10331 ax-cnre 10332 ax-pre-lttri 10333 ax-pre-lttrn 10334 ax-pre-ltadd 10335 ax-pre-mulgt0 10336 ax-pre-sup 10337 ax-mulf 10339 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 879 df-3or 1112 df-3an 1113 df-tru 1660 df-fal 1670 df-ex 1879 df-nf 1883 df-sb 2068 df-mo 2605 df-eu 2640 df-clab 2812 df-cleq 2818 df-clel 2821 df-nfc 2958 df-ne 3000 df-nel 3103 df-ral 3122 df-rex 3123 df-reu 3124 df-rmo 3125 df-rab 3126 df-v 3416 df-sbc 3663 df-csb 3758 df-dif 3801 df-un 3803 df-in 3805 df-ss 3812 df-pss 3814 df-nul 4147 df-if 4309 df-pw 4382 df-sn 4400 df-pr 4402 df-tp 4404 df-op 4406 df-uni 4661 df-int 4700 df-iun 4744 df-iin 4745 df-br 4876 df-opab 4938 df-mpt 4955 df-tr 4978 df-id 5252 df-eprel 5257 df-po 5265 df-so 5266 df-fr 5305 df-se 5306 df-we 5307 df-xp 5352 df-rel 5353 df-cnv 5354 df-co 5355 df-dm 5356 df-rn 5357 df-res 5358 df-ima 5359 df-pred 5924 df-ord 5970 df-on 5971 df-lim 5972 df-suc 5973 df-iota 6090 df-fun 6129 df-fn 6130 df-f 6131 df-f1 6132 df-fo 6133 df-f1o 6134 df-fv 6135 df-isom 6136 df-riota 6871 df-ov 6913 df-oprab 6914 df-mpt2 6915 df-of 7162 df-om 7332 df-1st 7433 df-2nd 7434 df-supp 7565 df-wrecs 7677 df-recs 7739 df-rdg 7777 df-1o 7831 df-2o 7832 df-oadd 7835 df-er 8014 df-map 8129 df-pm 8130 df-ixp 8182 df-en 8229 df-dom 8230 df-sdom 8231 df-fin 8232 df-fsupp 8551 df-fi 8592 df-sup 8623 df-inf 8624 df-oi 8691 df-card 9085 df-cda 9312 df-pnf 10400 df-mnf 10401 df-xr 10402 df-ltxr 10403 df-le 10404 df-sub 10594 df-neg 10595 df-div 11017 df-nn 11358 df-2 11421 df-3 11422 df-4 11423 df-5 11424 df-6 11425 df-7 11426 df-8 11427 df-9 11428 df-n0 11626 df-z 11712 df-dec 11829 df-uz 11976 df-q 12079 df-rp 12120 df-xneg 12239 df-xadd 12240 df-xmul 12241 df-icc 12477 df-fz 12627 df-fzo 12768 df-fl 12895 df-seq 13103 df-exp 13162 df-hash 13418 df-cj 14223 df-re 14224 df-im 14225 df-sqrt 14359 df-abs 14360 df-clim 14603 df-rlim 14604 df-prod 15016 df-struct 16231 df-ndx 16232 df-slot 16233 df-base 16235 df-sets 16236 df-ress 16237 df-plusg 16325 df-mulr 16326 df-starv 16327 df-sca 16328 df-vsca 16329 df-ip 16330 df-tset 16331 df-ple 16332 df-ds 16334 df-unif 16335 df-hom 16336 df-cco 16337 df-rest 16443 df-topn 16444 df-0g 16462 df-gsum 16463 df-topgen 16464 df-pt 16465 df-prds 16468 df-xrs 16522 df-qtop 16527 df-imas 16528 df-xps 16530 df-mre 16606 df-mrc 16607 df-acs 16609 df-mgm 17602 df-sgrp 17644 df-mnd 17655 df-submnd 17696 df-mulg 17902 df-cntz 18107 df-cmn 18555 df-psmet 20105 df-xmet 20106 df-met 20107 df-bl 20108 df-mopn 20109 df-cnfld 20114 df-top 21076 df-topon 21093 df-topsp 21115 df-bases 21128 df-cn 21409 df-cnp 21410 df-tx 21743 df-hmeo 21936 df-xms 22502 df-ms 22503 df-tms 22504 df-cncf 23058 |
This theorem is referenced by: fprodsubrecnncnv 40911 |
Copyright terms: Public domain | W3C validator |