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 38041
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 6905 . . 3 (𝑟 = 𝑅 → (Idl‘𝑟) = (Idl‘𝑅))
2 fveq2 6905 . . . . . . . 8 (𝑟 = 𝑅 → (1st𝑟) = (1st𝑅))
3 pridlval.1 . . . . . . . 8 𝐺 = (1st𝑅)
42, 3eqtr4di 2794 . . . . . . 7 (𝑟 = 𝑅 → (1st𝑟) = 𝐺)
54rneqd 5948 . . . . . 6 (𝑟 = 𝑅 → ran (1st𝑟) = ran 𝐺)
6 pridlval.3 . . . . . 6 𝑋 = ran 𝐺
75, 6eqtr4di 2794 . . . . 5 (𝑟 = 𝑅 → ran (1st𝑟) = 𝑋)
87neeq2d 3000 . . . 4 (𝑟 = 𝑅 → (𝑖 ≠ ran (1st𝑟) ↔ 𝑖𝑋))
9 fveq2 6905 . . . . . . . . . . 11 (𝑟 = 𝑅 → (2nd𝑟) = (2nd𝑅))
10 pridlval.2 . . . . . . . . . . 11 𝐻 = (2nd𝑅)
119, 10eqtr4di 2794 . . . . . . . . . 10 (𝑟 = 𝑅 → (2nd𝑟) = 𝐻)
1211oveqd 7449 . . . . . . . . 9 (𝑟 = 𝑅 → (𝑥(2nd𝑟)𝑦) = (𝑥𝐻𝑦))
1312eleq1d 2825 . . . . . . . 8 (𝑟 = 𝑅 → ((𝑥(2nd𝑟)𝑦) ∈ 𝑖 ↔ (𝑥𝐻𝑦) ∈ 𝑖))
14132ralbidv 3220 . . . . . . 7 (𝑟 = 𝑅 → (∀𝑥𝑎𝑦𝑏 (𝑥(2nd𝑟)𝑦) ∈ 𝑖 ↔ ∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖))
1514imbi1d 341 . . . . . 6 (𝑟 = 𝑅 → ((∀𝑥𝑎𝑦𝑏 (𝑥(2nd𝑟)𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)) ↔ (∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖))))
161, 15raleqbidv 3345 . . . . 5 (𝑟 = 𝑅 → (∀𝑏 ∈ (Idl‘𝑟)(∀𝑥𝑎𝑦𝑏 (𝑥(2nd𝑟)𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)) ↔ ∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖))))
171, 16raleqbidv 3345 . . . 4 (𝑟 = 𝑅 → (∀𝑎 ∈ (Idl‘𝑟)∀𝑏 ∈ (Idl‘𝑟)(∀𝑥𝑎𝑦𝑏 (𝑥(2nd𝑟)𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)) ↔ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖))))
188, 17anbi12d 632 . . 3 (𝑟 = 𝑅 → ((𝑖 ≠ ran (1st𝑟) ∧ ∀𝑎 ∈ (Idl‘𝑟)∀𝑏 ∈ (Idl‘𝑟)(∀𝑥𝑎𝑦𝑏 (𝑥(2nd𝑟)𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖))) ↔ (𝑖𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)))))
191, 18rabeqbidv 3454 . 2 (𝑟 = 𝑅 → {𝑖 ∈ (Idl‘𝑟) ∣ (𝑖 ≠ ran (1st𝑟) ∧ ∀𝑎 ∈ (Idl‘𝑟)∀𝑏 ∈ (Idl‘𝑟)(∀𝑥𝑎𝑦𝑏 (𝑥(2nd𝑟)𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)))} = {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)))})
20 df-pridl 38019 . 2 PrIdl = (𝑟 ∈ RingOps ↦ {𝑖 ∈ (Idl‘𝑟) ∣ (𝑖 ≠ ran (1st𝑟) ∧ ∀𝑎 ∈ (Idl‘𝑟)∀𝑏 ∈ (Idl‘𝑟)(∀𝑥𝑎𝑦𝑏 (𝑥(2nd𝑟)𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)))})
21 fvex 6918 . . 3 (Idl‘𝑅) ∈ V
2221rabex 5338 . 2 {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)))} ∈ V
2319, 20, 22fvmpt 7015 1 (𝑅 ∈ RingOps → (PrIdl‘𝑅) = {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥𝑎𝑦𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎𝑖𝑏𝑖)))})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wo 847   = wceq 1539  wcel 2107  wne 2939  wral 3060  {crab 3435  wss 3950  ran crn 5685  cfv 6560  (class class class)co 7432  1st c1st 8013  2nd c2nd 8014  RingOpscrngo 37902  Idlcidl 38015  PrIdlcpridl 38016
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-sep 5295  ax-nul 5305  ax-pr 5431
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3436  df-v 3481  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-br 5143  df-opab 5205  df-mpt 5225  df-id 5577  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-iota 6513  df-fun 6562  df-fv 6568  df-ov 7435  df-pridl 38019
This theorem is referenced by:  ispridl  38042
  Copyright terms: Public domain W3C validator