xmetrtri - Intuitionistic Logic Explorer

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

Theorem xmetrtri 14696

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 14692	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐷𝐶) ≤ ((𝐴𝐷𝐵) +_𝑒 (𝐵𝐷𝐶)))
3	1, 2	sylan2b 287	. 2 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐶) ≤ ((𝐴𝐷𝐵) +_𝑒 (𝐵𝐷𝐶)))
4		xmetcl 14672	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴𝐷𝐶) ∈ ℝ^*)
5	4	3adant3r2 1215	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐶) ∈ ℝ^*)
6		xmetcl 14672	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵𝐷𝐶) ∈ ℝ^*)
7	6	3adant3r1 1214	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝐷𝐶) ∈ ℝ^*)
8		xmetcl 14672	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷𝐵) ∈ ℝ^*)
9	8	3adant3r3 1216	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐵) ∈ ℝ^*)
10		xmetge0 14685	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → 0 ≤ (𝐴𝐷𝐶))
11	10	3adant3r2 1215	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 0 ≤ (𝐴𝐷𝐶))
12		xmetge0 14685	. . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → 0 ≤ (𝐵𝐷𝐶))
13	12	3adant3r1 1214	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 0 ≤ (𝐵𝐷𝐶))
14		ge0nemnf 9916	. . . 4 ⊢ (((𝐵𝐷𝐶) ∈ ℝ^* ∧ 0 ≤ (𝐵𝐷𝐶)) → (𝐵𝐷𝐶) ≠ -∞)
15	7, 13, 14	syl2anc 411	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝐷𝐶) ≠ -∞)
16		xmetge0 14685	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 0 ≤ (𝐴𝐷𝐵))
17	16	3adant3r3 1216	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 0 ≤ (𝐴𝐷𝐵))
18		xlesubadd 9975	. . 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 2167 ≠ wne 2367 class class class wbr 4034 ‘cfv 5259 (class class class)co 5925 0cc0 7896 -∞cmnf 8076 ℝ^*cxr 8077 ≤ cle 8079 -_𝑒cxne 9861 +_𝑒 cxad 9862 ∞Metcxmet 14168

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 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-sep 4152 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-setind 4574 ax-cnex 7987 ax-resscn 7988 ax-1cn 7989 ax-1re 7990 ax-icn 7991 ax-addcl 7992 ax-addrcl 7993 ax-mulcl 7994 ax-mulrcl 7995 ax-addcom 7996 ax-mulcom 7997 ax-addass 7998 ax-mulass 7999 ax-distr 8000 ax-i2m1 8001 ax-0lt1 8002 ax-1rid 8003 ax-0id 8004 ax-rnegex 8005 ax-precex 8006 ax-cnre 8007 ax-pre-ltirr 8008 ax-pre-ltwlin 8009 ax-pre-lttrn 8010 ax-pre-apti 8011 ax-pre-ltadd 8012 ax-pre-mulgt0 8013

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 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-nel 2463 df-ral 2480 df-rex 2481 df-reu 2482 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-if 3563 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-iun 3919 df-br 4035 df-opab 4096 df-mpt 4097 df-id 4329 df-po 4332 df-iso 4333 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-res 4676 df-ima 4677 df-iota 5220 df-fun 5261 df-fn 5262 df-f 5263 df-fv 5267 df-riota 5880 df-ov 5928 df-oprab 5929 df-mpo 5930 df-1st 6207 df-2nd 6208 df-map 6718 df-pnf 8080 df-mnf 8081 df-xr 8082 df-ltxr 8083 df-le 8084 df-sub 8216 df-neg 8217 df-2 9066 df-xneg 9864 df-xadd 9865 df-xmet 14176

This theorem is referenced by: (None)

W3C validator