issubrg2 - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > issubrg2		GIF version

Theorem issubrg2 13373

Description: Characterize the subrings of a ring by closure properties. (Contributed by Mario Carneiro, 3-Dec-2014.)

**Hypotheses**
Ref	Expression
issubrg2.b	⊢ 𝐵 = (Base‘𝑅)
issubrg2.o	⊢ 1 = (1_r‘𝑅)
issubrg2.t	⊢ · = (._r‘𝑅)

**Assertion**
Ref	Expression
issubrg2	⊢ (𝑅 ∈ Ring → (𝐴 ∈ (SubRing‘𝑅) ↔ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)))

Distinct variable groups: 𝑥,𝑦,𝐴 𝑥,𝑅,𝑦 𝑥, · ,𝑦 Allowed substitution hints: 𝐵(𝑥,𝑦) 1 (𝑥,𝑦)

Proof of Theorem issubrg2 Dummy variables 𝑣 𝑢 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		subrgsubg 13359	. . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ∈ (SubGrp‘𝑅))
2		issubrg2.o	. . . 4 ⊢ 1 = (1_r‘𝑅)
3	2	subrg1cl 13361	. . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 1 ∈ 𝐴)
4		issubrg2.t	. . . . . 6 ⊢ · = (._r‘𝑅)
5	4	subrgmcl 13365	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥 · 𝑦) ∈ 𝐴)
6	5	3expb 1204	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥 · 𝑦) ∈ 𝐴)
7	6	ralrimivva 2559	. . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)
8	1, 3, 7	3jca 1177	. 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴))
9		simpl 109	. . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 𝑅 ∈ Ring)
10		simpr1 1003	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 𝐴 ∈ (SubGrp‘𝑅))
11		eqid 2177	. . . . . . 7 ⊢ (𝑅 ↾_s 𝐴) = (𝑅 ↾_s 𝐴)
12	11	subgbas 13048	. . . . . 6 ⊢ (𝐴 ∈ (SubGrp‘𝑅) → 𝐴 = (Base‘(𝑅 ↾_s 𝐴)))
13	10, 12	syl 14	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 𝐴 = (Base‘(𝑅 ↾_s 𝐴)))
14		eqidd 2178	. . . . . . 7 ⊢ (𝐴 ∈ (SubGrp‘𝑅) → (𝑅 ↾_s 𝐴) = (𝑅 ↾_s 𝐴))
15		eqidd 2178	. . . . . . 7 ⊢ (𝐴 ∈ (SubGrp‘𝑅) → (+_g‘𝑅) = (+_g‘𝑅))
16		id 19	. . . . . . 7 ⊢ (𝐴 ∈ (SubGrp‘𝑅) → 𝐴 ∈ (SubGrp‘𝑅))
17		subgrcl 13049	. . . . . . 7 ⊢ (𝐴 ∈ (SubGrp‘𝑅) → 𝑅 ∈ Grp)
18	14, 15, 16, 17	ressplusgd 12590	. . . . . 6 ⊢ (𝐴 ∈ (SubGrp‘𝑅) → (+_g‘𝑅) = (+_g‘(𝑅 ↾_s 𝐴)))
19	10, 18	syl 14	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (+_g‘𝑅) = (+_g‘(𝑅 ↾_s 𝐴)))
20	11, 4	ressmulrg 12606	. . . . . 6 ⊢ ((𝐴 ∈ (SubGrp‘𝑅) ∧ 𝑅 ∈ Grp) → · = (._r‘(𝑅 ↾_s 𝐴)))
21	10, 17, 20	syl2anc2 412	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → · = (._r‘(𝑅 ↾_s 𝐴)))
22	11	subggrp 13047	. . . . . 6 ⊢ (𝐴 ∈ (SubGrp‘𝑅) → (𝑅 ↾_s 𝐴) ∈ Grp)
23	10, 22	syl 14	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑅 ↾_s 𝐴) ∈ Grp)
24		simpr3 1005	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)
25		oveq1 5885	. . . . . . . . 9 ⊢ (𝑥 = 𝑢 → (𝑥 · 𝑦) = (𝑢 · 𝑦))
26	25	eleq1d 2246	. . . . . . . 8 ⊢ (𝑥 = 𝑢 → ((𝑥 · 𝑦) ∈ 𝐴 ↔ (𝑢 · 𝑦) ∈ 𝐴))
27		oveq2 5886	. . . . . . . . 9 ⊢ (𝑦 = 𝑣 → (𝑢 · 𝑦) = (𝑢 · 𝑣))
28	27	eleq1d 2246	. . . . . . . 8 ⊢ (𝑦 = 𝑣 → ((𝑢 · 𝑦) ∈ 𝐴 ↔ (𝑢 · 𝑣) ∈ 𝐴))
29	26, 28	rspc2v 2856	. . . . . . 7 ⊢ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴 → (𝑢 · 𝑣) ∈ 𝐴))
30	24, 29	syl5com 29	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) → (𝑢 · 𝑣) ∈ 𝐴))
31	30	3impib 1201	. . . . 5 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) → (𝑢 · 𝑣) ∈ 𝐴)
32		issubrg2.b	. . . . . . . . . . 11 ⊢ 𝐵 = (Base‘𝑅)
33	32	subgss 13044	. . . . . . . . . 10 ⊢ (𝐴 ∈ (SubGrp‘𝑅) → 𝐴 ⊆ 𝐵)
34	10, 33	syl 14	. . . . . . . . 9 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 𝐴 ⊆ 𝐵)
35	34	sseld 3156	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑢 ∈ 𝐴 → 𝑢 ∈ 𝐵))
36	34	sseld 3156	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑣 ∈ 𝐴 → 𝑣 ∈ 𝐵))
37	34	sseld 3156	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵))
38	35, 36, 37	3anim123d 1319	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴) → (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)))
39	38	imp 124	. . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))
40	32, 4	ringass 13210	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → ((𝑢 · 𝑣) · 𝑤) = (𝑢 · (𝑣 · 𝑤)))
41	40	adantlr 477	. . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → ((𝑢 · 𝑣) · 𝑤) = (𝑢 · (𝑣 · 𝑤)))
42	39, 41	syldan 282	. . . . 5 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((𝑢 · 𝑣) · 𝑤) = (𝑢 · (𝑣 · 𝑤)))
43		eqid 2177	. . . . . . . 8 ⊢ (+_g‘𝑅) = (+_g‘𝑅)
44	32, 43, 4	ringdi 13212	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → (𝑢 · (𝑣(+_g‘𝑅)𝑤)) = ((𝑢 · 𝑣)(+_g‘𝑅)(𝑢 · 𝑤)))
45	44	adantlr 477	. . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → (𝑢 · (𝑣(+_g‘𝑅)𝑤)) = ((𝑢 · 𝑣)(+_g‘𝑅)(𝑢 · 𝑤)))
46	39, 45	syldan 282	. . . . 5 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝑢 · (𝑣(+_g‘𝑅)𝑤)) = ((𝑢 · 𝑣)(+_g‘𝑅)(𝑢 · 𝑤)))
47	32, 43, 4	ringdir 13213	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → ((𝑢(+_g‘𝑅)𝑣) · 𝑤) = ((𝑢 · 𝑤)(+_g‘𝑅)(𝑣 · 𝑤)))
48	47	adantlr 477	. . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → ((𝑢(+_g‘𝑅)𝑣) · 𝑤) = ((𝑢 · 𝑤)(+_g‘𝑅)(𝑣 · 𝑤)))
49	39, 48	syldan 282	. . . . 5 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((𝑢(+_g‘𝑅)𝑣) · 𝑤) = ((𝑢 · 𝑤)(+_g‘𝑅)(𝑣 · 𝑤)))
50		simpr2 1004	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 1 ∈ 𝐴)
51	35	imp 124	. . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢 ∈ 𝐴) → 𝑢 ∈ 𝐵)
52	32, 4, 2	ringlidm 13217	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑢 ∈ 𝐵) → ( 1 · 𝑢) = 𝑢)
53	52	adantlr 477	. . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢 ∈ 𝐵) → ( 1 · 𝑢) = 𝑢)
54	51, 53	syldan 282	. . . . 5 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢 ∈ 𝐴) → ( 1 · 𝑢) = 𝑢)
55	32, 4, 2	ringridm 13218	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑢 ∈ 𝐵) → (𝑢 · 1 ) = 𝑢)
56	55	adantlr 477	. . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢 ∈ 𝐵) → (𝑢 · 1 ) = 𝑢)
57	51, 56	syldan 282	. . . . 5 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢 ∈ 𝐴) → (𝑢 · 1 ) = 𝑢)
58	13, 19, 21, 23, 31, 42, 46, 49, 50, 54, 57	isringd 13231	. . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑅 ↾_s 𝐴) ∈ Ring)
59	34, 50	jca 306	. . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴))
60	32, 2	issubrg 13353	. . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) ↔ ((𝑅 ∈ Ring ∧ (𝑅 ↾_s 𝐴) ∈ Ring) ∧ (𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴)))
61	9, 58, 59, 60	syl21anbrc 1182	. . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 𝐴 ∈ (SubRing‘𝑅))
62	61	ex 115	. 2 ⊢ (𝑅 ∈ Ring → ((𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴) → 𝐴 ∈ (SubRing‘𝑅)))
63	8, 62	impbid2 143	1 ⊢ (𝑅 ∈ Ring → (𝐴 ∈ (SubRing‘𝑅) ↔ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 978 = wceq 1353 ∈ wcel 2148 ∀wral 2455 ⊆ wss 3131 ‘cfv 5218 (class class class)co 5878 Basecbs 12465 ↾_s cress 12466 +_gcplusg 12539 ._rcmulr 12540 Grpcgrp 12884 SubGrpcsubg 13037 1_rcur 13153 Ringcrg 13190 SubRingcsubrg 13349

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-sep 4123 ax-pow 4176 ax-pr 4211 ax-un 4435 ax-setind 4538 ax-cnex 7905 ax-resscn 7906 ax-1cn 7907 ax-1re 7908 ax-icn 7909 ax-addcl 7910 ax-addrcl 7911 ax-mulcl 7912 ax-addcom 7914 ax-addass 7916 ax-i2m1 7919 ax-0lt1 7920 ax-0id 7922 ax-rnegex 7923 ax-pre-ltirr 7926 ax-pre-lttrn 7928 ax-pre-ltadd 7930

This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2741 df-sbc 2965 df-csb 3060 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-nul 3425 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-int 3847 df-br 4006 df-opab 4067 df-mpt 4068 df-id 4295 df-xp 4634 df-rel 4635 df-cnv 4636 df-co 4637 df-dm 4638 df-rn 4639 df-res 4640 df-ima 4641 df-iota 5180 df-fun 5220 df-fn 5221 df-fv 5226 df-riota 5834 df-ov 5881 df-oprab 5882 df-mpo 5883 df-pnf 7997 df-mnf 7998 df-ltxr 8000 df-inn 8923 df-2 8981 df-3 8982 df-ndx 12468 df-slot 12469 df-base 12471 df-sets 12472 df-iress 12473 df-plusg 12552 df-mulr 12553 df-0g 12713 df-mgm 12782 df-sgrp 12815 df-mnd 12825 df-subg 13040 df-mgp 13142 df-ur 13154 df-ring 13192 df-subrg 13351

This theorem is referenced by: subrgintm 13375 issubrg3 13379 issubrgd 13550 cnsubrglem 13621

W3C validator