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

Theorem ablonnncan1 29805
Description: Cancellation law for group division. (nnncan1 11495 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 1194 . . . 4 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → 𝐴𝑋)
2 simpr2 1195 . . . 4 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → 𝐵𝑋)
3 ablogrpo 29795 . . . . . 6 (𝐺 ∈ AbelOp → 𝐺 ∈ GrpOp)
4 abldiv.1 . . . . . . 7 𝑋 = ran 𝐺
5 abldiv.3 . . . . . . 7 𝐷 = ( /𝑔𝐺)
64, 5grpodivcl 29787 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝐴𝑋𝐶𝑋) → (𝐴𝐷𝐶) ∈ 𝑋)
73, 6syl3an1 1163 . . . . 5 ((𝐺 ∈ AbelOp ∧ 𝐴𝑋𝐶𝑋) → (𝐴𝐷𝐶) ∈ 𝑋)
873adant3r2 1183 . . . 4 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → (𝐴𝐷𝐶) ∈ 𝑋)
91, 2, 83jca 1128 . . 3 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → (𝐴𝑋𝐵𝑋 ∧ (𝐴𝐷𝐶) ∈ 𝑋))
104, 5ablodiv32 29803 . . 3 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋 ∧ (𝐴𝐷𝐶) ∈ 𝑋)) → ((𝐴𝐷𝐵)𝐷(𝐴𝐷𝐶)) = ((𝐴𝐷(𝐴𝐷𝐶))𝐷𝐵))
119, 10syldan 591 . 2 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → ((𝐴𝐷𝐵)𝐷(𝐴𝐷𝐶)) = ((𝐴𝐷(𝐴𝐷𝐶))𝐷𝐵))
124, 5ablonncan 29804 . . . 4 ((𝐺 ∈ AbelOp ∧ 𝐴𝑋𝐶𝑋) → (𝐴𝐷(𝐴𝐷𝐶)) = 𝐶)
13123adant3r2 1183 . . 3 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → (𝐴𝐷(𝐴𝐷𝐶)) = 𝐶)
1413oveq1d 7423 . 2 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → ((𝐴𝐷(𝐴𝐷𝐶))𝐷𝐵) = (𝐶𝐷𝐵))
1511, 14eqtrd 2772 1 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → ((𝐴𝐷𝐵)𝐷(𝐴𝐷𝐶)) = (𝐶𝐷𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1087   = wceq 1541  wcel 2106  ran crn 5677  cfv 6543  (class class class)co 7408  GrpOpcgr 29737   /𝑔 cgs 29740  AbelOpcablo 29792
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7724
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7364  df-ov 7411  df-oprab 7412  df-mpo 7413  df-1st 7974  df-2nd 7975  df-grpo 29741  df-gid 29742  df-ginv 29743  df-gdiv 29744  df-ablo 29793
This theorem is referenced by:  nvnnncan1  29895
  Copyright terms: Public domain W3C validator