fsumshftm - Intuitionistic Logic Explorer

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

Theorem fsumshftm 12005

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 2374	. . 3 ⊢ Ⅎ𝑚𝐴
2		nfcsb1v 3160	. . 3 ⊢ Ⅎ𝑗⦋𝑚 / 𝑗⦌𝐴
3		csbeq1a 3136	. . 3 ⊢ (𝑗 = 𝑚 → 𝐴 = ⦋𝑚 / 𝑗⦌𝐴)
4	1, 2, 3	cbvsumi 11922	. 2 ⊢ Σ𝑗 ∈ (𝑀...𝑁)𝐴 = Σ𝑚 ∈ (𝑀...𝑁)⦋𝑚 / 𝑗⦌𝐴
5		fsumrev.1	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ ℤ)
6	5	znegcld 9603	. . . 4 ⊢ (𝜑 → -𝐾 ∈ ℤ)
7		fsumrev.2	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ)
8		fsumrev.3	. . . 4 ⊢ (𝜑 → 𝑁 ∈ ℤ)
9		fsumrev.4	. . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ)
10	9	ralrimiva 2605	. . . . 5 ⊢ (𝜑 → ∀𝑗 ∈ (𝑀...𝑁)𝐴 ∈ ℂ)
11	2	nfel1 2385	. . . . . 6 ⊢ Ⅎ𝑗⦋𝑚 / 𝑗⦌𝐴 ∈ ℂ
12	3	eleq1d 2300	. . . . . 6 ⊢ (𝑗 = 𝑚 → (𝐴 ∈ ℂ ↔ ⦋𝑚 / 𝑗⦌𝐴 ∈ ℂ))
13	11, 12	rspc 2904	. . . . 5 ⊢ (𝑚 ∈ (𝑀...𝑁) → (∀𝑗 ∈ (𝑀...𝑁)𝐴 ∈ ℂ → ⦋𝑚 / 𝑗⦌𝐴 ∈ ℂ))
14	10, 13	mpan9 281	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ (𝑀...𝑁)) → ⦋𝑚 / 𝑗⦌𝐴 ∈ ℂ)
15		csbeq1 3130	. . . 4 ⊢ (𝑚 = (𝑘 − -𝐾) → ⦋𝑚 / 𝑗⦌𝐴 = ⦋(𝑘 − -𝐾) / 𝑗⦌𝐴)
16	6, 7, 8, 14, 15	fsumshft 12004	. . 3 ⊢ (𝜑 → Σ𝑚 ∈ (𝑀...𝑁)⦋𝑚 / 𝑗⦌𝐴 = Σ𝑘 ∈ ((𝑀 + -𝐾)...(𝑁 + -𝐾))⦋(𝑘 − -𝐾) / 𝑗⦌𝐴)
17	7	zcnd 9602	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℂ)
18	5	zcnd 9602	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ ℂ)
19	17, 18	negsubd 8495	. . . . 5 ⊢ (𝜑 → (𝑀 + -𝐾) = (𝑀 − 𝐾))
20	8	zcnd 9602	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℂ)
21	20, 18	negsubd 8495	. . . . 5 ⊢ (𝜑 → (𝑁 + -𝐾) = (𝑁 − 𝐾))
22	19, 21	oveq12d 6035	. . . 4 ⊢ (𝜑 → ((𝑀 + -𝐾)...(𝑁 + -𝐾)) = ((𝑀 − 𝐾)...(𝑁 − 𝐾)))
23	22	sumeq1d 11926	. . 3 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + -𝐾)...(𝑁 + -𝐾))⦋(𝑘 − -𝐾) / 𝑗⦌𝐴 = Σ𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))⦋(𝑘 − -𝐾) / 𝑗⦌𝐴)
24		elfzelz 10259	. . . . . . . 8 ⊢ (𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾)) → 𝑘 ∈ ℤ)
25	24	zcnd 9602	. . . . . . 7 ⊢ (𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾)) → 𝑘 ∈ ℂ)
26		subneg 8427	. . . . . . 7 ⊢ ((𝑘 ∈ ℂ ∧ 𝐾 ∈ ℂ) → (𝑘 − -𝐾) = (𝑘 + 𝐾))
27	25, 18, 26	syl2anr 290	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))) → (𝑘 − -𝐾) = (𝑘 + 𝐾))
28	27	csbeq1d 3134	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))) → ⦋(𝑘 − -𝐾) / 𝑗⦌𝐴 = ⦋(𝑘 + 𝐾) / 𝑗⦌𝐴)
29	24	adantl 277	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))) → 𝑘 ∈ ℤ)
30	5	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))) → 𝐾 ∈ ℤ)
31	29, 30	zaddcld 9605	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))) → (𝑘 + 𝐾) ∈ ℤ)
32		fsumshftm.5	. . . . . . 7 ⊢ (𝑗 = (𝑘 + 𝐾) → 𝐴 = 𝐵)
33	32	adantl 277	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))) ∧ 𝑗 = (𝑘 + 𝐾)) → 𝐴 = 𝐵)
34	31, 33	csbied 3174	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))) → ⦋(𝑘 + 𝐾) / 𝑗⦌𝐴 = 𝐵)
35	28, 34	eqtrd 2264	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))) → ⦋(𝑘 − -𝐾) / 𝑗⦌𝐴 = 𝐵)
36	35	sumeq2dv 11928	. . 3 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))⦋(𝑘 − -𝐾) / 𝑗⦌𝐴 = Σ𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))𝐵)
37	16, 23, 36	3eqtrd 2268	. 2 ⊢ (𝜑 → Σ𝑚 ∈ (𝑀...𝑁)⦋𝑚 / 𝑗⦌𝐴 = Σ𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))𝐵)
38	4, 37	eqtrid 2276	1 ⊢ (𝜑 → Σ𝑗 ∈ (𝑀...𝑁)𝐴 = Σ𝑘 ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾))𝐵)

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2202 ∀wral 2510 ⦋csb 3127 (class class class)co 6017 ℂcc 8029 + caddc 8034 − cmin 8349 -cneg 8350 ℤcz 9478 ...cfz 10242 Σcsu 11913

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 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 ax-cnex 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-mulrcl 8130 ax-addcom 8131 ax-mulcom 8132 ax-addass 8133 ax-mulass 8134 ax-distr 8135 ax-i2m1 8136 ax-0lt1 8137 ax-1rid 8138 ax-0id 8139 ax-rnegex 8140 ax-precex 8141 ax-cnre 8142 ax-pre-ltirr 8143 ax-pre-ltwlin 8144 ax-pre-lttrn 8145 ax-pre-apti 8146 ax-pre-ltadd 8147 ax-pre-mulgt0 8148 ax-pre-mulext 8149 ax-arch 8150 ax-caucvg 8151

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 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-if 3606 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-po 4393 df-iso 4394 df-iord 4463 df-on 4465 df-ilim 4466 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-isom 5335 df-riota 5970 df-ov 6020 df-oprab 6021 df-mpo 6022 df-1st 6302 df-2nd 6303 df-recs 6470 df-irdg 6535 df-frec 6556 df-1o 6581 df-oadd 6585 df-er 6701 df-en 6909 df-dom 6910 df-fin 6911 df-pnf 8215 df-mnf 8216 df-xr 8217 df-ltxr 8218 df-le 8219 df-sub 8351 df-neg 8352 df-reap 8754 df-ap 8761 df-div 8852 df-inn 9143 df-2 9201 df-3 9202 df-4 9203 df-n0 9402 df-z 9479 df-uz 9755 df-q 9853 df-rp 9888 df-fz 10243 df-fzo 10377 df-seqfrec 10709 df-exp 10800 df-ihash 11037 df-cj 11402 df-re 11403 df-im 11404 df-rsqrt 11558 df-abs 11559 df-clim 11839 df-sumdc 11914

This theorem is referenced by: telfsumo 12026 fsumparts 12030 arisum 12058 geo2sum 12074 dvply1 15488

W3C validator