bcthlem2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > bcthlem2		Structured version Visualization version GIF version

Theorem bcthlem2 23929

Description: Lemma for bcth 23933. The balls in the sequence form an inclusion chain. (Contributed by Mario Carneiro, 7-Jan-2014.)

**Hypotheses**
Ref	Expression
bcth.2	⊢ 𝐽 = (MetOpen‘𝐷)
bcthlem.4	⊢ (𝜑 → 𝐷 ∈ (CMet‘𝑋))
bcthlem.5	⊢ 𝐹 = (𝑘 ∈ ℕ, 𝑧 ∈ (𝑋 × ℝ⁺) ↦ {⟨𝑥, 𝑟⟩ ∣ ((𝑥 ∈ 𝑋 ∧ 𝑟 ∈ ℝ⁺) ∧ (𝑟 < (1 / 𝑘) ∧ ((cls‘𝐽)‘(𝑥(ball‘𝐷)𝑟)) ⊆ (((ball‘𝐷)‘𝑧) ∖ (𝑀‘𝑘))))})
bcthlem.6	⊢ (𝜑 → 𝑀:ℕ⟶(Clsd‘𝐽))
bcthlem.7	⊢ (𝜑 → 𝑅 ∈ ℝ⁺)
bcthlem.8	⊢ (𝜑 → 𝐶 ∈ 𝑋)
bcthlem.9	⊢ (𝜑 → 𝑔:ℕ⟶(𝑋 × ℝ⁺))
bcthlem.10	⊢ (𝜑 → (𝑔‘1) = ⟨𝐶, 𝑅⟩)
bcthlem.11	⊢ (𝜑 → ∀𝑘 ∈ ℕ (𝑔‘(𝑘 + 1)) ∈ (𝑘𝐹(𝑔‘𝑘)))

**Assertion**
Ref	Expression
bcthlem2	⊢ (𝜑 → ∀𝑛 ∈ ℕ ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝑔‘𝑛)))

Distinct variable groups: 𝑘,𝑛,𝑟,𝑥,𝑧 𝐶,𝑟,𝑥 𝑔,𝑘,𝑛,𝑟,𝑥,𝑧,𝐷 𝑔,𝐹,𝑘,𝑛,𝑟,𝑥,𝑧 𝑔,𝐽,𝑘,𝑛,𝑟,𝑥,𝑧 𝑔,𝑀,𝑘,𝑛,𝑟,𝑥,𝑧 𝜑,𝑘,𝑛,𝑟,𝑥,𝑧 𝑥,𝑅 𝑔,𝑋,𝑘,𝑛,𝑟,𝑥,𝑧 Allowed substitution hints: 𝜑(𝑔) 𝐶(𝑧,𝑔,𝑘,𝑛) 𝑅(𝑧,𝑔,𝑘,𝑛,𝑟)

