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 17269 | . 2 ⊢ (𝐺 ∈ Mnd → 𝑂 ⊆ { 0 }) |
6 | 1, 2 | mndidcl 17308 | . . . 4 ⊢ (𝐺 ∈ Mnd → 0 ∈ 𝐵) |
7 | 1, 3, 2 | mndlrid 17310 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑦 ∈ 𝐵) → (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦)) |
8 | 7 | ralrimiva 2966 | . . . 4 ⊢ (𝐺 ∈ Mnd → ∀𝑦 ∈ 𝐵 (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦)) |
9 | oveq1 6657 | . . . . . . . 8 ⊢ (𝑥 = 0 → (𝑥 + 𝑦) = ( 0 + 𝑦)) | |
10 | 9 | eqeq1d 2624 | . . . . . . 7 ⊢ (𝑥 = 0 → ((𝑥 + 𝑦) = 𝑦 ↔ ( 0 + 𝑦) = 𝑦)) |
11 | oveq2 6658 | . . . . . . . 8 ⊢ (𝑥 = 0 → (𝑦 + 𝑥) = (𝑦 + 0 )) | |
12 | 11 | eqeq1d 2624 | . . . . . . 7 ⊢ (𝑥 = 0 → ((𝑦 + 𝑥) = 𝑦 ↔ (𝑦 + 0 ) = 𝑦)) |
13 | 10, 12 | anbi12d 747 | . . . . . 6 ⊢ (𝑥 = 0 → (((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦) ↔ (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦))) |
14 | 13 | ralbidv 2986 | . . . . 5 ⊢ (𝑥 = 0 → (∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦) ↔ ∀𝑦 ∈ 𝐵 (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦))) |
15 | 14, 4 | elrab2 3366 | . . . 4 ⊢ ( 0 ∈ 𝑂 ↔ ( 0 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦))) |
16 | 6, 8, 15 | sylanbrc 698 | . . 3 ⊢ (𝐺 ∈ Mnd → 0 ∈ 𝑂) |
17 | 16 | snssd 4340 | . 2 ⊢ (𝐺 ∈ Mnd → { 0 } ⊆ 𝑂) |
18 | 5, 17 | eqssd 3620 | 1 ⊢ (𝐺 ∈ Mnd → 𝑂 = { 0 }) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ∀wral 2912 {crab 2916 {csn 4177 ‘cfv 5888 (class class class)co 6650 Basecbs 15857 +gcplusg 15941 0gc0g 16100 Mndcmnd 17294 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-iota 5851 df-fun 5890 df-fv 5896 df-riota 6611 df-ov 6653 df-0g 16102 df-mgm 17242 df-sgrp 17284 df-mnd 17295 |
This theorem is referenced by: gsumz 17374 gsumval3a 18304 |
Copyright terms: Public domain | W3C validator |