Theorem grpmuldivass 8084

Description: Associative-type law for multiplication and division.

Hypotheses

Ref	Expression
grpdivf.1	|- X = ran G
grpdivf.3	|- D = ( /g ` G)

Assertion

Ref	Expression
grpmuldivass	|- ((G e. Grp /\ (A e. X /\ B e. X /\ C e. X)) -> ((AGB)DC) = (AG(BDC)))

Proof of Theorem grpmuldivass

Step	Hyp	Ref	Expression
1		3simp1 790	. . . . 5 |- ((A e. X /\ B e. X /\ C e. X) -> A e. X)
2	1	adantl 390	. . . 4 |- ((G e. Grp /\ (A e. X /\ B e. X /\ C e. X)) -> A e. X)
3		3simp2 791	. . . . 5 |- ((A e. X /\ B e. X /\ C e. X) -> B e. X)
4	3	adantl 390	. . . 4 |- ((G e. Grp /\ (A e. X /\ B e. X /\ C e. X)) -> B e. X)
5		grpdivf.1	. . . . . 6 |- X = ran G
6		eqid 1478	. . . . . 6 |- (inv` G) = (inv` G)
7	5, 6	grpinvcl 8064	. . . . 5 |- ((G e. Grp /\ C e. X) -> ((inv` G)` C) e. X)
8	7	3ad2antr3 816	. . . 4 |- ((G e. Grp /\ (A e. X /\ B e. X /\ C e. X)) -> ((inv` G)` C) e. X)
9	2, 4, 8	3jca 821	. . 3 |- ((G e. Grp /\ (A e. X /\ B e. X /\ C e. X)) -> (A e. X /\ B e. X /\ ((inv` G)` C) e. X))
10	5	grpass 8044	. . 3 |- ((G e. Grp /\ (A e. X /\ B e. X /\ ((inv` G)` C) e. X)) -> ((AGB)G((inv` G)` C)) = (AG(BG((inv` G)` C))))
11	9, 10	syldan 469	. 2 |- ((G e. Grp /\ (A e. X /\ B e. X /\ C e. X)) -> ((AGB)G((inv` G)` C)) = (AG(BG((inv` G)` C))))
12		grpdivf.3	. . . 4 |- D = ( /g ` G)
13	5, 6, 12	grpdivval 8078	. . 3 |- ((G e. Grp /\ (AGB) e. X /\ C e. X) -> ((AGB)DC) = ((AGB)G((inv` G)` C)))
14		pm3.26 319	. . 3 |- ((G e. Grp /\ (A e. X /\ B e. X /\ C e. X)) -> G e. Grp)
15	5	grpcl 8041	. . . 4 |- ((G e. Grp /\ A e. X /\ B e. X) -> (AGB) e. X)
16	15	3adant3r3 846	. . 3 |- ((G e. Grp /\ (A e. X /\ B e. X /\ C e. X)) -> (AGB) e. X)
17		3simp3 792	. . . 4 |- ((A e. X /\ B e. X /\ C e. X) -> C e. X)
18	17	adantl 390	. . 3 |- ((G e. Grp /\ (A e. X /\ B e. X /\ C e. X)) -> C e. X)
19	13, 14, 16, 18	syl3anc 860	. 2 |- ((G e. Grp /\ (A e. X /\ B e. X /\ C e. X)) -> ((AGB)DC) = ((AGB)G((inv` G)` C)))
20	5, 6, 12	grpdivval 8078	. . . 4 |- ((G e. Grp /\ B e. X /\ C e. X) -> (BDC) = (BG((inv` G)` C)))
21	20	3adant3r1 844	. . 3 |- ((G e. Grp /\ (A e. X /\ B e. X /\ C e. X)) -> (BDC) = (BG((inv` G)` C)))
22	21	opreq2d 3982	. 2 |- ((G e. Grp /\ (A e. X /\ B e. X /\ C e. X)) -> (AG(BDC)) = (AG(BG((inv` G)` C))))
23	11, 19, 22	3eqtr4d 1520	1 |- ((G e. Grp /\ (A e. X /\ B e. X /\ C e. X)) -> ((AGB)DC) = (AG(BDC)))

Syntax hints:   -> wi 3   /\ wa 223   /\ w3a 777   = wceq 958   e. wcel 960  ran crn 3177  ` cfv 3188  (class class class)co 3969  Grpcgr 8030  invcgn 8032   /g cgs 8033

This theorem is referenced by:  grppncan 8086  grpnpncan 8090  ablmuldiv 8103  abldivdiv 8104  nvaddsubass 8274

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-9 967  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-rep 2698  ax-sep 2708  ax-pow 2748  ax-pr 2785  ax-un 2872

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3an 779  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-ral 1652  df-rex 1653  df-reu 1654  df-rab 1655  df-v 1815  df-sbc 1945  df-csb 2005  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420  df-uni 2508  df-br 2625  df-opab 2672  df-id 2841  df-xp 3190  df-rel 3191  df-cnv 3192  df-co 3193  df-dm 3194  df-rn 3195  df-res 3196  df-ima 3197  df-fun 3198  df-fn 3199  df-f 3200  df-fo 3202  df-fv 3204  df-opr 3971  df-oprab 3972  df-grp 8034  df-gid 8035  df-ginv 8036  df-gdiv 8037

Copyright terms: Public domain