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

Theorem grpidinv 13641
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 2231 . . 3  |-  ( 0g
`  G )  =  ( 0g `  G
)
31, 2grpidcl 13611 . 2  |-  ( G  e.  Grp  ->  ( 0g `  G )  e.  B )
4 oveq1 6024 . . . . . . 7  |-  ( u  =  ( 0g `  G )  ->  (
u  .+  x )  =  ( ( 0g
`  G )  .+  x ) )
54eqeq1d 2240 . . . . . 6  |-  ( u  =  ( 0g `  G )  ->  (
( u  .+  x
)  =  x  <->  ( ( 0g `  G )  .+  x )  =  x ) )
6 oveq2 6025 . . . . . . 7  |-  ( u  =  ( 0g `  G )  ->  (
x  .+  u )  =  ( x  .+  ( 0g `  G ) ) )
76eqeq1d 2240 . . . . . 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 2241 . . . . . . 7  |-  ( u  =  ( 0g `  G )  ->  (
( y  .+  x
)  =  u  <->  ( y  .+  x )  =  ( 0g `  G ) ) )
10 eqeq2 2241 . . . . . . 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 2533 . . . . 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 2532 . . 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 13640 . . 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 2605 . 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 2916 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 1397    e. wcel 2202   A.wral 2510   E.wrex 2511   ` cfv 5326  (class class class)co 6017   Basecbs 13081   +g cplusg 13159   0gc0g 13338   Grpcgrp 13582
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-cnex 8122  ax-resscn 8123  ax-1re 8125  ax-addrcl 8128
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5970  df-ov 6020  df-inn 9143  df-2 9201  df-ndx 13084  df-slot 13085  df-base 13087  df-plusg 13172  df-0g 13340  df-mgm 13438  df-sgrp 13484  df-mnd 13499  df-grp 13585  df-minusg 13586
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator