Theorem ablonncan 31158

Description: Cancellation law for group division. (nncan 11587 analog.) (Contributed by NM, 7-Mar-2008.) (New usage is discouraged.)

Hypotheses

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

Assertion

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

Proof of Theorem ablonncan

Step	Hyp	Ref	Expression
1		id 23	. . . . 5 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋))
2	1	3anidm12 1446	. . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋))
3		abldiv.1	. . . . 5 ⊢ 𝑋 = ran 𝐺
4		abldiv.3	. . . . 5 ⊢ 𝐷 = ( /𝑔 ‘𝐺)
5	3, 4	ablodivdiv 31155	. . . 4 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐷(𝐴𝐷𝐵)) = ((𝐴𝐷𝐴)𝐺𝐵))
6	2, 5	sylan2 605	. . 3 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐷(𝐴𝐷𝐵)) = ((𝐴𝐷𝐴)𝐺𝐵))
7	6	3impb 1132	. 2 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷(𝐴𝐷𝐵)) = ((𝐴𝐷𝐴)𝐺𝐵))
8		ablogrpo 31149	. . . . 5 ⊢ (𝐺 ∈ AbelOp → 𝐺 ∈ GrpOp)
9		eqid 2760	. . . . . 6 ⊢ (GId‘𝐺) = (GId‘𝐺)
10	3, 4, 9	grpodivid 31144	. . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝐴𝐷𝐴) = (GId‘𝐺))
11	8, 10	sylan 592	. . . 4 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐴 ∈ 𝑋) → (𝐴𝐷𝐴) = (GId‘𝐺))
12	11	3adant3 1150	. . 3 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷𝐴) = (GId‘𝐺))
13	12	oveq1d 7435	. 2 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐴)𝐺𝐵) = ((GId‘𝐺)𝐺𝐵))
14	3, 9	grpolid 31118	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → ((GId‘𝐺)𝐺𝐵) = 𝐵)
15	8, 14	sylan 592	. . 3 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐵 ∈ 𝑋) → ((GId‘𝐺)𝐺𝐵) = 𝐵)
16	15	3adant2 1149	. 2 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((GId‘𝐺)𝐺𝐵) = 𝐵)
17	7, 13, 16	3eqtrd 2799	1 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷(𝐴𝐷𝐵)) = 𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ran crn 5651  ‘cfv 6538  (class class class)co 7420  GrpOpcgr 31091  GIdcgi 31092   /_𝑔 cgs 31094  AbelOpcablo 31146

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3899  df-un 3901  df-in 3903  df-ss 3914  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-grpo 31095  df-gid 31096  df-ginv 31097  df-gdiv 31098  df-ablo 31147

This theorem is used by:  ablonnncan1  31159