Theorem islring 14583

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 groups:   𝑥,𝑅,𝑦   𝑥,𝐵,𝑦

Allowed substitution hints:   + (𝑥, 𝑦)   𝑈(𝑥, 𝑦)   1 (𝑥, 𝑦)

Proof of Theorem islring

Dummy variable 𝑟 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 5695	. . . 4 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
2		islring.b	. . . 4 ⊢ 𝐵 = (Base‘𝑅)
3	1, 2	eqtr4di 2289	. . 3 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
4		fveq2 5695	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (+g‘𝑟) = (+g‘𝑅))
5		islring.a	. . . . . . . 8 ⊢ + = (+g‘𝑅)
6	4, 5	eqtr4di 2289	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (+g‘𝑟) = + )
7	6	oveqd 6102	. . . . . 6 ⊢ (𝑟 = 𝑅 → (𝑥(+g‘𝑟)𝑦) = (𝑥 + 𝑦))
8		fveq2 5695	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (1r‘𝑟) = (1r‘𝑅))
9		islring.1	. . . . . . 7 ⊢ 1 = (1r‘𝑅)
10	8, 9	eqtr4di 2289	. . . . . 6 ⊢ (𝑟 = 𝑅 → (1r‘𝑟) = 1 )
11	7, 10	eqeq12d 2253	. . . . 5 ⊢ (𝑟 = 𝑅 → ((𝑥(+g‘𝑟)𝑦) = (1r‘𝑟) ↔ (𝑥 + 𝑦) = 1 ))
12		fveq2 5695	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (Unit‘𝑟) = (Unit‘𝑅))
13		islring.u	. . . . . . . 8 ⊢ 𝑈 = (Unit‘𝑅)
14	12, 13	eqtr4di 2289	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (Unit‘𝑟) = 𝑈)
15	14	eleq2d 2308	. . . . . 6 ⊢ (𝑟 = 𝑅 → (𝑥 ∈ (Unit‘𝑟) ↔ 𝑥 ∈ 𝑈))
16	14	eleq2d 2308	. . . . . 6 ⊢ (𝑟 = 𝑅 → (𝑦 ∈ (Unit‘𝑟) ↔ 𝑦 ∈ 𝑈))
17	15, 16	orbi12d 805	. . . . 5 ⊢ (𝑟 = 𝑅 → ((𝑥 ∈ (Unit‘𝑟) ∨ 𝑦 ∈ (Unit‘𝑟)) ↔ (𝑥 ∈ 𝑈 ∨ 𝑦 ∈ 𝑈)))
18	11, 17	imbi12d 234	. . . 4 ⊢ (𝑟 = 𝑅 → (((𝑥(+g‘𝑟)𝑦) = (1r‘𝑟) → (𝑥 ∈ (Unit‘𝑟) ∨ 𝑦 ∈ (Unit‘𝑟))) ↔ ((𝑥 + 𝑦) = 1 → (𝑥 ∈ 𝑈 ∨ 𝑦 ∈ 𝑈))))
19	3, 18	raleqbidv 2765	. . 3 ⊢ (𝑟 = 𝑅 → (∀𝑦 ∈ (Base‘𝑟)((𝑥(+g‘𝑟)𝑦) = (1r‘𝑟) → (𝑥 ∈ (Unit‘𝑟) ∨ 𝑦 ∈ (Unit‘𝑟))) ↔ ∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) = 1 → (𝑥 ∈ 𝑈 ∨ 𝑦 ∈ 𝑈))))
20	3, 19	raleqbidv 2765	. 2 ⊢ (𝑟 = 𝑅 → (∀𝑥 ∈ (Base‘𝑟)∀𝑦 ∈ (Base‘𝑟)((𝑥(+g‘𝑟)𝑦) = (1r‘𝑟) → (𝑥 ∈ (Unit‘𝑟) ∨ 𝑦 ∈ (Unit‘𝑟))) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) = 1 → (𝑥 ∈ 𝑈 ∨ 𝑦 ∈ 𝑈))))
21		df-lring 14582	. 2 ⊢ LRing = {𝑟 ∈ NzRing ∣ ∀𝑥 ∈ (Base‘𝑟)∀𝑦 ∈ (Base‘𝑟)((𝑥(+g‘𝑟)𝑦) = (1r‘𝑟) → (𝑥 ∈ (Unit‘𝑟) ∨ 𝑦 ∈ (Unit‘𝑟)))}
22	20, 21	elrab2 2985	1 ⊢ (𝑅 ∈ LRing ↔ (𝑅 ∈ NzRing ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) = 1 → (𝑥 ∈ 𝑈 ∨ 𝑦 ∈ 𝑈))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 720   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ‘cfv 5377  (class class class)co 6085  Basecbs 13404  +_gcplusg 13484  1_rcur 14346  Unitcui 14477  NzRingcnzr 14570  LRingclring 14581

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-un 3224  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-iota 5337  df-fv 5385  df-ov 6088  df-lring 14582

This theorem is used by:  lringuplu  14587  opprlring  14588  aprlring  14684