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 | ⊢ (𝜑 → 𝐹 ∈ (𝐵 ↑𝑚 ℕ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 ⊢ (𝜑 → 𝐹 ∈ (𝐵 ↑𝑚 ℕ0)) | |
5 | elmapi 7879 | . . . 4 ⊢ (𝐹 ∈ (𝐵 ↑𝑚 ℕ0) → 𝐹:ℕ0⟶𝐵) | |
6 | ffvelrn 6357 | . . . . 5 ⊢ ((𝐹:ℕ0⟶𝐵 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) ∈ 𝐵) | |
7 | 6 | ex 450 | . . . 4 ⊢ (𝐹:ℕ0⟶𝐵 → (𝑘 ∈ ℕ0 → (𝐹‘𝑘) ∈ 𝐵)) |
8 | 4, 5, 7 | 3syl 18 | . . 3 ⊢ (𝜑 → (𝑘 ∈ ℕ0 → (𝐹‘𝑘) ∈ 𝐵)) |
9 | 8 | ralrimiv 2965 | . 2 ⊢ (𝜑 → ∀𝑘 ∈ ℕ0 (𝐹‘𝑘) ∈ 𝐵) |
10 | gsummptnn0fzfv.s | . 2 ⊢ (𝜑 → 𝑆 ∈ ℕ0) | |
11 | gsummptnn0fzfv.u | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) | |
12 | breq2 4657 | . . . . 5 ⊢ (𝑥 = 𝑘 → (𝑆 < 𝑥 ↔ 𝑆 < 𝑘)) | |
13 | fveq2 6191 | . . . . . 6 ⊢ (𝑥 = 𝑘 → (𝐹‘𝑥) = (𝐹‘𝑘)) | |
14 | 13 | eqeq1d 2624 | . . . . 5 ⊢ (𝑥 = 𝑘 → ((𝐹‘𝑥) = 0 ↔ (𝐹‘𝑘) = 0 )) |
15 | 12, 14 | imbi12d 334 | . . . 4 ⊢ (𝑥 = 𝑘 → ((𝑆 < 𝑥 → (𝐹‘𝑥) = 0 ) ↔ (𝑆 < 𝑘 → (𝐹‘𝑘) = 0 ))) |
16 | 15 | cbvralv 3171 | . . 3 ⊢ (∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 ) ↔ ∀𝑘 ∈ ℕ0 (𝑆 < 𝑘 → (𝐹‘𝑘) = 0 )) |
17 | 11, 16 | sylib 208 | . 2 ⊢ (𝜑 → ∀𝑘 ∈ ℕ0 (𝑆 < 𝑘 → (𝐹‘𝑘) = 0 )) |
18 | 1, 2, 3, 9, 10, 17 | gsummptnn0fzv 18383 | 1 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ ℕ0 ↦ (𝐹‘𝑘))) = (𝐺 Σg (𝑘 ∈ (0...𝑆) ↦ (𝐹‘𝑘)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1483 ∈ wcel 1990 ∀wral 2912 class class class wbr 4653 ↦ cmpt 4729 ⟶wf 5884 ‘cfv 5888 (class class class)co 6650 ↑𝑚 cmap 7857 0cc0 9936 < clt 10074 ℕ0cn0 11292 ...cfz 12326 Basecbs 15857 0gc0g 16100 Σg cgsu 16101 CMndccmn 18193 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-fal 1489 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-se 5074 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-isom 5897 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-supp 7296 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-map 7859 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-fsupp 8276 df-oi 8415 df-card 8765 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-n0 11293 df-z 11378 df-uz 11688 df-fz 12327 df-fzo 12466 df-seq 12802 df-hash 13118 df-0g 16102 df-gsum 16103 df-mgm 17242 df-sgrp 17284 df-mnd 17295 df-cntz 17750 df-cmn 18195 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |