Theorem subgntr 24097

Description: A subgroup of a topological group with nonempty interior is open. Alternatively, dual to clssubg 24099, the interior of a subgroup is either a subgroup, or empty. (Contributed by Mario Carneiro, 19-Sep-2015.)

Hypothesis

Ref	Expression
subgntr.h	⊢ 𝐽 = (TopOpen‘𝐺)

Assertion

Ref	Expression
subgntr	⊢ ((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) → 𝑆 ∈ 𝐽)

Proof of Theorem subgntr

Dummy variables 𝑥 𝑢 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ima 5638	. . . . . 6 ⊢ ((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) “ ((int‘𝐽)‘𝑆)) = ran ((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ↾ ((int‘𝐽)‘𝑆))
2		subgntr.h	. . . . . . . . . . . 12 ⊢ 𝐽 = (TopOpen‘𝐺)
3		eqid 2740	. . . . . . . . . . . 12 ⊢ (Base‘𝐺) = (Base‘𝐺)
4	2, 3	tgptopon 24072	. . . . . . . . . . 11 ⊢ (𝐺 ∈ TopGrp → 𝐽 ∈ (TopOn‘(Base‘𝐺)))
5	4	3ad2ant1 1139	. . . . . . . . . 10 ⊢ ((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) → 𝐽 ∈ (TopOn‘(Base‘𝐺)))
6	5	adantr 481	. . . . . . . . 9 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐽 ∈ (TopOn‘(Base‘𝐺)))
7		topontop 22903	. . . . . . . . . . . 12 ⊢ (𝐽 ∈ (TopOn‘(Base‘𝐺)) → 𝐽 ∈ Top)
8	5, 7	syl 17	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) → 𝐽 ∈ Top)
9	8	adantr 481	. . . . . . . . . 10 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐽 ∈ Top)
10		simpl2 1199	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑆 ∈ (SubGrp‘𝐺))
11	3	subgss 19101	. . . . . . . . . . . 12 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺))
12	10, 11	syl 17	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑆 ⊆ (Base‘𝐺))
13		toponuni 22904	. . . . . . . . . . . 12 ⊢ (𝐽 ∈ (TopOn‘(Base‘𝐺)) → (Base‘𝐺) = ∪ 𝐽)
14	6, 13	syl 17	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (Base‘𝐺) = ∪ 𝐽)
15	12, 14	sseqtrd 3958	. . . . . . . . . 10 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑆 ⊆ ∪ 𝐽)
16		eqid 2740	. . . . . . . . . . 11 ⊢ ∪ 𝐽 = ∪ 𝐽
17	16	ntropn 23039	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽) → ((int‘𝐽)‘𝑆) ∈ 𝐽)
18	9, 15, 17	syl2anc 590	. . . . . . . . 9 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((int‘𝐽)‘𝑆) ∈ 𝐽)
19		toponss 22917	. . . . . . . . 9 ⊢ ((𝐽 ∈ (TopOn‘(Base‘𝐺)) ∧ ((int‘𝐽)‘𝑆) ∈ 𝐽) → ((int‘𝐽)‘𝑆) ⊆ (Base‘𝐺))
20	6, 18, 19	syl2anc 590	. . . . . . . 8 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((int‘𝐽)‘𝑆) ⊆ (Base‘𝐺))
21	20	resmptd 5999	. . . . . . 7 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ↾ ((int‘𝐽)‘𝑆)) = (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)))
22	21	rneqd 5887	. . . . . 6 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ran ((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ↾ ((int‘𝐽)‘𝑆)) = ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)))
23	1, 22	eqtrid 2787	. . . . 5 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) “ ((int‘𝐽)‘𝑆)) = ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)))
24		simpl1 1198	. . . . . . 7 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐺 ∈ TopGrp)
25		simpr 485	. . . . . . . . 9 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ 𝑆)
26	16	ntrss2 23047	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽) → ((int‘𝐽)‘𝑆) ⊆ 𝑆)
27	9, 15, 26	syl2anc 590	. . . . . . . . . 10 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((int‘𝐽)‘𝑆) ⊆ 𝑆)
28		simpl3 1200	. . . . . . . . . 10 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ ((int‘𝐽)‘𝑆))
29	27, 28	sseldd 3923	. . . . . . . . 9 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ 𝑆)
30		eqid 2740	. . . . . . . . . 10 ⊢ (-g‘𝐺) = (-g‘𝐺)
31	30	subgsubcl 19111	. . . . . . . . 9 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) → (𝑥(-g‘𝐺)𝐴) ∈ 𝑆)
32	10, 25, 29, 31	syl3anc 1379	. . . . . . . 8 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝑥(-g‘𝐺)𝐴) ∈ 𝑆)
33	12, 32	sseldd 3923	. . . . . . 7 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝑥(-g‘𝐺)𝐴) ∈ (Base‘𝐺))
34		eqid 2740	. . . . . . . 8 ⊢ (𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) = (𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦))
35		eqid 2740	. . . . . . . 8 ⊢ (+g‘𝐺) = (+g‘𝐺)
36	34, 3, 35, 2	tgplacthmeo 24093	. . . . . . 7 ⊢ ((𝐺 ∈ TopGrp ∧ (𝑥(-g‘𝐺)𝐴) ∈ (Base‘𝐺)) → (𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ∈ (𝐽Homeo𝐽))
37	24, 33, 36	syl2anc 590	. . . . . 6 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ∈ (𝐽Homeo𝐽))
38		hmeoima 23755	. . . . . 6 ⊢ (((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ∈ (𝐽Homeo𝐽) ∧ ((int‘𝐽)‘𝑆) ∈ 𝐽) → ((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) “ ((int‘𝐽)‘𝑆)) ∈ 𝐽)
39	37, 18, 38	syl2anc 590	. . . . 5 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) “ ((int‘𝐽)‘𝑆)) ∈ 𝐽)
40	23, 39	eqeltrrd 2841	. . . 4 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ∈ 𝐽)
41		tgpgrp 24068	. . . . . . 7 ⊢ (𝐺 ∈ TopGrp → 𝐺 ∈ Grp)
42	24, 41	syl 17	. . . . . 6 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐺 ∈ Grp)
43	11	3ad2ant2 1140	. . . . . . 7 ⊢ ((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) → 𝑆 ⊆ (Base‘𝐺))
44	43	sselda 3922	. . . . . 6 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ (Base‘𝐺))
45	20, 28	sseldd 3923	. . . . . 6 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ (Base‘𝐺))
46	3, 35, 30	grpnpcan 19006	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺) ∧ 𝐴 ∈ (Base‘𝐺)) → ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝐴) = 𝑥)
47	42, 44, 45, 46	syl3anc 1379	. . . . 5 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝐴) = 𝑥)
48		ovex 7396	. . . . . 6 ⊢ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝐴) ∈ V
49		eqid 2740	. . . . . . 7 ⊢ (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) = (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦))
50		oveq2 7371	. . . . . . 7 ⊢ (𝑦 = 𝐴 → ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦) = ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝐴))
51	49, 50	elrnmpt1s 5908	. . . . . 6 ⊢ ((𝐴 ∈ ((int‘𝐽)‘𝑆) ∧ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝐴) ∈ V) → ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝐴) ∈ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)))
52	28, 48, 51	sylancl 592	. . . . 5 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝐴) ∈ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)))
53	47, 52	eqeltrrd 2841	. . . 4 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)))
54	10	adantr 481	. . . . . . 7 ⊢ ((((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ ((int‘𝐽)‘𝑆)) → 𝑆 ∈ (SubGrp‘𝐺))
55	32	adantr 481	. . . . . . 7 ⊢ ((((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ ((int‘𝐽)‘𝑆)) → (𝑥(-g‘𝐺)𝐴) ∈ 𝑆)
56	27	sselda 3922	. . . . . . 7 ⊢ ((((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ ((int‘𝐽)‘𝑆)) → 𝑦 ∈ 𝑆)
57	35	subgcl 19110	. . . . . . 7 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝑥(-g‘𝐺)𝐴) ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦) ∈ 𝑆)
58	54, 55, 56, 57	syl3anc 1379	. . . . . 6 ⊢ ((((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ ((int‘𝐽)‘𝑆)) → ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦) ∈ 𝑆)
59	58	fmpttd 7063	. . . . 5 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)):((int‘𝐽)‘𝑆)⟶𝑆)
60	59	frnd 6670	. . . 4 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ⊆ 𝑆)
61		eleq2 2829	. . . . . 6 ⊢ (𝑢 = ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) → (𝑥 ∈ 𝑢 ↔ 𝑥 ∈ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦))))
62		sseq1 3947	. . . . . 6 ⊢ (𝑢 = ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) → (𝑢 ⊆ 𝑆 ↔ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ⊆ 𝑆))
63	61, 62	anbi12d 638	. . . . 5 ⊢ (𝑢 = ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) → ((𝑥 ∈ 𝑢 ∧ 𝑢 ⊆ 𝑆) ↔ (𝑥 ∈ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ∧ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ⊆ 𝑆)))
64	63	rspcev 3567	. . . 4 ⊢ ((ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ∈ 𝐽 ∧ (𝑥 ∈ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ∧ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ⊆ 𝑆)) → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ 𝑢 ⊆ 𝑆))
65	40, 53, 60, 64	syl12anc 842	. . 3 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ 𝑢 ⊆ 𝑆))
66	65	ralrimiva 3132	. 2 ⊢ ((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) → ∀𝑥 ∈ 𝑆 ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ 𝑢 ⊆ 𝑆))
67		eltop2 22965	. . 3 ⊢ (𝐽 ∈ Top → (𝑆 ∈ 𝐽 ↔ ∀𝑥 ∈ 𝑆 ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ 𝑢 ⊆ 𝑆)))
68	8, 67	syl 17	. 2 ⊢ ((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) → (𝑆 ∈ 𝐽 ↔ ∀𝑥 ∈ 𝑆 ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ 𝑢 ⊆ 𝑆)))
69	66, 68	mpbird 258	1 ⊢ ((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) → 𝑆 ∈ 𝐽)

