isummulc2 - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > isummulc2		GIF version

Theorem isummulc2 11367

Description: An infinite sum multiplied by a constant. (Contributed by NM, 12-Nov-2005.) (Revised by Mario Carneiro, 23-Apr-2014.)

**Hypotheses**
Ref	Expression
isumcl.1	⊢ 𝑍 = (ℤ_≥‘𝑀)
isumcl.2	⊢ (𝜑 → 𝑀 ∈ ℤ)
isumcl.3	⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴)
isumcl.4	⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℂ)
isumcl.5	⊢ (𝜑 → seq𝑀( + , 𝐹) ∈ dom ⇝ )
summulc.6	⊢ (𝜑 → 𝐵 ∈ ℂ)

**Assertion**
Ref	Expression
isummulc2	⊢ (𝜑 → (𝐵 · Σ𝑘 ∈ 𝑍 𝐴) = Σ𝑘 ∈ 𝑍 (𝐵 · 𝐴))

Distinct variable groups: 𝐵,𝑘 𝑘,𝐹 𝜑,𝑘 𝑘,𝑍 𝑘,𝑀 Allowed substitution hint: 𝐴(𝑘)

Proof of Theorem isummulc2 Dummy variable 𝑚 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		isumcl.1	. . 3 ⊢ 𝑍 = (ℤ_≥‘𝑀)
2		isumcl.2	. . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ)
3		eqidd 2166	. . 3 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → ((𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴))‘𝑚) = ((𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴))‘𝑚))
4		summulc.6	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℂ)
5	4	adantr 274	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℂ)
6		isumcl.4	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℂ)
7	5, 6	mulcld 7919	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐵 · 𝐴) ∈ ℂ)
8	7	fmpttd 5640	. . . 4 ⊢ (𝜑 → (𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴)):𝑍⟶ℂ)
9	8	ffvelrnda 5620	. . 3 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → ((𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴))‘𝑚) ∈ ℂ)
10		isumcl.3	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴)
11		isumcl.5	. . . . 5 ⊢ (𝜑 → seq𝑀( + , 𝐹) ∈ dom ⇝ )
12	1, 2, 10, 6, 11	isumclim2 11363	. . . 4 ⊢ (𝜑 → seq𝑀( + , 𝐹) ⇝ Σ𝑘 ∈ 𝑍 𝐴)
13	10, 6	eqeltrd 2243	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ)
14	13	ralrimiva 2539	. . . . 5 ⊢ (𝜑 → ∀𝑘 ∈ 𝑍 (𝐹‘𝑘) ∈ ℂ)
15		fveq2 5486	. . . . . . 7 ⊢ (𝑘 = 𝑚 → (𝐹‘𝑘) = (𝐹‘𝑚))
16	15	eleq1d 2235	. . . . . 6 ⊢ (𝑘 = 𝑚 → ((𝐹‘𝑘) ∈ ℂ ↔ (𝐹‘𝑚) ∈ ℂ))
17	16	rspccva 2829	. . . . 5 ⊢ ((∀𝑘 ∈ 𝑍 (𝐹‘𝑘) ∈ ℂ ∧ 𝑚 ∈ 𝑍) → (𝐹‘𝑚) ∈ ℂ)
18	14, 17	sylan 281	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → (𝐹‘𝑚) ∈ ℂ)
19		simpr 109	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝑘 ∈ 𝑍)
20		eqid 2165	. . . . . . . . 9 ⊢ (𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴)) = (𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴))
21	20	fvmpt2 5569	. . . . . . . 8 ⊢ ((𝑘 ∈ 𝑍 ∧ (𝐵 · 𝐴) ∈ ℂ) → ((𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴))‘𝑘) = (𝐵 · 𝐴))
22	19, 7, 21	syl2anc 409	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴))‘𝑘) = (𝐵 · 𝐴))
23	10	oveq2d 5858	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐵 · (𝐹‘𝑘)) = (𝐵 · 𝐴))
24	22, 23	eqtr4d 2201	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴))‘𝑘) = (𝐵 · (𝐹‘𝑘)))
25	24	ralrimiva 2539	. . . . 5 ⊢ (𝜑 → ∀𝑘 ∈ 𝑍 ((𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴))‘𝑘) = (𝐵 · (𝐹‘𝑘)))
26		nffvmpt1 5497	. . . . . . 7 ⊢ Ⅎ𝑘((𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴))‘𝑚)
27	26	nfeq1 2318	. . . . . 6 ⊢ Ⅎ𝑘((𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴))‘𝑚) = (𝐵 · (𝐹‘𝑚))
28		fveq2 5486	. . . . . . 7 ⊢ (𝑘 = 𝑚 → ((𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴))‘𝑘) = ((𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴))‘𝑚))
29	15	oveq2d 5858	. . . . . . 7 ⊢ (𝑘 = 𝑚 → (𝐵 · (𝐹‘𝑘)) = (𝐵 · (𝐹‘𝑚)))
30	28, 29	eqeq12d 2180	. . . . . 6 ⊢ (𝑘 = 𝑚 → (((𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴))‘𝑘) = (𝐵 · (𝐹‘𝑘)) ↔ ((𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴))‘𝑚) = (𝐵 · (𝐹‘𝑚))))
31	27, 30	rspc 2824	. . . . 5 ⊢ (𝑚 ∈ 𝑍 → (∀𝑘 ∈ 𝑍 ((𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴))‘𝑘) = (𝐵 · (𝐹‘𝑘)) → ((𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴))‘𝑚) = (𝐵 · (𝐹‘𝑚))))
32	25, 31	mpan9 279	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → ((𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴))‘𝑚) = (𝐵 · (𝐹‘𝑚)))
33	1, 2, 4, 12, 18, 32	isermulc2 11281	. . 3 ⊢ (𝜑 → seq𝑀( + , (𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴))) ⇝ (𝐵 · Σ𝑘 ∈ 𝑍 𝐴))
34	1, 2, 3, 9, 33	isumclim 11362	. 2 ⊢ (𝜑 → Σ𝑚 ∈ 𝑍 ((𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴))‘𝑚) = (𝐵 · Σ𝑘 ∈ 𝑍 𝐴))
35	7	ralrimiva 2539	. . 3 ⊢ (𝜑 → ∀𝑘 ∈ 𝑍 (𝐵 · 𝐴) ∈ ℂ)
36		sumfct 11315	. . 3 ⊢ (∀𝑘 ∈ 𝑍 (𝐵 · 𝐴) ∈ ℂ → Σ𝑚 ∈ 𝑍 ((𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴))‘𝑚) = Σ𝑘 ∈ 𝑍 (𝐵 · 𝐴))
37	35, 36	syl 14	. 2 ⊢ (𝜑 → Σ𝑚 ∈ 𝑍 ((𝑘 ∈ 𝑍 ↦ (𝐵 · 𝐴))‘𝑚) = Σ𝑘 ∈ 𝑍 (𝐵 · 𝐴))
38	34, 37	eqtr3d 2200	1 ⊢ (𝜑 → (𝐵 · Σ𝑘 ∈ 𝑍 𝐴) = Σ𝑘 ∈ 𝑍 (𝐵 · 𝐴))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 103 = wceq 1343 ∈ wcel 2136 ∀wral 2444 ↦ cmpt 4043 dom cdm 4604 ‘cfv 5188 (class class class)co 5842 ℂcc 7751 + caddc 7756 · cmul 7758 ℤcz 9191 ℤ_≥cuz 9466 seqcseq 10380 ⇝ cli 11219 Σcsu 11294

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-13 2138 ax-14 2139 ax-ext 2147 ax-coll 4097 ax-sep 4100 ax-nul 4108 ax-pow 4153 ax-pr 4187 ax-un 4411 ax-setind 4514 ax-iinf 4565 ax-cnex 7844 ax-resscn 7845 ax-1cn 7846 ax-1re 7847 ax-icn 7848 ax-addcl 7849 ax-addrcl 7850 ax-mulcl 7851 ax-mulrcl 7852 ax-addcom 7853 ax-mulcom 7854 ax-addass 7855 ax-mulass 7856 ax-distr 7857 ax-i2m1 7858 ax-0lt1 7859 ax-1rid 7860 ax-0id 7861 ax-rnegex 7862 ax-precex 7863 ax-cnre 7864 ax-pre-ltirr 7865 ax-pre-ltwlin 7866 ax-pre-lttrn 7867 ax-pre-apti 7868 ax-pre-ltadd 7869 ax-pre-mulgt0 7870 ax-pre-mulext 7871 ax-arch 7872 ax-caucvg 7873

