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

Theorem grpoinvdiv 21835
Description: Inverse of a group division. (Contributed by NM, 24-Feb-2008.) (New usage is discouraged.)
Hypotheses
Ref Expression
grpdiv.1  |-  X  =  ran  G
grpdiv.2  |-  N  =  ( inv `  G
)
grpdiv.3  |-  D  =  (  /g  `  G
)
Assertion
Ref Expression
grpoinvdiv  |-  ( ( G  e.  GrpOp  /\  A  e.  X  /\  B  e.  X )  ->  ( N `  ( A D B ) )  =  ( B D A ) )

Proof of Theorem grpoinvdiv
StepHypRef Expression
1 grpdiv.1 . . . 4  |-  X  =  ran  G
2 grpdiv.2 . . . 4  |-  N  =  ( inv `  G
)
3 grpdiv.3 . . . 4  |-  D  =  (  /g  `  G
)
41, 2, 3grpodivval 21833 . . 3  |-  ( ( G  e.  GrpOp  /\  A  e.  X  /\  B  e.  X )  ->  ( A D B )  =  ( A G ( N `  B ) ) )
54fveq2d 5734 . 2  |-  ( ( G  e.  GrpOp  /\  A  e.  X  /\  B  e.  X )  ->  ( N `  ( A D B ) )  =  ( N `  ( A G ( N `  B ) ) ) )
61, 2grpoinvcl 21816 . . . 4  |-  ( ( G  e.  GrpOp  /\  B  e.  X )  ->  ( N `  B )  e.  X )
763adant2 977 . . 3  |-  ( ( G  e.  GrpOp  /\  A  e.  X  /\  B  e.  X )  ->  ( N `  B )  e.  X )
81, 2grpoinvop 21831 . . 3  |-  ( ( G  e.  GrpOp  /\  A  e.  X  /\  ( N `  B )  e.  X )  ->  ( N `  ( A G ( N `  B ) ) )  =  ( ( N `
 ( N `  B ) ) G ( N `  A
) ) )
97, 8syld3an3 1230 . 2  |-  ( ( G  e.  GrpOp  /\  A  e.  X  /\  B  e.  X )  ->  ( N `  ( A G ( N `  B ) ) )  =  ( ( N `
 ( N `  B ) ) G ( N `  A
) ) )
101, 2grpo2inv 21829 . . . . 5  |-  ( ( G  e.  GrpOp  /\  B  e.  X )  ->  ( N `  ( N `  B ) )  =  B )
11103adant2 977 . . . 4  |-  ( ( G  e.  GrpOp  /\  A  e.  X  /\  B  e.  X )  ->  ( N `  ( N `  B ) )  =  B )
1211oveq1d 6098 . . 3  |-  ( ( G  e.  GrpOp  /\  A  e.  X  /\  B  e.  X )  ->  (
( N `  ( N `  B )
) G ( N `
 A ) )  =  ( B G ( N `  A
) ) )
131, 2, 3grpodivval 21833 . . . 4  |-  ( ( G  e.  GrpOp  /\  B  e.  X  /\  A  e.  X )  ->  ( B D A )  =  ( B G ( N `  A ) ) )
14133com23 1160 . . 3  |-  ( ( G  e.  GrpOp  /\  A  e.  X  /\  B  e.  X )  ->  ( B D A )  =  ( B G ( N `  A ) ) )
1512, 14eqtr4d 2473 . 2  |-  ( ( G  e.  GrpOp  /\  A  e.  X  /\  B  e.  X )  ->  (
( N `  ( N `  B )
) G ( N `
 A ) )  =  ( B D A ) )
165, 9, 153eqtrd 2474 1  |-  ( ( G  e.  GrpOp  /\  A  e.  X  /\  B  e.  X )  ->  ( N `  ( A D B ) )  =  ( B D A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ w3a 937    = wceq 1653    e. wcel 1726   ran crn 4881   ` cfv 5456  (class class class)co 6083   GrpOpcgr 21776   invcgn 21778    /g cgs 21779
This theorem is referenced by:  grpodivdiv  21838
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-13 1728  ax-14 1730  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2419  ax-rep 4322  ax-sep 4332  ax-nul 4340  ax-pow 4379  ax-pr 4405  ax-un 4703
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-eu 2287  df-mo 2288  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ne 2603  df-ral 2712  df-rex 2713  df-reu 2714  df-rab 2716  df-v 2960  df-sbc 3164  df-csb 3254  df-dif 3325  df-un 3327  df-in 3329  df-ss 3336  df-nul 3631  df-if 3742  df-pw 3803  df-sn 3822  df-pr 3823  df-op 3825  df-uni 4018  df-iun 4097  df-br 4215  df-opab 4269  df-mpt 4270  df-id 4500  df-xp 4886  df-rel 4887  df-cnv 4888  df-co 4889  df-dm 4890  df-rn 4891  df-res 4892  df-ima 4893  df-iota 5420  df-fun 5458  df-fn 5459  df-f 5460  df-f1 5461  df-fo 5462  df-f1o 5463  df-fv 5464  df-ov 6086  df-oprab 6087  df-mpt2 6088  df-1st 6351  df-2nd 6352  df-riota 6551  df-grpo 21781  df-gid 21782  df-ginv 21783  df-gdiv 21784
  Copyright terms: Public domain W3C validator