| 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 13134 | . . . 4 ⊢ (𝑅 ∈ ℝ+ → 𝑅 ∈ ℝ*) | |
| 2 | rpgt0 13137 | . . . 4 ⊢ (𝑅 ∈ ℝ+ → 0 < 𝑅) | |
| 3 | 1, 2 | jca 521 | . . 3 ⊢ (𝑅 ∈ ℝ+ → (𝑅 ∈ ℝ* ∧ 0 < 𝑅)) |
| 4 | stdbdmet.1 | . . . . 5 ⊢ 𝐷 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅)) | |
| 5 | 4 | stdbdxmet 24840 | . . . 4 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) → 𝐷 ∈ (∞Met‘𝑋)) |
| 6 | 5 | 3expb 1138 | . . 3 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ (𝑅 ∈ ℝ* ∧ 0 < 𝑅)) → 𝐷 ∈ (∞Met‘𝑋)) |
| 7 | 3, 6 | sylan2 605 | . 2 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) → 𝐷 ∈ (∞Met‘𝑋)) |
| 8 | xmetcl 24656 | . . . . . . . 8 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑥𝐶𝑦) ∈ ℝ*) | |
| 9 | 8 | 3expb 1138 | . . . . . . 7 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥𝐶𝑦) ∈ ℝ*) |
| 10 | 9 | adantlr 728 | . . . . . 6 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥𝐶𝑦) ∈ ℝ*) |
| 11 | 1 | ad2antlr 740 | . . . . . 6 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑅 ∈ ℝ*) |
| 12 | 10, 11 | ifcld 4528 | . . . . 5 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) ∈ ℝ*) |
| 13 | rpre 13133 | . . . . . 6 ⊢ (𝑅 ∈ ℝ+ → 𝑅 ∈ ℝ) | |
| 14 | 13 | ad2antlr 740 | . . . . 5 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑅 ∈ ℝ) |
| 15 | xmetge0 24669 | . . . . . . . 8 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → 0 ≤ (𝑥𝐶𝑦)) | |
| 16 | 15 | 3expb 1138 | . . . . . . 7 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 0 ≤ (𝑥𝐶𝑦)) |
| 17 | 16 | adantlr 728 | . . . . . 6 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 0 ≤ (𝑥𝐶𝑦)) |
| 18 | rpge0 13138 | . . . . . . 7 ⊢ (𝑅 ∈ ℝ+ → 0 ≤ 𝑅) | |
| 19 | 18 | ad2antlr 740 | . . . . . 6 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 0 ≤ 𝑅) |
| 20 | breq2 5106 | . . . . . . 7 ⊢ ((𝑥𝐶𝑦) = if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) → (0 ≤ (𝑥𝐶𝑦) ↔ 0 ≤ if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅))) | |
| 21 | breq2 5106 | . . . . . . 7 ⊢ (𝑅 = if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) → (0 ≤ 𝑅 ↔ 0 ≤ if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅))) | |
| 22 | 20, 21 | ifboth 4521 | . . . . . 6 ⊢ ((0 ≤ (𝑥𝐶𝑦) ∧ 0 ≤ 𝑅) → 0 ≤ if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅)) |
| 23 | 17, 19, 22 | syl2anc 596 | . . . . 5 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 0 ≤ if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅)) |
| 24 | xrmin2 13312 | . . . . . 6 ⊢ (((𝑥𝐶𝑦) ∈ ℝ* ∧ 𝑅 ∈ ℝ*) → if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) ≤ 𝑅) | |
| 25 | 10, 11, 24 | syl2anc 596 | . . . . 5 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) ≤ 𝑅) |
| 26 | xrrege0 13308 | . . . . 5 ⊢ (((if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) ∈ ℝ* ∧ 𝑅 ∈ ℝ) ∧ (0 ≤ if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) ∧ if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) ≤ 𝑅)) → if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) ∈ ℝ) | |
| 27 | 12, 14, 23, 25, 26 | syl22anc 852 | . . . 4 ⊢ (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) ∈ ℝ) |
| 28 | 27 | ralrimivva 3205 | . . 3 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) ∈ ℝ) |
| 29 | 4 | fmpo 8080 | . . 3 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅) ∈ ℝ ↔ 𝐷:(𝑋 × 𝑋)⟶ℝ) |
| 30 | 28, 29 | sylib 221 | . 2 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) → 𝐷:(𝑋 × 𝑋)⟶ℝ) |
| 31 | ismet2 24658 | . 2 ⊢ (𝐷 ∈ (Met‘𝑋) ↔ (𝐷 ∈ (∞Met‘𝑋) ∧ 𝐷:(𝑋 × 𝑋)⟶ℝ)) | |
| 32 | 7, 30, 31 | sylanbrc 595 | 1 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ+) → 𝐷 ∈ (Met‘𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∀wral 3076 ifcif 4481 class class class wbr 5102 × cxp 5648 ⟶wf 6535 ‘cfv 6539 (class class class)co 7421 ∈ cmpo 7423 ℝcr 11203 0cc0 11204 ℝ*cxr 11346 < clt 11347 ≤ cle 11348 ℝ+crp 13124 ∞Metcxmet 21669 Metcmet 21670 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 ax-cnex 11260 ax-resscn 11261 ax-1cn 11262 ax-icn 11263 ax-addcl 11264 ax-addrcl 11265 ax-mulcl 11266 ax-mulrcl 11267 ax-mulcom 11268 ax-addass 11269 ax-mulass 11270 ax-distr 11271 ax-i2m1 11272 ax-1ne0 11273 ax-1rid 11274 ax-rnegex 11275 ax-rrecex 11276 ax-cnre 11277 ax-pre-lttri 11278 ax-pre-lttrn 11279 ax-pre-ltadd 11280 ax-pre-mulgt0 11281 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7378 df-ov 7424 df-oprab 7425 df-mpo 7426 df-om 7879 df-1st 8002 df-2nd 8003 df-frecs 8303 df-wrecs 8334 df-recs 8383 df-rdg 8422 df-er 8721 df-map 8853 df-en 8978 df-dom 8979 df-sdom 8980 df-pnf 11349 df-mnf 11350 df-xr 11351 df-ltxr 11352 df-le 11353 df-sub 11547 df-neg 11548 df-div 11978 df-nn 12340 df-2 12409 df-rp 13125 df-xneg 13245 df-xadd 13246 df-xmul 13247 df-icc 13487 df-xmet 21677 df-met 21678 |
| This theorem is used by: mopnex 24844 xlebnum 25292 |
| Copyright terms: Public domain | W3C validator |