bndss - Mathbox for Jeff Madsen

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

Theorem bndss 37148

Description: A subset of a bounded metric space is bounded. (Contributed by Jeff Madsen, 2-Sep-2009.)

**Assertion**
Ref	Expression
bndss	⊢ ((𝑀 ∈ (Bnd‘𝑋) ∧ 𝑆 ⊆ 𝑋) → (𝑀 ↾ (𝑆 × 𝑆)) ∈ (Bnd‘𝑆))

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

Step	Hyp	Ref	Expression
1		metres2 24193	. . . 4 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) → (𝑀 ↾ (𝑆 × 𝑆)) ∈ (Met‘𝑆))
2	1	adantlr 712	. . 3 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋) → (𝑀 ↾ (𝑆 × 𝑆)) ∈ (Met‘𝑆))
3		ssel2 3970	. . . . . . . . . . . . 13 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ 𝑋)
4	3	ancoms 458	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑆 ⊆ 𝑋) → 𝑥 ∈ 𝑋)
5		oveq1 7409	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑥 → (𝑦(ball‘𝑀)𝑟) = (𝑥(ball‘𝑀)𝑟))
6	5	eqeq2d 2735	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑥 → (𝑋 = (𝑦(ball‘𝑀)𝑟) ↔ 𝑋 = (𝑥(ball‘𝑀)𝑟)))
7	6	rexbidv 3170	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑥 → (∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟) ↔ ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟)))
8	7	rspcva 3602	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑋 ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) → ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟))
9	4, 8	sylan 579	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑆 ⊆ 𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) → ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟))
10	9	adantlll 715	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) → ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟))
11		dfss 3959	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑆 ⊆ 𝑋 ↔ 𝑆 = (𝑆 ∩ 𝑋))
12	11	biimpi 215	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑆 ⊆ 𝑋 → 𝑆 = (𝑆 ∩ 𝑋))
13		incom 4194	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑆 ∩ 𝑋) = (𝑋 ∩ 𝑆)
14	12, 13	eqtrdi 2780	. . . . . . . . . . . . . . . . 17 ⊢ (𝑆 ⊆ 𝑋 → 𝑆 = (𝑋 ∩ 𝑆))
15		ineq1 4198	. . . . . . . . . . . . . . . . 17 ⊢ (𝑋 = (𝑥(ball‘𝑀)𝑟) → (𝑋 ∩ 𝑆) = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
16	14, 15	sylan9eq 2784	. . . . . . . . . . . . . . . 16 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → 𝑆 = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
17	16	adantll 711	. . . . . . . . . . . . . . 15 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → 𝑆 = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
18	17	adantlr 712	. . . . . . . . . . . . . 14 ⊢ (((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → 𝑆 = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
19		eqid 2724	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑀 ↾ (𝑆 × 𝑆)) = (𝑀 ↾ (𝑆 × 𝑆))
20	19	blssp 37118	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ (𝑥 ∈ 𝑆 ∧ 𝑟 ∈ ℝ⁺)) → (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟) = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
21	20	an4s 657	. . . . . . . . . . . . . . . 16 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ (𝑆 ⊆ 𝑋 ∧ 𝑟 ∈ ℝ⁺)) → (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟) = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
22	21	anassrs 467	. . . . . . . . . . . . . . 15 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑟 ∈ ℝ⁺) → (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟) = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
23	22	adantr 480	. . . . . . . . . . . . . 14 ⊢ (((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟) = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
24	18, 23	eqtr4d 2767	. . . . . . . . . . . . 13 ⊢ (((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
25	24	ex 412	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑟 ∈ ℝ⁺) → (𝑋 = (𝑥(ball‘𝑀)𝑟) → 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
26	25	reximdva 3160	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) → (∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
27	26	imp 406	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
28	10, 27	syldan 590	. . . . . . . . 9 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
29	28	an32s 649	. . . . . . . 8 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
30	29	ex 412	. . . . . . 7 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) → (𝑆 ⊆ 𝑋 → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
31	30	an32s 649	. . . . . 6 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑥 ∈ 𝑆) → (𝑆 ⊆ 𝑋 → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
32	31	imp 406	. . . . 5 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
33	32	an32s 649	. . . 4 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑆) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
34	33	ralrimiva 3138	. . 3 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋) → ∀𝑥 ∈ 𝑆 ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
35	2, 34	jca 511	. 2 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋) → ((𝑀 ↾ (𝑆 × 𝑆)) ∈ (Met‘𝑆) ∧ ∀𝑥 ∈ 𝑆 ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
36		isbnd 37142	. . 3 ⊢ (𝑀 ∈ (Bnd‘𝑋) ↔ (𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)))
37	36	anbi1i 623	. 2 ⊢ ((𝑀 ∈ (Bnd‘𝑋) ∧ 𝑆 ⊆ 𝑋) ↔ ((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋))
38		isbnd 37142	. 2 ⊢ ((𝑀 ↾ (𝑆 × 𝑆)) ∈ (Bnd‘𝑆) ↔ ((𝑀 ↾ (𝑆 × 𝑆)) ∈ (Met‘𝑆) ∧ ∀𝑥 ∈ 𝑆 ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
39	35, 37, 38	3imtr4i 292	1 ⊢ ((𝑀 ∈ (Bnd‘𝑋) ∧ 𝑆 ⊆ 𝑋) → (𝑀 ↾ (𝑆 × 𝑆)) ∈ (Bnd‘𝑆))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1533 ∈ wcel 2098 ∀wral 3053 ∃wrex 3062 ∩ cin 3940 ⊆ wss 3941 × cxp 5665 ↾ cres 5669 ‘cfv 6534 (class class class)co 7402 ℝ⁺crp 12972 Metcmet 21216 ballcbl 21217 Bndcbnd 37129

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-sep 5290 ax-nul 5297 ax-pow 5354 ax-pr 5418 ax-un 7719 ax-cnex 11163 ax-resscn 11164 ax-1cn 11165 ax-icn 11166 ax-addcl 11167 ax-mulcl 11169 ax-i2m1 11175

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-nel 3039 df-ral 3054 df-rex 3063 df-rab 3425 df-v 3468 df-sbc 3771 df-csb 3887 df-dif 3944 df-un 3946 df-in 3948 df-ss 3958 df-nul 4316 df-if 4522 df-pw 4597 df-sn 4622 df-pr 4624 df-op 4628 df-uni 4901 df-iun 4990 df-br 5140 df-opab 5202 df-mpt 5223 df-id 5565 df-xp 5673 df-rel 5674 df-cnv 5675 df-co 5676 df-dm 5677 df-rn 5678 df-res 5679 df-ima 5680 df-iota 6486 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-ov 7405 df-oprab 7406 df-mpo 7407 df-1st 7969 df-2nd 7970 df-er 8700 df-map 8819 df-en 8937 df-dom 8938 df-sdom 8939 df-pnf 11248 df-mnf 11249 df-xr 11250 df-rp 12973 df-xadd 13091 df-psmet 21222 df-xmet 21223 df-met 21224 df-bl 21225 df-bnd 37141

This theorem is referenced by: ssbnd 37150

W3C validator