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 35118
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 35117 . 2 (𝑅 ∈ DivRingOps ↔ (𝑅 ∈ RingOps ∧ (𝑈𝑍 ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = 𝑈)))
7 eldifi 4100 . . . . . 6 (𝑥 ∈ (𝑋 ∖ {𝑍}) → 𝑥𝑋)
8 difss 4105 . . . . . . . 8 (𝑋 ∖ {𝑍}) ⊆ 𝑋
9 ssrexv 4031 . . . . . . . 8 ((𝑋 ∖ {𝑍}) ⊆ 𝑋 → (∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = 𝑈 → ∃𝑦𝑋 (𝑦𝐻𝑥) = 𝑈))
108, 9ax-mp 5 . . . . . . 7 (∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = 𝑈 → ∃𝑦𝑋 (𝑦𝐻𝑥) = 𝑈)
11 neeq1 3075 . . . . . . . . . . . . . . . 16 ((𝑦𝐻𝑥) = 𝑈 → ((𝑦𝐻𝑥) ≠ 𝑍𝑈𝑍))
1211biimparc 480 . . . . . . . . . . . . . . 15 ((𝑈𝑍 ∧ (𝑦𝐻𝑥) = 𝑈) → (𝑦𝐻𝑥) ≠ 𝑍)
133, 4, 1, 2rngolz 35081 . . . . . . . . . . . . . . . . . 18 ((𝑅 ∈ RingOps ∧ 𝑥𝑋) → (𝑍𝐻𝑥) = 𝑍)
14 oveq1 7152 . . . . . . . . . . . . . . . . . . 19 (𝑦 = 𝑍 → (𝑦𝐻𝑥) = (𝑍𝐻𝑥))
1514eqeq1d 2820 . . . . . . . . . . . . . . . . . 18 (𝑦 = 𝑍 → ((𝑦𝐻𝑥) = 𝑍 ↔ (𝑍𝐻𝑥) = 𝑍))
1613, 15syl5ibrcom 248 . . . . . . . . . . . . . . . . 17 ((𝑅 ∈ RingOps ∧ 𝑥𝑋) → (𝑦 = 𝑍 → (𝑦𝐻𝑥) = 𝑍))
1716necon3d 3034 . . . . . . . . . . . . . . . 16 ((𝑅 ∈ RingOps ∧ 𝑥𝑋) → ((𝑦𝐻𝑥) ≠ 𝑍𝑦𝑍))
1817imp 407 . . . . . . . . . . . . . . 15 (((𝑅 ∈ RingOps ∧ 𝑥𝑋) ∧ (𝑦𝐻𝑥) ≠ 𝑍) → 𝑦𝑍)
1912, 18sylan2 592 . . . . . . . . . . . . . 14 (((𝑅 ∈ RingOps ∧ 𝑥𝑋) ∧ (𝑈𝑍 ∧ (𝑦𝐻𝑥) = 𝑈)) → 𝑦𝑍)
2019an4s 656 . . . . . . . . . . . . 13 (((𝑅 ∈ RingOps ∧ 𝑈𝑍) ∧ (𝑥𝑋 ∧ (𝑦𝐻𝑥) = 𝑈)) → 𝑦𝑍)
2120anassrs 468 . . . . . . . . . . . 12 ((((𝑅 ∈ RingOps ∧ 𝑈𝑍) ∧ 𝑥𝑋) ∧ (𝑦𝐻𝑥) = 𝑈) → 𝑦𝑍)
22 pm3.2 470 . . . . . . . . . . . 12 (𝑦𝑋 → (𝑦𝑍 → (𝑦𝑋𝑦𝑍)))
2321, 22syl5com 31 . . . . . . . . . . 11 ((((𝑅 ∈ RingOps ∧ 𝑈𝑍) ∧ 𝑥𝑋) ∧ (𝑦𝐻𝑥) = 𝑈) → (𝑦𝑋 → (𝑦𝑋𝑦𝑍)))
24 eldifsn 4711 . . . . . . . . . . 11 (𝑦 ∈ (𝑋 ∖ {𝑍}) ↔ (𝑦𝑋𝑦𝑍))
2523, 24syl6ibr 253 . . . . . . . . . 10 ((((𝑅 ∈ RingOps ∧ 𝑈𝑍) ∧ 𝑥𝑋) ∧ (𝑦𝐻𝑥) = 𝑈) → (𝑦𝑋𝑦 ∈ (𝑋 ∖ {𝑍})))
2625imdistanda 572 . . . . . . . . 9 (((𝑅 ∈ RingOps ∧ 𝑈𝑍) ∧ 𝑥𝑋) → (((𝑦𝐻𝑥) = 𝑈𝑦𝑋) → ((𝑦𝐻𝑥) = 𝑈𝑦 ∈ (𝑋 ∖ {𝑍}))))
27 ancom 461 . . . . . . . . 9 ((𝑦𝑋 ∧ (𝑦𝐻𝑥) = 𝑈) ↔ ((𝑦𝐻𝑥) = 𝑈𝑦𝑋))
28 ancom 461 . . . . . . . . 9 ((𝑦 ∈ (𝑋 ∖ {𝑍}) ∧ (𝑦𝐻𝑥) = 𝑈) ↔ ((𝑦𝐻𝑥) = 𝑈𝑦 ∈ (𝑋 ∖ {𝑍})))
2926, 27, 283imtr4g 297 . . . . . . . 8 (((𝑅 ∈ RingOps ∧ 𝑈𝑍) ∧ 𝑥𝑋) → ((𝑦𝑋 ∧ (𝑦𝐻𝑥) = 𝑈) → (𝑦 ∈ (𝑋 ∖ {𝑍}) ∧ (𝑦𝐻𝑥) = 𝑈)))
3029reximdv2 3268 . . . . . . 7 (((𝑅 ∈ RingOps ∧ 𝑈𝑍) ∧ 𝑥𝑋) → (∃𝑦𝑋 (𝑦𝐻𝑥) = 𝑈 → ∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = 𝑈))
3110, 30impbid2 227 . . . . . 6 (((𝑅 ∈ RingOps ∧ 𝑈𝑍) ∧ 𝑥𝑋) → (∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = 𝑈 ↔ ∃𝑦𝑋 (𝑦𝐻𝑥) = 𝑈))
327, 31sylan2 592 . . . . 5 (((𝑅 ∈ RingOps ∧ 𝑈𝑍) ∧ 𝑥 ∈ (𝑋 ∖ {𝑍})) → (∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = 𝑈 ↔ ∃𝑦𝑋 (𝑦𝐻𝑥) = 𝑈))
3332ralbidva 3193 . . . 4 ((𝑅 ∈ RingOps ∧ 𝑈𝑍) → (∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = 𝑈 ↔ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦𝑋 (𝑦𝐻𝑥) = 𝑈))
3433pm5.32da 579 . . 3 (𝑅 ∈ RingOps → ((𝑈𝑍 ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = 𝑈) ↔ (𝑈𝑍 ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦𝑋 (𝑦𝐻𝑥) = 𝑈)))
3534pm5.32i 575 . 2 ((𝑅 ∈ RingOps ∧ (𝑈𝑍 ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = 𝑈)) ↔ (𝑅 ∈ RingOps ∧ (𝑈𝑍 ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦𝑋 (𝑦𝐻𝑥) = 𝑈)))
366, 35bitri 276 1 (𝑅 ∈ DivRingOps ↔ (𝑅 ∈ RingOps ∧ (𝑈𝑍 ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦𝑋 (𝑦𝐻𝑥) = 𝑈)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1528  wcel 2105  wne 3013  wral 3135  wrex 3136  cdif 3930  wss 3933  {csn 4557  ran crn 5549  cfv 6348  (class class class)co 7145  1st c1st 7676  2nd c2nd 7677  GIdcgi 28194  RingOpscrngo 35053  DivRingOpscdrng 35107
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-rep 5181  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7450
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3or 1080  df-3an 1081  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2615  df-eu 2647  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ne 3014  df-ral 3140  df-rex 3141  df-reu 3142  df-rmo 3143  df-rab 3144  df-v 3494  df-sbc 3770  df-csb 3881  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-pss 3951  df-nul 4289  df-if 4464  df-pw 4537  df-sn 4558  df-pr 4560  df-tp 4562  df-op 4564  df-uni 4831  df-iun 4912  df-br 5058  df-opab 5120  df-mpt 5138  df-tr 5164  df-id 5453  df-eprel 5458  df-po 5467  df-so 5468  df-fr 5507  df-we 5509  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-ord 6187  df-on 6188  df-lim 6189  df-suc 6190  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 7103  df-ov 7148  df-om 7570  df-1st 7678  df-2nd 7679  df-1o 8091  df-er 8278  df-en 8498  df-dom 8499  df-sdom 8500  df-fin 8501  df-grpo 28197  df-gid 28198  df-ginv 28199  df-ablo 28249  df-ass 35002  df-exid 35004  df-mgmOLD 35008  df-sgrOLD 35020  df-mndo 35026  df-rngo 35054  df-drngo 35108
This theorem is referenced by:  isfldidl  35227
  Copyright terms: Public domain W3C validator