MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  grpinvinv Unicode version

Theorem grpinvinv 14529
Description: Double inverse law for groups. Lemma 2.2.1(c) of [Herstein] p. 55. (Contributed by NM, 31-Mar-2014.)
Hypotheses
Ref Expression
grpinvinv.b  |-  B  =  ( Base `  G
)
grpinvinv.n  |-  N  =  ( inv g `  G )
Assertion
Ref Expression
grpinvinv  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( N `  ( N `  X )
)  =  X )

Proof of Theorem grpinvinv
StepHypRef Expression
1 grpinvinv.b . . . . 5  |-  B  =  ( Base `  G
)
2 grpinvinv.n . . . . 5  |-  N  =  ( inv g `  G )
31, 2grpinvcl 14521 . . . 4  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( N `  X
)  e.  B )
4 eqid 2284 . . . . 5  |-  ( +g  `  G )  =  ( +g  `  G )
5 eqid 2284 . . . . 5  |-  ( 0g
`  G )  =  ( 0g `  G
)
61, 4, 5, 2grprinv 14523 . . . 4  |-  ( ( G  e.  Grp  /\  ( N `  X )  e.  B )  -> 
( ( N `  X ) ( +g  `  G ) ( N `
 ( N `  X ) ) )  =  ( 0g `  G ) )
73, 6syldan 458 . . 3  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( ( N `  X ) ( +g  `  G ) ( N `
 ( N `  X ) ) )  =  ( 0g `  G ) )
81, 4, 5, 2grplinv 14522 . . 3  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( ( N `  X ) ( +g  `  G ) X )  =  ( 0g `  G ) )
97, 8eqtr4d 2319 . 2  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( ( N `  X ) ( +g  `  G ) ( N `
 ( N `  X ) ) )  =  ( ( N `
 X ) ( +g  `  G ) X ) )
10 simpl 445 . . 3  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  G  e.  Grp )
111, 2grpinvcl 14521 . . . 4  |-  ( ( G  e.  Grp  /\  ( N `  X )  e.  B )  -> 
( N `  ( N `  X )
)  e.  B )
123, 11syldan 458 . . 3  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( N `  ( N `  X )
)  e.  B )
13 simpr 449 . . 3  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  X  e.  B )
141, 4grplcan 14528 . . 3  |-  ( ( G  e.  Grp  /\  ( ( N `  ( N `  X ) )  e.  B  /\  X  e.  B  /\  ( N `  X )  e.  B ) )  ->  ( ( ( N `  X ) ( +g  `  G
) ( N `  ( N `  X ) ) )  =  ( ( N `  X
) ( +g  `  G
) X )  <->  ( N `  ( N `  X
) )  =  X ) )
1510, 12, 13, 3, 14syl13anc 1186 . 2  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( ( ( N `
 X ) ( +g  `  G ) ( N `  ( N `  X )
) )  =  ( ( N `  X
) ( +g  `  G
) X )  <->  ( N `  ( N `  X
) )  =  X ) )
169, 15mpbid 203 1  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( N `  ( N `  X )
)  =  X )
Colors of variables: wff set class
Syntax hints:    -> wi 6    <-> wb 178    /\ wa 360    = wceq 1624    e. wcel 1685   ` cfv 5221  (class class class)co 5819   Basecbs 13142   +g cplusg 13202   0gc0g 13394   Grpcgrp 14356   inv gcminusg 14357
This theorem is referenced by:  grpinv11  14531  grpinvnz  14533  grpsubinv  14535  grpinvsub  14542  grpsubeq0  14546  grpnpcan  14551  mulgneg  14579  mulgdir  14586  mulgass  14591  eqger  14661  frgpuptinv  15074  ablsub2inv  15106  mulgdi  15120  invghm  15124  rngm2neg  15378  unitinvinv  15451  unitnegcl  15457  irrednegb  15487  abvneg  15593  lspsnneg  15757  tgpconcomp  17789  islindf4  26707  baerlem5amN  31173  baerlem5bmN  31174  baerlem5abmN  31175
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-gen 1534  ax-5 1545  ax-17 1604  ax-9 1637  ax-8 1645  ax-13 1687  ax-14 1689  ax-6 1704  ax-7 1709  ax-11 1716  ax-12 1867  ax-ext 2265  ax-rep 4132  ax-sep 4142  ax-nul 4150  ax-pr 4213  ax-un 4511
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 938  df-tru 1312  df-ex 1530  df-nf 1533  df-sb 1632  df-eu 2148  df-mo 2149  df-clab 2271  df-cleq 2277  df-clel 2280  df-nfc 2409  df-ne 2449  df-ral 2549  df-rex 2550  df-reu 2551  df-rmo 2552  df-rab 2553  df-v 2791  df-sbc 2993  df-csb 3083  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3457  df-if 3567  df-sn 3647  df-pr 3648  df-op 3650  df-uni 3829  df-iun 3908  df-br 4025  df-opab 4079  df-mpt 4080  df-id 4308  df-xp 4694  df-rel 4695  df-cnv 4696  df-co 4697  df-dm 4698  df-rn 4699  df-res 4700  df-ima 4701  df-fun 5223  df-fn 5224  df-f 5225  df-f1 5226  df-fo 5227  df-f1o 5228  df-fv 5229  df-ov 5822  df-iota 6252  df-riota 6299  df-0g 13398  df-mnd 14361  df-grp 14483  df-minusg 14484
  Copyright terms: Public domain W3C validator