| 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 7369 | . . 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 12432 | . . . . 5 ⊢ ℕ0 ∈ V | |
| 8 | 7 | a1i 11 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → ℕ0 ∈ V) |
| 9 | nn0gsumfz.f | . . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (𝐵 ↑m ℕ0)) | |
| 10 | elmapi 8787 | . . . . . 6 ⊢ (𝐹 ∈ (𝐵 ↑m ℕ0) → 𝐹:ℕ0⟶𝐵) | |
| 11 | 9, 10 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝐹:ℕ0⟶𝐵) |
| 12 | 11 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → 𝐹:ℕ0⟶𝐵) |
| 13 | 4 | fvexi 6846 | . . . . . 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 13945 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → (𝐹 supp 0 ) ⊆ (0...𝑆)) |
| 20 | elmapfun 8804 | . . . . . . . 8 ⊢ (𝐹 ∈ (𝐵 ↑m ℕ0) → Fun 𝐹) | |
| 21 | 9, 20 | syl 17 | . . . . . . 7 ⊢ (𝜑 → Fun 𝐹) |
| 22 | 13 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → 0 ∈ V) |
| 23 | 9, 21, 22 | 3jca 1129 | . . . . . 6 ⊢ (𝜑 → (𝐹 ∈ (𝐵 ↑m ℕ0) ∧ Fun 𝐹 ∧ 0 ∈ V)) |
| 24 | fzfid 13924 | . . . . . . 7 ⊢ (𝜑 → (0...𝑆) ∈ Fin) | |
| 25 | 24 | anim1i 616 | . . . . . 6 ⊢ ((𝜑 ∧ (𝐹 supp 0 ) ⊆ (0...𝑆)) → ((0...𝑆) ∈ Fin ∧ (𝐹 supp 0 ) ⊆ (0...𝑆))) |
| 26 | suppssfifsupp 9284 | . . . . . 6 ⊢ (((𝐹 ∈ (𝐵 ↑m ℕ0) ∧ Fun 𝐹 ∧ 0 ∈ V) ∧ ((0...𝑆) ∈ Fin ∧ (𝐹 supp 0 ) ⊆ (0...𝑆))) → 𝐹 finSupp 0 ) | |
| 27 | 23, 25, 26 | syl2an2r 686 | . . . . 5 ⊢ ((𝜑 ∧ (𝐹 supp 0 ) ⊆ (0...𝑆)) → 𝐹 finSupp 0 ) |
| 28 | 19, 27 | syldan 592 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → 𝐹 finSupp 0 ) |
| 29 | 3, 4, 6, 8, 12, 19, 28 | gsumres 19877 | . . 3 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → (𝐺 Σg (𝐹 ↾ (0...𝑆))) = (𝐺 Σg 𝐹)) |
| 30 | 2, 29 | eqtr2id 2785 | . 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 1087 = wceq 1542 ∈ wcel 2114 ∀wral 3052 Vcvv 3430 ⊆ wss 3890 class class class wbr 5086 ↾ cres 5624 Fun wfun 6484 ⟶wf 6486 ‘cfv 6490 (class class class)co 7358 supp csupp 8101 ↑m cmap 8764 Fincfn 8884 finSupp cfsupp 9265 0cc0 11027 < clt 11168 ℕ0cn0 12426 ...cfz 13450 Basecbs 17168 0gc0g 17391 Σg cgsu 17392 CMndccmn 19744 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5368 ax-un 7680 ax-cnex 11083 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-addrcl 11088 ax-mulcl 11089 ax-mulrcl 11090 ax-mulcom 11091 ax-addass 11092 ax-mulass 11093 ax-distr 11094 ax-i2m1 11095 ax-1ne0 11096 ax-1rid 11097 ax-rnegex 11098 ax-rrecex 11099 ax-cnre 11100 ax-pre-lttri 11101 ax-pre-lttrn 11102 ax-pre-ltadd 11103 ax-pre-mulgt0 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-se 5576 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-isom 6499 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-supp 8102 df-frecs 8222 df-wrecs 8253 df-recs 8302 df-rdg 8340 df-1o 8396 df-er 8634 df-map 8766 df-en 8885 df-dom 8886 df-sdom 8887 df-fin 8888 df-fsupp 9266 df-oi 9416 df-card 9852 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-nn 12164 df-n0 12427 df-z 12514 df-uz 12778 df-fz 13451 df-fzo 13598 df-seq 13953 df-hash 14282 df-0g 17393 df-gsum 17394 df-mgm 18597 df-sgrp 18676 df-mnd 18692 df-cntz 19281 df-cmn 19746 |
| This theorem is referenced by: nn0gsumfz 19948 gsummptnn0fz 19950 |
| Copyright terms: Public domain | W3C validator |