| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > xmetrtri | GIF version | ||
| Description: One half of the reverse triangle inequality for the distance function of an extended metric. (Contributed by Mario Carneiro, 4-Sep-2015.) |
| Ref | Expression |
|---|---|
| xmetrtri | ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐷𝐶) +𝑒 -𝑒(𝐵𝐷𝐶)) ≤ (𝐴𝐷𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 3ancomb 1010 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) ↔ (𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) | |
| 2 | xmettri 15031 | . . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐷𝐶) ≤ ((𝐴𝐷𝐵) +𝑒 (𝐵𝐷𝐶))) | |
| 3 | 1, 2 | sylan2b 287 | . 2 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐶) ≤ ((𝐴𝐷𝐵) +𝑒 (𝐵𝐷𝐶))) |
| 4 | xmetcl 15011 | . . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴𝐷𝐶) ∈ ℝ*) | |
| 5 | 4 | 3adant3r2 1237 | . . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐶) ∈ ℝ*) |
| 6 | xmetcl 15011 | . . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵𝐷𝐶) ∈ ℝ*) | |
| 7 | 6 | 3adant3r1 1236 | . . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝐷𝐶) ∈ ℝ*) |
| 8 | xmetcl 15011 | . . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷𝐵) ∈ ℝ*) | |
| 9 | 8 | 3adant3r3 1238 | . . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐵) ∈ ℝ*) |
| 10 | xmetge0 15024 | . . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → 0 ≤ (𝐴𝐷𝐶)) | |
| 11 | 10 | 3adant3r2 1237 | . . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 0 ≤ (𝐴𝐷𝐶)) |
| 12 | xmetge0 15024 | . . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → 0 ≤ (𝐵𝐷𝐶)) | |
| 13 | 12 | 3adant3r1 1236 | . . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 0 ≤ (𝐵𝐷𝐶)) |
| 14 | ge0nemnf 10008 | . . . 4 ⊢ (((𝐵𝐷𝐶) ∈ ℝ* ∧ 0 ≤ (𝐵𝐷𝐶)) → (𝐵𝐷𝐶) ≠ -∞) | |
| 15 | 7, 13, 14 | syl2anc 411 | . . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝐷𝐶) ≠ -∞) |
| 16 | xmetge0 15024 | . . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 0 ≤ (𝐴𝐷𝐵)) | |
| 17 | 16 | 3adant3r3 1238 | . . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 0 ≤ (𝐴𝐷𝐵)) |
| 18 | xlesubadd 10067 | . . 3 ⊢ ((((𝐴𝐷𝐶) ∈ ℝ* ∧ (𝐵𝐷𝐶) ∈ ℝ* ∧ (𝐴𝐷𝐵) ∈ ℝ*) ∧ (0 ≤ (𝐴𝐷𝐶) ∧ (𝐵𝐷𝐶) ≠ -∞ ∧ 0 ≤ (𝐴𝐷𝐵))) → (((𝐴𝐷𝐶) +𝑒 -𝑒(𝐵𝐷𝐶)) ≤ (𝐴𝐷𝐵) ↔ (𝐴𝐷𝐶) ≤ ((𝐴𝐷𝐵) +𝑒 (𝐵𝐷𝐶)))) | |
| 19 | 5, 7, 9, 11, 15, 17, 18 | syl33anc 1286 | . 2 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (((𝐴𝐷𝐶) +𝑒 -𝑒(𝐵𝐷𝐶)) ≤ (𝐴𝐷𝐵) ↔ (𝐴𝐷𝐶) ≤ ((𝐴𝐷𝐵) +𝑒 (𝐵𝐷𝐶)))) |
| 20 | 3, 19 | mpbird 167 | 1 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐷𝐶) +𝑒 -𝑒(𝐵𝐷𝐶)) ≤ (𝐴𝐷𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1002 ∈ wcel 2200 ≠ wne 2400 class class class wbr 4082 ‘cfv 5314 (class class class)co 5994 0cc0 7987 -∞cmnf 8167 ℝ*cxr 8168 ≤ cle 8170 -𝑒cxne 9953 +𝑒 cxad 9954 ∞Metcxmet 14485 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4201 ax-pow 4257 ax-pr 4292 ax-un 4521 ax-setind 4626 ax-cnex 8078 ax-resscn 8079 ax-1cn 8080 ax-1re 8081 ax-icn 8082 ax-addcl 8083 ax-addrcl 8084 ax-mulcl 8085 ax-mulrcl 8086 ax-addcom 8087 ax-mulcom 8088 ax-addass 8089 ax-mulass 8090 ax-distr 8091 ax-i2m1 8092 ax-0lt1 8093 ax-1rid 8094 ax-0id 8095 ax-rnegex 8096 ax-precex 8097 ax-cnre 8098 ax-pre-ltirr 8099 ax-pre-ltwlin 8100 ax-pre-lttrn 8101 ax-pre-apti 8102 ax-pre-ltadd 8103 ax-pre-mulgt0 8104 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-iun 3966 df-br 4083 df-opab 4145 df-mpt 4146 df-id 4381 df-po 4384 df-iso 4385 df-xp 4722 df-rel 4723 df-cnv 4724 df-co 4725 df-dm 4726 df-rn 4727 df-res 4728 df-ima 4729 df-iota 5274 df-fun 5316 df-fn 5317 df-f 5318 df-fv 5322 df-riota 5947 df-ov 5997 df-oprab 5998 df-mpo 5999 df-1st 6276 df-2nd 6277 df-map 6787 df-pnf 8171 df-mnf 8172 df-xr 8173 df-ltxr 8174 df-le 8175 df-sub 8307 df-neg 8308 df-2 9157 df-xneg 9956 df-xadd 9957 df-xmet 14493 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |