fsumshftm - Intuitionistic Logic Explorer

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

Theorem fsumshftm 12237

Description: Negative index shift of a finite sum. (Contributed by NM, 28-Nov-2005.) (Revised by Mario Carneiro, 24-Apr-2014.)

**Hypotheses**
Ref	Expression
fsumrev.1	⊢ (𝜑 → 𝐾 ∈ ℤ)
fsumrev.2	⊢ (𝜑 → 𝑀 ∈ ℤ)
fsumrev.3	⊢ (𝜑 → 𝑁 ∈ ℤ)
fsumrev.4	⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ)
fsumshftm.5	⊢ (𝑗 = (𝑘 + 𝐾) → 𝐴 = 𝐵)

**Assertion**
Ref	Expression
fsumshftm	⊢ (𝜑 → Σ𝑗 ∈ (𝑀...𝑁)𝐴 = Σ𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))𝐵)

Distinct variable groups: 𝐴,𝑘 𝐵,𝑗 𝑗,𝑘,𝐾 𝑗,𝑀,𝑘 𝑗,𝑁,𝑘 𝜑,𝑗,𝑘 Allowed substitution hints: 𝐴(𝑗) 𝐵(𝑘)

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

Step	Hyp	Ref	Expression
1		nfcv 2392	. . 3 ⊢ Ⅎ𝑚𝐴
2		nfcsb1v 3180	. . 3 ⊢ Ⅎ𝑗⦋𝑚 / 𝑗⦌𝐴
3		csbeq1a 3156	. . 3 ⊢ (𝑗 = 𝑚 → 𝐴 = ⦋𝑚 / 𝑗⦌𝐴)
4	1, 2, 3	cbvsumi 12153	. 2 ⊢ Σ𝑗 ∈ (𝑀...𝑁)𝐴 = Σ𝑚 ∈ (𝑀...𝑁)⦋𝑚 / 𝑗⦌𝐴
5		fsumrev.1	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ ℤ)
6	5	znegcld 9781	. . . 4 ⊢ (𝜑 → -𝐾 ∈ ℤ)
7		fsumrev.2	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ)
8		fsumrev.3	. . . 4 ⊢ (𝜑 → 𝑁 ∈ ℤ)
9		fsumrev.4	. . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ)
10	9	ralrimiva 2623	. . . . 5 ⊢ (𝜑 → ∀𝑗 ∈ (𝑀...𝑁)𝐴 ∈ ℂ)
11	2	nfel1 2403	. . . . . 6 ⊢ Ⅎ𝑗⦋𝑚 / 𝑗⦌𝐴 ∈ ℂ
12	3	eleq1d 2307	. . . . . 6 ⊢ (𝑗 = 𝑚 → (𝐴 ∈ ℂ ↔ ⦋𝑚 / 𝑗⦌𝐴 ∈ ℂ))
13	11, 12	rspc 2923	. . . . 5 ⊢ (𝑚 ∈ (𝑀...𝑁) → (∀𝑗 ∈ (𝑀...𝑁)𝐴 ∈ ℂ → ⦋𝑚 / 𝑗⦌𝐴 ∈ ℂ))
14	10, 13	mpan9 281	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ (𝑀...𝑁)) → ⦋𝑚 / 𝑗⦌𝐴 ∈ ℂ)
15		csbeq1 3150	. . . 4 ⊢ (𝑚 = (𝑘 − -𝐾) → ⦋𝑚 / 𝑗⦌𝐴 = ⦋(𝑘 − -𝐾) / 𝑗⦌𝐴)
16	6, 7, 8, 14, 15	fsumshft 12236	. . 3 ⊢ (𝜑 → Σ𝑚 ∈ (𝑀...𝑁)⦋𝑚 / 𝑗⦌𝐴 = Σ𝑘 ∈ ((𝑀 + -𝐾)...(𝑁 + -𝐾))⦋(𝑘 − -𝐾) / 𝑗⦌𝐴)
17	7	zcnd 9780	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℂ)
18	5	zcnd 9780	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ ℂ)
19	17, 18	negsubd 8650	. . . . 5 ⊢ (𝜑 → (𝑀 + -𝐾) = (𝑀 − 𝐾))
20	8	zcnd 9780	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℂ)
21	20, 18	negsubd 8650	. . . . 5 ⊢ (𝜑 → (𝑁 + -𝐾) = (𝑁 − 𝐾))
22	19, 21	oveq12d 6106	. . . 4 ⊢ (𝜑 → ((𝑀 + -𝐾)...(𝑁 + -𝐾)) = ((𝑀 − 𝐾)...(𝑁 − 𝐾)))
23	22	sumeq1d 12157	. . 3 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + -𝐾)...(𝑁 + -𝐾))⦋(𝑘 − -𝐾) / 𝑗⦌𝐴 = Σ𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))⦋(𝑘 − -𝐾) / 𝑗⦌𝐴)
24		elfzelz 10445	. . . . . . . 8 ⊢ (𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾)) → 𝑘 ∈ ℤ)
25	24	zcnd 9780	. . . . . . 7 ⊢ (𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾)) → 𝑘 ∈ ℂ)
26		subneg 8582	. . . . . . 7 ⊢ ((𝑘 ∈ ℂ ∧ 𝐾 ∈ ℂ) → (𝑘 − -𝐾) = (𝑘 + 𝐾))
27	25, 18, 26	syl2anr 290	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))) → (𝑘 − -𝐾) = (𝑘 + 𝐾))
28	27	csbeq1d 3154	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))) → ⦋(𝑘 − -𝐾) / 𝑗⦌𝐴 = ⦋(𝑘 + 𝐾) / 𝑗⦌𝐴)
29	24	adantl 277	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))) → 𝑘 ∈ ℤ)
30	5	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))) → 𝐾 ∈ ℤ)
31	29, 30	zaddcld 9783	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))) → (𝑘 + 𝐾) ∈ ℤ)
32		fsumshftm.5	. . . . . . 7 ⊢ (𝑗 = (𝑘 + 𝐾) → 𝐴 = 𝐵)
33	32	adantl 277	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))) ∧ 𝑗 = (𝑘 + 𝐾)) → 𝐴 = 𝐵)
34	31, 33	csbied 3194	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))) → ⦋(𝑘 + 𝐾) / 𝑗⦌𝐴 = 𝐵)
35	28, 34	eqtrd 2271	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))) → ⦋(𝑘 − -𝐾) / 𝑗⦌𝐴 = 𝐵)
36	35	sumeq2dv 12159	. . 3 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))⦋(𝑘 − -𝐾) / 𝑗⦌𝐴 = Σ𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))𝐵)
37	16, 23, 36	3eqtrd 2275	. 2 ⊢ (𝜑 → Σ𝑚 ∈ (𝑀...𝑁)⦋𝑚 / 𝑗⦌𝐴 = Σ𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))𝐵)
38	4, 37	eqtrid 2283	1 ⊢ (𝜑 → Σ𝑗 ∈ (𝑀...𝑁)𝐴 = Σ𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))𝐵)

