| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gsummptnn0fzfv | Structured version Visualization version GIF version | ||
| Description: A final group sum over a function over the nonnegative integers (given as mapping to its function values) is equal to a final group sum over a finite interval of nonnegative integers. (Contributed by AV, 10-Oct-2019.) |
| Ref | Expression |
|---|---|
| gsummptnn0fzfv.b | ⊢ 𝐵 = (Base‘𝐺) |
| gsummptnn0fzfv.0 | ⊢ 0 = (0g‘𝐺) |
| gsummptnn0fzfv.g | ⊢ (𝜑 → 𝐺 ∈ CMnd) |
| gsummptnn0fzfv.f | ⊢ (𝜑 → 𝐹 ∈ (𝐵 ↑m ℕ0)) |
| gsummptnn0fzfv.s | ⊢ (𝜑 → 𝑆 ∈ ℕ0) |
| gsummptnn0fzfv.u | ⊢ (𝜑 → ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) |
| Ref | Expression |
|---|---|
| gsummptnn0fzfv | ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ ℕ0 ↦ (𝐹‘𝑘))) = (𝐺 Σg (𝑘 ∈ (0...𝑆) ↦ (𝐹‘𝑘)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | gsummptnn0fzfv.b | . 2 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | gsummptnn0fzfv.0 | . 2 ⊢ 0 = (0g‘𝐺) | |
| 3 | gsummptnn0fzfv.g | . 2 ⊢ (𝜑 → 𝐺 ∈ CMnd) | |
| 4 | gsummptnn0fzfv.f | . . . 4 ⊢ (𝜑 → 𝐹 ∈ (𝐵 ↑m ℕ0)) | |
| 5 | elmapi 8855 | . . . 4 ⊢ (𝐹 ∈ (𝐵 ↑m ℕ0) → 𝐹:ℕ0⟶𝐵) | |
| 6 | ffvelcdm 7077 | . . . . 5 ⊢ ((𝐹:ℕ0⟶𝐵 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) ∈ 𝐵) | |
| 7 | 6 | ex 418 | . . . 4 ⊢ (𝐹:ℕ0⟶𝐵 → (𝑘 ∈ ℕ0 → (𝐹‘𝑘) ∈ 𝐵)) |
| 8 | 4, 5, 7 | 3syl 19 | . . 3 ⊢ (𝜑 → (𝑘 ∈ ℕ0 → (𝐹‘𝑘) ∈ 𝐵)) |
| 9 | 8 | ralrimiv 3153 | . 2 ⊢ (𝜑 → ∀𝑘 ∈ ℕ0 (𝐹‘𝑘) ∈ 𝐵) |
| 10 | gsummptnn0fzfv.s | . 2 ⊢ (𝜑 → 𝑆 ∈ ℕ0) | |
| 11 | gsummptnn0fzfv.u | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) | |
| 12 | breq2 5107 | . . . . 5 ⊢ (𝑥 = 𝑘 → (𝑆 < 𝑥 ↔ 𝑆 < 𝑘)) | |
| 13 | fveqeq2 6890 | . . . . 5 ⊢ (𝑥 = 𝑘 → ((𝐹‘𝑥) = 0 ↔ (𝐹‘𝑘) = 0 )) | |
| 14 | 12, 13 | imbi12d 347 | . . . 4 ⊢ (𝑥 = 𝑘 → ((𝑆 < 𝑥 → (𝐹‘𝑥) = 0 ) ↔ (𝑆 < 𝑘 → (𝐹‘𝑘) = 0 ))) |
| 15 | 14 | cbvralvw 3240 | . . 3 ⊢ (∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 ) ↔ ∀𝑘 ∈ ℕ0 (𝑆 < 𝑘 → (𝐹‘𝑘) = 0 )) |
| 16 | 11, 15 | sylib 221 | . 2 ⊢ (𝜑 → ∀𝑘 ∈ ℕ0 (𝑆 < 𝑘 → (𝐹‘𝑘) = 0 )) |
| 17 | 1, 2, 3, 9, 10, 16 | gsummptnn0fz 20139 | 1 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ ℕ0 ↦ (𝐹‘𝑘))) = (𝐺 Σg (𝑘 ∈ (0...𝑆) ↦ (𝐹‘𝑘)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ∀wral 3076 class class class wbr 5103 ↦ cmpt 5186 ⟶wf 6531 ‘cfv 6535 (class class class)co 7416 ↑m cmap 8833 0cc0 11149 < clt 11292 ℕ0cn0 12553 ...cfz 13586 Basecbs 17326 0gc0g 17549 Σg cgsu 17550 CMndccmn 19933 |
| 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 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7742 ax-cnex 11205 ax-resscn 11206 ax-1cn 11207 ax-icn 11208 ax-addcl 11209 ax-addrcl 11210 ax-mulcl 11211 ax-mulrcl 11212 ax-mulcom 11213 ax-addass 11214 ax-mulass 11215 ax-distr 11216 ax-i2m1 11217 ax-1ne0 11218 ax-1rid 11219 ax-rnegex 11220 ax-rrecex 11221 ax-cnre 11222 ax-pre-lttri 11223 ax-pre-lttrn 11224 ax-pre-ltadd 11225 ax-pre-mulgt0 11226 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6301 df-ord 6362 df-on 6363 df-lim 6364 df-suc 6365 df-iota 6491 df-fun 6537 df-fn 6538 df-f 6539 df-f1 6540 df-fo 6541 df-f1o 6542 df-fv 6543 df-isom 6544 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7869 df-1st 7992 df-2nd 7993 df-supp 8164 df-frecs 8285 df-wrecs 8316 df-recs 8365 df-rdg 8404 df-1o 8462 df-er 8703 df-map 8835 df-en 8960 df-dom 8961 df-sdom 8962 df-fin 8963 df-fsupp 9339 df-oi 9489 df-card 9969 df-pnf 11294 df-mnf 11295 df-xr 11296 df-ltxr 11297 df-le 11298 df-sub 11492 df-neg 11493 df-nn 12283 df-n0 12554 df-z 12641 df-uz 12913 df-fz 13587 df-fzo 13735 df-seq 14091 df-hash 14420 df-0g 17551 df-gsum 17552 df-mgm 18755 df-sgrp 18847 df-mnd 18863 df-cntz 19470 df-cmn 19935 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |