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

Theorem grpinvinv 14535
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 14527 . . . 4  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( N `  X
)  e.  B )
4 eqid 2283 . . . . 5  |-  ( +g  `  G )  =  ( +g  `  G )
5 eqid 2283 . . . . 5  |-  ( 0g
`  G )  =  ( 0g `  G
)
61, 4, 5, 2grprinv 14529 . . . 4  |-  ( ( G  e.  Grp  /\  ( N `  X )  e.  B )  -> 
( ( N `  X ) ( +g  `  G ) ( N `
 ( N `  X ) ) )  =  ( 0g `  G ) )
73, 6syldan 456 . . 3  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( ( N `  X ) ( +g  `  G ) ( N `
 ( N `  X ) ) )  =  ( 0g `  G ) )
81, 4, 5, 2grplinv 14528 . . 3  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( ( N `  X ) ( +g  `  G ) X )  =  ( 0g `  G ) )
97, 8eqtr4d 2318 . 2  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( ( N `  X ) ( +g  `  G ) ( N `
 ( N `  X ) ) )  =  ( ( N `
 X ) ( +g  `  G ) X ) )
10 simpl 443 . . 3  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  G  e.  Grp )
111, 2grpinvcl 14527 . . . 4  |-  ( ( G  e.  Grp  /\  ( N `  X )  e.  B )  -> 
( N `  ( N `  X )
)  e.  B )
123, 11syldan 456 . . 3  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( N `  ( N `  X )
)  e.  B )
13 simpr 447 . . 3  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  X  e.  B )
141, 4grplcan 14534 . . 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 1184 . 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 201 1  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( N `  ( N `  X )
)  =  X )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    = wceq 1623    e. wcel 1684   ` cfv 5255  (class class class)co 5858   Basecbs 13148   +g cplusg 13208   0gc0g 13400   Grpcgrp 14362   inv gcminusg 14363
This theorem is referenced by:  grpinv11  14537  grpinvnz  14539  grpsubinv  14541  grpinvsub  14548  grpsubeq0  14552  grpnpcan  14557  mulgneg  14585  mulgdir  14592  mulgass  14597  eqger  14667  frgpuptinv  15080  ablsub2inv  15112  mulgdi  15126  invghm  15130  rngm2neg  15384  unitinvinv  15457  unitnegcl  15463  irrednegb  15493  abvneg  15599  lspsnneg  15763  tgpconcomp  17795  islindf4  27308  baerlem5amN  31906  baerlem5bmN  31907  baerlem5abmN  31908
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-rep 4131  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-reu 2550  df-rmo 2551  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ov 5861  df-riota 6304  df-0g 13404  df-mnd 14367  df-grp 14489  df-minusg 14490
  Copyright terms: Public domain W3C validator