ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cmnmnd Unicode version

Theorem cmnmnd 14104
Description: A commutative monoid is a monoid. (Contributed by Mario Carneiro, 6-Jan-2015.)
Assertion
Ref Expression
cmnmnd  |-  ( G  e. CMnd  ->  G  e.  Mnd )

Proof of Theorem cmnmnd
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2238 . . 3  |-  ( Base `  G )  =  (
Base `  G )
2 eqid 2238 . . 3  |-  ( +g  `  G )  =  ( +g  `  G )
31, 2iscmn 14096 . 2  |-  ( G  e. CMnd 
<->  ( G  e.  Mnd  /\ 
A. x  e.  (
Base `  G ) A. y  e.  ( Base `  G ) ( x ( +g  `  G
) y )  =  ( y ( +g  `  G ) x ) ) )
43simplbi 274 1  |-  ( G  e. CMnd  ->  G  e.  Mnd )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402    e. wcel 2209   A.wral 2528   ` cfv 5377  (class class class)co 6085   Basecbs 13352   +g cplusg 13431   Mndcmnd 13729  CMndccmn 14087
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-un 3224  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-iota 5337  df-fv 5385  df-ov 6088  df-cmn 14089
This theorem is used by:  cmn32  14107  cmn4  14108  cmn12  14109  cmnmndd  14111  rinvmod  14113  ghmcmn  14131  gsumzfi  14158  srgmnd  14271
  Copyright terms: Public domain W3C validator