Theorem ispridl 35878

Description: The predicate "is a prime ideal". (Contributed by Jeff Madsen, 10-Jun-2010.)

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.

Step	Hyp	Ref	Expression
1		pridlval.1	. . . 4 ⊢ 𝐺 = (1st ‘𝑅)
2		pridlval.2	. . . 4 ⊢ 𝐻 = (2nd ‘𝑅)
3		pridlval.3	. . . 4 ⊢ 𝑋 = ran 𝐺
4	1, 2, 3	pridlval 35877	. . 3 ⊢ (𝑅 ∈ RingOps → (PrIdl‘𝑅) = {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖 ≠ 𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)))})
5	4	eleq2d 2816	. 2 ⊢ (𝑅 ∈ RingOps → (𝑃 ∈ (PrIdl‘𝑅) ↔ 𝑃 ∈ {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖 ≠ 𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)))}))
6		neeq1 2994	. . . . 5 ⊢ (𝑖 = 𝑃 → (𝑖 ≠ 𝑋 ↔ 𝑃 ≠ 𝑋))
7		eleq2 2819	. . . . . . . 8 ⊢ (𝑖 = 𝑃 → ((𝑥𝐻𝑦) ∈ 𝑖 ↔ (𝑥𝐻𝑦) ∈ 𝑃))
8	7	2ralbidv 3110	. . . . . . 7 ⊢ (𝑖 = 𝑃 → (∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 ↔ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑃))
9		sseq2 3913	. . . . . . . 8 ⊢ (𝑖 = 𝑃 → (𝑎 ⊆ 𝑖 ↔ 𝑎 ⊆ 𝑃))
10		sseq2 3913	. . . . . . . 8 ⊢ (𝑖 = 𝑃 → (𝑏 ⊆ 𝑖 ↔ 𝑏 ⊆ 𝑃))
11	9, 10	orbi12d 919	. . . . . . 7 ⊢ (𝑖 = 𝑃 → ((𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖) ↔ (𝑎 ⊆ 𝑃 ∨ 𝑏 ⊆ 𝑃)))
12	8, 11	imbi12d 348	. . . . . 6 ⊢ (𝑖 = 𝑃 → ((∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)) ↔ (∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑃 → (𝑎 ⊆ 𝑃 ∨ 𝑏 ⊆ 𝑃))))
13	12	2ralbidv 3110	. . . . 5 ⊢ (𝑖 = 𝑃 → (∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)) ↔ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑃 → (𝑎 ⊆ 𝑃 ∨ 𝑏 ⊆ 𝑃))))
14	6, 13	anbi12d 634	. . . 4 ⊢ (𝑖 = 𝑃 → ((𝑖 ≠ 𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖))) ↔ (𝑃 ≠ 𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑃 → (𝑎 ⊆ 𝑃 ∨ 𝑏 ⊆ 𝑃)))))
15	14	elrab 3591	. . 3 ⊢ (𝑃 ∈ {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖 ≠ 𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)))} ↔ (𝑃 ∈ (Idl‘𝑅) ∧ (𝑃 ≠ 𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑃 → (𝑎 ⊆ 𝑃 ∨ 𝑏 ⊆ 𝑃)))))
16		3anass 1097	. . 3 ⊢ ((𝑃 ∈ (Idl‘𝑅) ∧ 𝑃 ≠ 𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑃 → (𝑎 ⊆ 𝑃 ∨ 𝑏 ⊆ 𝑃))) ↔ (𝑃 ∈ (Idl‘𝑅) ∧ (𝑃 ≠ 𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑃 → (𝑎 ⊆ 𝑃 ∨ 𝑏 ⊆ 𝑃)))))
17	15, 16	bitr4i 281	. 2 ⊢ (𝑃 ∈ {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖 ≠ 𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑖 → (𝑎 ⊆ 𝑖 ∨ 𝑏 ⊆ 𝑖)))} ↔ (𝑃 ∈ (Idl‘𝑅) ∧ 𝑃 ≠ 𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑃 → (𝑎 ⊆ 𝑃 ∨ 𝑏 ⊆ 𝑃))))
18	5, 17	bitrdi 290	1 ⊢ (𝑅 ∈ RingOps → (𝑃 ∈ (PrIdl‘𝑅) ↔ (𝑃 ∈ (Idl‘𝑅) ∧ 𝑃 ≠ 𝑋 ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥𝐻𝑦) ∈ 𝑃 → (𝑎 ⊆ 𝑃 ∨ 𝑏 ⊆ 𝑃)))))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∨ wo 847   ∧ w3a 1089   = wceq 1543   ∈ wcel 2112   ≠ wne 2932  ∀wral 3051  {crab 3055   ⊆ wss 3853  ran crn 5537  ‘cfv 6358  (class class class)co 7191  1^st c1st 7737  2^nd c2nd 7738  RingOpscrngo 35738  Idlcidl 35851  PrIdlcpridl 35852

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2708  ax-sep 5177  ax-nul 5184  ax-pr 5307

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2728  df-clel 2809  df-nfc 2879  df-ne 2933  df-ral 3056  df-rex 3057  df-rab 3060  df-v 3400  df-sbc 3684  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-nul 4224  df-if 4426  df-sn 4528  df-pr 4530  df-op 4534  df-uni 4806  df-br 5040  df-opab 5102  df-mpt 5121  df-id 5440  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-iota 6316  df-fun 6360  df-fv 6366  df-ov 7194  df-pridl 35855

This theorem is referenced by:  pridlidl  35879  pridlnr  35880  pridl  35881  ispridl2  35882  smprngopr  35896  ispridlc  35914