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

Theorem grpidinv2 13640
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 13613 . 2  |-  ( ( G  e.  Grp  /\  A  e.  B )  ->  (  .0.  .+  A
)  =  A )
51, 2, 3grprid 13614 . 2  |-  ( ( G  e.  Grp  /\  A  e.  B )  ->  ( A  .+  .0.  )  =  A )
61, 2, 3grplrinv 13639 . . 3  |-  ( G  e.  Grp  ->  A. z  e.  B  E. y  e.  B  ( (
y  .+  z )  =  .0.  /\  ( z 
.+  y )  =  .0.  ) )
7 oveq2 6025 . . . . . . 7  |-  ( z  =  A  ->  (
y  .+  z )  =  ( y  .+  A ) )
87eqeq1d 2240 . . . . . 6  |-  ( z  =  A  ->  (
( y  .+  z
)  =  .0.  <->  ( y  .+  A )  =  .0.  ) )
9 oveq1 6024 . . . . . . 7  |-  ( z  =  A  ->  (
z  .+  y )  =  ( A  .+  y ) )
109eqeq1d 2240 . . . . . 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 2533 . . . 4  |-  ( z  =  A  ->  ( E. y  e.  B  ( ( y  .+  z )  =  .0. 
/\  ( z  .+  y )  =  .0.  )  <->  E. y  e.  B  ( ( y  .+  A )  =  .0. 
/\  ( A  .+  y )  =  .0.  ) ) )
1312rspcv 2906 . . 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 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:  grpidinv  13641
  Copyright terms: Public domain W3C validator