| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > stdbdmet | Structured version Visualization version GIF version | ||
| Description: The standard bounded metric is a proper metric given an extended metric and a positive real cutoff. (Contributed by Mario Carneiro, 26-Aug-2015.) |
| Ref | Expression |
|---|---|
| stdbdmet.1 | ⊢ 𝐷 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅)) |
| Ref | Expression |
|---|---|
| stdbdmet | ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) → 𝐷 ∈ (Met‘𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rpxr 13017 | . . . 4 ⊢ (𝑅 ∈ ℝ+ → 𝑅 ∈ ℝ*) | |
| 2 | rpgt0 13020 | . . . 4 ⊢ (𝑅 ∈ ℝ+ → 0 < 𝑅) | |
| 3 | 1, 2 | jca 520 | . . 3 ⊢ (𝑅 ∈ ℝ+ → (𝑅 ∈ ℝ* ∧ 0 < 𝑅)) |
| 4 | stdbdmet.1 | . . . . 5 ⊢ 𝐷 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅)) | |
| 5 | 4 | stdbdxmet 24633 | . . . 4 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) → 𝐷 ∈ (∞Met‘𝑋)) |
| 6 | 5 | 3expb 1136 | . . 3 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ (𝑅 ∈ ℝ* ∧ 0 < 𝑅)) → 𝐷 ∈ (∞Met‘𝑋)) |
| 7 | 3, 6 | sylan2 604 | . 2 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) → 𝐷 ∈ (∞Met‘𝑋)) |
| 8 | xmetcl 24449 | . . . . . . . 8 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑥𝐶𝑦) ∈ ℝ*) | |
| 9 | 8 | 3expb 1136 | . . . . . . 7 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥𝐶𝑦) ∈ ℝ*) |
| 10 | 9 | adantlr 727 | . . . . . 6 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥𝐶𝑦) ∈ ℝ*) |
| 11 | 1 | ad2antlr 739 | . . . . . 6 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑅 ∈ ℝ*) |
| 12 | 10, 11 | ifcld 4530 | . . . . 5 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) ∈ ℝ*) |
| 13 | rpre 13016 | . . . . . 6 ⊢ (𝑅 ∈ ℝ+ → 𝑅 ∈ ℝ) | |
| 14 | 13 | ad2antlr 739 | . . . . 5 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑅 ∈ ℝ) |
| 15 | xmetge0 24462 | . . . . . . . 8 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → 0 ≤ (𝑥𝐶𝑦)) | |
| 16 | 15 | 3expb 1136 | . . . . . . 7 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 0 ≤ (𝑥𝐶𝑦)) |
| 17 | 16 | adantlr 727 | . . . . . 6 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 0 ≤ (𝑥𝐶𝑦)) |
| 18 | rpge0 13021 | . . . . . . 7 ⊢ (𝑅 ∈ ℝ+ → 0 ≤ 𝑅) | |
| 19 | 18 | ad2antlr 739 | . . . . . 6 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 0 ≤ 𝑅) |
| 20 | breq2 5109 | . . . . . . 7 ⊢ ((𝑥𝐶𝑦) = if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) → (0 ≤ (𝑥𝐶𝑦) ↔ 0 ≤ if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅))) | |
| 21 | breq2 5109 | . . . . . . 7 ⊢ (𝑅 = if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) → (0 ≤ 𝑅 ↔ 0 ≤ if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅))) | |
| 22 | 20, 21 | ifboth 4523 | . . . . . 6 ⊢ ((0 ≤ (𝑥𝐶𝑦) ∧ 0 ≤ 𝑅) → 0 ≤ if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅)) |
| 23 | 17, 19, 22 | syl2anc 595 | . . . . 5 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 0 ≤ if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅)) |
| 24 | xrmin2 13195 | . . . . . 6 ⊢ (((𝑥𝐶𝑦) ∈ ℝ* ∧ 𝑅 ∈ ℝ*) → if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) ≤ 𝑅) | |
| 25 | 10, 11, 24 | syl2anc 595 | . . . . 5 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) ≤ 𝑅) |
| 26 | xrrege0 13191 | . . . . 5 ⊢ (((if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) ∈ ℝ* ∧ 𝑅 ∈ ℝ) ∧ (0 ≤ if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) ∧ if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) ≤ 𝑅)) → if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) ∈ ℝ) | |
| 27 | 12, 14, 23, 25, 26 | syl22anc 851 | . . . 4 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) ∈ ℝ) |
| 28 | 27 | ralrimivva 3208 | . . 3 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) ∈ ℝ) |
| 29 | 4 | fmpo 8053 | . . 3 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) ∈ ℝ ↔ 𝐷:(𝑋 × 𝑋)⟶ℝ) |
| 30 | 28, 29 | sylib 221 | . 2 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) → 𝐷:(𝑋 × 𝑋)⟶ℝ) |
| 31 | ismet2 24451 | . 2 ⊢ (𝐷 ∈ (Met‘𝑋) ↔ (𝐷 ∈ (∞Met‘𝑋) ∧ 𝐷:(𝑋 × 𝑋)⟶ℝ)) | |
| 32 | 7, 30, 31 | sylanbrc 594 | 1 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) → 𝐷 ∈ (Met‘𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1563 ∈ wcel 2145 ∀wral 3079 ifcif 4483 class class class wbr 5105 × cxp 5650 ⟶wf 6521 ‘cfv 6525 (class class class)co 7400 ∈ cmpo 7402 ℝcr 11087 0cc0 11088 ℝ*cxr 11230 < clt 11231 ≤ cle 11232 ℝ+crp 13007 ∞Metcxmet 21467 Metcmet 21468 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-er 8682 df-map 8814 df-en 8932 df-dom 8933 df-sdom 8934 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-div 11860 df-nn 12225 df-2 12294 df-rp 13008 df-xneg 13128 df-xadd 13129 df-xmul 13130 df-icc 13370 df-xmet 21475 df-met 21476 |
| This theorem is referenced by: mopnex 24637 xlebnum 25085 |
| Copyright terms: Public domain | W3C validator |