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

Theorem dfgrp2e 13230
Description: Alternate definition of a group as a set with a closed, associative operation, a left identity and a left inverse for each element. Alternate definition in [Lang] p. 7. (Contributed by NM, 10-Oct-2006.) (Revised by AV, 28-Aug-2021.)
Hypotheses
Ref Expression
dfgrp2.b  |-  B  =  ( Base `  G
)
dfgrp2.p  |-  .+  =  ( +g  `  G )
Assertion
Ref Expression
dfgrp2e  |-  ( G  e.  Grp  <->  ( A. x  e.  B  A. y  e.  B  (
( x  .+  y
)  e.  B  /\  A. z  e.  B  ( ( x  .+  y
)  .+  z )  =  ( x  .+  ( y  .+  z
) ) )  /\  E. n  e.  B  A. x  e.  B  (
( n  .+  x
)  =  x  /\  E. i  e.  B  ( i  .+  x )  =  n ) ) )
Distinct variable groups:    B, i, n, x    i, G, n, x    .+ , i, n, x   
y, B, z, x   
y, G, z    y,  .+ , z

Proof of Theorem dfgrp2e
StepHypRef Expression
1 dfgrp2.b . . 3  |-  B  =  ( Base `  G
)
2 dfgrp2.p . . 3  |-  .+  =  ( +g  `  G )
31, 2dfgrp2 13229 . 2  |-  ( G  e.  Grp  <->  ( G  e. Smgrp  /\  E. n  e.  B  A. x  e.  B  ( ( n 
.+  x )  =  x  /\  E. i  e.  B  ( i  .+  x )  =  n ) ) )
4 rexm 3551 . . . 4  |-  ( E. n  e.  B  A. x  e.  B  (
( n  .+  x
)  =  x  /\  E. i  e.  B  ( i  .+  x )  =  n )  ->  E. n  n  e.  B )
51basmex 12762 . . . . 5  |-  ( n  e.  B  ->  G  e.  _V )
65exlimiv 1612 . . . 4  |-  ( E. n  n  e.  B  ->  G  e.  _V )
71, 2issgrpv 13106 . . . 4  |-  ( G  e.  _V  ->  ( G  e. Smgrp  <->  A. x  e.  B  A. y  e.  B  ( ( x  .+  y )  e.  B  /\  A. z  e.  B  ( ( x  .+  y )  .+  z
)  =  ( x 
.+  ( y  .+  z ) ) ) ) )
84, 6, 73syl 17 . . 3  |-  ( E. n  e.  B  A. x  e.  B  (
( n  .+  x
)  =  x  /\  E. i  e.  B  ( i  .+  x )  =  n )  -> 
( G  e. Smgrp  <->  A. x  e.  B  A. y  e.  B  ( (
x  .+  y )  e.  B  /\  A. z  e.  B  ( (
x  .+  y )  .+  z )  =  ( x  .+  ( y 
.+  z ) ) ) ) )
98pm5.32ri 455 . 2  |-  ( ( G  e. Smgrp  /\  E. n  e.  B  A. x  e.  B  ( (
n  .+  x )  =  x  /\  E. i  e.  B  ( i  .+  x )  =  n ) )  <->  ( A. x  e.  B  A. y  e.  B  (
( x  .+  y
)  e.  B  /\  A. z  e.  B  ( ( x  .+  y
)  .+  z )  =  ( x  .+  ( y  .+  z
) ) )  /\  E. n  e.  B  A. x  e.  B  (
( n  .+  x
)  =  x  /\  E. i  e.  B  ( i  .+  x )  =  n ) ) )
103, 9bitri 184 1  |-  ( G  e.  Grp  <->  ( A. x  e.  B  A. y  e.  B  (
( x  .+  y
)  e.  B  /\  A. z  e.  B  ( ( x  .+  y
)  .+  z )  =  ( x  .+  ( y  .+  z
) ) )  /\  E. n  e.  B  A. x  e.  B  (
( n  .+  x
)  =  x  /\  E. i  e.  B  ( i  .+  x )  =  n ) ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    = wceq 1364   E.wex 1506    e. wcel 2167   A.wral 2475   E.wrex 2476   _Vcvv 2763   ` cfv 5259  (class class class)co 5925   Basecbs 12703   +g cplusg 12780  Smgrpcsgrp 13103   Grpcgrp 13202
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-cnex 7987  ax-resscn 7988  ax-1re 7990  ax-addrcl 7993
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-iota 5220  df-fun 5261  df-fn 5262  df-fv 5267  df-riota 5880  df-ov 5928  df-inn 9008  df-2 9066  df-ndx 12706  df-slot 12707  df-base 12709  df-plusg 12793  df-0g 12960  df-mgm 13058  df-sgrp 13104  df-mnd 13119  df-grp 13205
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator