| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > metrtri | GIF version | ||
| Description: Reverse triangle inequality for the distance function of a metric space. (Contributed by Mario Carneiro, 5-May-2014.) (Revised by Jim Kingdon, 21-Apr-2023.) |
| Ref | Expression |
|---|---|
| metrtri | ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (abs‘((𝐴𝐷𝐶) − (𝐵𝐷𝐶))) ≤ (𝐴𝐷𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 109 | . . . . 5 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐷 ∈ (Met‘𝑋)) | |
| 2 | simpr2 1009 | . . . . 5 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐵 ∈ 𝑋) | |
| 3 | simpr3 1010 | . . . . 5 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐶 ∈ 𝑋) | |
| 4 | simpr1 1008 | . . . . 5 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐴 ∈ 𝑋) | |
| 5 | mettri 15012 | . . . . 5 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → (𝐵𝐷𝐶) ≤ ((𝐵𝐷𝐴) + (𝐴𝐷𝐶))) | |
| 6 | 1, 2, 3, 4, 5 | syl13anc 1254 | . . . 4 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝐷𝐶) ≤ ((𝐵𝐷𝐴) + (𝐴𝐷𝐶))) |
| 7 | metcl 14992 | . . . . . . 7 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷𝐵) ∈ ℝ) | |
| 8 | 1, 4, 2, 7 | syl3anc 1252 | . . . . . 6 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐵) ∈ ℝ) |
| 9 | 8 | recnd 8143 | . . . . 5 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐵) ∈ ℂ) |
| 10 | metcl 14992 | . . . . . . 7 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴𝐷𝐶) ∈ ℝ) | |
| 11 | 1, 4, 3, 10 | syl3anc 1252 | . . . . . 6 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐶) ∈ ℝ) |
| 12 | 11 | recnd 8143 | . . . . 5 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐶) ∈ ℂ) |
| 13 | metsym 15010 | . . . . . . 7 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ 𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐵𝐷𝐴) = (𝐴𝐷𝐵)) | |
| 14 | 1, 2, 4, 13 | syl3anc 1252 | . . . . . 6 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝐷𝐴) = (𝐴𝐷𝐵)) |
| 15 | 14 | oveq1d 5989 | . . . . 5 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐵𝐷𝐴) + (𝐴𝐷𝐶)) = ((𝐴𝐷𝐵) + (𝐴𝐷𝐶))) |
| 16 | 9, 12, 15 | comraddd 8271 | . . . 4 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐵𝐷𝐴) + (𝐴𝐷𝐶)) = ((𝐴𝐷𝐶) + (𝐴𝐷𝐵))) |
| 17 | 6, 16 | breqtrd 4088 | . . 3 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝐷𝐶) ≤ ((𝐴𝐷𝐶) + (𝐴𝐷𝐵))) |
| 18 | metcl 14992 | . . . . 5 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵𝐷𝐶) ∈ ℝ) | |
| 19 | 1, 2, 3, 18 | syl3anc 1252 | . . . 4 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝐷𝐶) ∈ ℝ) |
| 20 | 19, 8, 11 | lesubaddd 8657 | . . 3 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (((𝐵𝐷𝐶) − (𝐴𝐷𝐵)) ≤ (𝐴𝐷𝐶) ↔ (𝐵𝐷𝐶) ≤ ((𝐴𝐷𝐶) + (𝐴𝐷𝐵)))) |
| 21 | 17, 20 | mpbird 167 | . 2 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐵𝐷𝐶) − (𝐴𝐷𝐵)) ≤ (𝐴𝐷𝐶)) |
| 22 | mettri 15012 | . . . 4 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐷𝐶) ≤ ((𝐴𝐷𝐵) + (𝐵𝐷𝐶))) | |
| 23 | 1, 4, 3, 2, 22 | syl13anc 1254 | . . 3 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐶) ≤ ((𝐴𝐷𝐵) + (𝐵𝐷𝐶))) |
| 24 | 19 | recnd 8143 | . . . 4 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝐷𝐶) ∈ ℂ) |
| 25 | 9, 24 | addcomd 8265 | . . 3 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐷𝐵) + (𝐵𝐷𝐶)) = ((𝐵𝐷𝐶) + (𝐴𝐷𝐵))) |
| 26 | 23, 25 | breqtrd 4088 | . 2 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐶) ≤ ((𝐵𝐷𝐶) + (𝐴𝐷𝐵))) |
| 27 | 11, 19, 8 | absdifled 11656 | . 2 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((abs‘((𝐴𝐷𝐶) − (𝐵𝐷𝐶))) ≤ (𝐴𝐷𝐵) ↔ (((𝐵𝐷𝐶) − (𝐴𝐷𝐵)) ≤ (𝐴𝐷𝐶) ∧ (𝐴𝐷𝐶) ≤ ((𝐵𝐷𝐶) + (𝐴𝐷𝐵))))) |
| 28 | 21, 26, 27 | mpbir2and 949 | 1 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (abs‘((𝐴𝐷𝐶) − (𝐵𝐷𝐶))) ≤ (𝐴𝐷𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 983 = wceq 1375 ∈ wcel 2180 class class class wbr 4062 ‘cfv 5294 (class class class)co 5974 ℝcr 7966 + caddc 7970 ≤ cle 8150 − cmin 8285 abscabs 11474 Metcmet 14466 |
| 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 713 ax-5 1473 ax-7 1474 ax-gen 1475 ax-ie1 1519 ax-ie2 1520 ax-8 1530 ax-10 1531 ax-11 1532 ax-i12 1533 ax-bndl 1535 ax-4 1536 ax-17 1552 ax-i9 1556 ax-ial 1560 ax-i5r 1561 ax-13 2182 ax-14 2183 ax-ext 2191 ax-coll 4178 ax-sep 4181 ax-nul 4189 ax-pow 4237 ax-pr 4272 ax-un 4501 ax-setind 4606 ax-iinf 4657 ax-cnex 8058 ax-resscn 8059 ax-1cn 8060 ax-1re 8061 ax-icn 8062 ax-addcl 8063 ax-addrcl 8064 ax-mulcl 8065 ax-mulrcl 8066 ax-addcom 8067 ax-mulcom 8068 ax-addass 8069 ax-mulass 8070 ax-distr 8071 ax-i2m1 8072 ax-0lt1 8073 ax-1rid 8074 ax-0id 8075 ax-rnegex 8076 ax-precex 8077 ax-cnre 8078 ax-pre-ltirr 8079 ax-pre-ltwlin 8080 ax-pre-lttrn 8081 ax-pre-apti 8082 ax-pre-ltadd 8083 ax-pre-mulgt0 8084 ax-pre-mulext 8085 ax-arch 8086 ax-caucvg 8087 |
| This theorem depends on definitions: df-bi 117 df-dc 839 df-3or 984 df-3an 985 df-tru 1378 df-fal 1381 df-nf 1487 df-sb 1789 df-eu 2060 df-mo 2061 df-clab 2196 df-cleq 2202 df-clel 2205 df-nfc 2341 df-ne 2381 df-nel 2476 df-ral 2493 df-rex 2494 df-reu 2495 df-rmo 2496 df-rab 2497 df-v 2781 df-sbc 3009 df-csb 3105 df-dif 3179 df-un 3181 df-in 3183 df-ss 3190 df-nul 3472 df-if 3583 df-pw 3631 df-sn 3652 df-pr 3653 df-op 3655 df-uni 3868 df-int 3903 df-iun 3946 df-br 4063 df-opab 4125 df-mpt 4126 df-tr 4162 df-id 4361 df-po 4364 df-iso 4365 df-iord 4434 df-on 4436 df-ilim 4437 df-suc 4439 df-iom 4660 df-xp 4702 df-rel 4703 df-cnv 4704 df-co 4705 df-dm 4706 df-rn 4707 df-res 4708 df-ima 4709 df-iota 5254 df-fun 5296 df-fn 5297 df-f 5298 df-f1 5299 df-fo 5300 df-f1o 5301 df-fv 5302 df-riota 5927 df-ov 5977 df-oprab 5978 df-mpo 5979 df-1st 6256 df-2nd 6257 df-recs 6421 df-frec 6507 df-map 6767 df-pnf 8151 df-mnf 8152 df-xr 8153 df-ltxr 8154 df-le 8155 df-sub 8287 df-neg 8288 df-reap 8690 df-ap 8697 df-div 8788 df-inn 9079 df-2 9137 df-3 9138 df-4 9139 df-n0 9338 df-z 9415 df-uz 9691 df-rp 9818 df-xadd 9937 df-seqfrec 10637 df-exp 10728 df-cj 11319 df-re 11320 df-im 11321 df-rsqrt 11475 df-abs 11476 df-xmet 14473 df-met 14474 |
| This theorem is referenced by: msrtri 15115 |
| Copyright terms: Public domain | W3C validator |