| 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 10717 | . . 3 ⊢ seq𝑀( + , 𝐺) ∈ V | |
| 6 | 5 | a1i 9 | . 2 ⊢ (𝜑 → seq𝑀( + , 𝐺) ∈ V) |
| 7 | isermulc2.6 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ) | |
| 8 | 1, 2, 7 | serf 10751 | . . 3 ⊢ (𝜑 → seq𝑀( + , 𝐹):𝑍⟶ℂ) |
| 9 | 8 | ffvelcdmda 5785 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (seq𝑀( + , 𝐹)‘𝑗) ∈ ℂ) |
| 10 | addcl 8162 | . . . 4 ⊢ ((𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝑘 + 𝑥) ∈ ℂ) | |
| 11 | 10 | adantl 277 | . . 3 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ (𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ)) → (𝑘 + 𝑥) ∈ ℂ) |
| 12 | 4 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝐶 ∈ ℂ) |
| 13 | adddi 8169 | . . . . 5 ⊢ ((𝐶 ∈ ℂ ∧ 𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝐶 · (𝑘 + 𝑥)) = ((𝐶 · 𝑘) + (𝐶 · 𝑥))) | |
| 14 | 13 | 3expb 1230 | . . . 4 ⊢ ((𝐶 ∈ ℂ ∧ (𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ)) → (𝐶 · (𝑘 + 𝑥)) = ((𝐶 · 𝑘) + (𝐶 · 𝑥))) |
| 15 | 12, 14 | sylan 283 | . . 3 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ (𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ)) → (𝐶 · (𝑘 + 𝑥)) = ((𝐶 · 𝑘) + (𝐶 · 𝑥))) |
| 16 | simpr 110 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝑗 ∈ 𝑍) | |
| 17 | 16, 1 | eleqtrdi 2323 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝑗 ∈ (ℤ≥‘𝑀)) |
| 18 | 1 | eleq2i 2297 | . . . . 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 8164 | . . . 4 ⊢ ((𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝑘 · 𝑥) ∈ ℂ) | |
| 25 | 24 | adantl 277 | . . 3 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ (𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ)) → (𝑘 · 𝑥) ∈ ℂ) |
| 26 | 11, 15, 17, 20, 23, 25, 12 | seq3distr 10800 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (seq𝑀( + , 𝐺)‘𝑗) = (𝐶 · (seq𝑀( + , 𝐹)‘𝑗))) |
| 27 | 1, 2, 3, 4, 6, 9, 26 | climmulc2 11914 | 1 ⊢ (𝜑 → seq𝑀( + , 𝐺) ⇝ (𝐶 · 𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2201 Vcvv 2801 class class class wbr 4089 ‘cfv 5328 (class class class)co 6023 ℂcc 8035 + caddc 8040 · cmul 8042 ℤcz 9484 ℤ≥cuz 9760 seqcseq 10715 ⇝ cli 11861 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2203 ax-14 2204 ax-ext 2212 ax-coll 4205 ax-sep 4208 ax-nul 4216 ax-pow 4266 ax-pr 4301 ax-un 4532 ax-setind 4637 ax-iinf 4688 ax-cnex 8128 ax-resscn 8129 ax-1cn 8130 ax-1re 8131 ax-icn 8132 ax-addcl 8133 ax-addrcl 8134 ax-mulcl 8135 ax-mulrcl 8136 ax-addcom 8137 ax-mulcom 8138 ax-addass 8139 ax-mulass 8140 ax-distr 8141 ax-i2m1 8142 ax-0lt1 8143 ax-1rid 8144 ax-0id 8145 ax-rnegex 8146 ax-precex 8147 ax-cnre 8148 ax-pre-ltirr 8149 ax-pre-ltwlin 8150 ax-pre-lttrn 8151 ax-pre-apti 8152 ax-pre-ltadd 8153 ax-pre-mulgt0 8154 ax-pre-mulext 8155 ax-arch 8156 ax-caucvg 8157 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ne 2402 df-nel 2497 df-ral 2514 df-rex 2515 df-reu 2516 df-rmo 2517 df-rab 2518 df-v 2803 df-sbc 3031 df-csb 3127 df-dif 3201 df-un 3203 df-in 3205 df-ss 3212 df-nul 3494 df-if 3605 df-pw 3655 df-sn 3676 df-pr 3677 df-op 3679 df-uni 3895 df-int 3930 df-iun 3973 df-br 4090 df-opab 4152 df-mpt 4153 df-tr 4189 df-id 4392 df-po 4395 df-iso 4396 df-iord 4465 df-on 4467 df-ilim 4468 df-suc 4470 df-iom 4691 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-ima 4740 df-iota 5288 df-fun 5330 df-fn 5331 df-f 5332 df-f1 5333 df-fo 5334 df-f1o 5335 df-fv 5336 df-riota 5976 df-ov 6026 df-oprab 6027 df-mpo 6028 df-1st 6308 df-2nd 6309 df-recs 6476 df-frec 6562 df-pnf 8221 df-mnf 8222 df-xr 8223 df-ltxr 8224 df-le 8225 df-sub 8357 df-neg 8358 df-reap 8760 df-ap 8767 df-div 8858 df-inn 9149 df-2 9207 df-3 9208 df-4 9209 df-n0 9408 df-z 9485 df-uz 9761 df-rp 9894 df-seqfrec 10716 df-exp 10807 df-cj 11425 df-re 11426 df-im 11427 df-rsqrt 11581 df-abs 11582 df-clim 11862 |
| This theorem is referenced by: isummulc2 12010 mertensabs 12121 ege2le3 12255 eftlub 12274 |
| Copyright terms: Public domain | W3C validator |