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 36654

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 23869	. . . 4 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) → (𝑀 ↾ (𝑆 × 𝑆)) ∈ (Met‘𝑆))
2	1	adantlr 714	. . 3 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋) → (𝑀 ↾ (𝑆 × 𝑆)) ∈ (Met‘𝑆))
3		ssel2 3978	. . . . . . . . . . . . 13 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ 𝑋)
4	3	ancoms 460	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑆 ⊆ 𝑋) → 𝑥 ∈ 𝑋)
5		oveq1 7416	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑥 → (𝑦(ball‘𝑀)𝑟) = (𝑥(ball‘𝑀)𝑟))
6	5	eqeq2d 2744	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑥 → (𝑋 = (𝑦(ball‘𝑀)𝑟) ↔ 𝑋 = (𝑥(ball‘𝑀)𝑟)))
7	6	rexbidv 3179	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑥 → (∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟) ↔ ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟)))
8	7	rspcva 3611	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑋 ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) → ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟))
9	4, 8	sylan 581	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑆 ⊆ 𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) → ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟))
10	9	adantlll 717	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) → ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟))
11		dfss 3967	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑆 ⊆ 𝑋 ↔ 𝑆 = (𝑆 ∩ 𝑋))
12	11	biimpi 215	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑆 ⊆ 𝑋 → 𝑆 = (𝑆 ∩ 𝑋))
13		incom 4202	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑆 ∩ 𝑋) = (𝑋 ∩ 𝑆)
14	12, 13	eqtrdi 2789	. . . . . . . . . . . . . . . . 17 ⊢ (𝑆 ⊆ 𝑋 → 𝑆 = (𝑋 ∩ 𝑆))
15		ineq1 4206	. . . . . . . . . . . . . . . . 17 ⊢ (𝑋 = (𝑥(ball‘𝑀)𝑟) → (𝑋 ∩ 𝑆) = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
16	14, 15	sylan9eq 2793	. . . . . . . . . . . . . . . 16 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → 𝑆 = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
17	16	adantll 713	. . . . . . . . . . . . . . 15 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → 𝑆 = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
18	17	adantlr 714	. . . . . . . . . . . . . 14 ⊢ (((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → 𝑆 = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
19		eqid 2733	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑀 ↾ (𝑆 × 𝑆)) = (𝑀 ↾ (𝑆 × 𝑆))
20	19	blssp 36624	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ (𝑥 ∈ 𝑆 ∧ 𝑟 ∈ ℝ⁺)) → (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟) = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
21	20	an4s 659	. . . . . . . . . . . . . . . 16 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ (𝑆 ⊆ 𝑋 ∧ 𝑟 ∈ ℝ⁺)) → (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟) = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
22	21	anassrs 469	. . . . . . . . . . . . . . 15 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑟 ∈ ℝ⁺) → (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟) = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
23	22	adantr 482	. . . . . . . . . . . . . 14 ⊢ (((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟) = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
24	18, 23	eqtr4d 2776	. . . . . . . . . . . . 13 ⊢ (((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
25	24	ex 414	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑟 ∈ ℝ⁺) → (𝑋 = (𝑥(ball‘𝑀)𝑟) → 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
26	25	reximdva 3169	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) → (∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
27	26	imp 408	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
28	10, 27	syldan 592	. . . . . . . . 9 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
29	28	an32s 651	. . . . . . . 8 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
30	29	ex 414	. . . . . . 7 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) → (𝑆 ⊆ 𝑋 → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
31	30	an32s 651	. . . . . 6 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑥 ∈ 𝑆) → (𝑆 ⊆ 𝑋 → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
32	31	imp 408	. . . . 5 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
33	32	an32s 651	. . . 4 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑆) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
34	33	ralrimiva 3147	. . 3 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋) → ∀𝑥 ∈ 𝑆 ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
35	2, 34	jca 513	. 2 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋) → ((𝑀 ↾ (𝑆 × 𝑆)) ∈ (Met‘𝑆) ∧ ∀𝑥 ∈ 𝑆 ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
36		isbnd 36648	. . 3 ⊢ (𝑀 ∈ (Bnd‘𝑋) ↔ (𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)))
37	36	anbi1i 625	. 2 ⊢ ((𝑀 ∈ (Bnd‘𝑋) ∧ 𝑆 ⊆ 𝑋) ↔ ((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋))
38		isbnd 36648	. 2 ⊢ ((𝑀 ↾ (𝑆 × 𝑆)) ∈ (Bnd‘𝑆) ↔ ((𝑀 ↾ (𝑆 × 𝑆)) ∈ (Met‘𝑆) ∧ ∀𝑥 ∈ 𝑆 ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
39	35, 37, 38	3imtr4i 292	1 ⊢ ((𝑀 ∈ (Bnd‘𝑋) ∧ 𝑆 ⊆ 𝑋) → (𝑀 ↾ (𝑆 × 𝑆)) ∈ (Bnd‘𝑆))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∀wral 3062 ∃wrex 3071 ∩ cin 3948 ⊆ wss 3949 × cxp 5675 ↾ cres 5679 ‘cfv 6544 (class class class)co 7409 ℝ⁺crp 12974 Metcmet 20930 ballcbl 20931 Bndcbnd 36635

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 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-mulcl 11172 ax-i2m1 11178

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-id 5575 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-ov 7412 df-oprab 7413 df-mpo 7414 df-1st 7975 df-2nd 7976 df-er 8703 df-map 8822 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11250 df-mnf 11251 df-xr 11252 df-rp 12975 df-xadd 13093 df-psmet 20936 df-xmet 20937 df-met 20938 df-bl 20939 df-bnd 36647

This theorem is referenced by: ssbnd 36656

W3C validator