Theorem pridlval 38342

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.

Step	Hyp	Ref	Expression
1		fveq2 6829	. . 3 ⊢ (𝑟 = 𝑅 → (Idl‘𝑟) = (Idl‘𝑅))
2		fveq2 6829	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (1st ‘𝑟) = (1st ‘𝑅))
3		pridlval.1	. . . . . . . 8 ⊢ 𝐺 = (1st ‘𝑅)
4	2, 3	eqtr4di 2788	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (1st ‘𝑟) = 𝐺)
5	4	rneqd 5882	. . . . . 6 ⊢ (𝑟 = 𝑅 → ran (1st ‘𝑟) = ran 𝐺)
6		pridlval.3	. . . . . 6 ⊢ 𝑋 = ran 𝐺
7	5, 6	eqtr4di 2788	. . . . 5 ⊢ (𝑟 = 𝑅 → ran (1st ‘𝑟) = 𝑋)
8	7	neeq2d 2990	. . . 4 ⊢ (𝑟 = 𝑅 → (𝑖 ≠ ran (1st ‘𝑟) ↔ 𝑖 ≠ 𝑋))
9		fveq2 6829	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (2nd ‘𝑟) = (2nd ‘𝑅))
10		pridlval.2	. . . . . . . . . . 11 ⊢ 𝐻 = (2nd ‘𝑅)
11	9, 10	eqtr4di 2788	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (2nd ‘𝑟) = 𝐻)
12	11	oveqd 7373	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (𝑥(2nd ‘𝑟)𝑦) = (𝑥𝐻𝑦))
13	12	eleq1d 2820	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → ((𝑥(2nd ‘𝑟)𝑦) ∈ 𝑖 ↔ (𝑥𝐻𝑦) ∈ 𝑖))
14	13	2ralbidv 3199	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥(2nd ‘𝑟)𝑦) ∈ 𝑖 ↔ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖))
15	14	imbi1d 341	. . . . . 6 ⊢ (𝑟 = 𝑅 → ((∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥(2nd ‘𝑟)𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)) ↔ (∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖))))
16	1, 15	raleqbidv 3309	. . . . 5 ⊢ (𝑟 = 𝑅 → (∀𝑏 ∈ (Idl‘𝑟)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥(2nd ‘𝑟)𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)) ↔ ∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖))))
17	1, 16	raleqbidv 3309	. . . 4 ⊢ (𝑟 = 𝑅 → (∀𝑎 ∈ (Idl‘𝑟)∀𝑏 ∈ (Idl‘𝑟)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥(2nd ‘𝑟)𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)) ↔ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖))))
18	8, 17	anbi12d 633	. . 3 ⊢ (𝑟 = 𝑅 → ((𝑖 ≠ ran (1st ‘𝑟) ∧ ∀𝑎 ∈ (Idl‘𝑟)∀𝑏 ∈ (Idl‘𝑟)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥(2nd ‘𝑟)𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖))) ↔ (𝑖 ≠ 𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)))))
19	1, 18	rabeqbidv 3405	. 2 ⊢ (𝑟 = 𝑅 → {𝑖 ∈ (Idl‘𝑟) ∣ (𝑖 ≠ ran (1st ‘𝑟) ∧ ∀𝑎 ∈ (Idl‘𝑟)∀𝑏 ∈ (Idl‘𝑟)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥(2nd ‘𝑟)𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)))} = {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖 ≠ 𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)))})
20		df-pridl 38320	. 2 ⊢ PrIdl = (𝑟 ∈ RingOps ↦ {𝑖 ∈ (Idl‘𝑟) ∣ (𝑖 ≠ ran (1st ‘𝑟) ∧ ∀𝑎 ∈ (Idl‘𝑟)∀𝑏 ∈ (Idl‘𝑟)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥(2nd ‘𝑟)𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)))})
21		fvex 6842	. . 3 ⊢ (Idl‘𝑅) ∈ V
22	21	rabex 5269	. 2 ⊢ {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖 ≠ 𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)))} ∈ V
23	19, 20, 22	fvmpt 6936	1 ⊢ (𝑅 ∈ RingOps → (PrIdl‘𝑅) = {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖 ≠ 𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)))})

Syntax hints:   → wi 4   ∧ wa 395   ∨ wo 848   = wceq 1542   ∈ wcel 2114   ≠ wne 2930  ∀wral 3049  {crab 3387   ⊆ wss 3885  ran crn 5621  ‘cfv 6487  (class class class)co 7356  1^st c1st 7929  2^nd c2nd 7930  RingOpscrngo 38203  Idlcidl 38316  PrIdlcpridl 38317

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2184  ax-ext 2707  ax-sep 5220  ax-nul 5230  ax-pr 5364

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2931  df-ral 3050  df-rex 3060  df-rab 3388  df-v 3429  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4264  df-if 4457  df-pw 4533  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4841  df-br 5075  df-opab 5137  df-mpt 5156  df-id 5515  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-iota 6443  df-fun 6489  df-fv 6495  df-ov 7359  df-pridl 38320

This theorem is referenced by:  ispridl  38343