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

Theorem grpidinv 13587
Description: A group has a left and right identity element, and every member has a left and right inverse. (Contributed by NM, 14-Oct-2006.) (Revised by AV, 1-Sep-2021.)
Hypotheses
Ref Expression
grpidinv.b  |-  B  =  ( Base `  G
)
grpidinv.p  |-  .+  =  ( +g  `  G )
Assertion
Ref Expression
grpidinv  |-  ( G  e.  Grp  ->  E. u  e.  B  A. x  e.  B  ( (
( u  .+  x
)  =  x  /\  ( x  .+  u )  =  x )  /\  E. y  e.  B  ( ( y  .+  x
)  =  u  /\  ( x  .+  y )  =  u ) ) )
Distinct variable groups:    u, G, x, y    u, B, y   
u,  .+ , y
Allowed substitution hints:    B( x)    .+ ( x)

Proof of Theorem grpidinv
StepHypRef Expression
1 grpidinv.b . . 3  |-  B  =  ( Base `  G
)
2 eqid 2229 . . 3  |-  ( 0g
`  G )  =  ( 0g `  G
)
31, 2grpidcl 13557 . 2  |-  ( G  e.  Grp  ->  ( 0g `  G )  e.  B )
4 oveq1 6007 . . . . . . 7  |-  ( u  =  ( 0g `  G )  ->  (
u  .+  x )  =  ( ( 0g
`  G )  .+  x ) )
54eqeq1d 2238 . . . . . 6  |-  ( u  =  ( 0g `  G )  ->  (
( u  .+  x
)  =  x  <->  ( ( 0g `  G )  .+  x )  =  x ) )
6 oveq2 6008 . . . . . . 7  |-  ( u  =  ( 0g `  G )  ->  (
x  .+  u )  =  ( x  .+  ( 0g `  G ) ) )
76eqeq1d 2238 . . . . . 6  |-  ( u  =  ( 0g `  G )  ->  (
( x  .+  u
)  =  x  <->  ( x  .+  ( 0g `  G
) )  =  x ) )
85, 7anbi12d 473 . . . . 5  |-  ( u  =  ( 0g `  G )  ->  (
( ( u  .+  x )  =  x  /\  ( x  .+  u )  =  x )  <->  ( ( ( 0g `  G ) 
.+  x )  =  x  /\  ( x 
.+  ( 0g `  G ) )  =  x ) ) )
9 eqeq2 2239 . . . . . . 7  |-  ( u  =  ( 0g `  G )  ->  (
( y  .+  x
)  =  u  <->  ( y  .+  x )  =  ( 0g `  G ) ) )
10 eqeq2 2239 . . . . . . 7  |-  ( u  =  ( 0g `  G )  ->  (
( x  .+  y
)  =  u  <->  ( x  .+  y )  =  ( 0g `  G ) ) )
119, 10anbi12d 473 . . . . . 6  |-  ( u  =  ( 0g `  G )  ->  (
( ( y  .+  x )  =  u  /\  ( x  .+  y )  =  u )  <->  ( ( y 
.+  x )  =  ( 0g `  G
)  /\  ( x  .+  y )  =  ( 0g `  G ) ) ) )
1211rexbidv 2531 . . . . 5  |-  ( u  =  ( 0g `  G )  ->  ( E. y  e.  B  ( ( y  .+  x )  =  u  /\  ( x  .+  y )  =  u )  <->  E. y  e.  B  ( ( y  .+  x )  =  ( 0g `  G )  /\  ( x  .+  y )  =  ( 0g `  G ) ) ) )
138, 12anbi12d 473 . . . 4  |-  ( u  =  ( 0g `  G )  ->  (
( ( ( u 
.+  x )  =  x  /\  ( x 
.+  u )  =  x )  /\  E. y  e.  B  (
( y  .+  x
)  =  u  /\  ( x  .+  y )  =  u ) )  <-> 
( ( ( ( 0g `  G ) 
.+  x )  =  x  /\  ( x 
.+  ( 0g `  G ) )  =  x )  /\  E. y  e.  B  (
( y  .+  x
)  =  ( 0g
`  G )  /\  ( x  .+  y )  =  ( 0g `  G ) ) ) ) )
1413ralbidv 2530 . . 3  |-  ( u  =  ( 0g `  G )  ->  ( A. x  e.  B  ( ( ( u 
.+  x )  =  x  /\  ( x 
.+  u )  =  x )  /\  E. y  e.  B  (
( y  .+  x
)  =  u  /\  ( x  .+  y )  =  u ) )  <->  A. x  e.  B  ( ( ( ( 0g `  G ) 
.+  x )  =  x  /\  ( x 
.+  ( 0g `  G ) )  =  x )  /\  E. y  e.  B  (
( y  .+  x
)  =  ( 0g
`  G )  /\  ( x  .+  y )  =  ( 0g `  G ) ) ) ) )
1514adantl 277 . 2  |-  ( ( G  e.  Grp  /\  u  =  ( 0g `  G ) )  -> 
( A. x  e.  B  ( ( ( u  .+  x )  =  x  /\  (
x  .+  u )  =  x )  /\  E. y  e.  B  (
( y  .+  x
)  =  u  /\  ( x  .+  y )  =  u ) )  <->  A. x  e.  B  ( ( ( ( 0g `  G ) 
.+  x )  =  x  /\  ( x 
.+  ( 0g `  G ) )  =  x )  /\  E. y  e.  B  (
( y  .+  x
)  =  ( 0g
`  G )  /\  ( x  .+  y )  =  ( 0g `  G ) ) ) ) )
16 grpidinv.p . . . 4  |-  .+  =  ( +g  `  G )
171, 16, 2grpidinv2 13586 . . 3  |-  ( ( G  e.  Grp  /\  x  e.  B )  ->  ( ( ( ( 0g `  G ) 
.+  x )  =  x  /\  ( x 
.+  ( 0g `  G ) )  =  x )  /\  E. y  e.  B  (
( y  .+  x
)  =  ( 0g
`  G )  /\  ( x  .+  y )  =  ( 0g `  G ) ) ) )
1817ralrimiva 2603 . 2  |-  ( G  e.  Grp  ->  A. x  e.  B  ( (
( ( 0g `  G )  .+  x
)  =  x  /\  ( x  .+  ( 0g
`  G ) )  =  x )  /\  E. y  e.  B  ( ( y  .+  x
)  =  ( 0g
`  G )  /\  ( x  .+  y )  =  ( 0g `  G ) ) ) )
193, 15, 18rspcedvd 2913 1  |-  ( G  e.  Grp  ->  E. u  e.  B  A. x  e.  B  ( (
( u  .+  x
)  =  x  /\  ( x  .+  u )  =  x )  /\  E. y  e.  B  ( ( y  .+  x
)  =  u  /\  ( x  .+  y )  =  u ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1395    e. wcel 2200   A.wral 2508   E.wrex 2509   ` cfv 5317  (class class class)co 6000   Basecbs 13027   +g cplusg 13105   0gc0g 13284   Grpcgrp 13528
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-coll 4198  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-cnex 8086  ax-resscn 8087  ax-1re 8089  ax-addrcl 8092
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 2801  df-sbc 3029  df-csb 3125  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-riota 5953  df-ov 6003  df-inn 9107  df-2 9165  df-ndx 13030  df-slot 13031  df-base 13033  df-plusg 13118  df-0g 13286  df-mgm 13384  df-sgrp 13430  df-mnd 13445  df-grp 13531  df-minusg 13532
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator