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

Theorem isdrngo3 36421
Description: A division ring is a ring in which 1 ≠ 0 and every nonzero element is invertible. (Contributed by Jeff Madsen, 10-Jun-2010.)
Hypotheses
Ref Expression
isdivrng1.1 𝐺 = (1st𝑅)
isdivrng1.2 𝐻 = (2nd𝑅)
isdivrng1.3 𝑍 = (GId‘𝐺)
isdivrng1.4 𝑋 = ran 𝐺
isdivrng2.5 𝑈 = (GId‘𝐻)
Assertion
Ref Expression
isdrngo3 (𝑅 ∈ DivRingOps ↔ (𝑅 ∈ RingOps ∧ (𝑈𝑍 ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦𝑋 (𝑦𝐻𝑥) = 𝑈)))
Distinct variable groups:   𝑥,𝐻,𝑦   𝑥,𝑋,𝑦   𝑥,𝑍,𝑦   𝑥,𝑅,𝑦   𝑥,𝑈,𝑦
Allowed substitution hints:   𝐺(𝑥,𝑦)

Proof of Theorem isdrngo3
StepHypRef Expression
1 isdivrng1.1 . . 3 𝐺 = (1st𝑅)
2 isdivrng1.2 . . 3 𝐻 = (2nd𝑅)
3 isdivrng1.3 . . 3 𝑍 = (GId‘𝐺)
4 isdivrng1.4 . . 3 𝑋 = ran 𝐺
5 isdivrng2.5 . . 3 𝑈 = (GId‘𝐻)
61, 2, 3, 4, 5isdrngo2 36420 . 2 (𝑅 ∈ DivRingOps ↔ (𝑅 ∈ RingOps ∧ (𝑈𝑍 ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = 𝑈)))
7 eldifi 4087 . . . . . 6 (𝑥 ∈ (𝑋 ∖ {𝑍}) → 𝑥𝑋)
8 difss 4092 . . . . . . . 8 (𝑋 ∖ {𝑍}) ⊆ 𝑋
9 ssrexv 4012 . . . . . . . 8 ((𝑋 ∖ {𝑍}) ⊆ 𝑋 → (∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = 𝑈 → ∃𝑦𝑋 (𝑦𝐻𝑥) = 𝑈))
108, 9ax-mp 5 . . . . . . 7 (∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = 𝑈 → ∃𝑦𝑋 (𝑦𝐻𝑥) = 𝑈)
11 neeq1 3007 . . . . . . . . . . . . . . . 16 ((𝑦𝐻𝑥) = 𝑈 → ((𝑦𝐻𝑥) ≠ 𝑍𝑈𝑍))
1211biimparc 481 . . . . . . . . . . . . . . 15 ((𝑈𝑍 ∧ (𝑦𝐻𝑥) = 𝑈) → (𝑦𝐻𝑥) ≠ 𝑍)
133, 4, 1, 2rngolz 36384 . . . . . . . . . . . . . . . . . 18 ((𝑅 ∈ RingOps ∧ 𝑥𝑋) → (𝑍𝐻𝑥) = 𝑍)
14 oveq1 7365 . . . . . . . . . . . . . . . . . . 19 (𝑦 = 𝑍 → (𝑦𝐻𝑥) = (𝑍𝐻𝑥))
1514eqeq1d 2739 . . . . . . . . . . . . . . . . . 18 (𝑦 = 𝑍 → ((𝑦𝐻𝑥) = 𝑍 ↔ (𝑍𝐻𝑥) = 𝑍))
1613, 15syl5ibrcom 247 . . . . . . . . . . . . . . . . 17 ((𝑅 ∈ RingOps ∧ 𝑥𝑋) → (𝑦 = 𝑍 → (𝑦𝐻𝑥) = 𝑍))
1716necon3d 2965 . . . . . . . . . . . . . . . 16 ((𝑅 ∈ RingOps ∧ 𝑥𝑋) → ((𝑦𝐻𝑥) ≠ 𝑍𝑦𝑍))
1817imp 408 . . . . . . . . . . . . . . 15 (((𝑅 ∈ RingOps ∧ 𝑥𝑋) ∧ (𝑦𝐻𝑥) ≠ 𝑍) → 𝑦𝑍)
1912, 18sylan2 594 . . . . . . . . . . . . . 14 (((𝑅 ∈ RingOps ∧ 𝑥𝑋) ∧ (𝑈𝑍 ∧ (𝑦𝐻𝑥) = 𝑈)) → 𝑦𝑍)
2019an4s 659 . . . . . . . . . . . . 13 (((𝑅 ∈ RingOps ∧ 𝑈𝑍) ∧ (𝑥𝑋 ∧ (𝑦𝐻𝑥) = 𝑈)) → 𝑦𝑍)
2120anassrs 469 . . . . . . . . . . . 12 ((((𝑅 ∈ RingOps ∧ 𝑈𝑍) ∧ 𝑥𝑋) ∧ (𝑦𝐻𝑥) = 𝑈) → 𝑦𝑍)
22 pm3.2 471 . . . . . . . . . . . 12 (𝑦𝑋 → (𝑦𝑍 → (𝑦𝑋𝑦𝑍)))
2321, 22syl5com 31 . . . . . . . . . . 11 ((((𝑅 ∈ RingOps ∧ 𝑈𝑍) ∧ 𝑥𝑋) ∧ (𝑦𝐻𝑥) = 𝑈) → (𝑦𝑋 → (𝑦𝑋𝑦𝑍)))
24 eldifsn 4748 . . . . . . . . . . 11 (𝑦 ∈ (𝑋 ∖ {𝑍}) ↔ (𝑦𝑋𝑦𝑍))
2523, 24syl6ibr 252 . . . . . . . . . 10 ((((𝑅 ∈ RingOps ∧ 𝑈𝑍) ∧ 𝑥𝑋) ∧ (𝑦𝐻𝑥) = 𝑈) → (𝑦𝑋𝑦 ∈ (𝑋 ∖ {𝑍})))
2625imdistanda 573 . . . . . . . . 9 (((𝑅 ∈ RingOps ∧ 𝑈𝑍) ∧ 𝑥𝑋) → (((𝑦𝐻𝑥) = 𝑈𝑦𝑋) → ((𝑦𝐻𝑥) = 𝑈𝑦 ∈ (𝑋 ∖ {𝑍}))))
27 ancom 462 . . . . . . . . 9 ((𝑦𝑋 ∧ (𝑦𝐻𝑥) = 𝑈) ↔ ((𝑦𝐻𝑥) = 𝑈𝑦𝑋))
28 ancom 462 . . . . . . . . 9 ((𝑦 ∈ (𝑋 ∖ {𝑍}) ∧ (𝑦𝐻𝑥) = 𝑈) ↔ ((𝑦𝐻𝑥) = 𝑈𝑦 ∈ (𝑋 ∖ {𝑍})))
2926, 27, 283imtr4g 296 . . . . . . . 8 (((𝑅 ∈ RingOps ∧ 𝑈𝑍) ∧ 𝑥𝑋) → ((𝑦𝑋 ∧ (𝑦𝐻𝑥) = 𝑈) → (𝑦 ∈ (𝑋 ∖ {𝑍}) ∧ (𝑦𝐻𝑥) = 𝑈)))
3029reximdv2 3162 . . . . . . 7 (((𝑅 ∈ RingOps ∧ 𝑈𝑍) ∧ 𝑥𝑋) → (∃𝑦𝑋 (𝑦𝐻𝑥) = 𝑈 → ∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = 𝑈))
3110, 30impbid2 225 . . . . . 6 (((𝑅 ∈ RingOps ∧ 𝑈𝑍) ∧ 𝑥𝑋) → (∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = 𝑈 ↔ ∃𝑦𝑋 (𝑦𝐻𝑥) = 𝑈))
327, 31sylan2 594 . . . . 5 (((𝑅 ∈ RingOps ∧ 𝑈𝑍) ∧ 𝑥 ∈ (𝑋 ∖ {𝑍})) → (∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = 𝑈 ↔ ∃𝑦𝑋 (𝑦𝐻𝑥) = 𝑈))
3332ralbidva 3173 . . . 4 ((𝑅 ∈ RingOps ∧ 𝑈𝑍) → (∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = 𝑈 ↔ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦𝑋 (𝑦𝐻𝑥) = 𝑈))
3433pm5.32da 580 . . 3 (𝑅 ∈ RingOps → ((𝑈𝑍 ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = 𝑈) ↔ (𝑈𝑍 ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦𝑋 (𝑦𝐻𝑥) = 𝑈)))
3534pm5.32i 576 . 2 ((𝑅 ∈ RingOps ∧ (𝑈𝑍 ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = 𝑈)) ↔ (𝑅 ∈ RingOps ∧ (𝑈𝑍 ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦𝑋 (𝑦𝐻𝑥) = 𝑈)))
366, 35bitri 275 1 (𝑅 ∈ DivRingOps ↔ (𝑅 ∈ RingOps ∧ (𝑈𝑍 ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦𝑋 (𝑦𝐻𝑥) = 𝑈)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 397   = wceq 1542  wcel 2107  wne 2944  wral 3065  wrex 3074  cdif 3908  wss 3911  {csn 4587  ran crn 5635  cfv 6497  (class class class)co 7358  1st c1st 7920  2nd c2nd 7921  GIdcgi 29435  RingOpscrngo 36356  DivRingOpscdrng 36410
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2708  ax-rep 5243  ax-sep 5257  ax-nul 5264  ax-pow 5321  ax-pr 5385  ax-un 7673
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2815  df-nfc 2890  df-ne 2945  df-ral 3066  df-rex 3075  df-rmo 3354  df-reu 3355  df-rab 3409  df-v 3448  df-sbc 3741  df-csb 3857  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4284  df-if 4488  df-pw 4563  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4867  df-iun 4957  df-br 5107  df-opab 5169  df-mpt 5190  df-id 5532  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-suc 6324  df-iota 6449  df-fun 6499  df-fn 6500  df-f 6501  df-f1 6502  df-fo 6503  df-f1o 6504  df-fv 6505  df-riota 7314  df-ov 7361  df-1st 7922  df-2nd 7923  df-1o 8413  df-en 8885  df-grpo 29438  df-gid 29439  df-ginv 29440  df-ablo 29490  df-ass 36305  df-exid 36307  df-mgmOLD 36311  df-sgrOLD 36323  df-mndo 36329  df-rngo 36357  df-drngo 36411
This theorem is referenced by:  isfldidl  36530
  Copyright terms: Public domain W3C validator