MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ablonncan Structured version   Visualization version   GIF version

Theorem ablonncan 30585
Description: Cancellation law for group division. (nncan 11536 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
StepHypRef Expression
1 id 22 . . . . 5 ((𝐴𝑋𝐴𝑋𝐵𝑋) → (𝐴𝑋𝐴𝑋𝐵𝑋))
213anidm12 1418 . . . 4 ((𝐴𝑋𝐵𝑋) → (𝐴𝑋𝐴𝑋𝐵𝑋))
3 abldiv.1 . . . . 5 𝑋 = ran 𝐺
4 abldiv.3 . . . . 5 𝐷 = ( /𝑔𝐺)
53, 4ablodivdiv 30582 . . . 4 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐴𝑋𝐵𝑋)) → (𝐴𝐷(𝐴𝐷𝐵)) = ((𝐴𝐷𝐴)𝐺𝐵))
62, 5sylan2 593 . . 3 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋)) → (𝐴𝐷(𝐴𝐷𝐵)) = ((𝐴𝐷𝐴)𝐺𝐵))
763impb 1114 . 2 ((𝐺 ∈ AbelOp ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐷(𝐴𝐷𝐵)) = ((𝐴𝐷𝐴)𝐺𝐵))
8 ablogrpo 30576 . . . . 5 (𝐺 ∈ AbelOp → 𝐺 ∈ GrpOp)
9 eqid 2735 . . . . . 6 (GId‘𝐺) = (GId‘𝐺)
103, 4, 9grpodivid 30571 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐴𝑋) → (𝐴𝐷𝐴) = (GId‘𝐺))
118, 10sylan 580 . . . 4 ((𝐺 ∈ AbelOp ∧ 𝐴𝑋) → (𝐴𝐷𝐴) = (GId‘𝐺))
12113adant3 1131 . . 3 ((𝐺 ∈ AbelOp ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐷𝐴) = (GId‘𝐺))
1312oveq1d 7446 . 2 ((𝐺 ∈ AbelOp ∧ 𝐴𝑋𝐵𝑋) → ((𝐴𝐷𝐴)𝐺𝐵) = ((GId‘𝐺)𝐺𝐵))
143, 9grpolid 30545 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐵𝑋) → ((GId‘𝐺)𝐺𝐵) = 𝐵)
158, 14sylan 580 . . 3 ((𝐺 ∈ AbelOp ∧ 𝐵𝑋) → ((GId‘𝐺)𝐺𝐵) = 𝐵)
16153adant2 1130 . 2 ((𝐺 ∈ AbelOp ∧ 𝐴𝑋𝐵𝑋) → ((GId‘𝐺)𝐺𝐵) = 𝐵)
177, 13, 163eqtrd 2779 1 ((𝐺 ∈ AbelOp ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐷(𝐴𝐷𝐵)) = 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1537  wcel 2106  ran crn 5690  cfv 6563  (class class class)co 7431  GrpOpcgr 30518  GIdcgi 30519   /𝑔 cgs 30521  AbelOpcablo 30573
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-1st 8013  df-2nd 8014  df-grpo 30522  df-gid 30523  df-ginv 30524  df-gdiv 30525  df-ablo 30574
This theorem is referenced by:  ablonnncan1  30586
  Copyright terms: Public domain W3C validator