MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  islring Structured version   Visualization version   GIF version

Theorem islring 20798
Description: The predicate "is a local ring". (Contributed by SN, 23-Feb-2025.)
Hypotheses
Ref Expression
islring.b 𝐵 = (Base‘𝑅)
islring.a + = (+g‘𝑅)
islring.1 1 = (1r‘𝑅)
islring.u 𝑈 = (Unit‘𝑅)
Assertion
Ref Expression
islring (𝑅 ∈ LRing ↔ (𝑅 ∈ NzRing ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) = 1 → (𝑥 ∈ 𝑈 ∨ 𝑦 ∈ 𝑈))))
Distinct variable group:   𝑥,𝑅,𝑦
Allowed substitution hints:   𝐵(𝑥, 𝑦)   + (𝑥, 𝑦)   𝑈(𝑥, 𝑦)   1 (𝑥, 𝑦)

Proof of Theorem islring
Dummy variable 𝑟 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6886 . . . 4 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
2 islring.b . . . 4 𝐵 = (Base‘𝑅)
31, 2eqtr4di 2813 . . 3 (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
4 fveq2 6886 . . . . . . . 8 (𝑟 = 𝑅 → (+g‘𝑟) = (+g‘𝑅))
5 islring.a . . . . . . . 8 + = (+g‘𝑅)
64, 5eqtr4di 2813 . . . . . . 7 (𝑟 = 𝑅 → (+g‘𝑟) = + )
76oveqd 7438 . . . . . 6 (𝑟 = 𝑅 → (𝑥(+g‘𝑟)𝑦) = (𝑥 + 𝑦))
8 fveq2 6886 . . . . . . 7 (𝑟 = 𝑅 → (1r‘𝑟) = (1r‘𝑅))
9 islring.1 . . . . . . 7 1 = (1r‘𝑅)
108, 9eqtr4di 2813 . . . . . 6 (𝑟 = 𝑅 → (1r‘𝑟) = 1 )
117, 10eqeq12d 2776 . . . . 5 (𝑟 = 𝑅 → ((𝑥(+g‘𝑟)𝑦) = (1r‘𝑟) ↔ (𝑥 + 𝑦) = 1 ))
12 fveq2 6886 . . . . . . . 8 (𝑟 = 𝑅 → (Unit‘𝑟) = (Unit‘𝑅))
13 islring.u . . . . . . . 8 𝑈 = (Unit‘𝑅)
1412, 13eqtr4di 2813 . . . . . . 7 (𝑟 = 𝑅 → (Unit‘𝑟) = 𝑈)
1514eleq2d 2846 . . . . . 6 (𝑟 = 𝑅 → (𝑥 ∈ (Unit‘𝑟) ↔ 𝑥 ∈ 𝑈))
1614eleq2d 2846 . . . . . 6 (𝑟 = 𝑅 → (𝑦 ∈ (Unit‘𝑟) ↔ 𝑦 ∈ 𝑈))
1715, 16orbi12d 932 . . . . 5 (𝑟 = 𝑅 → ((𝑥 ∈ (Unit‘𝑟) ∨ 𝑦 ∈ (Unit‘𝑟)) ↔ (𝑥 ∈ 𝑈 ∨ 𝑦 ∈ 𝑈)))
1811, 17imbi12d 347 . . . 4 (𝑟 = 𝑅 → (((𝑥(+g‘𝑟)𝑦) = (1r‘𝑟) → (𝑥 ∈ (Unit‘𝑟) ∨ 𝑦 ∈ (Unit‘𝑟))) ↔ ((𝑥 + 𝑦) = 1 → (𝑥 ∈ 𝑈 ∨ 𝑦 ∈ 𝑈))))
193, 18raleqbidv 3334 . . 3 (𝑟 = 𝑅 → (∀𝑦 ∈ (Base‘𝑟)((𝑥(+g‘𝑟)𝑦) = (1r‘𝑟) → (𝑥 ∈ (Unit‘𝑟) ∨ 𝑦 ∈ (Unit‘𝑟))) ↔ ∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) = 1 → (𝑥 ∈ 𝑈 ∨ 𝑦 ∈ 𝑈))))
203, 19raleqbidv 3334 . 2 (𝑟 = 𝑅 → (∀𝑥 ∈ (Base‘𝑟)∀𝑦 ∈ (Base‘𝑟)((𝑥(+g‘𝑟)𝑦) = (1r‘𝑟) → (𝑥 ∈ (Unit‘𝑟) ∨ 𝑦 ∈ (Unit‘𝑟))) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) = 1 → (𝑥 ∈ 𝑈 ∨ 𝑦 ∈ 𝑈))))
21 df-lring 20797 . 2 LRing = {𝑟 ∈ NzRing ∣ ∀𝑥 ∈ (Base‘𝑟)∀𝑦 ∈ (Base‘𝑟)((𝑥(+g‘𝑟)𝑦) = (1r‘𝑟) → (𝑥 ∈ (Unit‘𝑟) ∨ 𝑦 ∈ (Unit‘𝑟)))}
2220, 21elrab2 3648 1 (𝑅 ∈ LRing ↔ (𝑅 ∈ NzRing ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) = 1 → (𝑥 ∈ 𝑈 ∨ 𝑦 ∈ 𝑈))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ‘cfv 6539  (class class class)co 7421  Basecbs 17393  +gcplusg 17434  1rcur 20413  Unitcui 20591  NzRingcnzr 20768  LRingclring 20796
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-iota 6494  df-fv 6547  df-ov 7424  df-lring 20797
This theorem is used by:  lringuplu  20802  drnglring  34071  dflring2  34072
  Copyright terms: Public domain W3C validator