![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > iisermulc2 | GIF version |
Description: Multiplication of an infinite series by a constant. (Contributed by Paul Chapman, 14-Nov-2007.) (Revised by Mario Carneiro, 1-Feb-2014.) |
Ref | Expression |
---|---|
clim2ser.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
isermulc2.2 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
isermulc2.4 | ⊢ (𝜑 → 𝐶 ∈ ℂ) |
isermulc2.5 | ⊢ (𝜑 → seq𝑀( + , 𝐹, ℂ) ⇝ 𝐴) |
isermulc2.6 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ) |
isermulc2.7 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) = (𝐶 · (𝐹‘𝑘))) |
Ref | Expression |
---|---|
iisermulc2 | ⊢ (𝜑 → seq𝑀( + , 𝐺, ℂ) ⇝ (𝐶 · 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | clim2ser.1 | . 2 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
2 | isermulc2.2 | . 2 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
3 | isermulc2.5 | . 2 ⊢ (𝜑 → seq𝑀( + , 𝐹, ℂ) ⇝ 𝐴) | |
4 | isermulc2.4 | . 2 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
5 | iseqex 9433 | . . 3 ⊢ seq𝑀( + , 𝐺, ℂ) ∈ V | |
6 | 5 | a1i 9 | . 2 ⊢ (𝜑 → seq𝑀( + , 𝐺, ℂ) ∈ V) |
7 | isermulc2.6 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ) | |
8 | 1, 2, 7 | iserf 9453 | . . 3 ⊢ (𝜑 → seq𝑀( + , 𝐹, ℂ):𝑍⟶ℂ) |
9 | 8 | ffvelrnda 5323 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (seq𝑀( + , 𝐹, ℂ)‘𝑗) ∈ ℂ) |
10 | addcl 7098 | . . . 4 ⊢ ((𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝑘 + 𝑥) ∈ ℂ) | |
11 | 10 | adantl 271 | . . 3 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ (𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ)) → (𝑘 + 𝑥) ∈ ℂ) |
12 | 4 | adantr 270 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝐶 ∈ ℂ) |
13 | adddi 7105 | . . . . 5 ⊢ ((𝐶 ∈ ℂ ∧ 𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝐶 · (𝑘 + 𝑥)) = ((𝐶 · 𝑘) + (𝐶 · 𝑥))) | |
14 | 13 | 3expb 1139 | . . . 4 ⊢ ((𝐶 ∈ ℂ ∧ (𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ)) → (𝐶 · (𝑘 + 𝑥)) = ((𝐶 · 𝑘) + (𝐶 · 𝑥))) |
15 | 12, 14 | sylan 277 | . . 3 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ (𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ)) → (𝐶 · (𝑘 + 𝑥)) = ((𝐶 · 𝑘) + (𝐶 · 𝑥))) |
16 | simpr 108 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝑗 ∈ 𝑍) | |
17 | 16, 1 | syl6eleq 2171 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝑗 ∈ (ℤ≥‘𝑀)) |
18 | 1 | eleq2i 2145 | . . . . 5 ⊢ (𝑘 ∈ 𝑍 ↔ 𝑘 ∈ (ℤ≥‘𝑀)) |
19 | 18, 7 | sylan2br 282 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑘) ∈ ℂ) |
20 | 19 | adantlr 460 | . . 3 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑘) ∈ ℂ) |
21 | isermulc2.7 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) = (𝐶 · (𝐹‘𝑘))) | |
22 | 18, 21 | sylan2br 282 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑘) = (𝐶 · (𝐹‘𝑘))) |
23 | 22 | adantlr 460 | . . 3 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑘) = (𝐶 · (𝐹‘𝑘))) |
24 | cnex 7097 | . . . 4 ⊢ ℂ ∈ V | |
25 | 24 | a1i 9 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → ℂ ∈ V) |
26 | mulcl 7100 | . . . 4 ⊢ ((𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝑘 · 𝑥) ∈ ℂ) | |
27 | 26 | adantl 271 | . . 3 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ (𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ)) → (𝑘 · 𝑥) ∈ ℂ) |
28 | 4 | adantr 270 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐶 ∈ ℂ) |
29 | 28, 7 | mulcld 7139 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐶 · (𝐹‘𝑘)) ∈ ℂ) |
30 | 21, 29 | eqeltrd 2155 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) ∈ ℂ) |
31 | 18, 30 | sylan2br 282 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑘) ∈ ℂ) |
32 | 31 | adantlr 460 | . . 3 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑘) ∈ ℂ) |
33 | 11, 15, 17, 20, 23, 25, 27, 32, 12 | iseqdistr 9470 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (seq𝑀( + , 𝐺, ℂ)‘𝑗) = (𝐶 · (seq𝑀( + , 𝐹, ℂ)‘𝑗))) |
34 | 1, 2, 3, 4, 6, 9, 33 | climmulc2 10169 | 1 ⊢ (𝜑 → seq𝑀( + , 𝐺, ℂ) ⇝ (𝐶 · 𝐴)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 = wceq 1284 ∈ wcel 1433 Vcvv 2601 class class class wbr 3785 ‘cfv 4922 (class class class)co 5532 ℂcc 6979 + caddc 6984 · cmul 6986 ℤcz 8351 ℤ≥cuz 8619 seqcseq 9431 ⇝ cli 10117 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 576 ax-in2 577 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-13 1444 ax-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-coll 3893 ax-sep 3896 ax-nul 3904 ax-pow 3948 ax-pr 3964 ax-un 4188 ax-setind 4280 ax-iinf 4329 ax-cnex 7067 ax-resscn 7068 ax-1cn 7069 ax-1re 7070 ax-icn 7071 ax-addcl 7072 ax-addrcl 7073 ax-mulcl 7074 ax-mulrcl 7075 ax-addcom 7076 ax-mulcom 7077 ax-addass 7078 ax-mulass 7079 ax-distr 7080 ax-i2m1 7081 ax-0lt1 7082 ax-1rid 7083 ax-0id 7084 ax-rnegex 7085 ax-precex 7086 ax-cnre 7087 ax-pre-ltirr 7088 ax-pre-ltwlin 7089 ax-pre-lttrn 7090 ax-pre-apti 7091 ax-pre-ltadd 7092 ax-pre-mulgt0 7093 ax-pre-mulext 7094 ax-arch 7095 ax-caucvg 7096 |
This theorem depends on definitions: df-bi 115 df-dc 776 df-3or 920 df-3an 921 df-tru 1287 df-fal 1290 df-nf 1390 df-sb 1686 df-eu 1944 df-mo 1945 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ne 2246 df-nel 2340 df-ral 2353 df-rex 2354 df-reu 2355 df-rmo 2356 df-rab 2357 df-v 2603 df-sbc 2816 df-csb 2909 df-dif 2975 df-un 2977 df-in 2979 df-ss 2986 df-nul 3252 df-if 3352 df-pw 3384 df-sn 3404 df-pr 3405 df-op 3407 df-uni 3602 df-int 3637 df-iun 3680 df-br 3786 df-opab 3840 df-mpt 3841 df-tr 3876 df-id 4048 df-po 4051 df-iso 4052 df-iord 4121 df-on 4123 df-suc 4126 df-iom 4332 df-xp 4369 df-rel 4370 df-cnv 4371 df-co 4372 df-dm 4373 df-rn 4374 df-res 4375 df-ima 4376 df-iota 4887 df-fun 4924 df-fn 4925 df-f 4926 df-f1 4927 df-fo 4928 df-f1o 4929 df-fv 4930 df-riota 5488 df-ov 5535 df-oprab 5536 df-mpt2 5537 df-1st 5787 df-2nd 5788 df-recs 5943 df-frec 6001 df-pnf 7155 df-mnf 7156 df-xr 7157 df-ltxr 7158 df-le 7159 df-sub 7281 df-neg 7282 df-reap 7675 df-ap 7682 df-div 7761 df-inn 8040 df-2 8098 df-3 8099 df-4 8100 df-n0 8289 df-z 8352 df-uz 8620 df-rp 8735 df-iseq 9432 df-iexp 9476 df-cj 9729 df-re 9730 df-im 9731 df-rsqrt 9884 df-abs 9885 df-clim 10118 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |