| 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 8782 | . . . 4 ⊢ (𝐹 ∈ (𝐵 ↑m ℕ0) → 𝐹:ℕ0⟶𝐵) | |
| 6 | ffvelcdm 7023 | . . . . 5 ⊢ ((𝐹:ℕ0⟶𝐵 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) ∈ 𝐵) | |
| 7 | 6 | ex 412 | . . . 4 ⊢ (𝐹:ℕ0⟶𝐵 → (𝑘 ∈ ℕ0 → (𝐹‘𝑘) ∈ 𝐵)) |
| 8 | 4, 5, 7 | 3syl 18 | . . 3 ⊢ (𝜑 → (𝑘 ∈ ℕ0 → (𝐹‘𝑘) ∈ 𝐵)) |
| 9 | 8 | ralrimiv 3125 | . 2 ⊢ (𝜑 → ∀𝑘 ∈ ℕ0 (𝐹‘𝑘) ∈ 𝐵) |
| 10 | gsummptnn0fzfv.s | . 2 ⊢ (𝜑 → 𝑆 ∈ ℕ0) | |
| 11 | gsummptnn0fzfv.u | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) | |
| 12 | breq2 5099 | . . . . 5 ⊢ (𝑥 = 𝑘 → (𝑆 < 𝑥 ↔ 𝑆 < 𝑘)) | |
| 13 | fveqeq2 6840 | . . . . 5 ⊢ (𝑥 = 𝑘 → ((𝐹‘𝑥) = 0 ↔ (𝐹‘𝑘) = 0 )) | |
| 14 | 12, 13 | imbi12d 344 | . . . 4 ⊢ (𝑥 = 𝑘 → ((𝑆 < 𝑥 → (𝐹‘𝑥) = 0 ) ↔ (𝑆 < 𝑘 → (𝐹‘𝑘) = 0 ))) |
| 15 | 14 | cbvralvw 3212 | . . 3 ⊢ (∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 ) ↔ ∀𝑘 ∈ ℕ0 (𝑆 < 𝑘 → (𝐹‘𝑘) = 0 )) |
| 16 | 11, 15 | sylib 218 | . 2 ⊢ (𝜑 → ∀𝑘 ∈ ℕ0 (𝑆 < 𝑘 → (𝐹‘𝑘) = 0 )) |
| 17 | 1, 2, 3, 9, 10, 16 | gsummptnn0fz 19908 | 1 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ ℕ0 ↦ (𝐹‘𝑘))) = (𝐺 Σg (𝑘 ∈ (0...𝑆) ↦ (𝐹‘𝑘)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 ∀wral 3049 class class class wbr 5095 ↦ cmpt 5176 ⟶wf 6485 ‘cfv 6489 (class class class)co 7355 ↑m cmap 8759 0cc0 11016 < clt 11156 ℕ0cn0 12391 ...cfz 13417 Basecbs 17130 0gc0g 17353 Σg cgsu 17354 CMndccmn 19702 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 ax-cnex 11072 ax-resscn 11073 ax-1cn 11074 ax-icn 11075 ax-addcl 11076 ax-addrcl 11077 ax-mulcl 11078 ax-mulrcl 11079 ax-mulcom 11080 ax-addass 11081 ax-mulass 11082 ax-distr 11083 ax-i2m1 11084 ax-1ne0 11085 ax-1rid 11086 ax-rnegex 11087 ax-rrecex 11088 ax-cnre 11089 ax-pre-lttri 11090 ax-pre-lttrn 11091 ax-pre-ltadd 11092 ax-pre-mulgt0 11093 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-int 4900 df-iun 4945 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-se 5575 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-isom 6498 df-riota 7312 df-ov 7358 df-oprab 7359 df-mpo 7360 df-om 7806 df-1st 7930 df-2nd 7931 df-supp 8100 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-1o 8394 df-er 8631 df-map 8761 df-en 8879 df-dom 8880 df-sdom 8881 df-fin 8882 df-fsupp 9256 df-oi 9406 df-card 9842 df-pnf 11158 df-mnf 11159 df-xr 11160 df-ltxr 11161 df-le 11162 df-sub 11356 df-neg 11357 df-nn 12136 df-n0 12392 df-z 12479 df-uz 12743 df-fz 13418 df-fzo 13565 df-seq 13919 df-hash 14248 df-0g 17355 df-gsum 17356 df-mgm 18558 df-sgrp 18637 df-mnd 18653 df-cntz 19239 df-cmn 19704 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |