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 18915 | . 2 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ CMnd) | |
2 | ablcom.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
3 | ablcom.p | . . 3 ⊢ + = (+g‘𝐺) | |
4 | 2, 3 | cmncom 18925 | . 2 ⊢ ((𝐺 ∈ CMnd ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + 𝑌) = (𝑌 + 𝑋)) |
5 | 1, 4 | syl3an1 1159 | 1 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + 𝑌) = (𝑌 + 𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ‘cfv 6357 (class class class)co 7158 Basecbs 16485 +gcplusg 16567 CMndccmn 18908 Abelcabl 18909 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ral 3145 df-rab 3149 df-v 3498 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-br 5069 df-iota 6316 df-fv 6365 df-ov 7161 df-cmn 18910 df-abl 18911 |
This theorem is referenced by: ablinvadd 18932 ablsub2inv 18933 ablsubadd 18934 abladdsub 18937 ablpncan3 18939 ablsub32 18944 ablnnncan 18945 ablsubsub23 18947 eqgabl 18957 subgabl 18958 ablnsg 18969 lsmcomx 18978 qusabl 18987 frgpnabl 18997 ngplcan 23222 clmnegsubdi2 23711 clmvsubval2 23716 ncvspi 23762 r1pid 24755 abliso 30685 lindsunlem 31022 cnaddcom 36110 toycom 36111 lflsub 36205 lfladdcom 36210 |
Copyright terms: Public domain | W3C validator |