| 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 3937 | . . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑆) → 𝑦 ∈ 𝑋) |
| 5 | xmetcl 24235 | . . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑥𝐷𝑦) ∈ ℝ*) | |
| 6 | 1, 2, 4, 5 | syl3anc 1373 | . . . . . 6 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑆) → (𝑥𝐷𝑦) ∈ ℝ*) |
| 7 | eqid 2729 | . . . . . 6 ⊢ (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)) = (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)) | |
| 8 | 6, 7 | fmptd 7052 | . . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑋) → (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)):𝑆⟶ℝ*) |
| 9 | 8 | frnd 6664 | . . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑋) → ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)) ⊆ ℝ*) |
| 10 | infxrcl 13254 | . . . 4 ⊢ (ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)) ⊆ ℝ* → inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ*, < ) ∈ ℝ*) | |
| 11 | 9, 10 | syl 17 | . . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑋) → inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ*, < ) ∈ ℝ*) |
| 12 | xmetge0 24248 | . . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → 0 ≤ (𝑥𝐷𝑦)) | |
| 13 | 1, 2, 4, 12 | syl3anc 1373 | . . . . . 6 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑆) → 0 ≤ (𝑥𝐷𝑦)) |
| 14 | 13 | ralrimiva 3121 | . . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝑋) → ∀𝑦 ∈ 𝑆 0 ≤ (𝑥𝐷𝑦)) |
| 15 | ovex 7386 | . . . . . . 7 ⊢ (𝑥𝐷𝑦) ∈ V | |
| 16 | 15 | rgenw 3048 | . . . . . 6 ⊢ ∀𝑦 ∈ 𝑆 (𝑥𝐷𝑦) ∈ V |
| 17 | breq2 5099 | . . . . . . 7 ⊢ (𝑧 = (𝑥𝐷𝑦) → (0 ≤ 𝑧 ↔ 0 ≤ (𝑥𝐷𝑦))) | |
| 18 | 7, 17 | ralrnmptw 7032 | . . . . . 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 11181 | . . . . 5 ⊢ 0 ∈ ℝ* | |
| 22 | infxrgelb 13256 | . . . . 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 13378 | . . 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 7052 | 1 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) → 𝐹:𝑋⟶(0[,]+∞)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∀wral 3044 Vcvv 3438 ⊆ wss 3905 class class class wbr 5095 ↦ cmpt 5176 ran crn 5624 ⟶wf 6482 ‘cfv 6486 (class class class)co 7353 infcinf 9350 0cc0 11028 +∞cpnf 11165 ℝ*cxr 11167 < clt 11168 ≤ cle 11169 [,]cicc 13269 ∞Metcxmet 21264 |
| 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 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7675 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 ax-pre-sup 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3345 df-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-iun 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5518 df-po 5531 df-so 5532 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7310 df-ov 7356 df-oprab 7357 df-mpo 7358 df-1st 7931 df-2nd 7932 df-er 8632 df-map 8762 df-en 8880 df-dom 8881 df-sdom 8882 df-sup 9351 df-inf 9352 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11367 df-neg 11368 df-div 11796 df-2 12209 df-rp 12912 df-xneg 13032 df-xadd 13033 df-xmul 13034 df-icc 13273 df-xmet 21272 |
| This theorem is referenced by: metds0 24755 metdstri 24756 metdsre 24758 metdseq0 24759 metdscnlem 24760 metdscn 24761 metnrmlem1a 24763 metnrmlem1 24764 lebnumlem1 24876 |
| Copyright terms: Public domain | W3C validator |