Theorem heiborlem8 35111

Description: Lemma for heibor 35114. The previous lemmas establish that the sequence 𝑀 is Cauchy, so using completeness we now consider the convergent point 𝑌. By assumption, 𝑈 is an open cover, so 𝑌 is an element of some 𝑍 ∈ 𝑈, and some ball centered at 𝑌 is contained in 𝑍. But the sequence contains arbitrarily small balls close to 𝑌, so some element ball(𝑀‘𝑛) of the sequence is contained in 𝑍. And finally we arrive at a contradiction, because {𝑍} is a finite subcover of 𝑈 that covers ball(𝑀‘𝑛), yet ball(𝑀‘𝑛) ∈ 𝐾. For convenience, we write this contradiction as 𝜑 → 𝜓 where 𝜑 is all the accumulated hypotheses and 𝜓 is anything at all. (Contributed by Jeff Madsen, 22-Jan-2014.)

Hypotheses

Ref	Expression
heibor.1	⊢ 𝐽 = (MetOpen‘𝐷)
heibor.3	⊢ 𝐾 = {𝑢 ∣ ¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑢 ⊆ ∪ 𝑣}
heibor.4	⊢ 𝐺 = {⟨𝑦, 𝑛⟩ ∣ (𝑛 ∈ ℕ0 ∧ 𝑦 ∈ (𝐹‘𝑛) ∧ (𝑦𝐵𝑛) ∈ 𝐾)}
heibor.5	⊢ 𝐵 = (𝑧 ∈ 𝑋, 𝑚 ∈ ℕ0 ↦ (𝑧(ball‘𝐷)(1 / (2↑𝑚))))
heibor.6	⊢ (𝜑 → 𝐷 ∈ (CMet‘𝑋))
heibor.7	⊢ (𝜑 → 𝐹:ℕ0⟶(𝒫 𝑋 ∩ Fin))
heibor.8	⊢ (𝜑 → ∀𝑛 ∈ ℕ0 𝑋 = ∪ 𝑦 ∈ (𝐹‘𝑛)(𝑦𝐵𝑛))
heibor.9	⊢ (𝜑 → ∀𝑥 ∈ 𝐺 ((𝑇‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑇‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾))
heibor.10	⊢ (𝜑 → 𝐶𝐺0)
heibor.11	⊢ 𝑆 = seq0(𝑇, (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1))))
heibor.12	⊢ 𝑀 = (𝑛 ∈ ℕ ↦ ⟨(𝑆‘𝑛), (3 / (2↑𝑛))⟩)
heibor.13	⊢ (𝜑 → 𝑈 ⊆ 𝐽)
heibor.14	⊢ 𝑌 ∈ V
heibor.15	⊢ (𝜑 → 𝑌 ∈ 𝑍)
heibor.16	⊢ (𝜑 → 𝑍 ∈ 𝑈)
heibor.17	⊢ (𝜑 → (1st ∘ 𝑀)(⇝𝑡‘𝐽)𝑌)

Assertion

Ref	Expression
heiborlem8	⊢ (𝜑 → 𝜓)

Distinct variable groups:   𝑥,𝑛,𝑦,𝑢,𝐹   𝑥,𝐺   𝜑,𝑥   𝑚,𝑛,𝑢,𝑣,𝑥,𝑦,𝑧,𝐷   𝑚,𝑀,𝑢,𝑥,𝑦,𝑧   𝑇,𝑚,𝑛,𝑥,𝑦,𝑧   𝐵,𝑛,𝑢,𝑣,𝑦   𝑚,𝐽,𝑛,𝑢,𝑣,𝑥,𝑦,𝑧   𝑈,𝑛,𝑢,𝑣,𝑥,𝑦,𝑧   𝜓,𝑦,𝑧   𝑆,𝑚,𝑛,𝑢,𝑣,𝑥,𝑦,𝑧   𝑚,𝑋,𝑛,𝑢,𝑣,𝑥,𝑦,𝑧   𝐶,𝑚,𝑛,𝑢,𝑣,𝑦   𝑛,𝐾,𝑥,𝑦,𝑧   𝑥,𝑌   𝑣,𝑍,𝑥   𝑥,𝐵

Allowed substitution hints:   𝜑(𝑦,𝑧,𝑣,𝑢,𝑚,𝑛)   𝜓(𝑥,𝑣,𝑢,𝑚,𝑛)   𝐵(𝑧,𝑚)   𝐶(𝑥,𝑧)   𝑇(𝑣,𝑢)   𝑈(𝑚)   𝐹(𝑧,𝑣,𝑚)   𝐺(𝑦,𝑧,𝑣,𝑢,𝑚,𝑛)   𝐾(𝑣,𝑢,𝑚)   𝑀(𝑣,𝑛)   𝑌(𝑦,𝑧,𝑣,𝑢,𝑚,𝑛)   𝑍(𝑦,𝑧,𝑢,𝑚,𝑛)

