Theorem islpir 21703

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 6916	. . . 4 ⊢ (𝑟 = 𝑅 → (LIdeal‘𝑟) = (LIdeal‘𝑅))
2		fveq2 6916	. . . 4 ⊢ (𝑟 = 𝑅 → (LPIdeal‘𝑟) = (LPIdeal‘𝑅))
3	1, 2	eqeq12d 2779	. . 3 ⊢ (𝑟 = 𝑅 → ((LIdeal‘𝑟) = (LPIdeal‘𝑟) ↔ (LIdeal‘𝑅) = (LPIdeal‘𝑅)))
4		lpiss.u	. . . 4 ⊢ 𝑈 = (LIdeal‘𝑅)
5		lpival.p	. . . 4 ⊢ 𝑃 = (LPIdeal‘𝑅)
6	4, 5	eqeq12i 2781	. . 3 ⊢ (𝑈 = 𝑃 ↔ (LIdeal‘𝑅) = (LPIdeal‘𝑅))
7	3, 6	bitr4di 292	. 2 ⊢ (𝑟 = 𝑅 → ((LIdeal‘𝑟) = (LPIdeal‘𝑟) ↔ 𝑈 = 𝑃))
8		df-lpir 21698	. 2 ⊢ LPIR = {𝑟 ∈ Ring ∣ (LIdeal‘𝑟) = (LPIdeal‘𝑟)}
9	7, 8	elrab2 3652	1 ⊢ (𝑅 ∈ LPIR ↔ (𝑅 ∈ Ring ∧ 𝑈 = 𝑃))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ‘cfv 6566  Ringcrg 20510  LIdealclidl 21535  LPIdealclpidl 21695  LPIRclpir 21696

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-iota 6520  df-fv 6574  df-lpir 21698

This theorem is used by:  islpir2  21705  lpirring  21706  lpirlidllpi  34033  mxidlirred  34101  lpirlnr  44384