metds0 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > metds0		Structured version Visualization version GIF version

Theorem metds0 24357

Description: If a point is in a set, its distance to the set is zero. (Contributed by Mario Carneiro, 14-Feb-2015.) (Revised by Mario Carneiro, 4-Sep-2015.)

**Hypothesis**
Ref	Expression
metdscn.f	⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ^*, < ))

**Assertion**
Ref	Expression
metds0	⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) → (𝐹‘𝐴) = 0)

Distinct variable groups: 𝑥,𝑦,𝐴 𝑥,𝐷,𝑦 𝑥,𝑆,𝑦 𝑥,𝑋,𝑦 Allowed substitution hints: 𝐹(𝑥,𝑦)

**Proof of Theorem metds0**
Step	Hyp	Ref	Expression
1		metdscn.f	. . . . . . . . . 10 ⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ^*, < ))
2	1	metdsf 24355	. . . . . . . . 9 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) → 𝐹:𝑋⟶(0[,]+∞))
3	2	3adant3 1132	. . . . . . . 8 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) → 𝐹:𝑋⟶(0[,]+∞))
4		ssel2 3976	. . . . . . . . 9 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) → 𝐴 ∈ 𝑋)
5	4	3adant1 1130	. . . . . . . 8 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) → 𝐴 ∈ 𝑋)
6	3, 5	ffvelcdmd 7084	. . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) → (𝐹‘𝐴) ∈ (0[,]+∞))
7		eliccxr 13408	. . . . . . 7 ⊢ ((𝐹‘𝐴) ∈ (0[,]+∞) → (𝐹‘𝐴) ∈ ℝ^*)
8	6, 7	syl 17	. . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) → (𝐹‘𝐴) ∈ ℝ^*)
9	8	xrleidd 13127	. . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) → (𝐹‘𝐴) ≤ (𝐹‘𝐴))
10		simp1 1136	. . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) → 𝐷 ∈ (∞Met‘𝑋))
11		simp2 1137	. . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) → 𝑆 ⊆ 𝑋)
12	1	metdsge 24356	. . . . . 6 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) ∈ ℝ^*) → ((𝐹‘𝐴) ≤ (𝐹‘𝐴) ↔ (𝑆 ∩ (𝐴(ball‘𝐷)(𝐹‘𝐴))) = ∅))
13	10, 11, 5, 8, 12	syl31anc 1373	. . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) → ((𝐹‘𝐴) ≤ (𝐹‘𝐴) ↔ (𝑆 ∩ (𝐴(ball‘𝐷)(𝐹‘𝐴))) = ∅))
14	9, 13	mpbid 231	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) → (𝑆 ∩ (𝐴(ball‘𝐷)(𝐹‘𝐴))) = ∅)
15		simpl3 1193	. . . . . . 7 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) ∧ 0 < (𝐹‘𝐴)) → 𝐴 ∈ 𝑆)
16	10	adantr 481	. . . . . . . 8 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) ∧ 0 < (𝐹‘𝐴)) → 𝐷 ∈ (∞Met‘𝑋))
17	5	adantr 481	. . . . . . . 8 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) ∧ 0 < (𝐹‘𝐴)) → 𝐴 ∈ 𝑋)
18	8	adantr 481	. . . . . . . 8 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) ∧ 0 < (𝐹‘𝐴)) → (𝐹‘𝐴) ∈ ℝ^*)
19		simpr 485	. . . . . . . 8 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) ∧ 0 < (𝐹‘𝐴)) → 0 < (𝐹‘𝐴))
20		xblcntr 23908	. . . . . . . 8 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ ((𝐹‘𝐴) ∈ ℝ^* ∧ 0 < (𝐹‘𝐴))) → 𝐴 ∈ (𝐴(ball‘𝐷)(𝐹‘𝐴)))
21	16, 17, 18, 19, 20	syl112anc 1374	. . . . . . 7 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) ∧ 0 < (𝐹‘𝐴)) → 𝐴 ∈ (𝐴(ball‘𝐷)(𝐹‘𝐴)))
22		inelcm 4463	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐴 ∈ (𝐴(ball‘𝐷)(𝐹‘𝐴))) → (𝑆 ∩ (𝐴(ball‘𝐷)(𝐹‘𝐴))) ≠ ∅)
23	15, 21, 22	syl2anc 584	. . . . . 6 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) ∧ 0 < (𝐹‘𝐴)) → (𝑆 ∩ (𝐴(ball‘𝐷)(𝐹‘𝐴))) ≠ ∅)
24	23	ex 413	. . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) → (0 < (𝐹‘𝐴) → (𝑆 ∩ (𝐴(ball‘𝐷)(𝐹‘𝐴))) ≠ ∅))
25	24	necon2bd 2956	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) → ((𝑆 ∩ (𝐴(ball‘𝐷)(𝐹‘𝐴))) = ∅ → ¬ 0 < (𝐹‘𝐴)))
26	14, 25	mpd 15	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) → ¬ 0 < (𝐹‘𝐴))
27		elxrge0 13430	. . . . . . 7 ⊢ ((𝐹‘𝐴) ∈ (0[,]+∞) ↔ ((𝐹‘𝐴) ∈ ℝ^* ∧ 0 ≤ (𝐹‘𝐴)))
28	27	simprbi 497	. . . . . 6 ⊢ ((𝐹‘𝐴) ∈ (0[,]+∞) → 0 ≤ (𝐹‘𝐴))
29	6, 28	syl 17	. . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) → 0 ≤ (𝐹‘𝐴))
30		0xr 11257	. . . . . 6 ⊢ 0 ∈ ℝ^*
31		xrleloe 13119	. . . . . 6 ⊢ ((0 ∈ ℝ^* ∧ (𝐹‘𝐴) ∈ ℝ^*) → (0 ≤ (𝐹‘𝐴) ↔ (0 < (𝐹‘𝐴) ∨ 0 = (𝐹‘𝐴))))
32	30, 8, 31	sylancr 587	. . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) → (0 ≤ (𝐹‘𝐴) ↔ (0 < (𝐹‘𝐴) ∨ 0 = (𝐹‘𝐴))))
33	29, 32	mpbid 231	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) → (0 < (𝐹‘𝐴) ∨ 0 = (𝐹‘𝐴)))
34	33	ord 862	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) → (¬ 0 < (𝐹‘𝐴) → 0 = (𝐹‘𝐴)))
35	26, 34	mpd 15	. 2 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) → 0 = (𝐹‘𝐴))
36	35	eqcomd 2738	1 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑆) → (𝐹‘𝐴) = 0)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∨ wo 845 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 ∩ cin 3946 ⊆ wss 3947 ∅c0 4321 class class class wbr 5147 ↦ cmpt 5230 ran crn 5676 ⟶wf 6536 ‘cfv 6540 (class class class)co 7405 infcinf 9432 0cc0 11106 +∞cpnf 11241 ℝ^*cxr 11243 < clt 11244 ≤ cle 11245 [,]cicc 13323 ∞Metcxmet 20921 ballcbl 20923

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 2703 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-id 5573 df-po 5587 df-so 5588 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-1st 7971 df-2nd 7972 df-er 8699 df-map 8818 df-en 8936 df-dom 8937 df-sdom 8938 df-sup 9433 df-inf 9434 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-div 11868 df-2 12271 df-rp 12971 df-xneg 13088 df-xadd 13089 df-xmul 13090 df-icc 13327 df-psmet 20928 df-xmet 20929 df-bl 20931

This theorem is referenced by: metdsle 24359 metnrmlem1 24366

W3C validator