| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gsumsnfd | Structured version Visualization version GIF version | ||
| Description: Group sum of a singleton, deduction form, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Mario Carneiro, 19-Dec-2014.) (Revised by Thierry Arnoux, 28-Mar-2018.) (Revised by AV, 11-Dec-2019.) |
| Ref | Expression |
|---|---|
| gsumsnd.b | ⊢ 𝐵 = (Base‘𝐺) |
| gsumsnd.g | ⊢ (𝜑 → 𝐺 ∈ Mnd) |
| gsumsnd.m | ⊢ (𝜑 → 𝑀 ∈ 𝑉) |
| gsumsnd.c | ⊢ (𝜑 → 𝐶 ∈ 𝐵) |
| gsumsnd.s | ⊢ ((𝜑 ∧ 𝑘 = 𝑀) → 𝐴 = 𝐶) |
| gsumsnfd.p | ⊢ Ⅎ𝑘𝜑 |
| gsumsnfd.c | ⊢ Ⅎ𝑘𝐶 |
| Ref | Expression |
|---|---|
| gsumsnfd | ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐴)) = 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | gsumsnfd.p | . . . . 5 ⊢ Ⅎ𝑘𝜑 | |
| 2 | elsni 4601 | . . . . . 6 ⊢ (𝑘 ∈ {𝑀} → 𝑘 = 𝑀) | |
| 3 | gsumsnd.s | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 𝑀) → 𝐴 = 𝐶) | |
| 4 | 2, 3 | sylan2 605 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑀}) → 𝐴 = 𝐶) |
| 5 | 1, 4 | mpteq2da 5197 | . . . 4 ⊢ (𝜑 → (𝑘 ∈ {𝑀} ↦ 𝐴) = (𝑘 ∈ {𝑀} ↦ 𝐶)) |
| 6 | 5 | oveq2d 7425 | . . 3 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐴)) = (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐶))) |
| 7 | gsumsnd.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Mnd) | |
| 8 | snfi 9050 | . . . . 5 ⊢ {𝑀} ∈ Fin | |
| 9 | 8 | a1i 11 | . . . 4 ⊢ (𝜑 → {𝑀} ∈ Fin) |
| 10 | gsumsnd.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝐵) | |
| 11 | gsumsnfd.c | . . . . 5 ⊢ Ⅎ𝑘𝐶 | |
| 12 | gsumsnd.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 13 | eqid 2760 | . . . . 5 ⊢ (.g‘𝐺) = (.g‘𝐺) | |
| 14 | 11, 12, 13 | gsumconstf 20096 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ {𝑀} ∈ Fin ∧ 𝐶 ∈ 𝐵) → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐶)) = ((♯‘{𝑀})(.g‘𝐺)𝐶)) |
| 15 | 7, 9, 10, 14 | syl3anc 1398 | . . 3 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐶)) = ((♯‘{𝑀})(.g‘𝐺)𝐶)) |
| 16 | 6, 15 | eqtrd 2795 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐴)) = ((♯‘{𝑀})(.g‘𝐺)𝐶)) |
| 17 | gsumsnd.m | . . . 4 ⊢ (𝜑 → 𝑀 ∈ 𝑉) | |
| 18 | hashsng 14466 | . . . 4 ⊢ (𝑀 ∈ 𝑉 → (♯‘{𝑀}) = 1) | |
| 19 | 17, 18 | syl 18 | . . 3 ⊢ (𝜑 → (♯‘{𝑀}) = 1) |
| 20 | 19 | oveq1d 7424 | . 2 ⊢ (𝜑 → ((♯‘{𝑀})(.g‘𝐺)𝐶) = (1(.g‘𝐺)𝐶)) |
| 21 | 12, 13 | mulg1 19238 | . . 3 ⊢ (𝐶 ∈ 𝐵 → (1(.g‘𝐺)𝐶) = 𝐶) |
| 22 | 10, 21 | syl 18 | . 2 ⊢ (𝜑 → (1(.g‘𝐺)𝐶) = 𝐶) |
| 23 | 16, 20, 22 | 3eqtrd 2799 | 1 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐴)) = 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 Ⅎwnf 1816 ∈ wcel 2145 Ⅎwnfc 2907 {csn 4584 ↦ cmpt 5186 ‘cfv 6528 (class class class)co 7409 Fincfn 8952 1c1 11158 ♯chash 14427 Basecbs 17334 Σg cgsu 17558 Mndcmnd 18870 .gcmg 19224 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7735 ax-cnex 11213 ax-resscn 11214 ax-1cn 11215 ax-icn 11216 ax-addcl 11217 ax-addrcl 11218 ax-mulcl 11219 ax-mulrcl 11220 ax-mulcom 11221 ax-addass 11222 ax-mulass 11223 ax-distr 11224 ax-i2m1 11225 ax-1ne0 11226 ax-1rid 11227 ax-rnegex 11228 ax-rrecex 11229 ax-cnre 11230 ax-pre-lttri 11231 ax-pre-lttrn 11232 ax-pre-ltadd 11233 ax-pre-mulgt0 11234 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-se 5602 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6294 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6530 df-fn 6531 df-f 6532 df-f1 6533 df-fo 6534 df-f1o 6535 df-fv 6536 df-isom 6537 df-riota 7366 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7862 df-1st 7985 df-2nd 7986 df-supp 8157 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8455 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-oi 9482 df-card 9977 df-pnf 11302 df-mnf 11303 df-xr 11304 df-ltxr 11305 df-le 11306 df-sub 11500 df-neg 11501 df-nn 12291 df-n0 12562 df-z 12649 df-uz 12921 df-fz 13595 df-fzo 13743 df-seq 14099 df-hash 14428 df-0g 17559 df-gsum 17560 df-mgm 18763 df-sgrp 18855 df-mnd 18871 df-mulg 19225 df-cntz 19478 |
| This theorem is used by: gsumsnd 20113 gsumsnf 20114 gsumunsnfd 20118 esumsnf 34615 gsumdifsndf 49194 |
| Copyright terms: Public domain | W3C validator |