Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ablcom | Structured version Visualization version GIF version |
Description: An Abelian group operation is commutative. (Contributed by NM, 26-Aug-2011.) |
Ref | Expression |
---|---|
ablcom.b | ⊢ 𝐵 = (Base‘𝐺) |
ablcom.p | ⊢ + = (+g‘𝐺) |
Ref | Expression |
---|---|
ablcom | ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + 𝑌) = (𝑌 + 𝑋)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ablcmn 19308 | . 2 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ CMnd) | |
2 | ablcom.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
3 | ablcom.p | . . 3 ⊢ + = (+g‘𝐺) | |
4 | 2, 3 | cmncom 19318 | . 2 ⊢ ((𝐺 ∈ CMnd ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + 𝑌) = (𝑌 + 𝑋)) |
5 | 1, 4 | syl3an1 1161 | 1 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + 𝑌) = (𝑌 + 𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ‘cfv 6418 (class class class)co 7255 Basecbs 16840 +gcplusg 16888 CMndccmn 19301 Abelcabl 19302 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-12 2173 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-ral 3068 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-iota 6376 df-fv 6426 df-ov 7258 df-cmn 19303 df-abl 19304 |
This theorem is referenced by: ablinvadd 19326 ablsub2inv 19327 ablsubadd 19328 abladdsub 19331 ablpncan3 19333 ablsub32 19338 ablnnncan 19339 ablsubsub23 19341 eqgabl 19351 subgabl 19352 ablnsg 19363 lsmcomx 19372 qusabl 19381 frgpnabl 19391 ngplcan 23673 clmnegsubdi2 24174 clmvsubval2 24179 ncvspi 24225 r1pid 25229 abliso 31207 lindsunlem 31607 cnaddcom 36913 toycom 36914 lflsub 37008 lfladdcom 37013 |
Copyright terms: Public domain | W3C validator |