Theorem caublcls 25351

Description: The convergent point of a sequence of nested balls is in the closures of any of the balls (i.e. it is in the intersection of the closures). Indeed, it is the only point in the intersection because a metric space is Hausdorff, but we don't prove this here. (Contributed by Mario Carneiro, 21-Jan-2014.) (Revised by Mario Carneiro, 1-May-2014.)

Hypotheses

Ref	Expression
caubl.2	⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋))
caubl.3	⊢ (𝜑 → 𝐹:ℕ⟶(𝑋 × ℝ+))
caubl.4	⊢ (𝜑 → ∀𝑛 ∈ ℕ ((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝑛)))
caublcls.6	⊢ 𝐽 = (MetOpen‘𝐷)

Assertion

Ref	Expression
caublcls	⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → 𝑃 ∈ ((cls‘𝐽)‘((ball‘𝐷)‘(𝐹‘𝐴))))

Distinct variable groups:   𝐷,𝑛   𝑛,𝐹   𝑛,𝑋

Allowed substitution hints:   𝜑(𝑛)   𝐴(𝑛)   𝑃(𝑛)   𝐽(𝑛)

Proof of Theorem caublcls

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

Step	Hyp	Ref	Expression
1		eqid 2761	. 2 ⊢ (ℤ≥‘𝐴) = (ℤ≥‘𝐴)
2		caubl.2	. . . 4 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋))
3	2	3ad2ant1 1145	. . 3 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → 𝐷 ∈ (∞Met‘𝑋))
4		caublcls.6	. . . 4 ⊢ 𝐽 = (MetOpen‘𝐷)
5	4	mopntopon 24479	. . 3 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ (TopOn‘𝑋))
6	3, 5	syl 17	. 2 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → 𝐽 ∈ (TopOn‘𝑋))
7		simp3 1150	. . 3 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → 𝐴 ∈ ℕ)
8	7	nnzd 12591	. 2 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → 𝐴 ∈ ℤ)
9		simp2 1149	. 2 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃)
10		2fveq3 6868	. . . . . . . 8 ⊢ (𝑟 = 𝐴 → ((ball‘𝐷)‘(𝐹‘𝑟)) = ((ball‘𝐷)‘(𝐹‘𝐴)))
11	10	sseq1d 3967	. . . . . . 7 ⊢ (𝑟 = 𝐴 → (((ball‘𝐷)‘(𝐹‘𝑟)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)) ↔ ((ball‘𝐷)‘(𝐹‘𝐴)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))))
12	11	imbi2d 342	. . . . . 6 ⊢ (𝑟 = 𝐴 → (((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝑟)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))) ↔ ((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝐴)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)))))
13		2fveq3 6868	. . . . . . . 8 ⊢ (𝑟 = 𝑘 → ((ball‘𝐷)‘(𝐹‘𝑟)) = ((ball‘𝐷)‘(𝐹‘𝑘)))
14	13	sseq1d 3967	. . . . . . 7 ⊢ (𝑟 = 𝑘 → (((ball‘𝐷)‘(𝐹‘𝑟)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)) ↔ ((ball‘𝐷)‘(𝐹‘𝑘)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))))
15	14	imbi2d 342	. . . . . 6 ⊢ (𝑟 = 𝑘 → (((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝑟)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))) ↔ ((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝑘)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)))))
16		2fveq3 6868	. . . . . . . 8 ⊢ (𝑟 = (𝑘 + 1) → ((ball‘𝐷)‘(𝐹‘𝑟)) = ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))))
17	16	sseq1d 3967	. . . . . . 7 ⊢ (𝑟 = (𝑘 + 1) → (((ball‘𝐷)‘(𝐹‘𝑟)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)) ↔ ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))))
18	17	imbi2d 342	. . . . . 6 ⊢ (𝑟 = (𝑘 + 1) → (((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝑟)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))) ↔ ((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)))))
19		ssid 3958	. . . . . . 7 ⊢ ((ball‘𝐷)‘(𝐹‘𝐴)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))
20	19	2a1i 12	. . . . . 6 ⊢ (𝐴 ∈ ℤ → ((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝐴)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))))
21		caubl.4	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑛 ∈ ℕ ((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝑛)))
22		eluznn 12916	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → 𝑘 ∈ ℕ)
23		fvoveq1 7415	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑘 → (𝐹‘(𝑛 + 1)) = (𝐹‘(𝑘 + 1)))
24	23	fveq2d 6867	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑘 → ((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) = ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))))
25		2fveq3 6868	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑘 → ((ball‘𝐷)‘(𝐹‘𝑛)) = ((ball‘𝐷)‘(𝐹‘𝑘)))
26	24, 25	sseq12d 3969	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑘 → (((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝑛)) ↔ ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝑘))))
27	26	rspccva 3580	. . . . . . . . . . 11 ⊢ ((∀𝑛 ∈ ℕ ((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝑛)) ∧ 𝑘 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝑘)))
28	21, 22, 27	syl2an 605	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ≥‘𝐴))) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝑘)))
29	28	anassrs 471	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝑘)))
30		sstr2 3943	. . . . . . . . 9 ⊢ (((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝑘)) → (((ball‘𝐷)‘(𝐹‘𝑘)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))))
31	29, 30	syl 17	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → (((ball‘𝐷)‘(𝐹‘𝑘)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))))
32	31	expcom 417	. . . . . . 7 ⊢ (𝑘 ∈ (ℤ≥‘𝐴) → ((𝜑 ∧ 𝐴 ∈ ℕ) → (((ball‘𝐷)‘(𝐹‘𝑘)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)))))
33	32	a2d 29	. . . . . 6 ⊢ (𝑘 ∈ (ℤ≥‘𝐴) → (((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝑘)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))) → ((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)))))
34	12, 15, 18, 15, 20, 33	uzind4 12904	. . . . 5 ⊢ (𝑘 ∈ (ℤ≥‘𝐴) → ((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝑘)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))))
35	34	impcom 411	. . . 4 ⊢ (((𝜑 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → ((ball‘𝐷)‘(𝐹‘𝑘)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)))
36	35	3adantl2 1180	. . 3 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → ((ball‘𝐷)‘(𝐹‘𝑘)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)))
37	3	adantr 484	. . . . 5 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → 𝐷 ∈ (∞Met‘𝑋))
38		simpl1 1204	. . . . . . . 8 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → 𝜑)
39		caubl.3	. . . . . . . 8 ⊢ (𝜑 → 𝐹:ℕ⟶(𝑋 × ℝ+))
40	38, 39	syl 17	. . . . . . 7 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → 𝐹:ℕ⟶(𝑋 × ℝ+))
41	22	3ad2antl3 1200	. . . . . . 7 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → 𝑘 ∈ ℕ)
42	40, 41	ffvelcdmd 7062	. . . . . 6 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → (𝐹‘𝑘) ∈ (𝑋 × ℝ+))
43		xp1st 7998	. . . . . 6 ⊢ ((𝐹‘𝑘) ∈ (𝑋 × ℝ+) → (1st ‘(𝐹‘𝑘)) ∈ 𝑋)
44	42, 43	syl 17	. . . . 5 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → (1st ‘(𝐹‘𝑘)) ∈ 𝑋)
45		xp2nd 7999	. . . . . 6 ⊢ ((𝐹‘𝑘) ∈ (𝑋 × ℝ+) → (2nd ‘(𝐹‘𝑘)) ∈ ℝ+)
46	42, 45	syl 17	. . . . 5 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → (2nd ‘(𝐹‘𝑘)) ∈ ℝ+)
47		blcntr 24453	. . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (1st ‘(𝐹‘𝑘)) ∈ 𝑋 ∧ (2nd ‘(𝐹‘𝑘)) ∈ ℝ+) → (1st ‘(𝐹‘𝑘)) ∈ ((1st ‘(𝐹‘𝑘))(ball‘𝐷)(2nd ‘(𝐹‘𝑘))))
48	37, 44, 46, 47	syl3anc 1389	. . . 4 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → (1st ‘(𝐹‘𝑘)) ∈ ((1st ‘(𝐹‘𝑘))(ball‘𝐷)(2nd ‘(𝐹‘𝑘))))
49		fvco3 6963	. . . . 5 ⊢ ((𝐹:ℕ⟶(𝑋 × ℝ+) ∧ 𝑘 ∈ ℕ) → ((1st ∘ 𝐹)‘𝑘) = (1st ‘(𝐹‘𝑘)))
50	40, 41, 49	syl2anc 593	. . . 4 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → ((1st ∘ 𝐹)‘𝑘) = (1st ‘(𝐹‘𝑘)))
51		1st2nd2 8005	. . . . . . 7 ⊢ ((𝐹‘𝑘) ∈ (𝑋 × ℝ+) → (𝐹‘𝑘) = ⟨(1st ‘(𝐹‘𝑘)), (2nd ‘(𝐹‘𝑘))⟩)
52	42, 51	syl 17	. . . . . 6 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → (𝐹‘𝑘) = ⟨(1st ‘(𝐹‘𝑘)), (2nd ‘(𝐹‘𝑘))⟩)
53	52	fveq2d 6867	. . . . 5 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → ((ball‘𝐷)‘(𝐹‘𝑘)) = ((ball‘𝐷)‘⟨(1st ‘(𝐹‘𝑘)), (2nd ‘(𝐹‘𝑘))⟩))
54		df-ov 7395	. . . . 5 ⊢ ((1st ‘(𝐹‘𝑘))(ball‘𝐷)(2nd ‘(𝐹‘𝑘))) = ((ball‘𝐷)‘⟨(1st ‘(𝐹‘𝑘)), (2nd ‘(𝐹‘𝑘))⟩)
55	53, 54	eqtr4di 2814	. . . 4 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → ((ball‘𝐷)‘(𝐹‘𝑘)) = ((1st ‘(𝐹‘𝑘))(ball‘𝐷)(2nd ‘(𝐹‘𝑘))))
56	48, 50, 55	3eltr4d 2876	. . 3 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → ((1st ∘ 𝐹)‘𝑘) ∈ ((ball‘𝐷)‘(𝐹‘𝑘)))
57	36, 56	sseldd 3937	. 2 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → ((1st ∘ 𝐹)‘𝑘) ∈ ((ball‘𝐷)‘(𝐹‘𝐴)))
58	39	ffvelcdmda 7061	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ∈ ℕ) → (𝐹‘𝐴) ∈ (𝑋 × ℝ+))
59	58	3adant2 1143	. . . . . 6 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → (𝐹‘𝐴) ∈ (𝑋 × ℝ+))
60		1st2nd2 8005	. . . . . 6 ⊢ ((𝐹‘𝐴) ∈ (𝑋 × ℝ+) → (𝐹‘𝐴) = ⟨(1st ‘(𝐹‘𝐴)), (2nd ‘(𝐹‘𝐴))⟩)
61	59, 60	syl 17	. . . . 5 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → (𝐹‘𝐴) = ⟨(1st ‘(𝐹‘𝐴)), (2nd ‘(𝐹‘𝐴))⟩)
62	61	fveq2d 6867	. . . 4 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝐴)) = ((ball‘𝐷)‘⟨(1st ‘(𝐹‘𝐴)), (2nd ‘(𝐹‘𝐴))⟩))
63		df-ov 7395	. . . 4 ⊢ ((1st ‘(𝐹‘𝐴))(ball‘𝐷)(2nd ‘(𝐹‘𝐴))) = ((ball‘𝐷)‘⟨(1st ‘(𝐹‘𝐴)), (2nd ‘(𝐹‘𝐴))⟩)
64	62, 63	eqtr4di 2814	. . 3 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝐴)) = ((1st ‘(𝐹‘𝐴))(ball‘𝐷)(2nd ‘(𝐹‘𝐴))))
65		xp1st 7998	. . . . 5 ⊢ ((𝐹‘𝐴) ∈ (𝑋 × ℝ+) → (1st ‘(𝐹‘𝐴)) ∈ 𝑋)
66	59, 65	syl 17	. . . 4 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → (1st ‘(𝐹‘𝐴)) ∈ 𝑋)
67		xp2nd 7999	. . . . . 6 ⊢ ((𝐹‘𝐴) ∈ (𝑋 × ℝ+) → (2nd ‘(𝐹‘𝐴)) ∈ ℝ+)
68	59, 67	syl 17	. . . . 5 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → (2nd ‘(𝐹‘𝐴)) ∈ ℝ+)
69	68	rpxrd 13035	. . . 4 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → (2nd ‘(𝐹‘𝐴)) ∈ ℝ*)
70		blssm 24458	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (1st ‘(𝐹‘𝐴)) ∈ 𝑋 ∧ (2nd ‘(𝐹‘𝐴)) ∈ ℝ*) → ((1st ‘(𝐹‘𝐴))(ball‘𝐷)(2nd ‘(𝐹‘𝐴))) ⊆ 𝑋)
71	3, 66, 69, 70	syl3anc 1389	. . 3 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → ((1st ‘(𝐹‘𝐴))(ball‘𝐷)(2nd ‘(𝐹‘𝐴))) ⊆ 𝑋)
72	64, 71	eqsstrd 3970	. 2 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝐴)) ⊆ 𝑋)
73	1, 6, 8, 9, 57, 72	lmcls 23342	1 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → 𝑃 ∈ ((cls‘𝐽)‘((ball‘𝐷)‘(𝐹‘𝐴))))

Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1097   = wceq 1559   ∈ wcel 2141  ∀wral 3075   ⊆ wss 3904  ⟨cop 4587   class class class wbr 5099   × cxp 5643   ∘ ccom 5649  ⟶wf 6513  ‘cfv 6517  (class class class)co 7392  1^st c1st 7964  2^nd c2nd 7965  1c1 11071   + caddc 11073  ℝ^*cxr 11212  ℕcn 12207  ℤcz 12565  ℤ_≥cuz 12836  ℝ⁺crp 12990  ∞Metcxmet 21389  ballcbl 21391  MetOpencmopn 21394  TopOnctopon 22950  clsccl 23058  ⇝_𝑡clm 23266

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714  ax-cnex 11126  ax-resscn 11127  ax-1cn 11128  ax-icn 11129  ax-addcl 11130  ax-addrcl 11131  ax-mulcl 11132  ax-mulrcl 11133  ax-mulcom 11134  ax-addass 11135  ax-mulass 11136  ax-distr 11137  ax-i2m1 11138  ax-1ne0 11139  ax-1rid 11140  ax-rnegex 11141  ax-rrecex 11142  ax-cnre 11143  ax-pre-lttri 11144  ax-pre-lttrn 11145  ax-pre-ltadd 11146  ax-pre-mulgt0 11147  ax-pre-sup 11148

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3061  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-int 4905  df-iun 4950  df-iin 4951  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5540  df-eprel 5545  df-po 5553  df-so 5554  df-fr 5598  df-we 5600  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-pred 6284  df-ord 6345  df-on 6346  df-lim 6347  df-suc 6348  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-riota 7349  df-ov 7395  df-oprab 7396  df-mpo 7397  df-om 7843  df-1st 7966  df-2nd 7967  df-frecs 8257  df-wrecs 8288  df-recs 8337  df-rdg 8376  df-er 8673  df-map 8805  df-pm 8806  df-en 8924  df-dom 8925  df-sdom 8926  df-sup 9385  df-inf 9386  df-pnf 11215  df-mnf 11216  df-xr 11217  df-ltxr 11218  df-le 11219  df-sub 11413  df-neg 11414  df-div 11842  df-nn 12208  df-2 12277  df-n0 12479  df-z 12566  df-uz 12837  df-q 12947  df-rp 12991  df-xneg 13111  df-xadd 13112  df-xmul 13113  df-topgen 17455  df-psmet 21396  df-xmet 21397  df-bl 21399  df-mopn 21400  df-top 22934  df-topon 22951  df-bases 22986  df-cld 23059  df-ntr 23060  df-cls 23061  df-lm 23269

This theorem is referenced by:  bcthlem3  25368  heiborlem8  38281