| 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 4595 | . . . . . 6 ⊢ (𝑘 ∈ {𝑀} → 𝑘 = 𝑀) | |
| 3 | gsumsnd.s | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 𝑀) → 𝐴 = 𝐶) | |
| 4 | 2, 3 | sylan2 593 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑀}) → 𝐴 = 𝐶) |
| 5 | 1, 4 | mpteq2da 5188 | . . . 4 ⊢ (𝜑 → (𝑘 ∈ {𝑀} ↦ 𝐴) = (𝑘 ∈ {𝑀} ↦ 𝐶)) |
| 6 | 5 | oveq2d 7372 | . . 3 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐴)) = (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐶))) |
| 7 | gsumsnd.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Mnd) | |
| 8 | snfi 8978 | . . . . 5 ⊢ {𝑀} ∈ Fin | |
| 9 | 8 | a1i 11 | . . . 4 ⊢ (𝜑 → {𝑀} ∈ Fin) |
| 10 | gsumsnd.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝐵) | |
| 11 | gsumsnfd.c | . . . . 5 ⊢ Ⅎ𝑘𝐶 | |
| 12 | gsumsnd.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 13 | eqid 2734 | . . . . 5 ⊢ (.g‘𝐺) = (.g‘𝐺) | |
| 14 | 11, 12, 13 | gsumconstf 19862 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ {𝑀} ∈ Fin ∧ 𝐶 ∈ 𝐵) → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐶)) = ((♯‘{𝑀})(.g‘𝐺)𝐶)) |
| 15 | 7, 9, 10, 14 | syl3anc 1373 | . . 3 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐶)) = ((♯‘{𝑀})(.g‘𝐺)𝐶)) |
| 16 | 6, 15 | eqtrd 2769 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐴)) = ((♯‘{𝑀})(.g‘𝐺)𝐶)) |
| 17 | gsumsnd.m | . . . 4 ⊢ (𝜑 → 𝑀 ∈ 𝑉) | |
| 18 | hashsng 14290 | . . . 4 ⊢ (𝑀 ∈ 𝑉 → (♯‘{𝑀}) = 1) | |
| 19 | 17, 18 | syl 17 | . . 3 ⊢ (𝜑 → (♯‘{𝑀}) = 1) |
| 20 | 19 | oveq1d 7371 | . 2 ⊢ (𝜑 → ((♯‘{𝑀})(.g‘𝐺)𝐶) = (1(.g‘𝐺)𝐶)) |
| 21 | 12, 13 | mulg1 19009 | . . 3 ⊢ (𝐶 ∈ 𝐵 → (1(.g‘𝐺)𝐶) = 𝐶) |
| 22 | 10, 21 | syl 17 | . 2 ⊢ (𝜑 → (1(.g‘𝐺)𝐶) = 𝐶) |
| 23 | 16, 20, 22 | 3eqtrd 2773 | 1 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐴)) = 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 Ⅎwnf 1784 ∈ wcel 2113 Ⅎwnfc 2881 {csn 4578 ↦ cmpt 5177 ‘cfv 6490 (class class class)co 7356 Fincfn 8881 1c1 11025 ♯chash 14251 Basecbs 17134 Σg cgsu 17358 Mndcmnd 18657 .gcmg 18995 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-int 4901 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-se 5576 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-isom 6499 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-supp 8101 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-er 8633 df-en 8882 df-dom 8883 df-sdom 8884 df-fin 8885 df-oi 9413 df-card 9849 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-nn 12144 df-n0 12400 df-z 12487 df-uz 12750 df-fz 13422 df-fzo 13569 df-seq 13923 df-hash 14252 df-0g 17359 df-gsum 17360 df-mgm 18563 df-sgrp 18642 df-mnd 18658 df-mulg 18996 df-cntz 19244 |
| This theorem is referenced by: gsumsnd 19879 gsumsnf 19880 gsumunsnfd 19884 esumsnf 34170 gsumdifsndf 48369 |
| Copyright terms: Public domain | W3C validator |