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 32840
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 32819 . . . 4 (𝑅 ∈ Dmn → 𝑅 ∈ CRingOps)
2 dmncan.1 . . . . . . 7 𝐺 = (1st𝑅)
3 dmncan.2 . . . . . . 7 𝐻 = (2nd𝑅)
4 dmncan.3 . . . . . . 7 𝑋 = ran 𝐺
52, 3, 4crngocom 32764 . . . . . 6 ((𝑅 ∈ CRingOps ∧ 𝐴𝑋𝐶𝑋) → (𝐴𝐻𝐶) = (𝐶𝐻𝐴))
653adant3r2 1267 . . . . 5 ((𝑅 ∈ CRingOps ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → (𝐴𝐻𝐶) = (𝐶𝐻𝐴))
72, 3, 4crngocom 32764 . . . . . 6 ((𝑅 ∈ CRingOps ∧ 𝐵𝑋𝐶𝑋) → (𝐵𝐻𝐶) = (𝐶𝐻𝐵))
873adant3r1 1266 . . . . 5 ((𝑅 ∈ CRingOps ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → (𝐵𝐻𝐶) = (𝐶𝐻𝐵))
96, 8eqeq12d 2625 . . . 4 ((𝑅 ∈ CRingOps ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → ((𝐴𝐻𝐶) = (𝐵𝐻𝐶) ↔ (𝐶𝐻𝐴) = (𝐶𝐻𝐵)))
101, 9sylan 487 . . 3 ((𝑅 ∈ Dmn ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → ((𝐴𝐻𝐶) = (𝐵𝐻𝐶) ↔ (𝐶𝐻𝐴) = (𝐶𝐻𝐵)))
1110adantr 480 . 2 (((𝑅 ∈ Dmn ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) ∧ 𝐶𝑍) → ((𝐴𝐻𝐶) = (𝐵𝐻𝐶) ↔ (𝐶𝐻𝐴) = (𝐶𝐻𝐵)))
12 3anrot 1036 . . . 4 ((𝐶𝑋𝐴𝑋𝐵𝑋) ↔ (𝐴𝑋𝐵𝑋𝐶𝑋))
1312biimpri 217 . . 3 ((𝐴𝑋𝐵𝑋𝐶𝑋) → (𝐶𝑋𝐴𝑋𝐵𝑋))
14 dmncan.4 . . . 4 𝑍 = (GId‘𝐺)
152, 3, 4, 14dmncan1 32839 . . 3 (((𝑅 ∈ Dmn ∧ (𝐶𝑋𝐴𝑋𝐵𝑋)) ∧ 𝐶𝑍) → ((𝐶𝐻𝐴) = (𝐶𝐻𝐵) → 𝐴 = 𝐵))
1613, 15sylanl2 681 . 2 (((𝑅 ∈ Dmn ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) ∧ 𝐶𝑍) → ((𝐶𝐻𝐴) = (𝐶𝐻𝐵) → 𝐴 = 𝐵))
1711, 16sylbid 229 1 (((𝑅 ∈ Dmn ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) ∧ 𝐶𝑍) → ((𝐴𝐻𝐶) = (𝐵𝐻𝐶) → 𝐴 = 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383  w3a 1031   = wceq 1475  wcel 1977  wne 2780  ran crn 5029  cfv 5790  (class class class)co 6527  1st c1st 7035  2nd c2nd 7036  GIdcgi 26522  CRingOpsccring 32756  Dmncdmn 32810
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4694  ax-sep 4704  ax-nul 4712  ax-pow 4764  ax-pr 4828  ax-un 6825
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4368  df-int 4406  df-iun 4452  df-br 4579  df-opab 4639  df-mpt 4640  df-tr 4676  df-eprel 4939  df-id 4943  df-po 4949  df-so 4950  df-fr 4987  df-we 4989  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-ord 5629  df-on 5630  df-lim 5631  df-suc 5632  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-om 6936  df-1st 7037  df-2nd 7038  df-1o 7425  df-er 7607  df-en 7820  df-dom 7821  df-sdom 7822  df-fin 7823  df-grpo 26525  df-gid 26526  df-ginv 26527  df-gdiv 26528  df-ablo 26577  df-ass 32606  df-exid 32608  df-mgmOLD 32612  df-sgrOLD 32624  df-mndo 32630  df-rngo 32658  df-com2 32753  df-crngo 32757  df-idl 32773  df-pridl 32774  df-prrngo 32811  df-dmn 32812  df-igen 32823
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator