Theorem caublcls 24579

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 2736	. 2 ⊢ (ℤ≥‘𝐴) = (ℤ≥‘𝐴)
2		caubl.2	. . . 4 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋))
3	2	3ad2ant1 1132	. . 3 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → 𝐷 ∈ (∞Met‘𝑋))
4		caublcls.6	. . . 4 ⊢ 𝐽 = (MetOpen‘𝐷)
5	4	mopntopon 23698	. . 3 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ (TopOn‘𝑋))
6	3, 5	syl 17	. 2 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → 𝐽 ∈ (TopOn‘𝑋))
7		simp3 1137	. . 3 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → 𝐴 ∈ ℕ)
8	7	nnzd 12526	. 2 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → 𝐴 ∈ ℤ)
9		simp2 1136	. 2 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃)
10		2fveq3 6830	. . . . . . . 8 ⊢ (𝑟 = 𝐴 → ((ball‘𝐷)‘(𝐹‘𝑟)) = ((ball‘𝐷)‘(𝐹‘𝐴)))
11	10	sseq1d 3963	. . . . . . 7 ⊢ (𝑟 = 𝐴 → (((ball‘𝐷)‘(𝐹‘𝑟)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)) ↔ ((ball‘𝐷)‘(𝐹‘𝐴)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))))
12	11	imbi2d 340	. . . . . 6 ⊢ (𝑟 = 𝐴 → (((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝑟)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))) ↔ ((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝐴)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)))))
13		2fveq3 6830	. . . . . . . 8 ⊢ (𝑟 = 𝑘 → ((ball‘𝐷)‘(𝐹‘𝑟)) = ((ball‘𝐷)‘(𝐹‘𝑘)))
14	13	sseq1d 3963	. . . . . . 7 ⊢ (𝑟 = 𝑘 → (((ball‘𝐷)‘(𝐹‘𝑟)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)) ↔ ((ball‘𝐷)‘(𝐹‘𝑘)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))))
15	14	imbi2d 340	. . . . . 6 ⊢ (𝑟 = 𝑘 → (((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝑟)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))) ↔ ((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝑘)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)))))
16		2fveq3 6830	. . . . . . . 8 ⊢ (𝑟 = (𝑘 + 1) → ((ball‘𝐷)‘(𝐹‘𝑟)) = ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))))
17	16	sseq1d 3963	. . . . . . 7 ⊢ (𝑟 = (𝑘 + 1) → (((ball‘𝐷)‘(𝐹‘𝑟)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)) ↔ ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))))
18	17	imbi2d 340	. . . . . 6 ⊢ (𝑟 = (𝑘 + 1) → (((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝑟)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))) ↔ ((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)))))
19		ssid 3954	. . . . . . 7 ⊢ ((ball‘𝐷)‘(𝐹‘𝐴)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))
20	19	2a1i 12	. . . . . 6 ⊢ (𝐴 ∈ ℤ → ((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝐴)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))))
21		caubl.4	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑛 ∈ ℕ ((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝑛)))
22		eluznn 12759	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → 𝑘 ∈ ℕ)
23		fvoveq1 7360	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑘 → (𝐹‘(𝑛 + 1)) = (𝐹‘(𝑘 + 1)))
24	23	fveq2d 6829	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑘 → ((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) = ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))))
25		2fveq3 6830	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑘 → ((ball‘𝐷)‘(𝐹‘𝑛)) = ((ball‘𝐷)‘(𝐹‘𝑘)))
26	24, 25	sseq12d 3965	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑘 → (((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝑛)) ↔ ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝑘))))
27	26	rspccva 3569	. . . . . . . . . . 11 ⊢ ((∀𝑛 ∈ ℕ ((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝑛)) ∧ 𝑘 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝑘)))
28	21, 22, 27	syl2an 596	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ≥‘𝐴))) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝑘)))
29	28	anassrs 468	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝑘)))
30		sstr2 3939	. . . . . . . . 9 ⊢ (((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝑘)) → (((ball‘𝐷)‘(𝐹‘𝑘)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))))
31	29, 30	syl 17	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → (((ball‘𝐷)‘(𝐹‘𝑘)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))))
32	31	expcom 414	. . . . . . 7 ⊢ (𝑘 ∈ (ℤ≥‘𝐴) → ((𝜑 ∧ 𝐴 ∈ ℕ) → (((ball‘𝐷)‘(𝐹‘𝑘)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)))))
33	32	a2d 29	. . . . . 6 ⊢ (𝑘 ∈ (ℤ≥‘𝐴) → (((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝑘)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))) → ((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)))))
34	12, 15, 18, 15, 20, 33	uzind4 12747	. . . . 5 ⊢ (𝑘 ∈ (ℤ≥‘𝐴) → ((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝑘)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))))
35	34	impcom 408	. . . 4 ⊢ (((𝜑 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → ((ball‘𝐷)‘(𝐹‘𝑘)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)))
36	35	3adantl2 1166	. . 3 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → ((ball‘𝐷)‘(𝐹‘𝑘)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)))
37	3	adantr 481	. . . . 5 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → 𝐷 ∈ (∞Met‘𝑋))
38		simpl1 1190	. . . . . . . 8 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → 𝜑)
39		caubl.3	. . . . . . . 8 ⊢ (𝜑 → 𝐹:ℕ⟶(𝑋 × ℝ+))
40	38, 39	syl 17	. . . . . . 7 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → 𝐹:ℕ⟶(𝑋 × ℝ+))
41	22	3ad2antl3 1186	. . . . . . 7 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → 𝑘 ∈ ℕ)
42	40, 41	ffvelcdmd 7018	. . . . . 6 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → (𝐹‘𝑘) ∈ (𝑋 × ℝ+))
43		xp1st 7931	. . . . . 6 ⊢ ((𝐹‘𝑘) ∈ (𝑋 × ℝ+) → (1st ‘(𝐹‘𝑘)) ∈ 𝑋)
44	42, 43	syl 17	. . . . 5 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → (1st ‘(𝐹‘𝑘)) ∈ 𝑋)
45		xp2nd 7932	. . . . . 6 ⊢ ((𝐹‘𝑘) ∈ (𝑋 × ℝ+) → (2nd ‘(𝐹‘𝑘)) ∈ ℝ+)
46	42, 45	syl 17	. . . . 5 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → (2nd ‘(𝐹‘𝑘)) ∈ ℝ+)
47		blcntr 23672	. . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (1st ‘(𝐹‘𝑘)) ∈ 𝑋 ∧ (2nd ‘(𝐹‘𝑘)) ∈ ℝ+) → (1st ‘(𝐹‘𝑘)) ∈ ((1st ‘(𝐹‘𝑘))(ball‘𝐷)(2nd ‘(𝐹‘𝑘))))
48	37, 44, 46, 47	syl3anc 1370	. . . 4 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → (1st ‘(𝐹‘𝑘)) ∈ ((1st ‘(𝐹‘𝑘))(ball‘𝐷)(2nd ‘(𝐹‘𝑘))))
49		fvco3 6923	. . . . 5 ⊢ ((𝐹:ℕ⟶(𝑋 × ℝ+) ∧ 𝑘 ∈ ℕ) → ((1st ∘ 𝐹)‘𝑘) = (1st ‘(𝐹‘𝑘)))
50	40, 41, 49	syl2anc 584	. . . 4 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → ((1st ∘ 𝐹)‘𝑘) = (1st ‘(𝐹‘𝑘)))
51		1st2nd2 7938	. . . . . . 7 ⊢ ((𝐹‘𝑘) ∈ (𝑋 × ℝ+) → (𝐹‘𝑘) = ⟨(1st ‘(𝐹‘𝑘)), (2nd ‘(𝐹‘𝑘))⟩)
52	42, 51	syl 17	. . . . . 6 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → (𝐹‘𝑘) = ⟨(1st ‘(𝐹‘𝑘)), (2nd ‘(𝐹‘𝑘))⟩)
53	52	fveq2d 6829	. . . . 5 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → ((ball‘𝐷)‘(𝐹‘𝑘)) = ((ball‘𝐷)‘⟨(1st ‘(𝐹‘𝑘)), (2nd ‘(𝐹‘𝑘))⟩))
54		df-ov 7340	. . . . 5 ⊢ ((1st ‘(𝐹‘𝑘))(ball‘𝐷)(2nd ‘(𝐹‘𝑘))) = ((ball‘𝐷)‘⟨(1st ‘(𝐹‘𝑘)), (2nd ‘(𝐹‘𝑘))⟩)
55	53, 54	eqtr4di 2794	. . . 4 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → ((ball‘𝐷)‘(𝐹‘𝑘)) = ((1st ‘(𝐹‘𝑘))(ball‘𝐷)(2nd ‘(𝐹‘𝑘))))
56	48, 50, 55	3eltr4d 2852	. . 3 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → ((1st ∘ 𝐹)‘𝑘) ∈ ((ball‘𝐷)‘(𝐹‘𝑘)))
57	36, 56	sseldd 3933	. 2 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → ((1st ∘ 𝐹)‘𝑘) ∈ ((ball‘𝐷)‘(𝐹‘𝐴)))
58	39	ffvelcdmda 7017	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ∈ ℕ) → (𝐹‘𝐴) ∈ (𝑋 × ℝ+))
59	58	3adant2 1130	. . . . . 6 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → (𝐹‘𝐴) ∈ (𝑋 × ℝ+))
60		1st2nd2 7938	. . . . . 6 ⊢ ((𝐹‘𝐴) ∈ (𝑋 × ℝ+) → (𝐹‘𝐴) = ⟨(1st ‘(𝐹‘𝐴)), (2nd ‘(𝐹‘𝐴))⟩)
61	59, 60	syl 17	. . . . 5 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → (𝐹‘𝐴) = ⟨(1st ‘(𝐹‘𝐴)), (2nd ‘(𝐹‘𝐴))⟩)
62	61	fveq2d 6829	. . . 4 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝐴)) = ((ball‘𝐷)‘⟨(1st ‘(𝐹‘𝐴)), (2nd ‘(𝐹‘𝐴))⟩))
63		df-ov 7340	. . . 4 ⊢ ((1st ‘(𝐹‘𝐴))(ball‘𝐷)(2nd ‘(𝐹‘𝐴))) = ((ball‘𝐷)‘⟨(1st ‘(𝐹‘𝐴)), (2nd ‘(𝐹‘𝐴))⟩)
64	62, 63	eqtr4di 2794	. . 3 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝐴)) = ((1st ‘(𝐹‘𝐴))(ball‘𝐷)(2nd ‘(𝐹‘𝐴))))
65		xp1st 7931	. . . . 5 ⊢ ((𝐹‘𝐴) ∈ (𝑋 × ℝ+) → (1st ‘(𝐹‘𝐴)) ∈ 𝑋)
66	59, 65	syl 17	. . . 4 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → (1st ‘(𝐹‘𝐴)) ∈ 𝑋)
67		xp2nd 7932	. . . . . 6 ⊢ ((𝐹‘𝐴) ∈ (𝑋 × ℝ+) → (2nd ‘(𝐹‘𝐴)) ∈ ℝ+)
68	59, 67	syl 17	. . . . 5 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → (2nd ‘(𝐹‘𝐴)) ∈ ℝ+)
69	68	rpxrd 12874	. . . 4 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → (2nd ‘(𝐹‘𝐴)) ∈ ℝ*)
70		blssm 23677	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (1st ‘(𝐹‘𝐴)) ∈ 𝑋 ∧ (2nd ‘(𝐹‘𝐴)) ∈ ℝ*) → ((1st ‘(𝐹‘𝐴))(ball‘𝐷)(2nd ‘(𝐹‘𝐴))) ⊆ 𝑋)
71	3, 66, 69, 70	syl3anc 1370	. . 3 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → ((1st ‘(𝐹‘𝐴))(ball‘𝐷)(2nd ‘(𝐹‘𝐴))) ⊆ 𝑋)
72	64, 71	eqsstrd 3970	. 2 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝐴)) ⊆ 𝑋)
73	1, 6, 8, 9, 57, 72	lmcls 22559	1 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → 𝑃 ∈ ((cls‘𝐽)‘((ball‘𝐷)‘(𝐹‘𝐴))))

