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 36459

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 23798	. . . 4 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) → (𝑀 ↾ (𝑆 × 𝑆)) ∈ (Met‘𝑆))
2	1	adantlr 713	. . 3 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋) → (𝑀 ↾ (𝑆 × 𝑆)) ∈ (Met‘𝑆))
3		ssel2 3973	. . . . . . . . . . . . 13 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ 𝑋)
4	3	ancoms 459	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑆 ⊆ 𝑋) → 𝑥 ∈ 𝑋)
5		oveq1 7400	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑥 → (𝑦(ball‘𝑀)𝑟) = (𝑥(ball‘𝑀)𝑟))
6	5	eqeq2d 2742	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑥 → (𝑋 = (𝑦(ball‘𝑀)𝑟) ↔ 𝑋 = (𝑥(ball‘𝑀)𝑟)))
7	6	rexbidv 3177	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑥 → (∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟) ↔ ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟)))
8	7	rspcva 3607	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑋 ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) → ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟))
9	4, 8	sylan 580	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑆 ⊆ 𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) → ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟))
10	9	adantlll 716	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) → ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟))
11		dfss 3962	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑆 ⊆ 𝑋 ↔ 𝑆 = (𝑆 ∩ 𝑋))
12	11	biimpi 215	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑆 ⊆ 𝑋 → 𝑆 = (𝑆 ∩ 𝑋))
13		incom 4197	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑆 ∩ 𝑋) = (𝑋 ∩ 𝑆)
14	12, 13	eqtrdi 2787	. . . . . . . . . . . . . . . . 17 ⊢ (𝑆 ⊆ 𝑋 → 𝑆 = (𝑋 ∩ 𝑆))
15		ineq1 4201	. . . . . . . . . . . . . . . . 17 ⊢ (𝑋 = (𝑥(ball‘𝑀)𝑟) → (𝑋 ∩ 𝑆) = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
16	14, 15	sylan9eq 2791	. . . . . . . . . . . . . . . 16 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → 𝑆 = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
17	16	adantll 712	. . . . . . . . . . . . . . 15 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → 𝑆 = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
18	17	adantlr 713	. . . . . . . . . . . . . 14 ⊢ (((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → 𝑆 = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
19		eqid 2731	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑀 ↾ (𝑆 × 𝑆)) = (𝑀 ↾ (𝑆 × 𝑆))
20	19	blssp 36429	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ (𝑥 ∈ 𝑆 ∧ 𝑟 ∈ ℝ⁺)) → (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟) = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
21	20	an4s 658	. . . . . . . . . . . . . . . 16 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ (𝑆 ⊆ 𝑋 ∧ 𝑟 ∈ ℝ⁺)) → (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟) = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
22	21	anassrs 468	. . . . . . . . . . . . . . 15 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑟 ∈ ℝ⁺) → (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟) = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
23	22	adantr 481	. . . . . . . . . . . . . 14 ⊢ (((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟) = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
24	18, 23	eqtr4d 2774	. . . . . . . . . . . . 13 ⊢ (((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
25	24	ex 413	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑟 ∈ ℝ⁺) → (𝑋 = (𝑥(ball‘𝑀)𝑟) → 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
26	25	reximdva 3167	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) → (∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
27	26	imp 407	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
28	10, 27	syldan 591	. . . . . . . . 9 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
29	28	an32s 650	. . . . . . . 8 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
30	29	ex 413	. . . . . . 7 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) → (𝑆 ⊆ 𝑋 → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
31	30	an32s 650	. . . . . 6 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑥 ∈ 𝑆) → (𝑆 ⊆ 𝑋 → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
32	31	imp 407	. . . . 5 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
33	32	an32s 650	. . . 4 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑆) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
34	33	ralrimiva 3145	. . 3 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋) → ∀𝑥 ∈ 𝑆 ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
35	2, 34	jca 512	. 2 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋) → ((𝑀 ↾ (𝑆 × 𝑆)) ∈ (Met‘𝑆) ∧ ∀𝑥 ∈ 𝑆 ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
36		isbnd 36453	. . 3 ⊢ (𝑀 ∈ (Bnd‘𝑋) ↔ (𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)))
37	36	anbi1i 624	. 2 ⊢ ((𝑀 ∈ (Bnd‘𝑋) ∧ 𝑆 ⊆ 𝑋) ↔ ((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋))
38		isbnd 36453	. 2 ⊢ ((𝑀 ↾ (𝑆 × 𝑆)) ∈ (Bnd‘𝑆) ↔ ((𝑀 ↾ (𝑆 × 𝑆)) ∈ (Met‘𝑆) ∧ ∀𝑥 ∈ 𝑆 ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
39	35, 37, 38	3imtr4i 291	1 ⊢ ((𝑀 ∈ (Bnd‘𝑋) ∧ 𝑆 ⊆ 𝑋) → (𝑀 ↾ (𝑆 × 𝑆)) ∈ (Bnd‘𝑆))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∀wral 3060 ∃wrex 3069 ∩ cin 3943 ⊆ wss 3944 × cxp 5667 ↾ cres 5671 ‘cfv 6532 (class class class)co 7393 ℝ⁺crp 12956 Metcmet 20864 ballcbl 20865 Bndcbnd 36440

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2702 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7708 ax-cnex 11148 ax-resscn 11149 ax-1cn 11150 ax-icn 11151 ax-addcl 11152 ax-mulcl 11154 ax-i2m1 11160

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rab 3432 df-v 3475 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4319 df-if 4523 df-pw 4598 df-sn 4623 df-pr 4625 df-op 4629 df-uni 4902 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-id 5567 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-iota 6484 df-fun 6534 df-fn 6535 df-f 6536 df-f1 6537 df-fo 6538 df-f1o 6539 df-fv 6540 df-ov 7396 df-oprab 7397 df-mpo 7398 df-1st 7957 df-2nd 7958 df-er 8686 df-map 8805 df-en 8923 df-dom 8924 df-sdom 8925 df-pnf 11232 df-mnf 11233 df-xr 11234 df-rp 12957 df-xadd 13075 df-psmet 20870 df-xmet 20871 df-met 20872 df-bl 20873 df-bnd 36452

This theorem is referenced by: ssbnd 36461

W3C validator