Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  prmidl Structured version   Visualization version   GIF version

Theorem prmidl 31023
Description: The main property of a prime ideal. (Contributed by Jeff Madsen, 19-Jun-2010.) (Revised by Thierry Arnoux, 12-Jan-2024.)
Hypotheses
Ref Expression
prmidlval.1 𝐵 = (Base‘𝑅)
prmidlval.2 · = (.r𝑅)
Assertion
Ref Expression
prmidl ((((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝐽 ∈ (LIdeal‘𝑅))) ∧ ∀𝑥𝐼𝑦𝐽 (𝑥 · 𝑦) ∈ 𝑃) → (𝐼𝑃𝐽𝑃))
Distinct variable groups:   𝑥,𝑅,𝑦   𝑥,𝑃,𝑦   𝑥,𝐼   𝑥,𝐽,𝑦
Allowed substitution hints:   𝐵(𝑥,𝑦)   · (𝑥,𝑦)   𝐼(𝑦)

Proof of Theorem prmidl
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 raleq 3358 . . . . 5 (𝑏 = 𝐽 → (∀𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 ↔ ∀𝑦𝐽 (𝑥 · 𝑦) ∈ 𝑃))
21ralbidv 3162 . . . 4 (𝑏 = 𝐽 → (∀𝑥𝐼𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 ↔ ∀𝑥𝐼𝑦𝐽 (𝑥 · 𝑦) ∈ 𝑃))
3 sseq1 3940 . . . . 5 (𝑏 = 𝐽 → (𝑏𝑃𝐽𝑃))
43orbi2d 913 . . . 4 (𝑏 = 𝐽 → ((𝐼𝑃𝑏𝑃) ↔ (𝐼𝑃𝐽𝑃)))
52, 4imbi12d 348 . . 3 (𝑏 = 𝐽 → ((∀𝑥𝐼𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝐼𝑃𝑏𝑃)) ↔ (∀𝑥𝐼𝑦𝐽 (𝑥 · 𝑦) ∈ 𝑃 → (𝐼𝑃𝐽𝑃))))
6 raleq 3358 . . . . . 6 (𝑎 = 𝐼 → (∀𝑥𝑎𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 ↔ ∀𝑥𝐼𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃))
7 sseq1 3940 . . . . . . 7 (𝑎 = 𝐼 → (𝑎𝑃𝐼𝑃))
87orbi1d 914 . . . . . 6 (𝑎 = 𝐼 → ((𝑎𝑃𝑏𝑃) ↔ (𝐼𝑃𝑏𝑃)))
96, 8imbi12d 348 . . . . 5 (𝑎 = 𝐼 → ((∀𝑥𝑎𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃)) ↔ (∀𝑥𝐼𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝐼𝑃𝑏𝑃))))
109ralbidv 3162 . . . 4 (𝑎 = 𝐼 → (∀𝑏 ∈ (LIdeal‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃)) ↔ ∀𝑏 ∈ (LIdeal‘𝑅)(∀𝑥𝐼𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝐼𝑃𝑏𝑃))))
11 prmidlval.1 . . . . . . . 8 𝐵 = (Base‘𝑅)
12 prmidlval.2 . . . . . . . 8 · = (.r𝑅)
1311, 12isprmidl 31021 . . . . . . 7 (𝑅 ∈ Ring → (𝑃 ∈ (PrmIdeal‘𝑅) ↔ (𝑃 ∈ (LIdeal‘𝑅) ∧ 𝑃𝐵 ∧ ∀𝑎 ∈ (LIdeal‘𝑅)∀𝑏 ∈ (LIdeal‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃)))))
1413biimpa 480 . . . . . 6 ((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) → (𝑃 ∈ (LIdeal‘𝑅) ∧ 𝑃𝐵 ∧ ∀𝑎 ∈ (LIdeal‘𝑅)∀𝑏 ∈ (LIdeal‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃))))
1514simp3d 1141 . . . . 5 ((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) → ∀𝑎 ∈ (LIdeal‘𝑅)∀𝑏 ∈ (LIdeal‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃)))
1615adantr 484 . . . 4 (((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝐽 ∈ (LIdeal‘𝑅))) → ∀𝑎 ∈ (LIdeal‘𝑅)∀𝑏 ∈ (LIdeal‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃)))
17 simprl 770 . . . 4 (((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝐽 ∈ (LIdeal‘𝑅))) → 𝐼 ∈ (LIdeal‘𝑅))
1810, 16, 17rspcdva 3573 . . 3 (((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝐽 ∈ (LIdeal‘𝑅))) → ∀𝑏 ∈ (LIdeal‘𝑅)(∀𝑥𝐼𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝐼𝑃𝑏𝑃)))
19 simprr 772 . . 3 (((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝐽 ∈ (LIdeal‘𝑅))) → 𝐽 ∈ (LIdeal‘𝑅))
205, 18, 19rspcdva 3573 . 2 (((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝐽 ∈ (LIdeal‘𝑅))) → (∀𝑥𝐼𝑦𝐽 (𝑥 · 𝑦) ∈ 𝑃 → (𝐼𝑃𝐽𝑃)))
2120imp 410 1 ((((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝐽 ∈ (LIdeal‘𝑅))) ∧ ∀𝑥𝐼𝑦𝐽 (𝑥 · 𝑦) ∈ 𝑃) → (𝐼𝑃𝐽𝑃))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  wo 844  w3a 1084   = wceq 1538  wcel 2111  wne 2987  wral 3106  wss 3881  cfv 6324  (class class class)co 7135  Basecbs 16475  .rcmulr 16558  Ringcrg 19290  LIdealclidl 19935  PrmIdealcprmidl 31018
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-iota 6283  df-fun 6326  df-fv 6332  df-ov 7138  df-prmidl 31019
This theorem is referenced by:  idlmulssprm  31025  isprmidlc  31031
  Copyright terms: Public domain W3C validator