![]() |
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 594 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑀}) → 𝐴 = 𝐶) |
5 | 1, 4 | mpteq2da 5204 | . . . 4 ⊢ (𝜑 → (𝑘 ∈ {𝑀} ↦ 𝐴) = (𝑘 ∈ {𝑀} ↦ 𝐶)) |
6 | 5 | oveq2d 7374 | . . 3 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐴)) = (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐶))) |
7 | gsumsnd.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Mnd) | |
8 | snfi 8991 | . . . . 5 ⊢ {𝑀} ∈ Fin | |
9 | 8 | a1i 11 | . . . 4 ⊢ (𝜑 → {𝑀} ∈ Fin) |
10 | gsumsnd.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝐵) | |
11 | gsumsnfd.c | . . . . 5 ⊢ Ⅎ𝑘𝐶 | |
12 | gsumsnd.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
13 | eqid 2733 | . . . . 5 ⊢ (.g‘𝐺) = (.g‘𝐺) | |
14 | 11, 12, 13 | gsumconstf 19717 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ {𝑀} ∈ Fin ∧ 𝐶 ∈ 𝐵) → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐶)) = ((♯‘{𝑀})(.g‘𝐺)𝐶)) |
15 | 7, 9, 10, 14 | syl3anc 1372 | . . 3 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐶)) = ((♯‘{𝑀})(.g‘𝐺)𝐶)) |
16 | 6, 15 | eqtrd 2773 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐴)) = ((♯‘{𝑀})(.g‘𝐺)𝐶)) |
17 | gsumsnd.m | . . . 4 ⊢ (𝜑 → 𝑀 ∈ 𝑉) | |
18 | hashsng 14275 | . . . 4 ⊢ (𝑀 ∈ 𝑉 → (♯‘{𝑀}) = 1) | |
19 | 17, 18 | syl 17 | . . 3 ⊢ (𝜑 → (♯‘{𝑀}) = 1) |
20 | 19 | oveq1d 7373 | . 2 ⊢ (𝜑 → ((♯‘{𝑀})(.g‘𝐺)𝐶) = (1(.g‘𝐺)𝐶)) |
21 | 12, 13 | mulg1 18888 | . . 3 ⊢ (𝐶 ∈ 𝐵 → (1(.g‘𝐺)𝐶) = 𝐶) |
22 | 10, 21 | syl 17 | . 2 ⊢ (𝜑 → (1(.g‘𝐺)𝐶) = 𝐶) |
23 | 16, 20, 22 | 3eqtrd 2777 | 1 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐴)) = 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 Ⅎwnf 1786 ∈ wcel 2107 Ⅎwnfc 2884 {csn 4587 ↦ cmpt 5189 ‘cfv 6497 (class class class)co 7358 Fincfn 8886 1c1 11057 ♯chash 14236 Basecbs 17088 Σg cgsu 17327 Mndcmnd 18561 .gcmg 18877 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5243 ax-sep 5257 ax-nul 5264 ax-pow 5321 ax-pr 5385 ax-un 7673 ax-cnex 11112 ax-resscn 11113 ax-1cn 11114 ax-icn 11115 ax-addcl 11116 ax-addrcl 11117 ax-mulcl 11118 ax-mulrcl 11119 ax-mulcom 11120 ax-addass 11121 ax-mulass 11122 ax-distr 11123 ax-i2m1 11124 ax-1ne0 11125 ax-1rid 11126 ax-rnegex 11127 ax-rrecex 11128 ax-cnre 11129 ax-pre-lttri 11130 ax-pre-lttrn 11131 ax-pre-ltadd 11132 ax-pre-mulgt0 11133 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3352 df-reu 3353 df-rab 3407 df-v 3446 df-sbc 3741 df-csb 3857 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3930 df-nul 4284 df-if 4488 df-pw 4563 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4867 df-int 4909 df-iun 4957 df-br 5107 df-opab 5169 df-mpt 5190 df-tr 5224 df-id 5532 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5589 df-se 5590 df-we 5591 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6254 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6499 df-fn 6500 df-f 6501 df-f1 6502 df-fo 6503 df-f1o 6504 df-fv 6505 df-isom 6506 df-riota 7314 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7804 df-1st 7922 df-2nd 7923 df-supp 8094 df-frecs 8213 df-wrecs 8244 df-recs 8318 df-rdg 8357 df-1o 8413 df-er 8651 df-en 8887 df-dom 8888 df-sdom 8889 df-fin 8890 df-oi 9451 df-card 9880 df-pnf 11196 df-mnf 11197 df-xr 11198 df-ltxr 11199 df-le 11200 df-sub 11392 df-neg 11393 df-nn 12159 df-n0 12419 df-z 12505 df-uz 12769 df-fz 13431 df-fzo 13574 df-seq 13913 df-hash 14237 df-0g 17328 df-gsum 17329 df-mgm 18502 df-sgrp 18551 df-mnd 18562 df-mulg 18878 df-cntz 19102 |
This theorem is referenced by: gsumsnd 19734 gsumsnf 19735 gsumunsnfd 19739 esumsnf 32720 gsumdifsndf 46201 |
Copyright terms: Public domain | W3C validator |