| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > metdscnlem | Structured version Visualization version GIF version | ||
| Description: Lemma for metdscn 25206. (Contributed by Mario Carneiro, 4-Sep-2015.) |
| Ref | Expression |
|---|---|
| metdscn.f | ⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ*, < )) |
| metdscn.j | ⊢ 𝐽 = (MetOpen‘𝐷) |
| metdscn.c | ⊢ 𝐶 = (dist‘ℝ*𝑠) |
| metdscn.k | ⊢ 𝐾 = (MetOpen‘𝐶) |
| metdscnlem.1 | ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋)) |
| metdscnlem.2 | ⊢ (𝜑 → 𝑆 ⊆ 𝑋) |
| metdscnlem.3 | ⊢ (𝜑 → 𝐴 ∈ 𝑋) |
| metdscnlem.4 | ⊢ (𝜑 → 𝐵 ∈ 𝑋) |
| metdscnlem.5 | ⊢ (𝜑 → 𝑅 ∈ ℝ+) |
| metdscnlem.6 | ⊢ (𝜑 → (𝐴𝐷𝐵) < 𝑅) |
| Ref | Expression |
|---|---|
| metdscnlem | ⊢ (𝜑 → ((𝐹‘𝐴) +e -e(𝐹‘𝐵)) < 𝑅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | metdscnlem.1 | . . . . . 6 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋)) | |
| 2 | metdscnlem.2 | . . . . . 6 ⊢ (𝜑 → 𝑆 ⊆ 𝑋) | |
| 3 | metdscn.f | . . . . . . 7 ⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ*, < )) | |
| 4 | 3 | metdsf 25198 | . . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) → 𝐹:𝑋⟶(0[,]+∞)) |
| 5 | 1, 2, 4 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → 𝐹:𝑋⟶(0[,]+∞)) |
| 6 | metdscnlem.3 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑋) | |
| 7 | 5, 6 | ffvelcdmd 7109 | . . . 4 ⊢ (𝜑 → (𝐹‘𝐴) ∈ (0[,]+∞)) |
| 8 | eliccxr 13593 | . . . 4 ⊢ ((𝐹‘𝐴) ∈ (0[,]+∞) → (𝐹‘𝐴) ∈ ℝ*) | |
| 9 | 7, 8 | syl 18 | . . 3 ⊢ (𝜑 → (𝐹‘𝐴) ∈ ℝ*) |
| 10 | metdscnlem.4 | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝑋) | |
| 11 | 5, 10 | ffvelcdmd 7109 | . . . . 5 ⊢ (𝜑 → (𝐹‘𝐵) ∈ (0[,]+∞)) |
| 12 | eliccxr 13593 | . . . . 5 ⊢ ((𝐹‘𝐵) ∈ (0[,]+∞) → (𝐹‘𝐵) ∈ ℝ*) | |
| 13 | 11, 12 | syl 18 | . . . 4 ⊢ (𝜑 → (𝐹‘𝐵) ∈ ℝ*) |
| 14 | 13 | xnegcld 13457 | . . 3 ⊢ (𝜑 → -e(𝐹‘𝐵) ∈ ℝ*) |
| 15 | 9, 14 | xaddcld 13458 | . 2 ⊢ (𝜑 → ((𝐹‘𝐴) +e -e(𝐹‘𝐵)) ∈ ℝ*) |
| 16 | xmetcl 24680 | . . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷𝐵) ∈ ℝ*) | |
| 17 | 1, 6, 10, 16 | syl3anc 1399 | . 2 ⊢ (𝜑 → (𝐴𝐷𝐵) ∈ ℝ*) |
| 18 | metdscnlem.5 | . . 3 ⊢ (𝜑 → 𝑅 ∈ ℝ+) | |
| 19 | 18 | rpxrd 13192 | . 2 ⊢ (𝜑 → 𝑅 ∈ ℝ*) |
| 20 | 3 | metdstri 25201 | . . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐹‘𝐴) ≤ ((𝐴𝐷𝐵) +e (𝐹‘𝐵))) |
| 21 | 1, 2, 6, 10, 20 | syl22anc 852 | . . 3 ⊢ (𝜑 → (𝐹‘𝐴) ≤ ((𝐴𝐷𝐵) +e (𝐹‘𝐵))) |
| 22 | elxrge0 13615 | . . . . . 6 ⊢ ((𝐹‘𝐴) ∈ (0[,]+∞) ↔ ((𝐹‘𝐴) ∈ ℝ* ∧ 0 ≤ (𝐹‘𝐴))) | |
| 23 | 22 | simprbi 503 | . . . . 5 ⊢ ((𝐹‘𝐴) ∈ (0[,]+∞) → 0 ≤ (𝐹‘𝐴)) |
| 24 | 7, 23 | syl 18 | . . . 4 ⊢ (𝜑 → 0 ≤ (𝐹‘𝐴)) |
| 25 | elxrge0 13615 | . . . . . . 7 ⊢ ((𝐹‘𝐵) ∈ (0[,]+∞) ↔ ((𝐹‘𝐵) ∈ ℝ* ∧ 0 ≤ (𝐹‘𝐵))) | |
| 26 | 25 | simprbi 503 | . . . . . 6 ⊢ ((𝐹‘𝐵) ∈ (0[,]+∞) → 0 ≤ (𝐹‘𝐵)) |
| 27 | 11, 26 | syl 18 | . . . . 5 ⊢ (𝜑 → 0 ≤ (𝐹‘𝐵)) |
| 28 | ge0nemnf 13330 | . . . . 5 ⊢ (((𝐹‘𝐵) ∈ ℝ* ∧ 0 ≤ (𝐹‘𝐵)) → (𝐹‘𝐵) ≠ -∞) | |
| 29 | 13, 27, 28 | syl2anc 596 | . . . 4 ⊢ (𝜑 → (𝐹‘𝐵) ≠ -∞) |
| 30 | xmetge0 24693 | . . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 0 ≤ (𝐴𝐷𝐵)) | |
| 31 | 1, 6, 10, 30 | syl3anc 1399 | . . . 4 ⊢ (𝜑 → 0 ≤ (𝐴𝐷𝐵)) |
| 32 | xlesubadd 13420 | . . . 4 ⊢ ((((𝐹‘𝐴) ∈ ℝ* ∧ (𝐹‘𝐵) ∈ ℝ* ∧ (𝐴𝐷𝐵) ∈ ℝ*) ∧ (0 ≤ (𝐹‘𝐴) ∧ (𝐹‘𝐵) ≠ -∞ ∧ 0 ≤ (𝐴𝐷𝐵))) → (((𝐹‘𝐴) +e -e(𝐹‘𝐵)) ≤ (𝐴𝐷𝐵) ↔ (𝐹‘𝐴) ≤ ((𝐴𝐷𝐵) +e (𝐹‘𝐵)))) | |
| 33 | 9, 13, 17, 24, 29, 31, 32 | syl33anc 1413 | . . 3 ⊢ (𝜑 → (((𝐹‘𝐴) +e -e(𝐹‘𝐵)) ≤ (𝐴𝐷𝐵) ↔ (𝐹‘𝐴) ≤ ((𝐴𝐷𝐵) +e (𝐹‘𝐵)))) |
| 34 | 21, 33 | mpbird 260 | . 2 ⊢ (𝜑 → ((𝐹‘𝐴) +e -e(𝐹‘𝐵)) ≤ (𝐴𝐷𝐵)) |
| 35 | metdscnlem.6 | . 2 ⊢ (𝜑 → (𝐴𝐷𝐵) < 𝑅) | |
| 36 | 15, 17, 19, 34, 35 | xrlelttrd 13316 | 1 ⊢ (𝜑 → ((𝐹‘𝐴) +e -e(𝐹‘𝐵)) < 𝑅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ⊆ wss 3900 class class class wbr 5106 ↦ cmpt 5189 ran crn 5656 ⟶wf 6554 ‘cfv 6558 (class class class)co 7443 infcinf 9460 0cc0 11227 +∞cpnf 11367 -∞cmnf 11368 ℝ*cxr 11369 < clt 11370 ≤ cle 11371 ℝ+crp 13147 -ecxne 13265 +e cxad 13266 [,]cicc 13506 distcds 17466 ℝ*𝑠cxrs 17701 ∞Metcxmet 21693 MetOpencmopn 21698 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-cnex 11283 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 ax-pre-mulgt0 11304 ax-pre-sup 11305 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-er 8745 df-ec 8747 df-map 8877 df-en 9002 df-dom 9003 df-sdom 9004 df-sup 9461 df-inf 9462 df-pnf 11372 df-mnf 11373 df-xr 11374 df-ltxr 11375 df-le 11376 df-sub 11570 df-neg 11571 df-div 12001 df-nn 12363 df-2 12432 df-rp 13148 df-xneg 13268 df-xadd 13269 df-xmul 13270 df-icc 13510 df-psmet 21700 df-xmet 21701 df-bl 21703 |
| This theorem is used by: metdscn 25206 |
| Copyright terms: Public domain | W3C validator |