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 35068

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 22976	. . . 4 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) → (𝑀 ↾ (𝑆 × 𝑆)) ∈ (Met‘𝑆))
2	1	adantlr 713	. . 3 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋) → (𝑀 ↾ (𝑆 × 𝑆)) ∈ (Met‘𝑆))
3		ssel2 3965	. . . . . . . . . . . . 13 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ 𝑋)
4	3	ancoms 461	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑆 ⊆ 𝑋) → 𝑥 ∈ 𝑋)
5		oveq1 7166	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑥 → (𝑦(ball‘𝑀)𝑟) = (𝑥(ball‘𝑀)𝑟))
6	5	eqeq2d 2835	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑥 → (𝑋 = (𝑦(ball‘𝑀)𝑟) ↔ 𝑋 = (𝑥(ball‘𝑀)𝑟)))
7	6	rexbidv 3300	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑥 → (∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟) ↔ ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟)))
8	7	rspcva 3624	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑋 ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) → ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟))
9	4, 8	sylan 582	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑆 ⊆ 𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) → ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟))
10	9	adantlll 716	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) → ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟))
11		dfss 3956	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑆 ⊆ 𝑋 ↔ 𝑆 = (𝑆 ∩ 𝑋))
12	11	biimpi 218	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑆 ⊆ 𝑋 → 𝑆 = (𝑆 ∩ 𝑋))
13		incom 4181	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑆 ∩ 𝑋) = (𝑋 ∩ 𝑆)
14	12, 13	syl6eq 2875	. . . . . . . . . . . . . . . . 17 ⊢ (𝑆 ⊆ 𝑋 → 𝑆 = (𝑋 ∩ 𝑆))
15		ineq1 4184	. . . . . . . . . . . . . . . . 17 ⊢ (𝑋 = (𝑥(ball‘𝑀)𝑟) → (𝑋 ∩ 𝑆) = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
16	14, 15	sylan9eq 2879	. . . . . . . . . . . . . . . 16 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → 𝑆 = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
17	16	adantll 712	. . . . . . . . . . . . . . 15 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → 𝑆 = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
18	17	adantlr 713	. . . . . . . . . . . . . 14 ⊢ (((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → 𝑆 = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
19		eqid 2824	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑀 ↾ (𝑆 × 𝑆)) = (𝑀 ↾ (𝑆 × 𝑆))
20	19	blssp 35035	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ (𝑥 ∈ 𝑆 ∧ 𝑟 ∈ ℝ⁺)) → (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟) = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
21	20	an4s 658	. . . . . . . . . . . . . . . 16 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ (𝑆 ⊆ 𝑋 ∧ 𝑟 ∈ ℝ⁺)) → (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟) = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
22	21	anassrs 470	. . . . . . . . . . . . . . 15 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑟 ∈ ℝ⁺) → (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟) = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
23	22	adantr 483	. . . . . . . . . . . . . 14 ⊢ (((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟) = ((𝑥(ball‘𝑀)𝑟) ∩ 𝑆))
24	18, 23	eqtr4d 2862	. . . . . . . . . . . . 13 ⊢ (((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
25	24	ex 415	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑟 ∈ ℝ⁺) → (𝑋 = (𝑥(ball‘𝑀)𝑟) → 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
26	25	reximdva 3277	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) → (∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
27	26	imp 409	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑥(ball‘𝑀)𝑟)) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
28	10, 27	syldan 593	. . . . . . . . 9 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
29	28	an32s 650	. . . . . . . 8 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
30	29	ex 415	. . . . . . 7 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ 𝑥 ∈ 𝑆) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) → (𝑆 ⊆ 𝑋 → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
31	30	an32s 650	. . . . . 6 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑥 ∈ 𝑆) → (𝑆 ⊆ 𝑋 → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
32	31	imp 409	. . . . 5 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑥 ∈ 𝑆) ∧ 𝑆 ⊆ 𝑋) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
33	32	an32s 650	. . . 4 ⊢ ((((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑆) → ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
34	33	ralrimiva 3185	. . 3 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋) → ∀𝑥 ∈ 𝑆 ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟))
35	2, 34	jca 514	. 2 ⊢ (((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋) → ((𝑀 ↾ (𝑆 × 𝑆)) ∈ (Met‘𝑆) ∧ ∀𝑥 ∈ 𝑆 ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
36		isbnd 35062	. . 3 ⊢ (𝑀 ∈ (Bnd‘𝑋) ↔ (𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)))
37	36	anbi1i 625	. 2 ⊢ ((𝑀 ∈ (Bnd‘𝑋) ∧ 𝑆 ⊆ 𝑋) ↔ ((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑦 ∈ 𝑋 ∃𝑟 ∈ ℝ⁺ 𝑋 = (𝑦(ball‘𝑀)𝑟)) ∧ 𝑆 ⊆ 𝑋))
38		isbnd 35062	. 2 ⊢ ((𝑀 ↾ (𝑆 × 𝑆)) ∈ (Bnd‘𝑆) ↔ ((𝑀 ↾ (𝑆 × 𝑆)) ∈ (Met‘𝑆) ∧ ∀𝑥 ∈ 𝑆 ∃𝑟 ∈ ℝ⁺ 𝑆 = (𝑥(ball‘(𝑀 ↾ (𝑆 × 𝑆)))𝑟)))
39	35, 37, 38	3imtr4i 294	1 ⊢ ((𝑀 ∈ (Bnd‘𝑋) ∧ 𝑆 ⊆ 𝑋) → (𝑀 ↾ (𝑆 × 𝑆)) ∈ (Bnd‘𝑆))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 398 = wceq 1536 ∈ wcel 2113 ∀wral 3141 ∃wrex 3142 ∩ cin 3938 ⊆ wss 3939 × cxp 5556 ↾ cres 5560 ‘cfv 6358 (class class class)co 7159 ℝ⁺crp 12392 Metcmet 20534 ballcbl 20535 Bndcbnd 35049

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-cnex 10596 ax-resscn 10597 ax-1cn 10598 ax-icn 10599 ax-addcl 10600 ax-mulcl 10602 ax-i2m1 10608

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-id 5463 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-ov 7162 df-oprab 7163 df-mpo 7164 df-1st 7692 df-2nd 7693 df-er 8292 df-map 8411 df-en 8513 df-dom 8514 df-sdom 8515 df-pnf 10680 df-mnf 10681 df-xr 10682 df-rp 12393 df-xadd 12511 df-psmet 20540 df-xmet 20541 df-met 20542 df-bl 20543 df-bnd 35061

This theorem is referenced by: ssbnd 35070

W3C validator