Theorem tgptsmscls 24316

Description: A sum in a topological group is uniquely determined up to a coset of cls({0}), which is a normal subgroup by clsnsg 24276, 0nsg 19239. (Contributed by Mario Carneiro, 22-Sep-2015.) (Proof shortened by AV, 24-Jul-2019.)

Hypotheses

Ref	Expression
tgptsmscls.b	⊢ 𝐵 = (Base‘𝐺)
tgptsmscls.j	⊢ 𝐽 = (TopOpen‘𝐺)
tgptsmscls.1	⊢ (𝜑 → 𝐺 ∈ CMnd)
tgptsmscls.2	⊢ (𝜑 → 𝐺 ∈ TopGrp)
tgptsmscls.a	⊢ (𝜑 → 𝐴 ∈ 𝑉)
tgptsmscls.f	⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
tgptsmscls.x	⊢ (𝜑 → 𝑋 ∈ (𝐺 tsums 𝐹))

Assertion

Ref	Expression
tgptsmscls	⊢ (𝜑 → (𝐺 tsums 𝐹) = ((cls‘𝐽)‘{𝑋}))

Proof of Theorem tgptsmscls

Dummy variables 𝑘 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		tgptsmscls.2	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺 ∈ TopGrp)
2	1	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝐺 ∈ TopGrp)
3		tgpgrp 24244	. . . . . . . . . . 11 ⊢ (𝐺 ∈ TopGrp → 𝐺 ∈ Grp)
4	2, 3	syl 18	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝐺 ∈ Grp)
5		eqid 2763	. . . . . . . . . . 11 ⊢ (0g‘𝐺) = (0g‘𝐺)
6	5	0subg 19222	. . . . . . . . . 10 ⊢ (𝐺 ∈ Grp → {(0g‘𝐺)} ∈ (SubGrp‘𝐺))
7	4, 6	syl 18	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → {(0g‘𝐺)} ∈ (SubGrp‘𝐺))
8		tgptsmscls.j	. . . . . . . . . 10 ⊢ 𝐽 = (TopOpen‘𝐺)
9	8	clssubg 24275	. . . . . . . . 9 ⊢ ((𝐺 ∈ TopGrp ∧ {(0g‘𝐺)} ∈ (SubGrp‘𝐺)) → ((cls‘𝐽)‘{(0g‘𝐺)}) ∈ (SubGrp‘𝐺))
10	2, 7, 9	syl2anc 595	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → ((cls‘𝐽)‘{(0g‘𝐺)}) ∈ (SubGrp‘𝐺))
11		tgptsmscls.b	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝐺)
12		eqid 2763	. . . . . . . . 9 ⊢ (𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)})) = (𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)}))
13	11, 12	eqger 19250	. . . . . . . 8 ⊢ (((cls‘𝐽)‘{(0g‘𝐺)}) ∈ (SubGrp‘𝐺) → (𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)})) Er 𝐵)
14	10, 13	syl 18	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)})) Er 𝐵)
15		tgptsmscls.1	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺 ∈ CMnd)
16		tgptps 24246	. . . . . . . . . . 11 ⊢ (𝐺 ∈ TopGrp → 𝐺 ∈ TopSp)
17	1, 16	syl 18	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺 ∈ TopSp)
18		tgptsmscls.a	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
19		tgptsmscls.f	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
20	11, 15, 17, 18, 19	tsmscl 24301	. . . . . . . . 9 ⊢ (𝜑 → (𝐺 tsums 𝐹) ⊆ 𝐵)
21	20	sselda 3937	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝑥 ∈ 𝐵)
22		tgptsmscls.x	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ∈ (𝐺 tsums 𝐹))
23	20, 22	sseldd 3938	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
24	23	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝑋 ∈ 𝐵)
25		eqid 2763	. . . . . . . . . 10 ⊢ (-g‘𝐺) = (-g‘𝐺)
26	15	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝐺 ∈ CMnd)
27	18	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝐴 ∈ 𝑉)
28	19	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝐹:𝐴⟶𝐵)
29	22	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝑋 ∈ (𝐺 tsums 𝐹))
30		simpr 489	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝑥 ∈ (𝐺 tsums 𝐹))
31	11, 25, 26, 2, 27, 28, 28, 29, 30	tsmssub 24315	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝑋(-g‘𝐺)𝑥) ∈ (𝐺 tsums (𝐹 ∘f (-g‘𝐺)𝐹)))
32	28	ffvelcdmda 7079	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) ∧ 𝑘 ∈ 𝐴) → (𝐹‘𝑘) ∈ 𝐵)
33	28	feqmptd 6949	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝐹 = (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘)))
34	27, 32, 32, 33, 33	offval2 7694	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝐹 ∘f (-g‘𝐺)𝐹) = (𝑘 ∈ 𝐴 ↦ ((𝐹‘𝑘)(-g‘𝐺)(𝐹‘𝑘))))
35	4	adantr 485	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) ∧ 𝑘 ∈ 𝐴) → 𝐺 ∈ Grp)
36	11, 5, 25	grpsubid 19094	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ Grp ∧ (𝐹‘𝑘) ∈ 𝐵) → ((𝐹‘𝑘)(-g‘𝐺)(𝐹‘𝑘)) = (0g‘𝐺))
37	35, 32, 36	syl2anc 595	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) ∧ 𝑘 ∈ 𝐴) → ((𝐹‘𝑘)(-g‘𝐺)(𝐹‘𝑘)) = (0g‘𝐺))
38	37	mpteq2dva 5204	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝑘 ∈ 𝐴 ↦ ((𝐹‘𝑘)(-g‘𝐺)(𝐹‘𝑘))) = (𝑘 ∈ 𝐴 ↦ (0g‘𝐺)))
39	34, 38	eqtrd 2798	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝐹 ∘f (-g‘𝐺)𝐹) = (𝑘 ∈ 𝐴 ↦ (0g‘𝐺)))
40	39	oveq2d 7426	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝐺 tsums (𝐹 ∘f (-g‘𝐺)𝐹)) = (𝐺 tsums (𝑘 ∈ 𝐴 ↦ (0g‘𝐺))))
41	2, 16	syl 18	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝐺 ∈ TopSp)
42	11, 5	grpidcl 19036	. . . . . . . . . . . . . 14 ⊢ (𝐺 ∈ Grp → (0g‘𝐺) ∈ 𝐵)
43	4, 42	syl 18	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (0g‘𝐺) ∈ 𝐵)
44	43	adantr 485	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) ∧ 𝑘 ∈ 𝐴) → (0g‘𝐺) ∈ 𝐵)
45	44	fmpttd 7110	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝑘 ∈ 𝐴 ↦ (0g‘𝐺)):𝐴⟶𝐵)
46		fconstmpt 5723	. . . . . . . . . . . 12 ⊢ (𝐴 × {(0g‘𝐺)}) = (𝑘 ∈ 𝐴 ↦ (0g‘𝐺))
47		fvexd 6896	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (0g‘𝐺) ∈ V)
48	18, 47	fczfsuppd 9342	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐴 × {(0g‘𝐺)}) finSupp (0g‘𝐺))
49	48	adantr 485	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝐴 × {(0g‘𝐺)}) finSupp (0g‘𝐺))
50	46, 49	eqbrtrrid 5147	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝑘 ∈ 𝐴 ↦ (0g‘𝐺)) finSupp (0g‘𝐺))
51	11, 5, 26, 41, 27, 45, 50, 8	tsmsgsum 24305	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝐺 tsums (𝑘 ∈ 𝐴 ↦ (0g‘𝐺))) = ((cls‘𝐽)‘{(𝐺 Σg (𝑘 ∈ 𝐴 ↦ (0g‘𝐺)))}))
52		cmnmnd 19871	. . . . . . . . . . . . . 14 ⊢ (𝐺 ∈ CMnd → 𝐺 ∈ Mnd)
53	26, 52	syl 18	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝐺 ∈ Mnd)
54	5	gsumz 18899	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ Mnd ∧ 𝐴 ∈ 𝑉) → (𝐺 Σg (𝑘 ∈ 𝐴 ↦ (0g‘𝐺))) = (0g‘𝐺))
55	53, 27, 54	syl2anc 595	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝐺 Σg (𝑘 ∈ 𝐴 ↦ (0g‘𝐺))) = (0g‘𝐺))
56	55	sneqd 4601	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → {(𝐺 Σg (𝑘 ∈ 𝐴 ↦ (0g‘𝐺)))} = {(0g‘𝐺)})
57	56	fveq2d 6885	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → ((cls‘𝐽)‘{(𝐺 Σg (𝑘 ∈ 𝐴 ↦ (0g‘𝐺)))}) = ((cls‘𝐽)‘{(0g‘𝐺)}))
58	40, 51, 57	3eqtrd 2802	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝐺 tsums (𝐹 ∘f (-g‘𝐺)𝐹)) = ((cls‘𝐽)‘{(0g‘𝐺)}))
59	31, 58	eleqtrd 2865	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝑋(-g‘𝐺)𝑥) ∈ ((cls‘𝐽)‘{(0g‘𝐺)}))
60		isabl 19858	. . . . . . . . . 10 ⊢ (𝐺 ∈ Abel ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ CMnd))
61	4, 26, 60	sylanbrc 594	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝐺 ∈ Abel)
62	11	subgss 19197	. . . . . . . . . 10 ⊢ (((cls‘𝐽)‘{(0g‘𝐺)}) ∈ (SubGrp‘𝐺) → ((cls‘𝐽)‘{(0g‘𝐺)}) ⊆ 𝐵)
63	10, 62	syl 18	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → ((cls‘𝐽)‘{(0g‘𝐺)}) ⊆ 𝐵)
64	11, 25, 12	eqgabl 19908	. . . . . . . . 9 ⊢ ((𝐺 ∈ Abel ∧ ((cls‘𝐽)‘{(0g‘𝐺)}) ⊆ 𝐵) → (𝑥(𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)}))𝑋 ↔ (𝑥 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ (𝑋(-g‘𝐺)𝑥) ∈ ((cls‘𝐽)‘{(0g‘𝐺)}))))
65	61, 63, 64	syl2anc 595	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝑥(𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)}))𝑋 ↔ (𝑥 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ (𝑋(-g‘𝐺)𝑥) ∈ ((cls‘𝐽)‘{(0g‘𝐺)}))))
66	21, 24, 59, 65	mpbir3and 1361	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝑥(𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)}))𝑋)
67	14, 66	ersym 8703	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝑋(𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)}))𝑥)
68	12	releqg 19245	. . . . . . 7 ⊢ Rel (𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)}))
69		relelec 8738	. . . . . . 7 ⊢ (Rel (𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)})) → (𝑥 ∈ [𝑋](𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)})) ↔ 𝑋(𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)}))𝑥))
70	68, 69	ax-mp 5	. . . . . 6 ⊢ (𝑥 ∈ [𝑋](𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)})) ↔ 𝑋(𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)}))𝑥)
71	67, 70	sylibr 237	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝑥 ∈ [𝑋](𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)})))
72		eqid 2763	. . . . . . 7 ⊢ ((cls‘𝐽)‘{(0g‘𝐺)}) = ((cls‘𝐽)‘{(0g‘𝐺)})
73	11, 8, 5, 12, 72	snclseqg 24282	. . . . . 6 ⊢ ((𝐺 ∈ TopGrp ∧ 𝑋 ∈ 𝐵) → [𝑋](𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)})) = ((cls‘𝐽)‘{𝑋}))
74	2, 24, 73	syl2anc 595	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → [𝑋](𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)})) = ((cls‘𝐽)‘{𝑋}))
75	71, 74	eleqtrd 2865	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝑥 ∈ ((cls‘𝐽)‘{𝑋}))
76	75	ex 417	. . 3 ⊢ (𝜑 → (𝑥 ∈ (𝐺 tsums 𝐹) → 𝑥 ∈ ((cls‘𝐽)‘{𝑋})))
77	76	ssrdv 3943	. 2 ⊢ (𝜑 → (𝐺 tsums 𝐹) ⊆ ((cls‘𝐽)‘{𝑋}))
78	11, 8, 15, 17, 18, 19, 22	tsmscls 24304	. 2 ⊢ (𝜑 → ((cls‘𝐽)‘{𝑋}) ⊆ (𝐺 tsums 𝐹))
79	77, 78	eqssd 3954	1 ⊢ (𝜑 → (𝐺 tsums 𝐹) = ((cls‘𝐽)‘{𝑋}))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143  Vcvv 3455   ⊆ wss 3905  {csn 4589   class class class wbr 5109   ↦ cmpt 5192   × cxp 5659  Rel wrel 5666  ⟶wf 6532  ‘cfv 6536  (class class class)co 7410   ∘_f cof 7672   Er wer 8687  [cec 8688   finSupp cfsupp 9317  Basecbs 17273  TopOpenctopn 17478  0_gc0g 17496   Σ_g cgsu 17497  Mndcmnd 18796  Grpcgrp 19004  -_gcsg 19006  SubGrpcsubg 19190   ~_QG cqg 19192  CMndccmn 19854  Abelcabl 19855  TopSpctps 23098  clsccl 23184  TopGrpctgp 24237   tsums ctsu 24292

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-cnex 11160  ax-resscn 11161  ax-1cn 11162  ax-icn 11163  ax-addcl 11164  ax-addrcl 11165  ax-mulcl 11166  ax-mulrcl 11167  ax-mulcom 11168  ax-addass 11169  ax-mulass 11170  ax-distr 11171  ax-i2m1 11172  ax-1ne0 11173  ax-1rid 11174  ax-rnegex 11175  ax-rrecex 11176  ax-cnre 11177  ax-pre-lttri 11178  ax-pre-lttrn 11179  ax-pre-ltadd 11180  ax-pre-mulgt0 11181

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-iin 4959  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-se 5615  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-isom 6545  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-of 7674  df-om 7859  df-1st 7982  df-2nd 7983  df-supp 8153  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-er 8690  df-ec 8692  df-map 8822  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-fsupp 9318  df-oi 9468  df-card 9930  df-pnf 11249  df-mnf 11250  df-xr 11251  df-ltxr 11252  df-le 11253  df-sub 11447  df-neg 11448  df-nn 12238  df-2 12307  df-n0 12509  df-z 12596  df-uz 12867  df-fz 13540  df-fzo 13688  df-seq 14043  df-hash 14372  df-sets 17228  df-slot 17246  df-ndx 17258  df-base 17274  df-ress 17295  df-plusg 17327  df-0g 17498  df-gsum 17499  df-topgen 17500  df-plusf 18701  df-mgm 18702  df-sgrp 18781  df-mnd 18797  df-mhm 18845  df-submnd 18846  df-grp 19007  df-minusg 19008  df-sbg 19009  df-subg 19193  df-eqg 19195  df-ghm 19288  df-cntz 19391  df-cmn 19856  df-abl 19857  df-fbas 21528  df-fg 21529  df-top 23060  df-topon 23077  df-topsp 23099  df-bases 23112  df-cld 23185  df-ntr 23186  df-cls 23187  df-nei 23264  df-cn 23393  df-cnp 23394  df-tx 23728  df-hmeo 23921  df-fil 24012  df-fm 24104  df-flim 24105  df-flf 24106  df-tmd 24238  df-tgp 24239  df-tsms 24293

This theorem is used by:  tgptsmscld  24317