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

Theorem grpidinv2 13813
Description: A group's properties using the explicit identity element. (Contributed by NM, 5-Feb-2010.) (Revised by AV, 1-Sep-2021.)
Hypotheses
Ref Expression
grplrinv.b  |-  B  =  ( Base `  G
)
grplrinv.p  |-  .+  =  ( +g  `  G )
grplrinv.i  |-  .0.  =  ( 0g `  G )
Assertion
Ref Expression
grpidinv2  |-  ( ( G  e.  Grp  /\  A  e.  B )  ->  ( ( (  .0.  .+  A )  =  A  /\  ( A  .+  .0.  )  =  A
)  /\  E. y  e.  B  ( (
y  .+  A )  =  .0.  /\  ( A 
.+  y )  =  .0.  ) ) )
Distinct variable groups:    y, B    y, G    y,  .+    y,  .0.    y, A

Proof of Theorem grpidinv2
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 grplrinv.b . . 3  |-  B  =  ( Base `  G
)
2 grplrinv.p . . 3  |-  .+  =  ( +g  `  G )
3 grplrinv.i . . 3  |-  .0.  =  ( 0g `  G )
41, 2, 3grplid 13786 . 2  |-  ( ( G  e.  Grp  /\  A  e.  B )  ->  (  .0.  .+  A
)  =  A )
51, 2, 3grprid 13787 . 2  |-  ( ( G  e.  Grp  /\  A  e.  B )  ->  ( A  .+  .0.  )  =  A )
61, 2, 3grplrinv 13812 . . 3  |-  ( G  e.  Grp  ->  A. z  e.  B  E. y  e.  B  ( (
y  .+  z )  =  .0.  /\  ( z 
.+  y )  =  .0.  ) )
7 oveq2 6066 . . . . . . 7  |-  ( z  =  A  ->  (
y  .+  z )  =  ( y  .+  A ) )
87eqeq1d 2243 . . . . . 6  |-  ( z  =  A  ->  (
( y  .+  z
)  =  .0.  <->  ( y  .+  A )  =  .0.  ) )
9 oveq1 6065 . . . . . . 7  |-  ( z  =  A  ->  (
z  .+  y )  =  ( A  .+  y ) )
109eqeq1d 2243 . . . . . 6  |-  ( z  =  A  ->  (
( z  .+  y
)  =  .0.  <->  ( A  .+  y )  =  .0.  ) )
118, 10anbi12d 473 . . . . 5  |-  ( z  =  A  ->  (
( ( y  .+  z )  =  .0. 
/\  ( z  .+  y )  =  .0.  )  <->  ( ( y 
.+  A )  =  .0.  /\  ( A 
.+  y )  =  .0.  ) ) )
1211rexbidv 2545 . . . 4  |-  ( z  =  A  ->  ( E. y  e.  B  ( ( y  .+  z )  =  .0. 
/\  ( z  .+  y )  =  .0.  )  <->  E. y  e.  B  ( ( y  .+  A )  =  .0. 
/\  ( A  .+  y )  =  .0.  ) ) )
1312rspcv 2919 . . 3  |-  ( A  e.  B  ->  ( A. z  e.  B  E. y  e.  B  ( ( y  .+  z )  =  .0. 
/\  ( z  .+  y )  =  .0.  )  ->  E. y  e.  B  ( (
y  .+  A )  =  .0.  /\  ( A 
.+  y )  =  .0.  ) ) )
146, 13mpan9 281 . 2  |-  ( ( G  e.  Grp  /\  A  e.  B )  ->  E. y  e.  B  ( ( y  .+  A )  =  .0. 
/\  ( A  .+  y )  =  .0.  ) )
154, 5, 14jca31 309 1  |-  ( ( G  e.  Grp  /\  A  e.  B )  ->  ( ( (  .0.  .+  A )  =  A  /\  ( A  .+  .0.  )  =  A
)  /\  E. y  e.  B  ( (
y  .+  A )  =  .0.  /\  ( A 
.+  y )  =  .0.  ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2205   A.wral 2522   E.wrex 2523   ` cfv 5357  (class class class)co 6058   Basecbs 13296   +g cplusg 13374   0gc0g 13553   Grpcgrp 13755
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-cnex 8234  ax-resscn 8235  ax-1re 8237  ax-addrcl 8240
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-inn 9255  df-2 9313  df-ndx 13299  df-slot 13300  df-base 13302  df-plusg 13387  df-0g 13555  df-mgm 13619  df-sgrp 13665  df-mnd 13678  df-grp 13758  df-minusg 13759
This theorem is referenced by:  grpidinv  13814
  Copyright terms: Public domain W3C validator