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 19393 | . 2 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ CMnd) | |
2 | ablcom.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
3 | ablcom.p | . . 3 ⊢ + = (+g‘𝐺) | |
4 | 2, 3 | cmncom 19403 | . 2 ⊢ ((𝐺 ∈ CMnd ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + 𝑌) = (𝑌 + 𝑋)) |
5 | 1, 4 | syl3an1 1162 | 1 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + 𝑌) = (𝑌 + 𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 ‘cfv 6433 (class class class)co 7275 Basecbs 16912 +gcplusg 16962 CMndccmn 19386 Abelcabl 19387 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-12 2171 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-ral 3069 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-iota 6391 df-fv 6441 df-ov 7278 df-cmn 19388 df-abl 19389 |
This theorem is referenced by: ablinvadd 19411 ablsub2inv 19412 ablsubadd 19413 abladdsub 19416 ablpncan3 19418 ablsub32 19423 ablnnncan 19424 ablsubsub23 19426 eqgabl 19436 subgabl 19437 ablnsg 19448 lsmcomx 19457 qusabl 19466 frgpnabl 19476 ngplcan 23767 clmnegsubdi2 24268 clmvsubval2 24273 ncvspi 24320 r1pid 25324 abliso 31305 lindsunlem 31705 cnaddcom 36986 toycom 36987 lflsub 37081 lfladdcom 37086 |
Copyright terms: Public domain | W3C validator |