HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem ablmuldiv 8107
Description: Law for group multiplication and division.
Hypotheses
Ref Expression
abldiv.1 |- X = ran G
abldiv.3 |- D = ( /g ` G)
Assertion
Ref Expression
ablmuldiv |- ((G e. Abel /\ (A e. X /\ B e. X /\ C e. X)) -> ((AGB)DC) = ((ADC)GB))

Proof of Theorem ablmuldiv
StepHypRef Expression
1 abldiv.1 . . . . 5 |- X = ran G
21ablcom 8103 . . . 4 |- ((G e. Abel /\ A e. X /\ B e. X) -> (AGB) = (BGA))
323adant3r3 844 . . 3 |- ((G e. Abel /\ (A e. X /\ B e. X /\ C e. X)) -> (AGB) = (BGA))
43opreq1d 3975 . 2 |- ((G e. Abel /\ (A e. X /\ B e. X /\ C e. X)) -> ((AGB)DC) = ((BGA)DC))
5 abldiv.3 . . . . 5 |- D = ( /g ` G)
61, 5grpmuldivass 8088 . . . 4 |- ((G e. Grp /\ (B e. X /\ A e. X /\ C e. X)) -> ((BGA)DC) = (BG(ADC)))
7 ablgrp 8102 . . . 4 |- (G e. Abel -> G e. Grp)
86, 7sylan 448 . . 3 |- ((G e. Abel /\ (B e. X /\ A e. X /\ C e. X)) -> ((BGA)DC) = (BG(ADC)))
9 3ancoma 782 . . 3 |- ((A e. X /\ B e. X /\ C e. X) <-> (B e. X /\ A e. X /\ C e. X))
108, 9sylan2b 452 . 2 |- ((G e. Abel /\ (A e. X /\ B e. X /\ C e. X)) -> ((BGA)DC) = (BG(ADC)))
11 3simp2 789 . . . . 5 |- ((A e. X /\ B e. X /\ C e. X) -> B e. X)
1211adantl 388 . . . 4 |- ((G e. Abel /\ (A e. X /\ B e. X /\ C e. X)) -> B e. X)
131, 5grpdivcl 8086 . . . . . 6 |- ((G e. Grp /\ A e. X /\ C e. X) -> (ADC) e. X)
1413, 7syl3an1 859 . . . . 5 |- ((G e. Abel /\ A e. X /\ C e. X) -> (ADC) e. X)
15143adant3r2 843 . . . 4 |- ((G e. Abel /\ (A e. X /\ B e. X /\ C e. X)) -> (ADC) e. X)
1612, 15jca 288 . . 3 |- ((G e. Abel /\ (A e. X /\ B e. X /\ C e. X)) -> (B e. X /\ (ADC) e. X))
171ablcom 8103 . . . 4 |- ((G e. Abel /\ B e. X /\ (ADC) e. X) -> (BG(ADC)) = ((ADC)GB))
18173expb 834 . . 3 |- ((G e. Abel /\ (B e. X /\ (ADC) e. X)) -> (BG(ADC)) = ((ADC)GB))
1916, 18syldan 467 . 2 |- ((G e. Abel /\ (A e. X /\ B e. X /\ C e. X)) -> (BG(ADC)) = ((ADC)GB))
204, 10, 193eqtrd 1511 1 |- ((G e. Abel /\ (A e. X /\ B e. X /\ C e. X)) -> ((AGB)DC) = ((ADC)GB))
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 223   /\ w3a 775   = wceq 956   e. wcel 958  ran crn 3171  ` cfv 3182  (class class class)co 3963  Grpcgr 8033   /g cgs 8036  Abelcabl 8099
This theorem is referenced by:  abldivdiv 8108  nvaddsub 8279
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-9 965  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-rep 2693  ax-sep 2703  ax-nul 2710  ax-pow 2742  ax-pr 2779  ax-un 2866
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3an 777  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-ral 1649  df-rex 1650  df-reu 1651  df-rab 1652  df-v 1812  df-sbc 1942  df-csb 2002  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-op 2416  df-uni 2504  df-br 2620  df-opab 2667  df-id 2835  df-xp 3184  df-rel 3185  df-cnv 3186  df-co 3187  df-dm 3188  df-rn 3189  df-res 3190  df-ima 3191  df-fun 3192  df-fn 3193  df-f 3194  df-fo 3196  df-fv 3198  df-opr 3965  df-oprab 3966  df-1st 4079  df-2nd 4080  df-grp 8037  df-gid 8038  df-ginv 8039  df-gdiv 8040  df-abl 8100
Copyright terms: Public domain