Theorem tgptsmscls 24363

Description: A sum in a topological group is uniquely determined up to a coset of cls({0}), which is a normal subgroup by clsnsg 24323, 0nsg 19284. (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 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝐺 ∈ TopGrp)
3		tgpgrp 24291	. . . . . . . . . . 11 ⊢ (𝐺 ∈ TopGrp → 𝐺 ∈ Grp)
4	2, 3	syl 18	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝐺 ∈ Grp)
5		eqid 2765	. . . . . . . . . . 11 ⊢ (0g‘𝐺) = (0g‘𝐺)
6	5	0subg 19267	. . . . . . . . . 10 ⊢ (𝐺 ∈ Grp → {(0g‘𝐺)} ∈ (SubGrp‘𝐺))
7	4, 6	syl 18	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → {(0g‘𝐺)} ∈ (SubGrp‘𝐺))
8		tgptsmscls.j	. . . . . . . . . 10 ⊢ 𝐽 = (TopOpen‘𝐺)
9	8	clssubg 24322	. . . . . . . . 9 ⊢ ((𝐺 ∈ TopGrp ∧ {(0g‘𝐺)} ∈ (SubGrp‘𝐺)) → ((cls‘𝐽)‘{(0g‘𝐺)}) ∈ (SubGrp‘𝐺))
10	2, 7, 9	syl2anc 596	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → ((cls‘𝐽)‘{(0g‘𝐺)}) ∈ (SubGrp‘𝐺))
11		tgptsmscls.b	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝐺)
12		eqid 2765	. . . . . . . . 9 ⊢ (𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)})) = (𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)}))
13	11, 12	eqger 19295	. . . . . . . 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 24293	. . . . . . . . . . 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 24348	. . . . . . . . 9 ⊢ (𝜑 → (𝐺 tsums 𝐹) ⊆ 𝐵)
21	20	sselda 3938	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝑥 ∈ 𝐵)
22		tgptsmscls.x	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ∈ (𝐺 tsums 𝐹))
23	20, 22	sseldd 3939	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
24	23	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝑋 ∈ 𝐵)
25		eqid 2765	. . . . . . . . . 10 ⊢ (-g‘𝐺) = (-g‘𝐺)
26	15	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝐺 ∈ CMnd)
27	18	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝐴 ∈ 𝑉)
28	19	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝐹:𝐴⟶𝐵)
29	22	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝑋 ∈ (𝐺 tsums 𝐹))
30		simpr 490	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝑥 ∈ (𝐺 tsums 𝐹))
31	11, 25, 26, 2, 27, 28, 28, 29, 30	tsmssub 24362	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝑋(-g‘𝐺)𝑥) ∈ (𝐺 tsums (𝐹 ∘f (-g‘𝐺)𝐹)))
32	28	ffvelcdmda 7084	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) ∧ 𝑘 ∈ 𝐴) → (𝐹‘𝑘) ∈ 𝐵)
33	28	feqmptd 6954	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝐹 = (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘)))
34	27, 32, 32, 33, 33	offval2 7705	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝐹 ∘f (-g‘𝐺)𝐹) = (𝑘 ∈ 𝐴 ↦ ((𝐹‘𝑘)(-g‘𝐺)(𝐹‘𝑘))))
35	4	adantr 486	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) ∧ 𝑘 ∈ 𝐴) → 𝐺 ∈ Grp)
36	11, 5, 25	grpsubid 19139	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ Grp ∧ (𝐹‘𝑘) ∈ 𝐵) → ((𝐹‘𝑘)(-g‘𝐺)(𝐹‘𝑘)) = (0g‘𝐺))
37	35, 32, 36	syl2anc 596	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) ∧ 𝑘 ∈ 𝐴) → ((𝐹‘𝑘)(-g‘𝐺)(𝐹‘𝑘)) = (0g‘𝐺))
38	37	mpteq2dva 5206	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝑘 ∈ 𝐴 ↦ ((𝐹‘𝑘)(-g‘𝐺)(𝐹‘𝑘))) = (𝑘 ∈ 𝐴 ↦ (0g‘𝐺)))
39	34, 38	eqtrd 2800	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝐹 ∘f (-g‘𝐺)𝐹) = (𝑘 ∈ 𝐴 ↦ (0g‘𝐺)))
40	39	oveq2d 7436	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝐺 tsums (𝐹 ∘f (-g‘𝐺)𝐹)) = (𝐺 tsums (𝑘 ∈ 𝐴 ↦ (0g‘𝐺))))
41	2, 16	syl 18	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝐺 ∈ TopSp)
42	11, 5	grpidcl 19081	. . . . . . . . . . . . . 14 ⊢ (𝐺 ∈ Grp → (0g‘𝐺) ∈ 𝐵)
43	4, 42	syl 18	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (0g‘𝐺) ∈ 𝐵)
44	43	adantr 486	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) ∧ 𝑘 ∈ 𝐴) → (0g‘𝐺) ∈ 𝐵)
45	44	fmpttd 7115	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝑘 ∈ 𝐴 ↦ (0g‘𝐺)):𝐴⟶𝐵)
46		fconstmpt 5725	. . . . . . . . . . . 12 ⊢ (𝐴 × {(0g‘𝐺)}) = (𝑘 ∈ 𝐴 ↦ (0g‘𝐺))
47		fvexd 6901	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (0g‘𝐺) ∈ V)
48	18, 47	fczfsuppd 9354	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐴 × {(0g‘𝐺)}) finSupp (0g‘𝐺))
49	48	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝐴 × {(0g‘𝐺)}) finSupp (0g‘𝐺))
50	46, 49	eqbrtrrid 5149	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝑘 ∈ 𝐴 ↦ (0g‘𝐺)) finSupp (0g‘𝐺))
51	11, 5, 26, 41, 27, 45, 50, 8	tsmsgsum 24352	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝐺 tsums (𝑘 ∈ 𝐴 ↦ (0g‘𝐺))) = ((cls‘𝐽)‘{(𝐺 Σg (𝑘 ∈ 𝐴 ↦ (0g‘𝐺)))}))
52		cmnmnd 19916	. . . . . . . . . . . . . 14 ⊢ (𝐺 ∈ CMnd → 𝐺 ∈ Mnd)
53	26, 52	syl 18	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝐺 ∈ Mnd)
54	5	gsumz 18937	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ Mnd ∧ 𝐴 ∈ 𝑉) → (𝐺 Σg (𝑘 ∈ 𝐴 ↦ (0g‘𝐺))) = (0g‘𝐺))
55	53, 27, 54	syl2anc 596	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝐺 Σg (𝑘 ∈ 𝐴 ↦ (0g‘𝐺))) = (0g‘𝐺))
56	55	sneqd 4603	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → {(𝐺 Σg (𝑘 ∈ 𝐴 ↦ (0g‘𝐺)))} = {(0g‘𝐺)})
57	56	fveq2d 6890	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → ((cls‘𝐽)‘{(𝐺 Σg (𝑘 ∈ 𝐴 ↦ (0g‘𝐺)))}) = ((cls‘𝐽)‘{(0g‘𝐺)}))
58	40, 51, 57	3eqtrd 2804	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝐺 tsums (𝐹 ∘f (-g‘𝐺)𝐹)) = ((cls‘𝐽)‘{(0g‘𝐺)}))
59	31, 58	eleqtrd 2867	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝑋(-g‘𝐺)𝑥) ∈ ((cls‘𝐽)‘{(0g‘𝐺)}))
60		isabl 19903	. . . . . . . . . 10 ⊢ (𝐺 ∈ Abel ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ CMnd))
61	4, 26, 60	sylanbrc 595	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝐺 ∈ Abel)
62	11	subgss 19242	. . . . . . . . . 10 ⊢ (((cls‘𝐽)‘{(0g‘𝐺)}) ∈ (SubGrp‘𝐺) → ((cls‘𝐽)‘{(0g‘𝐺)}) ⊆ 𝐵)
63	10, 62	syl 18	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → ((cls‘𝐽)‘{(0g‘𝐺)}) ⊆ 𝐵)
64	11, 25, 12	eqgabl 19953	. . . . . . . . 9 ⊢ ((𝐺 ∈ Abel ∧ ((cls‘𝐽)‘{(0g‘𝐺)}) ⊆ 𝐵) → (𝑥(𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)}))𝑋 ↔ (𝑥 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ (𝑋(-g‘𝐺)𝑥) ∈ ((cls‘𝐽)‘{(0g‘𝐺)}))))
65	61, 63, 64	syl2anc 596	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → (𝑥(𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)}))𝑋 ↔ (𝑥 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ (𝑋(-g‘𝐺)𝑥) ∈ ((cls‘𝐽)‘{(0g‘𝐺)}))))
66	21, 24, 59, 65	mpbir3and 1361	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝑥(𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)}))𝑋)
67	14, 66	ersym 8714	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝑋(𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)}))𝑥)
68	12	releqg 19290	. . . . . . 7 ⊢ Rel (𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)}))
69		relelec 8749	. . . . . . 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 2765	. . . . . . 7 ⊢ ((cls‘𝐽)‘{(0g‘𝐺)}) = ((cls‘𝐽)‘{(0g‘𝐺)})
73	11, 8, 5, 12, 72	snclseqg 24329	. . . . . 6 ⊢ ((𝐺 ∈ TopGrp ∧ 𝑋 ∈ 𝐵) → [𝑋](𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)})) = ((cls‘𝐽)‘{𝑋}))
74	2, 24, 73	syl2anc 596	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → [𝑋](𝐺 ~QG ((cls‘𝐽)‘{(0g‘𝐺)})) = ((cls‘𝐽)‘{𝑋}))
75	71, 74	eleqtrd 2867	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) → 𝑥 ∈ ((cls‘𝐽)‘{𝑋}))
76	75	ex 418	. . 3 ⊢ (𝜑 → (𝑥 ∈ (𝐺 tsums 𝐹) → 𝑥 ∈ ((cls‘𝐽)‘{𝑋})))
77	76	ssrdv 3944	. 2 ⊢ (𝜑 → (𝐺 tsums 𝐹) ⊆ ((cls‘𝐽)‘{𝑋}))
78	11, 8, 15, 17, 18, 19, 22	tsmscls 24351	. 2 ⊢ (𝜑 → ((cls‘𝐽)‘{𝑋}) ⊆ (𝐺 tsums 𝐹))
79	77, 78	eqssd 3955	1 ⊢ (𝜑 → (𝐺 tsums 𝐹) = ((cls‘𝐽)‘{𝑋}))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  Vcvv 3457   ⊆ wss 3906  {csn 4591   class class class wbr 5111   ↦ cmpt 5194   × cxp 5661  Rel wrel 5668  ⟶wf 6537  ‘cfv 6541  (class class class)co 7420   ∘_f cof 7683   Er wer 8698  [cec 8699   finSupp cfsupp 9329  Basecbs 17296  TopOpenctopn 17501  0_gc0g 17519   Σ_g cgsu 17520  Mndcmnd 18829  Grpcgrp 19049  -_gcsg 19051  SubGrpcsubg 19235   ~_QG cqg 19237  CMndccmn 19899  Abelcabl 19900  TopSpctps 23144  clsccl 23230  TopGrpctgp 24284   tsums ctsu 24339

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 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7743  ax-cnex 11176  ax-resscn 11177  ax-1cn 11178  ax-icn 11179  ax-addcl 11180  ax-addrcl 11181  ax-mulcl 11182  ax-mulrcl 11183  ax-mulcom 11184  ax-addass 11185  ax-mulass 11186  ax-distr 11187  ax-i2m1 11188  ax-1ne0 11189  ax-1rid 11190  ax-rnegex 11191  ax-rrecex 11192  ax-cnre 11193  ax-pre-lttri 11194  ax-pre-lttrn 11195  ax-pre-ltadd 11196  ax-pre-mulgt0 11197

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-iin 4961  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6307  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6497  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-isom 6550  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-of 7685  df-om 7870  df-1st 7993  df-2nd 7994  df-supp 8164  df-frecs 8285  df-wrecs 8316  df-recs 8365  df-rdg 8404  df-1o 8460  df-er 8701  df-ec 8703  df-map 8833  df-en 8951  df-dom 8952  df-sdom 8953  df-fin 8954  df-fsupp 9330  df-oi 9480  df-card 9942  df-pnf 11265  df-mnf 11266  df-xr 11267  df-ltxr 11268  df-le 11269  df-sub 11463  df-neg 11464  df-nn 12254  df-2 12323  df-n0 12525  df-z 12612  df-uz 12884  df-fz 13557  df-fzo 13705  df-seq 14061  df-hash 14390  df-sets 17251  df-slot 17269  df-ndx 17281  df-base 17297  df-ress 17318  df-plusg 17350  df-0g 17521  df-gsum 17522  df-topgen 17523  df-plusf 18724  df-mgm 18725  df-sgrp 18814  df-mnd 18830  df-mhm 18883  df-submnd 18884  df-grp 19052  df-minusg 19053  df-sbg 19054  df-subg 19238  df-eqg 19240  df-ghm 19333  df-cntz 19436  df-cmn 19901  df-abl 19902  df-fbas 21574  df-fg 21575  df-top 23106  df-topon 23123  df-topsp 23145  df-bases 23158  df-cld 23231  df-ntr 23232  df-cls 23233  df-nei 23310  df-cn 23439  df-cnp 23440  df-tx 23775  df-hmeo 23968  df-fil 24059  df-fm 24151  df-flim 24152  df-flf 24153  df-tmd 24285  df-tgp 24286  df-tsms 24340

This theorem is used by:  tgptsmscld  24364