telfsumo2 - Intuitionistic Logic Explorer

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

Theorem telfsumo2 12021

Description: Sum of a telescoping series. (Contributed by Mario Carneiro, 2-May-2016.)

**Hypotheses**
Ref	Expression
telfsumo.1	⊢ (𝑘 = 𝑗 → 𝐴 = 𝐵)
telfsumo.2	⊢ (𝑘 = (𝑗 + 1) → 𝐴 = 𝐶)
telfsumo.3	⊢ (𝑘 = 𝑀 → 𝐴 = 𝐷)
telfsumo.4	⊢ (𝑘 = 𝑁 → 𝐴 = 𝐸)
telfsumo.5	⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
telfsumo.6	⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ)

**Assertion**
Ref	Expression
telfsumo2	⊢ (𝜑 → Σ𝑗 ∈ (𝑀..^𝑁)(𝐶 − 𝐵) = (𝐸 − 𝐷))

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

**Proof of Theorem telfsumo2**
Step	Hyp	Ref	Expression
1		telfsumo.1	. . . 4 ⊢ (𝑘 = 𝑗 → 𝐴 = 𝐵)
2	1	negeqd 8367	. . 3 ⊢ (𝑘 = 𝑗 → -𝐴 = -𝐵)
3		telfsumo.2	. . . 4 ⊢ (𝑘 = (𝑗 + 1) → 𝐴 = 𝐶)
4	3	negeqd 8367	. . 3 ⊢ (𝑘 = (𝑗 + 1) → -𝐴 = -𝐶)
5		telfsumo.3	. . . 4 ⊢ (𝑘 = 𝑀 → 𝐴 = 𝐷)
6	5	negeqd 8367	. . 3 ⊢ (𝑘 = 𝑀 → -𝐴 = -𝐷)
7		telfsumo.4	. . . 4 ⊢ (𝑘 = 𝑁 → 𝐴 = 𝐸)
8	7	negeqd 8367	. . 3 ⊢ (𝑘 = 𝑁 → -𝐴 = -𝐸)
9		telfsumo.5	. . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
10		telfsumo.6	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ)
11	10	negcld 8470	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → -𝐴 ∈ ℂ)
12	2, 4, 6, 8, 9, 11	telfsumo 12020	. 2 ⊢ (𝜑 → Σ𝑗 ∈ (𝑀..^𝑁)(-𝐵 − -𝐶) = (-𝐷 − -𝐸))
13	10	ralrimiva 2603	. . . . 5 ⊢ (𝜑 → ∀𝑘 ∈ (𝑀...𝑁)𝐴 ∈ ℂ)
14		elfzofz 10391	. . . . 5 ⊢ (𝑗 ∈ (𝑀..^𝑁) → 𝑗 ∈ (𝑀...𝑁))
15	1	eleq1d 2298	. . . . . 6 ⊢ (𝑘 = 𝑗 → (𝐴 ∈ ℂ ↔ 𝐵 ∈ ℂ))
16	15	rspccva 2907	. . . . 5 ⊢ ((∀𝑘 ∈ (𝑀...𝑁)𝐴 ∈ ℂ ∧ 𝑗 ∈ (𝑀...𝑁)) → 𝐵 ∈ ℂ)
17	13, 14, 16	syl2an 289	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀..^𝑁)) → 𝐵 ∈ ℂ)
18		fzofzp1 10465	. . . . 5 ⊢ (𝑗 ∈ (𝑀..^𝑁) → (𝑗 + 1) ∈ (𝑀...𝑁))
19	3	eleq1d 2298	. . . . . 6 ⊢ (𝑘 = (𝑗 + 1) → (𝐴 ∈ ℂ ↔ 𝐶 ∈ ℂ))
20	19	rspccva 2907	. . . . 5 ⊢ ((∀𝑘 ∈ (𝑀...𝑁)𝐴 ∈ ℂ ∧ (𝑗 + 1) ∈ (𝑀...𝑁)) → 𝐶 ∈ ℂ)
21	13, 18, 20	syl2an 289	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀..^𝑁)) → 𝐶 ∈ ℂ)
22	17, 21	neg2subd 8500	. . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀..^𝑁)) → (-𝐵 − -𝐶) = (𝐶 − 𝐵))
23	22	sumeq2dv 11922	. 2 ⊢ (𝜑 → Σ𝑗 ∈ (𝑀..^𝑁)(-𝐵 − -𝐶) = Σ𝑗 ∈ (𝑀..^𝑁)(𝐶 − 𝐵))
24	5	eleq1d 2298	. . . 4 ⊢ (𝑘 = 𝑀 → (𝐴 ∈ ℂ ↔ 𝐷 ∈ ℂ))
25		eluzfz1 10259	. . . . 5 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ (𝑀...𝑁))
26	9, 25	syl 14	. . . 4 ⊢ (𝜑 → 𝑀 ∈ (𝑀...𝑁))
27	24, 13, 26	rspcdva 2913	. . 3 ⊢ (𝜑 → 𝐷 ∈ ℂ)
28	7	eleq1d 2298	. . . 4 ⊢ (𝑘 = 𝑁 → (𝐴 ∈ ℂ ↔ 𝐸 ∈ ℂ))
29		eluzfz2 10260	. . . . 5 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑁 ∈ (𝑀...𝑁))
30	9, 29	syl 14	. . . 4 ⊢ (𝜑 → 𝑁 ∈ (𝑀...𝑁))
31	28, 13, 30	rspcdva 2913	. . 3 ⊢ (𝜑 → 𝐸 ∈ ℂ)
32	27, 31	neg2subd 8500	. 2 ⊢ (𝜑 → (-𝐷 − -𝐸) = (𝐸 − 𝐷))
33	12, 23, 32	3eqtr3d 2270	1 ⊢ (𝜑 → Σ𝑗 ∈ (𝑀..^𝑁)(𝐶 − 𝐵) = (𝐸 − 𝐷))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 ∀wral 2508 ‘cfv 5324 (class class class)co 6013 ℂcc 8023 1c1 8026 + caddc 8028 − cmin 8343 -cneg 8344 ℤ_≥cuz 9748 ...cfz 10236 ..^cfzo 10370 Σcsu 11907

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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4202 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-iinf 4684 ax-cnex 8116 ax-resscn 8117 ax-1cn 8118 ax-1re 8119 ax-icn 8120 ax-addcl 8121 ax-addrcl 8122 ax-mulcl 8123 ax-mulrcl 8124 ax-addcom 8125 ax-mulcom 8126 ax-addass 8127 ax-mulass 8128 ax-distr 8129 ax-i2m1 8130 ax-0lt1 8131 ax-1rid 8132 ax-0id 8133 ax-rnegex 8134 ax-precex 8135 ax-cnre 8136 ax-pre-ltirr 8137 ax-pre-ltwlin 8138 ax-pre-lttrn 8139 ax-pre-apti 8140 ax-pre-ltadd 8141 ax-pre-mulgt0 8142 ax-pre-mulext 8143 ax-arch 8144 ax-caucvg 8145

This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-if 3604 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-tr 4186 df-id 4388 df-po 4391 df-iso 4392 df-iord 4461 df-on 4463 df-ilim 4464 df-suc 4466 df-iom 4687 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-isom 5333 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-recs 6466 df-irdg 6531 df-frec 6552 df-1o 6577 df-oadd 6581 df-er 6697 df-en 6905 df-dom 6906 df-fin 6907 df-pnf 8209 df-mnf 8210 df-xr 8211 df-ltxr 8212 df-le 8213 df-sub 8345 df-neg 8346 df-reap 8748 df-ap 8755 df-div 8846 df-inn 9137 df-2 9195 df-3 9196 df-4 9197 df-n0 9396 df-z 9473 df-uz 9749 df-q 9847 df-rp 9882 df-fz 10237 df-fzo 10371 df-seqfrec 10703 df-exp 10794 df-ihash 11031 df-cj 11396 df-re 11397 df-im 11398 df-rsqrt 11552 df-abs 11553 df-clim 11833 df-sumdc 11908

This theorem is referenced by: telfsum2 12023

W3C validator