Syntax hints:   → wi 4   ↔ wb 207   ∧ wa 396   ∧ w3a 1092   = wceq 1547   ∈ wcel 2119  ∀wral 3054  ∃wrex 3064  Vcvv 3432   ⊆ wss 3890  ∪ cuni 4845   ↦ cmpt 5160  ran crn 5626   ↾ cres 5627   “ cima 5628  ‘cfv 6492  (class class class)co 7363  Basecbs 17177  +_gcplusg 17218  TopOpenctopn 17382  Grpcgrp 18907  -_gcsg 18909  SubGrpcsubg 19094  Topctop 22883  TopOnctopon 22900  intcnt 23007  Homeochmeo 23743  TopGrpctgp 24061

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685  ax-cnex 11092  ax-resscn 11093  ax-1cn 11094  ax-icn 11095  ax-addcl 11096  ax-addrcl 11097  ax-mulcl 11098  ax-mulrcl 11099  ax-mulcom 11100  ax-addass 11101  ax-mulass 11102  ax-distr 11103  ax-i2m1 11104  ax-1ne0 11105  ax-1rid 11106  ax-rnegex 11107  ax-rrecex 11108  ax-cnre 11109  ax-pre-lttri 11110  ax-pre-lttrn 11111  ax-pre-ltadd 11112  ax-pre-mulgt0 11113

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-nel 3040  df-ral 3055  df-rex 3065  df-rmo 3345  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-tr 5187  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7320  df-ov 7366  df-oprab 7367  df-mpo 7368  df-om 7814  df-1st 7938  df-2nd 7939  df-frecs 8228  df-wrecs 8259  df-recs 8308  df-rdg 8346  df-er 8640  df-map 8772  df-en 8891  df-dom 8892  df-sdom 8893  df-pnf 11179  df-mnf 11180  df-xr 11181  df-ltxr 11182  df-le 11183  df-sub 11377  df-neg 11378  df-nn 12173  df-2 12242  df-sets 17132  df-slot 17150  df-ndx 17162  df-base 17178  df-ress 17199  df-plusg 17231  df-0g 17402  df-topgen 17404  df-plusf 18605  df-mgm 18606  df-sgrp 18685  df-mnd 18701  df-grp 18910  df-minusg 18911  df-sbg 18912  df-subg 19097  df-top 22884  df-topon 22901  df-topsp 22923  df-bases 22936  df-ntr 23010  df-cn 23217  df-cnp 23218  df-tx 23552  df-hmeo 23745  df-tmd 24062  df-tgp 24063

This theorem is referenced by: (None)