| 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 989 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) ↔ (𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) | |
| 2 | xmettri 14914 | . . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐷𝐶) ≤ ((𝐴𝐷𝐵) +𝑒 (𝐵𝐷𝐶))) | |
| 3 | 1, 2 | sylan2b 287 | . 2 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐶) ≤ ((𝐴𝐷𝐵) +𝑒 (𝐵𝐷𝐶))) |
| 4 | xmetcl 14894 | . . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴𝐷𝐶) ∈ ℝ*) | |
| 5 | 4 | 3adant3r2 1216 | . . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐶) ∈ ℝ*) |
| 6 | xmetcl 14894 | . . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵𝐷𝐶) ∈ ℝ*) | |
| 7 | 6 | 3adant3r1 1215 | . . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝐷𝐶) ∈ ℝ*) |
| 8 | xmetcl 14894 | . . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷𝐵) ∈ ℝ*) | |
| 9 | 8 | 3adant3r3 1217 | . . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐵) ∈ ℝ*) |
| 10 | xmetge0 14907 | . . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → 0 ≤ (𝐴𝐷𝐶)) | |
| 11 | 10 | 3adant3r2 1216 | . . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 0 ≤ (𝐴𝐷𝐶)) |
| 12 | xmetge0 14907 | . . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → 0 ≤ (𝐵𝐷𝐶)) | |
| 13 | 12 | 3adant3r1 1215 | . . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 0 ≤ (𝐵𝐷𝐶)) |
| 14 | ge0nemnf 9961 | . . . 4 ⊢ (((𝐵𝐷𝐶) ∈ ℝ* ∧ 0 ≤ (𝐵𝐷𝐶)) → (𝐵𝐷𝐶) ≠ -∞) | |
| 15 | 7, 13, 14 | syl2anc 411 | . . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝐷𝐶) ≠ -∞) |
| 16 | xmetge0 14907 | . . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 0 ≤ (𝐴𝐷𝐵)) | |
| 17 | 16 | 3adant3r3 1217 | . . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 0 ≤ (𝐴𝐷𝐵)) |
| 18 | xlesubadd 10020 | . . 3 ⊢ ((((𝐴𝐷𝐶) ∈ ℝ* ∧ (𝐵𝐷𝐶) ∈ ℝ* ∧ (𝐴𝐷𝐵) ∈ ℝ*) ∧ (0 ≤ (𝐴𝐷𝐶) ∧ (𝐵𝐷𝐶) ≠ -∞ ∧ 0 ≤ (𝐴𝐷𝐵))) → (((𝐴𝐷𝐶) +𝑒 -𝑒(𝐵𝐷𝐶)) ≤ (𝐴𝐷𝐵) ↔ (𝐴𝐷𝐶) ≤ ((𝐴𝐷𝐵) +𝑒 (𝐵𝐷𝐶)))) | |
| 19 | 5, 7, 9, 11, 15, 17, 18 | syl33anc 1265 | . 2 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (((𝐴𝐷𝐶) +𝑒 -𝑒(𝐵𝐷𝐶)) ≤ (𝐴𝐷𝐵) ↔ (𝐴𝐷𝐶) ≤ ((𝐴𝐷𝐵) +𝑒 (𝐵𝐷𝐶)))) |
| 20 | 3, 19 | mpbird 167 | 1 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐷𝐶) +𝑒 -𝑒(𝐵𝐷𝐶)) ≤ (𝐴𝐷𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 981 ∈ wcel 2177 ≠ wne 2377 class class class wbr 4050 ‘cfv 5279 (class class class)co 5956 0cc0 7940 -∞cmnf 8120 ℝ*cxr 8121 ≤ cle 8123 -𝑒cxne 9906 +𝑒 cxad 9907 ∞Metcxmet 14368 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-sep 4169 ax-pow 4225 ax-pr 4260 ax-un 4487 ax-setind 4592 ax-cnex 8031 ax-resscn 8032 ax-1cn 8033 ax-1re 8034 ax-icn 8035 ax-addcl 8036 ax-addrcl 8037 ax-mulcl 8038 ax-mulrcl 8039 ax-addcom 8040 ax-mulcom 8041 ax-addass 8042 ax-mulass 8043 ax-distr 8044 ax-i2m1 8045 ax-0lt1 8046 ax-1rid 8047 ax-0id 8048 ax-rnegex 8049 ax-precex 8050 ax-cnre 8051 ax-pre-ltirr 8052 ax-pre-ltwlin 8053 ax-pre-lttrn 8054 ax-pre-apti 8055 ax-pre-ltadd 8056 ax-pre-mulgt0 8057 |
| This theorem depends on definitions: df-bi 117 df-dc 837 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-nel 2473 df-ral 2490 df-rex 2491 df-reu 2492 df-rab 2494 df-v 2775 df-sbc 3003 df-csb 3098 df-dif 3172 df-un 3174 df-in 3176 df-ss 3183 df-if 3576 df-pw 3622 df-sn 3643 df-pr 3644 df-op 3646 df-uni 3856 df-iun 3934 df-br 4051 df-opab 4113 df-mpt 4114 df-id 4347 df-po 4350 df-iso 4351 df-xp 4688 df-rel 4689 df-cnv 4690 df-co 4691 df-dm 4692 df-rn 4693 df-res 4694 df-ima 4695 df-iota 5240 df-fun 5281 df-fn 5282 df-f 5283 df-fv 5287 df-riota 5911 df-ov 5959 df-oprab 5960 df-mpo 5961 df-1st 6238 df-2nd 6239 df-map 6749 df-pnf 8124 df-mnf 8125 df-xr 8126 df-ltxr 8127 df-le 8128 df-sub 8260 df-neg 8261 df-2 9110 df-xneg 9909 df-xadd 9910 df-xmet 14376 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |