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

Theorem dfgrp2e 13601
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 13600 . 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 3592 . . . 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 13132 . . . . 5  |-  ( n  e.  B  ->  G  e.  _V )
65exlimiv 1644 . . . 4  |-  ( E. n  n  e.  B  ->  G  e.  _V )
71, 2issgrpv 13477 . . . 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 1395   E.wex 1538    e. wcel 2200   A.wral 2508   E.wrex 2509   _Vcvv 2800   ` cfv 5324  (class class class)co 6013   Basecbs 13072   +g cplusg 13150  Smgrpcsgrp 13474   Grpcgrp 13573
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-cnex 8113  ax-resscn 8114  ax-1re 8116  ax-addrcl 8119
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-iota 5284  df-fun 5326  df-fn 5327  df-fv 5332  df-riota 5966  df-ov 6016  df-inn 9134  df-2 9192  df-ndx 13075  df-slot 13076  df-base 13078  df-plusg 13163  df-0g 13331  df-mgm 13429  df-sgrp 13475  df-mnd 13490  df-grp 13576
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator