Theorem islpir 21659

Description: Principal ideal rings are where all ideals are principal. (Contributed by Stefan O'Rear, 3-Jan-2015.)

Hypotheses

Ref	Expression
lpival.p	⊢ 𝑃 = (LPIdeal‘𝑅)
lpiss.u	⊢ 𝑈 = (LIdeal‘𝑅)

Assertion

Ref	Expression
islpir	⊢ (𝑅 ∈ LPIR ↔ (𝑅 ∈ Ring ∧ 𝑈 = 𝑃))

Proof of Theorem islpir

Dummy variable 𝑟 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6888	. . . 4 ⊢ (𝑟 = 𝑅 → (LIdeal‘𝑟) = (LIdeal‘𝑅))
2		fveq2 6888	. . . 4 ⊢ (𝑟 = 𝑅 → (LPIdeal‘𝑟) = (LPIdeal‘𝑅))
3	1, 2	eqeq12d 2776	. . 3 ⊢ (𝑟 = 𝑅 → ((LIdeal‘𝑟) = (LPIdeal‘𝑟) ↔ (LIdeal‘𝑅) = (LPIdeal‘𝑅)))
4		lpiss.u	. . . 4 ⊢ 𝑈 = (LIdeal‘𝑅)
5		lpival.p	. . . 4 ⊢ 𝑃 = (LPIdeal‘𝑅)
6	4, 5	eqeq12i 2778	. . 3 ⊢ (𝑈 = 𝑃 ↔ (LIdeal‘𝑅) = (LPIdeal‘𝑅))
7	3, 6	bitr4di 292	. 2 ⊢ (𝑟 = 𝑅 → ((LIdeal‘𝑟) = (LPIdeal‘𝑟) ↔ 𝑈 = 𝑃))
8		df-lpir 21654	. 2 ⊢ LPIR = {𝑟 ∈ Ring ∣ (LIdeal‘𝑟) = (LPIdeal‘𝑟)}
9	7, 8	elrab2 3648	1 ⊢ (𝑅 ∈ LPIR ↔ (𝑅 ∈ Ring ∧ 𝑈 = 𝑃))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ‘cfv 6541  Ringcrg 20466  LIdealclidl 21491  LPIdealclpidl 21651  LPIRclpir 21652

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-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-iota 6496  df-fv 6549  df-lpir 21654

This theorem is used by:  islpir2  21661  lpirring  21662  lpirlidllpi  33977  mxidlirred  34045  lpirlnr  44226