Colors of variables: wff set class

This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ∀wral 2528 ⦋csb 3147 (class class class)co 6088 ℂcc 8183 + caddc 8188 − cmin 8504 -cneg 8505 ℤcz 9655 ...cfz 10428 Σcsu 12144

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4248 ax-sep 4251 ax-nul 4261 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-iinf 4737 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-mulrcl 8284 ax-addcom 8285 ax-mulcom 8286 ax-addass 8287 ax-mulass 8288 ax-distr 8289 ax-i2m1 8290 ax-0lt1 8291 ax-1rid 8292 ax-0id 8293 ax-rnegex 8294 ax-precex 8295 ax-cnre 8296 ax-pre-ltirr 8297 ax-pre-ltwlin 8298 ax-pre-lttrn 8299 ax-pre-apti 8300 ax-pre-ltadd 8301 ax-pre-mulgt0 8302 ax-pre-mulext 8303 ax-arch 8304 ax-caucvg 8305

This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-tr 4232 df-id 4440 df-po 4443 df-iso 4444 df-iord 4513 df-on 4515 df-ilim 4516 df-suc 4518 df-iom 4740 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-isom 5389 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-1st 6378 df-2nd 6379 df-recs 6580 df-irdg 6645 df-frec 6666 df-1o 6691 df-oadd 6695 df-er 6811 df-en 7027 df-dom 7028 df-fin 7029 df-pnf 8368 df-mnf 8369 df-xr 8370 df-ltxr 8371 df-le 8372 df-sub 8506 df-neg 8507 df-reap 8911 df-ap 8918 df-div 9011 df-inn 9314 df-2 9372 df-3 9373 df-4 9374 df-n0 9575 df-z 9656 df-uz 9938 df-q 10036 df-rp 10072 df-fz 10429 df-fzo 10567 df-seqfrec 10906 df-exp 10997 df-ihash 11237 df-cj 11629 df-re 11630 df-im 11631 df-rsqrt 11786 df-abs 11787 df-clim 12070 df-sumdc 12145

This theorem is used by: telfsumo 12258 fsumparts 12262 arisum 12290 geo2sum 12306 dvply1 15991

W3C validator