Theorem subgntr 23166

Description: A subgroup of a topological group with nonempty interior is open. Alternatively, dual to clssubg 23168, 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 5593	. . . . . 6 ⊢ ((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) “ ((int‘𝐽)‘𝑆)) = ran ((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ↾ ((int‘𝐽)‘𝑆))
2		subgntr.h	. . . . . . . . . . . 12 ⊢ 𝐽 = (TopOpen‘𝐺)
3		eqid 2738	. . . . . . . . . . . 12 ⊢ (Base‘𝐺) = (Base‘𝐺)
4	2, 3	tgptopon 23141	. . . . . . . . . . 11 ⊢ (𝐺 ∈ TopGrp → 𝐽 ∈ (TopOn‘(Base‘𝐺)))
5	4	3ad2ant1 1131	. . . . . . . . . 10 ⊢ ((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) → 𝐽 ∈ (TopOn‘(Base‘𝐺)))
6	5	adantr 480	. . . . . . . . 9 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐽 ∈ (TopOn‘(Base‘𝐺)))
7		topontop 21970	. . . . . . . . . . . 12 ⊢ (𝐽 ∈ (TopOn‘(Base‘𝐺)) → 𝐽 ∈ Top)
8	5, 7	syl 17	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) → 𝐽 ∈ Top)
9	8	adantr 480	. . . . . . . . . 10 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐽 ∈ Top)
10		simpl2 1190	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑆 ∈ (SubGrp‘𝐺))
11	3	subgss 18671	. . . . . . . . . . . 12 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺))
12	10, 11	syl 17	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑆 ⊆ (Base‘𝐺))
13		toponuni 21971	. . . . . . . . . . . 12 ⊢ (𝐽 ∈ (TopOn‘(Base‘𝐺)) → (Base‘𝐺) = ∪ 𝐽)
14	6, 13	syl 17	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (Base‘𝐺) = ∪ 𝐽)
15	12, 14	sseqtrd 3957	. . . . . . . . . 10 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑆 ⊆ ∪ 𝐽)
16		eqid 2738	. . . . . . . . . . 11 ⊢ ∪ 𝐽 = ∪ 𝐽
17	16	ntropn 22108	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽) → ((int‘𝐽)‘𝑆) ∈ 𝐽)
18	9, 15, 17	syl2anc 583	. . . . . . . . 9 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((int‘𝐽)‘𝑆) ∈ 𝐽)
19		toponss 21984	. . . . . . . . 9 ⊢ ((𝐽 ∈ (TopOn‘(Base‘𝐺)) ∧ ((int‘𝐽)‘𝑆) ∈ 𝐽) → ((int‘𝐽)‘𝑆) ⊆ (Base‘𝐺))
20	6, 18, 19	syl2anc 583	. . . . . . . 8 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((int‘𝐽)‘𝑆) ⊆ (Base‘𝐺))
21	20	resmptd 5937	. . . . . . 7 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ↾ ((int‘𝐽)‘𝑆)) = (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)))
22	21	rneqd 5836	. . . . . 6 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ran ((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ↾ ((int‘𝐽)‘𝑆)) = ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)))
23	1, 22	eqtrid 2790	. . . . 5 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) “ ((int‘𝐽)‘𝑆)) = ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)))
24		simpl1 1189	. . . . . . 7 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐺 ∈ TopGrp)
25		simpr 484	. . . . . . . . 9 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ 𝑆)
26	16	ntrss2 22116	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽) → ((int‘𝐽)‘𝑆) ⊆ 𝑆)
27	9, 15, 26	syl2anc 583	. . . . . . . . . 10 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((int‘𝐽)‘𝑆) ⊆ 𝑆)
28		simpl3 1191	. . . . . . . . . 10 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ ((int‘𝐽)‘𝑆))
29	27, 28	sseldd 3918	. . . . . . . . 9 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ 𝑆)
30		eqid 2738	. . . . . . . . . 10 ⊢ (-g‘𝐺) = (-g‘𝐺)
31	30	subgsubcl 18681	. . . . . . . . 9 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) → (𝑥(-g‘𝐺)𝐴) ∈ 𝑆)
32	10, 25, 29, 31	syl3anc 1369	. . . . . . . 8 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝑥(-g‘𝐺)𝐴) ∈ 𝑆)
33	12, 32	sseldd 3918	. . . . . . 7 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝑥(-g‘𝐺)𝐴) ∈ (Base‘𝐺))
34		eqid 2738	. . . . . . . 8 ⊢ (𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) = (𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦))
35		eqid 2738	. . . . . . . 8 ⊢ (+g‘𝐺) = (+g‘𝐺)
36	34, 3, 35, 2	tgplacthmeo 23162	. . . . . . 7 ⊢ ((𝐺 ∈ TopGrp ∧ (𝑥(-g‘𝐺)𝐴) ∈ (Base‘𝐺)) → (𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ∈ (𝐽Homeo𝐽))
37	24, 33, 36	syl2anc 583	. . . . . 6 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ∈ (𝐽Homeo𝐽))
38		hmeoima 22824	. . . . . 6 ⊢ (((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ∈ (𝐽Homeo𝐽) ∧ ((int‘𝐽)‘𝑆) ∈ 𝐽) → ((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) “ ((int‘𝐽)‘𝑆)) ∈ 𝐽)
39	37, 18, 38	syl2anc 583	. . . . 5 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) “ ((int‘𝐽)‘𝑆)) ∈ 𝐽)
40	23, 39	eqeltrrd 2840	. . . 4 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ∈ 𝐽)
41		tgpgrp 23137	. . . . . . 7 ⊢ (𝐺 ∈ TopGrp → 𝐺 ∈ Grp)
42	24, 41	syl 17	. . . . . 6 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐺 ∈ Grp)
43	11	3ad2ant2 1132	. . . . . . 7 ⊢ ((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) → 𝑆 ⊆ (Base‘𝐺))
44	43	sselda 3917	. . . . . 6 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ (Base‘𝐺))
45	20, 28	sseldd 3918	. . . . . 6 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ (Base‘𝐺))
46	3, 35, 30	grpnpcan 18582	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺) ∧ 𝐴 ∈ (Base‘𝐺)) → ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝐴) = 𝑥)
47	42, 44, 45, 46	syl3anc 1369	. . . . 5 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝐴) = 𝑥)
48		ovex 7288	. . . . . 6 ⊢ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝐴) ∈ V
49		eqid 2738	. . . . . . 7 ⊢ (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) = (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦))
50		oveq2 7263	. . . . . . 7 ⊢ (𝑦 = 𝐴 → ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦) = ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝐴))
51	49, 50	elrnmpt1s 5855	. . . . . 6 ⊢ ((𝐴 ∈ ((int‘𝐽)‘𝑆) ∧ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝐴) ∈ V) → ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝐴) ∈ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)))
52	28, 48, 51	sylancl 585	. . . . 5 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝐴) ∈ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)))
53	47, 52	eqeltrrd 2840	. . . 4 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)))
54	10	adantr 480	. . . . . . 7 ⊢ ((((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ ((int‘𝐽)‘𝑆)) → 𝑆 ∈ (SubGrp‘𝐺))
55	32	adantr 480	. . . . . . 7 ⊢ ((((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ ((int‘𝐽)‘𝑆)) → (𝑥(-g‘𝐺)𝐴) ∈ 𝑆)
56	27	sselda 3917	. . . . . . 7 ⊢ ((((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ ((int‘𝐽)‘𝑆)) → 𝑦 ∈ 𝑆)
57	35	subgcl 18680	. . . . . . 7 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝑥(-g‘𝐺)𝐴) ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦) ∈ 𝑆)
58	54, 55, 56, 57	syl3anc 1369	. . . . . 6 ⊢ ((((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ ((int‘𝐽)‘𝑆)) → ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦) ∈ 𝑆)
59	58	fmpttd 6971	. . . . 5 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)):((int‘𝐽)‘𝑆)⟶𝑆)
60	59	frnd 6592	. . . 4 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ⊆ 𝑆)
61		eleq2 2827	. . . . . 6 ⊢ (𝑢 = ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) → (𝑥 ∈ 𝑢 ↔ 𝑥 ∈ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦))))
62		sseq1 3942	. . . . . 6 ⊢ (𝑢 = ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) → (𝑢 ⊆ 𝑆 ↔ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ⊆ 𝑆))
63	61, 62	anbi12d 630	. . . . 5 ⊢ (𝑢 = ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) → ((𝑥 ∈ 𝑢 ∧ 𝑢 ⊆ 𝑆) ↔ (𝑥 ∈ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ∧ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ⊆ 𝑆)))
64	63	rspcev 3552	. . . 4 ⊢ ((ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ∈ 𝐽 ∧ (𝑥 ∈ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ∧ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ⊆ 𝑆)) → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ 𝑢 ⊆ 𝑆))
65	40, 53, 60, 64	syl12anc 833	. . 3 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ 𝑢 ⊆ 𝑆))
66	65	ralrimiva 3107	. 2 ⊢ ((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) → ∀𝑥 ∈ 𝑆 ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ 𝑢 ⊆ 𝑆))
67		eltop2 22033	. . 3 ⊢ (𝐽 ∈ Top → (𝑆 ∈ 𝐽 ↔ ∀𝑥 ∈ 𝑆 ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ 𝑢 ⊆ 𝑆)))
68	8, 67	syl 17	. 2 ⊢ ((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) → (𝑆 ∈ 𝐽 ↔ ∀𝑥 ∈ 𝑆 ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ 𝑢 ⊆ 𝑆)))
69	66, 68	mpbird 256	1 ⊢ ((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) → 𝑆 ∈ 𝐽)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108  ∀wral 3063  ∃wrex 3064  Vcvv 3422   ⊆ wss 3883  ∪ cuni 4836   ↦ cmpt 5153  ran crn 5581   ↾ cres 5582   “ cima 5583  ‘cfv 6418  (class class class)co 7255  Basecbs 16840  +_gcplusg 16888  TopOpenctopn 17049  Grpcgrp 18492  -_gcsg 18494  SubGrpcsubg 18664  Topctop 21950  TopOnctopon 21967  intcnt 22076  Homeochmeo 22812  TopGrpctgp 23130

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-cnex 10858  ax-resscn 10859  ax-1cn 10860  ax-icn 10861  ax-addcl 10862  ax-addrcl 10863  ax-mulcl 10864  ax-mulrcl 10865  ax-mulcom 10866  ax-addass 10867  ax-mulass 10868  ax-distr 10869  ax-i2m1 10870  ax-1ne0 10871  ax-1rid 10872  ax-rnegex 10873  ax-rrecex 10874  ax-cnre 10875  ax-pre-lttri 10876  ax-pre-lttrn 10877  ax-pre-ltadd 10878  ax-pre-mulgt0 10879

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-nel 3049  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-1st 7804  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-er 8456  df-map 8575  df-en 8692  df-dom 8693  df-sdom 8694  df-pnf 10942  df-mnf 10943  df-xr 10944  df-ltxr 10945  df-le 10946  df-sub 11137  df-neg 11138  df-nn 11904  df-2 11966  df-sets 16793  df-slot 16811  df-ndx 16823  df-base 16841  df-ress 16868  df-plusg 16901  df-0g 17069  df-topgen 17071  df-plusf 18240  df-mgm 18241  df-sgrp 18290  df-mnd 18301  df-grp 18495  df-minusg 18496  df-sbg 18497  df-subg 18667  df-top 21951  df-topon 21968  df-topsp 21990  df-bases 22004  df-ntr 22079  df-cn 22286  df-cnp 22287  df-tx 22621  df-hmeo 22814  df-tmd 23131  df-tgp 23132

This theorem is referenced by: (None)