xmetrtri - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > xmetrtri		GIF version

Theorem xmetrtri 14544

Description: One half of the reverse triangle inequality for the distance function of an extended metric. (Contributed by Mario Carneiro, 4-Sep-2015.)

**Assertion**
Ref	Expression
xmetrtri	⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐷𝐶) +_𝑒 -_𝑒(𝐵𝐷𝐶)) ≤ (𝐴𝐷𝐵))

**Proof of Theorem xmetrtri**
Step	Hyp	Ref	Expression
1		3ancomb 988	. . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) ↔ (𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋))
2		xmettri 14540	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐷𝐶) ≤ ((𝐴𝐷𝐵) +_𝑒 (𝐵𝐷𝐶)))
3	1, 2	sylan2b 287	. 2 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐶) ≤ ((𝐴𝐷𝐵) +_𝑒 (𝐵𝐷𝐶)))
4		xmetcl 14520	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴𝐷𝐶) ∈ ℝ^*)
5	4	3adant3r2 1215	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐶) ∈ ℝ^*)
6		xmetcl 14520	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵𝐷𝐶) ∈ ℝ^*)
7	6	3adant3r1 1214	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝐷𝐶) ∈ ℝ^*)
8		xmetcl 14520	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷𝐵) ∈ ℝ^*)
9	8	3adant3r3 1216	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐵) ∈ ℝ^*)
10		xmetge0 14533	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → 0 ≤ (𝐴𝐷𝐶))
11	10	3adant3r2 1215	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 0 ≤ (𝐴𝐷𝐶))
12		xmetge0 14533	. . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → 0 ≤ (𝐵𝐷𝐶))
13	12	3adant3r1 1214	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 0 ≤ (𝐵𝐷𝐶))
14		ge0nemnf 9890	. . . 4 ⊢ (((𝐵𝐷𝐶) ∈ ℝ^* ∧ 0 ≤ (𝐵𝐷𝐶)) → (𝐵𝐷𝐶) ≠ -∞)
15	7, 13, 14	syl2anc 411	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝐷𝐶) ≠ -∞)
16		xmetge0 14533	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 0 ≤ (𝐴𝐷𝐵))
17	16	3adant3r3 1216	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 0 ≤ (𝐴𝐷𝐵))
18		xlesubadd 9949	. . 3 ⊢ ((((𝐴𝐷𝐶) ∈ ℝ^* ∧ (𝐵𝐷𝐶) ∈ ℝ^* ∧ (𝐴𝐷𝐵) ∈ ℝ^*) ∧ (0 ≤ (𝐴𝐷𝐶) ∧ (𝐵𝐷𝐶) ≠ -∞ ∧ 0 ≤ (𝐴𝐷𝐵))) → (((𝐴𝐷𝐶) +_𝑒 -_𝑒(𝐵𝐷𝐶)) ≤ (𝐴𝐷𝐵) ↔ (𝐴𝐷𝐶) ≤ ((𝐴𝐷𝐵) +_𝑒 (𝐵𝐷𝐶))))
19	5, 7, 9, 11, 15, 17, 18	syl33anc 1264	. 2 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (((𝐴𝐷𝐶) +_𝑒 -_𝑒(𝐵𝐷𝐶)) ≤ (𝐴𝐷𝐵) ↔ (𝐴𝐷𝐶) ≤ ((𝐴𝐷𝐵) +_𝑒 (𝐵𝐷𝐶))))
20	3, 19	mpbird 167	1 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐷𝐶) +_𝑒 -_𝑒(𝐵𝐷𝐶)) ≤ (𝐴𝐷𝐵))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 980 ∈ wcel 2164 ≠ wne 2364 class class class wbr 4029 ‘cfv 5254 (class class class)co 5918 0cc0 7872 -∞cmnf 8052 ℝ^*cxr 8053 ≤ cle 8055 -_𝑒cxne 9835 +_𝑒 cxad 9836 ∞Metcxmet 14032

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 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-cnex 7963 ax-resscn 7964 ax-1cn 7965 ax-1re 7966 ax-icn 7967 ax-addcl 7968 ax-addrcl 7969 ax-mulcl 7970 ax-mulrcl 7971 ax-addcom 7972 ax-mulcom 7973 ax-addass 7974 ax-mulass 7975 ax-distr 7976 ax-i2m1 7977 ax-0lt1 7978 ax-1rid 7979 ax-0id 7980 ax-rnegex 7981 ax-precex 7982 ax-cnre 7983 ax-pre-ltirr 7984 ax-pre-ltwlin 7985 ax-pre-lttrn 7986 ax-pre-apti 7987 ax-pre-ltadd 7988 ax-pre-mulgt0 7989

This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rab 2481 df-v 2762 df-sbc 2986 df-csb 3081 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-if 3558 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-iun 3914 df-br 4030 df-opab 4091 df-mpt 4092 df-id 4324 df-po 4327 df-iso 4328 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-f 5258 df-fv 5262 df-riota 5873 df-ov 5921 df-oprab 5922 df-mpo 5923 df-1st 6193 df-2nd 6194 df-map 6704 df-pnf 8056 df-mnf 8057 df-xr 8058 df-ltxr 8059 df-le 8060 df-sub 8192 df-neg 8193 df-2 9041 df-xneg 9838 df-xadd 9839 df-xmet 14040

This theorem is referenced by: (None)

W3C validator