Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dmncan2 Structured version   Visualization version   GIF version

Theorem dmncan2 38084
Description: Cancellation law for domains. (Contributed by Jeff Madsen, 6-Jan-2011.)
Hypotheses
Ref Expression
dmncan.1 𝐺 = (1st𝑅)
dmncan.2 𝐻 = (2nd𝑅)
dmncan.3 𝑋 = ran 𝐺
dmncan.4 𝑍 = (GId‘𝐺)
Assertion
Ref Expression
dmncan2 (((𝑅 ∈ Dmn ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) ∧ 𝐶𝑍) → ((𝐴𝐻𝐶) = (𝐵𝐻𝐶) → 𝐴 = 𝐵))

Proof of Theorem dmncan2
StepHypRef Expression
1 dmncrng 38063 . . . 4 (𝑅 ∈ Dmn → 𝑅 ∈ CRingOps)
2 dmncan.1 . . . . . . 7 𝐺 = (1st𝑅)
3 dmncan.2 . . . . . . 7 𝐻 = (2nd𝑅)
4 dmncan.3 . . . . . . 7 𝑋 = ran 𝐺
52, 3, 4crngocom 38008 . . . . . 6 ((𝑅 ∈ CRingOps ∧ 𝐴𝑋𝐶𝑋) → (𝐴𝐻𝐶) = (𝐶𝐻𝐴))
653adant3r2 1184 . . . . 5 ((𝑅 ∈ CRingOps ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → (𝐴𝐻𝐶) = (𝐶𝐻𝐴))
72, 3, 4crngocom 38008 . . . . . 6 ((𝑅 ∈ CRingOps ∧ 𝐵𝑋𝐶𝑋) → (𝐵𝐻𝐶) = (𝐶𝐻𝐵))
873adant3r1 1183 . . . . 5 ((𝑅 ∈ CRingOps ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → (𝐵𝐻𝐶) = (𝐶𝐻𝐵))
96, 8eqeq12d 2753 . . . 4 ((𝑅 ∈ CRingOps ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → ((𝐴𝐻𝐶) = (𝐵𝐻𝐶) ↔ (𝐶𝐻𝐴) = (𝐶𝐻𝐵)))
101, 9sylan 580 . . 3 ((𝑅 ∈ Dmn ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → ((𝐴𝐻𝐶) = (𝐵𝐻𝐶) ↔ (𝐶𝐻𝐴) = (𝐶𝐻𝐵)))
1110adantr 480 . 2 (((𝑅 ∈ Dmn ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) ∧ 𝐶𝑍) → ((𝐴𝐻𝐶) = (𝐵𝐻𝐶) ↔ (𝐶𝐻𝐴) = (𝐶𝐻𝐵)))
12 3anrot 1100 . . . 4 ((𝐶𝑋𝐴𝑋𝐵𝑋) ↔ (𝐴𝑋𝐵𝑋𝐶𝑋))
1312biimpri 228 . . 3 ((𝐴𝑋𝐵𝑋𝐶𝑋) → (𝐶𝑋𝐴𝑋𝐵𝑋))
14 dmncan.4 . . . 4 𝑍 = (GId‘𝐺)
152, 3, 4, 14dmncan1 38083 . . 3 (((𝑅 ∈ Dmn ∧ (𝐶𝑋𝐴𝑋𝐵𝑋)) ∧ 𝐶𝑍) → ((𝐶𝐻𝐴) = (𝐶𝐻𝐵) → 𝐴 = 𝐵))
1613, 15sylanl2 681 . 2 (((𝑅 ∈ Dmn ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) ∧ 𝐶𝑍) → ((𝐶𝐻𝐴) = (𝐶𝐻𝐵) → 𝐴 = 𝐵))
1711, 16sylbid 240 1 (((𝑅 ∈ Dmn ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) ∧ 𝐶𝑍) → ((𝐴𝐻𝐶) = (𝐵𝐻𝐶) → 𝐴 = 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1540  wcel 2108  wne 2940  ran crn 5686  cfv 6561  (class class class)co 7431  1st c1st 8012  2nd c2nd 8013  GIdcgi 30509  CRingOpsccring 38000  Dmncdmn 38054
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rmo 3380  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-int 4947  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-1st 8014  df-2nd 8015  df-1o 8506  df-en 8986  df-grpo 30512  df-gid 30513  df-ginv 30514  df-gdiv 30515  df-ablo 30564  df-ass 37850  df-exid 37852  df-mgmOLD 37856  df-sgrOLD 37868  df-mndo 37874  df-rngo 37902  df-com2 37997  df-crngo 38001  df-idl 38017  df-pridl 38018  df-prrngo 38055  df-dmn 38056  df-igen 38067
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator