pridlidl - Mathbox for Jeff Madsen

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

Theorem pridlidl 38024

Description: A prime ideal is an ideal. (Contributed by Jeff Madsen, 19-Jun-2010.)

**Assertion**
Ref	Expression
pridlidl	⊢ ((𝑅 ∈ RingOps ∧ 𝑃 ∈ (PrIdl‘𝑅)) → 𝑃 ∈ (Idl‘𝑅))

Proof of Theorem pridlidl Dummy variables 𝑥 𝑦 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2730	. . . 4 ⊢ (1^st ‘𝑅) = (1^st ‘𝑅)
2		eqid 2730	. . . 4 ⊢ (2^nd ‘𝑅) = (2^nd ‘𝑅)
3		eqid 2730	. . . 4 ⊢ ran (1^st ‘𝑅) = ran (1^st ‘𝑅)
4	1, 2, 3	ispridl 38023	. . 3 ⊢ (𝑅 ∈ RingOps → (𝑃 ∈ (PrIdl‘𝑅) ↔ (𝑃 ∈ (Idl‘𝑅) ∧ 𝑃 ≠ ran (1^st ‘𝑅) ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥(2^nd ‘𝑅)𝑦) ∈ 𝑃 → (𝑎 ⊆ 𝑃 ∨ 𝑏 ⊆ 𝑃)))))
5		3anass 1094	. . 3 ⊢ ((𝑃 ∈ (Idl‘𝑅) ∧ 𝑃 ≠ ran (1^st ‘𝑅) ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥(2^nd ‘𝑅)𝑦) ∈ 𝑃 → (𝑎 ⊆ 𝑃 ∨ 𝑏 ⊆ 𝑃))) ↔ (𝑃 ∈ (Idl‘𝑅) ∧ (𝑃 ≠ ran (1^st ‘𝑅) ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥(2^nd ‘𝑅)𝑦) ∈ 𝑃 → (𝑎 ⊆ 𝑃 ∨ 𝑏 ⊆ 𝑃)))))
6	4, 5	bitrdi 287	. 2 ⊢ (𝑅 ∈ RingOps → (𝑃 ∈ (PrIdl‘𝑅) ↔ (𝑃 ∈ (Idl‘𝑅) ∧ (𝑃 ≠ ran (1^st ‘𝑅) ∧ ∀𝑎 ∈ (Idl‘𝑅)∀𝑏 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 (𝑥(2^nd ‘𝑅)𝑦) ∈ 𝑃 → (𝑎 ⊆ 𝑃 ∨ 𝑏 ⊆ 𝑃))))))
7	6	simprbda 498	1 ⊢ ((𝑅 ∈ RingOps ∧ 𝑃 ∈ (PrIdl‘𝑅)) → 𝑃 ∈ (Idl‘𝑅))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∨ wo 847 ∧ w3a 1086 ∈ wcel 2109 ≠ wne 2926 ∀wral 3045 ⊆ wss 3916 ran crn 5641 ‘cfv 6513 (class class class)co 7389 1^st c1st 7968 2^nd c2nd 7969 RingOpscrngo 37883 Idlcidl 37996 PrIdlcpridl 37997

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5253 ax-nul 5263 ax-pr 5389

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-dif 3919 df-un 3921 df-in 3923 df-ss 3933 df-nul 4299 df-if 4491 df-pw 4567 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-br 5110 df-opab 5172 df-mpt 5191 df-id 5535 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-iota 6466 df-fun 6515 df-fv 6521 df-ov 7392 df-pridl 38000

This theorem is referenced by: (None)

W3C validator