| 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 7401 | . . 3 ⊢ (𝐺 Σg 𝐻) = (𝐺 Σg (𝐹 ↾ (0...𝑆))) |
| 3 | nn0gsumfz.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 4 | nn0gsumfz.0 | . . . 4 ⊢ 0 = (0g‘𝐺) | |
| 5 | nn0gsumfz.g | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ CMnd) | |
| 6 | 5 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → 𝐺 ∈ CMnd) |
| 7 | nn0ex 12482 | . . . . 5 ⊢ ℕ0 ∈ V | |
| 8 | 7 | a1i 11 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → ℕ0 ∈ V) |
| 9 | nn0gsumfz.f | . . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (𝐵 ↑m ℕ0)) | |
| 10 | elmapi 8824 | . . . . . 6 ⊢ (𝐹 ∈ (𝐵 ↑m ℕ0) → 𝐹:ℕ0⟶𝐵) | |
| 11 | 9, 10 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝐹:ℕ0⟶𝐵) |
| 12 | 11 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → 𝐹:ℕ0⟶𝐵) |
| 13 | 4 | fvexi 6875 | . . . . . 6 ⊢ 0 ∈ V |
| 14 | 13 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → 0 ∈ V) |
| 15 | 9 | adantr 484 | . . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → 𝐹 ∈ (𝐵 ↑m ℕ0)) |
| 16 | fsfnn0gsumfsffz.s | . . . . . 6 ⊢ (𝜑 → 𝑆 ∈ ℕ0) | |
| 17 | 16 | adantr 484 | . . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → 𝑆 ∈ ℕ0) |
| 18 | simpr 488 | . . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) | |
| 19 | 14, 15, 17, 18 | suppssfz 14002 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → (𝐹 supp 0 ) ⊆ (0...𝑆)) |
| 20 | elmapfun 8841 | . . . . . . . 8 ⊢ (𝐹 ∈ (𝐵 ↑m ℕ0) → Fun 𝐹) | |
| 21 | 9, 20 | syl 17 | . . . . . . 7 ⊢ (𝜑 → Fun 𝐹) |
| 22 | 13 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → 0 ∈ V) |
| 23 | 9, 21, 22 | 3jca 1140 | . . . . . 6 ⊢ (𝜑 → (𝐹 ∈ (𝐵 ↑m ℕ0) ∧ Fun 𝐹 ∧ 0 ∈ V)) |
| 24 | fzfid 13981 | . . . . . . 7 ⊢ (𝜑 → (0...𝑆) ∈ Fin) | |
| 25 | 24 | anim1i 624 | . . . . . 6 ⊢ ((𝜑 ∧ (𝐹 supp 0 ) ⊆ (0...𝑆)) → ((0...𝑆) ∈ Fin ∧ (𝐹 supp 0 ) ⊆ (0...𝑆))) |
| 26 | suppssfifsupp 9321 | . . . . . 6 ⊢ (((𝐹 ∈ (𝐵 ↑m ℕ0) ∧ Fun 𝐹 ∧ 0 ∈ V) ∧ ((0...𝑆) ∈ Fin ∧ (𝐹 supp 0 ) ⊆ (0...𝑆))) → 𝐹 finSupp 0 ) | |
| 27 | 23, 25, 26 | syl2an2r 695 | . . . . 5 ⊢ ((𝜑 ∧ (𝐹 supp 0 ) ⊆ (0...𝑆)) → 𝐹 finSupp 0 ) |
| 28 | 19, 27 | syldan 600 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → 𝐹 finSupp 0 ) |
| 29 | 3, 4, 6, 8, 12, 19, 28 | gsumres 19934 | . . 3 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → (𝐺 Σg (𝐹 ↾ (0...𝑆))) = (𝐺 Σg 𝐹)) |
| 30 | 2, 29 | eqtr2id 2809 | . 2 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 )) → (𝐺 Σg 𝐹) = (𝐺 Σg 𝐻)) |
| 31 | 30 | ex 416 | 1 ⊢ (𝜑 → (∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 0 ) → (𝐺 Σg 𝐹) = (𝐺 Σg 𝐻))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ∀wral 3075 Vcvv 3453 ⊆ wss 3904 class class class wbr 5099 ↾ cres 5647 Fun wfun 6509 ⟶wf 6511 ‘cfv 6515 (class class class)co 7390 supp csupp 8133 ↑m cmap 8801 Fincfn 8921 finSupp cfsupp 9302 0cc0 11068 < clt 11211 ℕ0cn0 12476 ...cfz 13507 Basecbs 17226 0gc0g 17449 Σg cgsu 17450 CMndccmn 19801 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7712 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4905 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-se 5599 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6282 df-ord 6343 df-on 6344 df-lim 6345 df-suc 6346 df-iota 6471 df-fun 6517 df-fn 6518 df-f 6519 df-f1 6520 df-fo 6521 df-f1o 6522 df-fv 6523 df-isom 6524 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7841 df-1st 7964 df-2nd 7965 df-supp 8134 df-frecs 8255 df-wrecs 8286 df-recs 8335 df-rdg 8374 df-1o 8430 df-er 8671 df-map 8803 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-fsupp 9303 df-oi 9453 df-card 9892 df-pnf 11213 df-mnf 11214 df-xr 11215 df-ltxr 11216 df-le 11217 df-sub 11411 df-neg 11412 df-nn 12206 df-n0 12477 df-z 12564 df-uz 12835 df-fz 13508 df-fzo 13655 df-seq 14010 df-hash 14339 df-0g 17451 df-gsum 17452 df-mgm 18655 df-sgrp 18734 df-mnd 18750 df-cntz 19338 df-cmn 19803 |
| This theorem is referenced by: nn0gsumfz 20005 gsummptnn0fz 20007 |
| Copyright terms: Public domain | W3C validator |