| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > isermulc2 | GIF version | ||
| Description: Multiplication of an infinite series by a constant. (Contributed by Paul Chapman, 14-Nov-2007.) (Revised by Jim Kingdon, 8-Apr-2023.) |
| Ref | Expression |
|---|---|
| clim2iser.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
| isermulc2.2 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| isermulc2.4 | ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| isermulc2.5 | ⊢ (𝜑 → seq𝑀( + , 𝐹) ⇝ 𝐴) |
| isermulc2.6 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ) |
| isermulc2.7 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) = (𝐶 · (𝐹‘𝑘))) |
| Ref | Expression |
|---|---|
| isermulc2 | ⊢ (𝜑 → seq𝑀( + , 𝐺) ⇝ (𝐶 · 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | clim2iser.1 | . 2 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 2 | isermulc2.2 | . 2 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
| 3 | isermulc2.5 | . 2 ⊢ (𝜑 → seq𝑀( + , 𝐹) ⇝ 𝐴) | |
| 4 | isermulc2.4 | . 2 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
| 5 | seqex 10807 | . . 3 ⊢ seq𝑀( + , 𝐺) ∈ V | |
| 6 | 5 | a1i 9 | . 2 ⊢ (𝜑 → seq𝑀( + , 𝐺) ∈ V) |
| 7 | isermulc2.6 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ) | |
| 8 | 1, 2, 7 | serf 10841 | . . 3 ⊢ (𝜑 → seq𝑀( + , 𝐹):𝑍⟶ℂ) |
| 9 | 8 | ffvelcdmda 5811 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (seq𝑀( + , 𝐹)‘𝑗) ∈ ℂ) |
| 10 | addcl 8248 | . . . 4 ⊢ ((𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝑘 + 𝑥) ∈ ℂ) | |
| 11 | 10 | adantl 277 | . . 3 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ (𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ)) → (𝑘 + 𝑥) ∈ ℂ) |
| 12 | 4 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝐶 ∈ ℂ) |
| 13 | adddi 8255 | . . . . 5 ⊢ ((𝐶 ∈ ℂ ∧ 𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝐶 · (𝑘 + 𝑥)) = ((𝐶 · 𝑘) + (𝐶 · 𝑥))) | |
| 14 | 13 | 3expb 1231 | . . . 4 ⊢ ((𝐶 ∈ ℂ ∧ (𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ)) → (𝐶 · (𝑘 + 𝑥)) = ((𝐶 · 𝑘) + (𝐶 · 𝑥))) |
| 15 | 12, 14 | sylan 283 | . . 3 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ (𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ)) → (𝐶 · (𝑘 + 𝑥)) = ((𝐶 · 𝑘) + (𝐶 · 𝑥))) |
| 16 | simpr 110 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝑗 ∈ 𝑍) | |
| 17 | 16, 1 | eleqtrdi 2325 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝑗 ∈ (ℤ≥‘𝑀)) |
| 18 | 1 | eleq2i 2299 | . . . . 5 ⊢ (𝑘 ∈ 𝑍 ↔ 𝑘 ∈ (ℤ≥‘𝑀)) |
| 19 | 18, 7 | sylan2br 288 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑘) ∈ ℂ) |
| 20 | 19 | adantlr 477 | . . 3 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑘) ∈ ℂ) |
| 21 | isermulc2.7 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) = (𝐶 · (𝐹‘𝑘))) | |
| 22 | 18, 21 | sylan2br 288 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑘) = (𝐶 · (𝐹‘𝑘))) |
| 23 | 22 | adantlr 477 | . . 3 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑘) = (𝐶 · (𝐹‘𝑘))) |
| 24 | mulcl 8250 | . . . 4 ⊢ ((𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝑘 · 𝑥) ∈ ℂ) | |
| 25 | 24 | adantl 277 | . . 3 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ (𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ)) → (𝑘 · 𝑥) ∈ ℂ) |
| 26 | 11, 15, 17, 20, 23, 25, 12 | seq3distr 10890 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (seq𝑀( + , 𝐺)‘𝑗) = (𝐶 · (seq𝑀( + , 𝐹)‘𝑗))) |
| 27 | 1, 2, 3, 4, 6, 9, 26 | climmulc2 12009 | 1 ⊢ (𝜑 → seq𝑀( + , 𝐺) ⇝ (𝐶 · 𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2203 Vcvv 2812 class class class wbr 4108 ‘cfv 5351 (class class class)co 6049 ℂcc 8121 + caddc 8126 · cmul 8128 ℤcz 9573 ℤ≥cuz 9849 seqcseq 10805 ⇝ cli 11956 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4224 ax-sep 4227 ax-nul 4235 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 ax-iinf 4709 ax-cnex 8214 ax-resscn 8215 ax-1cn 8216 ax-1re 8217 ax-icn 8218 ax-addcl 8219 ax-addrcl 8220 ax-mulcl 8221 ax-mulrcl 8222 ax-addcom 8223 ax-mulcom 8224 ax-addass 8225 ax-mulass 8226 ax-distr 8227 ax-i2m1 8228 ax-0lt1 8229 ax-1rid 8230 ax-0id 8231 ax-rnegex 8232 ax-precex 8233 ax-cnre 8234 ax-pre-ltirr 8235 ax-pre-ltwlin 8236 ax-pre-lttrn 8237 ax-pre-apti 8238 ax-pre-ltadd 8239 ax-pre-mulgt0 8240 ax-pre-mulext 8241 ax-arch 8242 ax-caucvg 8243 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-nul 3508 df-if 3620 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-tr 4208 df-id 4413 df-po 4416 df-iso 4417 df-iord 4486 df-on 4488 df-ilim 4489 df-suc 4491 df-iom 4712 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-riota 6002 df-ov 6052 df-oprab 6053 df-mpo 6054 df-1st 6333 df-2nd 6334 df-recs 6535 df-frec 6621 df-pnf 8306 df-mnf 8307 df-xr 8308 df-ltxr 8309 df-le 8310 df-sub 8442 df-neg 8443 df-reap 8845 df-ap 8852 df-div 8943 df-inn 9234 df-2 9292 df-3 9293 df-4 9294 df-n0 9493 df-z 9574 df-uz 9850 df-rp 9983 df-seqfrec 10806 df-exp 10897 df-cj 11520 df-re 11521 df-im 11522 df-rsqrt 11676 df-abs 11677 df-clim 11957 |
| This theorem is referenced by: isummulc2 12105 mertensabs 12216 ege2le3 12350 eftlub 12369 |
| Copyright terms: Public domain | W3C validator |