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

Theorem ablodivdiv4 21390
Description: Law for double group division. (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
ablodivdiv4  |-  ( ( G  e.  AbelOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  ( ( A D B ) D C )  =  ( A D ( B G C ) ) )

Proof of Theorem ablodivdiv4
StepHypRef Expression
1 ablogrpo 21383 . . 3  |-  ( G  e.  AbelOp  ->  G  e.  GrpOp )
2 simpl 443 . . . 4  |-  ( ( G  e.  GrpOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  G  e.  GrpOp
)
3 abldiv.1 . . . . . 6  |-  X  =  ran  G
4 abldiv.3 . . . . . 6  |-  D  =  (  /g  `  G
)
53, 4grpodivcl 21346 . . . . 5  |-  ( ( G  e.  GrpOp  /\  A  e.  X  /\  B  e.  X )  ->  ( A D B )  e.  X )
653adant3r3 1163 . . . 4  |-  ( ( G  e.  GrpOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  ( A D B )  e.  X
)
7 simpr3 964 . . . 4  |-  ( ( G  e.  GrpOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  C  e.  X )
8 eqid 2366 . . . . 5  |-  ( inv `  G )  =  ( inv `  G )
93, 8, 4grpodivval 21342 . . . 4  |-  ( ( G  e.  GrpOp  /\  ( A D B )  e.  X  /\  C  e.  X )  ->  (
( A D B ) D C )  =  ( ( A D B ) G ( ( inv `  G
) `  C )
) )
102, 6, 7, 9syl3anc 1183 . . 3  |-  ( ( G  e.  GrpOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  ( ( A D B ) D C )  =  ( ( A D B ) G ( ( inv `  G ) `
 C ) ) )
111, 10sylan 457 . 2  |-  ( ( G  e.  AbelOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  ( ( A D B ) D C )  =  ( ( A D B ) G ( ( inv `  G ) `
 C ) ) )
12 simpr1 962 . . . 4  |-  ( ( G  e.  AbelOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  A  e.  X )
13 simpr2 963 . . . 4  |-  ( ( G  e.  AbelOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  B  e.  X )
14 simp3 958 . . . . 5  |-  ( ( A  e.  X  /\  B  e.  X  /\  C  e.  X )  ->  C  e.  X )
153, 8grpoinvcl 21325 . . . . 5  |-  ( ( G  e.  GrpOp  /\  C  e.  X )  ->  (
( inv `  G
) `  C )  e.  X )
161, 14, 15syl2an 463 . . . 4  |-  ( ( G  e.  AbelOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  ( ( inv `  G ) `  C )  e.  X
)
1712, 13, 163jca 1133 . . 3  |-  ( ( G  e.  AbelOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  ( A  e.  X  /\  B  e.  X  /\  ( ( inv `  G ) `
 C )  e.  X ) )
183, 4ablodivdiv 21389 . . 3  |-  ( ( G  e.  AbelOp  /\  ( A  e.  X  /\  B  e.  X  /\  ( ( inv `  G
) `  C )  e.  X ) )  -> 
( A D ( B D ( ( inv `  G ) `
 C ) ) )  =  ( ( A D B ) G ( ( inv `  G ) `  C
) ) )
1917, 18syldan 456 . 2  |-  ( ( G  e.  AbelOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  ( A D ( B D ( ( inv `  G
) `  C )
) )  =  ( ( A D B ) G ( ( inv `  G ) `
 C ) ) )
203, 8, 4grpodivinv 21343 . . . . 5  |-  ( ( G  e.  GrpOp  /\  B  e.  X  /\  C  e.  X )  ->  ( B D ( ( inv `  G ) `  C
) )  =  ( B G C ) )
211, 20syl3an1 1216 . . . 4  |-  ( ( G  e.  AbelOp  /\  B  e.  X  /\  C  e.  X )  ->  ( B D ( ( inv `  G ) `  C
) )  =  ( B G C ) )
22213adant3r1 1161 . . 3  |-  ( ( G  e.  AbelOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  ( B D ( ( inv `  G ) `  C
) )  =  ( B G C ) )
2322oveq2d 5997 . 2  |-  ( ( G  e.  AbelOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  ( A D ( B D ( ( inv `  G
) `  C )
) )  =  ( A D ( B G C ) ) )
2411, 19, 233eqtr2d 2404 1  |-  ( ( G  e.  AbelOp  /\  ( A  e.  X  /\  B  e.  X  /\  C  e.  X )
)  ->  ( ( A D B ) D C )  =  ( A D ( B G C ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    /\ w3a 935    = wceq 1647    e. wcel 1715   ran crn 4793   ` cfv 5358  (class class class)co 5981   GrpOpcgr 21285   invcgn 21287    /g cgs 21288   AbelOpcablo 21380
This theorem is referenced by:  ablodiv32  21391  ablonnncan  21392  ablo4pnp  26161
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1551  ax-5 1562  ax-17 1621  ax-9 1659  ax-8 1680  ax-13 1717  ax-14 1719  ax-6 1734  ax-7 1739  ax-11 1751  ax-12 1937  ax-ext 2347  ax-rep 4233  ax-sep 4243  ax-nul 4251  ax-pow 4290  ax-pr 4316  ax-un 4615
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 937  df-tru 1324  df-ex 1547  df-nf 1550  df-sb 1654  df-eu 2221  df-mo 2222  df-clab 2353  df-cleq 2359  df-clel 2362  df-nfc 2491  df-ne 2531  df-ral 2633  df-rex 2634  df-reu 2635  df-rab 2637  df-v 2875  df-sbc 3078  df-csb 3168  df-dif 3241  df-un 3243  df-in 3245  df-ss 3252  df-nul 3544  df-if 3655  df-pw 3716  df-sn 3735  df-pr 3736  df-op 3738  df-uni 3930  df-iun 4009  df-br 4126  df-opab 4180  df-mpt 4181  df-id 4412  df-xp 4798  df-rel 4799  df-cnv 4800  df-co 4801  df-dm 4802  df-rn 4803  df-res 4804  df-ima 4805  df-iota 5322  df-fun 5360  df-fn 5361  df-f 5362  df-f1 5363  df-fo 5364  df-f1o 5365  df-fv 5366  df-ov 5984  df-oprab 5985  df-mpt2 5986  df-1st 6249  df-2nd 6250  df-riota 6446  df-grpo 21290  df-gid 21291  df-ginv 21292  df-gdiv 21293  df-ablo 21381
  Copyright terms: Public domain W3C validator