Theorem ablodivdiv4 30629

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

Hypotheses

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

Assertion

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

Proof of Theorem ablodivdiv4

Step	Hyp	Ref	Expression
1		ablogrpo 30622	. . 3 ⊢ (𝐺 ∈ AbelOp → 𝐺 ∈ GrpOp)
2		simpl 482	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐺 ∈ GrpOp)
3		abldiv.1	. . . . . 6 ⊢ 𝑋 = ran 𝐺
4		abldiv.3	. . . . . 6 ⊢ 𝐷 = ( /𝑔 ‘𝐺)
5	3, 4	grpodivcl 30614	. . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷𝐵) ∈ 𝑋)
6	5	3adant3r3 1185	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐵) ∈ 𝑋)
7		simpr3 1197	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐶 ∈ 𝑋)
8		eqid 2736	. . . . 5 ⊢ (inv‘𝐺) = (inv‘𝐺)
9	3, 8, 4	grpodivval 30610	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴𝐷𝐵) ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → ((𝐴𝐷𝐵)𝐷𝐶) = ((𝐴𝐷𝐵)𝐺((inv‘𝐺)‘𝐶)))
10	2, 6, 7, 9	syl3anc 1373	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐷𝐵)𝐷𝐶) = ((𝐴𝐷𝐵)𝐺((inv‘𝐺)‘𝐶)))
11	1, 10	sylan 580	. 2 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐷𝐵)𝐷𝐶) = ((𝐴𝐷𝐵)𝐺((inv‘𝐺)‘𝐶)))
12		simpr1 1195	. . . 4 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐴 ∈ 𝑋)
13		simpr2 1196	. . . 4 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐵 ∈ 𝑋)
14		simp3 1138	. . . . 5 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → 𝐶 ∈ 𝑋)
15	3, 8	grpoinvcl 30599	. . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐶 ∈ 𝑋) → ((inv‘𝐺)‘𝐶) ∈ 𝑋)
16	1, 14, 15	syl2an 596	. . . 4 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((inv‘𝐺)‘𝐶) ∈ 𝑋)
17	12, 13, 16	3jca 1128	. . 3 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ ((inv‘𝐺)‘𝐶) ∈ 𝑋))
18	3, 4	ablodivdiv 30628	. . 3 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ ((inv‘𝐺)‘𝐶) ∈ 𝑋)) → (𝐴𝐷(𝐵𝐷((inv‘𝐺)‘𝐶))) = ((𝐴𝐷𝐵)𝐺((inv‘𝐺)‘𝐶)))
19	17, 18	syldan 591	. 2 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷(𝐵𝐷((inv‘𝐺)‘𝐶))) = ((𝐴𝐷𝐵)𝐺((inv‘𝐺)‘𝐶)))
20	3, 8, 4	grpodivinv 30611	. . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵𝐷((inv‘𝐺)‘𝐶)) = (𝐵𝐺𝐶))
21	1, 20	syl3an1 1163	. . . 4 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵𝐷((inv‘𝐺)‘𝐶)) = (𝐵𝐺𝐶))
22	21	3adant3r1 1183	. . 3 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝐷((inv‘𝐺)‘𝐶)) = (𝐵𝐺𝐶))
23	22	oveq2d 7374	. 2 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷(𝐵𝐷((inv‘𝐺)‘𝐶))) = (𝐴𝐷(𝐵𝐺𝐶)))
24	11, 19, 23	3eqtr2d 2777	1 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐷𝐵)𝐷𝐶) = (𝐴𝐷(𝐵𝐺𝐶)))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  ran crn 5625  ‘cfv 6492  (class class class)co 7358  GrpOpcgr 30564  invcgn 30566   /_𝑔 cgs 30567  AbelOpcablo 30619

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  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 3061  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-1st 7933  df-2nd 7934  df-grpo 30568  df-gid 30569  df-ginv 30570  df-gdiv 30571  df-ablo 30620

This theorem is referenced by:  ablodiv32  30630  ablo4pnp  38081