| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > isufd | Structured version Visualization version GIF version | ||
| Description: The property of being a Unique Factorization Domain. (Contributed by Thierry Arnoux, 1-Jun-2024.) |
| Ref | Expression |
|---|---|
| isufd.i | ⊢ 𝐼 = (PrmIdeal‘𝑅) |
| isufd.3 | ⊢ 𝑃 = (RPrime‘𝑅) |
| isufd.0 | ⊢ 0 = (0g‘𝑅) |
| Ref | Expression |
|---|---|
| isufd | ⊢ (𝑅 ∈ UFD ↔ (𝑅 ∈ IDomn ∧ ∀𝑖 ∈ (𝐼 ∖ {{ 0 }})(𝑖 ∩ 𝑃) ≠ ∅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq2 6881 | . . . . 5 ⊢ (𝑟 = 𝑅 → (PrmIdeal‘𝑟) = (PrmIdeal‘𝑅)) | |
| 2 | isufd.i | . . . . 5 ⊢ 𝐼 = (PrmIdeal‘𝑅) | |
| 3 | 1, 2 | eqtr4di 2816 | . . . 4 ⊢ (𝑟 = 𝑅 → (PrmIdeal‘𝑟) = 𝐼) |
| 4 | fveq2 6881 | . . . . . . 7 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = (0g‘𝑅)) | |
| 5 | isufd.0 | . . . . . . 7 ⊢ 0 = (0g‘𝑅) | |
| 6 | 4, 5 | eqtr4di 2816 | . . . . . 6 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = 0 ) |
| 7 | 6 | sneqd 4601 | . . . . 5 ⊢ (𝑟 = 𝑅 → {(0g‘𝑟)} = { 0 }) |
| 8 | 7 | sneqd 4601 | . . . 4 ⊢ (𝑟 = 𝑅 → {{(0g‘𝑟)}} = {{ 0 }}) |
| 9 | 3, 8 | difeq12d 4082 | . . 3 ⊢ (𝑟 = 𝑅 → ((PrmIdeal‘𝑟) ∖ {{(0g‘𝑟)}}) = (𝐼 ∖ {{ 0 }})) |
| 10 | fveq2 6881 | . . . . . 6 ⊢ (𝑟 = 𝑅 → (RPrime‘𝑟) = (RPrime‘𝑅)) | |
| 11 | isufd.3 | . . . . . 6 ⊢ 𝑃 = (RPrime‘𝑅) | |
| 12 | 10, 11 | eqtr4di 2816 | . . . . 5 ⊢ (𝑟 = 𝑅 → (RPrime‘𝑟) = 𝑃) |
| 13 | 12 | ineq2d 4173 | . . . 4 ⊢ (𝑟 = 𝑅 → (𝑖 ∩ (RPrime‘𝑟)) = (𝑖 ∩ 𝑃)) |
| 14 | 13 | neeq1d 3017 | . . 3 ⊢ (𝑟 = 𝑅 → ((𝑖 ∩ (RPrime‘𝑟)) ≠ ∅ ↔ (𝑖 ∩ 𝑃) ≠ ∅)) |
| 15 | 9, 14 | raleqbidv 3338 | . 2 ⊢ (𝑟 = 𝑅 → (∀𝑖 ∈ ((PrmIdeal‘𝑟) ∖ {{(0g‘𝑟)}})(𝑖 ∩ (RPrime‘𝑟)) ≠ ∅ ↔ ∀𝑖 ∈ (𝐼 ∖ {{ 0 }})(𝑖 ∩ 𝑃) ≠ ∅)) |
| 16 | df-ufd 33829 | . 2 ⊢ UFD = {𝑟 ∈ IDomn ∣ ∀𝑖 ∈ ((PrmIdeal‘𝑟) ∖ {{(0g‘𝑟)}})(𝑖 ∩ (RPrime‘𝑟)) ≠ ∅} | |
| 17 | 15, 16 | elrab2 3654 | 1 ⊢ (𝑅 ∈ UFD ↔ (𝑅 ∈ IDomn ∧ ∀𝑖 ∈ (𝐼 ∖ {{ 0 }})(𝑖 ∩ 𝑃) ≠ ∅)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 ∀wral 3079 ∖ cdif 3902 ∩ cin 3904 ∅c0 4286 {csn 4589 ‘cfv 6536 0gc0g 17487 RPrimecrpm 20510 IDomncidom 20792 PrmIdealcprmidl 21460 UFDcufd 33828 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-iota 6492 df-fv 6544 df-ufd 33829 |
| This theorem is referenced by: ufdprmidl 33831 ufdidom 33832 pidufd 33833 1arithufdlem4 33837 dfufd2 33840 |
| Copyright terms: Public domain | W3C validator |