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

Theorem iscmnd 13884
Description: Properties that determine a commutative monoid. (Contributed by Mario Carneiro, 7-Jan-2015.)
Hypotheses
Ref Expression
iscmnd.b  |-  ( ph  ->  B  =  ( Base `  G ) )
iscmnd.p  |-  ( ph  ->  .+  =  ( +g  `  G ) )
iscmnd.g  |-  ( ph  ->  G  e.  Mnd )
iscmnd.c  |-  ( (
ph  /\  x  e.  B  /\  y  e.  B
)  ->  ( x  .+  y )  =  ( y  .+  x ) )
Assertion
Ref Expression
iscmnd  |-  ( ph  ->  G  e. CMnd )
Distinct variable groups:    x, y, B   
x, G, y    ph, x, y
Allowed substitution hints:    .+ ( x, y)

Proof of Theorem iscmnd
StepHypRef Expression
1 iscmnd.g . . 3  |-  ( ph  ->  G  e.  Mnd )
2 iscmnd.c . . . . 5  |-  ( (
ph  /\  x  e.  B  /\  y  e.  B
)  ->  ( x  .+  y )  =  ( y  .+  x ) )
323expib 1232 . . . 4  |-  ( ph  ->  ( ( x  e.  B  /\  y  e.  B )  ->  (
x  .+  y )  =  ( y  .+  x ) ) )
43ralrimivv 2613 . . 3  |-  ( ph  ->  A. x  e.  B  A. y  e.  B  ( x  .+  y )  =  ( y  .+  x ) )
5 iscmnd.b . . . . 5  |-  ( ph  ->  B  =  ( Base `  G ) )
6 iscmnd.p . . . . . . . 8  |-  ( ph  ->  .+  =  ( +g  `  G ) )
76oveqd 6034 . . . . . . 7  |-  ( ph  ->  ( x  .+  y
)  =  ( x ( +g  `  G
) y ) )
86oveqd 6034 . . . . . . 7  |-  ( ph  ->  ( y  .+  x
)  =  ( y ( +g  `  G
) x ) )
97, 8eqeq12d 2246 . . . . . 6  |-  ( ph  ->  ( ( x  .+  y )  =  ( y  .+  x )  <-> 
( x ( +g  `  G ) y )  =  ( y ( +g  `  G ) x ) ) )
105, 9raleqbidv 2746 . . . . 5  |-  ( ph  ->  ( A. y  e.  B  ( x  .+  y )  =  ( y  .+  x )  <->  A. y  e.  ( Base `  G ) ( x ( +g  `  G
) y )  =  ( y ( +g  `  G ) x ) ) )
115, 10raleqbidv 2746 . . . 4  |-  ( ph  ->  ( A. x  e.  B  A. y  e.  B  ( x  .+  y )  =  ( y  .+  x )  <->  A. x  e.  ( Base `  G ) A. y  e.  ( Base `  G ) ( x ( +g  `  G
) y )  =  ( y ( +g  `  G ) x ) ) )
1211anbi2d 464 . . 3  |-  ( ph  ->  ( ( G  e. 
Mnd  /\  A. x  e.  B  A. y  e.  B  ( x  .+  y )  =  ( y  .+  x ) )  <->  ( G  e. 
Mnd  /\  A. x  e.  ( Base `  G
) A. y  e.  ( Base `  G
) ( x ( +g  `  G ) y )  =  ( y ( +g  `  G
) x ) ) ) )
131, 4, 12mpbi2and 951 . 2  |-  ( ph  ->  ( G  e.  Mnd  /\ 
A. x  e.  (
Base `  G ) A. y  e.  ( Base `  G ) ( x ( +g  `  G
) y )  =  ( y ( +g  `  G ) x ) ) )
14 eqid 2231 . . 3  |-  ( Base `  G )  =  (
Base `  G )
15 eqid 2231 . . 3  |-  ( +g  `  G )  =  ( +g  `  G )
1614, 15iscmn 13879 . 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 ) ) )
1713, 16sylibr 134 1  |-  ( ph  ->  G  e. CMnd )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1004    = wceq 1397    e. wcel 2202   A.wral 2510   ` cfv 5326  (class class class)co 6017   Basecbs 13081   +g cplusg 13159   Mndcmnd 13498  CMndccmn 13870
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-un 3204  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-iota 5286  df-fv 5334  df-ov 6020  df-cmn 13872
This theorem is referenced by:  isabld  13885  subcmnd  13919  iscrngd  14054
  Copyright terms: Public domain W3C validator