Theorem smprngopr 39252

Description: Obsolete theorem, use smprngprmrng 49767 instead. A simple ring (one whose only ideals are 0 and 𝑅) is a prime ring. (Contributed by Jeff Madsen, 6-Jan-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypotheses

Ref	Expression
smprngpr.1	⊢ 𝐺 = (1st ‘𝑅)
smprngpr.2	⊢ 𝐻 = (2nd ‘𝑅)
smprngpr.3	⊢ 𝑋 = ran 𝐺
smprngpr.4	⊢ 𝑍 = (GId‘𝐺)
smprngpr.5	⊢ 𝑈 = (GId‘𝐻)

Assertion

Ref	Expression
smprngopr	⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍 ∧ (Idl‘𝑅) = {{𝑍}, 𝑋}) → 𝑅 ∈ PrRing)

Proof of Theorem smprngopr

Dummy variables 𝑖 𝑗 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp1 1154	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍 ∧ (Idl‘𝑅) = {{𝑍}, 𝑋}) → 𝑅 ∈ RingOps)
2		smprngpr.1	. . . . 5 ⊢ 𝐺 = (1st ‘𝑅)
3		smprngpr.4	. . . . 5 ⊢ 𝑍 = (GId‘𝐺)
4	2, 3	0idl 39225	. . . 4 ⊢ (𝑅 ∈ RingOps → {𝑍} ∈ (Idl‘𝑅))
5	4	3ad2ant1 1151	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍 ∧ (Idl‘𝑅) = {{𝑍}, 𝑋}) → {𝑍} ∈ (Idl‘𝑅))
6		smprngpr.2	. . . . . . . 8 ⊢ 𝐻 = (2nd ‘𝑅)
7		smprngpr.3	. . . . . . . 8 ⊢ 𝑋 = ran 𝐺
8		smprngpr.5	. . . . . . . 8 ⊢ 𝑈 = (GId‘𝐻)
9	2, 6, 7, 3, 8	0rngo 39227	. . . . . . 7 ⊢ (𝑅 ∈ RingOps → (𝑍 = 𝑈 ↔ 𝑋 = {𝑍}))
10		eqcom 2770	. . . . . . 7 ⊢ (𝑈 = 𝑍 ↔ 𝑍 = 𝑈)
11		eqcom 2770	. . . . . . 7 ⊢ ({𝑍} = 𝑋 ↔ 𝑋 = {𝑍})
12	9, 10, 11	3bitr4g 317	. . . . . 6 ⊢ (𝑅 ∈ RingOps → (𝑈 = 𝑍 ↔ {𝑍} = 𝑋))
13	12	necon3bid 3003	. . . . 5 ⊢ (𝑅 ∈ RingOps → (𝑈 ≠ 𝑍 ↔ {𝑍} ≠ 𝑋))
14	13	biimpa 482	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → {𝑍} ≠ 𝑋)
15	14	3adant3 1150	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍 ∧ (Idl‘𝑅) = {{𝑍}, 𝑋}) → {𝑍} ≠ 𝑋)
16		df-pr 4591	. . . . . . . 8 ⊢ {{𝑍}, 𝑋} = ({{𝑍}} ∪ {𝑋})
17	16	eqeq2i 2776	. . . . . . 7 ⊢ ((Idl‘𝑅) = {{𝑍}, 𝑋} ↔ (Idl‘𝑅) = ({{𝑍}} ∪ {𝑋}))
18		eleq2 2853	. . . . . . . . 9 ⊢ ((Idl‘𝑅) = ({{𝑍}} ∪ {𝑋}) → (𝑖 ∈ (Idl‘𝑅) ↔ 𝑖 ∈ ({{𝑍}} ∪ {𝑋})))
19		eleq2 2853	. . . . . . . . 9 ⊢ ((Idl‘𝑅) = ({{𝑍}} ∪ {𝑋}) → (𝑗 ∈ (Idl‘𝑅) ↔ 𝑗 ∈ ({{𝑍}} ∪ {𝑋})))
20	18, 19	anbi12d 644	. . . . . . . 8 ⊢ ((Idl‘𝑅) = ({{𝑍}} ∪ {𝑋}) → ((𝑖 ∈ (Idl‘𝑅) ∧ 𝑗 ∈ (Idl‘𝑅)) ↔ (𝑖 ∈ ({{𝑍}} ∪ {𝑋}) ∧ 𝑗 ∈ ({{𝑍}} ∪ {𝑋}))))
21		elun 4155	. . . . . . . . . 10 ⊢ (𝑖 ∈ ({{𝑍}} ∪ {𝑋}) ↔ (𝑖 ∈ {{𝑍}} ∨ 𝑖 ∈ {𝑋}))
22		velsn 4600	. . . . . . . . . . 11 ⊢ (𝑖 ∈ {{𝑍}} ↔ 𝑖 = {𝑍})
23		velsn 4600	. . . . . . . . . . 11 ⊢ (𝑖 ∈ {𝑋} ↔ 𝑖 = 𝑋)
24	22, 23	orbi12i 928	. . . . . . . . . 10 ⊢ ((𝑖 ∈ {{𝑍}} ∨ 𝑖 ∈ {𝑋}) ↔ (𝑖 = {𝑍} ∨ 𝑖 = 𝑋))
25	21, 24	bitri 278	. . . . . . . . 9 ⊢ (𝑖 ∈ ({{𝑍}} ∪ {𝑋}) ↔ (𝑖 = {𝑍} ∨ 𝑖 = 𝑋))
26		elun 4155	. . . . . . . . . 10 ⊢ (𝑗 ∈ ({{𝑍}} ∪ {𝑋}) ↔ (𝑗 ∈ {{𝑍}} ∨ 𝑗 ∈ {𝑋}))
27		velsn 4600	. . . . . . . . . . 11 ⊢ (𝑗 ∈ {{𝑍}} ↔ 𝑗 = {𝑍})
28		velsn 4600	. . . . . . . . . . 11 ⊢ (𝑗 ∈ {𝑋} ↔ 𝑗 = 𝑋)
29	27, 28	orbi12i 928	. . . . . . . . . 10 ⊢ ((𝑗 ∈ {{𝑍}} ∨ 𝑗 ∈ {𝑋}) ↔ (𝑗 = {𝑍} ∨ 𝑗 = 𝑋))
30	26, 29	bitri 278	. . . . . . . . 9 ⊢ (𝑗 ∈ ({{𝑍}} ∪ {𝑋}) ↔ (𝑗 = {𝑍} ∨ 𝑗 = 𝑋))
31	25, 30	anbi12i 640	. . . . . . . 8 ⊢ ((𝑖 ∈ ({{𝑍}} ∪ {𝑋}) ∧ 𝑗 ∈ ({{𝑍}} ∪ {𝑋})) ↔ ((𝑖 = {𝑍} ∨ 𝑖 = 𝑋) ∧ (𝑗 = {𝑍} ∨ 𝑗 = 𝑋)))
32	20, 31	bitrdi 290	. . . . . . 7 ⊢ ((Idl‘𝑅) = ({{𝑍}} ∪ {𝑋}) → ((𝑖 ∈ (Idl‘𝑅) ∧ 𝑗 ∈ (Idl‘𝑅)) ↔ ((𝑖 = {𝑍} ∨ 𝑖 = 𝑋) ∧ (𝑗 = {𝑍} ∨ 𝑗 = 𝑋))))
33	17, 32	sylbi 220	. . . . . 6 ⊢ ((Idl‘𝑅) = {{𝑍}, 𝑋} → ((𝑖 ∈ (Idl‘𝑅) ∧ 𝑗 ∈ (Idl‘𝑅)) ↔ ((𝑖 = {𝑍} ∨ 𝑖 = 𝑋) ∧ (𝑗 = {𝑍} ∨ 𝑗 = 𝑋))))
34	33	3ad2ant3 1153	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍 ∧ (Idl‘𝑅) = {{𝑍}, 𝑋}) → ((𝑖 ∈ (Idl‘𝑅) ∧ 𝑗 ∈ (Idl‘𝑅)) ↔ ((𝑖 = {𝑍} ∨ 𝑖 = 𝑋) ∧ (𝑗 = {𝑍} ∨ 𝑗 = 𝑋))))
35		eqimss 3971	. . . . . . . . . . 11 ⊢ (𝑖 = {𝑍} → 𝑖 ⊆ {𝑍})
36	35	orcd 887	. . . . . . . . . 10 ⊢ (𝑖 = {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))
37	36	adantr 486	. . . . . . . . 9 ⊢ ((𝑖 = {𝑍} ∧ 𝑗 = {𝑍}) → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))
38	37	a1d 26	. . . . . . . 8 ⊢ ((𝑖 = {𝑍} ∧ 𝑗 = {𝑍}) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍})))
39	38	a1i 11	. . . . . . 7 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → ((𝑖 = {𝑍} ∧ 𝑗 = {𝑍}) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))))
40		eqimss 3971	. . . . . . . . . . 11 ⊢ (𝑗 = {𝑍} → 𝑗 ⊆ {𝑍})
41	40	olcd 888	. . . . . . . . . 10 ⊢ (𝑗 = {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))
42	41	adantl 487	. . . . . . . . 9 ⊢ ((𝑖 = 𝑋 ∧ 𝑗 = {𝑍}) → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))
43	42	a1d 26	. . . . . . . 8 ⊢ ((𝑖 = 𝑋 ∧ 𝑗 = {𝑍}) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍})))
44	43	a1i 11	. . . . . . 7 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → ((𝑖 = 𝑋 ∧ 𝑗 = {𝑍}) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))))
45	36	adantr 486	. . . . . . . . 9 ⊢ ((𝑖 = {𝑍} ∧ 𝑗 = 𝑋) → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))
46	45	a1d 26	. . . . . . . 8 ⊢ ((𝑖 = {𝑍} ∧ 𝑗 = 𝑋) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍})))
47	46	a1i 11	. . . . . . 7 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → ((𝑖 = {𝑍} ∧ 𝑗 = 𝑋) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))))
48	2	rneqi 5931	. . . . . . . . . . . . . 14 ⊢ ran 𝐺 = ran (1st ‘𝑅)
49	7, 48	eqtri 2786	. . . . . . . . . . . . 13 ⊢ 𝑋 = ran (1st ‘𝑅)
50	49, 6, 8	rngo1cl 39139	. . . . . . . . . . . 12 ⊢ (𝑅 ∈ RingOps → 𝑈 ∈ 𝑋)
51	50	adantr 486	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → 𝑈 ∈ 𝑋)
52	6, 49, 8	rngolidm 39137	. . . . . . . . . . . . . . . 16 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ∈ 𝑋) → (𝑈𝐻𝑈) = 𝑈)
53	50, 52	mpdan 700	. . . . . . . . . . . . . . 15 ⊢ (𝑅 ∈ RingOps → (𝑈𝐻𝑈) = 𝑈)
54	53	eleq1d 2849	. . . . . . . . . . . . . 14 ⊢ (𝑅 ∈ RingOps → ((𝑈𝐻𝑈) ∈ {𝑍} ↔ 𝑈 ∈ {𝑍}))
55	8	fvexi 6930	. . . . . . . . . . . . . . 15 ⊢ 𝑈 ∈ V
56	55	elsn 4599	. . . . . . . . . . . . . 14 ⊢ (𝑈 ∈ {𝑍} ↔ 𝑈 = 𝑍)
57	54, 56	bitrdi 290	. . . . . . . . . . . . 13 ⊢ (𝑅 ∈ RingOps → ((𝑈𝐻𝑈) ∈ {𝑍} ↔ 𝑈 = 𝑍))
58	57	necon3bbid 2996	. . . . . . . . . . . 12 ⊢ (𝑅 ∈ RingOps → (¬ (𝑈𝐻𝑈) ∈ {𝑍} ↔ 𝑈 ≠ 𝑍))
59	58	biimpar 483	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → ¬ (𝑈𝐻𝑈) ∈ {𝑍})
60		oveq1 7458	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑈 → (𝑥𝐻𝑦) = (𝑈𝐻𝑦))
61	60	eleq1d 2849	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑈 → ((𝑥𝐻𝑦) ∈ {𝑍} ↔ (𝑈𝐻𝑦) ∈ {𝑍}))
62	61	notbid 321	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑈 → (¬ (𝑥𝐻𝑦) ∈ {𝑍} ↔ ¬ (𝑈𝐻𝑦) ∈ {𝑍}))
63		oveq2 7459	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑈 → (𝑈𝐻𝑦) = (𝑈𝐻𝑈))
64	63	eleq1d 2849	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑈 → ((𝑈𝐻𝑦) ∈ {𝑍} ↔ (𝑈𝐻𝑈) ∈ {𝑍}))
65	64	notbid 321	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑈 → (¬ (𝑈𝐻𝑦) ∈ {𝑍} ↔ ¬ (𝑈𝐻𝑈) ∈ {𝑍}))
66	62, 65	rspc2ev 3592	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ 𝑋 ∧ 𝑈 ∈ 𝑋 ∧ ¬ (𝑈𝐻𝑈) ∈ {𝑍}) → ∃𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑋 ¬ (𝑥𝐻𝑦) ∈ {𝑍})
67	51, 51, 59, 66	syl3anc 1399	. . . . . . . . . 10 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → ∃𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑋 ¬ (𝑥𝐻𝑦) ∈ {𝑍})
68		rexnal2 3148	. . . . . . . . . 10 ⊢ (∃𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑋 ¬ (𝑥𝐻𝑦) ∈ {𝑍} ↔ ¬ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝐻𝑦) ∈ {𝑍})
69	67, 68	sylib 221	. . . . . . . . 9 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → ¬ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝐻𝑦) ∈ {𝑍})
70	69	pm2.21d 122	. . . . . . . 8 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍})))
71		raleq 3320	. . . . . . . . . 10 ⊢ (𝑖 = 𝑋 → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍}))
72		raleq 3320	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑋 → (∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} ↔ ∀𝑦 ∈ 𝑋 (𝑥𝐻𝑦) ∈ {𝑍}))
73	72	ralbidv 3189	. . . . . . . . . 10 ⊢ (𝑗 = 𝑋 → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝐻𝑦) ∈ {𝑍}))
74	71, 73	sylan9bb 519	. . . . . . . . 9 ⊢ ((𝑖 = 𝑋 ∧ 𝑗 = 𝑋) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝐻𝑦) ∈ {𝑍}))
75	74	imbi1d 344	. . . . . . . 8 ⊢ ((𝑖 = 𝑋 ∧ 𝑗 = 𝑋) → ((∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍})) ↔ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))))
76	70, 75	syl5ibrcom 250	. . . . . . 7 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → ((𝑖 = 𝑋 ∧ 𝑗 = 𝑋) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))))
77	39, 44, 47, 76	ccased 1054	. . . . . 6 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → (((𝑖 = {𝑍} ∨ 𝑖 = 𝑋) ∧ (𝑗 = {𝑍} ∨ 𝑗 = 𝑋)) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))))
78	77	3adant3 1150	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍 ∧ (Idl‘𝑅) = {{𝑍}, 𝑋}) → (((𝑖 = {𝑍} ∨ 𝑖 = 𝑋) ∧ (𝑗 = {𝑍} ∨ 𝑗 = 𝑋)) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))))
79	34, 78	sylbid 243	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍 ∧ (Idl‘𝑅) = {{𝑍}, 𝑋}) → ((𝑖 ∈ (Idl‘𝑅) ∧ 𝑗 ∈ (Idl‘𝑅)) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))))
80	79	ralrimivv 3207	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍 ∧ (Idl‘𝑅) = {{𝑍}, 𝑋}) → ∀𝑖 ∈ (Idl‘𝑅)∀𝑗 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍})))
81	2, 6, 7	ispridl 39234	. . . 4 ⊢ (𝑅 ∈ RingOps → ({𝑍} ∈ (PrIdl‘𝑅) ↔ ({𝑍} ∈ (Idl‘𝑅) ∧ {𝑍} ≠ 𝑋 ∧ ∀𝑖 ∈ (Idl‘𝑅)∀𝑗 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍})))))
82	81	3ad2ant1 1151	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍 ∧ (Idl‘𝑅) = {{𝑍}, 𝑋}) → ({𝑍} ∈ (PrIdl‘𝑅) ↔ ({𝑍} ∈ (Idl‘𝑅) ∧ {𝑍} ≠ 𝑋 ∧ ∀𝑖 ∈ (Idl‘𝑅)∀𝑗 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍})))))
83	5, 15, 80, 82	mpbir3and 1361	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍 ∧ (Idl‘𝑅) = {{𝑍}, 𝑋}) → {𝑍} ∈ (PrIdl‘𝑅))
84	2, 3	isprrngo 39250	. 2 ⊢ (𝑅 ∈ PrRing ↔ (𝑅 ∈ RingOps ∧ {𝑍} ∈ (PrIdl‘𝑅)))
85	1, 83, 84	sylanbrc 595	1 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍 ∧ (Idl‘𝑅) = {{𝑍}, 𝑋}) → 𝑅 ∈ PrRing)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900   ∪ cun 4152  {csn 4588  {cpr 4590  ran crn 5659  ‘cfv 6566  (class class class)co 7451  1^st c1st 8033  2^nd c2nd 8034  GIdcgi 31149  RingOpscrngo 39094  Idlcidl 39207  PrIdlcpridl 39208  PrRingcprrng 39246

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-1st 8035  df-2nd 8036  df-grpo 31152  df-gid 31153  df-ginv 31154  df-ablo 31204  df-ass 39043  df-exid 39045  df-mgmOLD 39049  df-sgrOLD 39061  df-mndo 39067  df-rngo 39095  df-idl 39210  df-pridl 39211  df-prrngo 39248

This theorem is used by:  divrngpr  39253