| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > metdsf | Structured version Visualization version GIF version | ||
| Description: The distance from a point to a set is a nonnegative extended real number. (Contributed by Mario Carneiro, 14-Feb-2015.) (Revised by Mario Carneiro, 4-Sep-2015.) (Proof shortened by AV, 30-Sep-2020.) |
| Ref | Expression |
|---|---|
| metdscn.f | ⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ*, < )) |
| Ref | Expression |
|---|---|
| metdsf | ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) → 𝐹:𝑋⟶(0[,]+∞)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simplll 774 | . . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑆) → 𝐷 ∈ (∞Met‘𝑋)) | |
| 2 | simplr 768 | . . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑆) → 𝑥 ∈ 𝑋) | |
| 3 | simplr 768 | . . . . . . . 8 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑋) → 𝑆 ⊆ 𝑋) | |
| 4 | 3 | sselda 3933 | . . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑆) → 𝑦 ∈ 𝑋) |
| 5 | xmetcl 24275 | . . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑥𝐷𝑦) ∈ ℝ*) | |
| 6 | 1, 2, 4, 5 | syl3anc 1373 | . . . . . 6 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑆) → (𝑥𝐷𝑦) ∈ ℝ*) |
| 7 | eqid 2736 | . . . . . 6 ⊢ (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)) = (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)) | |
| 8 | 6, 7 | fmptd 7059 | . . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑋) → (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)):𝑆⟶ℝ*) |
| 9 | 8 | frnd 6670 | . . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑋) → ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)) ⊆ ℝ*) |
| 10 | infxrcl 13249 | . . . 4 ⊢ (ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)) ⊆ ℝ* → inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ*, < ) ∈ ℝ*) | |
| 11 | 9, 10 | syl 17 | . . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑋) → inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ*, < ) ∈ ℝ*) |
| 12 | xmetge0 24288 | . . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → 0 ≤ (𝑥𝐷𝑦)) | |
| 13 | 1, 2, 4, 12 | syl3anc 1373 | . . . . . 6 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑆) → 0 ≤ (𝑥𝐷𝑦)) |
| 14 | 13 | ralrimiva 3128 | . . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑋) → ∀𝑦 ∈ 𝑆 0 ≤ (𝑥𝐷𝑦)) |
| 15 | ovex 7391 | . . . . . . 7 ⊢ (𝑥𝐷𝑦) ∈ V | |
| 16 | 15 | rgenw 3055 | . . . . . 6 ⊢ ∀𝑦 ∈ 𝑆 (𝑥𝐷𝑦) ∈ V |
| 17 | breq2 5102 | . . . . . . 7 ⊢ (𝑧 = (𝑥𝐷𝑦) → (0 ≤ 𝑧 ↔ 0 ≤ (𝑥𝐷𝑦))) | |
| 18 | 7, 17 | ralrnmptw 7039 | . . . . . 6 ⊢ (∀𝑦 ∈ 𝑆 (𝑥𝐷𝑦) ∈ V → (∀𝑧 ∈ ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦))0 ≤ 𝑧 ↔ ∀𝑦 ∈ 𝑆 0 ≤ (𝑥𝐷𝑦))) |
| 19 | 16, 18 | ax-mp 5 | . . . . 5 ⊢ (∀𝑧 ∈ ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦))0 ≤ 𝑧 ↔ ∀𝑦 ∈ 𝑆 0 ≤ (𝑥𝐷𝑦)) |
| 20 | 14, 19 | sylibr 234 | . . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑋) → ∀𝑧 ∈ ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦))0 ≤ 𝑧) |
| 21 | 0xr 11179 | . . . . 5 ⊢ 0 ∈ ℝ* | |
| 22 | infxrgelb 13251 | . . . . 5 ⊢ ((ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)) ⊆ ℝ* ∧ 0 ∈ ℝ*) → (0 ≤ inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ*, < ) ↔ ∀𝑧 ∈ ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦))0 ≤ 𝑧)) | |
| 23 | 9, 21, 22 | sylancl 586 | . . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑋) → (0 ≤ inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ*, < ) ↔ ∀𝑧 ∈ ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦))0 ≤ 𝑧)) |
| 24 | 20, 23 | mpbird 257 | . . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑋) → 0 ≤ inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ*, < )) |
| 25 | elxrge0 13373 | . . 3 ⊢ (inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ*, < ) ∈ (0[,]+∞) ↔ (inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ*, < ) ∈ ℝ* ∧ 0 ≤ inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ*, < ))) | |
| 26 | 11, 24, 25 | sylanbrc 583 | . 2 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑋) → inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ*, < ) ∈ (0[,]+∞)) |
| 27 | metdscn.f | . 2 ⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ*, < )) | |
| 28 | 26, 27 | fmptd 7059 | 1 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) → 𝐹:𝑋⟶(0[,]+∞)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∀wral 3051 Vcvv 3440 ⊆ wss 3901 class class class wbr 5098 ↦ cmpt 5179 ran crn 5625 ⟶wf 6488 ‘cfv 6492 (class class class)co 7358 infcinf 9344 0cc0 11026 +∞cpnf 11163 ℝ*cxr 11165 < clt 11166 ≤ cle 11167 [,]cicc 13264 ∞Metcxmet 21294 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-pre-sup 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-po 5532 df-so 5533 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-1st 7933 df-2nd 7934 df-er 8635 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-sup 9345 df-inf 9346 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-div 11795 df-2 12208 df-rp 12906 df-xneg 13026 df-xadd 13027 df-xmul 13028 df-icc 13268 df-xmet 21302 |
| This theorem is referenced by: metds0 24795 metdstri 24796 metdsre 24798 metdseq0 24799 metdscnlem 24800 metdscn 24801 metnrmlem1a 24803 metnrmlem1 24804 lebnumlem1 24916 |
| Copyright terms: Public domain | W3C validator |