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

Theorem grpinvid1 13184
Description: The inverse of a group element expressed in terms of the identity element. (Contributed by NM, 24-Aug-2011.)
Hypotheses
Ref Expression
grpinv.b  |-  B  =  ( Base `  G
)
grpinv.p  |-  .+  =  ( +g  `  G )
grpinv.u  |-  .0.  =  ( 0g `  G )
grpinv.n  |-  N  =  ( invg `  G )
Assertion
Ref Expression
grpinvid1  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  ->  ( ( N `  X )  =  Y  <-> 
( X  .+  Y
)  =  .0.  )
)

Proof of Theorem grpinvid1
StepHypRef Expression
1 oveq2 5930 . . . 4  |-  ( ( N `  X )  =  Y  ->  ( X  .+  ( N `  X ) )  =  ( X  .+  Y
) )
21adantl 277 . . 3  |-  ( ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  /\  ( N `  X
)  =  Y )  ->  ( X  .+  ( N `  X ) )  =  ( X 
.+  Y ) )
3 grpinv.b . . . . . 6  |-  B  =  ( Base `  G
)
4 grpinv.p . . . . . 6  |-  .+  =  ( +g  `  G )
5 grpinv.u . . . . . 6  |-  .0.  =  ( 0g `  G )
6 grpinv.n . . . . . 6  |-  N  =  ( invg `  G )
73, 4, 5, 6grprinv 13183 . . . . 5  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( X  .+  ( N `  X )
)  =  .0.  )
873adant3 1019 . . . 4  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  ->  ( X  .+  ( N `  X )
)  =  .0.  )
98adantr 276 . . 3  |-  ( ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  /\  ( N `  X
)  =  Y )  ->  ( X  .+  ( N `  X ) )  =  .0.  )
102, 9eqtr3d 2231 . 2  |-  ( ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  /\  ( N `  X
)  =  Y )  ->  ( X  .+  Y )  =  .0.  )
11 oveq2 5930 . . . 4  |-  ( ( X  .+  Y )  =  .0.  ->  (
( N `  X
)  .+  ( X  .+  Y ) )  =  ( ( N `  X )  .+  .0.  ) )
1211adantl 277 . . 3  |-  ( ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  /\  ( X  .+  Y
)  =  .0.  )  ->  ( ( N `  X )  .+  ( X  .+  Y ) )  =  ( ( N `
 X )  .+  .0.  ) )
133, 4, 5, 6grplinv 13182 . . . . . . . 8  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( ( N `  X )  .+  X
)  =  .0.  )
1413oveq1d 5937 . . . . . . 7  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( ( ( N `
 X )  .+  X )  .+  Y
)  =  (  .0.  .+  Y ) )
15143adant3 1019 . . . . . 6  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  ->  ( ( ( N `
 X )  .+  X )  .+  Y
)  =  (  .0.  .+  Y ) )
163, 6grpinvcl 13180 . . . . . . . . . 10  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( N `  X
)  e.  B )
1716adantrr 479 . . . . . . . . 9  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  Y  e.  B
) )  ->  ( N `  X )  e.  B )
18 simprl 529 . . . . . . . . 9  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  Y  e.  B
) )  ->  X  e.  B )
19 simprr 531 . . . . . . . . 9  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  Y  e.  B
) )  ->  Y  e.  B )
2017, 18, 193jca 1179 . . . . . . . 8  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  Y  e.  B
) )  ->  (
( N `  X
)  e.  B  /\  X  e.  B  /\  Y  e.  B )
)
213, 4grpass 13141 . . . . . . . 8  |-  ( ( G  e.  Grp  /\  ( ( N `  X )  e.  B  /\  X  e.  B  /\  Y  e.  B
) )  ->  (
( ( N `  X )  .+  X
)  .+  Y )  =  ( ( N `
 X )  .+  ( X  .+  Y ) ) )
2220, 21syldan 282 . . . . . . 7  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  Y  e.  B
) )  ->  (
( ( N `  X )  .+  X
)  .+  Y )  =  ( ( N `
 X )  .+  ( X  .+  Y ) ) )
23223impb 1201 . . . . . 6  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  ->  ( ( ( N `
 X )  .+  X )  .+  Y
)  =  ( ( N `  X ) 
.+  ( X  .+  Y ) ) )
2415, 23eqtr3d 2231 . . . . 5  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  ->  (  .0.  .+  Y
)  =  ( ( N `  X ) 
.+  ( X  .+  Y ) ) )
253, 4, 5grplid 13163 . . . . . 6  |-  ( ( G  e.  Grp  /\  Y  e.  B )  ->  (  .0.  .+  Y
)  =  Y )
26253adant2 1018 . . . . 5  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  ->  (  .0.  .+  Y
)  =  Y )
2724, 26eqtr3d 2231 . . . 4  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  ->  ( ( N `  X )  .+  ( X  .+  Y ) )  =  Y )
2827adantr 276 . . 3  |-  ( ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  /\  ( X  .+  Y
)  =  .0.  )  ->  ( ( N `  X )  .+  ( X  .+  Y ) )  =  Y )
293, 4, 5grprid 13164 . . . . . 6  |-  ( ( G  e.  Grp  /\  ( N `  X )  e.  B )  -> 
( ( N `  X )  .+  .0.  )  =  ( N `  X ) )
3016, 29syldan 282 . . . . 5  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( ( N `  X )  .+  .0.  )  =  ( N `  X ) )
31303adant3 1019 . . . 4  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  ->  ( ( N `  X )  .+  .0.  )  =  ( N `  X ) )
3231adantr 276 . . 3  |-  ( ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  /\  ( X  .+  Y
)  =  .0.  )  ->  ( ( N `  X )  .+  .0.  )  =  ( N `  X ) )
3312, 28, 323eqtr3rd 2238 . 2  |-  ( ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  /\  ( X  .+  Y
)  =  .0.  )  ->  ( N `  X
)  =  Y )
3410, 33impbida 596 1  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  ->  ( ( N `  X )  =  Y  <-> 
( X  .+  Y
)  =  .0.  )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 980    = wceq 1364    e. wcel 2167   ` cfv 5258  (class class class)co 5922   Basecbs 12678   +g cplusg 12755   0gc0g 12927   Grpcgrp 13132   invgcminusg 13133
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-cnex 7970  ax-resscn 7971  ax-1re 7973  ax-addrcl 7976
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-riota 5877  df-ov 5925  df-inn 8991  df-2 9049  df-ndx 12681  df-slot 12682  df-base 12684  df-plusg 12768  df-0g 12929  df-mgm 12999  df-sgrp 13045  df-mnd 13058  df-grp 13135  df-minusg 13136
This theorem is referenced by:  grpinvid  13192  grpinvcnv  13200  grpinvadd  13210  subginv  13311  qusinv  13366  ghminv  13380  rngmneg1  13503  ringnegl  13607  lmodindp1  13984  cnfldneg  14129  zringinvg  14160
  Copyright terms: Public domain W3C validator