Theorem grpomuldivass 30612

Description: Associative-type law for multiplication and division. (Contributed by NM, 15-Feb-2008.) (New usage is discouraged.)

Hypotheses

Ref	Expression
grpdivf.1	⊢ 𝑋 = ran 𝐺
grpdivf.3	⊢ 𝐷 = ( /𝑔 ‘𝐺)

Assertion

Ref	Expression
grpomuldivass	⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐷𝐶) = (𝐴𝐺(𝐵𝐷𝐶)))

Proof of Theorem grpomuldivass

Step	Hyp	Ref	Expression
1		simpr1 1196	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐴 ∈ 𝑋)
2		simpr2 1197	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐵 ∈ 𝑋)
3		grpdivf.1	. . . . . 6 ⊢ 𝑋 = ran 𝐺
4		eqid 2736	. . . . . 6 ⊢ (inv‘𝐺) = (inv‘𝐺)
5	3, 4	grpoinvcl 30595	. . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐶 ∈ 𝑋) → ((inv‘𝐺)‘𝐶) ∈ 𝑋)
6	5	3ad2antr3 1192	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((inv‘𝐺)‘𝐶) ∈ 𝑋)
7	1, 2, 6	3jca 1129	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ ((inv‘𝐺)‘𝐶) ∈ 𝑋))
8	3	grpoass 30574	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ ((inv‘𝐺)‘𝐶) ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺((inv‘𝐺)‘𝐶)) = (𝐴𝐺(𝐵𝐺((inv‘𝐺)‘𝐶))))
9	7, 8	syldan 592	. 2 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺((inv‘𝐺)‘𝐶)) = (𝐴𝐺(𝐵𝐺((inv‘𝐺)‘𝐶))))
10		simpl 482	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐺 ∈ GrpOp)
11	3	grpocl 30571	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺𝐵) ∈ 𝑋)
12	11	3adant3r3 1186	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐺𝐵) ∈ 𝑋)
13		simpr3 1198	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐶 ∈ 𝑋)
14		grpdivf.3	. . . 4 ⊢ 𝐷 = ( /𝑔 ‘𝐺)
15	3, 4, 14	grpodivval 30606	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴𝐺𝐵) ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → ((𝐴𝐺𝐵)𝐷𝐶) = ((𝐴𝐺𝐵)𝐺((inv‘𝐺)‘𝐶)))
16	10, 12, 13, 15	syl3anc 1374	. 2 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐷𝐶) = ((𝐴𝐺𝐵)𝐺((inv‘𝐺)‘𝐶)))
17	3, 4, 14	grpodivval 30606	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵𝐷𝐶) = (𝐵𝐺((inv‘𝐺)‘𝐶)))
18	17	3adant3r1 1184	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝐷𝐶) = (𝐵𝐺((inv‘𝐺)‘𝐶)))
19	18	oveq2d 7383	. 2 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐺(𝐵𝐷𝐶)) = (𝐴𝐺(𝐵𝐺((inv‘𝐺)‘𝐶))))
20	9, 16, 19	3eqtr4d 2781	1 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐷𝐶) = (𝐴𝐺(𝐵𝐷𝐶)))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  ran crn 5632  ‘cfv 6498  (class class class)co 7367  GrpOpcgr 30560  invcgn 30562   /_𝑔 cgs 30563

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-1st 7942  df-2nd 7943  df-grpo 30564  df-gid 30565  df-ginv 30566  df-gdiv 30567

This theorem is referenced by:  ablomuldiv  30623  ablodivdiv  30624  ablo4pnp  38201