issubrg2 - Intuitionistic Logic Explorer

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

Theorem issubrg2 14633

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 14619	. . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ∈ (SubGrp‘𝑅))
2		issubrg2.o	. . . 4 ⊢ 1 = (1_r‘𝑅)
3	2	subrg1cl 14621	. . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 1 ∈ 𝐴)
4		issubrg2.t	. . . . . 6 ⊢ · = (._r‘𝑅)
5	4	subrgmcl 14625	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥 · 𝑦) ∈ 𝐴)
6	5	3expb 1235	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥 · 𝑦) ∈ 𝐴)
7	6	ralrimivva 2632	. . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)
8	1, 3, 7	3jca 1208	. 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴))
9		simpl 109	. . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 𝑅 ∈ Ring)
10		simpr1 1034	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 𝐴 ∈ (SubGrp‘𝑅))
11		eqid 2238	. . . . . . 7 ⊢ (𝑅 ↾_s 𝐴) = (𝑅 ↾_s 𝐴)
12	11	subgbas 14034	. . . . . 6 ⊢ (𝐴 ∈ (SubGrp‘𝑅) → 𝐴 = (Base‘(𝑅 ↾_s 𝐴)))
13	10, 12	syl 14	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 𝐴 = (Base‘(𝑅 ↾_s 𝐴)))
14		eqidd 2239	. . . . . . 7 ⊢ (𝐴 ∈ (SubGrp‘𝑅) → (𝑅 ↾_s 𝐴) = (𝑅 ↾_s 𝐴))
15		eqidd 2239	. . . . . . 7 ⊢ (𝐴 ∈ (SubGrp‘𝑅) → (+_g‘𝑅) = (+_g‘𝑅))
16		id 19	. . . . . . 7 ⊢ (𝐴 ∈ (SubGrp‘𝑅) → 𝐴 ∈ (SubGrp‘𝑅))
17		subgrcl 14035	. . . . . . 7 ⊢ (𝐴 ∈ (SubGrp‘𝑅) → 𝑅 ∈ Grp)
18	14, 15, 16, 17	ressplusgd 13536	. . . . . 6 ⊢ (𝐴 ∈ (SubGrp‘𝑅) → (+_g‘𝑅) = (+_g‘(𝑅 ↾_s 𝐴)))
19	10, 18	syl 14	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (+_g‘𝑅) = (+_g‘(𝑅 ↾_s 𝐴)))
20	11, 4	ressmulrg 13552	. . . . . 6 ⊢ ((𝐴 ∈ (SubGrp‘𝑅) ∧ 𝑅 ∈ Grp) → · = (._r‘(𝑅 ↾_s 𝐴)))
21	10, 17, 20	syl2anc2 416	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → · = (._r‘(𝑅 ↾_s 𝐴)))
22	11	subggrp 14033	. . . . . 6 ⊢ (𝐴 ∈ (SubGrp‘𝑅) → (𝑅 ↾_s 𝐴) ∈ Grp)
23	10, 22	syl 14	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑅 ↾_s 𝐴) ∈ Grp)
24		simpr3 1036	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)
25		oveq1 6092	. . . . . . . . 9 ⊢ (𝑥 = 𝑢 → (𝑥 · 𝑦) = (𝑢 · 𝑦))
26	25	eleq1d 2307	. . . . . . . 8 ⊢ (𝑥 = 𝑢 → ((𝑥 · 𝑦) ∈ 𝐴 ↔ (𝑢 · 𝑦) ∈ 𝐴))
27		oveq2 6093	. . . . . . . . 9 ⊢ (𝑦 = 𝑣 → (𝑢 · 𝑦) = (𝑢 · 𝑣))
28	27	eleq1d 2307	. . . . . . . 8 ⊢ (𝑦 = 𝑣 → ((𝑢 · 𝑦) ∈ 𝐴 ↔ (𝑢 · 𝑣) ∈ 𝐴))
29	26, 28	rspc2v 2943	. . . . . . 7 ⊢ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴 → (𝑢 · 𝑣) ∈ 𝐴))
30	24, 29	syl5com 29	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) → (𝑢 · 𝑣) ∈ 𝐴))
31	30	3impib 1232	. . . . 5 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) → (𝑢 · 𝑣) ∈ 𝐴)
32		issubrg2.b	. . . . . . . . . . 11 ⊢ 𝐵 = (Base‘𝑅)
33	32	subgss 14030	. . . . . . . . . 10 ⊢ (𝐴 ∈ (SubGrp‘𝑅) → 𝐴 ⊆ 𝐵)
34	10, 33	syl 14	. . . . . . . . 9 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 𝐴 ⊆ 𝐵)
35	34	sseld 3247	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑢 ∈ 𝐴 → 𝑢 ∈ 𝐵))
36	34	sseld 3247	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑣 ∈ 𝐴 → 𝑣 ∈ 𝐵))
37	34	sseld 3247	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵))
38	35, 36, 37	3anim123d 1360	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴) → (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)))
39	38	imp 124	. . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))
40	32, 4	ringass 14404	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → ((𝑢 · 𝑣) · 𝑤) = (𝑢 · (𝑣 · 𝑤)))
41	40	adantlr 481	. . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → ((𝑢 · 𝑣) · 𝑤) = (𝑢 · (𝑣 · 𝑤)))
42	39, 41	syldan 282	. . . . 5 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((𝑢 · 𝑣) · 𝑤) = (𝑢 · (𝑣 · 𝑤)))
43		eqid 2238	. . . . . . . 8 ⊢ (+_g‘𝑅) = (+_g‘𝑅)
44	32, 43, 4	ringdi 14407	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → (𝑢 · (𝑣(+_g‘𝑅)𝑤)) = ((𝑢 · 𝑣)(+_g‘𝑅)(𝑢 · 𝑤)))
45	44	adantlr 481	. . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → (𝑢 · (𝑣(+_g‘𝑅)𝑤)) = ((𝑢 · 𝑣)(+_g‘𝑅)(𝑢 · 𝑤)))
46	39, 45	syldan 282	. . . . 5 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝑢 · (𝑣(+_g‘𝑅)𝑤)) = ((𝑢 · 𝑣)(+_g‘𝑅)(𝑢 · 𝑤)))
47	32, 43, 4	ringdir 14408	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → ((𝑢(+_g‘𝑅)𝑣) · 𝑤) = ((𝑢 · 𝑤)(+_g‘𝑅)(𝑣 · 𝑤)))
48	47	adantlr 481	. . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → ((𝑢(+_g‘𝑅)𝑣) · 𝑤) = ((𝑢 · 𝑤)(+_g‘𝑅)(𝑣 · 𝑤)))
49	39, 48	syldan 282	. . . . 5 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((𝑢(+_g‘𝑅)𝑣) · 𝑤) = ((𝑢 · 𝑤)(+_g‘𝑅)(𝑣 · 𝑤)))
50		simpr2 1035	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 1 ∈ 𝐴)
51	35	imp 124	. . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢 ∈ 𝐴) → 𝑢 ∈ 𝐵)
52	32, 4, 2	ringlidm 14412	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑢 ∈ 𝐵) → ( 1 · 𝑢) = 𝑢)
53	52	adantlr 481	. . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢 ∈ 𝐵) → ( 1 · 𝑢) = 𝑢)
54	51, 53	syldan 282	. . . . 5 ⊢ (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢 ∈ 𝐴) → ( 1 · 𝑢) = 𝑢)
55	32, 4, 2	ringridm 14413	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑢 ∈ 𝐵) → (𝑢 · 1 ) = 𝑢)
56	55	adantlr 481	. . . . . 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 14430	. . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑅 ↾_s 𝐴) ∈ Ring)
59	34, 50	jca 306	. . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴))
60	32, 2	issubrg 14613	. . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) ↔ ((𝑅 ∈ Ring ∧ (𝑅 ↾_s 𝐴) ∈ Ring) ∧ (𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴)))
61	9, 58, 59, 60	syl21anbrc 1213	. . 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

