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

Theorem ablonnncan1 28326
 Description: Cancellation law for group division. (nnncan1 10914 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 1188 . . . 4 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → 𝐴𝑋)
2 simpr2 1189 . . . 4 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → 𝐵𝑋)
3 ablogrpo 28316 . . . . . 6 (𝐺 ∈ AbelOp → 𝐺 ∈ GrpOp)
4 abldiv.1 . . . . . . 7 𝑋 = ran 𝐺
5 abldiv.3 . . . . . . 7 𝐷 = ( /𝑔𝐺)
64, 5grpodivcl 28308 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝐴𝑋𝐶𝑋) → (𝐴𝐷𝐶) ∈ 𝑋)
73, 6syl3an1 1157 . . . . 5 ((𝐺 ∈ AbelOp ∧ 𝐴𝑋𝐶𝑋) → (𝐴𝐷𝐶) ∈ 𝑋)
873adant3r2 1177 . . . 4 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → (𝐴𝐷𝐶) ∈ 𝑋)
91, 2, 83jca 1122 . . 3 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → (𝐴𝑋𝐵𝑋 ∧ (𝐴𝐷𝐶) ∈ 𝑋))
104, 5ablodiv32 28324 . . 3 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋 ∧ (𝐴𝐷𝐶) ∈ 𝑋)) → ((𝐴𝐷𝐵)𝐷(𝐴𝐷𝐶)) = ((𝐴𝐷(𝐴𝐷𝐶))𝐷𝐵))
119, 10syldan 593 . 2 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → ((𝐴𝐷𝐵)𝐷(𝐴𝐷𝐶)) = ((𝐴𝐷(𝐴𝐷𝐶))𝐷𝐵))
124, 5ablonncan 28325 . . . 4 ((𝐺 ∈ AbelOp ∧ 𝐴𝑋𝐶𝑋) → (𝐴𝐷(𝐴𝐷𝐶)) = 𝐶)
13123adant3r2 1177 . . 3 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → (𝐴𝐷(𝐴𝐷𝐶)) = 𝐶)
1413oveq1d 7163 . 2 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → ((𝐴𝐷(𝐴𝐷𝐶))𝐷𝐵) = (𝐶𝐷𝐵))
1511, 14eqtrd 2854 1 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → ((𝐴𝐷𝐵)𝐷(𝐴𝐷𝐶)) = (𝐶𝐷𝐵))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 398   ∧ w3a 1081   = wceq 1530   ∈ wcel 2107  ran crn 5549  ‘cfv 6348  (class class class)co 7148  GrpOpcgr 28258   /𝑔 cgs 28261  AbelOpcablo 28313 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2791  ax-rep 5181  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7453 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ne 3015  df-ral 3141  df-rex 3142  df-reu 3143  df-rab 3145  df-v 3495  df-sbc 3771  df-csb 3882  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-nul 4290  df-if 4466  df-pw 4539  df-sn 4560  df-pr 4562  df-op 4566  df-uni 4831  df-iun 4912  df-br 5058  df-opab 5120  df-mpt 5138  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-riota 7106  df-ov 7151  df-oprab 7152  df-mpo 7153  df-1st 7681  df-2nd 7682  df-grpo 28262  df-gid 28263  df-ginv 28264  df-gdiv 28265  df-ablo 28314 This theorem is referenced by:  nvnnncan1  28416
 Copyright terms: Public domain W3C validator