Syntax hints:   → wi 4   ∧ wa 396   ∧ w3a 1086   = wceq 1540   ∈ wcel 2105  ∀wral 3061   ⊆ wss 3898  ⟨cop 4579   class class class wbr 5092   × cxp 5618   ∘ ccom 5624  ⟶wf 6475  ‘cfv 6479  (class class class)co 7337  1^st c1st 7897  2^nd c2nd 7898  1c1 10973   + caddc 10975  ℝ^*cxr 11109  ℕcn 12074  ℤcz 12420  ℤ_≥cuz 12683  ℝ⁺crp 12831  ∞Metcxmet 20688  ballcbl 20690  MetOpencmopn 20693  TopOnctopon 22165  clsccl 22275  ⇝_𝑡clm 22483

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 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2707  ax-rep 5229  ax-sep 5243  ax-nul 5250  ax-pow 5308  ax-pr 5372  ax-un 7650  ax-cnex 11028  ax-resscn 11029  ax-1cn 11030  ax-icn 11031  ax-addcl 11032  ax-addrcl 11033  ax-mulcl 11034  ax-mulrcl 11035  ax-mulcom 11036  ax-addass 11037  ax-mulass 11038  ax-distr 11039  ax-i2m1 11040  ax-1ne0 11041  ax-1rid 11042  ax-rnegex 11043  ax-rrecex 11044  ax-cnre 11045  ax-pre-lttri 11046  ax-pre-lttrn 11047  ax-pre-ltadd 11048  ax-pre-mulgt0 11049  ax-pre-sup 11050

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2886  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rmo 3349  df-reu 3350  df-rab 3404  df-v 3443  df-sbc 3728  df-csb 3844  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3917  df-nul 4270  df-if 4474  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4853  df-int 4895  df-iun 4943  df-iin 4944  df-br 5093  df-opab 5155  df-mpt 5176  df-tr 5210  df-id 5518  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5575  df-we 5577  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-res 5632  df-ima 5633  df-pred 6238  df-ord 6305  df-on 6306  df-lim 6307  df-suc 6308  df-iota 6431  df-fun 6481  df-fn 6482  df-f 6483  df-f1 6484  df-fo 6485  df-f1o 6486  df-fv 6487  df-riota 7293  df-ov 7340  df-oprab 7341  df-mpo 7342  df-om 7781  df-1st 7899  df-2nd 7900  df-frecs 8167  df-wrecs 8198  df-recs 8272  df-rdg 8311  df-er 8569  df-map 8688  df-pm 8689  df-en 8805  df-dom 8806  df-sdom 8807  df-sup 9299  df-inf 9300  df-pnf 11112  df-mnf 11113  df-xr 11114  df-ltxr 11115  df-le 11116  df-sub 11308  df-neg 11309  df-div 11734  df-nn 12075  df-2 12137  df-n0 12335  df-z 12421  df-uz 12684  df-q 12790  df-rp 12832  df-xneg 12949  df-xadd 12950  df-xmul 12951  df-topgen 17251  df-psmet 20695  df-xmet 20696  df-bl 20698  df-mopn 20699  df-top 22149  df-topon 22166  df-bases 22202  df-cld 22276  df-ntr 22277  df-cls 22278  df-lm 22486

This theorem is referenced by:  bcthlem3  24596  heiborlem8  36081