telfsumo2 - Intuitionistic Logic Explorer

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

Theorem telfsumo2 12030

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 8374	. . 3 ⊢ (𝑘 = 𝑗 → -𝐴 = -𝐵)
3		telfsumo.2	. . . 4 ⊢ (𝑘 = (𝑗 + 1) → 𝐴 = 𝐶)
4	3	negeqd 8374	. . 3 ⊢ (𝑘 = (𝑗 + 1) → -𝐴 = -𝐶)
5		telfsumo.3	. . . 4 ⊢ (𝑘 = 𝑀 → 𝐴 = 𝐷)
6	5	negeqd 8374	. . 3 ⊢ (𝑘 = 𝑀 → -𝐴 = -𝐷)
7		telfsumo.4	. . . 4 ⊢ (𝑘 = 𝑁 → 𝐴 = 𝐸)
8	7	negeqd 8374	. . 3 ⊢ (𝑘 = 𝑁 → -𝐴 = -𝐸)
9		telfsumo.5	. . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
10		telfsumo.6	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ)
11	10	negcld 8477	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → -𝐴 ∈ ℂ)
12	2, 4, 6, 8, 9, 11	telfsumo 12029	. 2 ⊢ (𝜑 → Σ𝑗 ∈ (𝑀..^𝑁)(-𝐵 − -𝐶) = (-𝐷 − -𝐸))
13	10	ralrimiva 2605	. . . . 5 ⊢ (𝜑 → ∀𝑘 ∈ (𝑀...𝑁)𝐴 ∈ ℂ)
14		elfzofz 10398	. . . . 5 ⊢ (𝑗 ∈ (𝑀..^𝑁) → 𝑗 ∈ (𝑀...𝑁))
15	1	eleq1d 2300	. . . . . 6 ⊢ (𝑘 = 𝑗 → (𝐴 ∈ ℂ ↔ 𝐵 ∈ ℂ))
16	15	rspccva 2909	. . . . 5 ⊢ ((∀𝑘 ∈ (𝑀...𝑁)𝐴 ∈ ℂ ∧ 𝑗 ∈ (𝑀...𝑁)) → 𝐵 ∈ ℂ)
17	13, 14, 16	syl2an 289	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀..^𝑁)) → 𝐵 ∈ ℂ)
18		fzofzp1 10473	. . . . 5 ⊢ (𝑗 ∈ (𝑀..^𝑁) → (𝑗 + 1) ∈ (𝑀...𝑁))
19	3	eleq1d 2300	. . . . . 6 ⊢ (𝑘 = (𝑗 + 1) → (𝐴 ∈ ℂ ↔ 𝐶 ∈ ℂ))
20	19	rspccva 2909	. . . . 5 ⊢ ((∀𝑘 ∈ (𝑀...𝑁)𝐴 ∈ ℂ ∧ (𝑗 + 1) ∈ (𝑀...𝑁)) → 𝐶 ∈ ℂ)
21	13, 18, 20	syl2an 289	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀..^𝑁)) → 𝐶 ∈ ℂ)
22	17, 21	neg2subd 8507	. . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀..^𝑁)) → (-𝐵 − -𝐶) = (𝐶 − 𝐵))
23	22	sumeq2dv 11930	. 2 ⊢ (𝜑 → Σ𝑗 ∈ (𝑀..^𝑁)(-𝐵 − -𝐶) = Σ𝑗 ∈ (𝑀..^𝑁)(𝐶 − 𝐵))
24	5	eleq1d 2300	. . . 4 ⊢ (𝑘 = 𝑀 → (𝐴 ∈ ℂ ↔ 𝐷 ∈ ℂ))
25		eluzfz1 10266	. . . . 5 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ (𝑀...𝑁))
26	9, 25	syl 14	. . . 4 ⊢ (𝜑 → 𝑀 ∈ (𝑀...𝑁))
27	24, 13, 26	rspcdva 2915	. . 3 ⊢ (𝜑 → 𝐷 ∈ ℂ)
28	7	eleq1d 2300	. . . 4 ⊢ (𝑘 = 𝑁 → (𝐴 ∈ ℂ ↔ 𝐸 ∈ ℂ))
29		eluzfz2 10267	. . . . 5 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑁 ∈ (𝑀...𝑁))
30	9, 29	syl 14	. . . 4 ⊢ (𝜑 → 𝑁 ∈ (𝑀...𝑁))
31	28, 13, 30	rspcdva 2915	. . 3 ⊢ (𝜑 → 𝐸 ∈ ℂ)
32	27, 31	neg2subd 8507	. 2 ⊢ (𝜑 → (-𝐷 − -𝐸) = (𝐸 − 𝐷))
33	12, 23, 32	3eqtr3d 2272	1 ⊢ (𝜑 → Σ𝑗 ∈ (𝑀..^𝑁)(𝐶 − 𝐵) = (𝐸 − 𝐷))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2202 ∀wral 2510 ‘cfv 5326 (class class class)co 6018 ℂcc 8030 1c1 8033 + caddc 8035 − cmin 8350 -cneg 8351 ℤ_≥cuz 9755 ...cfz 10243 ..^cfzo 10377 Σcsu 11915

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 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-mulrcl 8131 ax-addcom 8132 ax-mulcom 8133 ax-addass 8134 ax-mulass 8135 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-1rid 8139 ax-0id 8140 ax-rnegex 8141 ax-precex 8142 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148 ax-pre-mulgt0 8149 ax-pre-mulext 8150 ax-arch 8151 ax-caucvg 8152

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 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-1st 6303 df-2nd 6304 df-recs 6471 df-irdg 6536 df-frec 6557 df-1o 6582 df-oadd 6586 df-er 6702 df-en 6910 df-dom 6911 df-fin 6912 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-reap 8755 df-ap 8762 df-div 8853 df-inn 9144 df-2 9202 df-3 9203 df-4 9204 df-n0 9403 df-z 9480 df-uz 9756 df-q 9854 df-rp 9889 df-fz 10244 df-fzo 10378 df-seqfrec 10711 df-exp 10802 df-ihash 11039 df-cj 11404 df-re 11405 df-im 11406 df-rsqrt 11560 df-abs 11561 df-clim 11841 df-sumdc 11916

This theorem is referenced by: telfsum2 12032

W3C validator