Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  drnglring Structured version   Visualization version   GIF version

Theorem drnglring 34129
Description: A division ring is a local ring. (Contributed by Thierry Arnoux, 2-Jun-2026.)
Hypothesis
Ref Expression
drnglring.1 (𝜑 → 𝐹 ∈ DivRing)
Assertion
Ref Expression
drnglring (𝜑 → 𝐹 ∈ LRing)

Proof of Theorem drnglring
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 drnglring.1 . . 3 (𝜑 → 𝐹 ∈ DivRing)
2 drngnzr 21055 . . 3 (𝐹 ∈ DivRing → 𝐹 ∈ NzRing)
31, 2syl 18 . 2 (𝜑 → 𝐹 ∈ NzRing)
41ad4antr 745 . . . . . . 7 (((((𝜑 ∧ 𝑥 ∈ (Base‘𝐹)) ∧ 𝑦 ∈ (Base‘𝐹)) ∧ (𝑥(+g‘𝐹)𝑦) = (1r‘𝐹)) ∧ ¬ 𝑥 = (0g‘𝐹)) → 𝐹 ∈ DivRing)
5 simp-4r 796 . . . . . . 7 (((((𝜑 ∧ 𝑥 ∈ (Base‘𝐹)) ∧ 𝑦 ∈ (Base‘𝐹)) ∧ (𝑥(+g‘𝐹)𝑦) = (1r‘𝐹)) ∧ ¬ 𝑥 = (0g‘𝐹)) → 𝑥 ∈ (Base‘𝐹))
6 neqne 2970 . . . . . . . 8 (¬ 𝑥 = (0g‘𝐹) → 𝑥 ≠ (0g‘𝐹))
76adantl 487 . . . . . . 7 (((((𝜑 ∧ 𝑥 ∈ (Base‘𝐹)) ∧ 𝑦 ∈ (Base‘𝐹)) ∧ (𝑥(+g‘𝐹)𝑦) = (1r‘𝐹)) ∧ ¬ 𝑥 = (0g‘𝐹)) → 𝑥 ≠ (0g‘𝐹))
8 eqid 2766 . . . . . . . . 9 (Base‘𝐹) = (Base‘𝐹)
9 eqid 2766 . . . . . . . . 9 (Unit‘𝐹) = (Unit‘𝐹)
10 eqid 2766 . . . . . . . . 9 (0g‘𝐹) = (0g‘𝐹)
118, 9, 10drngunit 21038 . . . . . . . 8 (𝐹 ∈ DivRing → (𝑥 ∈ (Unit‘𝐹) ↔ (𝑥 ∈ (Base‘𝐹) ∧ 𝑥 ≠ (0g‘𝐹))))
1211biimpar 483 . . . . . . 7 ((𝐹 ∈ DivRing ∧ (𝑥 ∈ (Base‘𝐹) ∧ 𝑥 ≠ (0g‘𝐹))) → 𝑥 ∈ (Unit‘𝐹))
134, 5, 7, 12syl12anc 850 . . . . . 6 (((((𝜑 ∧ 𝑥 ∈ (Base‘𝐹)) ∧ 𝑦 ∈ (Base‘𝐹)) ∧ (𝑥(+g‘𝐹)𝑦) = (1r‘𝐹)) ∧ ¬ 𝑥 = (0g‘𝐹)) → 𝑥 ∈ (Unit‘𝐹))
141ad4antr 745 . . . . . . 7 (((((𝜑 ∧ 𝑥 ∈ (Base‘𝐹)) ∧ 𝑦 ∈ (Base‘𝐹)) ∧ (𝑥(+g‘𝐹)𝑦) = (1r‘𝐹)) ∧ ¬ 𝑦 = (0g‘𝐹)) → 𝐹 ∈ DivRing)
15 simpllr 788 . . . . . . 7 (((((𝜑 ∧ 𝑥 ∈ (Base‘𝐹)) ∧ 𝑦 ∈ (Base‘𝐹)) ∧ (𝑥(+g‘𝐹)𝑦) = (1r‘𝐹)) ∧ ¬ 𝑦 = (0g‘𝐹)) → 𝑦 ∈ (Base‘𝐹))
16 neqne 2970 . . . . . . . 8 (¬ 𝑦 = (0g‘𝐹) → 𝑦 ≠ (0g‘𝐹))
1716adantl 487 . . . . . . 7 (((((𝜑 ∧ 𝑥 ∈ (Base‘𝐹)) ∧ 𝑦 ∈ (Base‘𝐹)) ∧ (𝑥(+g‘𝐹)𝑦) = (1r‘𝐹)) ∧ ¬ 𝑦 = (0g‘𝐹)) → 𝑦 ≠ (0g‘𝐹))
188, 9, 10drngunit 21038 . . . . . . . 8 (𝐹 ∈ DivRing → (𝑦 ∈ (Unit‘𝐹) ↔ (𝑦 ∈ (Base‘𝐹) ∧ 𝑦 ≠ (0g‘𝐹))))
1918biimpar 483 . . . . . . 7 ((𝐹 ∈ DivRing ∧ (𝑦 ∈ (Base‘𝐹) ∧ 𝑦 ≠ (0g‘𝐹))) → 𝑦 ∈ (Unit‘𝐹))
2014, 15, 17, 19syl12anc 850 . . . . . 6 (((((𝜑 ∧ 𝑥 ∈ (Base‘𝐹)) ∧ 𝑦 ∈ (Base‘𝐹)) ∧ (𝑥(+g‘𝐹)𝑦) = (1r‘𝐹)) ∧ ¬ 𝑦 = (0g‘𝐹)) → 𝑦 ∈ (Unit‘𝐹))
21 simplll 787 . . . . . . . 8 ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐹)) ∧ 𝑦 ∈ (Base‘𝐹)) ∧ (𝑥(+g‘𝐹)𝑦) = (1r‘𝐹)) → 𝜑)
22 simpr 490 . . . . . . . . . 10 ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐹)) ∧ 𝑦 ∈ (Base‘𝐹)) ∧ (𝑥(+g‘𝐹)𝑦) = (1r‘𝐹)) → (𝑥(+g‘𝐹)𝑦) = (1r‘𝐹))
23 eqid 2766 . . . . . . . . . . . . 13 (1r‘𝐹) = (1r‘𝐹)
2423, 10nzrnz 20818 . . . . . . . . . . . 12 (𝐹 ∈ NzRing → (1r‘𝐹) ≠ (0g‘𝐹))
253, 24syl 18 . . . . . . . . . . 11 (𝜑 → (1r‘𝐹) ≠ (0g‘𝐹))
2625ad3antrrr 743 . . . . . . . . . 10 ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐹)) ∧ 𝑦 ∈ (Base‘𝐹)) ∧ (𝑥(+g‘𝐹)𝑦) = (1r‘𝐹)) → (1r‘𝐹) ≠ (0g‘𝐹))
2722, 26eqnetrd 3029 . . . . . . . . 9 ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐹)) ∧ 𝑦 ∈ (Base‘𝐹)) ∧ (𝑥(+g‘𝐹)𝑦) = (1r‘𝐹)) → (𝑥(+g‘𝐹)𝑦) ≠ (0g‘𝐹))
2827neneqd 2967 . . . . . . . 8 ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐹)) ∧ 𝑦 ∈ (Base‘𝐹)) ∧ (𝑥(+g‘𝐹)𝑦) = (1r‘𝐹)) → ¬ (𝑥(+g‘𝐹)𝑦) = (0g‘𝐹))
29 oveq12 7459 . . . . . . . . . . 11 ((𝑥 = (0g‘𝐹) ∧ 𝑦 = (0g‘𝐹)) → (𝑥(+g‘𝐹)𝑦) = ((0g‘𝐹)(+g‘𝐹)(0g‘𝐹)))
3029adantl 487 . . . . . . . . . 10 ((𝜑 ∧ (𝑥 = (0g‘𝐹) ∧ 𝑦 = (0g‘𝐹))) → (𝑥(+g‘𝐹)𝑦) = ((0g‘𝐹)(+g‘𝐹)(0g‘𝐹)))
31 eqid 2766 . . . . . . . . . . 11 (+g‘𝐹) = (+g‘𝐹)
321drnggrpd 21042 . . . . . . . . . . . 12 (𝜑 → 𝐹 ∈ Grp)
3332adantr 486 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥 = (0g‘𝐹) ∧ 𝑦 = (0g‘𝐹))) → 𝐹 ∈ Grp)
348, 10, 33grpidcld 33700 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥 = (0g‘𝐹) ∧ 𝑦 = (0g‘𝐹))) → (0g‘𝐹) ∈ (Base‘𝐹))
358, 31, 10, 33, 34grplidd 19232 . . . . . . . . . 10 ((𝜑 ∧ (𝑥 = (0g‘𝐹) ∧ 𝑦 = (0g‘𝐹))) → ((0g‘𝐹)(+g‘𝐹)(0g‘𝐹)) = (0g‘𝐹))
3630, 35eqtrd 2801 . . . . . . . . 9 ((𝜑 ∧ (𝑥 = (0g‘𝐹) ∧ 𝑦 = (0g‘𝐹))) → (𝑥(+g‘𝐹)𝑦) = (0g‘𝐹))
3736stoic1a 1807 . . . . . . . 8 ((𝜑 ∧ ¬ (𝑥(+g‘𝐹)𝑦) = (0g‘𝐹)) → ¬ (𝑥 = (0g‘𝐹) ∧ 𝑦 = (0g‘𝐹)))
3821, 28, 37syl2anc 596 . . . . . . 7 ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐹)) ∧ 𝑦 ∈ (Base‘𝐹)) ∧ (𝑥(+g‘𝐹)𝑦) = (1r‘𝐹)) → ¬ (𝑥 = (0g‘𝐹) ∧ 𝑦 = (0g‘𝐹)))
39 ianor 998 . . . . . . 7 (¬ (𝑥 = (0g‘𝐹) ∧ 𝑦 = (0g‘𝐹)) ↔ (¬ 𝑥 = (0g‘𝐹) ∨ ¬ 𝑦 = (0g‘𝐹)))
4038, 39sylib 221 . . . . . 6 ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐹)) ∧ 𝑦 ∈ (Base‘𝐹)) ∧ (𝑥(+g‘𝐹)𝑦) = (1r‘𝐹)) → (¬ 𝑥 = (0g‘𝐹) ∨ ¬ 𝑦 = (0g‘𝐹)))
4113, 20, 40orim12da 981 . . . . 5 ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐹)) ∧ 𝑦 ∈ (Base‘𝐹)) ∧ (𝑥(+g‘𝐹)𝑦) = (1r‘𝐹)) → (𝑥 ∈ (Unit‘𝐹) ∨ 𝑦 ∈ (Unit‘𝐹)))
4241ex 418 . . . 4 (((𝜑 ∧ 𝑥 ∈ (Base‘𝐹)) ∧ 𝑦 ∈ (Base‘𝐹)) → ((𝑥(+g‘𝐹)𝑦) = (1r‘𝐹) → (𝑥 ∈ (Unit‘𝐹) ∨ 𝑦 ∈ (Unit‘𝐹))))
4342anasss 472 . . 3 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐹) ∧ 𝑦 ∈ (Base‘𝐹))) → ((𝑥(+g‘𝐹)𝑦) = (1r‘𝐹) → (𝑥 ∈ (Unit‘𝐹) ∨ 𝑦 ∈ (Unit‘𝐹))))
4443ralrimivva 3212 . 2 (𝜑 → ∀𝑥 ∈ (Base‘𝐹)∀𝑦 ∈ (Base‘𝐹)((𝑥(+g‘𝐹)𝑦) = (1r‘𝐹) → (𝑥 ∈ (Unit‘𝐹) ∨ 𝑦 ∈ (Unit‘𝐹))))
458, 31, 23, 9islring 20845 . 2 (𝐹 ∈ LRing ↔ (𝐹 ∈ NzRing ∧ ∀𝑥 ∈ (Base‘𝐹)∀𝑦 ∈ (Base‘𝐹)((𝑥(+g‘𝐹)𝑦) = (1r‘𝐹) → (𝑥 ∈ (Unit‘𝐹) ∨ 𝑦 ∈ (Unit‘𝐹)))))
463, 44, 45sylanbrc 595 1 (𝜑 → 𝐹 ∈ LRing)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∨ wo 861   = wceq 1572   ∈ wcel 2150   ≠ wne 2962  ∀wral 3083  ‘cfv 6565  (class class class)co 7450  Basecbs 17433  +gcplusg 17474  0gc0g 17662  Grpcgrp 19196  1rcur 20460  Unitcui 20638  NzRingcnzr 20815  LRingclring 20843  DivRingcdr 21033
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-cnex 11294  ax-resscn 11295  ax-1cn 11296  ax-icn 11297  ax-addcl 11298  ax-addrcl 11299  ax-mulcl 11300  ax-mulrcl 11301  ax-mulcom 11302  ax-addass 11303  ax-mulass 11304  ax-distr 11305  ax-i2m1 11306  ax-1ne0 11307  ax-1rid 11308  ax-rnegex 11309  ax-rrecex 11310  ax-cnre 11311  ax-pre-lttri 11312  ax-pre-lttrn 11313  ax-pre-ltadd 11314  ax-pre-mulgt0 11315
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-nel 3069  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-2nd 8035  df-tpos 8280  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-er 8754  df-en 9011  df-dom 9012  df-sdom 9013  df-pnf 11383  df-mnf 11384  df-xr 11385  df-ltxr 11386  df-le 11387  df-sub 11581  df-neg 11582  df-nn 12375  df-2 12444  df-3 12445  df-sets 17388  df-slot 17406  df-ndx 17418  df-base 17434  df-plusg 17488  df-mulr 17489  df-0g 17664  df-mgm 18868  df-sgrp 18960  df-mnd 18976  df-grp 19199  df-minusg 19200  df-cmn 20049  df-abl 20050  df-mgp 20414  df-rng 20428  df-ur 20461  df-ring 20514  df-oppr 20620  df-dvdsr 20640  df-unit 20641  df-nzr 20816  df-lring 20844  df-drng 21035
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator