![]() |
Mathbox for Steve Rodriguez |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > binomcxplemcvg | Structured version Visualization version GIF version |
Description: Lemma for binomcxp 43936. The sum in binomcxplemnn0 43928 and its derivative (see the next theorem, binomcxplemdvsum 43934) converge, as long as their base 𝐽 is within the disk of convergence. Part of remark "This convergence allows us to apply term-by-term differentiation..." in the Wikibooks proof. (Contributed by Steve Rodriguez, 22-Apr-2020.) |
Ref | Expression |
---|---|
binomcxp.a | ⊢ (𝜑 → 𝐴 ∈ ℝ+) |
binomcxp.b | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
binomcxp.lt | ⊢ (𝜑 → (abs‘𝐵) < (abs‘𝐴)) |
binomcxp.c | ⊢ (𝜑 → 𝐶 ∈ ℂ) |
binomcxplem.f | ⊢ 𝐹 = (𝑗 ∈ ℕ0 ↦ (𝐶C𝑐𝑗)) |
binomcxplem.s | ⊢ 𝑆 = (𝑏 ∈ ℂ ↦ (𝑘 ∈ ℕ0 ↦ ((𝐹‘𝑘) · (𝑏↑𝑘)))) |
binomcxplem.r | ⊢ 𝑅 = sup({𝑟 ∈ ℝ ∣ seq0( + , (𝑆‘𝑟)) ∈ dom ⇝ }, ℝ*, < ) |
binomcxplem.e | ⊢ 𝐸 = (𝑏 ∈ ℂ ↦ (𝑘 ∈ ℕ ↦ ((𝑘 · (𝐹‘𝑘)) · (𝑏↑(𝑘 − 1))))) |
binomcxplem.d | ⊢ 𝐷 = (◡abs “ (0[,)𝑅)) |
Ref | Expression |
---|---|
binomcxplemcvg | ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐷) → (seq0( + , (𝑆‘𝐽)) ∈ dom ⇝ ∧ seq1( + , (𝐸‘𝐽)) ∈ dom ⇝ )) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | binomcxplem.s | . . 3 ⊢ 𝑆 = (𝑏 ∈ ℂ ↦ (𝑘 ∈ ℕ0 ↦ ((𝐹‘𝑘) · (𝑏↑𝑘)))) | |
2 | binomcxp.c | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
3 | 2 | adantr 479 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ0) → 𝐶 ∈ ℂ) |
4 | simpr 483 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ0) → 𝑗 ∈ ℕ0) | |
5 | 3, 4 | bcccl 43918 | . . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ0) → (𝐶C𝑐𝑗) ∈ ℂ) |
6 | binomcxplem.f | . . . . 5 ⊢ 𝐹 = (𝑗 ∈ ℕ0 ↦ (𝐶C𝑐𝑗)) | |
7 | 5, 6 | fmptd 7123 | . . . 4 ⊢ (𝜑 → 𝐹:ℕ0⟶ℂ) |
8 | 7 | adantr 479 | . . 3 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐷) → 𝐹:ℕ0⟶ℂ) |
9 | binomcxplem.r | . . 3 ⊢ 𝑅 = sup({𝑟 ∈ ℝ ∣ seq0( + , (𝑆‘𝑟)) ∈ dom ⇝ }, ℝ*, < ) | |
10 | binomcxplem.d | . . . . . . 7 ⊢ 𝐷 = (◡abs “ (0[,)𝑅)) | |
11 | 10 | eleq2i 2817 | . . . . . 6 ⊢ (𝐽 ∈ 𝐷 ↔ 𝐽 ∈ (◡abs “ (0[,)𝑅))) |
12 | absf 15320 | . . . . . . 7 ⊢ abs:ℂ⟶ℝ | |
13 | ffn 6723 | . . . . . . 7 ⊢ (abs:ℂ⟶ℝ → abs Fn ℂ) | |
14 | elpreima 7066 | . . . . . . 7 ⊢ (abs Fn ℂ → (𝐽 ∈ (◡abs “ (0[,)𝑅)) ↔ (𝐽 ∈ ℂ ∧ (abs‘𝐽) ∈ (0[,)𝑅)))) | |
15 | 12, 13, 14 | mp2b 10 | . . . . . 6 ⊢ (𝐽 ∈ (◡abs “ (0[,)𝑅)) ↔ (𝐽 ∈ ℂ ∧ (abs‘𝐽) ∈ (0[,)𝑅))) |
16 | 11, 15 | bitri 274 | . . . . 5 ⊢ (𝐽 ∈ 𝐷 ↔ (𝐽 ∈ ℂ ∧ (abs‘𝐽) ∈ (0[,)𝑅))) |
17 | 16 | simplbi 496 | . . . 4 ⊢ (𝐽 ∈ 𝐷 → 𝐽 ∈ ℂ) |
18 | 17 | adantl 480 | . . 3 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐷) → 𝐽 ∈ ℂ) |
19 | 16 | simprbi 495 | . . . . 5 ⊢ (𝐽 ∈ 𝐷 → (abs‘𝐽) ∈ (0[,)𝑅)) |
20 | 0re 11248 | . . . . . . 7 ⊢ 0 ∈ ℝ | |
21 | ssrab2 4073 | . . . . . . . . . 10 ⊢ {𝑟 ∈ ℝ ∣ seq0( + , (𝑆‘𝑟)) ∈ dom ⇝ } ⊆ ℝ | |
22 | ressxr 11290 | . . . . . . . . . 10 ⊢ ℝ ⊆ ℝ* | |
23 | 21, 22 | sstri 3986 | . . . . . . . . 9 ⊢ {𝑟 ∈ ℝ ∣ seq0( + , (𝑆‘𝑟)) ∈ dom ⇝ } ⊆ ℝ* |
24 | supxrcl 13329 | . . . . . . . . 9 ⊢ ({𝑟 ∈ ℝ ∣ seq0( + , (𝑆‘𝑟)) ∈ dom ⇝ } ⊆ ℝ* → sup({𝑟 ∈ ℝ ∣ seq0( + , (𝑆‘𝑟)) ∈ dom ⇝ }, ℝ*, < ) ∈ ℝ*) | |
25 | 23, 24 | ax-mp 5 | . . . . . . . 8 ⊢ sup({𝑟 ∈ ℝ ∣ seq0( + , (𝑆‘𝑟)) ∈ dom ⇝ }, ℝ*, < ) ∈ ℝ* |
26 | 9, 25 | eqeltri 2821 | . . . . . . 7 ⊢ 𝑅 ∈ ℝ* |
27 | elico2 13423 | . . . . . . 7 ⊢ ((0 ∈ ℝ ∧ 𝑅 ∈ ℝ*) → ((abs‘𝐽) ∈ (0[,)𝑅) ↔ ((abs‘𝐽) ∈ ℝ ∧ 0 ≤ (abs‘𝐽) ∧ (abs‘𝐽) < 𝑅))) | |
28 | 20, 26, 27 | mp2an 690 | . . . . . 6 ⊢ ((abs‘𝐽) ∈ (0[,)𝑅) ↔ ((abs‘𝐽) ∈ ℝ ∧ 0 ≤ (abs‘𝐽) ∧ (abs‘𝐽) < 𝑅)) |
29 | 28 | simp3bi 1144 | . . . . 5 ⊢ ((abs‘𝐽) ∈ (0[,)𝑅) → (abs‘𝐽) < 𝑅) |
30 | 19, 29 | syl 17 | . . . 4 ⊢ (𝐽 ∈ 𝐷 → (abs‘𝐽) < 𝑅) |
31 | 30 | adantl 480 | . . 3 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐷) → (abs‘𝐽) < 𝑅) |
32 | 1, 8, 9, 18, 31 | radcnvlt2 26400 | . 2 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐷) → seq0( + , (𝑆‘𝐽)) ∈ dom ⇝ ) |
33 | binomcxplem.e | . . . . . . 7 ⊢ 𝐸 = (𝑏 ∈ ℂ ↦ (𝑘 ∈ ℕ ↦ ((𝑘 · (𝐹‘𝑘)) · (𝑏↑(𝑘 − 1))))) | |
34 | 33 | a1i 11 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐽 ∈ ℂ) → 𝐸 = (𝑏 ∈ ℂ ↦ (𝑘 ∈ ℕ ↦ ((𝑘 · (𝐹‘𝑘)) · (𝑏↑(𝑘 − 1)))))) |
35 | simplr 767 | . . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐽 ∈ ℂ) ∧ 𝑏 = 𝐽) ∧ 𝑘 ∈ ℕ) → 𝑏 = 𝐽) | |
36 | 35 | oveq1d 7434 | . . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐽 ∈ ℂ) ∧ 𝑏 = 𝐽) ∧ 𝑘 ∈ ℕ) → (𝑏↑(𝑘 − 1)) = (𝐽↑(𝑘 − 1))) |
37 | 36 | oveq2d 7435 | . . . . . . 7 ⊢ ((((𝜑 ∧ 𝐽 ∈ ℂ) ∧ 𝑏 = 𝐽) ∧ 𝑘 ∈ ℕ) → ((𝑘 · (𝐹‘𝑘)) · (𝑏↑(𝑘 − 1))) = ((𝑘 · (𝐹‘𝑘)) · (𝐽↑(𝑘 − 1)))) |
38 | 37 | mpteq2dva 5249 | . . . . . 6 ⊢ (((𝜑 ∧ 𝐽 ∈ ℂ) ∧ 𝑏 = 𝐽) → (𝑘 ∈ ℕ ↦ ((𝑘 · (𝐹‘𝑘)) · (𝑏↑(𝑘 − 1)))) = (𝑘 ∈ ℕ ↦ ((𝑘 · (𝐹‘𝑘)) · (𝐽↑(𝑘 − 1))))) |
39 | simpr 483 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐽 ∈ ℂ) → 𝐽 ∈ ℂ) | |
40 | nnex 12251 | . . . . . . . 8 ⊢ ℕ ∈ V | |
41 | 40 | mptex 7235 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ ↦ ((𝑘 · (𝐹‘𝑘)) · (𝐽↑(𝑘 − 1)))) ∈ V |
42 | 41 | a1i 11 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐽 ∈ ℂ) → (𝑘 ∈ ℕ ↦ ((𝑘 · (𝐹‘𝑘)) · (𝐽↑(𝑘 − 1)))) ∈ V) |
43 | 34, 38, 39, 42 | fvmptd 7011 | . . . . 5 ⊢ ((𝜑 ∧ 𝐽 ∈ ℂ) → (𝐸‘𝐽) = (𝑘 ∈ ℕ ↦ ((𝑘 · (𝐹‘𝑘)) · (𝐽↑(𝑘 − 1))))) |
44 | 17, 43 | sylan2 591 | . . . 4 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐷) → (𝐸‘𝐽) = (𝑘 ∈ ℕ ↦ ((𝑘 · (𝐹‘𝑘)) · (𝐽↑(𝑘 − 1))))) |
45 | 44 | seqeq3d 14010 | . . 3 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐷) → seq1( + , (𝐸‘𝐽)) = seq1( + , (𝑘 ∈ ℕ ↦ ((𝑘 · (𝐹‘𝑘)) · (𝐽↑(𝑘 − 1)))))) |
46 | eqid 2725 | . . . 4 ⊢ (𝑘 ∈ ℕ ↦ ((𝑘 · (𝐹‘𝑘)) · (𝐽↑(𝑘 − 1)))) = (𝑘 ∈ ℕ ↦ ((𝑘 · (𝐹‘𝑘)) · (𝐽↑(𝑘 − 1)))) | |
47 | 1, 9, 46, 8, 18, 31 | dvradcnv2 43926 | . . 3 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐷) → seq1( + , (𝑘 ∈ ℕ ↦ ((𝑘 · (𝐹‘𝑘)) · (𝐽↑(𝑘 − 1))))) ∈ dom ⇝ ) |
48 | 45, 47 | eqeltrd 2825 | . 2 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐷) → seq1( + , (𝐸‘𝐽)) ∈ dom ⇝ ) |
49 | 32, 48 | jca 510 | 1 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐷) → (seq0( + , (𝑆‘𝐽)) ∈ dom ⇝ ∧ seq1( + , (𝐸‘𝐽)) ∈ dom ⇝ )) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 {crab 3418 Vcvv 3461 ⊆ wss 3944 class class class wbr 5149 ↦ cmpt 5232 ◡ccnv 5677 dom cdm 5678 “ cima 5681 Fn wfn 6544 ⟶wf 6545 ‘cfv 6549 (class class class)co 7419 supcsup 9465 ℂcc 11138 ℝcr 11139 0cc0 11140 1c1 11141 + caddc 11143 · cmul 11145 ℝ*cxr 11279 < clt 11280 ≤ cle 11281 − cmin 11476 ℕcn 12245 ℕ0cn0 12505 ℝ+crp 13009 [,)cico 13361 seqcseq 14002 ↑cexp 14062 abscabs 15217 ⇝ cli 15464 C𝑐cbcc 43915 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5365 ax-pr 5429 ax-un 7741 ax-inf2 9666 ax-cnex 11196 ax-resscn 11197 ax-1cn 11198 ax-icn 11199 ax-addcl 11200 ax-addrcl 11201 ax-mulcl 11202 ax-mulrcl 11203 ax-mulcom 11204 ax-addass 11205 ax-mulass 11206 ax-distr 11207 ax-i2m1 11208 ax-1ne0 11209 ax-1rid 11210 ax-rnegex 11211 ax-rrecex 11212 ax-cnre 11213 ax-pre-lttri 11214 ax-pre-lttrn 11215 ax-pre-ltadd 11216 ax-pre-mulgt0 11217 ax-pre-sup 11218 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2930 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3363 df-reu 3364 df-rab 3419 df-v 3463 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3964 df-nul 4323 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4910 df-int 4951 df-iun 4999 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-se 5634 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-pred 6307 df-ord 6374 df-on 6375 df-lim 6376 df-suc 6377 df-iota 6501 df-fun 6551 df-fn 6552 df-f 6553 df-f1 6554 df-fo 6555 df-f1o 6556 df-fv 6557 df-isom 6558 df-riota 7375 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7872 df-1st 7994 df-2nd 7995 df-frecs 8287 df-wrecs 8318 df-recs 8392 df-rdg 8431 df-1o 8487 df-er 8725 df-pm 8848 df-en 8965 df-dom 8966 df-sdom 8967 df-fin 8968 df-sup 9467 df-inf 9468 df-oi 9535 df-card 9964 df-pnf 11282 df-mnf 11283 df-xr 11284 df-ltxr 11285 df-le 11286 df-sub 11478 df-neg 11479 df-div 11904 df-nn 12246 df-2 12308 df-3 12309 df-n0 12506 df-z 12592 df-uz 12856 df-rp 13010 df-ico 13365 df-icc 13366 df-fz 13520 df-fzo 13663 df-fl 13793 df-seq 14003 df-exp 14063 df-fac 14269 df-hash 14326 df-shft 15050 df-cj 15082 df-re 15083 df-im 15084 df-sqrt 15218 df-abs 15219 df-limsup 15451 df-clim 15468 df-rlim 15469 df-sum 15669 df-prod 15886 df-fallfac 15987 df-bcc 43916 |
This theorem is referenced by: binomcxplemnotnn0 43935 |
Copyright terms: Public domain | W3C validator |