| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > telgsumfz | Structured version Visualization version GIF version | ||
| Description: Telescoping group sum ranging over a finite set of sequential integers, using implicit substitution, analogous to telfsum 15891. (Contributed by AV, 23-Nov-2019.) |
| Ref | Expression |
|---|---|
| telgsumfz.b | ⊢ 𝐵 = (Base‘𝐺) |
| telgsumfz.g | ⊢ (𝜑 → 𝐺 ∈ Abel) |
| telgsumfz.m | ⊢ − = (-g‘𝐺) |
| telgsumfz.n | ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) |
| telgsumfz.f | ⊢ (𝜑 → ∀𝑘 ∈ (𝑀...(𝑁 + 1))𝐴 ∈ 𝐵) |
| telgsumfz.l | ⊢ (𝑘 = 𝑖 → 𝐴 = 𝐿) |
| telgsumfz.c | ⊢ (𝑘 = (𝑖 + 1) → 𝐴 = 𝐶) |
| telgsumfz.d | ⊢ (𝑘 = 𝑀 → 𝐴 = 𝐷) |
| telgsumfz.e | ⊢ (𝑘 = (𝑁 + 1) → 𝐴 = 𝐸) |
| Ref | Expression |
|---|---|
| telgsumfz | ⊢ (𝜑 → (𝐺 Σg (𝑖 ∈ (𝑀...𝑁) ↦ (𝐿 − 𝐶))) = (𝐷 − 𝐸)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 490 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝑀...𝑁)) → 𝑖 ∈ (𝑀...𝑁)) | |
| 2 | telgsumfz.l | . . . . . . . 8 ⊢ (𝑘 = 𝑖 → 𝐴 = 𝐿) | |
| 3 | 2 | adantl 487 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑖 ∈ (𝑀...𝑁)) ∧ 𝑘 = 𝑖) → 𝐴 = 𝐿) |
| 4 | 1, 3 | csbied 3886 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝑀...𝑁)) → ⦋𝑖 / 𝑘⦌𝐴 = 𝐿) |
| 5 | 4 | eqcomd 2768 | . . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝑀...𝑁)) → 𝐿 = ⦋𝑖 / 𝑘⦌𝐴) |
| 6 | ovexd 7451 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝑀...𝑁)) → (𝑖 + 1) ∈ V) | |
| 7 | telgsumfz.c | . . . . . . . 8 ⊢ (𝑘 = (𝑖 + 1) → 𝐴 = 𝐶) | |
| 8 | 7 | adantl 487 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑖 ∈ (𝑀...𝑁)) ∧ 𝑘 = (𝑖 + 1)) → 𝐴 = 𝐶) |
| 9 | 6, 8 | csbied 3886 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝑀...𝑁)) → ⦋(𝑖 + 1) / 𝑘⦌𝐴 = 𝐶) |
| 10 | 9 | eqcomd 2768 | . . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝑀...𝑁)) → 𝐶 = ⦋(𝑖 + 1) / 𝑘⦌𝐴) |
| 11 | 5, 10 | oveq12d 7434 | . . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝑀...𝑁)) → (𝐿 − 𝐶) = (⦋𝑖 / 𝑘⦌𝐴 − ⦋(𝑖 + 1) / 𝑘⦌𝐴)) |
| 12 | 11 | mpteq2dva 5202 | . . 3 ⊢ (𝜑 → (𝑖 ∈ (𝑀...𝑁) ↦ (𝐿 − 𝐶)) = (𝑖 ∈ (𝑀...𝑁) ↦ (⦋𝑖 / 𝑘⦌𝐴 − ⦋(𝑖 + 1) / 𝑘⦌𝐴))) |
| 13 | 12 | oveq2d 7432 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝑖 ∈ (𝑀...𝑁) ↦ (𝐿 − 𝐶))) = (𝐺 Σg (𝑖 ∈ (𝑀...𝑁) ↦ (⦋𝑖 / 𝑘⦌𝐴 − ⦋(𝑖 + 1) / 𝑘⦌𝐴)))) |
| 14 | telgsumfz.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 15 | telgsumfz.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ Abel) | |
| 16 | telgsumfz.m | . . 3 ⊢ − = (-g‘𝐺) | |
| 17 | telgsumfz.n | . . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) | |
| 18 | telgsumfz.f | . . 3 ⊢ (𝜑 → ∀𝑘 ∈ (𝑀...(𝑁 + 1))𝐴 ∈ 𝐵) | |
| 19 | 14, 15, 16, 17, 18 | telgsumfzs 20115 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝑖 ∈ (𝑀...𝑁) ↦ (⦋𝑖 / 𝑘⦌𝐴 − ⦋(𝑖 + 1) / 𝑘⦌𝐴))) = (⦋𝑀 / 𝑘⦌𝐴 − ⦋(𝑁 + 1) / 𝑘⦌𝐴)) |
| 20 | 17 | elfvexd 6918 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ V) |
| 21 | telgsumfz.d | . . . . 5 ⊢ (𝑘 = 𝑀 → 𝐴 = 𝐷) | |
| 22 | 21 | adantl 487 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 = 𝑀) → 𝐴 = 𝐷) |
| 23 | 20, 22 | csbied 3886 | . . 3 ⊢ (𝜑 → ⦋𝑀 / 𝑘⦌𝐴 = 𝐷) |
| 24 | ovexd 7451 | . . . 4 ⊢ (𝜑 → (𝑁 + 1) ∈ V) | |
| 25 | telgsumfz.e | . . . . 5 ⊢ (𝑘 = (𝑁 + 1) → 𝐴 = 𝐸) | |
| 26 | 25 | adantl 487 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 = (𝑁 + 1)) → 𝐴 = 𝐸) |
| 27 | 24, 26 | csbied 3886 | . . 3 ⊢ (𝜑 → ⦋(𝑁 + 1) / 𝑘⦌𝐴 = 𝐸) |
| 28 | 23, 27 | oveq12d 7434 | . 2 ⊢ (𝜑 → (⦋𝑀 / 𝑘⦌𝐴 − ⦋(𝑁 + 1) / 𝑘⦌𝐴) = (𝐷 − 𝐸)) |
| 29 | 13, 19, 28 | 3eqtrd 2801 | 1 ⊢ (𝜑 → (𝐺 Σg (𝑖 ∈ (𝑀...𝑁) ↦ (𝐿 − 𝐶))) = (𝐷 − 𝐸)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3078 Vcvv 3453 ⦋csb 3850 ↦ cmpt 5190 ‘cfv 6537 (class class class)co 7416 1c1 11126 + caddc 11128 ℤ≥cuz 12888 ...cfz 13561 Basecbs 17303 Σg cgsu 17527 -gcsg 19058 Abelcabl 19907 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11181 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-pre-mulgt0 11202 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-iin 4957 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-se 5613 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-of 7681 df-om 7866 df-1st 7989 df-2nd 7990 df-supp 8162 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8458 df-2o 8459 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-fsupp 9335 df-oi 9485 df-card 9947 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-sub 11468 df-neg 11469 df-nn 12259 df-2 12328 df-n0 12530 df-z 12617 df-uz 12889 df-fz 13562 df-fzo 13710 df-seq 14066 df-hash 14395 df-sets 17258 df-slot 17276 df-ndx 17288 df-base 17304 df-ress 17325 df-plusg 17357 df-0g 17528 df-gsum 17529 df-mre 17672 df-mrc 17673 df-acs 17675 df-mgm 18732 df-sgrp 18821 df-mnd 18837 df-submnd 18891 df-grp 19059 df-minusg 19060 df-sbg 19061 df-mulg 19190 df-cntz 19443 df-cmn 19908 df-abl 19909 |
| This theorem is used by: cayhamlem1 23090 |
| Copyright terms: Public domain | W3C validator |