issubg2 - Metamath Proof Explorer

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

Theorem issubg2 19054

Description: Characterize the subgroups of a group by closure properties. (Contributed by Mario Carneiro, 2-Dec-2014.)

**Hypotheses**
Ref	Expression
issubg2.b	⊢ 𝐵 = (Base‘𝐺)
issubg2.p	⊢ + = (+_g‘𝐺)
issubg2.i	⊢ 𝐼 = (inv_g‘𝐺)

**Assertion**
Ref	Expression
issubg2	⊢ (𝐺 ∈ Grp → (𝑆 ∈ (SubGrp‘𝐺) ↔ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))))

Distinct variable groups: 𝑥,𝑦,𝐺 𝑥,𝐼,𝑦 𝑥, + ,𝑦 𝑥,𝑆,𝑦 Allowed substitution hints: 𝐵(𝑥,𝑦)

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

Step	Hyp	Ref	Expression
1		issubg2.b	. . . 4 ⊢ 𝐵 = (Base‘𝐺)
2	1	subgss 19040	. . 3 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ 𝐵)
3		eqid 2731	. . . . 5 ⊢ (𝐺 ↾_s 𝑆) = (𝐺 ↾_s 𝑆)
4	3	subgbas 19043	. . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘(𝐺 ↾_s 𝑆)))
5	3	subggrp 19042	. . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝐺 ↾_s 𝑆) ∈ Grp)
6		eqid 2731	. . . . . 6 ⊢ (Base‘(𝐺 ↾_s 𝑆)) = (Base‘(𝐺 ↾_s 𝑆))
7	6	grpbn0 18879	. . . . 5 ⊢ ((𝐺 ↾_s 𝑆) ∈ Grp → (Base‘(𝐺 ↾_s 𝑆)) ≠ ∅)
8	5, 7	syl 17	. . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (Base‘(𝐺 ↾_s 𝑆)) ≠ ∅)
9	4, 8	eqnetrd 2995	. . 3 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ≠ ∅)
10		issubg2.p	. . . . . . . 8 ⊢ + = (+_g‘𝐺)
11	10	subgcl 19049	. . . . . . 7 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥 + 𝑦) ∈ 𝑆)
12	11	3expa 1118	. . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ 𝑆) → (𝑥 + 𝑦) ∈ 𝑆)
13	12	ralrimiva 3124	. . . . 5 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ 𝑆) → ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆)
14		issubg2.i	. . . . . 6 ⊢ 𝐼 = (inv_g‘𝐺)
15	14	subginvcl 19048	. . . . 5 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ 𝑆) → (𝐼‘𝑥) ∈ 𝑆)
16	13, 15	jca 511	. . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ 𝑆) → (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))
17	16	ralrimiva 3124	. . 3 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))
18	2, 9, 17	3jca 1128	. 2 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆)))
19		simpl 482	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → 𝐺 ∈ Grp)
20		simpr1 1195	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → 𝑆 ⊆ 𝐵)
21	3, 1	ressbas2 17149	. . . . . 6 ⊢ (𝑆 ⊆ 𝐵 → 𝑆 = (Base‘(𝐺 ↾_s 𝑆)))
22	20, 21	syl 17	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → 𝑆 = (Base‘(𝐺 ↾_s 𝑆)))
23		fvex 6835	. . . . . . 7 ⊢ (Base‘(𝐺 ↾_s 𝑆)) ∈ V
24	22, 23	eqeltrdi 2839	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → 𝑆 ∈ V)
25	3, 10	ressplusg 17195	. . . . . 6 ⊢ (𝑆 ∈ V → + = (+_g‘(𝐺 ↾_s 𝑆)))
26	24, 25	syl 17	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → + = (+_g‘(𝐺 ↾_s 𝑆)))
27		simpr3 1197	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))
28		simpl 482	. . . . . . . . 9 ⊢ ((∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆) → ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆)
29	28	ralimi 3069	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆) → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆)
30	27, 29	syl 17	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆)
31		oveq1 7353	. . . . . . . . 9 ⊢ (𝑥 = 𝑢 → (𝑥 + 𝑦) = (𝑢 + 𝑦))
32	31	eleq1d 2816	. . . . . . . 8 ⊢ (𝑥 = 𝑢 → ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑢 + 𝑦) ∈ 𝑆))
33		oveq2 7354	. . . . . . . . 9 ⊢ (𝑦 = 𝑣 → (𝑢 + 𝑦) = (𝑢 + 𝑣))
34	33	eleq1d 2816	. . . . . . . 8 ⊢ (𝑦 = 𝑣 → ((𝑢 + 𝑦) ∈ 𝑆 ↔ (𝑢 + 𝑣) ∈ 𝑆))
35	32, 34	rspc2v 3583	. . . . . . 7 ⊢ ((𝑢 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆) → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 → (𝑢 + 𝑣) ∈ 𝑆))
36	30, 35	syl5com 31	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → ((𝑢 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆) → (𝑢 + 𝑣) ∈ 𝑆))
37	36	3impib 1116	. . . . 5 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆) → (𝑢 + 𝑣) ∈ 𝑆)
38	20	sseld 3928	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → (𝑢 ∈ 𝑆 → 𝑢 ∈ 𝐵))
39	20	sseld 3928	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → (𝑣 ∈ 𝑆 → 𝑣 ∈ 𝐵))
40	20	sseld 3928	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → (𝑤 ∈ 𝑆 → 𝑤 ∈ 𝐵))
41	38, 39, 40	3anim123d 1445	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → ((𝑢 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) → (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)))
42	41	imp 406	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ (𝑢 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))
43	1, 10	grpass 18855	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → ((𝑢 + 𝑣) + 𝑤) = (𝑢 + (𝑣 + 𝑤)))
44	43	adantlr 715	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → ((𝑢 + 𝑣) + 𝑤) = (𝑢 + (𝑣 + 𝑤)))
45	42, 44	syldan 591	. . . . 5 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ (𝑢 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → ((𝑢 + 𝑣) + 𝑤) = (𝑢 + (𝑣 + 𝑤)))
46		simpr2 1196	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → 𝑆 ≠ ∅)
47		n0 4300	. . . . . . 7 ⊢ (𝑆 ≠ ∅ ↔ ∃𝑢 𝑢 ∈ 𝑆)
48	46, 47	sylib 218	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → ∃𝑢 𝑢 ∈ 𝑆)
49	20	sselda 3929	. . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝑆) → 𝑢 ∈ 𝐵)
50		eqid 2731	. . . . . . . . . 10 ⊢ (0_g‘𝐺) = (0_g‘𝐺)
51	1, 10, 50, 14	grplinv 18902	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ 𝐵) → ((𝐼‘𝑢) + 𝑢) = (0_g‘𝐺))
52	51	adantlr 715	. . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝐵) → ((𝐼‘𝑢) + 𝑢) = (0_g‘𝐺))
53	49, 52	syldan 591	. . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝑆) → ((𝐼‘𝑢) + 𝑢) = (0_g‘𝐺))
54		simpr 484	. . . . . . . . . . 11 ⊢ ((∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆) → (𝐼‘𝑥) ∈ 𝑆)
55	54	ralimi 3069	. . . . . . . . . 10 ⊢ (∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆) → ∀𝑥 ∈ 𝑆 (𝐼‘𝑥) ∈ 𝑆)
56	27, 55	syl 17	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → ∀𝑥 ∈ 𝑆 (𝐼‘𝑥) ∈ 𝑆)
57		fveq2 6822	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑢 → (𝐼‘𝑥) = (𝐼‘𝑢))
58	57	eleq1d 2816	. . . . . . . . . 10 ⊢ (𝑥 = 𝑢 → ((𝐼‘𝑥) ∈ 𝑆 ↔ (𝐼‘𝑢) ∈ 𝑆))
59	58	rspccva 3571	. . . . . . . . 9 ⊢ ((∀𝑥 ∈ 𝑆 (𝐼‘𝑥) ∈ 𝑆 ∧ 𝑢 ∈ 𝑆) → (𝐼‘𝑢) ∈ 𝑆)
60	56, 59	sylan 580	. . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝑆) → (𝐼‘𝑢) ∈ 𝑆)
61		simpr 484	. . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝑆) → 𝑢 ∈ 𝑆)
62	30	adantr 480	. . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝑆) → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆)
63		ovrspc2v 7372	. . . . . . . 8 ⊢ ((((𝐼‘𝑢) ∈ 𝑆 ∧ 𝑢 ∈ 𝑆) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆) → ((𝐼‘𝑢) + 𝑢) ∈ 𝑆)
64	60, 61, 62, 63	syl21anc 837	. . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝑆) → ((𝐼‘𝑢) + 𝑢) ∈ 𝑆)
65	53, 64	eqeltrrd 2832	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝑆) → (0_g‘𝐺) ∈ 𝑆)
66	48, 65	exlimddv 1936	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → (0_g‘𝐺) ∈ 𝑆)
67	1, 10, 50	grplid 18880	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ 𝐵) → ((0_g‘𝐺) + 𝑢) = 𝑢)
68	67	adantlr 715	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝐵) → ((0_g‘𝐺) + 𝑢) = 𝑢)
69	49, 68	syldan 591	. . . . 5 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝑆) → ((0_g‘𝐺) + 𝑢) = 𝑢)
70	22, 26, 37, 45, 66, 69, 60, 53	isgrpd 18871	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → (𝐺 ↾_s 𝑆) ∈ Grp)
71	1	issubg 19039	. . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) ↔ (𝐺 ∈ Grp ∧ 𝑆 ⊆ 𝐵 ∧ (𝐺 ↾_s 𝑆) ∈ Grp))
72	19, 20, 70, 71	syl3anbrc 1344	. . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → 𝑆 ∈ (SubGrp‘𝐺))
73	72	ex 412	. 2 ⊢ (𝐺 ∈ Grp → ((𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆)) → 𝑆 ∈ (SubGrp‘𝐺)))
74	18, 73	impbid2 226	1 ⊢ (𝐺 ∈ Grp → (𝑆 ∈ (SubGrp‘𝐺) ↔ (𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅ ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∃wex 1780 ∈ wcel 2111 ≠ wne 2928 ∀wral 3047 Vcvv 3436 ⊆ wss 3897 ∅c0 4280 ‘cfv 6481 (class class class)co 7346 Basecbs 17120 ↾_s cress 17141 +_gcplusg 17161 0_gc0g 17343 Grpcgrp 18846 inv_gcminusg 18847 SubGrpcsubg 19033

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668 ax-cnex 11062 ax-resscn 11063 ax-1cn 11064 ax-icn 11065 ax-addcl 11066 ax-addrcl 11067 ax-mulcl 11068 ax-mulrcl 11069 ax-mulcom 11070 ax-addass 11071 ax-mulass 11072 ax-distr 11073 ax-i2m1 11074 ax-1ne0 11075 ax-1rid 11076 ax-rnegex 11077 ax-rrecex 11078 ax-cnre 11079 ax-pre-lttri 11080 ax-pre-lttrn 11081 ax-pre-ltadd 11082 ax-pre-mulgt0 11083

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-om 7797 df-2nd 7922 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-er 8622 df-en 8870 df-dom 8871 df-sdom 8872 df-pnf 11148 df-mnf 11149 df-xr 11150 df-ltxr 11151 df-le 11152 df-sub 11346 df-neg 11347 df-nn 12126 df-2 12188 df-sets 17075 df-slot 17093 df-ndx 17105 df-base 17121 df-ress 17142 df-plusg 17174 df-0g 17345 df-mgm 18548 df-sgrp 18627 df-mnd 18643 df-grp 18849 df-minusg 18850 df-subg 19036

This theorem is referenced by: issubgrpd2 19055 issubg3 19057 issubg4 19058 grpissubg 19059 subgint 19063 nmzsubg 19077 cycsubgcl 19118 ghmrn 19141 ghmpreima 19150 gastacl 19221 torsubg 19766 oddvdssubg 19767 cntzsubrng 20482 subrgugrp 20506 cntzsubr 20521 lsssubg 20890 lidlsubg 21160 cnsubglem 21352 cnmsubglem 21367 pzriprnglem4 21421 mplsubglem 21936 mplind 22005 mhpsubg 22068 cpmatsubgpmat 22635 elrgspnlem1 33209 nsgqusf1olem1 33378 constrsdrg 33788

W3C validator