Theorem subgntr 24301

Description: A subgroup of a topological group with nonempty interior is open. Alternatively, dual to clssubg 24303, 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 5679	. . . . . 6 ⊢ ((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) “ ((int‘𝐽)‘𝑆)) = ran ((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ↾ ((int‘𝐽)‘𝑆))
2		subgntr.h	. . . . . . . . . . . 12 ⊢ 𝐽 = (TopOpen‘𝐺)
3		eqid 2766	. . . . . . . . . . . 12 ⊢ (Base‘𝐺) = (Base‘𝐺)
4	2, 3	tgptopon 24276	. . . . . . . . . . 11 ⊢ (𝐺 ∈ TopGrp → 𝐽 ∈ (TopOn‘(Base‘𝐺)))
5	4	3ad2ant1 1151	. . . . . . . . . 10 ⊢ ((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) → 𝐽 ∈ (TopOn‘(Base‘𝐺)))
6	5	adantr 486	. . . . . . . . 9 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐽 ∈ (TopOn‘(Base‘𝐺)))
7		topontop 23107	. . . . . . . . . . . 12 ⊢ (𝐽 ∈ (TopOn‘(Base‘𝐺)) → 𝐽 ∈ Top)
8	5, 7	syl 18	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) → 𝐽 ∈ Top)
9	8	adantr 486	. . . . . . . . . 10 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐽 ∈ Top)
10		simpl2 1211	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑆 ∈ (SubGrp‘𝐺))
11	3	subgss 19224	. . . . . . . . . . . 12 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺))
12	10, 11	syl 18	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑆 ⊆ (Base‘𝐺))
13		toponuni 23108	. . . . . . . . . . . 12 ⊢ (𝐽 ∈ (TopOn‘(Base‘𝐺)) → (Base‘𝐺) = ∪ 𝐽)
14	6, 13	syl 18	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (Base‘𝐺) = ∪ 𝐽)
15	12, 14	sseqtrd 3976	. . . . . . . . . 10 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑆 ⊆ ∪ 𝐽)
16		eqid 2766	. . . . . . . . . . 11 ⊢ ∪ 𝐽 = ∪ 𝐽
17	16	ntropn 23243	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽) → ((int‘𝐽)‘𝑆) ∈ 𝐽)
18	9, 15, 17	syl2anc 596	. . . . . . . . 9 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((int‘𝐽)‘𝑆) ∈ 𝐽)
19		toponss 23121	. . . . . . . . 9 ⊢ ((𝐽 ∈ (TopOn‘(Base‘𝐺)) ∧ ((int‘𝐽)‘𝑆) ∈ 𝐽) → ((int‘𝐽)‘𝑆) ⊆ (Base‘𝐺))
20	6, 18, 19	syl2anc 596	. . . . . . . 8 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((int‘𝐽)‘𝑆) ⊆ (Base‘𝐺))
21	20	resmptd 6047	. . . . . . 7 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ↾ ((int‘𝐽)‘𝑆)) = (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)))
22	21	rneqd 5933	. . . . . 6 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ran ((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ↾ ((int‘𝐽)‘𝑆)) = ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)))
23	1, 22	eqtrid 2813	. . . . 5 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) “ ((int‘𝐽)‘𝑆)) = ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)))
24		simpl1 1210	. . . . . . 7 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐺 ∈ TopGrp)
25		simpr 490	. . . . . . . . 9 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ 𝑆)
26	16	ntrss2 23251	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽) → ((int‘𝐽)‘𝑆) ⊆ 𝑆)
27	9, 15, 26	syl2anc 596	. . . . . . . . . 10 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((int‘𝐽)‘𝑆) ⊆ 𝑆)
28		simpl3 1212	. . . . . . . . . 10 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ ((int‘𝐽)‘𝑆))
29	27, 28	sseldd 3941	. . . . . . . . 9 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ 𝑆)
30		eqid 2766	. . . . . . . . . 10 ⊢ (-g‘𝐺) = (-g‘𝐺)
31	30	subgsubcl 19235	. . . . . . . . 9 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) → (𝑥(-g‘𝐺)𝐴) ∈ 𝑆)
32	10, 25, 29, 31	syl3anc 1398	. . . . . . . 8 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝑥(-g‘𝐺)𝐴) ∈ 𝑆)
33	12, 32	sseldd 3941	. . . . . . 7 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝑥(-g‘𝐺)𝐴) ∈ (Base‘𝐺))
34		eqid 2766	. . . . . . . 8 ⊢ (𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) = (𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦))
35		eqid 2766	. . . . . . . 8 ⊢ (+g‘𝐺) = (+g‘𝐺)
36	34, 3, 35, 2	tgplacthmeo 24297	. . . . . . 7 ⊢ ((𝐺 ∈ TopGrp ∧ (𝑥(-g‘𝐺)𝐴) ∈ (Base‘𝐺)) → (𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ∈ (𝐽Homeo𝐽))
37	24, 33, 36	syl2anc 596	. . . . . 6 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ∈ (𝐽Homeo𝐽))
38		hmeoima 23959	. . . . . 6 ⊢ (((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ∈ (𝐽Homeo𝐽) ∧ ((int‘𝐽)‘𝑆) ∈ 𝐽) → ((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) “ ((int‘𝐽)‘𝑆)) ∈ 𝐽)
39	37, 18, 38	syl2anc 596	. . . . 5 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((𝑦 ∈ (Base‘𝐺) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) “ ((int‘𝐽)‘𝑆)) ∈ 𝐽)
40	23, 39	eqeltrrd 2867	. . . 4 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ∈ 𝐽)
41		tgpgrp 24272	. . . . . . 7 ⊢ (𝐺 ∈ TopGrp → 𝐺 ∈ Grp)
42	24, 41	syl 18	. . . . . 6 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐺 ∈ Grp)
43	11	3ad2ant2 1152	. . . . . . 7 ⊢ ((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) → 𝑆 ⊆ (Base‘𝐺))
44	43	sselda 3940	. . . . . 6 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ (Base‘𝐺))
45	20, 28	sseldd 3941	. . . . . 6 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ (Base‘𝐺))
46	3, 35, 30	grpnpcan 19129	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺) ∧ 𝐴 ∈ (Base‘𝐺)) → ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝐴) = 𝑥)
47	42, 44, 45, 46	syl3anc 1398	. . . . 5 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝐴) = 𝑥)
48		ovex 7456	. . . . . 6 ⊢ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝐴) ∈ V
49		eqid 2766	. . . . . . 7 ⊢ (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) = (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦))
50		oveq2 7431	. . . . . . 7 ⊢ (𝑦 = 𝐴 → ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦) = ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝐴))
51	49, 50	elrnmpt1s 5954	. . . . . 6 ⊢ ((𝐴 ∈ ((int‘𝐽)‘𝑆) ∧ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝐴) ∈ V) → ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝐴) ∈ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)))
52	28, 48, 51	sylancl 598	. . . . 5 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝐴) ∈ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)))
53	47, 52	eqeltrrd 2867	. . . 4 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)))
54	10	adantr 486	. . . . . . 7 ⊢ ((((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ ((int‘𝐽)‘𝑆)) → 𝑆 ∈ (SubGrp‘𝐺))
55	32	adantr 486	. . . . . . 7 ⊢ ((((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ ((int‘𝐽)‘𝑆)) → (𝑥(-g‘𝐺)𝐴) ∈ 𝑆)
56	27	sselda 3940	. . . . . . 7 ⊢ ((((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ ((int‘𝐽)‘𝑆)) → 𝑦 ∈ 𝑆)
57	35	subgcl 19233	. . . . . . 7 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝑥(-g‘𝐺)𝐴) ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦) ∈ 𝑆)
58	54, 55, 56, 57	syl3anc 1398	. . . . . 6 ⊢ ((((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ ((int‘𝐽)‘𝑆)) → ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦) ∈ 𝑆)
59	58	fmpttd 7117	. . . . 5 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)):((int‘𝐽)‘𝑆)⟶𝑆)
60	59	frnd 6721	. . . 4 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ⊆ 𝑆)
61		eleq2 2855	. . . . . 6 ⊢ (𝑢 = ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) → (𝑥 ∈ 𝑢 ↔ 𝑥 ∈ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦))))
62		sseq1 3965	. . . . . 6 ⊢ (𝑢 = ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) → (𝑢 ⊆ 𝑆 ↔ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ⊆ 𝑆))
63	61, 62	anbi12d 644	. . . . 5 ⊢ (𝑢 = ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) → ((𝑥 ∈ 𝑢 ∧ 𝑢 ⊆ 𝑆) ↔ (𝑥 ∈ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ∧ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ⊆ 𝑆)))
64	63	rspcev 3584	. . . 4 ⊢ ((ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ∈ 𝐽 ∧ (𝑥 ∈ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ∧ ran (𝑦 ∈ ((int‘𝐽)‘𝑆) ↦ ((𝑥(-g‘𝐺)𝐴)(+g‘𝐺)𝑦)) ⊆ 𝑆)) → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ 𝑢 ⊆ 𝑆))
65	40, 53, 60, 64	syl12anc 850	. . 3 ⊢ (((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ 𝑢 ⊆ 𝑆))
66	65	ralrimiva 3160	. 2 ⊢ ((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) → ∀𝑥 ∈ 𝑆 ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ 𝑢 ⊆ 𝑆))
67		eltop2 23169	. . 3 ⊢ (𝐽 ∈ Top → (𝑆 ∈ 𝐽 ↔ ∀𝑥 ∈ 𝑆 ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ 𝑢 ⊆ 𝑆)))
68	8, 67	syl 18	. 2 ⊢ ((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) → (𝑆 ∈ 𝐽 ↔ ∀𝑥 ∈ 𝑆 ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ 𝑢 ⊆ 𝑆)))
69	66, 68	mpbird 260	1 ⊢ ((𝐺 ∈ TopGrp ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ((int‘𝐽)‘𝑆)) → 𝑆 ∈ 𝐽)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∀wral 3082  ∃wrex 3092  Vcvv 3458   ⊆ wss 3908  ∪ cuni 4877   ↦ cmpt 5197  ran crn 5667   ↾ cres 5668   “ cima 5669  ‘cfv 6543  (class class class)co 7423  Basecbs 17294  +_gcplusg 17335  TopOpenctopn 17499  Grpcgrp 19031  -_gcsg 19033  SubGrpcsubg 19217  Topctop 23087  TopOnctopon 23104  intcnt 23211  Homeochmeo 23947  TopGrpctgp 24265

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745  ax-cnex 11174  ax-resscn 11175  ax-1cn 11176  ax-icn 11177  ax-addcl 11178  ax-addrcl 11179  ax-mulcl 11180  ax-mulrcl 11181  ax-mulcom 11182  ax-addass 11183  ax-mulass 11184  ax-distr 11185  ax-i2m1 11186  ax-1ne0 11187  ax-1rid 11188  ax-rnegex 11189  ax-rrecex 11190  ax-cnre 11191  ax-pre-lttri 11192  ax-pre-lttrn 11193  ax-pre-ltadd 11194  ax-pre-mulgt0 11195

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-nel 3068  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309  df-ord 6370  df-on 6371  df-lim 6372  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-om 7872  df-1st 7995  df-2nd 7996  df-frecs 8287  df-wrecs 8318  df-recs 8367  df-rdg 8406  df-er 8703  df-map 8835  df-en 8953  df-dom 8954  df-sdom 8955  df-pnf 11263  df-mnf 11264  df-xr 11265  df-ltxr 11266  df-le 11267  df-sub 11461  df-neg 11462  df-nn 12252  df-2 12321  df-sets 17249  df-slot 17267  df-ndx 17279  df-base 17295  df-ress 17316  df-plusg 17348  df-0g 17519  df-topgen 17521  df-plusf 18722  df-mgm 18723  df-sgrp 18806  df-mnd 18822  df-grp 19034  df-minusg 19035  df-sbg 19036  df-subg 19220  df-top 23088  df-topon 23105  df-topsp 23127  df-bases 23140  df-ntr 23214  df-cn 23421  df-cnp 23422  df-tx 23756  df-hmeo 23949  df-tmd 24266  df-tgp 24267

This theorem is used by: (None)