| 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 5200 | . . . 4 ⊢ (𝜑 → (𝑘 ∈ {𝑀} ↦ 𝐴) = (𝑘 ∈ {𝑀} ↦ 𝐶)) |
| 6 | 5 | oveq2d 7456 | . . 3 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐴)) = (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐶))) |
| 7 | gsumsnd.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Mnd) | |
| 8 | snfi 9096 | . . . . 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 20176 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ {𝑀} ∈ Fin ∧ 𝐶 ∈ 𝐵) → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐶)) = ((♯‘{𝑀})(.g‘𝐺)𝐶)) |
| 15 | 7, 9, 10, 14 | syl3anc 1399 | . . 3 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐶)) = ((♯‘{𝑀})(.g‘𝐺)𝐶)) |
| 16 | 6, 15 | eqtrd 2798 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝐴)) = ((♯‘{𝑀})(.g‘𝐺)𝐶)) |
| 17 | gsumsnd.m | . . . 4 ⊢ (𝜑 → 𝑀 ∈ 𝑉) | |
| 18 | hashsng 14537 | . . . 4 ⊢ (𝑀 ∈ 𝑉 → (♯‘{𝑀}) = 1) | |
| 19 | 17, 18 | syl 18 | . . 3 ⊢ (𝜑 → (♯‘{𝑀}) = 1) |
| 20 | 19 | oveq1d 7455 | . 2 ⊢ (𝜑 → ((♯‘{𝑀})(.g‘𝐺)𝐶) = (1(.g‘𝐺)𝐶)) |
| 21 | 12, 13 | mulg1 19317 | . . 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 401 = wceq 1570 Ⅎwnf 1816 ∈ wcel 2147 Ⅎwnfc 2911 {csn 4588 ↦ cmpt 5189 ‘cfv 6555 (class class class)co 7440 Fincfn 8998 1c1 11225 ♯chash 14498 Basecbs 17413 Σg cgsu 17637 Mndcmnd 18949 .gcmg 19303 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 ax-cnex 11280 ax-resscn 11281 ax-1cn 11282 ax-icn 11283 ax-addcl 11284 ax-addrcl 11285 ax-mulcl 11286 ax-mulrcl 11287 ax-mulcom 11288 ax-addass 11289 ax-mulass 11290 ax-distr 11291 ax-i2m1 11292 ax-1ne0 11293 ax-1rid 11294 ax-rnegex 11295 ax-rrecex 11296 ax-cnre 11297 ax-pre-lttri 11298 ax-pre-lttrn 11299 ax-pre-ltadd 11300 ax-pre-mulgt0 11301 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6319 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-isom 6564 df-riota 7397 df-ov 7443 df-oprab 7444 df-mpo 7445 df-om 7899 df-1st 8022 df-2nd 8023 df-supp 8202 df-frecs 8324 df-wrecs 8355 df-recs 8404 df-rdg 8443 df-1o 8501 df-er 8742 df-en 8999 df-dom 9000 df-sdom 9001 df-fin 9002 df-oi 9528 df-card 10044 df-pnf 11369 df-mnf 11370 df-xr 11371 df-ltxr 11372 df-le 11373 df-sub 11567 df-neg 11568 df-nn 12360 df-n0 12631 df-z 12718 df-uz 12990 df-fz 13664 df-fzo 13813 df-seq 14169 df-hash 14499 df-0g 17638 df-gsum 17639 df-mgm 18842 df-sgrp 18934 df-mnd 18950 df-mulg 19304 df-cntz 19558 |
| This theorem is used by: gsumsnd 20193 gsumsnf 20194 gsumunsnfd 20198 esumsnf 34763 gsumdifsndf 49481 |
| Copyright terms: Public domain | W3C validator |