This theorem depends on definitions: df-bi 116 df-dc 825 df-3or 969 df-3an 970 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ne 2337 df-nel 2432 df-ral 2449 df-rex 2450 df-reu 2451 df-rmo 2452 df-rab 2453 df-v 2728 df-sbc 2952 df-csb 3046 df-dif 3118 df-un 3120 df-in 3122 df-ss 3129 df-nul 3410 df-if 3521 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-uni 3790 df-int 3825 df-iun 3868 df-br 3983 df-opab 4044 df-mpt 4045 df-tr 4081 df-id 4271 df-po 4274 df-iso 4275 df-iord 4344 df-on 4346 df-ilim 4347 df-suc 4349 df-iom 4568 df-xp 4610 df-rel 4611 df-cnv 4612 df-co 4613 df-dm 4614 df-rn 4615 df-res 4616 df-ima 4617 df-iota 5153 df-fun 5190 df-fn 5191 df-f 5192 df-f1 5193 df-fo 5194 df-f1o 5195 df-fv 5196 df-isom 5197 df-riota 5798 df-ov 5845 df-oprab 5846 df-mpo 5847 df-1st 6108 df-2nd 6109 df-recs 6273 df-irdg 6338 df-frec 6359 df-1o 6384 df-oadd 6388 df-er 6501 df-en 6707 df-dom 6708 df-fin 6709 df-pnf 7935 df-mnf 7936 df-xr 7937 df-ltxr 7938 df-le 7939 df-sub 8071 df-neg 8072 df-reap 8473 df-ap 8480 df-div 8569 df-inn 8858 df-2 8916 df-3 8917 df-4 8918 df-n0 9115 df-z 9192 df-uz 9467 df-q 9558 df-rp 9590 df-fz 9945 df-fzo 10078 df-seqfrec 10381 df-exp 10455 df-ihash 10689 df-cj 10784 df-re 10785 df-im 10786 df-rsqrt 10940 df-abs 10941 df-clim 11220 df-sumdc 11295

This theorem is referenced by: isummulc1 11368 trirecip 11442 geoisum1c 11461

W3C validator