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

Theorem isgrp 12714
Description: The predicate "is a group". (This theorem demonstrates the use of symbols as variable names, first proposed by FL in 2010.) (Contributed by NM, 17-Oct-2012.) (Revised by Mario Carneiro, 6-Jan-2015.)
Hypotheses
Ref Expression
isgrp.b  |-  B  =  ( Base `  G
)
isgrp.p  |-  .+  =  ( +g  `  G )
isgrp.z  |-  .0.  =  ( 0g `  G )
Assertion
Ref Expression
isgrp  |-  ( G  e.  Grp  <->  ( G  e.  Mnd  /\  A. a  e.  B  E. m  e.  B  ( m  .+  a )  =  .0.  ) )
Distinct variable groups:    m, a, B    G, a, m
Allowed substitution hints:    .+ ( m, a)    .0. (
m, a)

Proof of Theorem isgrp
Dummy variable  g is distinct from all other variables.
StepHypRef Expression
1 fveq2 5496 . . . 4  |-  ( g  =  G  ->  ( Base `  g )  =  ( Base `  G
) )
2 isgrp.b . . . 4  |-  B  =  ( Base `  G
)
31, 2eqtr4di 2221 . . 3  |-  ( g  =  G  ->  ( Base `  g )  =  B )
4 fveq2 5496 . . . . . . 7  |-  ( g  =  G  ->  ( +g  `  g )  =  ( +g  `  G
) )
5 isgrp.p . . . . . . 7  |-  .+  =  ( +g  `  G )
64, 5eqtr4di 2221 . . . . . 6  |-  ( g  =  G  ->  ( +g  `  g )  = 
.+  )
76oveqd 5870 . . . . 5  |-  ( g  =  G  ->  (
m ( +g  `  g
) a )  =  ( m  .+  a
) )
8 fveq2 5496 . . . . . 6  |-  ( g  =  G  ->  ( 0g `  g )  =  ( 0g `  G
) )
9 isgrp.z . . . . . 6  |-  .0.  =  ( 0g `  G )
108, 9eqtr4di 2221 . . . . 5  |-  ( g  =  G  ->  ( 0g `  g )  =  .0.  )
117, 10eqeq12d 2185 . . . 4  |-  ( g  =  G  ->  (
( m ( +g  `  g ) a )  =  ( 0g `  g )  <->  ( m  .+  a )  =  .0.  ) )
123, 11rexeqbidv 2678 . . 3  |-  ( g  =  G  ->  ( E. m  e.  ( Base `  g ) ( m ( +g  `  g
) a )  =  ( 0g `  g
)  <->  E. m  e.  B  ( m  .+  a )  =  .0.  ) )
133, 12raleqbidv 2677 . 2  |-  ( g  =  G  ->  ( A. a  e.  ( Base `  g ) E. m  e.  ( Base `  g ) ( m ( +g  `  g
) a )  =  ( 0g `  g
)  <->  A. a  e.  B  E. m  e.  B  ( m  .+  a )  =  .0.  ) )
14 df-grp 12711 . 2  |-  Grp  =  { g  e.  Mnd  | 
A. a  e.  (
Base `  g ) E. m  e.  ( Base `  g ) ( m ( +g  `  g
) a )  =  ( 0g `  g
) }
1513, 14elrab2 2889 1  |-  ( G  e.  Grp  <->  ( G  e.  Mnd  /\  A. a  e.  B  E. m  e.  B  ( m  .+  a )  =  .0.  ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 103    <-> wb 104    = wceq 1348    e. wcel 2141   A.wral 2448   E.wrex 2449   ` cfv 5198  (class class class)co 5853   Basecbs 12416   +g cplusg 12480   0gc0g 12596   Mndcmnd 12652   Grpcgrp 12708
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-rab 2457  df-v 2732  df-un 3125  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-iota 5160  df-fv 5206  df-ov 5856  df-grp 12711
This theorem is referenced by:  grpmnd  12715  grpinvex  12718  grppropd  12724  isgrpd2e  12726
  Copyright terms: Public domain W3C validator