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 22930

Description: Lemma for bcth 22934. 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		oveq1 6556	. . . . . . . 8 ⊢ (𝑘 = 𝑛 → (𝑘 + 1) = (𝑛 + 1))
3	2	fveq2d 6107	. . . . . . 7 ⊢ (𝑘 = 𝑛 → (𝑔‘(𝑘 + 1)) = (𝑔‘(𝑛 + 1)))
4		id 22	. . . . . . . 8 ⊢ (𝑘 = 𝑛 → 𝑘 = 𝑛)
5		fveq2 6103	. . . . . . . 8 ⊢ (𝑘 = 𝑛 → (𝑔‘𝑘) = (𝑔‘𝑛))
6	4, 5	oveq12d 6567	. . . . . . 7 ⊢ (𝑘 = 𝑛 → (𝑘𝐹(𝑔‘𝑘)) = (𝑛𝐹(𝑔‘𝑛)))
7	3, 6	eleq12d 2682	. . . . . 6 ⊢ (𝑘 = 𝑛 → ((𝑔‘(𝑘 + 1)) ∈ (𝑘𝐹(𝑔‘𝑘)) ↔ (𝑔‘(𝑛 + 1)) ∈ (𝑛𝐹(𝑔‘𝑛))))
8	7	rspccva 3281	. . . . 5 ⊢ ((∀𝑘 ∈ ℕ (𝑔‘(𝑘 + 1)) ∈ (𝑘𝐹(𝑔‘𝑘)) ∧ 𝑛 ∈ ℕ) → (𝑔‘(𝑛 + 1)) ∈ (𝑛𝐹(𝑔‘𝑛)))
9	1, 8	sylan 487	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑔‘(𝑛 + 1)) ∈ (𝑛𝐹(𝑔‘𝑛)))
10		bcthlem.9	. . . . . 6 ⊢ (𝜑 → 𝑔:ℕ⟶(𝑋 × ℝ⁺))
11	10	ffvelrnda 6267	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑔‘𝑛) ∈ (𝑋 × ℝ⁺))
12		bcth.2	. . . . . . 7 ⊢ 𝐽 = (MetOpen‘𝐷)
13		bcthlem.4	. . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ (CMet‘𝑋))
14		bcthlem.5	. . . . . . 7 ⊢ 𝐹 = (𝑘 ∈ ℕ, 𝑧 ∈ (𝑋 × ℝ⁺) ↦ {⟨𝑥, 𝑟⟩ ∣ ((𝑥 ∈ 𝑋 ∧ 𝑟 ∈ ℝ⁺) ∧ (𝑟 < (1 / 𝑘) ∧ ((cls‘𝐽)‘(𝑥(ball‘𝐷)𝑟)) ⊆ (((ball‘𝐷)‘𝑧) ∖ (𝑀‘𝑘))))})
15	12, 13, 14	bcthlem1 22929	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ ℕ ∧ (𝑔‘𝑛) ∈ (𝑋 × ℝ⁺))) → ((𝑔‘(𝑛 + 1)) ∈ (𝑛𝐹(𝑔‘𝑛)) ↔ ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) ∧ (2^nd ‘(𝑔‘(𝑛 + 1))) < (1 / 𝑛) ∧ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ (((ball‘𝐷)‘(𝑔‘𝑛)) ∖ (𝑀‘𝑛)))))
16	15	expr 641	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝑔‘𝑛) ∈ (𝑋 × ℝ⁺) → ((𝑔‘(𝑛 + 1)) ∈ (𝑛𝐹(𝑔‘𝑛)) ↔ ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) ∧ (2^nd ‘(𝑔‘(𝑛 + 1))) < (1 / 𝑛) ∧ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ (((ball‘𝐷)‘(𝑔‘𝑛)) ∖ (𝑀‘𝑛))))))
17	11, 16	mpd 15	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝑔‘(𝑛 + 1)) ∈ (𝑛𝐹(𝑔‘𝑛)) ↔ ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) ∧ (2^nd ‘(𝑔‘(𝑛 + 1))) < (1 / 𝑛) ∧ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ (((ball‘𝐷)‘(𝑔‘𝑛)) ∖ (𝑀‘𝑛)))))
18	9, 17	mpbid 221	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) ∧ (2^nd ‘(𝑔‘(𝑛 + 1))) < (1 / 𝑛) ∧ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ (((ball‘𝐷)‘(𝑔‘𝑛)) ∖ (𝑀‘𝑛))))
19		cmetmet 22892	. . . . . . . . . . . . 13 ⊢ (𝐷 ∈ (CMet‘𝑋) → 𝐷 ∈ (Met‘𝑋))
20	13, 19	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐷 ∈ (Met‘𝑋))
21		metxmet 21949	. . . . . . . . . . . 12 ⊢ (𝐷 ∈ (Met‘𝑋) → 𝐷 ∈ (∞Met‘𝑋))
22	20, 21	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋))
23	12	mopntop 22055	. . . . . . . . . . 11 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ Top)
24	22, 23	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐽 ∈ Top)
25	24	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺)) → 𝐽 ∈ Top)
26		xp1st 7089	. . . . . . . . . . . 12 ⊢ ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) → (1^st ‘(𝑔‘(𝑛 + 1))) ∈ 𝑋)
27		xp2nd 7090	. . . . . . . . . . . . 13 ⊢ ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) → (2^nd ‘(𝑔‘(𝑛 + 1))) ∈ ℝ⁺)
28	27	rpxrd 11749	. . . . . . . . . . . 12 ⊢ ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) → (2^nd ‘(𝑔‘(𝑛 + 1))) ∈ ℝ^*)
29	26, 28	jca 553	. . . . . . . . . . 11 ⊢ ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) → ((1^st ‘(𝑔‘(𝑛 + 1))) ∈ 𝑋 ∧ (2^nd ‘(𝑔‘(𝑛 + 1))) ∈ ℝ^*))
30		blssm 22033	. . . . . . . . . . . 12 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (1^st ‘(𝑔‘(𝑛 + 1))) ∈ 𝑋 ∧ (2^nd ‘(𝑔‘(𝑛 + 1))) ∈ ℝ^*) → ((1^st ‘(𝑔‘(𝑛 + 1)))(ball‘𝐷)(2^nd ‘(𝑔‘(𝑛 + 1)))) ⊆ 𝑋)
31	30	3expb 1258	. . . . . . . . . . 11 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ ((1^st ‘(𝑔‘(𝑛 + 1))) ∈ 𝑋 ∧ (2^nd ‘(𝑔‘(𝑛 + 1))) ∈ ℝ^*)) → ((1^st ‘(𝑔‘(𝑛 + 1)))(ball‘𝐷)(2^nd ‘(𝑔‘(𝑛 + 1)))) ⊆ 𝑋)
32	22, 29, 31	syl2an 493	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺)) → ((1^st ‘(𝑔‘(𝑛 + 1)))(ball‘𝐷)(2^nd ‘(𝑔‘(𝑛 + 1)))) ⊆ 𝑋)
33		1st2nd2 7096	. . . . . . . . . . . . 13 ⊢ ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) → (𝑔‘(𝑛 + 1)) = ⟨(1^st ‘(𝑔‘(𝑛 + 1))), (2^nd ‘(𝑔‘(𝑛 + 1)))⟩)
34	33	fveq2d 6107	. . . . . . . . . . . 12 ⊢ ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) = ((ball‘𝐷)‘⟨(1^st ‘(𝑔‘(𝑛 + 1))), (2^nd ‘(𝑔‘(𝑛 + 1)))⟩))
35		df-ov 6552	. . . . . . . . . . . 12 ⊢ ((1^st ‘(𝑔‘(𝑛 + 1)))(ball‘𝐷)(2^nd ‘(𝑔‘(𝑛 + 1)))) = ((ball‘𝐷)‘⟨(1^st ‘(𝑔‘(𝑛 + 1))), (2^nd ‘(𝑔‘(𝑛 + 1)))⟩)
36	34, 35	syl6reqr 2663	. . . . . . . . . . 11 ⊢ ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) → ((1^st ‘(𝑔‘(𝑛 + 1)))(ball‘𝐷)(2^nd ‘(𝑔‘(𝑛 + 1)))) = ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))))
37	36	adantl 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺)) → ((1^st ‘(𝑔‘(𝑛 + 1)))(ball‘𝐷)(2^nd ‘(𝑔‘(𝑛 + 1)))) = ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))))
38	12	mopnuni 22056	. . . . . . . . . . . 12 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝑋 = ∪ 𝐽)
39	22, 38	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 = ∪ 𝐽)
40	39	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺)) → 𝑋 = ∪ 𝐽)
41	32, 37, 40	3sstr3d 3610	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺)) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ∪ 𝐽)
42		eqid 2610	. . . . . . . . . 10 ⊢ ∪ 𝐽 = ∪ 𝐽
43	42	sscls 20670	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ∪ 𝐽) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))))
44	25, 41, 43	syl2anc 691	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺)) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))))
45		difss2 3701	. . . . . . . 8 ⊢ (((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ (((ball‘𝐷)‘(𝑔‘𝑛)) ∖ (𝑀‘𝑛)) → ((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ ((ball‘𝐷)‘(𝑔‘𝑛)))
46		sstr2 3575	. . . . . . . 8 ⊢ (((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) → (((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ ((ball‘𝐷)‘(𝑔‘𝑛)) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝑔‘𝑛))))
47	44, 45, 46	syl2im 39	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺)) → (((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ (((ball‘𝐷)‘(𝑔‘𝑛)) ∖ (𝑀‘𝑛)) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝑔‘𝑛))))
48	47	a1d 25	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺)) → ((2^nd ‘(𝑔‘(𝑛 + 1))) < (1 / 𝑛) → (((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ (((ball‘𝐷)‘(𝑔‘𝑛)) ∖ (𝑀‘𝑛)) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝑔‘𝑛)))))
49	48	ex 449	. . . . 5 ⊢ (𝜑 → ((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) → ((2^nd ‘(𝑔‘(𝑛 + 1))) < (1 / 𝑛) → (((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ (((ball‘𝐷)‘(𝑔‘𝑛)) ∖ (𝑀‘𝑛)) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝑔‘𝑛))))))
50	49	3impd 1273	. . . 4 ⊢ (𝜑 → (((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) ∧ (2^nd ‘(𝑔‘(𝑛 + 1))) < (1 / 𝑛) ∧ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ (((ball‘𝐷)‘(𝑔‘𝑛)) ∖ (𝑀‘𝑛))) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝑔‘𝑛))))
51	50	adantr 480	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((𝑔‘(𝑛 + 1)) ∈ (𝑋 × ℝ⁺) ∧ (2^nd ‘(𝑔‘(𝑛 + 1))) < (1 / 𝑛) ∧ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑔‘(𝑛 + 1)))) ⊆ (((ball‘𝐷)‘(𝑔‘𝑛)) ∖ (𝑀‘𝑛))) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝑔‘𝑛))))
52	18, 51	mpd 15	. 2 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝑔‘𝑛)))
53	52	ralrimiva 2949	1 ⊢ (𝜑 → ∀𝑛 ∈ ℕ ((ball‘𝐷)‘(𝑔‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝑔‘𝑛)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 ∀wral 2896 ∖ cdif 3537 ⊆ wss 3540 ⟨cop 4131 ∪ cuni 4372 class class class wbr 4583 {copab 4642 × cxp 5036 ⟶wf 5800 ‘cfv 5804 (class class class)co 6549 ↦ cmpt2 6551 1^st c1st 7057 2^nd c2nd 7058 1c1 9816 + caddc 9818 ℝ^*cxr 9952 < clt 9953 / cdiv 10563 ℕcn 10897 ℝ⁺crp 11708 ∞Metcxmt 19552 Metcme 19553 ballcbl 19554 MetOpencmopn 19557 Topctop 20517 Clsdccld 20630 clsccl 20632 CMetcms 22860

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-pre-sup 9893

This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-map 7746 df-en 7842 df-dom 7843 df-sdom 7844 df-sup 8231 df-inf 8232 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-div 10564 df-nn 10898 df-2 10956 df-n0 11170 df-z 11255 df-uz 11564 df-q 11665 df-rp 11709 df-xneg 11822 df-xadd 11823 df-xmul 11824 df-topgen 15927 df-psmet 19559 df-xmet 19560 df-met 19561 df-bl 19562 df-mopn 19563 df-top 20521 df-bases 20522 df-topon 20523 df-cld 20633 df-cls 20635 df-cmet 22863

This theorem is referenced by: bcthlem3 22931 bcthlem4 22932

W3C validator