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

Theorem ablonnncan1 26565
Description: Cancellation law for group division. (nnncan1 10168 analog.) (Contributed by NM, 7-Mar-2008.) (New usage is discouraged.)
Hypotheses
Ref Expression
abldiv.1 𝑋 = ran 𝐺
abldiv.3 𝐷 = ( /𝑔𝐺)
Assertion
Ref Expression
ablonnncan1 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → ((𝐴𝐷𝐵)𝐷(𝐴𝐷𝐶)) = (𝐶𝐷𝐵))

Proof of Theorem ablonnncan1
StepHypRef Expression
1 simpr1 1059 . . . 4 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → 𝐴𝑋)
2 simpr2 1060 . . . 4 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → 𝐵𝑋)
3 ablogrpo 26554 . . . . . 6 (𝐺 ∈ AbelOp → 𝐺 ∈ GrpOp)
4 abldiv.1 . . . . . . 7 𝑋 = ran 𝐺
5 abldiv.3 . . . . . . 7 𝐷 = ( /𝑔𝐺)
64, 5grpodivcl 26543 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝐴𝑋𝐶𝑋) → (𝐴𝐷𝐶) ∈ 𝑋)
73, 6syl3an1 1350 . . . . 5 ((𝐺 ∈ AbelOp ∧ 𝐴𝑋𝐶𝑋) → (𝐴𝐷𝐶) ∈ 𝑋)
873adant3r2 1266 . . . 4 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → (𝐴𝐷𝐶) ∈ 𝑋)
91, 2, 83jca 1234 . . 3 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → (𝐴𝑋𝐵𝑋 ∧ (𝐴𝐷𝐶) ∈ 𝑋))
104, 5ablodiv32 26562 . . 3 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋 ∧ (𝐴𝐷𝐶) ∈ 𝑋)) → ((𝐴𝐷𝐵)𝐷(𝐴𝐷𝐶)) = ((𝐴𝐷(𝐴𝐷𝐶))𝐷𝐵))
119, 10syldan 485 . 2 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → ((𝐴𝐷𝐵)𝐷(𝐴𝐷𝐶)) = ((𝐴𝐷(𝐴𝐷𝐶))𝐷𝐵))
124, 5ablonncan 26564 . . . 4 ((𝐺 ∈ AbelOp ∧ 𝐴𝑋𝐶𝑋) → (𝐴𝐷(𝐴𝐷𝐶)) = 𝐶)
13123adant3r2 1266 . . 3 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → (𝐴𝐷(𝐴𝐷𝐶)) = 𝐶)
1413oveq1d 6542 . 2 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → ((𝐴𝐷(𝐴𝐷𝐶))𝐷𝐵) = (𝐶𝐷𝐵))
1511, 14eqtrd 2643 1 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → ((𝐴𝐷𝐵)𝐷(𝐴𝐷𝐶)) = (𝐶𝐷𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 382  w3a 1030   = wceq 1474  wcel 1976  ran crn 5029  cfv 5790  (class class class)co 6527  GrpOpcgr 26493   /𝑔 cgs 26496  AbelOpcablo 26551
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1712  ax-4 1727  ax-5 1826  ax-6 1874  ax-7 1921  ax-8 1978  ax-9 1985  ax-10 2005  ax-11 2020  ax-12 2033  ax-13 2233  ax-ext 2589  ax-rep 4693  ax-sep 4703  ax-nul 4712  ax-pow 4764  ax-pr 4828  ax-un 6824
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-3an 1032  df-tru 1477  df-ex 1695  df-nf 1700  df-sb 1867  df-eu 2461  df-mo 2462  df-clab 2596  df-cleq 2602  df-clel 2605  df-nfc 2739  df-ne 2781  df-ral 2900  df-rex 2901  df-reu 2902  df-rab 2904  df-v 3174  df-sbc 3402  df-csb 3499  df-dif 3542  df-un 3544  df-in 3546  df-ss 3553  df-nul 3874  df-if 4036  df-pw 4109  df-sn 4125  df-pr 4127  df-op 4131  df-uni 4367  df-iun 4451  df-br 4578  df-opab 4638  df-mpt 4639  df-id 4943  df-xp 5034  df-rel 5035  df-cnv 5036  df-co 5037  df-dm 5038  df-rn 5039  df-res 5040  df-ima 5041  df-iota 5754  df-fun 5792  df-fn 5793  df-f 5794  df-f1 5795  df-fo 5796  df-f1o 5797  df-fv 5798  df-riota 6489  df-ov 6530  df-oprab 6531  df-mpt2 6532  df-1st 7036  df-2nd 7037  df-grpo 26497  df-gid 26498  df-ginv 26499  df-gdiv 26500  df-ablo 26552
This theorem is referenced by:  nvnnncan1  26673
  Copyright terms: Public domain W3C validator