| 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 7411 | . . 3 ⊢ (𝐺 Σg 𝐻) = (𝐺 Σg (𝐹 ↾ (0...𝑆))) |
| 3 | nn0gsumfz.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 4 | nn0gsumfz.0 | . . . 4 ⊢ 0 = (0g‘𝐺) | |
| 5 | nn0gsumfz.g | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ CMnd) | |
| 6 | 5 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → 𝐺 ∈ CMnd) |
| 7 | nn0ex 12498 | . . . . 5 ⊢ ℕ0 ∈ V | |
| 8 | 7 | a1i 11 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → ℕ0 ∈ V) |
| 9 | nn0gsumfz.f | . . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (𝐵 ↑m ℕ0)) | |
| 10 | elmapi 8834 | . . . . . 6 ⊢ (𝐹 ∈ (𝐵 ↑m ℕ0) → 𝐹:ℕ0⟶𝐵) | |
| 11 | 9, 10 | syl 18 | . . . . 5 ⊢ (𝜑 → 𝐹:ℕ0⟶𝐵) |
| 12 | 11 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → 𝐹:ℕ0⟶𝐵) |
| 13 | 4 | fvexi 6885 | . . . . . 6 ⊢ 0 ∈ V |
| 14 | 13 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → 0 ∈ V) |
| 15 | 9 | adantr 485 | . . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → 𝐹 ∈ (𝐵 ↑m ℕ0)) |
| 16 | fsfnn0gsumfsffz.s | . . . . . 6 ⊢ (𝜑 → 𝑆 ∈ ℕ0) | |
| 17 | 16 | adantr 485 | . . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → 𝑆 ∈ ℕ0) |
| 18 | simpr 489 | . . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) | |
| 19 | 14, 15, 17, 18 | suppssfz 14018 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → (𝐹 supp 0 ) ⊆ (0...𝑆)) |
| 20 | elmapfun 8851 | . . . . . . . 8 ⊢ (𝐹 ∈ (𝐵 ↑m ℕ0) → Fun 𝐹) | |
| 21 | 9, 20 | syl 18 | . . . . . . 7 ⊢ (𝜑 → Fun 𝐹) |
| 22 | 13 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → 0 ∈ V) |
| 23 | 9, 21, 22 | 3jca 1144 | . . . . . 6 ⊢ (𝜑 → (𝐹 ∈ (𝐵 ↑m ℕ0) ∧ Fun 𝐹 ∧ 0 ∈ V)) |
| 24 | fzfid 13997 | . . . . . . 7 ⊢ (𝜑 → (0...𝑆) ∈ Fin) | |
| 25 | 24 | anim1i 626 | . . . . . 6 ⊢ ((𝜑 ∧ (𝐹 supp 0 ) ⊆ (0...𝑆)) → ((0...𝑆) ∈ Fin ∧ (𝐹 supp 0 ) ⊆ (0...𝑆))) |
| 26 | suppssfifsupp 9328 | . . . . . 6 ⊢ (((𝐹 ∈ (𝐵 ↑m ℕ0) ∧ Fun 𝐹 ∧ 0 ∈ V) ∧ ((0...𝑆) ∈ Fin ∧ (𝐹 supp 0 ) ⊆ (0...𝑆))) → 𝐹 finSupp 0 ) | |
| 27 | 23, 25, 26 | syl2an2r 697 | . . . . 5 ⊢ ((𝜑 ∧ (𝐹 supp 0 ) ⊆ (0...𝑆)) → 𝐹 finSupp 0 ) |
| 28 | 19, 27 | syldan 602 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → 𝐹 finSupp 0 ) |
| 29 | 3, 4, 6, 8, 12, 19, 28 | gsumres 19971 | . . 3 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → (𝐺 Σg (𝐹 ↾ (0...𝑆))) = (𝐺 Σg 𝐹)) |
| 30 | 2, 29 | eqtr2id 2813 | . 2 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → (𝐺 Σg 𝐹) = (𝐺 Σg 𝐻)) |
| 31 | 30 | ex 417 | 1 ⊢ (𝜑 → (∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 ) → (𝐺 Σg 𝐹) = (𝐺 Σg 𝐻))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 ∀wral 3079 Vcvv 3457 ⊆ wss 3907 class class class wbr 5104 ↾ cres 5653 Fun wfun 6519 ⟶wf 6521 ‘cfv 6525 (class class class)co 7400 supp csupp 8144 ↑m cmap 8812 Fincfn 8931 finSupp cfsupp 9309 0cc0 11088 < clt 11231 ℕ0cn0 12492 ...cfz 13523 Basecbs 17257 0gc0g 17480 Σg cgsu 17481 CMndccmn 19838 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5231 ax-sep 5250 ax-nul 5260 ax-pow 5326 ax-pr 5394 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-int 4908 df-iun 4953 df-br 5105 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6291 df-ord 6352 df-on 6353 df-lim 6354 df-suc 6355 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-isom 6534 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-supp 8145 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-er 8682 df-map 8814 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-fsupp 9310 df-oi 9460 df-card 9913 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12222 df-n0 12493 df-z 12580 df-uz 12851 df-fz 13524 df-fzo 13671 df-seq 14026 df-hash 14355 df-0g 17482 df-gsum 17483 df-mgm 18686 df-sgrp 18765 df-mnd 18781 df-cntz 19375 df-cmn 19840 |
| This theorem is referenced by: nn0gsumfz 20042 gsummptnn0fz 20044 |
| Copyright terms: Public domain | W3C validator |