| 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 4606 | . . . . . 6 ⊢ (𝑘 ∈ {𝑀} → 𝑘 = 𝑀) | |
| 3 | gsumsnd.s | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 𝑀) → 𝐴 = 𝐶) | |
| 4 | 2, 3 | sylan2 604 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑀}) → 𝐴 = 𝐶) |
| 5 | 1, 4 | mpteq2da 5203 | . . . 4 ⊢ (𝜑 → (𝑘 ∈ {𝑀} ↦ 𝐴) = (𝑘 ∈ {𝑀} ↦ 𝐶)) |
| 6 | 5 | oveq2d 7426 | . . 3 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐴)) = (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐶))) |
| 7 | gsumsnd.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Mnd) | |
| 8 | snfi 9036 | . . . . 5 ⊢ {𝑀} ∈ Fin | |
| 9 | 8 | a1i 11 | . . . 4 ⊢ (𝜑 → {𝑀} ∈ Fin) |
| 10 | gsumsnd.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝐵) | |
| 11 | gsumsnfd.c | . . . . 5 ⊢ Ⅎ𝑘𝐶 | |
| 12 | gsumsnd.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 13 | eqid 2763 | . . . . 5 ⊢ (.g‘𝐺) = (.g‘𝐺) | |
| 14 | 11, 12, 13 | gsumconstf 20009 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ {𝑀} ∈ Fin ∧ 𝐶 ∈ 𝐵) → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐶)) = ((♯‘{𝑀})(.g‘𝐺)𝐶)) |
| 15 | 7, 9, 10, 14 | syl3anc 1398 | . . 3 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐶)) = ((♯‘{𝑀})(.g‘𝐺)𝐶)) |
| 16 | 6, 15 | eqtrd 2798 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐴)) = ((♯‘{𝑀})(.g‘𝐺)𝐶)) |
| 17 | gsumsnd.m | . . . 4 ⊢ (𝜑 → 𝑀 ∈ 𝑉) | |
| 18 | hashsng 14410 | . . . 4 ⊢ (𝑀 ∈ 𝑉 → (♯‘{𝑀}) = 1) | |
| 19 | 17, 18 | syl 18 | . . 3 ⊢ (𝜑 → (♯‘{𝑀}) = 1) |
| 20 | 19 | oveq1d 7425 | . 2 ⊢ (𝜑 → ((♯‘{𝑀})(.g‘𝐺)𝐶) = (1(.g‘𝐺)𝐶)) |
| 21 | 12, 13 | mulg1 19151 | . . 3 ⊢ (𝐶 ∈ 𝐵 → (1(.g‘𝐺)𝐶) = 𝐶) |
| 22 | 10, 21 | syl 18 | . 2 ⊢ (𝜑 → (1(.g‘𝐺)𝐶) = 𝐶) |
| 23 | 16, 20, 22 | 3eqtrd 2802 | 1 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐴)) = 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 400 = wceq 1570 Ⅎwnf 1813 ∈ wcel 2143 Ⅎwnfc 2910 {csn 4589 ↦ cmpt 5192 ‘cfv 6536 (class class class)co 7410 Fincfn 8939 1c1 11105 ♯chash 14371 Basecbs 17273 Σg cgsu 17497 Mndcmnd 18796 .gcmg 19137 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11160 ax-resscn 11161 ax-1cn 11162 ax-icn 11163 ax-addcl 11164 ax-addrcl 11165 ax-mulcl 11166 ax-mulrcl 11167 ax-mulcom 11168 ax-addass 11169 ax-mulass 11170 ax-distr 11171 ax-i2m1 11172 ax-1ne0 11173 ax-1rid 11174 ax-rnegex 11175 ax-rrecex 11176 ax-cnre 11177 ax-pre-lttri 11178 ax-pre-lttrn 11179 ax-pre-ltadd 11180 ax-pre-mulgt0 11181 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 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 7859 df-1st 7982 df-2nd 7983 df-supp 8153 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-oi 9468 df-card 9930 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11447 df-neg 11448 df-nn 12238 df-n0 12509 df-z 12596 df-uz 12867 df-fz 13540 df-fzo 13688 df-seq 14043 df-hash 14372 df-0g 17498 df-gsum 17499 df-mgm 18702 df-sgrp 18781 df-mnd 18797 df-mulg 19138 df-cntz 19391 |
| This theorem is used by: gsumsnd 20026 gsumsnf 20027 gsumunsnfd 20031 esumsnf 34463 gsumdifsndf 48974 |
| Copyright terms: Public domain | W3C validator |