Proof of Theorem heiborlem8

Dummy variables 𝑡 𝑘 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		heibor.6	. . . 4 ⊢ (𝜑 → 𝐷 ∈ (CMet‘𝑋))
2		cmetmet 23889	. . . 4 ⊢ (𝐷 ∈ (CMet‘𝑋) → 𝐷 ∈ (Met‘𝑋))
3		metxmet 22944	. . . 4 ⊢ (𝐷 ∈ (Met‘𝑋) → 𝐷 ∈ (∞Met‘𝑋))
4	1, 2, 3	3syl 18	. . 3 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋))
5		heibor.13	. . . 4 ⊢ (𝜑 → 𝑈 ⊆ 𝐽)
6		heibor.16	. . . 4 ⊢ (𝜑 → 𝑍 ∈ 𝑈)
7	5, 6	sseldd 3968	. . 3 ⊢ (𝜑 → 𝑍 ∈ 𝐽)
8		heibor.15	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝑍)
9		heibor.1	. . . 4 ⊢ 𝐽 = (MetOpen‘𝐷)
10	9	mopni2 23103	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑍 ∈ 𝐽 ∧ 𝑌 ∈ 𝑍) → ∃𝑥 ∈ ℝ+ (𝑌(ball‘𝐷)𝑥) ⊆ 𝑍)
11	4, 7, 8, 10	syl3anc 1367	. 2 ⊢ (𝜑 → ∃𝑥 ∈ ℝ+ (𝑌(ball‘𝐷)𝑥) ⊆ 𝑍)
12		rphalfcl 12417	. . . . . 6 ⊢ (𝑥 ∈ ℝ+ → (𝑥 / 2) ∈ ℝ+)
13		breq2 5070	. . . . . . . 8 ⊢ (𝑟 = (𝑥 / 2) → ((2nd ‘(𝑀‘𝑘)) < 𝑟 ↔ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2)))
14	13	rexbidv 3297	. . . . . . 7 ⊢ (𝑟 = (𝑥 / 2) → (∃𝑘 ∈ ℕ (2nd ‘(𝑀‘𝑘)) < 𝑟 ↔ ∃𝑘 ∈ ℕ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2)))
15		heibor.3	. . . . . . . 8 ⊢ 𝐾 = {𝑢 ∣ ¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑢 ⊆ ∪ 𝑣}
16		heibor.4	. . . . . . . 8 ⊢ 𝐺 = {⟨𝑦, 𝑛⟩ ∣ (𝑛 ∈ ℕ0 ∧ 𝑦 ∈ (𝐹‘𝑛) ∧ (𝑦𝐵𝑛) ∈ 𝐾)}
17		heibor.5	. . . . . . . 8 ⊢ 𝐵 = (𝑧 ∈ 𝑋, 𝑚 ∈ ℕ0 ↦ (𝑧(ball‘𝐷)(1 / (2↑𝑚))))
18		heibor.7	. . . . . . . 8 ⊢ (𝜑 → 𝐹:ℕ0⟶(𝒫 𝑋 ∩ Fin))
19		heibor.8	. . . . . . . 8 ⊢ (𝜑 → ∀𝑛 ∈ ℕ0 𝑋 = ∪ 𝑦 ∈ (𝐹‘𝑛)(𝑦𝐵𝑛))
20		heibor.9	. . . . . . . 8 ⊢ (𝜑 → ∀𝑥 ∈ 𝐺 ((𝑇‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑇‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾))
21		heibor.10	. . . . . . . 8 ⊢ (𝜑 → 𝐶𝐺0)
22		heibor.11	. . . . . . . 8 ⊢ 𝑆 = seq0(𝑇, (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1))))
23		heibor.12	. . . . . . . 8 ⊢ 𝑀 = (𝑛 ∈ ℕ ↦ ⟨(𝑆‘𝑛), (3 / (2↑𝑛))⟩)
24	9, 15, 16, 17, 1, 18, 19, 20, 21, 22, 23	heiborlem7 35110	. . . . . . 7 ⊢ ∀𝑟 ∈ ℝ+ ∃𝑘 ∈ ℕ (2nd ‘(𝑀‘𝑘)) < 𝑟
25	14, 24	vtoclri 3585	. . . . . 6 ⊢ ((𝑥 / 2) ∈ ℝ+ → ∃𝑘 ∈ ℕ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))
26	12, 25	syl 17	. . . . 5 ⊢ (𝑥 ∈ ℝ+ → ∃𝑘 ∈ ℕ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))
27	26	adantl 484	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ+) → ∃𝑘 ∈ ℕ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))
28		nnnn0 11905	. . . . . . 7 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℕ0)
29	9, 15, 16, 17, 1, 18, 19, 20, 21, 22	heiborlem4 35107	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝑆‘𝑘)𝐺𝑘)
30		fvex 6683	. . . . . . . . . 10 ⊢ (𝑆‘𝑘) ∈ V
31		vex 3497	. . . . . . . . . 10 ⊢ 𝑘 ∈ V
32	9, 15, 16, 30, 31	heiborlem2 35105	. . . . . . . . 9 ⊢ ((𝑆‘𝑘)𝐺𝑘 ↔ (𝑘 ∈ ℕ0 ∧ (𝑆‘𝑘) ∈ (𝐹‘𝑘) ∧ ((𝑆‘𝑘)𝐵𝑘) ∈ 𝐾))
33	32	simp3bi 1143	. . . . . . . 8 ⊢ ((𝑆‘𝑘)𝐺𝑘 → ((𝑆‘𝑘)𝐵𝑘) ∈ 𝐾)
34	29, 33	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝑆‘𝑘)𝐵𝑘) ∈ 𝐾)
35	28, 34	sylan2 594	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝑆‘𝑘)𝐵𝑘) ∈ 𝐾)
36	35	ad2ant2r 745	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ((𝑆‘𝑘)𝐵𝑘) ∈ 𝐾)
37	4	ad2antrr 724	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → 𝐷 ∈ (∞Met‘𝑋))
38	9, 15, 16, 17, 1, 18, 19, 20, 21, 22, 23	heiborlem5 35108	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑀:ℕ⟶(𝑋 × ℝ+))
39	38	ffvelrnda 6851	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝑀‘𝑘) ∈ (𝑋 × ℝ+))
40	39	ad2ant2r 745	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → (𝑀‘𝑘) ∈ (𝑋 × ℝ+))
41		xp1st 7721	. . . . . . . . . . 11 ⊢ ((𝑀‘𝑘) ∈ (𝑋 × ℝ+) → (1st ‘(𝑀‘𝑘)) ∈ 𝑋)
42	40, 41	syl 17	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → (1st ‘(𝑀‘𝑘)) ∈ 𝑋)
43		2nn 11711	. . . . . . . . . . . . . . 15 ⊢ 2 ∈ ℕ
44		nnexpcl 13443	. . . . . . . . . . . . . . 15 ⊢ ((2 ∈ ℕ ∧ 𝑘 ∈ ℕ0) → (2↑𝑘) ∈ ℕ)
45	43, 28, 44	sylancr 589	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ℕ → (2↑𝑘) ∈ ℕ)
46	45	nnrpd 12430	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ℕ → (2↑𝑘) ∈ ℝ+)
47	46	rpreccld 12442	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ ℕ → (1 / (2↑𝑘)) ∈ ℝ+)
48	47	ad2antrl 726	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → (1 / (2↑𝑘)) ∈ ℝ+)
49	48	rpxrd 12433	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → (1 / (2↑𝑘)) ∈ ℝ*)
50		xp2nd 7722	. . . . . . . . . . . 12 ⊢ ((𝑀‘𝑘) ∈ (𝑋 × ℝ+) → (2nd ‘(𝑀‘𝑘)) ∈ ℝ+)
51	40, 50	syl 17	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → (2nd ‘(𝑀‘𝑘)) ∈ ℝ+)
52	51	rpxrd 12433	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → (2nd ‘(𝑀‘𝑘)) ∈ ℝ*)
53		1le3 11850	. . . . . . . . . . . . . 14 ⊢ 1 ≤ 3
54		elrp 12392	. . . . . . . . . . . . . . 15 ⊢ ((2↑𝑘) ∈ ℝ+ ↔ ((2↑𝑘) ∈ ℝ ∧ 0 < (2↑𝑘)))
55		1re 10641	. . . . . . . . . . . . . . . 16 ⊢ 1 ∈ ℝ
56		3re 11718	. . . . . . . . . . . . . . . 16 ⊢ 3 ∈ ℝ
57		lediv1 11505	. . . . . . . . . . . . . . . 16 ⊢ ((1 ∈ ℝ ∧ 3 ∈ ℝ ∧ ((2↑𝑘) ∈ ℝ ∧ 0 < (2↑𝑘))) → (1 ≤ 3 ↔ (1 / (2↑𝑘)) ≤ (3 / (2↑𝑘))))
58	55, 56, 57	mp3an12 1447	. . . . . . . . . . . . . . 15 ⊢ (((2↑𝑘) ∈ ℝ ∧ 0 < (2↑𝑘)) → (1 ≤ 3 ↔ (1 / (2↑𝑘)) ≤ (3 / (2↑𝑘))))
59	54, 58	sylbi 219	. . . . . . . . . . . . . 14 ⊢ ((2↑𝑘) ∈ ℝ+ → (1 ≤ 3 ↔ (1 / (2↑𝑘)) ≤ (3 / (2↑𝑘))))
60	53, 59	mpbii 235	. . . . . . . . . . . . 13 ⊢ ((2↑𝑘) ∈ ℝ+ → (1 / (2↑𝑘)) ≤ (3 / (2↑𝑘)))
61	46, 60	syl 17	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ ℕ → (1 / (2↑𝑘)) ≤ (3 / (2↑𝑘)))
62	61	ad2antrl 726	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → (1 / (2↑𝑘)) ≤ (3 / (2↑𝑘)))
63		fveq2 6670	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑘 → (𝑆‘𝑛) = (𝑆‘𝑘))
64		oveq2 7164	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 = 𝑘 → (2↑𝑛) = (2↑𝑘))
65	64	oveq2d 7172	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑘 → (3 / (2↑𝑛)) = (3 / (2↑𝑘)))
66	63, 65	opeq12d 4811	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = 𝑘 → ⟨(𝑆‘𝑛), (3 / (2↑𝑛))⟩ = ⟨(𝑆‘𝑘), (3 / (2↑𝑘))⟩)
67		opex 5356	. . . . . . . . . . . . . . 15 ⊢ ⟨(𝑆‘𝑘), (3 / (2↑𝑘))⟩ ∈ V
68	66, 23, 67	fvmpt 6768	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ℕ → (𝑀‘𝑘) = ⟨(𝑆‘𝑘), (3 / (2↑𝑘))⟩)
69	68	fveq2d 6674	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ℕ → (2nd ‘(𝑀‘𝑘)) = (2nd ‘⟨(𝑆‘𝑘), (3 / (2↑𝑘))⟩))
70		ovex 7189	. . . . . . . . . . . . . 14 ⊢ (3 / (2↑𝑘)) ∈ V
71	30, 70	op2nd 7698	. . . . . . . . . . . . 13 ⊢ (2nd ‘⟨(𝑆‘𝑘), (3 / (2↑𝑘))⟩) = (3 / (2↑𝑘))
72	69, 71	syl6eq 2872	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ ℕ → (2nd ‘(𝑀‘𝑘)) = (3 / (2↑𝑘)))
73	72	ad2antrl 726	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → (2nd ‘(𝑀‘𝑘)) = (3 / (2↑𝑘)))
74	62, 73	breqtrrd 5094	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → (1 / (2↑𝑘)) ≤ (2nd ‘(𝑀‘𝑘)))
75		ssbl 23033	. . . . . . . . . 10 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ (1st ‘(𝑀‘𝑘)) ∈ 𝑋) ∧ ((1 / (2↑𝑘)) ∈ ℝ* ∧ (2nd ‘(𝑀‘𝑘)) ∈ ℝ*) ∧ (1 / (2↑𝑘)) ≤ (2nd ‘(𝑀‘𝑘))) → ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(1 / (2↑𝑘))) ⊆ ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(2nd ‘(𝑀‘𝑘))))
76	37, 42, 49, 52, 74, 75	syl221anc 1377	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(1 / (2↑𝑘))) ⊆ ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(2nd ‘(𝑀‘𝑘))))
77	28	ad2antrl 726	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → 𝑘 ∈ ℕ0)
78		oveq1 7163	. . . . . . . . . . . 12 ⊢ (𝑧 = (1st ‘(𝑀‘𝑘)) → (𝑧(ball‘𝐷)(1 / (2↑𝑚))) = ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(1 / (2↑𝑚))))
79		oveq2 7164	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑘 → (2↑𝑚) = (2↑𝑘))
80	79	oveq2d 7172	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑘 → (1 / (2↑𝑚)) = (1 / (2↑𝑘)))
81	80	oveq2d 7172	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑘 → ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(1 / (2↑𝑚))) = ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(1 / (2↑𝑘))))
82		ovex 7189	. . . . . . . . . . . 12 ⊢ ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(1 / (2↑𝑘))) ∈ V
83	78, 81, 17, 82	ovmpo 7310	. . . . . . . . . . 11 ⊢ (((1st ‘(𝑀‘𝑘)) ∈ 𝑋 ∧ 𝑘 ∈ ℕ0) → ((1st ‘(𝑀‘𝑘))𝐵𝑘) = ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(1 / (2↑𝑘))))
84	42, 77, 83	syl2anc 586	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ((1st ‘(𝑀‘𝑘))𝐵𝑘) = ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(1 / (2↑𝑘))))
85	68	fveq2d 6674	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ℕ → (1st ‘(𝑀‘𝑘)) = (1st ‘⟨(𝑆‘𝑘), (3 / (2↑𝑘))⟩))
86	30, 70	op1st 7697	. . . . . . . . . . . . 13 ⊢ (1st ‘⟨(𝑆‘𝑘), (3 / (2↑𝑘))⟩) = (𝑆‘𝑘)
87	85, 86	syl6eq 2872	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ ℕ → (1st ‘(𝑀‘𝑘)) = (𝑆‘𝑘))
88	87	ad2antrl 726	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → (1st ‘(𝑀‘𝑘)) = (𝑆‘𝑘))
89	88	oveq1d 7171	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ((1st ‘(𝑀‘𝑘))𝐵𝑘) = ((𝑆‘𝑘)𝐵𝑘))
90	84, 89	eqtr3d 2858	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(1 / (2↑𝑘))) = ((𝑆‘𝑘)𝐵𝑘))
91		1st2nd2 7728	. . . . . . . . . . . 12 ⊢ ((𝑀‘𝑘) ∈ (𝑋 × ℝ+) → (𝑀‘𝑘) = ⟨(1st ‘(𝑀‘𝑘)), (2nd ‘(𝑀‘𝑘))⟩)
92	40, 91	syl 17	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → (𝑀‘𝑘) = ⟨(1st ‘(𝑀‘𝑘)), (2nd ‘(𝑀‘𝑘))⟩)
93	92	fveq2d 6674	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ((ball‘𝐷)‘(𝑀‘𝑘)) = ((ball‘𝐷)‘⟨(1st ‘(𝑀‘𝑘)), (2nd ‘(𝑀‘𝑘))⟩))
94		df-ov 7159	. . . . . . . . . 10 ⊢ ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(2nd ‘(𝑀‘𝑘))) = ((ball‘𝐷)‘⟨(1st ‘(𝑀‘𝑘)), (2nd ‘(𝑀‘𝑘))⟩)
95	93, 94	syl6reqr 2875	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(2nd ‘(𝑀‘𝑘))) = ((ball‘𝐷)‘(𝑀‘𝑘)))
96	76, 90, 95	3sstr3d 4013	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ((𝑆‘𝑘)𝐵𝑘) ⊆ ((ball‘𝐷)‘(𝑀‘𝑘)))
97	9	mopntop 23050	. . . . . . . . . . 11 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ Top)
98	37, 97	syl 17	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → 𝐽 ∈ Top)
99		blssm 23028	. . . . . . . . . . . 12 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (1st ‘(𝑀‘𝑘)) ∈ 𝑋 ∧ (2nd ‘(𝑀‘𝑘)) ∈ ℝ*) → ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(2nd ‘(𝑀‘𝑘))) ⊆ 𝑋)
100	37, 42, 52, 99	syl3anc 1367	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(2nd ‘(𝑀‘𝑘))) ⊆ 𝑋)
101	9	mopnuni 23051	. . . . . . . . . . . 12 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝑋 = ∪ 𝐽)
102	37, 101	syl 17	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → 𝑋 = ∪ 𝐽)
103	100, 95, 102	3sstr3d 4013	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ((ball‘𝐷)‘(𝑀‘𝑘)) ⊆ ∪ 𝐽)
104		eqid 2821	. . . . . . . . . . 11 ⊢ ∪ 𝐽 = ∪ 𝐽
105	104	sscls 21664	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ ((ball‘𝐷)‘(𝑀‘𝑘)) ⊆ ∪ 𝐽) → ((ball‘𝐷)‘(𝑀‘𝑘)) ⊆ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑀‘𝑘))))
106	98, 103, 105	syl2anc 586	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ((ball‘𝐷)‘(𝑀‘𝑘)) ⊆ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑀‘𝑘))))
107	95	fveq2d 6674	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ((cls‘𝐽)‘((1st ‘(𝑀‘𝑘))(ball‘𝐷)(2nd ‘(𝑀‘𝑘)))) = ((cls‘𝐽)‘((ball‘𝐷)‘(𝑀‘𝑘))))
108	12	ad2antlr 725	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → (𝑥 / 2) ∈ ℝ+)
109	108	rpxrd 12433	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → (𝑥 / 2) ∈ ℝ*)
110		simprr 771	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))
111	9	blsscls 23117	. . . . . . . . . . . 12 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ (1st ‘(𝑀‘𝑘)) ∈ 𝑋) ∧ ((2nd ‘(𝑀‘𝑘)) ∈ ℝ* ∧ (𝑥 / 2) ∈ ℝ* ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ((cls‘𝐽)‘((1st ‘(𝑀‘𝑘))(ball‘𝐷)(2nd ‘(𝑀‘𝑘)))) ⊆ ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(𝑥 / 2)))
112	37, 42, 52, 109, 110, 111	syl23anc 1373	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ((cls‘𝐽)‘((1st ‘(𝑀‘𝑘))(ball‘𝐷)(2nd ‘(𝑀‘𝑘)))) ⊆ ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(𝑥 / 2)))
113	107, 112	eqsstrrd 4006	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ((cls‘𝐽)‘((ball‘𝐷)‘(𝑀‘𝑘))) ⊆ ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(𝑥 / 2)))
114		rpre 12398	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℝ+ → 𝑥 ∈ ℝ)
115	114	ad2antlr 725	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → 𝑥 ∈ ℝ)
116		heibor.17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (1st ∘ 𝑀)(⇝𝑡‘𝐽)𝑌)
117	9, 15, 16, 17, 1, 18, 19, 20, 21, 22, 23	heiborlem6 35109	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ∀𝑡 ∈ ℕ ((ball‘𝐷)‘(𝑀‘(𝑡 + 1))) ⊆ ((ball‘𝐷)‘(𝑀‘𝑡)))
118	4, 38, 117, 9	caublcls 23912	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (1st ∘ 𝑀)(⇝𝑡‘𝐽)𝑌 ∧ 𝑘 ∈ ℕ) → 𝑌 ∈ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑀‘𝑘))))
119	118	3expia 1117	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (1st ∘ 𝑀)(⇝𝑡‘𝐽)𝑌) → (𝑘 ∈ ℕ → 𝑌 ∈ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑀‘𝑘)))))
120	116, 119	mpdan 685	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑘 ∈ ℕ → 𝑌 ∈ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑀‘𝑘)))))
121	120	imp 409	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝑌 ∈ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑀‘𝑘))))
122	121	ad2ant2r 745	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → 𝑌 ∈ ((cls‘𝐽)‘((ball‘𝐷)‘(𝑀‘𝑘))))
123	113, 122	sseldd 3968	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → 𝑌 ∈ ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(𝑥 / 2)))
124		blhalf 23015	. . . . . . . . . . 11 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ (1st ‘(𝑀‘𝑘)) ∈ 𝑋) ∧ (𝑥 ∈ ℝ ∧ 𝑌 ∈ ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(𝑥 / 2)))) → ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(𝑥 / 2)) ⊆ (𝑌(ball‘𝐷)𝑥))
125	37, 42, 115, 123, 124	syl22anc 836	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ((1st ‘(𝑀‘𝑘))(ball‘𝐷)(𝑥 / 2)) ⊆ (𝑌(ball‘𝐷)𝑥))
126	113, 125	sstrd 3977	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ((cls‘𝐽)‘((ball‘𝐷)‘(𝑀‘𝑘))) ⊆ (𝑌(ball‘𝐷)𝑥))
127	106, 126	sstrd 3977	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ((ball‘𝐷)‘(𝑀‘𝑘)) ⊆ (𝑌(ball‘𝐷)𝑥))
128	96, 127	sstrd 3977	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ((𝑆‘𝑘)𝐵𝑘) ⊆ (𝑌(ball‘𝐷)𝑥))
129		sstr2 3974	. . . . . . 7 ⊢ (((𝑆‘𝑘)𝐵𝑘) ⊆ (𝑌(ball‘𝐷)𝑥) → ((𝑌(ball‘𝐷)𝑥) ⊆ 𝑍 → ((𝑆‘𝑘)𝐵𝑘) ⊆ 𝑍))
130	128, 129	syl 17	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ((𝑌(ball‘𝐷)𝑥) ⊆ 𝑍 → ((𝑆‘𝑘)𝐵𝑘) ⊆ 𝑍))
131		unisng 4857	. . . . . . . . . . . . 13 ⊢ (𝑍 ∈ 𝑈 → ∪ {𝑍} = 𝑍)
132	6, 131	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → ∪ {𝑍} = 𝑍)
133	132	sseq2d 3999	. . . . . . . . . . 11 ⊢ (𝜑 → (((𝑆‘𝑘)𝐵𝑘) ⊆ ∪ {𝑍} ↔ ((𝑆‘𝑘)𝐵𝑘) ⊆ 𝑍))
134	133	biimpar 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((𝑆‘𝑘)𝐵𝑘) ⊆ 𝑍) → ((𝑆‘𝑘)𝐵𝑘) ⊆ ∪ {𝑍})
135	6	snssd 4742	. . . . . . . . . . . . 13 ⊢ (𝜑 → {𝑍} ⊆ 𝑈)
136		snex 5332	. . . . . . . . . . . . . 14 ⊢ {𝑍} ∈ V
137	136	elpw 4543	. . . . . . . . . . . . 13 ⊢ ({𝑍} ∈ 𝒫 𝑈 ↔ {𝑍} ⊆ 𝑈)
138	135, 137	sylibr 236	. . . . . . . . . . . 12 ⊢ (𝜑 → {𝑍} ∈ 𝒫 𝑈)
139		snfi 8594	. . . . . . . . . . . . 13 ⊢ {𝑍} ∈ Fin
140	139	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → {𝑍} ∈ Fin)
141	138, 140	elind 4171	. . . . . . . . . . 11 ⊢ (𝜑 → {𝑍} ∈ (𝒫 𝑈 ∩ Fin))
142		unieq 4849	. . . . . . . . . . . . 13 ⊢ (𝑣 = {𝑍} → ∪ 𝑣 = ∪ {𝑍})
143	142	sseq2d 3999	. . . . . . . . . . . 12 ⊢ (𝑣 = {𝑍} → (((𝑆‘𝑘)𝐵𝑘) ⊆ ∪ 𝑣 ↔ ((𝑆‘𝑘)𝐵𝑘) ⊆ ∪ {𝑍}))
144	143	rspcev 3623	. . . . . . . . . . 11 ⊢ (({𝑍} ∈ (𝒫 𝑈 ∩ Fin) ∧ ((𝑆‘𝑘)𝐵𝑘) ⊆ ∪ {𝑍}) → ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)((𝑆‘𝑘)𝐵𝑘) ⊆ ∪ 𝑣)
145	141, 144	sylan 582	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((𝑆‘𝑘)𝐵𝑘) ⊆ ∪ {𝑍}) → ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)((𝑆‘𝑘)𝐵𝑘) ⊆ ∪ 𝑣)
146	134, 145	syldan 593	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑆‘𝑘)𝐵𝑘) ⊆ 𝑍) → ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)((𝑆‘𝑘)𝐵𝑘) ⊆ ∪ 𝑣)
147		ovex 7189	. . . . . . . . . . 11 ⊢ ((𝑆‘𝑘)𝐵𝑘) ∈ V
148		sseq1 3992	. . . . . . . . . . . . 13 ⊢ (𝑢 = ((𝑆‘𝑘)𝐵𝑘) → (𝑢 ⊆ ∪ 𝑣 ↔ ((𝑆‘𝑘)𝐵𝑘) ⊆ ∪ 𝑣))
149	148	rexbidv 3297	. . . . . . . . . . . 12 ⊢ (𝑢 = ((𝑆‘𝑘)𝐵𝑘) → (∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑢 ⊆ ∪ 𝑣 ↔ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)((𝑆‘𝑘)𝐵𝑘) ⊆ ∪ 𝑣))
150	149	notbid 320	. . . . . . . . . . 11 ⊢ (𝑢 = ((𝑆‘𝑘)𝐵𝑘) → (¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑢 ⊆ ∪ 𝑣 ↔ ¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)((𝑆‘𝑘)𝐵𝑘) ⊆ ∪ 𝑣))
151	147, 150, 15	elab2 3670	. . . . . . . . . 10 ⊢ (((𝑆‘𝑘)𝐵𝑘) ∈ 𝐾 ↔ ¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)((𝑆‘𝑘)𝐵𝑘) ⊆ ∪ 𝑣)
152	151	con2bii 360	. . . . . . . . 9 ⊢ (∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)((𝑆‘𝑘)𝐵𝑘) ⊆ ∪ 𝑣 ↔ ¬ ((𝑆‘𝑘)𝐵𝑘) ∈ 𝐾)
153	146, 152	sylib 220	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑆‘𝑘)𝐵𝑘) ⊆ 𝑍) → ¬ ((𝑆‘𝑘)𝐵𝑘) ∈ 𝐾)
154	153	ex 415	. . . . . . 7 ⊢ (𝜑 → (((𝑆‘𝑘)𝐵𝑘) ⊆ 𝑍 → ¬ ((𝑆‘𝑘)𝐵𝑘) ∈ 𝐾))
155	154	ad2antrr 724	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → (((𝑆‘𝑘)𝐵𝑘) ⊆ 𝑍 → ¬ ((𝑆‘𝑘)𝐵𝑘) ∈ 𝐾))
156	130, 155	syld 47	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ((𝑌(ball‘𝐷)𝑥) ⊆ 𝑍 → ¬ ((𝑆‘𝑘)𝐵𝑘) ∈ 𝐾))
157	36, 156	mt2d 138	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑘 ∈ ℕ ∧ (2nd ‘(𝑀‘𝑘)) < (𝑥 / 2))) → ¬ (𝑌(ball‘𝐷)𝑥) ⊆ 𝑍)
158	27, 157	rexlimddv 3291	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ+) → ¬ (𝑌(ball‘𝐷)𝑥) ⊆ 𝑍)
159	158	nrexdv 3270	. 2 ⊢ (𝜑 → ¬ ∃𝑥 ∈ ℝ+ (𝑌(ball‘𝐷)𝑥) ⊆ 𝑍)
160	11, 159	pm2.21dd 197	1 ⊢ (𝜑 → 𝜓)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1537   ∈ wcel 2114  {cab 2799  ∀wral 3138  ∃wrex 3139  Vcvv 3494   ∩ cin 3935   ⊆ wss 3936  ifcif 4467  𝒫 cpw 4539  {csn 4567  ⟨cop 4573  ∪ cuni 4838  ∪ ciun 4919   class class class wbr 5066  {copab 5128   ↦ cmpt 5146   × cxp 5553   ∘ ccom 5559  ⟶wf 6351  ‘cfv 6355  (class class class)co 7156   ∈ cmpo 7158  1^st c1st 7687  2^nd c2nd 7688  Fincfn 8509  ℝcr 10536  0cc0 10537  1c1 10538   + caddc 10540  ℝ^*cxr 10674   < clt 10675   ≤ cle 10676   − cmin 10870   / cdiv 11297  ℕcn 11638  2c2 11693  3c3 11694  ℕ₀cn0 11898  ℝ⁺crp 12390  seqcseq 13370  ↑cexp 13430  ∞Metcxmet 20530  Metcmet 20531  ballcbl 20532  MetOpencmopn 20535  Topctop 21501  clsccl 21626  ⇝_𝑡clm 21834  CMetccmet 23857

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461  ax-cnex 10593  ax-resscn 10594  ax-1cn 10595  ax-icn 10596  ax-addcl 10597  ax-addrcl 10598  ax-mulcl 10599  ax-mulrcl 10600  ax-mulcom 10601  ax-addass 10602  ax-mulass 10603  ax-distr 10604  ax-i2m1 10605  ax-1ne0 10606  ax-1rid 10607  ax-rnegex 10608  ax-rrecex 10609  ax-cnre 10610  ax-pre-lttri 10611  ax-pre-lttrn 10612  ax-pre-ltadd 10613  ax-pre-mulgt0 10614  ax-pre-sup 10615

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-int 4877  df-iun 4921  df-iin 4922  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-pred 6148  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-riota 7114  df-ov 7159  df-oprab 7160  df-mpo 7161  df-om 7581  df-1st 7689  df-2nd 7690  df-wrecs 7947  df-recs 8008  df-rdg 8046  df-1o 8102  df-er 8289  df-map 8408  df-pm 8409  df-en 8510  df-dom 8511  df-sdom 8512  df-fin 8513  df-sup 8906  df-inf 8907  df-pnf 10677  df-mnf 10678  df-xr 10679  df-ltxr 10680  df-le 10681  df-sub 10872  df-neg 10873  df-div 11298  df-nn 11639  df-2 11701  df-3 11702  df-n0 11899  df-z 11983  df-uz 12245  df-q 12350  df-rp 12391  df-xneg 12508  df-xadd 12509  df-xmul 12510  df-fl 13163  df-seq 13371  df-exp 13431  df-topgen 16717  df-psmet 20537  df-xmet 20538  df-met 20539  df-bl 20540  df-mopn 20541  df-top 21502  df-topon 21519  df-bases 21554  df-cld 21627  df-ntr 21628  df-cls 21629  df-lm 21837  df-cmet 23860

This theorem is referenced by:  heiborlem9  35112