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

Theorem pridlval 37506
Description: The class of prime ideals of a ring 𝑅. (Contributed by Jeff Madsen, 10-Jun-2010.)
Hypotheses
Ref Expression
pridlval.1 𝐺 = (1st𝑅)
pridlval.2 𝐻 = (2nd𝑅)
pridlval.3 𝑋 = ran 𝐺
Assertion
Ref Expression
pridlval (𝑅 ∈ RingOps → (PrIdl‘𝑅) = {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)))})
Distinct variable groups:   𝑅,𝑖,𝑥,𝑦,𝑎,𝑏   𝑖,𝑋   𝑖,𝐻
Allowed substitution hints:   𝐺(𝑥,𝑦,𝑖,𝑎,𝑏)   𝐻(𝑥,𝑦,𝑎,𝑏)   𝑋(𝑥,𝑦,𝑎,𝑏)

Proof of Theorem pridlval
Dummy variable 𝑟 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6897 . . 3 (𝑟 = 𝑅 → (Idl‘𝑟) = (Idl‘𝑅))
2 fveq2 6897 . . . . . . . 8 (𝑟 = 𝑅 → (1st𝑟) = (1st𝑅))
3 pridlval.1 . . . . . . . 8 𝐺 = (1st𝑅)
42, 3eqtr4di 2786 . . . . . . 7 (𝑟 = 𝑅 → (1st𝑟) = 𝐺)
54rneqd 5940 . . . . . 6 (𝑟 = 𝑅 → ran (1st𝑟) = ran 𝐺)
6 pridlval.3 . . . . . 6 𝑋 = ran 𝐺
75, 6eqtr4di 2786 . . . . 5 (𝑟 = 𝑅 → ran (1st𝑟) = 𝑋)
87neeq2d 2998 . . . 4 (𝑟 = 𝑅 → (𝑖 ≠ ran (1st𝑟) ↔ 𝑖𝑋))
9 fveq2 6897 . . . . . . . . . . 11 (𝑟 = 𝑅 → (2nd𝑟) = (2nd𝑅))
10 pridlval.2 . . . . . . . . . . 11 𝐻 = (2nd𝑅)
119, 10eqtr4di 2786 . . . . . . . . . 10 (𝑟 = 𝑅 → (2nd𝑟) = 𝐻)
1211oveqd 7437 . . . . . . . . 9 (𝑟 = 𝑅 → (𝑥(2nd𝑟)𝑦) = (𝑥𝐻𝑦))
1312eleq1d 2814 . . . . . . . 8 (𝑟 = 𝑅 → ((𝑥(2nd𝑟)𝑦) ∈ 𝑖 ↔ (𝑥𝐻𝑦) ∈ 𝑖))
14132ralbidv 3215 . . . . . . 7 (𝑟 = 𝑅 → (∀𝑥𝑎𝑦𝑏 (𝑥(2nd𝑟)𝑦) ∈ 𝑖 ↔ ∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖))
1514imbi1d 341 . . . . . 6 (𝑟 = 𝑅 → ((∀𝑥𝑎𝑦𝑏 (𝑥(2nd𝑟)𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)) ↔ (∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖))))
161, 15raleqbidv 3339 . . . . 5 (𝑟 = 𝑅 → (∀𝑏 ∈ (Idl‘𝑟)(∀𝑥𝑎𝑦𝑏 (𝑥(2nd𝑟)𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)) ↔ ∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖))))
171, 16raleqbidv 3339 . . . 4 (𝑟 = 𝑅 → (∀𝑎 ∈ (Idl‘𝑟)∀𝑏 ∈ (Idl‘𝑟)(∀𝑥𝑎𝑦𝑏 (𝑥(2nd𝑟)𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)) ↔ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖))))
188, 17anbi12d 631 . . 3 (𝑟 = 𝑅 → ((𝑖 ≠ ran (1st𝑟) ∧ ∀𝑎 ∈ (Idl‘𝑟)∀𝑏 ∈ (Idl‘𝑟)(∀𝑥𝑎𝑦𝑏 (𝑥(2nd𝑟)𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖))) ↔ (𝑖𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)))))
191, 18rabeqbidv 3446 . 2 (𝑟 = 𝑅 → {𝑖 ∈ (Idl‘𝑟) ∣ (𝑖 ≠ ran (1st𝑟) ∧ ∀𝑎 ∈ (Idl‘𝑟)∀𝑏 ∈ (Idl‘𝑟)(∀𝑥𝑎𝑦𝑏 (𝑥(2nd𝑟)𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)))} = {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)))})
20 df-pridl 37484 . 2 PrIdl = (𝑟 ∈ RingOps ↦ {𝑖 ∈ (Idl‘𝑟) ∣ (𝑖 ≠ ran (1st𝑟) ∧ ∀𝑎 ∈ (Idl‘𝑟)∀𝑏 ∈ (Idl‘𝑟)(∀𝑥𝑎𝑦𝑏 (𝑥(2nd𝑟)𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)))})
21 fvex 6910 . . 3 (Idl‘𝑅) ∈ V
2221rabex 5334 . 2 {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)))} ∈ V
2319, 20, 22fvmpt 7005 1 (𝑅 ∈ RingOps → (PrIdl‘𝑅) = {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)))})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wo 846   = wceq 1534  wcel 2099  wne 2937  wral 3058  {crab 3429  wss 3947  ran crn 5679  cfv 6548  (class class class)co 7420  1st c1st 7991  2nd c2nd 7992  RingOpscrngo 37367  Idlcidl 37480  PrIdlcpridl 37481
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699  ax-sep 5299  ax-nul 5306  ax-pr 5429
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2530  df-eu 2559  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-ral 3059  df-rex 3068  df-rab 3430  df-v 3473  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4909  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5576  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-iota 6500  df-fun 6550  df-fv 6556  df-ov 7423  df-pridl 37484
This theorem is referenced by:  ispridl  37507
  Copyright terms: Public domain W3C validator
OSZAR »