ssbnd - Mathbox for Jeff Madsen

	Mathbox for Jeff Madsen		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > ssbnd		Structured version Visualization version GIF version

Theorem ssbnd 38109

Description: A subset of a metric space is bounded iff it is contained in a ball around 𝑃, for any 𝑃 in the larger space. (Contributed by Mario Carneiro, 14-Sep-2015.)

**Hypothesis**
Ref	Expression
ssbnd.2	⊢ 𝑁 = (𝑀 ↾ (𝑌 × 𝑌))

**Assertion**
Ref	Expression
ssbnd	⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) → (𝑁 ∈ (Bnd‘𝑌) ↔ ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)))

Distinct variable groups: 𝑀,𝑑 𝑁,𝑑 𝑃,𝑑 𝑋,𝑑 𝑌,𝑑

Proof of Theorem ssbnd Dummy variables 𝑟 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		0re 11146	. . . . . . 7 ⊢ 0 ∈ ℝ
2	1	ne0ii 4284	. . . . . 6 ⊢ ℝ ≠ ∅
3		0ss 4340	. . . . . . . 8 ⊢ ∅ ⊆ (𝑃(ball‘𝑀)𝑑)
4		sseq1 3947	. . . . . . . 8 ⊢ (𝑌 = ∅ → (𝑌 ⊆ (𝑃(ball‘𝑀)𝑑) ↔ ∅ ⊆ (𝑃(ball‘𝑀)𝑑)))
5	3, 4	mpbiri 258	. . . . . . 7 ⊢ (𝑌 = ∅ → 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))
6	5	ralrimivw 3133	. . . . . 6 ⊢ (𝑌 = ∅ → ∀𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))
7		r19.2z 4439	. . . . . 6 ⊢ ((ℝ ≠ ∅ ∧ ∀𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)) → ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))
8	2, 6, 7	sylancr 588	. . . . 5 ⊢ (𝑌 = ∅ → ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))
9	8	a1i 11	. . . 4 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (Bnd‘𝑌)) → (𝑌 = ∅ → ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)))
10		isbnd2 38104	. . . . . 6 ⊢ ((𝑁 ∈ (Bnd‘𝑌) ∧ 𝑌 ≠ ∅) ↔ (𝑁 ∈ (∞Met‘𝑌) ∧ ∃𝑦 ∈ 𝑌 ∃𝑟 ∈ ℝ⁺ 𝑌 = (𝑦(ball‘𝑁)𝑟)))
11		simplll 775	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → 𝑀 ∈ (Met‘𝑋))
12		ssbnd.2	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 𝑁 = (𝑀 ↾ (𝑌 × 𝑌))
13	12	dmeqi 5859	. . . . . . . . . . . . . . . . . . . 20 ⊢ dom 𝑁 = dom (𝑀 ↾ (𝑌 × 𝑌))
14		dmres 5977	. . . . . . . . . . . . . . . . . . . 20 ⊢ dom (𝑀 ↾ (𝑌 × 𝑌)) = ((𝑌 × 𝑌) ∩ dom 𝑀)
15	13, 14	eqtri 2759	. . . . . . . . . . . . . . . . . . 19 ⊢ dom 𝑁 = ((𝑌 × 𝑌) ∩ dom 𝑀)
16		xmetf 24294	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ (∞Met‘𝑌) → 𝑁:(𝑌 × 𝑌)⟶ℝ^*)
17	16	fdmd 6678	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑁 ∈ (∞Met‘𝑌) → dom 𝑁 = (𝑌 × 𝑌))
18	15, 17	eqtr3id 2785	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑁 ∈ (∞Met‘𝑌) → ((𝑌 × 𝑌) ∩ dom 𝑀) = (𝑌 × 𝑌))
19		dfss2 3907	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑌 × 𝑌) ⊆ dom 𝑀 ↔ ((𝑌 × 𝑌) ∩ dom 𝑀) = (𝑌 × 𝑌))
20	18, 19	sylibr 234	. . . . . . . . . . . . . . . . 17 ⊢ (𝑁 ∈ (∞Met‘𝑌) → (𝑌 × 𝑌) ⊆ dom 𝑀)
21	20	ad2antlr 728	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (𝑌 × 𝑌) ⊆ dom 𝑀)
22		metf 24295	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑀 ∈ (Met‘𝑋) → 𝑀:(𝑋 × 𝑋)⟶ℝ)
23	22	fdmd 6678	. . . . . . . . . . . . . . . . 17 ⊢ (𝑀 ∈ (Met‘𝑋) → dom 𝑀 = (𝑋 × 𝑋))
24	23	ad3antrrr 731	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → dom 𝑀 = (𝑋 × 𝑋))
25	21, 24	sseqtrd 3958	. . . . . . . . . . . . . . 15 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (𝑌 × 𝑌) ⊆ (𝑋 × 𝑋))
26		dmss 5857	. . . . . . . . . . . . . . 15 ⊢ ((𝑌 × 𝑌) ⊆ (𝑋 × 𝑋) → dom (𝑌 × 𝑌) ⊆ dom (𝑋 × 𝑋))
27	25, 26	syl 17	. . . . . . . . . . . . . 14 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → dom (𝑌 × 𝑌) ⊆ dom (𝑋 × 𝑋))
28		dmxpid 5885	. . . . . . . . . . . . . 14 ⊢ dom (𝑌 × 𝑌) = 𝑌
29		dmxpid 5885	. . . . . . . . . . . . . 14 ⊢ dom (𝑋 × 𝑋) = 𝑋
30	27, 28, 29	3sstr3g 3974	. . . . . . . . . . . . 13 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → 𝑌 ⊆ 𝑋)
31		simprl 771	. . . . . . . . . . . . 13 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → 𝑦 ∈ 𝑌)
32	30, 31	sseldd 3922	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → 𝑦 ∈ 𝑋)
33		simpllr 776	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → 𝑃 ∈ 𝑋)
34		metcl 24297	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝑦 ∈ 𝑋 ∧ 𝑃 ∈ 𝑋) → (𝑦𝑀𝑃) ∈ ℝ)
35	11, 32, 33, 34	syl3anc 1374	. . . . . . . . . . 11 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (𝑦𝑀𝑃) ∈ ℝ)
36		rpre 12951	. . . . . . . . . . . 12 ⊢ (𝑟 ∈ ℝ⁺ → 𝑟 ∈ ℝ)
37	36	ad2antll 730	. . . . . . . . . . 11 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → 𝑟 ∈ ℝ)
38	35, 37	readdcld 11174	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → ((𝑦𝑀𝑃) + 𝑟) ∈ ℝ)
39		metxmet 24299	. . . . . . . . . . . . 13 ⊢ (𝑀 ∈ (Met‘𝑋) → 𝑀 ∈ (∞Met‘𝑋))
40	11, 39	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → 𝑀 ∈ (∞Met‘𝑋))
41	32, 31	elind 4140	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → 𝑦 ∈ (𝑋 ∩ 𝑌))
42		rpxr 12952	. . . . . . . . . . . . 13 ⊢ (𝑟 ∈ ℝ⁺ → 𝑟 ∈ ℝ^*)
43	42	ad2antll 730	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → 𝑟 ∈ ℝ^*)
44	12	blres 24396	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑦 ∈ (𝑋 ∩ 𝑌) ∧ 𝑟 ∈ ℝ^*) → (𝑦(ball‘𝑁)𝑟) = ((𝑦(ball‘𝑀)𝑟) ∩ 𝑌))
45	40, 41, 43, 44	syl3anc 1374	. . . . . . . . . . 11 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (𝑦(ball‘𝑁)𝑟) = ((𝑦(ball‘𝑀)𝑟) ∩ 𝑌))
46		inss1 4177	. . . . . . . . . . . 12 ⊢ ((𝑦(ball‘𝑀)𝑟) ∩ 𝑌) ⊆ (𝑦(ball‘𝑀)𝑟)
47	35	leidd 11716	. . . . . . . . . . . . . 14 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (𝑦𝑀𝑃) ≤ (𝑦𝑀𝑃))
48	35	recnd 11173	. . . . . . . . . . . . . . 15 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (𝑦𝑀𝑃) ∈ ℂ)
49	37	recnd 11173	. . . . . . . . . . . . . . 15 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → 𝑟 ∈ ℂ)
50	48, 49	pncand 11506	. . . . . . . . . . . . . 14 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (((𝑦𝑀𝑃) + 𝑟) − 𝑟) = (𝑦𝑀𝑃))
51	47, 50	breqtrrd 5113	. . . . . . . . . . . . 13 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (𝑦𝑀𝑃) ≤ (((𝑦𝑀𝑃) + 𝑟) − 𝑟))
52		blss2 24369	. . . . . . . . . . . . 13 ⊢ (((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑦 ∈ 𝑋 ∧ 𝑃 ∈ 𝑋) ∧ (𝑟 ∈ ℝ ∧ ((𝑦𝑀𝑃) + 𝑟) ∈ ℝ ∧ (𝑦𝑀𝑃) ≤ (((𝑦𝑀𝑃) + 𝑟) − 𝑟))) → (𝑦(ball‘𝑀)𝑟) ⊆ (𝑃(ball‘𝑀)((𝑦𝑀𝑃) + 𝑟)))
53	40, 32, 33, 37, 38, 51, 52	syl33anc 1388	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (𝑦(ball‘𝑀)𝑟) ⊆ (𝑃(ball‘𝑀)((𝑦𝑀𝑃) + 𝑟)))
54	46, 53	sstrid 3933	. . . . . . . . . . 11 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → ((𝑦(ball‘𝑀)𝑟) ∩ 𝑌) ⊆ (𝑃(ball‘𝑀)((𝑦𝑀𝑃) + 𝑟)))
55	45, 54	eqsstrd 3956	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (𝑦(ball‘𝑁)𝑟) ⊆ (𝑃(ball‘𝑀)((𝑦𝑀𝑃) + 𝑟)))
56		oveq2 7375	. . . . . . . . . . . 12 ⊢ (𝑑 = ((𝑦𝑀𝑃) + 𝑟) → (𝑃(ball‘𝑀)𝑑) = (𝑃(ball‘𝑀)((𝑦𝑀𝑃) + 𝑟)))
57	56	sseq2d 3954	. . . . . . . . . . 11 ⊢ (𝑑 = ((𝑦𝑀𝑃) + 𝑟) → ((𝑦(ball‘𝑁)𝑟) ⊆ (𝑃(ball‘𝑀)𝑑) ↔ (𝑦(ball‘𝑁)𝑟) ⊆ (𝑃(ball‘𝑀)((𝑦𝑀𝑃) + 𝑟))))
58	57	rspcev 3564	. . . . . . . . . 10 ⊢ ((((𝑦𝑀𝑃) + 𝑟) ∈ ℝ ∧ (𝑦(ball‘𝑁)𝑟) ⊆ (𝑃(ball‘𝑀)((𝑦𝑀𝑃) + 𝑟))) → ∃𝑑 ∈ ℝ (𝑦(ball‘𝑁)𝑟) ⊆ (𝑃(ball‘𝑀)𝑑))
59	38, 55, 58	syl2anc 585	. . . . . . . . 9 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → ∃𝑑 ∈ ℝ (𝑦(ball‘𝑁)𝑟) ⊆ (𝑃(ball‘𝑀)𝑑))
60		sseq1 3947	. . . . . . . . . 10 ⊢ (𝑌 = (𝑦(ball‘𝑁)𝑟) → (𝑌 ⊆ (𝑃(ball‘𝑀)𝑑) ↔ (𝑦(ball‘𝑁)𝑟) ⊆ (𝑃(ball‘𝑀)𝑑)))
61	60	rexbidv 3161	. . . . . . . . 9 ⊢ (𝑌 = (𝑦(ball‘𝑁)𝑟) → (∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑) ↔ ∃𝑑 ∈ ℝ (𝑦(ball‘𝑁)𝑟) ⊆ (𝑃(ball‘𝑀)𝑑)))
62	59, 61	syl5ibrcom 247	. . . . . . . 8 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (𝑌 = (𝑦(ball‘𝑁)𝑟) → ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)))
63	62	rexlimdvva 3194	. . . . . . 7 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) → (∃𝑦 ∈ 𝑌 ∃𝑟 ∈ ℝ⁺ 𝑌 = (𝑦(ball‘𝑁)𝑟) → ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)))
64	63	expimpd 453	. . . . . 6 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) → ((𝑁 ∈ (∞Met‘𝑌) ∧ ∃𝑦 ∈ 𝑌 ∃𝑟 ∈ ℝ⁺ 𝑌 = (𝑦(ball‘𝑁)𝑟)) → ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)))
65	10, 64	biimtrid 242	. . . . 5 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) → ((𝑁 ∈ (Bnd‘𝑌) ∧ 𝑌 ≠ ∅) → ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)))
66	65	expdimp 452	. . . 4 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (Bnd‘𝑌)) → (𝑌 ≠ ∅ → ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)))
67	9, 66	pm2.61dne 3018	. . 3 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (Bnd‘𝑌)) → ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))
68	67	ex 412	. 2 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) → (𝑁 ∈ (Bnd‘𝑌) → ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)))
69		simprr 773	. . . . . . 7 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑑 ∈ ℝ ∧ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))) → 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))
70		xpss12 5646	. . . . . . 7 ⊢ ((𝑌 ⊆ (𝑃(ball‘𝑀)𝑑) ∧ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)) → (𝑌 × 𝑌) ⊆ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑)))
71	69, 69, 70	syl2anc 585	. . . . . 6 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑑 ∈ ℝ ∧ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))) → (𝑌 × 𝑌) ⊆ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑)))
72	71	resabs1d 5973	. . . . 5 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑑 ∈ ℝ ∧ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))) → ((𝑀 ↾ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑))) ↾ (𝑌 × 𝑌)) = (𝑀 ↾ (𝑌 × 𝑌)))
73	72, 12	eqtr4di 2789	. . . 4 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑑 ∈ ℝ ∧ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))) → ((𝑀 ↾ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑))) ↾ (𝑌 × 𝑌)) = 𝑁)
74		blbnd 38108	. . . . . . . 8 ⊢ ((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑑 ∈ ℝ) → (𝑀 ↾ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑))) ∈ (Bnd‘(𝑃(ball‘𝑀)𝑑)))
75	39, 74	syl3an1 1164	. . . . . . 7 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑑 ∈ ℝ) → (𝑀 ↾ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑))) ∈ (Bnd‘(𝑃(ball‘𝑀)𝑑)))
76	75	3expa 1119	. . . . . 6 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑑 ∈ ℝ) → (𝑀 ↾ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑))) ∈ (Bnd‘(𝑃(ball‘𝑀)𝑑)))
77	76	adantrr 718	. . . . 5 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑑 ∈ ℝ ∧ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))) → (𝑀 ↾ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑))) ∈ (Bnd‘(𝑃(ball‘𝑀)𝑑)))
78		bndss 38107	. . . . 5 ⊢ (((𝑀 ↾ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑))) ∈ (Bnd‘(𝑃(ball‘𝑀)𝑑)) ∧ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)) → ((𝑀 ↾ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑))) ↾ (𝑌 × 𝑌)) ∈ (Bnd‘𝑌))
79	77, 69, 78	syl2anc 585	. . . 4 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑑 ∈ ℝ ∧ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))) → ((𝑀 ↾ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑))) ↾ (𝑌 × 𝑌)) ∈ (Bnd‘𝑌))
80	73, 79	eqeltrrd 2837	. . 3 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑑 ∈ ℝ ∧ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))) → 𝑁 ∈ (Bnd‘𝑌))
81	80	rexlimdvaa 3139	. 2 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) → (∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑) → 𝑁 ∈ (Bnd‘𝑌)))
82	68, 81	impbid 212	1 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) → (𝑁 ∈ (Bnd‘𝑌) ↔ ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2932 ∀wral 3051 ∃wrex 3061 ∩ cin 3888 ⊆ wss 3889 ∅c0 4273 class class class wbr 5085 × cxp 5629 dom cdm 5631 ↾ cres 5633 ‘cfv 6498 (class class class)co 7367 ℝcr 11037 0cc0 11038 + caddc 11041 ℝ^*cxr 11178 ≤ cle 11180 − cmin 11377 ℝ⁺crp 12942 ∞Metcxmet 21337 Metcmet 21338 ballcbl 21339 Bndcbnd 38088

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-ec 8645 df-map 8775 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-nn 12175 df-2 12244 df-rp 12943 df-xneg 13063 df-xadd 13064 df-xmul 13065 df-psmet 21344 df-xmet 21345 df-met 21346 df-bl 21347 df-bnd 38100

This theorem is referenced by: prdsbnd2 38116 cntotbnd 38117

W3C validator