Theorem isufd 34176

Description: The property of being a Unique Factorization Domain. (Contributed by Thierry Arnoux, 1-Jun-2024.)

Hypotheses

Ref	Expression
isufd.i	⊢ 𝐼 = (PrmIdeal‘𝑅)
isufd.3	⊢ 𝑃 = (RPrime‘𝑅)
isufd.0	⊢ 0 = (0g‘𝑅)

Assertion

Ref	Expression
isufd	⊢ (𝑅 ∈ UFD ↔ (𝑅 ∈ IDomn ∧ ∀𝑖 ∈ (𝐼 ∖ {{ 0 }})(𝑖 ∩ 𝑃) ≠ ∅))

Distinct variable group:   𝑅,𝑖

Allowed substitution hints:   𝑃(𝑖)   𝐼(𝑖)   0 (𝑖)

Proof of Theorem isufd

Dummy variable 𝑟 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6916	. . . . 5 ⊢ (𝑟 = 𝑅 → (PrmIdeal‘𝑟) = (PrmIdeal‘𝑅))
2		isufd.i	. . . . 5 ⊢ 𝐼 = (PrmIdeal‘𝑅)
3	1, 2	eqtr4di 2816	. . . 4 ⊢ (𝑟 = 𝑅 → (PrmIdeal‘𝑟) = 𝐼)
4		fveq2 6916	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = (0g‘𝑅))
5		isufd.0	. . . . . . 7 ⊢ 0 = (0g‘𝑅)
6	4, 5	eqtr4di 2816	. . . . . 6 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = 0 )
7	6	sneqd 4596	. . . . 5 ⊢ (𝑟 = 𝑅 → {(0g‘𝑟)} = { 0 })
8	7	sneqd 4596	. . . 4 ⊢ (𝑟 = 𝑅 → {{(0g‘𝑟)}} = {{ 0 }})
9	3, 8	difeq12d 4067	. . 3 ⊢ (𝑟 = 𝑅 → ((PrmIdeal‘𝑟) ∖ {{(0g‘𝑟)}}) = (𝐼 ∖ {{ 0 }}))
10		fveq2 6916	. . . . . 6 ⊢ (𝑟 = 𝑅 → (RPrime‘𝑟) = (RPrime‘𝑅))
11		isufd.3	. . . . . 6 ⊢ 𝑃 = (RPrime‘𝑅)
12	10, 11	eqtr4di 2816	. . . . 5 ⊢ (𝑟 = 𝑅 → (RPrime‘𝑟) = 𝑃)
13	12	ineq2d 4120	. . . 4 ⊢ (𝑟 = 𝑅 → (𝑖 ∩ (RPrime‘𝑟)) = (𝑖 ∩ 𝑃))
14	13	neeq1d 3018	. . 3 ⊢ (𝑟 = 𝑅 → ((𝑖 ∩ (RPrime‘𝑟)) ≠ ∅ ↔ (𝑖 ∩ 𝑃) ≠ ∅))
15	9, 14	raleqbidv 3338	. 2 ⊢ (𝑟 = 𝑅 → (∀𝑖 ∈ ((PrmIdeal‘𝑟) ∖ {{(0g‘𝑟)}})(𝑖 ∩ (RPrime‘𝑟)) ≠ ∅ ↔ ∀𝑖 ∈ (𝐼 ∖ {{ 0 }})(𝑖 ∩ 𝑃) ≠ ∅))
16		df-ufd 34175	. 2 ⊢ UFD = {𝑟 ∈ IDomn ∣ ∀𝑖 ∈ ((PrmIdeal‘𝑟) ∖ {{(0g‘𝑟)}})(𝑖 ∩ (RPrime‘𝑟)) ≠ ∅}
17	15, 16	elrab2 3652	1 ⊢ (𝑅 ∈ UFD ↔ (𝑅 ∈ IDomn ∧ ∀𝑖 ∈ (𝐼 ∖ {{ 0 }})(𝑖 ∩ 𝑃) ≠ ∅))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080   ∖ cdif 4048   ∩ cin 4092  ∅c0 4281  {csn 4588  ‘cfv 6566  0_gc0g 17660  RPrimecrpm 20713  IDomncidom 20996  PrmIdealcprmidl 21667  UFDcufd 34174

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-ne 2960  df-ral 3081  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  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-ufd 34175

This theorem is used by:  ufdprmidl  34177  ufdidom  34178  pidufd  34179  1arithufdlem4  34183  dfufd2  34186