| 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 7421 | . . 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 12509 | . . . . 5 ⊢ ℕ0 ∈ V | |
| 8 | 7 | a1i 11 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → ℕ0 ∈ V) |
| 9 | nn0gsumfz.f | . . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (𝐵 ↑m ℕ0)) | |
| 10 | elmapi 8845 | . . . . . 6 ⊢ (𝐹 ∈ (𝐵 ↑m ℕ0) → 𝐹:ℕ0⟶𝐵) | |
| 11 | 9, 10 | syl 18 | . . . . 5 ⊢ (𝜑 → 𝐹:ℕ0⟶𝐵) |
| 12 | 11 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → 𝐹:ℕ0⟶𝐵) |
| 13 | 4 | fvexi 6895 | . . . . . 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 14030 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → (𝐹 supp 0 ) ⊆ (0...𝑆)) |
| 20 | elmapfun 8862 | . . . . . . . 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 14009 | . . . . . . 7 ⊢ (𝜑 → (0...𝑆) ∈ Fin) | |
| 25 | 24 | anim1i 626 | . . . . . 6 ⊢ ((𝜑 ∧ (𝐹 supp 0 ) ⊆ (0...𝑆)) → ((0...𝑆) ∈ Fin ∧ (𝐹 supp 0 ) ⊆ (0...𝑆))) |
| 26 | suppssfifsupp 9339 | . . . . . 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 19982 | . . 3 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → (𝐺 Σg (𝐹 ↾ (0...𝑆))) = (𝐺 Σg 𝐹)) |
| 30 | 2, 29 | eqtr2id 2809 | . 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 1568 ∈ wcel 2141 ∀wral 3077 Vcvv 3453 ⊆ wss 3904 class class class wbr 5108 ↾ cres 5663 Fun wfun 6530 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 supp csupp 8155 ↑m cmap 8823 Fincfn 8942 finSupp cfsupp 9320 0cc0 11099 < clt 11242 ℕ0cn0 12503 ...cfz 13534 Basecbs 17268 0gc0g 17491 Σg cgsu 17492 CMndccmn 19849 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-se 5615 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7862 df-1st 7985 df-2nd 7986 df-supp 8156 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8452 df-er 8693 df-map 8825 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-fsupp 9321 df-oi 9471 df-card 9924 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-nn 12233 df-n0 12504 df-z 12591 df-uz 12862 df-fz 13535 df-fzo 13683 df-seq 14038 df-hash 14367 df-0g 17493 df-gsum 17494 df-mgm 18697 df-sgrp 18776 df-mnd 18792 df-cntz 19386 df-cmn 19851 |
| This theorem is referenced by: nn0gsumfz 20053 gsummptnn0fz 20055 |
| Copyright terms: Public domain | W3C validator |