| 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 7427 | . . . . 5 ⊢ (𝑎 = 𝑋 → (𝑎 · 𝑏) = (𝑋 · 𝑏)) | |
| 3 | 2 | eleq1d 2845 | . . . 4 ⊢ (𝑎 = 𝑋 → ((𝑎 · 𝑏) ∈ 𝑃 ↔ (𝑋 · 𝑏) ∈ 𝑃)) |
| 4 | eleq1 2848 | . . . . 5 ⊢ (𝑎 = 𝑋 → (𝑎 ∈ 𝑃 ↔ 𝑋 ∈ 𝑃)) | |
| 5 | 4 | orbi1d 930 | . . . 4 ⊢ (𝑎 = 𝑋 → ((𝑎 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃) ↔ (𝑋 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃))) |
| 6 | 3, 5 | imbi12d 347 | . . 3 ⊢ (𝑎 = 𝑋 → (((𝑎 · 𝑏) ∈ 𝑃 → (𝑎 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃)) ↔ ((𝑋 · 𝑏) ∈ 𝑃 → (𝑋 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃)))) |
| 7 | oveq2 7428 | . . . . 5 ⊢ (𝑏 = 𝑌 → (𝑋 · 𝑏) = (𝑋 · 𝑌)) | |
| 8 | 7 | eleq1d 2845 | . . . 4 ⊢ (𝑏 = 𝑌 → ((𝑋 · 𝑏) ∈ 𝑃 ↔ (𝑋 · 𝑌) ∈ 𝑃)) |
| 9 | eleq1 2848 | . . . . 5 ⊢ (𝑏 = 𝑌 → (𝑏 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃)) | |
| 10 | 9 | orbi2d 929 | . . . 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 21629 | . . . . . 6 ⊢ (𝑅 ∈ CRing → (𝑃 ∈ (PrmIdeal‘𝑅) ↔ (𝑃 ∈ (LIdeal‘𝑅) ∧ 𝑃 ≠ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ((𝑎 · 𝑏) ∈ 𝑃 → (𝑎 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃))))) |
| 17 | 16 | biimpa 482 | . . . . 5 ⊢ ((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) → (𝑃 ∈ (LIdeal‘𝑅) ∧ 𝑃 ≠ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ((𝑎 · 𝑏) ∈ 𝑃 → (𝑎 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃)))) |
| 18 | 12, 13, 17 | syl2anc 596 | . . . 4 ⊢ (𝜑 → (𝑃 ∈ (LIdeal‘𝑅) ∧ 𝑃 ≠ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ((𝑎 · 𝑏) ∈ 𝑃 → (𝑎 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃)))) |
| 19 | 18 | simp3d 1162 | . . 3 ⊢ (𝜑 → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ((𝑎 · 𝑏) ∈ 𝑃 → (𝑎 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃))) |
| 20 | prmidlprop.5 | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 21 | prmidlprop.6 | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 22 | 6, 11, 19, 20, 21 | rspc2dv 3590 | . 2 ⊢ (𝜑 → ((𝑋 · 𝑌) ∈ 𝑃 → (𝑋 ∈ 𝑃 ∨ 𝑌 ∈ 𝑃))) |
| 23 | 1, 22 | mpd 16 | 1 ⊢ (𝜑 → (𝑋 ∈ 𝑃 ∨ 𝑌 ∈ 𝑃)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∨ wo 861 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 ∀wral 3076 ‘cfv 6538 (class class class)co 7420 Basecbs 17388 .rcmulr 17430 CRingccrg 20461 LIdealclidl 21485 PrmIdealcprmidl 21617 |
| 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-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11257 ax-resscn 11258 ax-1cn 11259 ax-icn 11260 ax-addcl 11261 ax-addrcl 11262 ax-mulcl 11263 ax-mulrcl 11264 ax-mulcom 11265 ax-addass 11266 ax-mulass 11267 ax-distr 11268 ax-i2m1 11269 ax-1ne0 11270 ax-1rid 11271 ax-rnegex 11272 ax-rrecex 11273 ax-cnre 11274 ax-pre-lttri 11275 ax-pre-lttrn 11276 ax-pre-ltadd 11277 ax-pre-mulgt0 11278 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8300 df-wrecs 8331 df-recs 8380 df-rdg 8419 df-er 8718 df-en 8975 df-dom 8976 df-sdom 8977 df-pnf 11346 df-mnf 11347 df-xr 11348 df-ltxr 11349 df-le 11350 df-sub 11544 df-neg 11545 df-nn 12337 df-2 12406 df-3 12407 df-4 12408 df-5 12409 df-6 12410 df-7 12411 df-8 12412 df-sets 17343 df-slot 17361 df-ndx 17373 df-base 17389 df-ress 17410 df-plusg 17442 df-mulr 17443 df-sca 17445 df-vsca 17446 df-ip 17447 df-0g 17613 df-mgm 18817 df-sgrp 18909 df-mnd 18925 df-grp 19148 df-minusg 19149 df-sbg 19150 df-subg 19334 df-cmn 19997 df-abl 19998 df-mgp 20362 df-rng 20376 df-ur 20409 df-ring 20462 df-cring 20463 df-subrg 20823 df-lmod 21138 df-lss 21208 df-lsp 21248 df-sra 21449 df-rgmod 21450 df-lidl 21487 df-rsp 21488 df-prmidl 21618 |
| This theorem is used by: prmidlsubm 21644 |
| Copyright terms: Public domain | W3C validator |