isdrngd - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > isdrngd		Structured version Visualization version GIF version

Theorem isdrngd 20662

Description: Properties that characterize a division ring among rings: it should be nonzero, have no nonzero zero-divisors, and every nonzero element 𝑥 should have a left-inverse 𝐼(𝑥). See isdrngrd 20663 for the characterization using right-inverses. (Contributed by NM, 2-Aug-2013.) Remove hypothesis. (Revised by SN, 19-Feb-2025.)

**Hypotheses**
Ref	Expression
isdrngd.b	⊢ (𝜑 → 𝐵 = (Base‘𝑅))
isdrngd.t	⊢ (𝜑 → · = (._r‘𝑅))
isdrngd.z	⊢ (𝜑 → 0 = (0_g‘𝑅))
isdrngd.u	⊢ (𝜑 → 1 = (1_r‘𝑅))
isdrngd.r	⊢ (𝜑 → 𝑅 ∈ Ring)
isdrngd.n	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 ) ∧ (𝑦 ∈ 𝐵 ∧ 𝑦 ≠ 0 )) → (𝑥 · 𝑦) ≠ 0 )
isdrngd.o	⊢ (𝜑 → 1 ≠ 0 )
isdrngd.i	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 )) → 𝐼 ∈ 𝐵)
isdrngd.k	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 )) → (𝐼 · 𝑥) = 1 )

**Assertion**
Ref	Expression
isdrngd	⊢ (𝜑 → 𝑅 ∈ DivRing)

Distinct variable groups: 𝑥,𝑦, 0 𝑥, 1 ,𝑦 𝑥,𝐵,𝑦 𝑦,𝐼 𝑥,𝑅,𝑦 𝜑,𝑥,𝑦 𝑥, · ,𝑦 Allowed substitution hint: 𝐼(𝑥)

