| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > metdscnlem | Structured version Visualization version GIF version | ||
| Description: Lemma for metdscn 25177. (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 25169 | . . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) → 𝐹:𝑋⟶(0[,]+∞)) |
| 5 | 1, 2, 4 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → 𝐹:𝑋⟶(0[,]+∞)) |
| 6 | metdscnlem.3 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑋) | |
| 7 | 5, 6 | ffvelcdmd 7085 | . . . 4 ⊢ (𝜑 → (𝐹‘𝐴) ∈ (0[,]+∞)) |
| 8 | eliccxr 13567 | . . . 4 ⊢ ((𝐹‘𝐴) ∈ (0[,]+∞) → (𝐹‘𝐴) ∈ ℝ*) | |
| 9 | 7, 8 | syl 18 | . . 3 ⊢ (𝜑 → (𝐹‘𝐴) ∈ ℝ*) |
| 10 | metdscnlem.4 | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝑋) | |
| 11 | 5, 10 | ffvelcdmd 7085 | . . . . 5 ⊢ (𝜑 → (𝐹‘𝐵) ∈ (0[,]+∞)) |
| 12 | eliccxr 13567 | . . . . 5 ⊢ ((𝐹‘𝐵) ∈ (0[,]+∞) → (𝐹‘𝐵) ∈ ℝ*) | |
| 13 | 11, 12 | syl 18 | . . . 4 ⊢ (𝜑 → (𝐹‘𝐵) ∈ ℝ*) |
| 14 | 13 | xnegcld 13431 | . . 3 ⊢ (𝜑 → -e(𝐹‘𝐵) ∈ ℝ*) |
| 15 | 9, 14 | xaddcld 13432 | . 2 ⊢ (𝜑 → ((𝐹‘𝐴) +e -e(𝐹‘𝐵)) ∈ ℝ*) |
| 16 | xmetcl 24651 | . . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷𝐵) ∈ ℝ*) | |
| 17 | 1, 6, 10, 16 | syl3anc 1398 | . 2 ⊢ (𝜑 → (𝐴𝐷𝐵) ∈ ℝ*) |
| 18 | metdscnlem.5 | . . 3 ⊢ (𝜑 → 𝑅 ∈ ℝ+) | |
| 19 | 18 | rpxrd 13166 | . 2 ⊢ (𝜑 → 𝑅 ∈ ℝ*) |
| 20 | 3 | metdstri 25172 | . . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐹‘𝐴) ≤ ((𝐴𝐷𝐵) +e (𝐹‘𝐵))) |
| 21 | 1, 2, 6, 10, 20 | syl22anc 852 | . . 3 ⊢ (𝜑 → (𝐹‘𝐴) ≤ ((𝐴𝐷𝐵) +e (𝐹‘𝐵))) |
| 22 | elxrge0 13589 | . . . . . 6 ⊢ ((𝐹‘𝐴) ∈ (0[,]+∞) ↔ ((𝐹‘𝐴) ∈ ℝ* ∧ 0 ≤ (𝐹‘𝐴))) | |
| 23 | 22 | simprbi 503 | . . . . 5 ⊢ ((𝐹‘𝐴) ∈ (0[,]+∞) → 0 ≤ (𝐹‘𝐴)) |
| 24 | 7, 23 | syl 18 | . . . 4 ⊢ (𝜑 → 0 ≤ (𝐹‘𝐴)) |
| 25 | elxrge0 13589 | . . . . . . 7 ⊢ ((𝐹‘𝐵) ∈ (0[,]+∞) ↔ ((𝐹‘𝐵) ∈ ℝ* ∧ 0 ≤ (𝐹‘𝐵))) | |
| 26 | 25 | simprbi 503 | . . . . . 6 ⊢ ((𝐹‘𝐵) ∈ (0[,]+∞) → 0 ≤ (𝐹‘𝐵)) |
| 27 | 11, 26 | syl 18 | . . . . 5 ⊢ (𝜑 → 0 ≤ (𝐹‘𝐵)) |
| 28 | ge0nemnf 13304 | . . . . 5 ⊢ (((𝐹‘𝐵) ∈ ℝ* ∧ 0 ≤ (𝐹‘𝐵)) → (𝐹‘𝐵) ≠ -∞) | |
| 29 | 13, 27, 28 | syl2anc 596 | . . . 4 ⊢ (𝜑 → (𝐹‘𝐵) ≠ -∞) |
| 30 | xmetge0 24664 | . . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 0 ≤ (𝐴𝐷𝐵)) | |
| 31 | 1, 6, 10, 30 | syl3anc 1398 | . . . 4 ⊢ (𝜑 → 0 ≤ (𝐴𝐷𝐵)) |
| 32 | xlesubadd 13394 | . . . 4 ⊢ ((((𝐹‘𝐴) ∈ ℝ* ∧ (𝐹‘𝐵) ∈ ℝ* ∧ (𝐴𝐷𝐵) ∈ ℝ*) ∧ (0 ≤ (𝐹‘𝐴) ∧ (𝐹‘𝐵) ≠ -∞ ∧ 0 ≤ (𝐴𝐷𝐵))) → (((𝐹‘𝐴) +e -e(𝐹‘𝐵)) ≤ (𝐴𝐷𝐵) ↔ (𝐹‘𝐴) ≤ ((𝐴𝐷𝐵) +e (𝐹‘𝐵)))) | |
| 33 | 9, 13, 17, 24, 29, 31, 32 | syl33anc 1412 | . . 3 ⊢ (𝜑 → (((𝐹‘𝐴) +e -e(𝐹‘𝐵)) ≤ (𝐴𝐷𝐵) ↔ (𝐹‘𝐴) ≤ ((𝐴𝐷𝐵) +e (𝐹‘𝐵)))) |
| 34 | 21, 33 | mpbird 260 | . 2 ⊢ (𝜑 → ((𝐹‘𝐴) +e -e(𝐹‘𝐵)) ≤ (𝐴𝐷𝐵)) |
| 35 | metdscnlem.6 | . 2 ⊢ (𝜑 → (𝐴𝐷𝐵) < 𝑅) | |
| 36 | 15, 17, 19, 34, 35 | xrlelttrd 13290 | 1 ⊢ (𝜑 → ((𝐹‘𝐴) +e -e(𝐹‘𝐵)) < 𝑅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 ⊆ wss 3895 class class class wbr 5102 ↦ cmpt 5185 ran crn 5651 ⟶wf 6534 ‘cfv 6538 (class class class)co 7420 infcinf 9434 0cc0 11201 +∞cpnf 11341 -∞cmnf 11342 ℝ*cxr 11343 < clt 11344 ≤ cle 11345 ℝ+crp 13121 -ecxne 13239 +e cxad 13240 [,]cicc 13480 distcds 17438 ℝ*𝑠cxrs 17673 ∞Metcxmet 21664 MetOpencmopn 21669 |
| 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 7751 ax-cnex 11257 ax-resscn 11258 ax-1cn 11259 ax-icn 11260 ax-addcl 11261 ax-addrcl 11262 ax-mulcl 11263 ax-mulrcl 11264 ax-mulcom 11265 ax-addass 11266 ax-mulass 11267 ax-distr 11268 ax-i2m1 11269 ax-1ne0 11270 ax-1rid 11271 ax-rnegex 11272 ax-rrecex 11273 ax-cnre 11274 ax-pre-lttri 11275 ax-pre-lttrn 11276 ax-pre-ltadd 11277 ax-pre-mulgt0 11278 ax-pre-sup 11279 |
| 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 4584 df-pr 4586 df-op 4590 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 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8300 df-wrecs 8331 df-recs 8380 df-rdg 8419 df-er 8718 df-ec 8720 df-map 8850 df-en 8975 df-dom 8976 df-sdom 8977 df-sup 9435 df-inf 9436 df-pnf 11346 df-mnf 11347 df-xr 11348 df-ltxr 11349 df-le 11350 df-sub 11544 df-neg 11545 df-div 11975 df-nn 12337 df-2 12406 df-rp 13122 df-xneg 13242 df-xadd 13243 df-xmul 13244 df-icc 13484 df-psmet 21671 df-xmet 21672 df-bl 21674 |
| This theorem is used by: metdscn 25177 |
| Copyright terms: Public domain | W3C validator |