Theorem ablomuldiv 30623

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

Hypotheses

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

Assertion

Ref	Expression
ablomuldiv	⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐷𝐶) = ((𝐴𝐷𝐶)𝐺𝐵))

Proof of Theorem ablomuldiv

Step	Hyp	Ref	Expression
1		abldiv.1	. . . . 5 ⊢ 𝑋 = ran 𝐺
2	1	ablocom 30619	. . . 4 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺𝐵) = (𝐵𝐺𝐴))
3	2	3adant3r3 1186	. . 3 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐺𝐵) = (𝐵𝐺𝐴))
4	3	oveq1d 7382	. 2 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐷𝐶) = ((𝐵𝐺𝐴)𝐷𝐶))
5		3ancoma 1098	. . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) ↔ (𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋))
6		ablogrpo 30618	. . . 4 ⊢ (𝐺 ∈ AbelOp → 𝐺 ∈ GrpOp)
7		abldiv.3	. . . . 5 ⊢ 𝐷 = ( /𝑔 ‘𝐺)
8	1, 7	grpomuldivass 30612	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐵𝐺𝐴)𝐷𝐶) = (𝐵𝐺(𝐴𝐷𝐶)))
9	6, 8	sylan 581	. . 3 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐵𝐺𝐴)𝐷𝐶) = (𝐵𝐺(𝐴𝐷𝐶)))
10	5, 9	sylan2b 595	. 2 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐵𝐺𝐴)𝐷𝐶) = (𝐵𝐺(𝐴𝐷𝐶)))
11		simpr2 1197	. . . 4 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐵 ∈ 𝑋)
12	1, 7	grpodivcl 30610	. . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴𝐷𝐶) ∈ 𝑋)
13	6, 12	syl3an1 1164	. . . . 5 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴𝐷𝐶) ∈ 𝑋)
14	13	3adant3r2 1185	. . . 4 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐶) ∈ 𝑋)
15	11, 14	jca 511	. . 3 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵 ∈ 𝑋 ∧ (𝐴𝐷𝐶) ∈ 𝑋))
16	1	ablocom 30619	. . . 4 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐵 ∈ 𝑋 ∧ (𝐴𝐷𝐶) ∈ 𝑋) → (𝐵𝐺(𝐴𝐷𝐶)) = ((𝐴𝐷𝐶)𝐺𝐵))
17	16	3expb 1121	. . 3 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐵 ∈ 𝑋 ∧ (𝐴𝐷𝐶) ∈ 𝑋)) → (𝐵𝐺(𝐴𝐷𝐶)) = ((𝐴𝐷𝐶)𝐺𝐵))
18	15, 17	syldan 592	. 2 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝐺(𝐴𝐷𝐶)) = ((𝐴𝐷𝐶)𝐺𝐵))
19	4, 10, 18	3eqtrd 2775	1 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐷𝐶) = ((𝐴𝐷𝐶)𝐺𝐵))

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

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  df-ablo 30616

This theorem is referenced by:  ablodivdiv  30624  nvaddsub  30726  ablo4pnp  38201