MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  prmidl Structured version   Visualization version   GIF version

Theorem prmidl 21502
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 3323 . . . . 5 (𝑏 = 𝐽 → (∀𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 ↔ ∀𝑦𝐽 (𝑥 · 𝑦) ∈ 𝑃))
21ralbidv 3191 . . . 4 (𝑏 = 𝐽 → (∀𝑥𝐼𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 ↔ ∀𝑥𝐼𝑦𝐽 (𝑥 · 𝑦) ∈ 𝑃))
3 sseq1 3965 . . . . 5 (𝑏 = 𝐽 → (𝑏𝑃𝐽𝑃))
43orbi2d 929 . . . 4 (𝑏 = 𝐽 → ((𝐼𝑃𝑏𝑃) ↔ (𝐼𝑃𝐽𝑃)))
52, 4imbi12d 347 . . 3 (𝑏 = 𝐽 → ((∀𝑥𝐼𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝐼𝑃𝑏𝑃)) ↔ (∀𝑥𝐼𝑦𝐽 (𝑥 · 𝑦) ∈ 𝑃 → (𝐼𝑃𝐽𝑃))))
6 raleq 3323 . . . . . 6 (𝑎 = 𝐼 → (∀𝑥𝑎𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 ↔ ∀𝑥𝐼𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃))
7 sseq1 3965 . . . . . . 7 (𝑎 = 𝐼 → (𝑎𝑃𝐼𝑃))
87orbi1d 930 . . . . . 6 (𝑎 = 𝐼 → ((𝑎𝑃𝑏𝑃) ↔ (𝐼𝑃𝑏𝑃)))
96, 8imbi12d 347 . . . . 5 (𝑎 = 𝐼 → ((∀𝑥𝑎𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃)) ↔ (∀𝑥𝐼𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝐼𝑃𝑏𝑃))))
109ralbidv 3191 . . . 4 (𝑎 = 𝐼 → (∀𝑏 ∈ (LIdeal‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃)) ↔ ∀𝑏 ∈ (LIdeal‘𝑅)(∀𝑥𝐼𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝐼𝑃𝑏𝑃))))
11 prmidlval.1 . . . . . . . 8 𝐵 = (Base‘𝑅)
12 prmidlval.2 . . . . . . . 8 · = (.r𝑅)
1311, 12isprmidl 21500 . . . . . . 7 (𝑅 ∈ Ring → (𝑃 ∈ (PrmIdeal‘𝑅) ↔ (𝑃 ∈ (LIdeal‘𝑅) ∧ 𝑃𝐵 ∧ ∀𝑎 ∈ (LIdeal‘𝑅)∀𝑏 ∈ (LIdeal‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃)))))
1413biimpa 482 . . . . . 6 ((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) → (𝑃 ∈ (LIdeal‘𝑅) ∧ 𝑃𝐵 ∧ ∀𝑎 ∈ (LIdeal‘𝑅)∀𝑏 ∈ (LIdeal‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃))))
1514simp3d 1162 . . . . 5 ((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) → ∀𝑎 ∈ (LIdeal‘𝑅)∀𝑏 ∈ (LIdeal‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃)))
1615adantr 486 . . . 4 (((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝐽 ∈ (LIdeal‘𝑅))) → ∀𝑎 ∈ (LIdeal‘𝑅)∀𝑏 ∈ (LIdeal‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃)))
17 simprl 783 . . . 4 (((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝐽 ∈ (LIdeal‘𝑅))) → 𝐼 ∈ (LIdeal‘𝑅))
1810, 16, 17rspcdva 3585 . . 3 (((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝐽 ∈ (LIdeal‘𝑅))) → ∀𝑏 ∈ (LIdeal‘𝑅)(∀𝑥𝐼𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝐼𝑃𝑏𝑃)))
19 simprr 785 . . 3 (((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝐽 ∈ (LIdeal‘𝑅))) → 𝐽 ∈ (LIdeal‘𝑅))
205, 18, 19rspcdva 3585 . 2 (((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝐽 ∈ (LIdeal‘𝑅))) → (∀𝑥𝐼𝑦𝐽 (𝑥 · 𝑦) ∈ 𝑃 → (𝐼𝑃𝐽𝑃)))
2120imp 412 1 ((((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝐽 ∈ (LIdeal‘𝑅))) ∧ ∀𝑥𝐼𝑦𝐽 (𝑥 · 𝑦) ∈ 𝑃) → (𝐼𝑃𝐽𝑃))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  wo 861  w3a 1103   = wceq 1570  wcel 2146  wne 2961  wral 3082  wss 3908  cfv 6543  (class class class)co 7423  Basecbs 17294  .rcmulr 17336  Ringcrg 20346  LIdealclidl 21367  PrmIdealcprmidl 21497
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-iota 6499  df-fun 6545  df-fv 6551  df-ov 7426  df-prmidl 21498
This theorem is used by:  idlmulssprm  21504  isprmidlc  21509
  Copyright terms: Public domain W3C validator