telfsumo2 - Intuitionistic Logic Explorer

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

Theorem telfsumo2 11408

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 8093	. . 3 ⊢ (𝑘 = 𝑗 → -𝐴 = -𝐵)
3		telfsumo.2	. . . 4 ⊢ (𝑘 = (𝑗 + 1) → 𝐴 = 𝐶)
4	3	negeqd 8093	. . 3 ⊢ (𝑘 = (𝑗 + 1) → -𝐴 = -𝐶)
5		telfsumo.3	. . . 4 ⊢ (𝑘 = 𝑀 → 𝐴 = 𝐷)
6	5	negeqd 8093	. . 3 ⊢ (𝑘 = 𝑀 → -𝐴 = -𝐷)
7		telfsumo.4	. . . 4 ⊢ (𝑘 = 𝑁 → 𝐴 = 𝐸)
8	7	negeqd 8093	. . 3 ⊢ (𝑘 = 𝑁 → -𝐴 = -𝐸)
9		telfsumo.5	. . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
10		telfsumo.6	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ)
11	10	negcld 8196	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → -𝐴 ∈ ℂ)
12	2, 4, 6, 8, 9, 11	telfsumo 11407	. 2 ⊢ (𝜑 → Σ𝑗 ∈ (𝑀..^𝑁)(-𝐵 − -𝐶) = (-𝐷 − -𝐸))
13	10	ralrimiva 2539	. . . . 5 ⊢ (𝜑 → ∀𝑘 ∈ (𝑀...𝑁)𝐴 ∈ ℂ)
14		elfzofz 10097	. . . . 5 ⊢ (𝑗 ∈ (𝑀..^𝑁) → 𝑗 ∈ (𝑀...𝑁))
15	1	eleq1d 2235	. . . . . 6 ⊢ (𝑘 = 𝑗 → (𝐴 ∈ ℂ ↔ 𝐵 ∈ ℂ))
16	15	rspccva 2829	. . . . 5 ⊢ ((∀𝑘 ∈ (𝑀...𝑁)𝐴 ∈ ℂ ∧ 𝑗 ∈ (𝑀...𝑁)) → 𝐵 ∈ ℂ)
17	13, 14, 16	syl2an 287	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀..^𝑁)) → 𝐵 ∈ ℂ)
18		fzofzp1 10162	. . . . 5 ⊢ (𝑗 ∈ (𝑀..^𝑁) → (𝑗 + 1) ∈ (𝑀...𝑁))
19	3	eleq1d 2235	. . . . . 6 ⊢ (𝑘 = (𝑗 + 1) → (𝐴 ∈ ℂ ↔ 𝐶 ∈ ℂ))
20	19	rspccva 2829	. . . . 5 ⊢ ((∀𝑘 ∈ (𝑀...𝑁)𝐴 ∈ ℂ ∧ (𝑗 + 1) ∈ (𝑀...𝑁)) → 𝐶 ∈ ℂ)
21	13, 18, 20	syl2an 287	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀..^𝑁)) → 𝐶 ∈ ℂ)
22	17, 21	neg2subd 8226	. . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀..^𝑁)) → (-𝐵 − -𝐶) = (𝐶 − 𝐵))
23	22	sumeq2dv 11309	. 2 ⊢ (𝜑 → Σ𝑗 ∈ (𝑀..^𝑁)(-𝐵 − -𝐶) = Σ𝑗 ∈ (𝑀..^𝑁)(𝐶 − 𝐵))
24	5	eleq1d 2235	. . . 4 ⊢ (𝑘 = 𝑀 → (𝐴 ∈ ℂ ↔ 𝐷 ∈ ℂ))
25		eluzfz1 9966	. . . . 5 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ (𝑀...𝑁))
26	9, 25	syl 14	. . . 4 ⊢ (𝜑 → 𝑀 ∈ (𝑀...𝑁))
27	24, 13, 26	rspcdva 2835	. . 3 ⊢ (𝜑 → 𝐷 ∈ ℂ)
28	7	eleq1d 2235	. . . 4 ⊢ (𝑘 = 𝑁 → (𝐴 ∈ ℂ ↔ 𝐸 ∈ ℂ))
29		eluzfz2 9967	. . . . 5 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑁 ∈ (𝑀...𝑁))
30	9, 29	syl 14	. . . 4 ⊢ (𝜑 → 𝑁 ∈ (𝑀...𝑁))
31	28, 13, 30	rspcdva 2835	. . 3 ⊢ (𝜑 → 𝐸 ∈ ℂ)
32	27, 31	neg2subd 8226	. 2 ⊢ (𝜑 → (-𝐷 − -𝐸) = (𝐸 − 𝐷))
33	12, 23, 32	3eqtr3d 2206	1 ⊢ (𝜑 → Σ𝑗 ∈ (𝑀..^𝑁)(𝐶 − 𝐵) = (𝐸 − 𝐷))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 103 = wceq 1343 ∈ wcel 2136 ∀wral 2444 ‘cfv 5188 (class class class)co 5842 ℂcc 7751 1c1 7754 + caddc 7756 − cmin 8069 -cneg 8070 ℤ_≥cuz 9466 ...cfz 9944 ..^cfzo 10077 Σ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: telfsum2 11410

W3C validator