This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ∀wral 2528 ⊆ wss 3220 ‘cfv 5377 (class class class)co 6085 Basecbs 13404 ↾_s cress 13405 +_gcplusg 13484 ._rcmulr 13485 Grpcgrp 13858 SubGrpcsubg 14023 1_rcur 14346 Ringcrg 14384 SubRingcsubrg 14609

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8271 ax-resscn 8272 ax-1cn 8273 ax-1re 8274 ax-icn 8275 ax-addcl 8276 ax-addrcl 8277 ax-mulcl 8278 ax-addcom 8280 ax-addass 8282 ax-i2m1 8285 ax-0lt1 8286 ax-0id 8288 ax-rnegex 8289 ax-pre-ltirr 8292 ax-pre-lttrn 8294 ax-pre-ltadd 8296

This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-br 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-pnf 8363 df-mnf 8364 df-ltxr 8366 df-inn 9308 df-2 9366 df-3 9367 df-ndx 13407 df-slot 13408 df-base 13410 df-sets 13411 df-iress 13412 df-plusg 13497 df-mulr 13498 df-0g 13665 df-mgm 13729 df-sgrp 13770 df-mnd 13783 df-subg 14026 df-mgp 14302 df-ur 14347 df-ring 14386 df-subrg 14611

This theorem is used by: subrgintm 14635 issubrg3 14639 issubrgd 14873 cnsubrglem 15001

W3C validator