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

Theorem dfgrp2e 13360
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 13359 . 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 3560 . . . 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 12891 . . . . 5  |-  ( n  e.  B  ->  G  e.  _V )
65exlimiv 1621 . . . 4  |-  ( E. n  n  e.  B  ->  G  e.  _V )
71, 2issgrpv 13236 . . . 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 1373   E.wex 1515    e. wcel 2176   A.wral 2484   E.wrex 2485   _Vcvv 2772   ` cfv 5271  (class class class)co 5944   Basecbs 12832   +g cplusg 12909  Smgrpcsgrp 13233   Grpcgrp 13332
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253  ax-un 4480  ax-cnex 8016  ax-resscn 8017  ax-1re 8019  ax-addrcl 8022
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-reu 2491  df-rmo 2492  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-int 3886  df-br 4045  df-opab 4106  df-mpt 4107  df-id 4340  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-iota 5232  df-fun 5273  df-fn 5274  df-fv 5279  df-riota 5899  df-ov 5947  df-inn 9037  df-2 9095  df-ndx 12835  df-slot 12836  df-base 12838  df-plusg 12922  df-0g 13090  df-mgm 13188  df-sgrp 13234  df-mnd 13249  df-grp 13335
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator