![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > iscmn | Structured version Visualization version GIF version |
Description: The predicate "is a commutative monoid." (Contributed by Mario Carneiro, 6-Jan-2015.) |
Ref | Expression |
---|---|
iscmn.b | ⊢ 𝐵 = (Base‘𝐺) |
iscmn.p | ⊢ + = (+g‘𝐺) |
Ref | Expression |
---|---|
iscmn | ⊢ (𝐺 ∈ CMnd ↔ (𝐺 ∈ Mnd ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) = (𝑦 + 𝑥))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fveq2 6645 | . . . . 5 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺)) | |
2 | iscmn.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
3 | 1, 2 | eqtr4di 2851 | . . . 4 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵) |
4 | raleq 3358 | . . . . 5 ⊢ ((Base‘𝑔) = 𝐵 → (∀𝑦 ∈ (Base‘𝑔)(𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥) ↔ ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥))) | |
5 | 4 | raleqbi1dv 3356 | . . . 4 ⊢ ((Base‘𝑔) = 𝐵 → (∀𝑥 ∈ (Base‘𝑔)∀𝑦 ∈ (Base‘𝑔)(𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥))) |
6 | 3, 5 | syl 17 | . . 3 ⊢ (𝑔 = 𝐺 → (∀𝑥 ∈ (Base‘𝑔)∀𝑦 ∈ (Base‘𝑔)(𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥))) |
7 | fveq2 6645 | . . . . . . 7 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = (+g‘𝐺)) | |
8 | iscmn.p | . . . . . . 7 ⊢ + = (+g‘𝐺) | |
9 | 7, 8 | eqtr4di 2851 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = + ) |
10 | 9 | oveqd 7152 | . . . . 5 ⊢ (𝑔 = 𝐺 → (𝑥(+g‘𝑔)𝑦) = (𝑥 + 𝑦)) |
11 | 9 | oveqd 7152 | . . . . 5 ⊢ (𝑔 = 𝐺 → (𝑦(+g‘𝑔)𝑥) = (𝑦 + 𝑥)) |
12 | 10, 11 | eqeq12d 2814 | . . . 4 ⊢ (𝑔 = 𝐺 → ((𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥) ↔ (𝑥 + 𝑦) = (𝑦 + 𝑥))) |
13 | 12 | 2ralbidv 3164 | . . 3 ⊢ (𝑔 = 𝐺 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) = (𝑦 + 𝑥))) |
14 | 6, 13 | bitrd 282 | . 2 ⊢ (𝑔 = 𝐺 → (∀𝑥 ∈ (Base‘𝑔)∀𝑦 ∈ (Base‘𝑔)(𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) = (𝑦 + 𝑥))) |
15 | df-cmn 18900 | . 2 ⊢ CMnd = {𝑔 ∈ Mnd ∣ ∀𝑥 ∈ (Base‘𝑔)∀𝑦 ∈ (Base‘𝑔)(𝑥(+g‘𝑔)𝑦) = (𝑦(+g‘𝑔)𝑥)} | |
16 | 14, 15 | elrab2 3631 | 1 ⊢ (𝐺 ∈ CMnd ↔ (𝐺 ∈ Mnd ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) = (𝑦 + 𝑥))) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ∀wral 3106 ‘cfv 6324 (class class class)co 7135 Basecbs 16475 +gcplusg 16557 Mndcmnd 17903 CMndccmn 18898 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rab 3115 df-v 3443 df-un 3886 df-in 3888 df-ss 3898 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-iota 6283 df-fv 6332 df-ov 7138 df-cmn 18900 |
This theorem is referenced by: isabl2 18907 cmnpropd 18908 iscmnd 18911 cmnmnd 18914 cmncom 18915 ghmcmn 18945 submcmn2 18952 cycsubmcmn 19001 iscrng2 19309 xrs1cmn 20131 abliso 30730 gicabl 40043 pgrpgt2nabl 44768 |
Copyright terms: Public domain | W3C validator |