Theorem caublcls 24473

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 2738	. 2 ⊢ (ℤ≥‘𝐴) = (ℤ≥‘𝐴)
2		caubl.2	. . . 4 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋))
3	2	3ad2ant1 1132	. . 3 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → 𝐷 ∈ (∞Met‘𝑋))
4		caublcls.6	. . . 4 ⊢ 𝐽 = (MetOpen‘𝐷)
5	4	mopntopon 23592	. . 3 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ (TopOn‘𝑋))
6	3, 5	syl 17	. 2 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → 𝐽 ∈ (TopOn‘𝑋))
7		simp3 1137	. . 3 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → 𝐴 ∈ ℕ)
8	7	nnzd 12425	. 2 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → 𝐴 ∈ ℤ)
9		simp2 1136	. 2 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃)
10		2fveq3 6779	. . . . . . . 8 ⊢ (𝑟 = 𝐴 → ((ball‘𝐷)‘(𝐹‘𝑟)) = ((ball‘𝐷)‘(𝐹‘𝐴)))
11	10	sseq1d 3952	. . . . . . 7 ⊢ (𝑟 = 𝐴 → (((ball‘𝐷)‘(𝐹‘𝑟)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)) ↔ ((ball‘𝐷)‘(𝐹‘𝐴)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))))
12	11	imbi2d 341	. . . . . 6 ⊢ (𝑟 = 𝐴 → (((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝑟)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))) ↔ ((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝐴)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)))))
13		2fveq3 6779	. . . . . . . 8 ⊢ (𝑟 = 𝑘 → ((ball‘𝐷)‘(𝐹‘𝑟)) = ((ball‘𝐷)‘(𝐹‘𝑘)))
14	13	sseq1d 3952	. . . . . . 7 ⊢ (𝑟 = 𝑘 → (((ball‘𝐷)‘(𝐹‘𝑟)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)) ↔ ((ball‘𝐷)‘(𝐹‘𝑘)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))))
15	14	imbi2d 341	. . . . . 6 ⊢ (𝑟 = 𝑘 → (((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝑟)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))) ↔ ((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝑘)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)))))
16		2fveq3 6779	. . . . . . . 8 ⊢ (𝑟 = (𝑘 + 1) → ((ball‘𝐷)‘(𝐹‘𝑟)) = ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))))
17	16	sseq1d 3952	. . . . . . 7 ⊢ (𝑟 = (𝑘 + 1) → (((ball‘𝐷)‘(𝐹‘𝑟)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)) ↔ ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))))
18	17	imbi2d 341	. . . . . 6 ⊢ (𝑟 = (𝑘 + 1) → (((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝑟)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))) ↔ ((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴)))))
19		ssid 3943	. . . . . . 7 ⊢ ((ball‘𝐷)‘(𝐹‘𝐴)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))
20	19	2a1i 12	. . . . . 6 ⊢ (𝐴 ∈ ℤ → ((𝜑 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝐴)) ⊆ ((ball‘𝐷)‘(𝐹‘𝐴))))
21		caubl.4	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑛 ∈ ℕ ((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝑛)))
22		eluznn 12658	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → 𝑘 ∈ ℕ)
23		fvoveq1 7298	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑘 → (𝐹‘(𝑛 + 1)) = (𝐹‘(𝑘 + 1)))
24	23	fveq2d 6778	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑘 → ((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) = ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))))
25		2fveq3 6779	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑘 → ((ball‘𝐷)‘(𝐹‘𝑛)) = ((ball‘𝐷)‘(𝐹‘𝑘)))
26	24, 25	sseq12d 3954	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑘 → (((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝑛)) ↔ ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹‘𝑘))))
27	26	rspccva 3560	. . . . . . . . . . 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 3928	. . . . . . . . 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 12646	. . . . 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	ffvelrnd 6962	. . . . . 6 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → (𝐹‘𝑘) ∈ (𝑋 × ℝ+))
43		xp1st 7863	. . . . . 6 ⊢ ((𝐹‘𝑘) ∈ (𝑋 × ℝ+) → (1st ‘(𝐹‘𝑘)) ∈ 𝑋)
44	42, 43	syl 17	. . . . 5 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → (1st ‘(𝐹‘𝑘)) ∈ 𝑋)
45		xp2nd 7864	. . . . . 6 ⊢ ((𝐹‘𝑘) ∈ (𝑋 × ℝ+) → (2nd ‘(𝐹‘𝑘)) ∈ ℝ+)
46	42, 45	syl 17	. . . . 5 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → (2nd ‘(𝐹‘𝑘)) ∈ ℝ+)
47		blcntr 23566	. . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (1st ‘(𝐹‘𝑘)) ∈ 𝑋 ∧ (2nd ‘(𝐹‘𝑘)) ∈ ℝ+) → (1st ‘(𝐹‘𝑘)) ∈ ((1st ‘(𝐹‘𝑘))(ball‘𝐷)(2nd ‘(𝐹‘𝑘))))
48	37, 44, 46, 47	syl3anc 1370	. . . 4 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → (1st ‘(𝐹‘𝑘)) ∈ ((1st ‘(𝐹‘𝑘))(ball‘𝐷)(2nd ‘(𝐹‘𝑘))))
49		fvco3 6867	. . . . 5 ⊢ ((𝐹:ℕ⟶(𝑋 × ℝ+) ∧ 𝑘 ∈ ℕ) → ((1st ∘ 𝐹)‘𝑘) = (1st ‘(𝐹‘𝑘)))
50	40, 41, 49	syl2anc 584	. . . 4 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → ((1st ∘ 𝐹)‘𝑘) = (1st ‘(𝐹‘𝑘)))
51		1st2nd2 7870	. . . . . . 7 ⊢ ((𝐹‘𝑘) ∈ (𝑋 × ℝ+) → (𝐹‘𝑘) = ⟨(1st ‘(𝐹‘𝑘)), (2nd ‘(𝐹‘𝑘))⟩)
52	42, 51	syl 17	. . . . . 6 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → (𝐹‘𝑘) = ⟨(1st ‘(𝐹‘𝑘)), (2nd ‘(𝐹‘𝑘))⟩)
53	52	fveq2d 6778	. . . . 5 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → ((ball‘𝐷)‘(𝐹‘𝑘)) = ((ball‘𝐷)‘⟨(1st ‘(𝐹‘𝑘)), (2nd ‘(𝐹‘𝑘))⟩))
54		df-ov 7278	. . . . 5 ⊢ ((1st ‘(𝐹‘𝑘))(ball‘𝐷)(2nd ‘(𝐹‘𝑘))) = ((ball‘𝐷)‘⟨(1st ‘(𝐹‘𝑘)), (2nd ‘(𝐹‘𝑘))⟩)
55	53, 54	eqtr4di 2796	. . . 4 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → ((ball‘𝐷)‘(𝐹‘𝑘)) = ((1st ‘(𝐹‘𝑘))(ball‘𝐷)(2nd ‘(𝐹‘𝑘))))
56	48, 50, 55	3eltr4d 2854	. . 3 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → ((1st ∘ 𝐹)‘𝑘) ∈ ((ball‘𝐷)‘(𝐹‘𝑘)))
57	36, 56	sseldd 3922	. 2 ⊢ (((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ≥‘𝐴)) → ((1st ∘ 𝐹)‘𝑘) ∈ ((ball‘𝐷)‘(𝐹‘𝐴)))
58	39	ffvelrnda 6961	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ∈ ℕ) → (𝐹‘𝐴) ∈ (𝑋 × ℝ+))
59	58	3adant2 1130	. . . . . 6 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → (𝐹‘𝐴) ∈ (𝑋 × ℝ+))
60		1st2nd2 7870	. . . . . 6 ⊢ ((𝐹‘𝐴) ∈ (𝑋 × ℝ+) → (𝐹‘𝐴) = ⟨(1st ‘(𝐹‘𝐴)), (2nd ‘(𝐹‘𝐴))⟩)
61	59, 60	syl 17	. . . . 5 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → (𝐹‘𝐴) = ⟨(1st ‘(𝐹‘𝐴)), (2nd ‘(𝐹‘𝐴))⟩)
62	61	fveq2d 6778	. . . 4 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝐴)) = ((ball‘𝐷)‘⟨(1st ‘(𝐹‘𝐴)), (2nd ‘(𝐹‘𝐴))⟩))
63		df-ov 7278	. . . 4 ⊢ ((1st ‘(𝐹‘𝐴))(ball‘𝐷)(2nd ‘(𝐹‘𝐴))) = ((ball‘𝐷)‘⟨(1st ‘(𝐹‘𝐴)), (2nd ‘(𝐹‘𝐴))⟩)
64	62, 63	eqtr4di 2796	. . 3 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝐴)) = ((1st ‘(𝐹‘𝐴))(ball‘𝐷)(2nd ‘(𝐹‘𝐴))))
65		xp1st 7863	. . . . 5 ⊢ ((𝐹‘𝐴) ∈ (𝑋 × ℝ+) → (1st ‘(𝐹‘𝐴)) ∈ 𝑋)
66	59, 65	syl 17	. . . 4 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → (1st ‘(𝐹‘𝐴)) ∈ 𝑋)
67		xp2nd 7864	. . . . . 6 ⊢ ((𝐹‘𝐴) ∈ (𝑋 × ℝ+) → (2nd ‘(𝐹‘𝐴)) ∈ ℝ+)
68	59, 67	syl 17	. . . . 5 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → (2nd ‘(𝐹‘𝐴)) ∈ ℝ+)
69	68	rpxrd 12773	. . . 4 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → (2nd ‘(𝐹‘𝐴)) ∈ ℝ*)
70		blssm 23571	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (1st ‘(𝐹‘𝐴)) ∈ 𝑋 ∧ (2nd ‘(𝐹‘𝐴)) ∈ ℝ*) → ((1st ‘(𝐹‘𝐴))(ball‘𝐷)(2nd ‘(𝐹‘𝐴))) ⊆ 𝑋)
71	3, 66, 69, 70	syl3anc 1370	. . 3 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → ((1st ‘(𝐹‘𝐴))(ball‘𝐷)(2nd ‘(𝐹‘𝐴))) ⊆ 𝑋)
72	64, 71	eqsstrd 3959	. 2 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘𝐴)) ⊆ 𝑋)
73	1, 6, 8, 9, 57, 72	lmcls 22453	1 ⊢ ((𝜑 ∧ (1st ∘ 𝐹)(⇝𝑡‘𝐽)𝑃 ∧ 𝐴 ∈ ℕ) → 𝑃 ∈ ((cls‘𝐽)‘((ball‘𝐷)‘(𝐹‘𝐴))))

