Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ispridl Structured version   Visualization version   GIF version

Theorem ispridl 38666
Description: Obsolete theorem, use isprmidl 21444 instead. The predicate "is a prime ideal". (Contributed by Jeff Madsen, 10-Jun-2010.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
pridlval.1 𝐺 = (1st𝑅)
pridlval.2 𝐻 = (2nd𝑅)
pridlval.3 𝑋 = ran 𝐺
Assertion
Ref Expression
ispridl (𝑅 ∈ RingOps → (𝑃 ∈ (PrIdl‘𝑅) ↔ (𝑃 ∈ (Idl‘𝑅) ∧ 𝑃𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃)))))
Distinct variable groups:   𝑥,𝑅,𝑦,𝑎,𝑏   𝑥,𝑃,𝑦,𝑎,𝑏
Allowed substitution hints:   𝐺(𝑥,𝑦,𝑎,𝑏)   𝐻(𝑥,𝑦,𝑎,𝑏)   𝑋(𝑥,𝑦,𝑎,𝑏)

Proof of Theorem ispridl
Dummy variable 𝑖 is distinct from all other variables.
StepHypRef Expression
1 pridlval.1 . . . 4 𝐺 = (1st𝑅)
2 pridlval.2 . . . 4 𝐻 = (2nd𝑅)
3 pridlval.3 . . . 4 𝑋 = ran 𝐺
41, 2, 3pridlval 38665 . . 3 (𝑅 ∈ RingOps → (PrIdl‘𝑅) = {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)))})
54eleq2d 2849 . 2 (𝑅 ∈ RingOps → (𝑃 ∈ (PrIdl‘𝑅) ↔ 𝑃 ∈ {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)))}))
6 neeq1 3020 . . . . 5 (𝑖 = 𝑃 → (𝑖𝑋𝑃𝑋))
7 eleq2 2852 . . . . . . . 8 (𝑖 = 𝑃 → ((𝑥𝐻𝑦) ∈ 𝑖 ↔ (𝑥𝐻𝑦) ∈ 𝑃))
872ralbidv 3229 . . . . . . 7 (𝑖 = 𝑃 → (∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 ↔ ∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑃))
9 sseq2 3964 . . . . . . . 8 (𝑖 = 𝑃 → (𝑎𝑖𝑎𝑃))
10 sseq2 3964 . . . . . . . 8 (𝑖 = 𝑃 → (𝑏𝑖𝑏𝑃))
119, 10orbi12d 931 . . . . . . 7 (𝑖 = 𝑃 → ((𝑎𝑖𝑏𝑖) ↔ (𝑎𝑃𝑏𝑃)))
128, 11imbi12d 347 . . . . . 6 (𝑖 = 𝑃 → ((∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)) ↔ (∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃))))
13122ralbidv 3229 . . . . 5 (𝑖 = 𝑃 → (∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)) ↔ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃))))
146, 13anbi12d 643 . . . 4 (𝑖 = 𝑃 → ((𝑖𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖))) ↔ (𝑃𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃)))))
1514elrab 3651 . . 3 (𝑃 ∈ {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)))} ↔ (𝑃 ∈ (Idl‘𝑅) ∧ (𝑃𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃)))))
16 3anass 1111 . . 3 ((𝑃 ∈ (Idl‘𝑅) ∧ 𝑃𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃))) ↔ (𝑃 ∈ (Idl‘𝑅) ∧ (𝑃𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃)))))
1715, 16bitr4i 281 . 2 (𝑃 ∈ {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)))} ↔ (𝑃 ∈ (Idl‘𝑅) ∧ 𝑃𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃))))
185, 17bitrdi 290 1 (𝑅 ∈ RingOps → (𝑃 ∈ (PrIdl‘𝑅) ↔ (𝑃 ∈ (Idl‘𝑅) ∧ 𝑃𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑃 → (𝑎𝑃𝑏𝑃)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  wo 860  w3a 1103   = wceq 1570  wcel 2143  wne 2958  wral 3079  {crab 3416  wss 3906  ran crn 5664  cfv 6538  (class class class)co 7412  1st c1st 7985  2nd c2nd 7986  RingOpscrngo 38526  Idlcidl 38639  PrIdlcpridl 38640
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-rn 5674  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7415  df-pridl 38643
This theorem is referenced by:  pridlidl  38667  pridlnr  38668  pridl  38669  ispridl2  38670  smprngopr  38684  ispridlc  38702
  Copyright terms: Public domain W3C validator