Theorem divrngidl 39154

Description: Obsolete theorem, use drngnidl 21561 instead. The only ideals in a division ring are the zero ideal and the unit ideal. (Contributed by Jeff Madsen, 10-Jun-2010.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypotheses

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

Assertion

Ref	Expression
divrngidl	⊢ (𝑅 ∈ DivRingOps → (Idl‘𝑅) = {{𝑍}, 𝑋})

Proof of Theorem divrngidl

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

Step	Hyp	Ref	Expression
1		divrngidl.1	. . 3 ⊢ 𝐺 = (1st ‘𝑅)
2		divrngidl.2	. . 3 ⊢ 𝐻 = (2nd ‘𝑅)
3		divrngidl.4	. . 3 ⊢ 𝑍 = (GId‘𝐺)
4		divrngidl.3	. . 3 ⊢ 𝑋 = ran 𝐺
5		eqid 2763	. . 3 ⊢ (GId‘𝐻) = (GId‘𝐻)
6	1, 2, 3, 4, 5	isdrngo2 39084	. 2 ⊢ (𝑅 ∈ DivRingOps ↔ (𝑅 ∈ RingOps ∧ ((GId‘𝐻) ≠ 𝑍 ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = (GId‘𝐻))))
7	1, 3	idl0cl 39144	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ RingOps ∧ 𝑖 ∈ (Idl‘𝑅)) → 𝑍 ∈ 𝑖)
8	7	adantr 486	. . . . . . . . . 10 ⊢ (((𝑅 ∈ RingOps ∧ 𝑖 ∈ (Idl‘𝑅)) ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = (GId‘𝐻)) → 𝑍 ∈ 𝑖)
9	3	fvexi 6922	. . . . . . . . . . . . 13 ⊢ 𝑍 ∈ V
10	9	snss 4745	. . . . . . . . . . . 12 ⊢ (𝑍 ∈ 𝑖 ↔ {𝑍} ⊆ 𝑖)
11		necom 3012	. . . . . . . . . . . 12 ⊢ (𝑖 ≠ {𝑍} ↔ {𝑍} ≠ 𝑖)
12		pssdifn0 4319	. . . . . . . . . . . . 13 ⊢ (({𝑍} ⊆ 𝑖 ∧ {𝑍} ≠ 𝑖) → (𝑖 ∖ {𝑍}) ≠ ∅)
13		n0 4303	. . . . . . . . . . . . 13 ⊢ ((𝑖 ∖ {𝑍}) ≠ ∅ ↔ ∃𝑧 𝑧 ∈ (𝑖 ∖ {𝑍}))
14	12, 13	sylib 221	. . . . . . . . . . . 12 ⊢ (({𝑍} ⊆ 𝑖 ∧ {𝑍} ≠ 𝑖) → ∃𝑧 𝑧 ∈ (𝑖 ∖ {𝑍}))
15	10, 11, 14	syl2anb 610	. . . . . . . . . . 11 ⊢ ((𝑍 ∈ 𝑖 ∧ 𝑖 ≠ {𝑍}) → ∃𝑧 𝑧 ∈ (𝑖 ∖ {𝑍}))
16	1, 4	idlss 39142	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑅 ∈ RingOps ∧ 𝑖 ∈ (Idl‘𝑅)) → 𝑖 ⊆ 𝑋)
17		ssdif 4083	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑖 ⊆ 𝑋 → (𝑖 ∖ {𝑍}) ⊆ (𝑋 ∖ {𝑍}))
18	17	sselda 3913	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑖 ⊆ 𝑋 ∧ 𝑧 ∈ (𝑖 ∖ {𝑍})) → 𝑧 ∈ (𝑋 ∖ {𝑍}))
19	16, 18	sylan 592	. . . . . . . . . . . . . . . 16 ⊢ (((𝑅 ∈ RingOps ∧ 𝑖 ∈ (Idl‘𝑅)) ∧ 𝑧 ∈ (𝑖 ∖ {𝑍})) → 𝑧 ∈ (𝑋 ∖ {𝑍}))
20		oveq2 7451	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 = 𝑧 → (𝑦𝐻𝑥) = (𝑦𝐻𝑧))
21	20	eqeq1d 2765	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑧 → ((𝑦𝐻𝑥) = (GId‘𝐻) ↔ (𝑦𝐻𝑧) = (GId‘𝐻)))
22	21	rexbidv 3190	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑧 → (∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = (GId‘𝐻) ↔ ∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑧) = (GId‘𝐻)))
23	22	rspcva 3578	. . . . . . . . . . . . . . . 16 ⊢ ((𝑧 ∈ (𝑋 ∖ {𝑍}) ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = (GId‘𝐻)) → ∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑧) = (GId‘𝐻))
24	19, 23	sylan 592	. . . . . . . . . . . . . . 15 ⊢ ((((𝑅 ∈ RingOps ∧ 𝑖 ∈ (Idl‘𝑅)) ∧ 𝑧 ∈ (𝑖 ∖ {𝑍})) ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = (GId‘𝐻)) → ∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑧) = (GId‘𝐻))
25		eldifi 4070	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑧 ∈ (𝑖 ∖ {𝑍}) → 𝑧 ∈ 𝑖)
26		eldifi 4070	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 ∈ (𝑋 ∖ {𝑍}) → 𝑦 ∈ 𝑋)
27	25, 26	anim12i 625	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑧 ∈ (𝑖 ∖ {𝑍}) ∧ 𝑦 ∈ (𝑋 ∖ {𝑍})) → (𝑧 ∈ 𝑖 ∧ 𝑦 ∈ 𝑋))
28	1, 2, 4	idllmulcl 39146	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑅 ∈ RingOps ∧ 𝑖 ∈ (Idl‘𝑅)) ∧ (𝑧 ∈ 𝑖 ∧ 𝑦 ∈ 𝑋)) → (𝑦𝐻𝑧) ∈ 𝑖)
29	1, 2, 4, 5	1idl 39152	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑅 ∈ RingOps ∧ 𝑖 ∈ (Idl‘𝑅)) → ((GId‘𝐻) ∈ 𝑖 ↔ 𝑖 = 𝑋))
30	29	biimpd 232	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑅 ∈ RingOps ∧ 𝑖 ∈ (Idl‘𝑅)) → ((GId‘𝐻) ∈ 𝑖 → 𝑖 = 𝑋))
31	30	adantr 486	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑅 ∈ RingOps ∧ 𝑖 ∈ (Idl‘𝑅)) ∧ (𝑧 ∈ 𝑖 ∧ 𝑦 ∈ 𝑋)) → ((GId‘𝐻) ∈ 𝑖 → 𝑖 = 𝑋))
32		eleq1 2852	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑦𝐻𝑧) = (GId‘𝐻) → ((𝑦𝐻𝑧) ∈ 𝑖 ↔ (GId‘𝐻) ∈ 𝑖))
33	32	imbi1d 344	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑦𝐻𝑧) = (GId‘𝐻) → (((𝑦𝐻𝑧) ∈ 𝑖 → 𝑖 = 𝑋) ↔ ((GId‘𝐻) ∈ 𝑖 → 𝑖 = 𝑋)))
34	31, 33	syl5ibrcom 250	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑅 ∈ RingOps ∧ 𝑖 ∈ (Idl‘𝑅)) ∧ (𝑧 ∈ 𝑖 ∧ 𝑦 ∈ 𝑋)) → ((𝑦𝐻𝑧) = (GId‘𝐻) → ((𝑦𝐻𝑧) ∈ 𝑖 → 𝑖 = 𝑋)))
35	28, 34	mpid 45	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑅 ∈ RingOps ∧ 𝑖 ∈ (Idl‘𝑅)) ∧ (𝑧 ∈ 𝑖 ∧ 𝑦 ∈ 𝑋)) → ((𝑦𝐻𝑧) = (GId‘𝐻) → 𝑖 = 𝑋))
36	27, 35	sylan2 605	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑅 ∈ RingOps ∧ 𝑖 ∈ (Idl‘𝑅)) ∧ (𝑧 ∈ (𝑖 ∖ {𝑍}) ∧ 𝑦 ∈ (𝑋 ∖ {𝑍}))) → ((𝑦𝐻𝑧) = (GId‘𝐻) → 𝑖 = 𝑋))
37	36	anassrs 473	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑅 ∈ RingOps ∧ 𝑖 ∈ (Idl‘𝑅)) ∧ 𝑧 ∈ (𝑖 ∖ {𝑍})) ∧ 𝑦 ∈ (𝑋 ∖ {𝑍})) → ((𝑦𝐻𝑧) = (GId‘𝐻) → 𝑖 = 𝑋))
38	37	rexlimdva 3167	. . . . . . . . . . . . . . . 16 ⊢ (((𝑅 ∈ RingOps ∧ 𝑖 ∈ (Idl‘𝑅)) ∧ 𝑧 ∈ (𝑖 ∖ {𝑍})) → (∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑧) = (GId‘𝐻) → 𝑖 = 𝑋))
39	38	imp 412	. . . . . . . . . . . . . . 15 ⊢ ((((𝑅 ∈ RingOps ∧ 𝑖 ∈ (Idl‘𝑅)) ∧ 𝑧 ∈ (𝑖 ∖ {𝑍})) ∧ ∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑧) = (GId‘𝐻)) → 𝑖 = 𝑋)
40	24, 39	syldan 603	. . . . . . . . . . . . . 14 ⊢ ((((𝑅 ∈ RingOps ∧ 𝑖 ∈ (Idl‘𝑅)) ∧ 𝑧 ∈ (𝑖 ∖ {𝑍})) ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = (GId‘𝐻)) → 𝑖 = 𝑋)
41	40	an32s 665	. . . . . . . . . . . . 13 ⊢ ((((𝑅 ∈ RingOps ∧ 𝑖 ∈ (Idl‘𝑅)) ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = (GId‘𝐻)) ∧ 𝑧 ∈ (𝑖 ∖ {𝑍})) → 𝑖 = 𝑋)
42	41	ex 418	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ RingOps ∧ 𝑖 ∈ (Idl‘𝑅)) ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = (GId‘𝐻)) → (𝑧 ∈ (𝑖 ∖ {𝑍}) → 𝑖 = 𝑋))
43	42	exlimdv 1968	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ RingOps ∧ 𝑖 ∈ (Idl‘𝑅)) ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = (GId‘𝐻)) → (∃𝑧 𝑧 ∈ (𝑖 ∖ {𝑍}) → 𝑖 = 𝑋))
44	15, 43	syl5 35	. . . . . . . . . 10 ⊢ (((𝑅 ∈ RingOps ∧ 𝑖 ∈ (Idl‘𝑅)) ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = (GId‘𝐻)) → ((𝑍 ∈ 𝑖 ∧ 𝑖 ≠ {𝑍}) → 𝑖 = 𝑋))
45	8, 44	mpand 708	. . . . . . . . 9 ⊢ (((𝑅 ∈ RingOps ∧ 𝑖 ∈ (Idl‘𝑅)) ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = (GId‘𝐻)) → (𝑖 ≠ {𝑍} → 𝑖 = 𝑋))
46	45	an32s 665	. . . . . . . 8 ⊢ (((𝑅 ∈ RingOps ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = (GId‘𝐻)) ∧ 𝑖 ∈ (Idl‘𝑅)) → (𝑖 ≠ {𝑍} → 𝑖 = 𝑋))
47		neor 3051	. . . . . . . 8 ⊢ ((𝑖 = {𝑍} ∨ 𝑖 = 𝑋) ↔ (𝑖 ≠ {𝑍} → 𝑖 = 𝑋))
48	46, 47	sylibr 237	. . . . . . 7 ⊢ (((𝑅 ∈ RingOps ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = (GId‘𝐻)) ∧ 𝑖 ∈ (Idl‘𝑅)) → (𝑖 = {𝑍} ∨ 𝑖 = 𝑋))
49	48	ex 418	. . . . . 6 ⊢ ((𝑅 ∈ RingOps ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = (GId‘𝐻)) → (𝑖 ∈ (Idl‘𝑅) → (𝑖 = {𝑍} ∨ 𝑖 = 𝑋)))
50	1, 3	0idl 39151	. . . . . . . . 9 ⊢ (𝑅 ∈ RingOps → {𝑍} ∈ (Idl‘𝑅))
51		eleq1 2852	. . . . . . . . 9 ⊢ (𝑖 = {𝑍} → (𝑖 ∈ (Idl‘𝑅) ↔ {𝑍} ∈ (Idl‘𝑅)))
52	50, 51	syl5ibrcom 250	. . . . . . . 8 ⊢ (𝑅 ∈ RingOps → (𝑖 = {𝑍} → 𝑖 ∈ (Idl‘𝑅)))
53	1, 4	rngoidl 39150	. . . . . . . . 9 ⊢ (𝑅 ∈ RingOps → 𝑋 ∈ (Idl‘𝑅))
54		eleq1 2852	. . . . . . . . 9 ⊢ (𝑖 = 𝑋 → (𝑖 ∈ (Idl‘𝑅) ↔ 𝑋 ∈ (Idl‘𝑅)))
55	53, 54	syl5ibrcom 250	. . . . . . . 8 ⊢ (𝑅 ∈ RingOps → (𝑖 = 𝑋 → 𝑖 ∈ (Idl‘𝑅)))
56	52, 55	jaod 873	. . . . . . 7 ⊢ (𝑅 ∈ RingOps → ((𝑖 = {𝑍} ∨ 𝑖 = 𝑋) → 𝑖 ∈ (Idl‘𝑅)))
57	56	adantr 486	. . . . . 6 ⊢ ((𝑅 ∈ RingOps ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = (GId‘𝐻)) → ((𝑖 = {𝑍} ∨ 𝑖 = 𝑋) → 𝑖 ∈ (Idl‘𝑅)))
58	49, 57	impbid 215	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = (GId‘𝐻)) → (𝑖 ∈ (Idl‘𝑅) ↔ (𝑖 = {𝑍} ∨ 𝑖 = 𝑋)))
59		vex 3458	. . . . . 6 ⊢ 𝑖 ∈ V
60	59	elpr 4609	. . . . 5 ⊢ (𝑖 ∈ {{𝑍}, 𝑋} ↔ (𝑖 = {𝑍} ∨ 𝑖 = 𝑋))
61	58, 60	bitr4di 292	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = (GId‘𝐻)) → (𝑖 ∈ (Idl‘𝑅) ↔ 𝑖 ∈ {{𝑍}, 𝑋}))
62	61	eqrdv 2761	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = (GId‘𝐻)) → (Idl‘𝑅) = {{𝑍}, 𝑋})
63	62	adantrl 729	. 2 ⊢ ((𝑅 ∈ RingOps ∧ ((GId‘𝐻) ≠ 𝑍 ∧ ∀𝑥 ∈ (𝑋 ∖ {𝑍})∃𝑦 ∈ (𝑋 ∖ {𝑍})(𝑦𝐻𝑥) = (GId‘𝐻))) → (Idl‘𝑅) = {{𝑍}, 𝑋})
64	6, 63	sylbi 220	1 ⊢ (𝑅 ∈ DivRingOps → (Idl‘𝑅) = {{𝑍}, 𝑋})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861   = wceq 1570  ∃wex 1812   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900   ∖ cdif 4048  ∅c0 4281  {csn 4588  {cpr 4590  ran crn 5656  ‘cfv 6558  (class class class)co 7443  1^st c1st 8023  2^nd c2nd 8024  GIdcgi 31122  RingOpscrngo 39020  DivRingOpscdrng 39074  Idlcidl 39133

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 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775

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 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7400  df-ov 7446  df-1st 8025  df-2nd 8026  df-1o 8504  df-en 9002  df-grpo 31125  df-gid 31126  df-ginv 31127  df-ablo 31177  df-ass 38969  df-exid 38971  df-mgmOLD 38975  df-sgrOLD 38987  df-mndo 38993  df-rngo 39021  df-drngo 39075  df-idl 39136

This theorem is used by:  divrngpr  39179  isfldidl  39194