Theorem issubg2m 13262

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	⊢ 𝐼 = (invg‘𝐺)

Assertion

Ref	Expression
issubg2m	⊢ (𝐺 ∈ Grp → (𝑆 ∈ (SubGrp‘𝐺) ↔ (𝑆 ⊆ 𝐵 ∧ ∃𝑢 𝑢 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))))

Distinct variable groups:   𝑢, + ,𝑥,𝑦   𝑢,𝐵   𝑢,𝐺,𝑥,𝑦   𝑢,𝐼,𝑥,𝑦   𝑢,𝑆,𝑥,𝑦

Allowed substitution hints:   𝐵(𝑥,𝑦)

Proof of Theorem issubg2m

Dummy variables 𝑣 𝑤 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		issubg2.b	. . . 4 ⊢ 𝐵 = (Base‘𝐺)
2	1	subgss 13247	. . 3 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ 𝐵)
3		eqid 2193	. . . . . . 7 ⊢ (𝐺 ↾s 𝑆) = (𝐺 ↾s 𝑆)
4	3	subggrp 13250	. . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝐺 ↾s 𝑆) ∈ Grp)
5		eqid 2193	. . . . . . 7 ⊢ (Base‘(𝐺 ↾s 𝑆)) = (Base‘(𝐺 ↾s 𝑆))
6		eqid 2193	. . . . . . 7 ⊢ (0g‘(𝐺 ↾s 𝑆)) = (0g‘(𝐺 ↾s 𝑆))
7	5, 6	grpidcl 13104	. . . . . 6 ⊢ ((𝐺 ↾s 𝑆) ∈ Grp → (0g‘(𝐺 ↾s 𝑆)) ∈ (Base‘(𝐺 ↾s 𝑆)))
8	4, 7	syl 14	. . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (0g‘(𝐺 ↾s 𝑆)) ∈ (Base‘(𝐺 ↾s 𝑆)))
9	3	subgbas 13251	. . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘(𝐺 ↾s 𝑆)))
10	8, 9	eleqtrrd 2273	. . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (0g‘(𝐺 ↾s 𝑆)) ∈ 𝑆)
11		elex2 2776	. . . 4 ⊢ ((0g‘(𝐺 ↾s 𝑆)) ∈ 𝑆 → ∃𝑢 𝑢 ∈ 𝑆)
12	10, 11	syl 14	. . 3 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → ∃𝑢 𝑢 ∈ 𝑆)
13		issubg2.p	. . . . . . . 8 ⊢ + = (+g‘𝐺)
14	13	subgcl 13257	. . . . . . 7 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥 + 𝑦) ∈ 𝑆)
15	14	3expa 1205	. . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ 𝑆) → (𝑥 + 𝑦) ∈ 𝑆)
16	15	ralrimiva 2567	. . . . 5 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ 𝑆) → ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆)
17		issubg2.i	. . . . . 6 ⊢ 𝐼 = (invg‘𝐺)
18	17	subginvcl 13256	. . . . 5 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ 𝑆) → (𝐼‘𝑥) ∈ 𝑆)
19	16, 18	jca 306	. . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ 𝑆) → (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))
20	19	ralrimiva 2567	. . 3 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))
21	2, 12, 20	3jca 1179	. 2 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝑆 ⊆ 𝐵 ∧ ∃𝑢 𝑢 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆)))
22		eleq1w 2254	. . . . 5 ⊢ (𝑟 = 𝑢 → (𝑟 ∈ 𝑆 ↔ 𝑢 ∈ 𝑆))
23	22	cbvexv 1930	. . . 4 ⊢ (∃𝑟 𝑟 ∈ 𝑆 ↔ ∃𝑢 𝑢 ∈ 𝑆)
24	23	3anbi2i 1193	. . 3 ⊢ ((𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆)) ↔ (𝑆 ⊆ 𝐵 ∧ ∃𝑢 𝑢 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆)))
25		simpl 109	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → 𝐺 ∈ Grp)
26		simpr1 1005	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → 𝑆 ⊆ 𝐵)
27	3	a1i 9	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → (𝐺 ↾s 𝑆) = (𝐺 ↾s 𝑆))
28	1	a1i 9	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝐵 = (Base‘𝐺))
29		simpl 109	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝐺 ∈ Grp)
30		simpr 110	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝑆 ⊆ 𝐵)
31	27, 28, 29, 30	ressbas2d 12689	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝑆 = (Base‘(𝐺 ↾s 𝑆)))
32	31	3ad2antr1 1164	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → 𝑆 = (Base‘(𝐺 ↾s 𝑆)))
33	13	a1i 9	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → + = (+g‘𝐺))
34		basfn 12679	. . . . . . . . . . 11 ⊢ Base Fn V
35	29	elexd 2773	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝐺 ∈ V)
36		funfvex 5572	. . . . . . . . . . . 12 ⊢ ((Fun Base ∧ 𝐺 ∈ dom Base) → (Base‘𝐺) ∈ V)
37	36	funfni 5355	. . . . . . . . . . 11 ⊢ ((Base Fn V ∧ 𝐺 ∈ V) → (Base‘𝐺) ∈ V)
38	34, 35, 37	sylancr 414	. . . . . . . . . 10 ⊢ ((𝐺 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → (Base‘𝐺) ∈ V)
39	1, 38	eqeltrid 2280	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝐵 ∈ V)
40	39, 30	ssexd 4170	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝑆 ∈ V)
41	27, 33, 40, 29	ressplusgd 12749	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → + = (+g‘(𝐺 ↾s 𝑆)))
42	41	3ad2antr1 1164	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → + = (+g‘(𝐺 ↾s 𝑆)))
43		simpr3 1007	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))
44		simpl 109	. . . . . . . . . 10 ⊢ ((∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆) → ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆)
45	44	ralimi 2557	. . . . . . . . 9 ⊢ (∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆) → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆)
46	43, 45	syl 14	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆)
47		oveq1 5926	. . . . . . . . . 10 ⊢ (𝑥 = 𝑢 → (𝑥 + 𝑦) = (𝑢 + 𝑦))
48	47	eleq1d 2262	. . . . . . . . 9 ⊢ (𝑥 = 𝑢 → ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑢 + 𝑦) ∈ 𝑆))
49		oveq2 5927	. . . . . . . . . 10 ⊢ (𝑦 = 𝑣 → (𝑢 + 𝑦) = (𝑢 + 𝑣))
50	49	eleq1d 2262	. . . . . . . . 9 ⊢ (𝑦 = 𝑣 → ((𝑢 + 𝑦) ∈ 𝑆 ↔ (𝑢 + 𝑣) ∈ 𝑆))
51	48, 50	rspc2v 2878	. . . . . . . 8 ⊢ ((𝑢 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆) → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 → (𝑢 + 𝑣) ∈ 𝑆))
52	46, 51	syl5com 29	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → ((𝑢 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆) → (𝑢 + 𝑣) ∈ 𝑆))
53	52	3impib 1203	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆) → (𝑢 + 𝑣) ∈ 𝑆)
54	26	sseld 3179	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → (𝑢 ∈ 𝑆 → 𝑢 ∈ 𝐵))
55	26	sseld 3179	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → (𝑣 ∈ 𝑆 → 𝑣 ∈ 𝐵))
56	26	sseld 3179	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → (𝑤 ∈ 𝑆 → 𝑤 ∈ 𝐵))
57	54, 55, 56	3anim123d 1330	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → ((𝑢 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) → (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)))
58	57	imp 124	. . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ (𝑢 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))
59	1, 13	grpass 13084	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → ((𝑢 + 𝑣) + 𝑤) = (𝑢 + (𝑣 + 𝑤)))
60	59	adantlr 477	. . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → ((𝑢 + 𝑣) + 𝑤) = (𝑢 + (𝑣 + 𝑤)))
61	58, 60	syldan 282	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ (𝑢 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → ((𝑢 + 𝑣) + 𝑤) = (𝑢 + (𝑣 + 𝑤)))
62		simpr2 1006	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → ∃𝑟 𝑟 ∈ 𝑆)
63	62, 23	sylib 122	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → ∃𝑢 𝑢 ∈ 𝑆)
64	26	sselda 3180	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝑆) → 𝑢 ∈ 𝐵)
65		eqid 2193	. . . . . . . . . . 11 ⊢ (0g‘𝐺) = (0g‘𝐺)
66	1, 13, 65, 17	grplinv 13125	. . . . . . . . . 10 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ 𝐵) → ((𝐼‘𝑢) + 𝑢) = (0g‘𝐺))
67	66	adantlr 477	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝐵) → ((𝐼‘𝑢) + 𝑢) = (0g‘𝐺))
68	64, 67	syldan 282	. . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝑆) → ((𝐼‘𝑢) + 𝑢) = (0g‘𝐺))
69		simpr 110	. . . . . . . . . . . 12 ⊢ ((∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆) → (𝐼‘𝑥) ∈ 𝑆)
70	69	ralimi 2557	. . . . . . . . . . 11 ⊢ (∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆) → ∀𝑥 ∈ 𝑆 (𝐼‘𝑥) ∈ 𝑆)
71	43, 70	syl 14	. . . . . . . . . 10 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → ∀𝑥 ∈ 𝑆 (𝐼‘𝑥) ∈ 𝑆)
72		fveq2 5555	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑢 → (𝐼‘𝑥) = (𝐼‘𝑢))
73	72	eleq1d 2262	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑢 → ((𝐼‘𝑥) ∈ 𝑆 ↔ (𝐼‘𝑢) ∈ 𝑆))
74	73	rspccva 2864	. . . . . . . . . 10 ⊢ ((∀𝑥 ∈ 𝑆 (𝐼‘𝑥) ∈ 𝑆 ∧ 𝑢 ∈ 𝑆) → (𝐼‘𝑢) ∈ 𝑆)
75	71, 74	sylan 283	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝑆) → (𝐼‘𝑢) ∈ 𝑆)
76		simpr 110	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝑆) → 𝑢 ∈ 𝑆)
77	46	adantr 276	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝑆) → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆)
78		ovrspc2v 5945	. . . . . . . . 9 ⊢ ((((𝐼‘𝑢) ∈ 𝑆 ∧ 𝑢 ∈ 𝑆) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆) → ((𝐼‘𝑢) + 𝑢) ∈ 𝑆)
79	75, 76, 77, 78	syl21anc 1248	. . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝑆) → ((𝐼‘𝑢) + 𝑢) ∈ 𝑆)
80	68, 79	eqeltrrd 2271	. . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝑆) → (0g‘𝐺) ∈ 𝑆)
81	63, 80	exlimddv 1910	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → (0g‘𝐺) ∈ 𝑆)
82	1, 13, 65	grplid 13106	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ 𝐵) → ((0g‘𝐺) + 𝑢) = 𝑢)
83	82	adantlr 477	. . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝐵) → ((0g‘𝐺) + 𝑢) = 𝑢)
84	64, 83	syldan 282	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) ∧ 𝑢 ∈ 𝑆) → ((0g‘𝐺) + 𝑢) = 𝑢)
85	32, 42, 53, 61, 81, 84, 75, 68	isgrpd 13098	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → (𝐺 ↾s 𝑆) ∈ Grp)
86	1	issubg 13246	. . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) ↔ (𝐺 ∈ Grp ∧ 𝑆 ⊆ 𝐵 ∧ (𝐺 ↾s 𝑆) ∈ Grp))
87	25, 26, 85, 86	syl3anbrc 1183	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))) → 𝑆 ∈ (SubGrp‘𝐺))
88	87	ex 115	. . 3 ⊢ (𝐺 ∈ Grp → ((𝑆 ⊆ 𝐵 ∧ ∃𝑟 𝑟 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆)) → 𝑆 ∈ (SubGrp‘𝐺)))
89	24, 88	biimtrrid 153	. 2 ⊢ (𝐺 ∈ Grp → ((𝑆 ⊆ 𝐵 ∧ ∃𝑢 𝑢 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆)) → 𝑆 ∈ (SubGrp‘𝐺)))
90	21, 89	impbid2 143	1 ⊢ (𝐺 ∈ Grp → (𝑆 ∈ (SubGrp‘𝐺) ↔ (𝑆 ⊆ 𝐵 ∧ ∃𝑢 𝑢 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) ∈ 𝑆 ∧ (𝐼‘𝑥) ∈ 𝑆))))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 980   = wceq 1364  ∃wex 1503   ∈ wcel 2164  ∀wral 2472  Vcvv 2760   ⊆ wss 3154   Fn wfn 5250  ‘cfv 5255  (class class class)co 5919  Basecbs 12621   ↾_s cress 12622  +_gcplusg 12698  0_gc0g 12870  Grpcgrp 13075  inv_gcminusg 13076  SubGrpcsubg 13240

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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-cnex 7965  ax-resscn 7966  ax-1cn 7967  ax-1re 7968  ax-icn 7969  ax-addcl 7970  ax-addrcl 7971  ax-mulcl 7972  ax-addcom 7974  ax-addass 7976  ax-i2m1 7979  ax-0lt1 7980  ax-0id 7982  ax-rnegex 7983  ax-pre-ltirr 7986  ax-pre-ltadd 7990

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-riota 5874  df-ov 5922  df-oprab 5923  df-mpo 5924  df-pnf 8058  df-mnf 8059  df-ltxr 8061  df-inn 8985  df-2 9043  df-ndx 12624  df-slot 12625  df-base 12627  df-sets 12628  df-iress 12629  df-plusg 12711  df-0g 12872  df-mgm 12942  df-sgrp 12988  df-mnd 13001  df-grp 13078  df-minusg 13079  df-subg 13243

This theorem is referenced by:  issubgrpd2  13263  issubg3  13265  issubg4m  13266  grpissubg  13267  subgintm  13271  nmzsubg  13283  ghmrn  13330  ghmpreima  13339  subrgugrp  13739  lsssubg  13876  lidlsubg  13985  cnsubglem  14078