**Proof of Theorem bcthlem2**
Step	Hyp	Ref	Expression
1		bcthlem.11	. . . . 5 ⊢ (𝜑 → ∀𝑘 ∈ ℕ (𝑔‘(𝑘 + 1)) ∈ (𝑘𝐹(𝑔‘𝑘)))
2		fvoveq1 7158	. . . . . . 7 ⊢ (𝑘 = 𝑛 → (𝑔‘(𝑘 + 1)) = (𝑔‘(𝑛 + 1)))
3		id 22	. . . . . . . 8 ⊢ (𝑘 = 𝑛 → 𝑘 = 𝑛)
4		fveq2 6645	. . . . . . . 8 ⊢ (𝑘 = 𝑛 → (𝑔‘𝑘) = (𝑔‘𝑛))
5	3, 4	oveq12d 7153	. . . . . . 7 ⊢ (𝑘 = 𝑛 → (𝑘𝐹(𝑔‘𝑘)) = (𝑛𝐹(𝑔‘𝑛)))
6	2, 5	eleq12d 2884	. . . . . 6 ⊢ (𝑘 = 𝑛 → ((𝑔‘(𝑘 + 1)) ∈ (𝑘𝐹(𝑔‘𝑘)) ↔ (𝑔‘(𝑛 + 1)) ∈ (𝑛𝐹(𝑔‘𝑛))))
7	6	rspccva 3570	. . . . 5 ⊢ ((∀𝑘 ∈ ℕ (𝑔‘(𝑘 + 1)) ∈ (𝑘𝐹(𝑔‘𝑘)) ∧ 𝑛 ∈ ℕ) → (𝑔‘(𝑛 + 1)) ∈ (𝑛𝐹(𝑔‘𝑛)))
8	1, 7	sylan 583	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑔‘(𝑛 + 1)) ∈ (𝑛𝐹(𝑔‘𝑛)))
9		bcthlem.9	. . . . . 6 ⊢ (𝜑 → 𝑔:ℕ⟶(𝑋 × ℝ⁺))
10	9	ffvelrnda 6828	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑔‘𝑛) ∈ (𝑋 × ℝ⁺))
11		bcth.2	. . . . . . 7 ⊢ 𝐽 = (MetOpen‘𝐷)
12		bcthlem.4	. . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ (CMet‘𝑋))
13		bcthlem.5	. . . . . . 7 ⊢ 𝐹 = (𝑘 ∈ ℕ, 𝑧 ∈ (𝑋 × ℝ⁺) ↦ {⟨𝑥, 𝑟⟩ ∣ ((𝑥 ∈ 𝑋 ∧ 𝑟 ∈ ℝ⁺) ∧ (𝑟 < (1 / 𝑘) ∧ ((cls‘𝐽)‘(𝑥(ball‘𝐷)𝑟)) ⊆ (((ball‘𝐷)‘𝑧) ∖ (𝑀‘𝑘))))})
14	11, 12, 13	bcthlem1 23928	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ (𝑔‘𝑛) ∈ (𝑋 × ℝ⁺))) → ((𝑔‘(𝑛 + 1)) ∈ (𝑛𝐹(𝑔‘𝑛)) ↔ ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) ∧ (2^nd ‘(𝑔‘(𝑛 + 1))) < (1 / 𝑛) ∧ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ (((ball‘𝐷)‘(𝑔‘𝑛)) ∖ (𝑀‘𝑛)))))
15	14	expr 460	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝑔‘𝑛) ∈ (𝑋 × ℝ⁺) → ((𝑔‘(𝑛 + 1)) ∈ (𝑛𝐹(𝑔‘𝑛)) ↔ ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) ∧ (2^nd ‘(𝑔‘(𝑛 + 1))) < (1 / 𝑛) ∧ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ (((ball‘𝐷)‘(𝑔‘𝑛)) ∖ (𝑀‘𝑛))))))
16	10, 15	mpd 15	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝑔‘(𝑛 + 1)) ∈ (𝑛𝐹(𝑔‘𝑛)) ↔ ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) ∧ (2^nd ‘(𝑔‘(𝑛 + 1))) < (1 / 𝑛) ∧ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ (((ball‘𝐷)‘(𝑔‘𝑛)) ∖ (𝑀‘𝑛)))))
17	8, 16	mpbid 235	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) ∧ (2^nd ‘(𝑔‘(𝑛 + 1))) < (1 / 𝑛) ∧ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ (((ball‘𝐷)‘(𝑔‘𝑛)) ∖ (𝑀‘𝑛))))
18		cmetmet 23890	. . . . . . . . . . . 12 ⊢ (𝐷 ∈ (CMet‘𝑋) → 𝐷 ∈ (Met‘𝑋))
19	12, 18	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐷 ∈ (Met‘𝑋))
20		metxmet 22941	. . . . . . . . . . 11 ⊢ (𝐷 ∈ (Met‘𝑋) → 𝐷 ∈ (∞Met‘𝑋))
21	19, 20	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋))
22	11	mopntop 23047	. . . . . . . . . 10 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ Top)
23	21, 22	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝐽 ∈ Top)
24		xp1st 7703	. . . . . . . . . . . 12 ⊢ ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) → (1^st ‘(𝑔‘(𝑛 + 1))) ∈ 𝑋)
25		xp2nd 7704	. . . . . . . . . . . . 13 ⊢ ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) → (2^nd ‘(𝑔‘(𝑛 + 1))) ∈ ℝ⁺)
26	25	rpxrd 12420	. . . . . . . . . . . 12 ⊢ ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) → (2^nd ‘(𝑔‘(𝑛 + 1))) ∈ ℝ^*)
27	24, 26	jca 515	. . . . . . . . . . 11 ⊢ ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) → ((1^st ‘(𝑔‘(𝑛 + 1))) ∈ 𝑋 ∧ (2^nd ‘(𝑔‘(𝑛 + 1))) ∈ ℝ^*))
28		blssm 23025	. . . . . . . . . . . 12 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (1^st ‘(𝑔‘(𝑛 + 1))) ∈ 𝑋 ∧ (2^nd ‘(𝑔‘(𝑛 + 1))) ∈ ℝ^*) → ((1^st ‘(𝑔‘(𝑛 + 1)))(ball‘𝐷)(2^nd ‘(𝑔‘(𝑛 + 1)))) ⊆ 𝑋)
29	28	3expb 1117	. . . . . . . . . . 11 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ ((1^st ‘(𝑔‘(𝑛 + 1))) ∈ 𝑋 ∧ (2^nd ‘(𝑔‘(𝑛 + 1))) ∈ ℝ^*)) → ((1^st ‘(𝑔‘(𝑛 + 1)))(ball‘𝐷)(2^nd ‘(𝑔‘(𝑛 + 1)))) ⊆ 𝑋)
30	21, 27, 29	syl2an 598	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺)) → ((1^st ‘(𝑔‘(𝑛 + 1)))(ball‘𝐷)(2^nd ‘(𝑔‘(𝑛 + 1)))) ⊆ 𝑋)
31		df-ov 7138	. . . . . . . . . . . 12 ⊢ ((1^st ‘(𝑔‘(𝑛 + 1)))(ball‘𝐷)(2^nd ‘(𝑔‘(𝑛 + 1)))) = ((ball‘𝐷)‘⟨(1^st ‘(𝑔‘(𝑛 + 1))), (2^nd ‘(𝑔‘(𝑛 + 1)))⟩)
32		1st2nd2 7710	. . . . . . . . . . . . 13 ⊢ ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) → (𝑔‘(𝑛 + 1)) = ⟨(1^st ‘(𝑔‘(𝑛 + 1))), (2^nd ‘(𝑔‘(𝑛 + 1)))⟩)
33	32	fveq2d 6649	. . . . . . . . . . . 12 ⊢ ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) = ((ball‘𝐷)‘⟨(1^st ‘(𝑔‘(𝑛 + 1))), (2^nd ‘(𝑔‘(𝑛 + 1)))⟩))
34	31, 33	eqtr4id 2852	. . . . . . . . . . 11 ⊢ ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) → ((1^st ‘(𝑔‘(𝑛 + 1)))(ball‘𝐷)(2^nd ‘(𝑔‘(𝑛 + 1)))) = ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))))
35	34	adantl 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺)) → ((1^st ‘(𝑔‘(𝑛 + 1)))(ball‘𝐷)(2^nd ‘(𝑔‘(𝑛 + 1)))) = ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))))
36	11	mopnuni 23048	. . . . . . . . . . . 12 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝑋 = ∪ 𝐽)
37	21, 36	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 = ∪ 𝐽)
38	37	adantr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺)) → 𝑋 = ∪ 𝐽)
39	30, 35, 38	3sstr3d 3961	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺)) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ∪ 𝐽)
40		eqid 2798	. . . . . . . . . 10 ⊢ ∪ 𝐽 = ∪ 𝐽
41	40	sscls 21661	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ∪ 𝐽) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))))
42	23, 39, 41	syl2an2r 684	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺)) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))))
43		difss2 4061	. . . . . . . 8 ⊢ (((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ (((ball‘𝐷)‘(𝑔‘𝑛)) ∖ (𝑀‘𝑛)) → ((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ ((ball‘𝐷)‘(𝑔‘𝑛)))
44		sstr2 3922	. . . . . . . 8 ⊢ (((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) → (((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ ((ball‘𝐷)‘(𝑔‘𝑛)) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝑔‘𝑛))))
45	42, 43, 44	syl2im 40	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺)) → (((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ (((ball‘𝐷)‘(𝑔‘𝑛)) ∖ (𝑀‘𝑛)) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝑔‘𝑛))))
46	45	a1d 25	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺)) → ((2^nd ‘(𝑔‘(𝑛 + 1))) < (1 / 𝑛) → (((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ (((ball‘𝐷)‘(𝑔‘𝑛)) ∖ (𝑀‘𝑛)) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝑔‘𝑛)))))
47	46	ex 416	. . . . 5 ⊢ (𝜑 → ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) → ((2^nd ‘(𝑔‘(𝑛 + 1))) < (1 / 𝑛) → (((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ (((ball‘𝐷)‘(𝑔‘𝑛)) ∖ (𝑀‘𝑛)) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝑔‘𝑛))))))
48	47	3impd 1345	. . . 4 ⊢ (𝜑 → (((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) ∧ (2^nd ‘(𝑔‘(𝑛 + 1))) < (1 / 𝑛) ∧ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ (((ball‘𝐷)‘(𝑔‘𝑛)) ∖ (𝑀‘𝑛))) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝑔‘𝑛))))
49	48	adantr 484	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) ∧ (2^nd ‘(𝑔‘(𝑛 + 1))) < (1 / 𝑛) ∧ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ (((ball‘𝐷)‘(𝑔‘𝑛)) ∖ (𝑀‘𝑛))) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝑔‘𝑛))))
50	17, 49	mpd 15	. 2 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝑔‘𝑛)))
51	50	ralrimiva 3149	1 ⊢ (𝜑 → ∀𝑛 ∈ ℕ ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝑔‘𝑛)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ∀wral 3106 ∖ cdif 3878 ⊆ wss 3881 ⟨cop 4531 ∪ cuni 4800 class class class wbr 5030 {copab 5092 × cxp 5517 ⟶wf 6320 ‘cfv 6324 (class class class)co 7135 ∈ cmpo 7137 1^st c1st 7669 2^nd c2nd 7670 1c1 10527 + caddc 10529 ℝ^*cxr 10663 < clt 10664 / cdiv 11286 ℕcn 11625 ℝ⁺crp 12377 ∞Metcxmet 20076 Metcmet 20077 ballcbl 20078 MetOpencmopn 20081 Topctop 21498 Clsdccld 21621 clsccl 21623 CMetccmet 23858

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-pre-sup 10604

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-map 8391 df-en 8493 df-dom 8494 df-sdom 8495 df-sup 8890 df-inf 8891 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-nn 11626 df-2 11688 df-n0 11886 df-z 11970 df-uz 12232 df-q 12337 df-rp 12378 df-xneg 12495 df-xadd 12496 df-xmul 12497 df-topgen 16709 df-psmet 20083 df-xmet 20084 df-met 20085 df-bl 20086 df-mopn 20087 df-top 21499 df-topon 21516 df-bases 21551 df-cld 21624 df-cls 21626 df-cmet 23861

This theorem is referenced by: bcthlem3 23930 bcthlem4 23931

W3C validator