MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  iscmn Structured version   Visualization version   Unicode version

Theorem iscmn 18200
Description: The predicate "is a commutative monoid." (Contributed by Mario Carneiro, 6-Jan-2015.)
Hypotheses
Ref Expression
iscmn.b  |-  B  =  ( Base `  G
)
iscmn.p  |-  .+  =  ( +g  `  G )
Assertion
Ref Expression
iscmn  |-  ( G  e. CMnd 
<->  ( G  e.  Mnd  /\ 
A. x  e.  B  A. y  e.  B  ( x  .+  y )  =  ( y  .+  x ) ) )
Distinct variable groups:    x, y, B    x, G, y
Allowed substitution hints:    .+ ( x, y)

Proof of Theorem iscmn
Dummy variable  g is distinct from all other variables.
StepHypRef Expression
1 fveq2 6191 . . . . 5  |-  ( g  =  G  ->  ( Base `  g )  =  ( Base `  G
) )
2 iscmn.b . . . . 5  |-  B  =  ( Base `  G
)
31, 2syl6eqr 2674 . . . 4  |-  ( g  =  G  ->  ( Base `  g )  =  B )
4 raleq 3138 . . . . 5  |-  ( (
Base `  g )  =  B  ->  ( A. y  e.  ( Base `  g ) ( x ( +g  `  g
) y )  =  ( y ( +g  `  g ) x )  <->  A. y  e.  B  ( x ( +g  `  g ) y )  =  ( y ( +g  `  g ) x ) ) )
54raleqbi1dv 3146 . . . 4  |-  ( (
Base `  g )  =  B  ->  ( A. x  e.  ( Base `  g ) A. y  e.  ( Base `  g
) ( x ( +g  `  g ) y )  =  ( y ( +g  `  g
) x )  <->  A. x  e.  B  A. y  e.  B  ( x
( +g  `  g ) y )  =  ( y ( +g  `  g
) x ) ) )
63, 5syl 17 . . 3  |-  ( g  =  G  ->  ( A. x  e.  ( Base `  g ) A. y  e.  ( Base `  g ) ( x ( +g  `  g
) y )  =  ( y ( +g  `  g ) x )  <->  A. x  e.  B  A. y  e.  B  ( x ( +g  `  g ) y )  =  ( y ( +g  `  g ) x ) ) )
7 fveq2 6191 . . . . . . 7  |-  ( g  =  G  ->  ( +g  `  g )  =  ( +g  `  G
) )
8 iscmn.p . . . . . . 7  |-  .+  =  ( +g  `  G )
97, 8syl6eqr 2674 . . . . . 6  |-  ( g  =  G  ->  ( +g  `  g )  = 
.+  )
109oveqd 6667 . . . . 5  |-  ( g  =  G  ->  (
x ( +g  `  g
) y )  =  ( x  .+  y
) )
119oveqd 6667 . . . . 5  |-  ( g  =  G  ->  (
y ( +g  `  g
) x )  =  ( y  .+  x
) )
1210, 11eqeq12d 2637 . . . 4  |-  ( g  =  G  ->  (
( x ( +g  `  g ) y )  =  ( y ( +g  `  g ) x )  <->  ( x  .+  y )  =  ( y  .+  x ) ) )
13122ralbidv 2989 . . 3  |-  ( g  =  G  ->  ( A. x  e.  B  A. y  e.  B  ( x ( +g  `  g ) y )  =  ( y ( +g  `  g ) x )  <->  A. x  e.  B  A. y  e.  B  ( x  .+  y )  =  ( y  .+  x ) ) )
146, 13bitrd 268 . 2  |-  ( g  =  G  ->  ( A. x  e.  ( Base `  g ) A. y  e.  ( Base `  g ) ( x ( +g  `  g
) y )  =  ( y ( +g  `  g ) x )  <->  A. x  e.  B  A. y  e.  B  ( x  .+  y )  =  ( y  .+  x ) ) )
15 df-cmn 18195 . 2  |- CMnd  =  {
g  e.  Mnd  |  A. x  e.  ( Base `  g ) A. y  e.  ( Base `  g ) ( x ( +g  `  g
) y )  =  ( y ( +g  `  g ) x ) }
1614, 15elrab2 3366 1  |-  ( G  e. CMnd 
<->  ( G  e.  Mnd  /\ 
A. x  e.  B  A. y  e.  B  ( x  .+  y )  =  ( y  .+  x ) ) )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 196    /\ wa 384    = wceq 1483    e. wcel 1990   A.wral 2912   ` cfv 5888  (class class class)co 6650   Basecbs 15857   +g cplusg 15941   Mndcmnd 17294  CMndccmn 18193
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-iota 5851  df-fv 5896  df-ov 6653  df-cmn 18195
This theorem is referenced by:  isabl2  18201  cmnpropd  18202  iscmnd  18205  cmnmnd  18208  cmncom  18209  ghmcmn  18237  submcmn2  18244  iscrng2  18563  xrs1cmn  19786  abliso  29696  gicabl  37669  pgrpgt2nabl  42147
  Copyright terms: Public domain W3C validator