| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prmidlprop | Structured version Visualization version GIF version | ||
| Description: Property of prime ideals. (Contributed by Thierry Arnoux, 6-Jun-2026.) |
| Ref | Expression |
|---|---|
| prmidlprop.1 | ⊢ 𝐵 = (Base‘𝑅) |
| prmidlprop.2 | ⊢ · = (.r‘𝑅) |
| prmidlprop.3 | ⊢ (𝜑 → 𝑅 ∈ CRing) |
| prmidlprop.4 | ⊢ (𝜑 → 𝑃 ∈ (PrmIdeal‘𝑅)) |
| prmidlprop.5 | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| prmidlprop.6 | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| prmidlprop.7 | ⊢ (𝜑 → (𝑋 · 𝑌) ∈ 𝑃) |
| Ref | Expression |
|---|---|
| prmidlprop | ⊢ (𝜑 → (𝑋 ∈ 𝑃 ∨ 𝑌 ∈ 𝑃)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prmidlprop.7 | . 2 ⊢ (𝜑 → (𝑋 · 𝑌) ∈ 𝑃) | |
| 2 | oveq1 7407 | . . . . 5 ⊢ (𝑎 = 𝑋 → (𝑎 · 𝑏) = (𝑋 · 𝑏)) | |
| 3 | 2 | eleq1d 2850 | . . . 4 ⊢ (𝑎 = 𝑋 → ((𝑎 · 𝑏) ∈ 𝑃 ↔ (𝑋 · 𝑏) ∈ 𝑃)) |
| 4 | eleq1 2853 | . . . . 5 ⊢ (𝑎 = 𝑋 → (𝑎 ∈ 𝑃 ↔ 𝑋 ∈ 𝑃)) | |
| 5 | 4 | orbi1d 929 | . . . 4 ⊢ (𝑎 = 𝑋 → ((𝑎 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃) ↔ (𝑋 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃))) |
| 6 | 3, 5 | imbi12d 347 | . . 3 ⊢ (𝑎 = 𝑋 → (((𝑎 · 𝑏) ∈ 𝑃 → (𝑎 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃)) ↔ ((𝑋 · 𝑏) ∈ 𝑃 → (𝑋 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃)))) |
| 7 | oveq2 7408 | . . . . 5 ⊢ (𝑏 = 𝑌 → (𝑋 · 𝑏) = (𝑋 · 𝑌)) | |
| 8 | 7 | eleq1d 2850 | . . . 4 ⊢ (𝑏 = 𝑌 → ((𝑋 · 𝑏) ∈ 𝑃 ↔ (𝑋 · 𝑌) ∈ 𝑃)) |
| 9 | eleq1 2853 | . . . . 5 ⊢ (𝑏 = 𝑌 → (𝑏 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃)) | |
| 10 | 9 | orbi2d 928 | . . . 4 ⊢ (𝑏 = 𝑌 → ((𝑋 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃) ↔ (𝑋 ∈ 𝑃 ∨ 𝑌 ∈ 𝑃))) |
| 11 | 8, 10 | imbi12d 347 | . . 3 ⊢ (𝑏 = 𝑌 → (((𝑋 · 𝑏) ∈ 𝑃 → (𝑋 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃)) ↔ ((𝑋 · 𝑌) ∈ 𝑃 → (𝑋 ∈ 𝑃 ∨ 𝑌 ∈ 𝑃)))) |
| 12 | prmidlprop.3 | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ CRing) | |
| 13 | prmidlprop.4 | . . . . 5 ⊢ (𝜑 → 𝑃 ∈ (PrmIdeal‘𝑅)) | |
| 14 | prmidlprop.1 | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑅) | |
| 15 | prmidlprop.2 | . . . . . . 7 ⊢ · = (.r‘𝑅) | |
| 16 | 14, 15 | isprmidlc 21434 | . . . . . 6 ⊢ (𝑅 ∈ CRing → (𝑃 ∈ (PrmIdeal‘𝑅) ↔ (𝑃 ∈ (LIdeal‘𝑅) ∧ 𝑃 ≠ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ((𝑎 · 𝑏) ∈ 𝑃 → (𝑎 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃))))) |
| 17 | 16 | biimpa 481 | . . . . 5 ⊢ ((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) → (𝑃 ∈ (LIdeal‘𝑅) ∧ 𝑃 ≠ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ((𝑎 · 𝑏) ∈ 𝑃 → (𝑎 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃)))) |
| 18 | 12, 13, 17 | syl2anc 595 | . . . 4 ⊢ (𝜑 → (𝑃 ∈ (LIdeal‘𝑅) ∧ 𝑃 ≠ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ((𝑎 · 𝑏) ∈ 𝑃 → (𝑎 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃)))) |
| 19 | 18 | simp3d 1160 | . . 3 ⊢ (𝜑 → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ((𝑎 · 𝑏) ∈ 𝑃 → (𝑎 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃))) |
| 20 | prmidlprop.5 | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 21 | prmidlprop.6 | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 22 | 6, 11, 19, 20, 21 | rspc2dv 3599 | . 2 ⊢ (𝜑 → ((𝑋 · 𝑌) ∈ 𝑃 → (𝑋 ∈ 𝑃 ∨ 𝑌 ∈ 𝑃))) |
| 23 | 1, 22 | mpd 16 | 1 ⊢ (𝜑 → (𝑋 ∈ 𝑃 ∨ 𝑌 ∈ 𝑃)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 860 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 ≠ wne 2960 ∀wral 3079 ‘cfv 6525 (class class class)co 7400 Basecbs 17259 .rcmulr 17301 CRingccrg 20307 LIdealclidl 21299 PrmIdealcprmidl 21422 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-int 4909 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12225 df-2 12294 df-3 12295 df-4 12296 df-5 12297 df-6 12298 df-7 12299 df-8 12300 df-sets 17214 df-slot 17232 df-ndx 17244 df-base 17260 df-ress 17281 df-plusg 17313 df-mulr 17314 df-sca 17316 df-vsca 17317 df-ip 17318 df-0g 17484 df-mgm 18688 df-sgrp 18767 df-mnd 18783 df-grp 18993 df-minusg 18994 df-sbg 18995 df-subg 19180 df-cmn 19843 df-abl 19844 df-mgp 20208 df-rng 20222 df-ur 20255 df-ring 20308 df-cring 20309 df-subrg 20646 df-lmod 20952 df-lss 21022 df-lsp 21062 df-sra 21263 df-rgmod 21264 df-lidl 21301 df-rsp 21302 df-prmidl 21423 |
| This theorem is referenced by: prmidlsubm 21447 |
| Copyright terms: Public domain | W3C validator |