| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gsumvallem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for properties of the set of identities of 𝐺. The set of identities of a monoid is exactly the unique identity element. (Contributed by Mario Carneiro, 7-Dec-2014.) |
| Ref | Expression |
|---|---|
| gsumvallem2.b | ⊢ 𝐵 = (Base‘𝐺) |
| gsumvallem2.z | ⊢ 0 = (0g‘𝐺) |
| gsumvallem2.p | ⊢ + = (+g‘𝐺) |
| gsumvallem2.o | ⊢ 𝑂 = {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦)} |
| Ref | Expression |
|---|---|
| gsumvallem2 | ⊢ (𝐺 ∈ Mnd → 𝑂 = { 0 }) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | gsumvallem2.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | gsumvallem2.z | . . 3 ⊢ 0 = (0g‘𝐺) | |
| 3 | gsumvallem2.p | . . 3 ⊢ + = (+g‘𝐺) | |
| 4 | gsumvallem2.o | . . 3 ⊢ 𝑂 = {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦)} | |
| 5 | 1, 2, 3, 4 | mgmidsssn0 18903 | . 2 ⊢ (𝐺 ∈ Mnd → 𝑂 ⊆ { 0 }) |
| 6 | 1, 2 | mndidcl 18989 | . . . 4 ⊢ (𝐺 ∈ Mnd → 0 ∈ 𝐵) |
| 7 | 1, 3, 2 | mndlrid 18993 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑦 ∈ 𝐵) → (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦)) |
| 8 | 7 | ralrimiva 3158 | . . . 4 ⊢ (𝐺 ∈ Mnd → ∀𝑦 ∈ 𝐵 (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦)) |
| 9 | oveq1 7458 | . . . . . . 7 ⊢ (𝑥 = 0 → (𝑥 + 𝑦) = ( 0 + 𝑦)) | |
| 10 | 9 | eqeq1d 2765 | . . . . . 6 ⊢ (𝑥 = 0 → ((𝑥 + 𝑦) = 𝑦 ↔ ( 0 + 𝑦) = 𝑦)) |
| 11 | 10 | ovanraleqv 7475 | . . . . 5 ⊢ (𝑥 = 0 → (∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦) ↔ ∀𝑦 ∈ 𝐵 (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦))) |
| 12 | 11, 4 | elrab2 3652 | . . . 4 ⊢ ( 0 ∈ 𝑂 ↔ ( 0 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦))) |
| 13 | 6, 8, 12 | sylanbrc 595 | . . 3 ⊢ (𝐺 ∈ Mnd → 0 ∈ 𝑂) |
| 14 | 13 | snssd 4749 | . 2 ⊢ (𝐺 ∈ Mnd → { 0 } ⊆ 𝑂) |
| 15 | 5, 14 | eqssd 3930 | 1 ⊢ (𝐺 ∈ Mnd → 𝑂 = { 0 }) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 {crab 3416 {csn 4588 ‘cfv 6566 (class class class)co 7451 Basecbs 17431 +gcplusg 17472 0gc0g 17660 Mndcmnd 18973 |
| 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-sep 5255 ax-nul 5266 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 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-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-iota 6520 df-fun 6568 df-fv 6574 df-riota 7408 df-ov 7454 df-0g 17662 df-mgm 18866 df-sgrp 18958 df-mnd 18974 |
| This theorem is used by: gsumz 19082 gsumval3a 20168 |
| Copyright terms: Public domain | W3C validator |