Theorem pridlval 38712

Description: Obsolete theorem, use prmidlval 21473 instead. The class of prime ideals of a ring 𝑅. (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
pridlval	⊢ (𝑅 ∈ RingOps → (PrIdl‘𝑅) = {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖 ≠ 𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)))})

Distinct variable groups:   𝑅,𝑖,𝑥,𝑦,𝑎,𝑏   𝑖,𝑋   𝑖,𝐻

Allowed substitution hints:   𝐺(𝑥, 𝑦, 𝑖, 𝑎, 𝑏)   𝐻(𝑥, 𝑦, 𝑎, 𝑏)   𝑋(𝑥, 𝑦, 𝑎, 𝑏)

Proof of Theorem pridlval

Dummy variable 𝑟 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6881	. . 3 ⊢ (𝑟 = 𝑅 → (Idl‘𝑟) = (Idl‘𝑅))
2		fveq2 6881	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (1st ‘𝑟) = (1st ‘𝑅))
3		pridlval.1	. . . . . . . 8 ⊢ 𝐺 = (1st ‘𝑅)
4	2, 3	eqtr4di 2815	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (1st ‘𝑟) = 𝐺)
5	4	rneqd 5927	. . . . . 6 ⊢ (𝑟 = 𝑅 → ran (1st ‘𝑟) = ran 𝐺)
6		pridlval.3	. . . . . 6 ⊢ 𝑋 = ran 𝐺
7	5, 6	eqtr4di 2815	. . . . 5 ⊢ (𝑟 = 𝑅 → ran (1st ‘𝑟) = 𝑋)
8	7	neeq2d 3017	. . . 4 ⊢ (𝑟 = 𝑅 → (𝑖 ≠ ran (1st ‘𝑟) ↔ 𝑖 ≠ 𝑋))
9		fveq2 6881	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (2nd ‘𝑟) = (2nd ‘𝑅))
10		pridlval.2	. . . . . . . . . . 11 ⊢ 𝐻 = (2nd ‘𝑅)
11	9, 10	eqtr4di 2815	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (2nd ‘𝑟) = 𝐻)
12	11	oveqd 7429	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (𝑥(2nd ‘𝑟)𝑦) = (𝑥𝐻𝑦))
13	12	eleq1d 2847	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → ((𝑥(2nd ‘𝑟)𝑦) ∈ 𝑖 ↔ (𝑥𝐻𝑦) ∈ 𝑖))
14	13	2ralbidv 3228	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥(2nd ‘𝑟)𝑦) ∈ 𝑖 ↔ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖))
15	14	imbi1d 344	. . . . . 6 ⊢ (𝑟 = 𝑅 → ((∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥(2nd ‘𝑟)𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)) ↔ (∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖))))
16	1, 15	raleqbidv 3337	. . . . 5 ⊢ (𝑟 = 𝑅 → (∀𝑏 ∈ (Idl‘𝑟)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥(2nd ‘𝑟)𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)) ↔ ∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖))))
17	1, 16	raleqbidv 3337	. . . 4 ⊢ (𝑟 = 𝑅 → (∀𝑎 ∈ (Idl‘𝑟)∀𝑏 ∈ (Idl‘𝑟)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥(2nd ‘𝑟)𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)) ↔ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖))))
18	8, 17	anbi12d 643	. . 3 ⊢ (𝑟 = 𝑅 → ((𝑖 ≠ ran (1st ‘𝑟) ∧ ∀𝑎 ∈ (Idl‘𝑟)∀𝑏 ∈ (Idl‘𝑟)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥(2nd ‘𝑟)𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖))) ↔ (𝑖 ≠ 𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)))))
19	1, 18	rabeqbidv 3433	. 2 ⊢ (𝑟 = 𝑅 → {𝑖 ∈ (Idl‘𝑟) ∣ (𝑖 ≠ ran (1st ‘𝑟) ∧ ∀𝑎 ∈ (Idl‘𝑟)∀𝑏 ∈ (Idl‘𝑟)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥(2nd ‘𝑟)𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)))} = {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖 ≠ 𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)))})
20		df-pridl 38690	. 2 ⊢ PrIdl = (𝑟 ∈ RingOps ↦ {𝑖 ∈ (Idl‘𝑟) ∣ (𝑖 ≠ ran (1st ‘𝑟) ∧ ∀𝑎 ∈ (Idl‘𝑟)∀𝑏 ∈ (Idl‘𝑟)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥(2nd ‘𝑟)𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)))})
21		fvex 6894	. . 3 ⊢ (Idl‘𝑅) ∈ V
22	21	rabex 5308	. 2 ⊢ {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖 ≠ 𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)))} ∈ V
23	19, 20, 22	fvmpt 6989	1 ⊢ (𝑅 ∈ RingOps → (PrIdl‘𝑅) = {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖 ≠ 𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)))})

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   ∨ wo 860   = wceq 1569   ∈ wcel 2142   ≠ wne 2957  ∀wral 3078  {crab 3415   ⊆ wss 3904  ran crn 5661  ‘cfv 6536  (class class class)co 7412  1^st c1st 7982  2^nd c2nd 7983  RingOpscrngo 38573  Idlcidl 38686  PrIdlcpridl 38687

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-iota 6492  df-fun 6538  df-fv 6544  df-ov 7415  df-pridl 38690

This theorem is used by:  ispridl  38713