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

Theorem ablonnncan 20960
Description: Cancellation law for group division. (nnncan 9082 analog.) (Contributed by NM, 29-Feb-2008.) (New usage is discouraged.)
Hypotheses
Ref Expression
abldiv.1  |-  X  =  ran  G
abldiv.3  |-  D  =  (  /g  `  G
)
Assertion
Ref Expression
ablonnncan  |-  ( ( G  e.  AbelOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  ( ( A D ( B D C ) ) D C )  =  ( A D B ) )

Proof of Theorem ablonnncan
StepHypRef Expression
1 simpr1 961 . . . 4  |-  ( ( G  e.  AbelOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  A  e.  X )
2 ablogrpo 20951 . . . . . 6  |-  ( G  e.  AbelOp  ->  G  e.  GrpOp )
3 abldiv.1 . . . . . . 7  |-  X  =  ran  G
4 abldiv.3 . . . . . . 7  |-  D  =  (  /g  `  G
)
53, 4grpodivcl 20914 . . . . . 6  |-  ( ( G  e.  GrpOp  /\  B  e.  X  /\  C  e.  X )  ->  ( B D C )  e.  X )
62, 5syl3an1 1215 . . . . 5  |-  ( ( G  e.  AbelOp  /\  B  e.  X  /\  C  e.  X )  ->  ( B D C )  e.  X )
763adant3r1 1160 . . . 4  |-  ( ( G  e.  AbelOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  ( B D C )  e.  X
)
8 simpr3 963 . . . 4  |-  ( ( G  e.  AbelOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  C  e.  X )
91, 7, 83jca 1132 . . 3  |-  ( ( G  e.  AbelOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  ( A  e.  X  /\  ( B D C )  e.  X  /\  C  e.  X ) )
103, 4ablodivdiv4 20958 . . 3  |-  ( ( G  e.  AbelOp  /\  ( A  e.  X  /\  ( B D C )  e.  X  /\  C  e.  X ) )  -> 
( ( A D ( B D C ) ) D C )  =  ( A D ( ( B D C ) G C ) ) )
119, 10syldan 456 . 2  |-  ( ( G  e.  AbelOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  ( ( A D ( B D C ) ) D C )  =  ( A D ( ( B D C ) G C ) ) )
123, 4grponpcan 20919 . . . . 5  |-  ( ( G  e.  GrpOp  /\  B  e.  X  /\  C  e.  X )  ->  (
( B D C ) G C )  =  B )
132, 12syl3an1 1215 . . . 4  |-  ( ( G  e.  AbelOp  /\  B  e.  X  /\  C  e.  X )  ->  (
( B D C ) G C )  =  B )
14133adant3r1 1160 . . 3  |-  ( ( G  e.  AbelOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  ( ( B D C ) G C )  =  B )
1514oveq2d 5874 . 2  |-  ( ( G  e.  AbelOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  ( A D ( ( B D C ) G C ) )  =  ( A D B ) )
1611, 15eqtrd 2315 1  |-  ( ( G  e.  AbelOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  ( ( A D ( B D C ) ) D C )  =  ( A D B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    /\ w3a 934    = wceq 1623    e. wcel 1684   ran crn 4690   ` cfv 5255  (class class class)co 5858   GrpOpcgr 20853    /g cgs 20856   AbelOpcablo 20948
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  ax-un 4512
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-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-pw 3627  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-oprab 5862  df-mpt2 5863  df-1st 6122  df-2nd 6123  df-riota 6304  df-grpo 20858  df-gid 20859  df-ginv 20860  df-gdiv 20861  df-ablo 20949
  Copyright terms: Public domain W3C validator