| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > 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 7392 | . . . . 5 ⊢ (𝑎 = 𝑋 → (𝑎 · 𝑏) = (𝑋 · 𝑏)) | |
| 3 | 2 | eleq1d 2841 | . . . 4 ⊢ (𝑎 = 𝑋 → ((𝑎 · 𝑏) ∈ 𝑃 ↔ (𝑋 · 𝑏) ∈ 𝑃)) |
| 4 | eleq1 2844 | . . . . 5 ⊢ (𝑎 = 𝑋 → (𝑎 ∈ 𝑃 ↔ 𝑋 ∈ 𝑃)) | |
| 5 | 4 | orbi1d 925 | . . . 4 ⊢ (𝑎 = 𝑋 → ((𝑎 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃) ↔ (𝑋 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃))) |
| 6 | 3, 5 | imbi12d 346 | . . 3 ⊢ (𝑎 = 𝑋 → (((𝑎 · 𝑏) ∈ 𝑃 → (𝑎 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃)) ↔ ((𝑋 · 𝑏) ∈ 𝑃 → (𝑋 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃)))) |
| 7 | oveq2 7393 | . . . . 5 ⊢ (𝑏 = 𝑌 → (𝑋 · 𝑏) = (𝑋 · 𝑌)) | |
| 8 | 7 | eleq1d 2841 | . . . 4 ⊢ (𝑏 = 𝑌 → ((𝑋 · 𝑏) ∈ 𝑃 ↔ (𝑋 · 𝑌) ∈ 𝑃)) |
| 9 | eleq1 2844 | . . . . 5 ⊢ (𝑏 = 𝑌 → (𝑏 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃)) | |
| 10 | 9 | orbi2d 924 | . . . 4 ⊢ (𝑏 = 𝑌 → ((𝑋 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃) ↔ (𝑋 ∈ 𝑃 ∨ 𝑌 ∈ 𝑃))) |
| 11 | 8, 10 | imbi12d 346 | . . 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 33587 | . . . . . 6 ⊢ (𝑅 ∈ CRing → (𝑃 ∈ (PrmIdeal‘𝑅) ↔ (𝑃 ∈ (LIdeal‘𝑅) ∧ 𝑃 ≠ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ((𝑎 · 𝑏) ∈ 𝑃 → (𝑎 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃))))) |
| 17 | 16 | biimpa 479 | . . . . 5 ⊢ ((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) → (𝑃 ∈ (LIdeal‘𝑅) ∧ 𝑃 ≠ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ((𝑎 · 𝑏) ∈ 𝑃 → (𝑎 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃)))) |
| 18 | 12, 13, 17 | syl2anc 592 | . . . 4 ⊢ (𝜑 → (𝑃 ∈ (LIdeal‘𝑅) ∧ 𝑃 ≠ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ((𝑎 · 𝑏) ∈ 𝑃 → (𝑎 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃)))) |
| 19 | 18 | simp3d 1153 | . . 3 ⊢ (𝜑 → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ((𝑎 · 𝑏) ∈ 𝑃 → (𝑎 ∈ 𝑃 ∨ 𝑏 ∈ 𝑃))) |
| 20 | prmidlprop.5 | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 21 | prmidlprop.6 | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 22 | 6, 11, 19, 20, 21 | rspc2dv 3591 | . 2 ⊢ (𝜑 → ((𝑋 · 𝑌) ∈ 𝑃 → (𝑋 ∈ 𝑃 ∨ 𝑌 ∈ 𝑃))) |
| 23 | 1, 22 | mpd 15 | 1 ⊢ (𝜑 → (𝑋 ∈ 𝑃 ∨ 𝑌 ∈ 𝑃)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 856 ∧ w3a 1095 = wceq 1554 ∈ wcel 2136 ≠ wne 2951 ∀wral 3070 ‘cfv 6510 (class class class)co 7385 Basecbs 17221 .rcmulr 17263 CRingccrg 20256 LIdealclidl 21249 PrmIdealcprmidl 33575 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-10 2169 ax-11 2185 ax-12 2206 ax-ext 2728 ax-rep 5221 ax-sep 5240 ax-nul 5250 ax-pow 5316 ax-pr 5384 ax-un 7707 ax-cnex 11119 ax-resscn 11120 ax-1cn 11121 ax-icn 11122 ax-addcl 11123 ax-addrcl 11124 ax-mulcl 11125 ax-mulrcl 11126 ax-mulcom 11127 ax-addass 11128 ax-mulass 11129 ax-distr 11130 ax-i2m1 11131 ax-1ne0 11132 ax-1rid 11133 ax-rnegex 11134 ax-rrecex 11135 ax-cnre 11136 ax-pre-lttri 11137 ax-pre-lttrn 11138 ax-pre-ltadd 11139 ax-pre-mulgt0 11140 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-nf 1798 df-sb 2085 df-mo 2560 df-eu 2590 df-clab 2735 df-cleq 2748 df-clel 2831 df-nfc 2905 df-ne 2952 df-nel 3056 df-ral 3071 df-rex 3081 df-rmo 3361 df-reu 3362 df-rab 3409 df-v 3450 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4475 df-pw 4551 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-int 4900 df-iun 4945 df-br 5095 df-opab 5157 df-mpt 5176 df-tr 5202 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6466 df-fun 6512 df-fn 6513 df-f 6514 df-f1 6515 df-fo 6516 df-f1o 6517 df-fv 6518 df-riota 7342 df-ov 7388 df-oprab 7389 df-mpo 7390 df-om 7836 df-1st 7959 df-2nd 7960 df-frecs 8250 df-wrecs 8281 df-recs 8330 df-rdg 8369 df-er 8666 df-en 8917 df-dom 8918 df-sdom 8919 df-pnf 11208 df-mnf 11209 df-xr 11210 df-ltxr 11211 df-le 11212 df-sub 11406 df-neg 11407 df-nn 12201 df-2 12270 df-3 12271 df-4 12272 df-5 12273 df-6 12274 df-7 12275 df-8 12276 df-sets 17176 df-slot 17194 df-ndx 17206 df-base 17222 df-ress 17243 df-plusg 17275 df-mulr 17276 df-sca 17278 df-vsca 17279 df-ip 17280 df-0g 17446 df-mgm 18650 df-sgrp 18729 df-mnd 18745 df-grp 18954 df-minusg 18955 df-sbg 18956 df-subg 19141 df-cmn 19798 df-abl 19799 df-mgp 20163 df-rng 20175 df-ur 20204 df-ring 20257 df-cring 20258 df-subrg 20592 df-lmod 20902 df-lss 20972 df-lsp 21012 df-sra 21213 df-rgmod 21214 df-lidl 21251 df-rsp 21252 df-prmidl 33576 |
| This theorem is referenced by: prmidlsubm 33600 |
| Copyright terms: Public domain | W3C validator |