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

Theorem prmidl 21446
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 3320 . . . . 5 (𝑏 = 𝐽 → (∀𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 ↔ ∀𝑦𝐽 (𝑥 · 𝑦) ∈ 𝑃))
21ralbidv 3188 . . . 4 (𝑏 = 𝐽 → (∀𝑥𝐼𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 ↔ ∀𝑥𝐼𝑦𝐽 (𝑥 · 𝑦) ∈ 𝑃))
3 sseq1 3963 . . . . 5 (𝑏 = 𝐽 → (𝑏𝑃𝐽𝑃))
43orbi2d 928 . . . 4 (𝑏 = 𝐽 → ((𝐼𝑃𝑏𝑃) ↔ (𝐼𝑃𝐽𝑃)))
52, 4imbi12d 347 . . 3 (𝑏 = 𝐽 → ((∀𝑥𝐼𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝐼𝑃𝑏𝑃)) ↔ (∀𝑥𝐼𝑦𝐽 (𝑥 · 𝑦) ∈ 𝑃 → (𝐼𝑃𝐽𝑃))))
6 raleq 3320 . . . . . 6 (𝑎 = 𝐼 → (∀𝑥𝑎𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 ↔ ∀𝑥𝐼𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃))
7 sseq1 3963 . . . . . . 7 (𝑎 = 𝐼 → (𝑎𝑃𝐼𝑃))
87orbi1d 929 . . . . . 6 (𝑎 = 𝐼 → ((𝑎𝑃𝑏𝑃) ↔ (𝐼𝑃𝑏𝑃)))
96, 8imbi12d 347 . . . . 5 (𝑎 = 𝐼 → ((∀𝑥𝑎𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃)) ↔ (∀𝑥𝐼𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝐼𝑃𝑏𝑃))))
109ralbidv 3188 . . . 4 (𝑎 = 𝐼 → (∀𝑏 ∈ (LIdeal‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃)) ↔ ∀𝑏 ∈ (LIdeal‘𝑅)(∀𝑥𝐼𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝐼𝑃𝑏𝑃))))
11 prmidlval.1 . . . . . . . 8 𝐵 = (Base‘𝑅)
12 prmidlval.2 . . . . . . . 8 · = (.r𝑅)
1311, 12isprmidl 21444 . . . . . . 7 (𝑅 ∈ Ring → (𝑃 ∈ (PrmIdeal‘𝑅) ↔ (𝑃 ∈ (LIdeal‘𝑅) ∧ 𝑃𝐵 ∧ ∀𝑎 ∈ (LIdeal‘𝑅)∀𝑏 ∈ (LIdeal‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃)))))
1413biimpa 481 . . . . . 6 ((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) → (𝑃 ∈ (LIdeal‘𝑅) ∧ 𝑃𝐵 ∧ ∀𝑎 ∈ (LIdeal‘𝑅)∀𝑏 ∈ (LIdeal‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃))))
1514simp3d 1162 . . . . 5 ((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) → ∀𝑎 ∈ (LIdeal‘𝑅)∀𝑏 ∈ (LIdeal‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃)))
1615adantr 485 . . . 4 (((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝐽 ∈ (LIdeal‘𝑅))) → ∀𝑎 ∈ (LIdeal‘𝑅)∀𝑏 ∈ (LIdeal‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃)))
17 simprl 782 . . . 4 (((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝐽 ∈ (LIdeal‘𝑅))) → 𝐼 ∈ (LIdeal‘𝑅))
1810, 16, 17rspcdva 3583 . . 3 (((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝐽 ∈ (LIdeal‘𝑅))) → ∀𝑏 ∈ (LIdeal‘𝑅)(∀𝑥𝐼𝑦𝑏 (𝑥 · 𝑦) ∈ 𝑃 → (𝐼𝑃𝑏𝑃)))
19 simprr 784 . . 3 (((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝐽 ∈ (LIdeal‘𝑅))) → 𝐽 ∈ (LIdeal‘𝑅))
205, 18, 19rspcdva 3583 . 2 (((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝐽 ∈ (LIdeal‘𝑅))) → (∀𝑥𝐼𝑦𝐽 (𝑥 · 𝑦) ∈ 𝑃 → (𝐼𝑃𝐽𝑃)))
2120imp 411 1 ((((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝐽 ∈ (LIdeal‘𝑅))) ∧ ∀𝑥𝐼𝑦𝐽 (𝑥 · 𝑦) ∈ 𝑃) → (𝐼𝑃𝐽𝑃))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  wo 860  w3a 1103   = wceq 1570  wcel 2143  wne 2958  wral 3079  wss 3906  cfv 6538  (class class class)co 7412  Basecbs 17270  .rcmulr 17312  Ringcrg 20316  LIdealclidl 21311  PrmIdealcprmidl 21441
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-nul 5270  ax-pr 5406
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7415  df-prmidl 21442
This theorem is referenced by:  idlmulssprm  21448  isprmidlc  21453
  Copyright terms: Public domain W3C validator