Theorem smprngopr 38012

Description: A simple ring (one whose only ideals are 0 and 𝑅) is a prime ring. (Contributed by Jeff Madsen, 6-Jan-2011.)

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 1136	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍 ∧ (Idl‘𝑅) = {{𝑍}, 𝑋}) → 𝑅 ∈ RingOps)
2		smprngpr.1	. . . . 5 ⊢ 𝐺 = (1st ‘𝑅)
3		smprngpr.4	. . . . 5 ⊢ 𝑍 = (GId‘𝐺)
4	2, 3	0idl 37985	. . . 4 ⊢ (𝑅 ∈ RingOps → {𝑍} ∈ (Idl‘𝑅))
5	4	3ad2ant1 1133	. . 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 37987	. . . . . . 7 ⊢ (𝑅 ∈ RingOps → (𝑍 = 𝑈 ↔ 𝑋 = {𝑍}))
10		eqcom 2747	. . . . . . 7 ⊢ (𝑈 = 𝑍 ↔ 𝑍 = 𝑈)
11		eqcom 2747	. . . . . . 7 ⊢ ({𝑍} = 𝑋 ↔ 𝑋 = {𝑍})
12	9, 10, 11	3bitr4g 314	. . . . . 6 ⊢ (𝑅 ∈ RingOps → (𝑈 = 𝑍 ↔ {𝑍} = 𝑋))
13	12	necon3bid 2991	. . . . 5 ⊢ (𝑅 ∈ RingOps → (𝑈 ≠ 𝑍 ↔ {𝑍} ≠ 𝑋))
14	13	biimpa 476	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → {𝑍} ≠ 𝑋)
15	14	3adant3 1132	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍 ∧ (Idl‘𝑅) = {{𝑍}, 𝑋}) → {𝑍} ≠ 𝑋)
16		df-pr 4651	. . . . . . . 8 ⊢ {{𝑍}, 𝑋} = ({{𝑍}} ∪ {𝑋})
17	16	eqeq2i 2753	. . . . . . 7 ⊢ ((Idl‘𝑅) = {{𝑍}, 𝑋} ↔ (Idl‘𝑅) = ({{𝑍}} ∪ {𝑋}))
18		eleq2 2833	. . . . . . . . 9 ⊢ ((Idl‘𝑅) = ({{𝑍}} ∪ {𝑋}) → (𝑖 ∈ (Idl‘𝑅) ↔ 𝑖 ∈ ({{𝑍}} ∪ {𝑋})))
19		eleq2 2833	. . . . . . . . 9 ⊢ ((Idl‘𝑅) = ({{𝑍}} ∪ {𝑋}) → (𝑗 ∈ (Idl‘𝑅) ↔ 𝑗 ∈ ({{𝑍}} ∪ {𝑋})))
20	18, 19	anbi12d 631	. . . . . . . 8 ⊢ ((Idl‘𝑅) = ({{𝑍}} ∪ {𝑋}) → ((𝑖 ∈ (Idl‘𝑅) ∧ 𝑗 ∈ (Idl‘𝑅)) ↔ (𝑖 ∈ ({{𝑍}} ∪ {𝑋}) ∧ 𝑗 ∈ ({{𝑍}} ∪ {𝑋}))))
21		elun 4176	. . . . . . . . . 10 ⊢ (𝑖 ∈ ({{𝑍}} ∪ {𝑋}) ↔ (𝑖 ∈ {{𝑍}} ∨ 𝑖 ∈ {𝑋}))
22		velsn 4664	. . . . . . . . . . 11 ⊢ (𝑖 ∈ {{𝑍}} ↔ 𝑖 = {𝑍})
23		velsn 4664	. . . . . . . . . . 11 ⊢ (𝑖 ∈ {𝑋} ↔ 𝑖 = 𝑋)
24	22, 23	orbi12i 913	. . . . . . . . . 10 ⊢ ((𝑖 ∈ {{𝑍}} ∨ 𝑖 ∈ {𝑋}) ↔ (𝑖 = {𝑍} ∨ 𝑖 = 𝑋))
25	21, 24	bitri 275	. . . . . . . . 9 ⊢ (𝑖 ∈ ({{𝑍}} ∪ {𝑋}) ↔ (𝑖 = {𝑍} ∨ 𝑖 = 𝑋))
26		elun 4176	. . . . . . . . . 10 ⊢ (𝑗 ∈ ({{𝑍}} ∪ {𝑋}) ↔ (𝑗 ∈ {{𝑍}} ∨ 𝑗 ∈ {𝑋}))
27		velsn 4664	. . . . . . . . . . 11 ⊢ (𝑗 ∈ {{𝑍}} ↔ 𝑗 = {𝑍})
28		velsn 4664	. . . . . . . . . . 11 ⊢ (𝑗 ∈ {𝑋} ↔ 𝑗 = 𝑋)
29	27, 28	orbi12i 913	. . . . . . . . . 10 ⊢ ((𝑗 ∈ {{𝑍}} ∨ 𝑗 ∈ {𝑋}) ↔ (𝑗 = {𝑍} ∨ 𝑗 = 𝑋))
30	26, 29	bitri 275	. . . . . . . . 9 ⊢ (𝑗 ∈ ({{𝑍}} ∪ {𝑋}) ↔ (𝑗 = {𝑍} ∨ 𝑗 = 𝑋))
31	25, 30	anbi12i 627	. . . . . . . 8 ⊢ ((𝑖 ∈ ({{𝑍}} ∪ {𝑋}) ∧ 𝑗 ∈ ({{𝑍}} ∪ {𝑋})) ↔ ((𝑖 = {𝑍} ∨ 𝑖 = 𝑋) ∧ (𝑗 = {𝑍} ∨ 𝑗 = 𝑋)))
32	20, 31	bitrdi 287	. . . . . . 7 ⊢ ((Idl‘𝑅) = ({{𝑍}} ∪ {𝑋}) → ((𝑖 ∈ (Idl‘𝑅) ∧ 𝑗 ∈ (Idl‘𝑅)) ↔ ((𝑖 = {𝑍} ∨ 𝑖 = 𝑋) ∧ (𝑗 = {𝑍} ∨ 𝑗 = 𝑋))))
33	17, 32	sylbi 217	. . . . . 6 ⊢ ((Idl‘𝑅) = {{𝑍}, 𝑋} → ((𝑖 ∈ (Idl‘𝑅) ∧ 𝑗 ∈ (Idl‘𝑅)) ↔ ((𝑖 = {𝑍} ∨ 𝑖 = 𝑋) ∧ (𝑗 = {𝑍} ∨ 𝑗 = 𝑋))))
34	33	3ad2ant3 1135	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍 ∧ (Idl‘𝑅) = {{𝑍}, 𝑋}) → ((𝑖 ∈ (Idl‘𝑅) ∧ 𝑗 ∈ (Idl‘𝑅)) ↔ ((𝑖 = {𝑍} ∨ 𝑖 = 𝑋) ∧ (𝑗 = {𝑍} ∨ 𝑗 = 𝑋))))
35		eqimss 4067	. . . . . . . . . . 11 ⊢ (𝑖 = {𝑍} → 𝑖 ⊆ {𝑍})
36	35	orcd 872	. . . . . . . . . 10 ⊢ (𝑖 = {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))
37	36	adantr 480	. . . . . . . . 9 ⊢ ((𝑖 = {𝑍} ∧ 𝑗 = {𝑍}) → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))
38	37	a1d 25	. . . . . . . 8 ⊢ ((𝑖 = {𝑍} ∧ 𝑗 = {𝑍}) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍})))
39	38	a1i 11	. . . . . . 7 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → ((𝑖 = {𝑍} ∧ 𝑗 = {𝑍}) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))))
40		eqimss 4067	. . . . . . . . . . 11 ⊢ (𝑗 = {𝑍} → 𝑗 ⊆ {𝑍})
41	40	olcd 873	. . . . . . . . . 10 ⊢ (𝑗 = {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))
42	41	adantl 481	. . . . . . . . 9 ⊢ ((𝑖 = 𝑋 ∧ 𝑗 = {𝑍}) → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))
43	42	a1d 25	. . . . . . . 8 ⊢ ((𝑖 = 𝑋 ∧ 𝑗 = {𝑍}) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍})))
44	43	a1i 11	. . . . . . 7 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → ((𝑖 = 𝑋 ∧ 𝑗 = {𝑍}) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))))
45	36	adantr 480	. . . . . . . . 9 ⊢ ((𝑖 = {𝑍} ∧ 𝑗 = 𝑋) → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))
46	45	a1d 25	. . . . . . . 8 ⊢ ((𝑖 = {𝑍} ∧ 𝑗 = 𝑋) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍})))
47	46	a1i 11	. . . . . . 7 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → ((𝑖 = {𝑍} ∧ 𝑗 = 𝑋) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))))
48	2	rneqi 5962	. . . . . . . . . . . . . 14 ⊢ ran 𝐺 = ran (1st ‘𝑅)
49	7, 48	eqtri 2768	. . . . . . . . . . . . 13 ⊢ 𝑋 = ran (1st ‘𝑅)
50	49, 6, 8	rngo1cl 37899	. . . . . . . . . . . 12 ⊢ (𝑅 ∈ RingOps → 𝑈 ∈ 𝑋)
51	50	adantr 480	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → 𝑈 ∈ 𝑋)
52	6, 49, 8	rngolidm 37897	. . . . . . . . . . . . . . . 16 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ∈ 𝑋) → (𝑈𝐻𝑈) = 𝑈)
53	50, 52	mpdan 686	. . . . . . . . . . . . . . 15 ⊢ (𝑅 ∈ RingOps → (𝑈𝐻𝑈) = 𝑈)
54	53	eleq1d 2829	. . . . . . . . . . . . . 14 ⊢ (𝑅 ∈ RingOps → ((𝑈𝐻𝑈) ∈ {𝑍} ↔ 𝑈 ∈ {𝑍}))
55	8	fvexi 6934	. . . . . . . . . . . . . . 15 ⊢ 𝑈 ∈ V
56	55	elsn 4663	. . . . . . . . . . . . . 14 ⊢ (𝑈 ∈ {𝑍} ↔ 𝑈 = 𝑍)
57	54, 56	bitrdi 287	. . . . . . . . . . . . 13 ⊢ (𝑅 ∈ RingOps → ((𝑈𝐻𝑈) ∈ {𝑍} ↔ 𝑈 = 𝑍))
58	57	necon3bbid 2984	. . . . . . . . . . . 12 ⊢ (𝑅 ∈ RingOps → (¬ (𝑈𝐻𝑈) ∈ {𝑍} ↔ 𝑈 ≠ 𝑍))
59	58	biimpar 477	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → ¬ (𝑈𝐻𝑈) ∈ {𝑍})
60		oveq1 7455	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑈 → (𝑥𝐻𝑦) = (𝑈𝐻𝑦))
61	60	eleq1d 2829	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑈 → ((𝑥𝐻𝑦) ∈ {𝑍} ↔ (𝑈𝐻𝑦) ∈ {𝑍}))
62	61	notbid 318	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑈 → (¬ (𝑥𝐻𝑦) ∈ {𝑍} ↔ ¬ (𝑈𝐻𝑦) ∈ {𝑍}))
63		oveq2 7456	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑈 → (𝑈𝐻𝑦) = (𝑈𝐻𝑈))
64	63	eleq1d 2829	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑈 → ((𝑈𝐻𝑦) ∈ {𝑍} ↔ (𝑈𝐻𝑈) ∈ {𝑍}))
65	64	notbid 318	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑈 → (¬ (𝑈𝐻𝑦) ∈ {𝑍} ↔ ¬ (𝑈𝐻𝑈) ∈ {𝑍}))
66	62, 65	rspc2ev 3648	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ 𝑋 ∧ 𝑈 ∈ 𝑋 ∧ ¬ (𝑈𝐻𝑈) ∈ {𝑍}) → ∃𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑋 ¬ (𝑥𝐻𝑦) ∈ {𝑍})
67	51, 51, 59, 66	syl3anc 1371	. . . . . . . . . 10 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → ∃𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑋 ¬ (𝑥𝐻𝑦) ∈ {𝑍})
68		rexnal2 3141	. . . . . . . . . 10 ⊢ (∃𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑋 ¬ (𝑥𝐻𝑦) ∈ {𝑍} ↔ ¬ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝐻𝑦) ∈ {𝑍})
69	67, 68	sylib 218	. . . . . . . . 9 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → ¬ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝐻𝑦) ∈ {𝑍})
70	69	pm2.21d 121	. . . . . . . 8 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍})))
71		raleq 3331	. . . . . . . . . 10 ⊢ (𝑖 = 𝑋 → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍}))
72		raleq 3331	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑋 → (∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} ↔ ∀𝑦 ∈ 𝑋 (𝑥𝐻𝑦) ∈ {𝑍}))
73	72	ralbidv 3184	. . . . . . . . . 10 ⊢ (𝑗 = 𝑋 → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝐻𝑦) ∈ {𝑍}))
74	71, 73	sylan9bb 509	. . . . . . . . 9 ⊢ ((𝑖 = 𝑋 ∧ 𝑗 = 𝑋) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝐻𝑦) ∈ {𝑍}))
75	74	imbi1d 341	. . . . . . . 8 ⊢ ((𝑖 = 𝑋 ∧ 𝑗 = 𝑋) → ((∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍})) ↔ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))))
76	70, 75	syl5ibrcom 247	. . . . . . 7 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → ((𝑖 = 𝑋 ∧ 𝑗 = 𝑋) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))))
77	39, 44, 47, 76	ccased 1039	. . . . . 6 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍) → (((𝑖 = {𝑍} ∨ 𝑖 = 𝑋) ∧ (𝑗 = {𝑍} ∨ 𝑗 = 𝑋)) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))))
78	77	3adant3 1132	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍 ∧ (Idl‘𝑅) = {{𝑍}, 𝑋}) → (((𝑖 = {𝑍} ∨ 𝑖 = 𝑋) ∧ (𝑗 = {𝑍} ∨ 𝑗 = 𝑋)) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))))
79	34, 78	sylbid 240	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍 ∧ (Idl‘𝑅) = {{𝑍}, 𝑋}) → ((𝑖 ∈ (Idl‘𝑅) ∧ 𝑗 ∈ (Idl‘𝑅)) → (∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍}))))
80	79	ralrimivv 3206	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍 ∧ (Idl‘𝑅) = {{𝑍}, 𝑋}) → ∀𝑖 ∈ (Idl‘𝑅)∀𝑗 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍})))
81	2, 6, 7	ispridl 37994	. . . 4 ⊢ (𝑅 ∈ RingOps → ({𝑍} ∈ (PrIdl‘𝑅) ↔ ({𝑍} ∈ (Idl‘𝑅) ∧ {𝑍} ≠ 𝑋 ∧ ∀𝑖 ∈ (Idl‘𝑅)∀𝑗 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍})))))
82	81	3ad2ant1 1133	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍 ∧ (Idl‘𝑅) = {{𝑍}, 𝑋}) → ({𝑍} ∈ (PrIdl‘𝑅) ↔ ({𝑍} ∈ (Idl‘𝑅) ∧ {𝑍} ≠ 𝑋 ∧ ∀𝑖 ∈ (Idl‘𝑅)∀𝑗 ∈ (Idl‘𝑅)(∀𝑥 ∈ 𝑖 ∀𝑦 ∈ 𝑗 (𝑥𝐻𝑦) ∈ {𝑍} → (𝑖 ⊆ {𝑍} ∨ 𝑗 ⊆ {𝑍})))))
83	5, 15, 80, 82	mpbir3and 1342	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍 ∧ (Idl‘𝑅) = {{𝑍}, 𝑋}) → {𝑍} ∈ (PrIdl‘𝑅))
84	2, 3	isprrngo 38010	. 2 ⊢ (𝑅 ∈ PrRing ↔ (𝑅 ∈ RingOps ∧ {𝑍} ∈ (PrIdl‘𝑅)))
85	1, 83, 84	sylanbrc 582	1 ⊢ ((𝑅 ∈ RingOps ∧ 𝑈 ≠ 𝑍 ∧ (Idl‘𝑅) = {{𝑍}, 𝑋}) → 𝑅 ∈ PrRing)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 846   ∧ w3a 1087   = wceq 1537   ∈ wcel 2108   ≠ wne 2946  ∀wral 3067  ∃wrex 3076   ∪ cun 3974   ⊆ wss 3976  {csn 4648  {cpr 4650  ran crn 5701  ‘cfv 6573  (class class class)co 7448  1^st c1st 8028  2^nd c2nd 8029  GIdcgi 30522  RingOpscrngo 37854  Idlcidl 37967  PrIdlcpridl 37968  PrRingcprrng 38006

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-ov 7451  df-1st 8030  df-2nd 8031  df-grpo 30525  df-gid 30526  df-ginv 30527  df-ablo 30577  df-ass 37803  df-exid 37805  df-mgmOLD 37809  df-sgrOLD 37821  df-mndo 37827  df-rngo 37855  df-idl 37970  df-pridl 37971  df-prrngo 38008

This theorem is referenced by:  divrngpr  38013