Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fsfnn0gsumfsffz | Structured version Visualization version GIF version |
Description: Replacing a finitely supported function over the nonnegative integers by a function over a finite set of sequential integers in a finite group sum. (Contributed by AV, 9-Oct-2019.) |
Ref | Expression |
---|---|
nn0gsumfz.b | ⊢ 𝐵 = (Base‘𝐺) |
nn0gsumfz.0 | ⊢ 0 = (0g‘𝐺) |
nn0gsumfz.g | ⊢ (𝜑 → 𝐺 ∈ CMnd) |
nn0gsumfz.f | ⊢ (𝜑 → 𝐹 ∈ (𝐵 ↑m ℕ0)) |
fsfnn0gsumfsffz.s | ⊢ (𝜑 → 𝑆 ∈ ℕ0) |
fsfnn0gsumfsffz.h | ⊢ 𝐻 = (𝐹 ↾ (0...𝑆)) |
Ref | Expression |
---|---|
fsfnn0gsumfsffz | ⊢ (𝜑 → (∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 ) → (𝐺 Σg 𝐹) = (𝐺 Σg 𝐻))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fsfnn0gsumfsffz.h | . . . 4 ⊢ 𝐻 = (𝐹 ↾ (0...𝑆)) | |
2 | 1 | oveq2i 7266 | . . 3 ⊢ (𝐺 Σg 𝐻) = (𝐺 Σg (𝐹 ↾ (0...𝑆))) |
3 | nn0gsumfz.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
4 | nn0gsumfz.0 | . . . 4 ⊢ 0 = (0g‘𝐺) | |
5 | nn0gsumfz.g | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ CMnd) | |
6 | 5 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → 𝐺 ∈ CMnd) |
7 | nn0ex 12169 | . . . . 5 ⊢ ℕ0 ∈ V | |
8 | 7 | a1i 11 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → ℕ0 ∈ V) |
9 | nn0gsumfz.f | . . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (𝐵 ↑m ℕ0)) | |
10 | elmapi 8595 | . . . . . 6 ⊢ (𝐹 ∈ (𝐵 ↑m ℕ0) → 𝐹:ℕ0⟶𝐵) | |
11 | 9, 10 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝐹:ℕ0⟶𝐵) |
12 | 11 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → 𝐹:ℕ0⟶𝐵) |
13 | 4 | fvexi 6770 | . . . . . 6 ⊢ 0 ∈ V |
14 | 13 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → 0 ∈ V) |
15 | 9 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → 𝐹 ∈ (𝐵 ↑m ℕ0)) |
16 | fsfnn0gsumfsffz.s | . . . . . 6 ⊢ (𝜑 → 𝑆 ∈ ℕ0) | |
17 | 16 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → 𝑆 ∈ ℕ0) |
18 | simpr 484 | . . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) | |
19 | 14, 15, 17, 18 | suppssfz 13642 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → (𝐹 supp 0 ) ⊆ (0...𝑆)) |
20 | elmapfun 8612 | . . . . . . . 8 ⊢ (𝐹 ∈ (𝐵 ↑m ℕ0) → Fun 𝐹) | |
21 | 9, 20 | syl 17 | . . . . . . 7 ⊢ (𝜑 → Fun 𝐹) |
22 | 13 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → 0 ∈ V) |
23 | 9, 21, 22 | 3jca 1126 | . . . . . 6 ⊢ (𝜑 → (𝐹 ∈ (𝐵 ↑m ℕ0) ∧ Fun 𝐹 ∧ 0 ∈ V)) |
24 | fzfid 13621 | . . . . . . 7 ⊢ (𝜑 → (0...𝑆) ∈ Fin) | |
25 | 24 | anim1i 614 | . . . . . 6 ⊢ ((𝜑 ∧ (𝐹 supp 0 ) ⊆ (0...𝑆)) → ((0...𝑆) ∈ Fin ∧ (𝐹 supp 0 ) ⊆ (0...𝑆))) |
26 | suppssfifsupp 9073 | . . . . . 6 ⊢ (((𝐹 ∈ (𝐵 ↑m ℕ0) ∧ Fun 𝐹 ∧ 0 ∈ V) ∧ ((0...𝑆) ∈ Fin ∧ (𝐹 supp 0 ) ⊆ (0...𝑆))) → 𝐹 finSupp 0 ) | |
27 | 23, 25, 26 | syl2an2r 681 | . . . . 5 ⊢ ((𝜑 ∧ (𝐹 supp 0 ) ⊆ (0...𝑆)) → 𝐹 finSupp 0 ) |
28 | 19, 27 | syldan 590 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → 𝐹 finSupp 0 ) |
29 | 3, 4, 6, 8, 12, 19, 28 | gsumres 19429 | . . 3 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → (𝐺 Σg (𝐹 ↾ (0...𝑆))) = (𝐺 Σg 𝐹)) |
30 | 2, 29 | eqtr2id 2792 | . 2 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → (𝐺 Σg 𝐹) = (𝐺 Σg 𝐻)) |
31 | 30 | ex 412 | 1 ⊢ (𝜑 → (∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 ) → (𝐺 Σg 𝐹) = (𝐺 Σg 𝐻))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ∀wral 3063 Vcvv 3422 ⊆ wss 3883 class class class wbr 5070 ↾ cres 5582 Fun wfun 6412 ⟶wf 6414 ‘cfv 6418 (class class class)co 7255 supp csupp 7948 ↑m cmap 8573 Fincfn 8691 finSupp cfsupp 9058 0cc0 10802 < clt 10940 ℕ0cn0 12163 ...cfz 13168 Basecbs 16840 0gc0g 17067 Σg cgsu 17068 CMndccmn 19301 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-se 5536 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-isom 6427 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-supp 7949 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-er 8456 df-map 8575 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-fsupp 9059 df-oi 9199 df-card 9628 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-n0 12164 df-z 12250 df-uz 12512 df-fz 13169 df-fzo 13312 df-seq 13650 df-hash 13973 df-0g 17069 df-gsum 17070 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-cntz 18838 df-cmn 19303 |
This theorem is referenced by: nn0gsumfz 19500 gsummptnn0fz 19502 |
Copyright terms: Public domain | W3C validator |