Syntax hints:   → wi 4   ∧ wa 396   ∧ w3a 1086   = wceq 1539   ∈ wcel 2106  ∀wral 3064   ⊆ wss 3887  ⟨cop 4567   class class class wbr 5074   × cxp 5587   ∘ ccom 5593  ⟶wf 6429  ‘cfv 6433  (class class class)co 7275  1^st c1st 7829  2^nd c2nd 7830  1c1 10872   + caddc 10874  ℝ^*cxr 11008  ℕcn 11973  ℤcz 12319  ℤ_≥cuz 12582  ℝ⁺crp 12730  ∞Metcxmet 20582  ballcbl 20584  MetOpencmopn 20587  TopOnctopon 22059  clsccl 22169  ⇝_𝑡clm 22377

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-cnex 10927  ax-resscn 10928  ax-1cn 10929  ax-icn 10930  ax-addcl 10931  ax-addrcl 10932  ax-mulcl 10933  ax-mulrcl 10934  ax-mulcom 10935  ax-addass 10936  ax-mulass 10937  ax-distr 10938  ax-i2m1 10939  ax-1ne0 10940  ax-1rid 10941  ax-rnegex 10942  ax-rrecex 10943  ax-cnre 10944  ax-pre-lttri 10945  ax-pre-lttrn 10946  ax-pre-ltadd 10947  ax-pre-mulgt0 10948  ax-pre-sup 10949

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-iun 4926  df-iin 4927  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-1st 7831  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-er 8498  df-map 8617  df-pm 8618  df-en 8734  df-dom 8735  df-sdom 8736  df-sup 9201  df-inf 9202  df-pnf 11011  df-mnf 11012  df-xr 11013  df-ltxr 11014  df-le 11015  df-sub 11207  df-neg 11208  df-div 11633  df-nn 11974  df-2 12036  df-n0 12234  df-z 12320  df-uz 12583  df-q 12689  df-rp 12731  df-xneg 12848  df-xadd 12849  df-xmul 12850  df-topgen 17154  df-psmet 20589  df-xmet 20590  df-bl 20592  df-mopn 20593  df-top 22043  df-topon 22060  df-bases 22096  df-cld 22170  df-ntr 22171  df-cls 22172  df-lm 22380

This theorem is referenced by:  bcthlem3  24490  heiborlem8  35976