| 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 4604 | . . . . . 6 ⊢ (𝑘 ∈ {𝑀} → 𝑘 = 𝑀) | |
| 3 | gsumsnd.s | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 𝑀) → 𝐴 = 𝐶) | |
| 4 | 2, 3 | sylan2 605 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑀}) → 𝐴 = 𝐶) |
| 5 | 1, 4 | mpteq2da 5201 | . . . 4 ⊢ (𝜑 → (𝑘 ∈ {𝑀} ↦ 𝐴) = (𝑘 ∈ {𝑀} ↦ 𝐶)) |
| 6 | 5 | oveq2d 7432 | . . 3 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐴)) = (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐶))) |
| 7 | gsumsnd.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Mnd) | |
| 8 | snfi 9053 | . . . . 5 ⊢ {𝑀} ∈ Fin | |
| 9 | 8 | a1i 11 | . . . 4 ⊢ (𝜑 → {𝑀} ∈ Fin) |
| 10 | gsumsnd.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝐵) | |
| 11 | gsumsnfd.c | . . . . 5 ⊢ Ⅎ𝑘𝐶 | |
| 12 | gsumsnd.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 13 | eqid 2762 | . . . . 5 ⊢ (.g‘𝐺) = (.g‘𝐺) | |
| 14 | 11, 12, 13 | gsumconstf 20061 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ {𝑀} ∈ Fin ∧ 𝐶 ∈ 𝐵) → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐶)) = ((♯‘{𝑀})(.g‘𝐺)𝐶)) |
| 15 | 7, 9, 10, 14 | syl3anc 1398 | . . 3 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐶)) = ((♯‘{𝑀})(.g‘𝐺)𝐶)) |
| 16 | 6, 15 | eqtrd 2797 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐴)) = ((♯‘{𝑀})(.g‘𝐺)𝐶)) |
| 17 | gsumsnd.m | . . . 4 ⊢ (𝜑 → 𝑀 ∈ 𝑉) | |
| 18 | hashsng 14433 | . . . 4 ⊢ (𝑀 ∈ 𝑉 → (♯‘{𝑀}) = 1) | |
| 19 | 17, 18 | syl 18 | . . 3 ⊢ (𝜑 → (♯‘{𝑀}) = 1) |
| 20 | 19 | oveq1d 7431 | . 2 ⊢ (𝜑 → ((♯‘{𝑀})(.g‘𝐺)𝐶) = (1(.g‘𝐺)𝐶)) |
| 21 | 12, 13 | mulg1 19203 | . . 3 ⊢ (𝐶 ∈ 𝐵 → (1(.g‘𝐺)𝐶) = 𝐶) |
| 22 | 10, 21 | syl 18 | . 2 ⊢ (𝜑 → (1(.g‘𝐺)𝐶) = 𝐶) |
| 23 | 16, 20, 22 | 3eqtrd 2801 | 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 2909 {csn 4587 ↦ cmpt 5190 ‘cfv 6537 (class class class)co 7416 Fincfn 8955 1c1 11126 ♯chash 14394 Basecbs 17303 Σg cgsu 17527 Mndcmnd 18836 .gcmg 19189 |
| 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 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11181 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-pre-mulgt0 11202 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-se 5613 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-1st 7989 df-2nd 7990 df-supp 8162 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8458 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-oi 9485 df-card 9947 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-sub 11468 df-neg 11469 df-nn 12259 df-n0 12530 df-z 12617 df-uz 12889 df-fz 13562 df-fzo 13710 df-seq 14066 df-hash 14395 df-0g 17528 df-gsum 17529 df-mgm 18732 df-sgrp 18821 df-mnd 18837 df-mulg 19190 df-cntz 19443 |
| This theorem is used by: gsumsnd 20078 gsumsnf 20079 gsumunsnfd 20083 esumsnf 34559 gsumdifsndf 49081 |
| Copyright terms: Public domain | W3C validator |