Proof of Theorem isdrngd Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		isdrngd.r	. . 3 ⊢ (𝜑 → 𝑅 ∈ Ring)
2		difss 4130	. . . . . 6 ⊢ (𝐵 ∖ { 0 }) ⊆ 𝐵
3		isdrngd.b	. . . . . 6 ⊢ (𝜑 → 𝐵 = (Base‘𝑅))
4	2, 3	sseqtrid 4032	. . . . 5 ⊢ (𝜑 → (𝐵 ∖ { 0 }) ⊆ (Base‘𝑅))
5		eqid 2727	. . . . . 6 ⊢ ((mulGrp‘𝑅) ↾_s (𝐵 ∖ { 0 })) = ((mulGrp‘𝑅) ↾_s (𝐵 ∖ { 0 }))
6		eqid 2727	. . . . . . 7 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅)
7		eqid 2727	. . . . . . 7 ⊢ (Base‘𝑅) = (Base‘𝑅)
8	6, 7	mgpbas 20085	. . . . . 6 ⊢ (Base‘𝑅) = (Base‘(mulGrp‘𝑅))
9	5, 8	ressbas2 17223	. . . . 5 ⊢ ((𝐵 ∖ { 0 }) ⊆ (Base‘𝑅) → (𝐵 ∖ { 0 }) = (Base‘((mulGrp‘𝑅) ↾_s (𝐵 ∖ { 0 }))))
10	4, 9	syl 17	. . . 4 ⊢ (𝜑 → (𝐵 ∖ { 0 }) = (Base‘((mulGrp‘𝑅) ↾_s (𝐵 ∖ { 0 }))))
11		isdrngd.t	. . . . 5 ⊢ (𝜑 → · = (._r‘𝑅))
12		fvex 6913	. . . . . . 7 ⊢ (Base‘𝑅) ∈ V
13	3, 12	eqeltrdi 2836	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ V)
14		difexg 5331	. . . . . 6 ⊢ (𝐵 ∈ V → (𝐵 ∖ { 0 }) ∈ V)
15		eqid 2727	. . . . . . . 8 ⊢ (._r‘𝑅) = (._r‘𝑅)
16	6, 15	mgpplusg 20083	. . . . . . 7 ⊢ (._r‘𝑅) = (+_g‘(mulGrp‘𝑅))
17	5, 16	ressplusg 17276	. . . . . 6 ⊢ ((𝐵 ∖ { 0 }) ∈ V → (._r‘𝑅) = (+_g‘((mulGrp‘𝑅) ↾_s (𝐵 ∖ { 0 }))))
18	13, 14, 17	3syl 18	. . . . 5 ⊢ (𝜑 → (._r‘𝑅) = (+_g‘((mulGrp‘𝑅) ↾_s (𝐵 ∖ { 0 }))))
19	11, 18	eqtrd 2767	. . . 4 ⊢ (𝜑 → · = (+_g‘((mulGrp‘𝑅) ↾_s (𝐵 ∖ { 0 }))))
20		eldifsn 4793	. . . . 5 ⊢ (𝑥 ∈ (𝐵 ∖ { 0 }) ↔ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 ))
21		eldifsn 4793	. . . . . 6 ⊢ (𝑦 ∈ (𝐵 ∖ { 0 }) ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 ≠ 0 ))
22	7, 15	ringcl 20195	. . . . . . . . . . . . 13 ⊢ ((𝑅 ∈ Ring ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑥(._r‘𝑅)𝑦) ∈ (Base‘𝑅))
23	1, 22	syl3an1 1160	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑥(._r‘𝑅)𝑦) ∈ (Base‘𝑅))
24	23	3expib 1119	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑥(._r‘𝑅)𝑦) ∈ (Base‘𝑅)))
25	3	eleq2d 2814	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↔ 𝑥 ∈ (Base‘𝑅)))
26	3	eleq2d 2814	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ (Base‘𝑅)))
27	25, 26	anbi12d 630	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ↔ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))))
28	11	oveqd 7441	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑥 · 𝑦) = (𝑥(._r‘𝑅)𝑦))
29	28, 3	eleq12d 2822	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑥 · 𝑦) ∈ 𝐵 ↔ (𝑥(._r‘𝑅)𝑦) ∈ (Base‘𝑅)))
30	24, 27, 29	3imtr4d 293	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 · 𝑦) ∈ 𝐵))
31	30	3impib 1113	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 · 𝑦) ∈ 𝐵)
32	31	3adant2r 1176	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 ) ∧ 𝑦 ∈ 𝐵) → (𝑥 · 𝑦) ∈ 𝐵)
33	32	3adant3r 1178	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 ) ∧ (𝑦 ∈ 𝐵 ∧ 𝑦 ≠ 0 )) → (𝑥 · 𝑦) ∈ 𝐵)
34		isdrngd.n	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 ) ∧ (𝑦 ∈ 𝐵 ∧ 𝑦 ≠ 0 )) → (𝑥 · 𝑦) ≠ 0 )
35		eldifsn 4793	. . . . . . 7 ⊢ ((𝑥 · 𝑦) ∈ (𝐵 ∖ { 0 }) ↔ ((𝑥 · 𝑦) ∈ 𝐵 ∧ (𝑥 · 𝑦) ≠ 0 ))
36	33, 34, 35	sylanbrc 581	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 ) ∧ (𝑦 ∈ 𝐵 ∧ 𝑦 ≠ 0 )) → (𝑥 · 𝑦) ∈ (𝐵 ∖ { 0 }))
37	21, 36	syl3an3b 1402	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 ) ∧ 𝑦 ∈ (𝐵 ∖ { 0 })) → (𝑥 · 𝑦) ∈ (𝐵 ∖ { 0 }))
38	20, 37	syl3an2b 1401	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ { 0 }) ∧ 𝑦 ∈ (𝐵 ∖ { 0 })) → (𝑥 · 𝑦) ∈ (𝐵 ∖ { 0 }))
39	7, 15	ringass 20198	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅) ∧ 𝑧 ∈ (Base‘𝑅))) → ((𝑥(._r‘𝑅)𝑦)(._r‘𝑅)𝑧) = (𝑥(._r‘𝑅)(𝑦(._r‘𝑅)𝑧)))
40	39	ex 411	. . . . . . 7 ⊢ (𝑅 ∈ Ring → ((𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅) ∧ 𝑧 ∈ (Base‘𝑅)) → ((𝑥(._r‘𝑅)𝑦)(._r‘𝑅)𝑧) = (𝑥(._r‘𝑅)(𝑦(._r‘𝑅)𝑧))))
41	1, 40	syl 17	. . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅) ∧ 𝑧 ∈ (Base‘𝑅)) → ((𝑥(._r‘𝑅)𝑦)(._r‘𝑅)𝑧) = (𝑥(._r‘𝑅)(𝑦(._r‘𝑅)𝑧))))
42	3	eleq2d 2814	. . . . . . 7 ⊢ (𝜑 → (𝑧 ∈ 𝐵 ↔ 𝑧 ∈ (Base‘𝑅)))
43	25, 26, 42	3anbi123d 1432	. . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ↔ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅) ∧ 𝑧 ∈ (Base‘𝑅))))
44		eqidd 2728	. . . . . . . 8 ⊢ (𝜑 → 𝑧 = 𝑧)
45	11, 28, 44	oveq123d 7445	. . . . . . 7 ⊢ (𝜑 → ((𝑥 · 𝑦) · 𝑧) = ((𝑥(._r‘𝑅)𝑦)(._r‘𝑅)𝑧))
46		eqidd 2728	. . . . . . . 8 ⊢ (𝜑 → 𝑥 = 𝑥)
47	11	oveqd 7441	. . . . . . . 8 ⊢ (𝜑 → (𝑦 · 𝑧) = (𝑦(._r‘𝑅)𝑧))
48	11, 46, 47	oveq123d 7445	. . . . . . 7 ⊢ (𝜑 → (𝑥 · (𝑦 · 𝑧)) = (𝑥(._r‘𝑅)(𝑦(._r‘𝑅)𝑧)))
49	45, 48	eqeq12d 2743	. . . . . 6 ⊢ (𝜑 → (((𝑥 · 𝑦) · 𝑧) = (𝑥 · (𝑦 · 𝑧)) ↔ ((𝑥(._r‘𝑅)𝑦)(._r‘𝑅)𝑧) = (𝑥(._r‘𝑅)(𝑦(._r‘𝑅)𝑧))))
50	41, 43, 49	3imtr4d 293	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → ((𝑥 · 𝑦) · 𝑧) = (𝑥 · (𝑦 · 𝑧))))
51		eldifi 4125	. . . . . 6 ⊢ (𝑥 ∈ (𝐵 ∖ { 0 }) → 𝑥 ∈ 𝐵)
52		eldifi 4125	. . . . . 6 ⊢ (𝑦 ∈ (𝐵 ∖ { 0 }) → 𝑦 ∈ 𝐵)
53		eldifi 4125	. . . . . 6 ⊢ (𝑧 ∈ (𝐵 ∖ { 0 }) → 𝑧 ∈ 𝐵)
54	51, 52, 53	3anim123i 1148	. . . . 5 ⊢ ((𝑥 ∈ (𝐵 ∖ { 0 }) ∧ 𝑦 ∈ (𝐵 ∖ { 0 }) ∧ 𝑧 ∈ (𝐵 ∖ { 0 })) → (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵))
55	50, 54	impel 504	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝐵 ∖ { 0 }) ∧ 𝑦 ∈ (𝐵 ∖ { 0 }) ∧ 𝑧 ∈ (𝐵 ∖ { 0 }))) → ((𝑥 · 𝑦) · 𝑧) = (𝑥 · (𝑦 · 𝑧)))
56		eqid 2727	. . . . . . . 8 ⊢ (1_r‘𝑅) = (1_r‘𝑅)
57	7, 56	ringidcl 20207	. . . . . . 7 ⊢ (𝑅 ∈ Ring → (1_r‘𝑅) ∈ (Base‘𝑅))
58	1, 57	syl 17	. . . . . 6 ⊢ (𝜑 → (1_r‘𝑅) ∈ (Base‘𝑅))
59		isdrngd.u	. . . . . 6 ⊢ (𝜑 → 1 = (1_r‘𝑅))
60	58, 59, 3	3eltr4d 2843	. . . . 5 ⊢ (𝜑 → 1 ∈ 𝐵)
61		isdrngd.o	. . . . 5 ⊢ (𝜑 → 1 ≠ 0 )
62		eldifsn 4793	. . . . 5 ⊢ ( 1 ∈ (𝐵 ∖ { 0 }) ↔ ( 1 ∈ 𝐵 ∧ 1 ≠ 0 ))
63	60, 61, 62	sylanbrc 581	. . . 4 ⊢ (𝜑 → 1 ∈ (𝐵 ∖ { 0 }))
64	7, 15, 56	ringlidm 20210	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ 𝑥 ∈ (Base‘𝑅)) → ((1_r‘𝑅)(._r‘𝑅)𝑥) = 𝑥)
65	64	ex 411	. . . . . . . . 9 ⊢ (𝑅 ∈ Ring → (𝑥 ∈ (Base‘𝑅) → ((1_r‘𝑅)(._r‘𝑅)𝑥) = 𝑥))
66	1, 65	syl 17	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ (Base‘𝑅) → ((1_r‘𝑅)(._r‘𝑅)𝑥) = 𝑥))
67	11, 59, 46	oveq123d 7445	. . . . . . . . 9 ⊢ (𝜑 → ( 1 · 𝑥) = ((1_r‘𝑅)(._r‘𝑅)𝑥))
68	67	eqeq1d 2729	. . . . . . . 8 ⊢ (𝜑 → (( 1 · 𝑥) = 𝑥 ↔ ((1_r‘𝑅)(._r‘𝑅)𝑥) = 𝑥))
69	66, 25, 68	3imtr4d 293	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐵 → ( 1 · 𝑥) = 𝑥))
70	69	imp 405	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ( 1 · 𝑥) = 𝑥)
71	70	adantrr 715	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 )) → ( 1 · 𝑥) = 𝑥)
72	20, 71	sylan2b 592	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ { 0 })) → ( 1 · 𝑥) = 𝑥)
73		isdrngd.i	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 )) → 𝐼 ∈ 𝐵)
74	61	adantr 479	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 )) → 1 ≠ 0 )
75		simpr 483	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 )) ∧ 𝐼 = 0 ) → 𝐼 = 0 )
76	75	oveq1d 7439	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 )) ∧ 𝐼 = 0 ) → (𝐼 · 𝑥) = ( 0 · 𝑥))
77		isdrngd.k	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 )) → (𝐼 · 𝑥) = 1 )
78	77	adantr 479	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 )) ∧ 𝐼 = 0 ) → (𝐼 · 𝑥) = 1 )
79	25	biimpa 475	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ (Base‘𝑅))
80	79	adantrr 715	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 )) → 𝑥 ∈ (Base‘𝑅))
81		eqid 2727	. . . . . . . . . . . 12 ⊢ (0_g‘𝑅) = (0_g‘𝑅)
82	7, 15, 81	ringlz 20234	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ Ring ∧ 𝑥 ∈ (Base‘𝑅)) → ((0_g‘𝑅)(._r‘𝑅)𝑥) = (0_g‘𝑅))
83	1, 80, 82	syl2an2r 683	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 )) → ((0_g‘𝑅)(._r‘𝑅)𝑥) = (0_g‘𝑅))
84		isdrngd.z	. . . . . . . . . . . 12 ⊢ (𝜑 → 0 = (0_g‘𝑅))
85	11, 84, 46	oveq123d 7445	. . . . . . . . . . 11 ⊢ (𝜑 → ( 0 · 𝑥) = ((0_g‘𝑅)(._r‘𝑅)𝑥))
86	85	adantr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 )) → ( 0 · 𝑥) = ((0_g‘𝑅)(._r‘𝑅)𝑥))
87	84	adantr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 )) → 0 = (0_g‘𝑅))
88	83, 86, 87	3eqtr4d 2777	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 )) → ( 0 · 𝑥) = 0 )
89	88	adantr 479	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 )) ∧ 𝐼 = 0 ) → ( 0 · 𝑥) = 0 )
90	76, 78, 89	3eqtr3d 2775	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 )) ∧ 𝐼 = 0 ) → 1 = 0 )
91	74, 90	mteqand 3029	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 )) → 𝐼 ≠ 0 )
92		eldifsn 4793	. . . . . 6 ⊢ (𝐼 ∈ (𝐵 ∖ { 0 }) ↔ (𝐼 ∈ 𝐵 ∧ 𝐼 ≠ 0 ))
93	73, 91, 92	sylanbrc 581	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ≠ 0 )) → 𝐼 ∈ (𝐵 ∖ { 0 }))
94	20, 93	sylan2b 592	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ { 0 })) → 𝐼 ∈ (𝐵 ∖ { 0 }))
95	20, 77	sylan2b 592	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ { 0 })) → (𝐼 · 𝑥) = 1 )
96	10, 19, 38, 55, 63, 72, 94, 95	isgrpd 18920	. . 3 ⊢ (𝜑 → ((mulGrp‘𝑅) ↾_s (𝐵 ∖ { 0 })) ∈ Grp)
97	84	sneqd 4642	. . . . . . 7 ⊢ (𝜑 → { 0 } = {(0_g‘𝑅)})
98	3, 97	difeq12d 4121	. . . . . 6 ⊢ (𝜑 → (𝐵 ∖ { 0 }) = ((Base‘𝑅) ∖ {(0_g‘𝑅)}))
99	98	oveq2d 7440	. . . . 5 ⊢ (𝜑 → ((mulGrp‘𝑅) ↾_s (𝐵 ∖ { 0 })) = ((mulGrp‘𝑅) ↾_s ((Base‘𝑅) ∖ {(0_g‘𝑅)})))
100	99	eleq1d 2813	. . . 4 ⊢ (𝜑 → (((mulGrp‘𝑅) ↾_s (𝐵 ∖ { 0 })) ∈ Grp ↔ ((mulGrp‘𝑅) ↾_s ((Base‘𝑅) ∖ {(0_g‘𝑅)})) ∈ Grp))
101	100	anbi2d 628	. . 3 ⊢ (𝜑 → ((𝑅 ∈ Ring ∧ ((mulGrp‘𝑅) ↾_s (𝐵 ∖ { 0 })) ∈ Grp) ↔ (𝑅 ∈ Ring ∧ ((mulGrp‘𝑅) ↾_s ((Base‘𝑅) ∖ {(0_g‘𝑅)})) ∈ Grp)))
102	1, 96, 101	mpbi2and 710	. 2 ⊢ (𝜑 → (𝑅 ∈ Ring ∧ ((mulGrp‘𝑅) ↾_s ((Base‘𝑅) ∖ {(0_g‘𝑅)})) ∈ Grp))
103		eqid 2727	. . 3 ⊢ ((mulGrp‘𝑅) ↾_s ((Base‘𝑅) ∖ {(0_g‘𝑅)})) = ((mulGrp‘𝑅) ↾_s ((Base‘𝑅) ∖ {(0_g‘𝑅)}))
104	7, 81, 103	isdrng2 20643	. 2 ⊢ (𝑅 ∈ DivRing ↔ (𝑅 ∈ Ring ∧ ((mulGrp‘𝑅) ↾_s ((Base‘𝑅) ∖ {(0_g‘𝑅)})) ∈ Grp))
105	102, 104	sylibr 233	1 ⊢ (𝜑 → 𝑅 ∈ DivRing)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 394 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ≠ wne 2936 Vcvv 3471 ∖ cdif 3944 ⊆ wss 3947 {csn 4630 ‘cfv 6551 (class class class)co 7424 Basecbs 17185 ↾_s cress 17214 +_gcplusg 17238 ._rcmulr 17239 0_gc0g 17426 Grpcgrp 18895 mulGrpcmgp 20079 1_rcur 20126 Ringcrg 20178 DivRingcdr 20629

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2698 ax-rep 5287 ax-sep 5301 ax-nul 5308 ax-pow 5367 ax-pr 5431 ax-un 7744 ax-cnex 11200 ax-resscn 11201 ax-1cn 11202 ax-icn 11203 ax-addcl 11204 ax-addrcl 11205 ax-mulcl 11206 ax-mulrcl 11207 ax-mulcom 11208 ax-addass 11209 ax-mulass 11210 ax-distr 11211 ax-i2m1 11212 ax-1ne0 11213 ax-1rid 11214 ax-rnegex 11215 ax-rrecex 11216 ax-cnre 11217 ax-pre-lttri 11218 ax-pre-lttrn 11219 ax-pre-ltadd 11220 ax-pre-mulgt0 11221

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2937 df-nel 3043 df-ral 3058 df-rex 3067 df-rmo 3372 df-reu 3373 df-rab 3429 df-v 3473 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4325 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4911 df-iun 5000 df-br 5151 df-opab 5213 df-mpt 5234 df-tr 5268 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5635 df-we 5637 df-xp 5686 df-rel 5687 df-cnv 5688 df-co 5689 df-dm 5690 df-rn 5691 df-res 5692 df-ima 5693 df-pred 6308 df-ord 6375 df-on 6376 df-lim 6377 df-suc 6378 df-iota 6503 df-fun 6553 df-fn 6554 df-f 6555 df-f1 6556 df-fo 6557 df-f1o 6558 df-fv 6559 df-riota 7380 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7875 df-1st 7997 df-2nd 7998 df-tpos 8236 df-frecs 8291 df-wrecs 8322 df-recs 8396 df-rdg 8435 df-er 8729 df-en 8969 df-dom 8970 df-sdom 8971 df-pnf 11286 df-mnf 11287 df-xr 11288 df-ltxr 11289 df-le 11290 df-sub 11482 df-neg 11483 df-nn 12249 df-2 12311 df-3 12312 df-sets 17138 df-slot 17156 df-ndx 17168 df-base 17186 df-ress 17215 df-plusg 17251 df-mulr 17252 df-0g 17428 df-mgm 18605 df-sgrp 18684 df-mnd 18700 df-grp 18898 df-minusg 18899 df-cmn 19742 df-abl 19743 df-mgp 20080 df-rng 20098 df-ur 20127 df-ring 20180 df-oppr 20278 df-dvdsr 20301 df-unit 20302 df-invr 20332 df-dvr 20345 df-drng 20631

This theorem is referenced by: isdrngrd 20663 cndrng 21331 cndrngOLD 21332 erngdvlem4 40468

W3C validator