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 35065

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 10642	. . . . . . 7 ⊢ 0 ∈ ℝ
2	1	ne0ii 4302	. . . . . 6 ⊢ ℝ ≠ ∅
3		0ss 4349	. . . . . . . 8 ⊢ ∅ ⊆ (𝑃(ball‘𝑀)𝑑)
4		sseq1 3991	. . . . . . . 8 ⊢ (𝑌 = ∅ → (𝑌 ⊆ (𝑃(ball‘𝑀)𝑑) ↔ ∅ ⊆ (𝑃(ball‘𝑀)𝑑)))
5	3, 4	mpbiri 260	. . . . . . 7 ⊢ (𝑌 = ∅ → 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))
6	5	ralrimivw 3183	. . . . . 6 ⊢ (𝑌 = ∅ → ∀𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))
7		r19.2z 4439	. . . . . 6 ⊢ ((ℝ ≠ ∅ ∧ ∀𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)) → ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))
8	2, 6, 7	sylancr 589	. . . . 5 ⊢ (𝑌 = ∅ → ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))
9	8	a1i 11	. . . 4 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (Bnd‘𝑌)) → (𝑌 = ∅ → ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)))
10		isbnd2 35060	. . . . . 6 ⊢ ((𝑁 ∈ (Bnd‘𝑌) ∧ 𝑌 ≠ ∅) ↔ (𝑁 ∈ (∞Met‘𝑌) ∧ ∃𝑦 ∈ 𝑌 ∃𝑟 ∈ ℝ⁺ 𝑌 = (𝑦(ball‘𝑁)𝑟)))
11		simplll 773	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → 𝑀 ∈ (Met‘𝑋))
12		ssbnd.2	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 𝑁 = (𝑀 ↾ (𝑌 × 𝑌))
13	12	dmeqi 5772	. . . . . . . . . . . . . . . . . . . 20 ⊢ dom 𝑁 = dom (𝑀 ↾ (𝑌 × 𝑌))
14		dmres 5874	. . . . . . . . . . . . . . . . . . . 20 ⊢ dom (𝑀 ↾ (𝑌 × 𝑌)) = ((𝑌 × 𝑌) ∩ dom 𝑀)
15	13, 14	eqtri 2844	. . . . . . . . . . . . . . . . . . 19 ⊢ dom 𝑁 = ((𝑌 × 𝑌) ∩ dom 𝑀)
16		xmetf 22938	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ (∞Met‘𝑌) → 𝑁:(𝑌 × 𝑌)⟶ℝ^*)
17	16	fdmd 6522	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑁 ∈ (∞Met‘𝑌) → dom 𝑁 = (𝑌 × 𝑌))
18	15, 17	syl5eqr 2870	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑁 ∈ (∞Met‘𝑌) → ((𝑌 × 𝑌) ∩ dom 𝑀) = (𝑌 × 𝑌))
19		df-ss 3951	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑌 × 𝑌) ⊆ dom 𝑀 ↔ ((𝑌 × 𝑌) ∩ dom 𝑀) = (𝑌 × 𝑌))
20	18, 19	sylibr 236	. . . . . . . . . . . . . . . . 17 ⊢ (𝑁 ∈ (∞Met‘𝑌) → (𝑌 × 𝑌) ⊆ dom 𝑀)
21	20	ad2antlr 725	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (𝑌 × 𝑌) ⊆ dom 𝑀)
22		metf 22939	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑀 ∈ (Met‘𝑋) → 𝑀:(𝑋 × 𝑋)⟶ℝ)
23	22	fdmd 6522	. . . . . . . . . . . . . . . . 17 ⊢ (𝑀 ∈ (Met‘𝑋) → dom 𝑀 = (𝑋 × 𝑋))
24	23	ad3antrrr 728	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → dom 𝑀 = (𝑋 × 𝑋))
25	21, 24	sseqtrd 4006	. . . . . . . . . . . . . . 15 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (𝑌 × 𝑌) ⊆ (𝑋 × 𝑋))
26		dmss 5770	. . . . . . . . . . . . . . 15 ⊢ ((𝑌 × 𝑌) ⊆ (𝑋 × 𝑋) → dom (𝑌 × 𝑌) ⊆ dom (𝑋 × 𝑋))
27	25, 26	syl 17	. . . . . . . . . . . . . 14 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → dom (𝑌 × 𝑌) ⊆ dom (𝑋 × 𝑋))
28		dmxpid 5799	. . . . . . . . . . . . . 14 ⊢ dom (𝑌 × 𝑌) = 𝑌
29		dmxpid 5799	. . . . . . . . . . . . . 14 ⊢ dom (𝑋 × 𝑋) = 𝑋
30	27, 28, 29	3sstr3g 4010	. . . . . . . . . . . . 13 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → 𝑌 ⊆ 𝑋)
31		simprl 769	. . . . . . . . . . . . 13 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → 𝑦 ∈ 𝑌)
32	30, 31	sseldd 3967	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → 𝑦 ∈ 𝑋)
33		simpllr 774	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → 𝑃 ∈ 𝑋)
34		metcl 22941	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝑦 ∈ 𝑋 ∧ 𝑃 ∈ 𝑋) → (𝑦𝑀𝑃) ∈ ℝ)
35	11, 32, 33, 34	syl3anc 1367	. . . . . . . . . . 11 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (𝑦𝑀𝑃) ∈ ℝ)
36		rpre 12396	. . . . . . . . . . . 12 ⊢ (𝑟 ∈ ℝ⁺ → 𝑟 ∈ ℝ)
37	36	ad2antll 727	. . . . . . . . . . 11 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → 𝑟 ∈ ℝ)
38	35, 37	readdcld 10669	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → ((𝑦𝑀𝑃) + 𝑟) ∈ ℝ)
39		metxmet 22943	. . . . . . . . . . . . 13 ⊢ (𝑀 ∈ (Met‘𝑋) → 𝑀 ∈ (∞Met‘𝑋))
40	11, 39	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → 𝑀 ∈ (∞Met‘𝑋))
41	32, 31	elind 4170	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → 𝑦 ∈ (𝑋 ∩ 𝑌))
42		rpxr 12397	. . . . . . . . . . . . 13 ⊢ (𝑟 ∈ ℝ⁺ → 𝑟 ∈ ℝ^*)
43	42	ad2antll 727	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → 𝑟 ∈ ℝ^*)
44	12	blres 23040	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑦 ∈ (𝑋 ∩ 𝑌) ∧ 𝑟 ∈ ℝ^*) → (𝑦(ball‘𝑁)𝑟) = ((𝑦(ball‘𝑀)𝑟) ∩ 𝑌))
45	40, 41, 43, 44	syl3anc 1367	. . . . . . . . . . 11 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (𝑦(ball‘𝑁)𝑟) = ((𝑦(ball‘𝑀)𝑟) ∩ 𝑌))
46		inss1 4204	. . . . . . . . . . . 12 ⊢ ((𝑦(ball‘𝑀)𝑟) ∩ 𝑌) ⊆ (𝑦(ball‘𝑀)𝑟)
47	35	leidd 11205	. . . . . . . . . . . . . 14 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (𝑦𝑀𝑃) ≤ (𝑦𝑀𝑃))
48	35	recnd 10668	. . . . . . . . . . . . . . 15 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (𝑦𝑀𝑃) ∈ ℂ)
49	37	recnd 10668	. . . . . . . . . . . . . . 15 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → 𝑟 ∈ ℂ)
50	48, 49	pncand 10997	. . . . . . . . . . . . . 14 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (((𝑦𝑀𝑃) + 𝑟) − 𝑟) = (𝑦𝑀𝑃))
51	47, 50	breqtrrd 5093	. . . . . . . . . . . . 13 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (𝑦𝑀𝑃) ≤ (((𝑦𝑀𝑃) + 𝑟) − 𝑟))
52		blss2 23013	. . . . . . . . . . . . 13 ⊢ (((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑦 ∈ 𝑋 ∧ 𝑃 ∈ 𝑋) ∧ (𝑟 ∈ ℝ ∧ ((𝑦𝑀𝑃) + 𝑟) ∈ ℝ ∧ (𝑦𝑀𝑃) ≤ (((𝑦𝑀𝑃) + 𝑟) − 𝑟))) → (𝑦(ball‘𝑀)𝑟) ⊆ (𝑃(ball‘𝑀)((𝑦𝑀𝑃) + 𝑟)))
53	40, 32, 33, 37, 38, 51, 52	syl33anc 1381	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (𝑦(ball‘𝑀)𝑟) ⊆ (𝑃(ball‘𝑀)((𝑦𝑀𝑃) + 𝑟)))
54	46, 53	sstrid 3977	. . . . . . . . . . 11 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → ((𝑦(ball‘𝑀)𝑟) ∩ 𝑌) ⊆ (𝑃(ball‘𝑀)((𝑦𝑀𝑃) + 𝑟)))
55	45, 54	eqsstrd 4004	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (𝑦(ball‘𝑁)𝑟) ⊆ (𝑃(ball‘𝑀)((𝑦𝑀𝑃) + 𝑟)))
56		oveq2 7163	. . . . . . . . . . . 12 ⊢ (𝑑 = ((𝑦𝑀𝑃) + 𝑟) → (𝑃(ball‘𝑀)𝑑) = (𝑃(ball‘𝑀)((𝑦𝑀𝑃) + 𝑟)))
57	56	sseq2d 3998	. . . . . . . . . . 11 ⊢ (𝑑 = ((𝑦𝑀𝑃) + 𝑟) → ((𝑦(ball‘𝑁)𝑟) ⊆ (𝑃(ball‘𝑀)𝑑) ↔ (𝑦(ball‘𝑁)𝑟) ⊆ (𝑃(ball‘𝑀)((𝑦𝑀𝑃) + 𝑟))))
58	57	rspcev 3622	. . . . . . . . . 10 ⊢ ((((𝑦𝑀𝑃) + 𝑟) ∈ ℝ ∧ (𝑦(ball‘𝑁)𝑟) ⊆ (𝑃(ball‘𝑀)((𝑦𝑀𝑃) + 𝑟))) → ∃𝑑 ∈ ℝ (𝑦(ball‘𝑁)𝑟) ⊆ (𝑃(ball‘𝑀)𝑑))
59	38, 55, 58	syl2anc 586	. . . . . . . . 9 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → ∃𝑑 ∈ ℝ (𝑦(ball‘𝑁)𝑟) ⊆ (𝑃(ball‘𝑀)𝑑))
60		sseq1 3991	. . . . . . . . . 10 ⊢ (𝑌 = (𝑦(ball‘𝑁)𝑟) → (𝑌 ⊆ (𝑃(ball‘𝑀)𝑑) ↔ (𝑦(ball‘𝑁)𝑟) ⊆ (𝑃(ball‘𝑀)𝑑)))
61	60	rexbidv 3297	. . . . . . . . 9 ⊢ (𝑌 = (𝑦(ball‘𝑁)𝑟) → (∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑) ↔ ∃𝑑 ∈ ℝ (𝑦(ball‘𝑁)𝑟) ⊆ (𝑃(ball‘𝑀)𝑑)))
62	59, 61	syl5ibrcom 249	. . . . . . . 8 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝑦 ∈ 𝑌 ∧ 𝑟 ∈ ℝ⁺)) → (𝑌 = (𝑦(ball‘𝑁)𝑟) → ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)))
63	62	rexlimdvva 3294	. . . . . . 7 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) → (∃𝑦 ∈ 𝑌 ∃𝑟 ∈ ℝ⁺ 𝑌 = (𝑦(ball‘𝑁)𝑟) → ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)))
64	63	expimpd 456	. . . . . 6 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) → ((𝑁 ∈ (∞Met‘𝑌) ∧ ∃𝑦 ∈ 𝑌 ∃𝑟 ∈ ℝ⁺ 𝑌 = (𝑦(ball‘𝑁)𝑟)) → ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)))
65	10, 64	syl5bi 244	. . . . 5 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) → ((𝑁 ∈ (Bnd‘𝑌) ∧ 𝑌 ≠ ∅) → ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)))
66	65	expdimp 455	. . . 4 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (Bnd‘𝑌)) → (𝑌 ≠ ∅ → ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)))
67	9, 66	pm2.61dne 3103	. . 3 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑁 ∈ (Bnd‘𝑌)) → ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))
68	67	ex 415	. 2 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) → (𝑁 ∈ (Bnd‘𝑌) → ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)))
69		simprr 771	. . . . . . 7 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑑 ∈ ℝ ∧ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))) → 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))
70		xpss12 5569	. . . . . . 7 ⊢ ((𝑌 ⊆ (𝑃(ball‘𝑀)𝑑) ∧ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)) → (𝑌 × 𝑌) ⊆ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑)))
71	69, 69, 70	syl2anc 586	. . . . . 6 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑑 ∈ ℝ ∧ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))) → (𝑌 × 𝑌) ⊆ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑)))
72	71	resabs1d 5883	. . . . 5 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑑 ∈ ℝ ∧ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))) → ((𝑀 ↾ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑))) ↾ (𝑌 × 𝑌)) = (𝑀 ↾ (𝑌 × 𝑌)))
73	72, 12	syl6eqr 2874	. . . 4 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑑 ∈ ℝ ∧ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))) → ((𝑀 ↾ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑))) ↾ (𝑌 × 𝑌)) = 𝑁)
74		blbnd 35064	. . . . . . . 8 ⊢ ((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑑 ∈ ℝ) → (𝑀 ↾ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑))) ∈ (Bnd‘(𝑃(ball‘𝑀)𝑑)))
75	39, 74	syl3an1 1159	. . . . . . 7 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑑 ∈ ℝ) → (𝑀 ↾ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑))) ∈ (Bnd‘(𝑃(ball‘𝑀)𝑑)))
76	75	3expa 1114	. . . . . 6 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑑 ∈ ℝ) → (𝑀 ↾ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑))) ∈ (Bnd‘(𝑃(ball‘𝑀)𝑑)))
77	76	adantrr 715	. . . . 5 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑑 ∈ ℝ ∧ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))) → (𝑀 ↾ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑))) ∈ (Bnd‘(𝑃(ball‘𝑀)𝑑)))
78		bndss 35063	. . . . 5 ⊢ (((𝑀 ↾ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑))) ∈ (Bnd‘(𝑃(ball‘𝑀)𝑑)) ∧ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)) → ((𝑀 ↾ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑))) ↾ (𝑌 × 𝑌)) ∈ (Bnd‘𝑌))
79	77, 69, 78	syl2anc 586	. . . 4 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑑 ∈ ℝ ∧ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))) → ((𝑀 ↾ ((𝑃(ball‘𝑀)𝑑) × (𝑃(ball‘𝑀)𝑑))) ↾ (𝑌 × 𝑌)) ∈ (Bnd‘𝑌))
80	73, 79	eqeltrrd 2914	. . 3 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑑 ∈ ℝ ∧ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑))) → 𝑁 ∈ (Bnd‘𝑌))
81	80	rexlimdvaa 3285	. 2 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) → (∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑) → 𝑁 ∈ (Bnd‘𝑌)))
82	68, 81	impbid 214	1 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝑃 ∈ 𝑋) → (𝑁 ∈ (Bnd‘𝑌) ↔ ∃𝑑 ∈ ℝ 𝑌 ⊆ (𝑃(ball‘𝑀)𝑑)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ≠ wne 3016 ∀wral 3138 ∃wrex 3139 ∩ cin 3934 ⊆ wss 3935 ∅c0 4290 class class class wbr 5065 × cxp 5552 dom cdm 5554 ↾ cres 5556 ‘cfv 6354 (class class class)co 7155 ℝcr 10535 0cc0 10536 + caddc 10539 ℝ^*cxr 10673 ≤ cle 10675 − cmin 10869 ℝ⁺crp 12388 ∞Metcxmet 20529 Metcmet 20530 ballcbl 20531 Bndcbnd 35044

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-cnex 10592 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 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 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4838 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-id 5459 df-po 5473 df-so 5474 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-1st 7688 df-2nd 7689 df-er 8288 df-ec 8290 df-map 8407 df-en 8509 df-dom 8510 df-sdom 8511 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 df-div 11297 df-2 11699 df-rp 12389 df-xneg 12506 df-xadd 12507 df-xmul 12508 df-psmet 20536 df-xmet 20537 df-met 20538 df-bl 20539 df-bnd 35056

This theorem is referenced by: prdsbnd2 35072 cntotbnd 35073

W3C validator