Theorem xmettri2 24228

Description: Triangle inequality for the distance function of an extended metric. (Contributed by Mario Carneiro, 20-Aug-2015.)

Assertion

Ref	Expression
xmettri2	⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵)))

Proof of Theorem xmettri2

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elfvdm 6895	. . . . . . 7 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝑋 ∈ dom ∞Met)
2		isxmet 24212	. . . . . . 7 ⊢ (𝑋 ∈ dom ∞Met → (𝐷 ∈ (∞Met‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))))
3	1, 2	syl 17	. . . . . 6 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝐷 ∈ (∞Met‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))))
4	3	ibi 267	. . . . 5 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))))
5		simpr 484	. . . . . 6 ⊢ ((((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))) → ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))
6	5	2ralimi 3103	. . . . 5 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))
7	4, 6	simpl2im 503	. . . 4 ⊢ (𝐷 ∈ (∞Met‘𝑋) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))
8		oveq1 7394	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥𝐷𝑦) = (𝐴𝐷𝑦))
9		oveq2 7395	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑧𝐷𝑥) = (𝑧𝐷𝐴))
10	9	oveq1d 7402	. . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)) = ((𝑧𝐷𝐴) +𝑒 (𝑧𝐷𝑦)))
11	8, 10	breq12d 5120	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)) ↔ (𝐴𝐷𝑦) ≤ ((𝑧𝐷𝐴) +𝑒 (𝑧𝐷𝑦))))
12		oveq2 7395	. . . . . 6 ⊢ (𝑦 = 𝐵 → (𝐴𝐷𝑦) = (𝐴𝐷𝐵))
13		oveq2 7395	. . . . . . 7 ⊢ (𝑦 = 𝐵 → (𝑧𝐷𝑦) = (𝑧𝐷𝐵))
14	13	oveq2d 7403	. . . . . 6 ⊢ (𝑦 = 𝐵 → ((𝑧𝐷𝐴) +𝑒 (𝑧𝐷𝑦)) = ((𝑧𝐷𝐴) +𝑒 (𝑧𝐷𝐵)))
15	12, 14	breq12d 5120	. . . . 5 ⊢ (𝑦 = 𝐵 → ((𝐴𝐷𝑦) ≤ ((𝑧𝐷𝐴) +𝑒 (𝑧𝐷𝑦)) ↔ (𝐴𝐷𝐵) ≤ ((𝑧𝐷𝐴) +𝑒 (𝑧𝐷𝐵))))
16		oveq1 7394	. . . . . . 7 ⊢ (𝑧 = 𝐶 → (𝑧𝐷𝐴) = (𝐶𝐷𝐴))
17		oveq1 7394	. . . . . . 7 ⊢ (𝑧 = 𝐶 → (𝑧𝐷𝐵) = (𝐶𝐷𝐵))
18	16, 17	oveq12d 7405	. . . . . 6 ⊢ (𝑧 = 𝐶 → ((𝑧𝐷𝐴) +𝑒 (𝑧𝐷𝐵)) = ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵)))
19	18	breq2d 5119	. . . . 5 ⊢ (𝑧 = 𝐶 → ((𝐴𝐷𝐵) ≤ ((𝑧𝐷𝐴) +𝑒 (𝑧𝐷𝐵)) ↔ (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵))))
20	11, 15, 19	rspc3v 3604	. . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)) → (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵))))
21	7, 20	syl5 34	. . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐷 ∈ (∞Met‘𝑋) → (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵))))
22	21	3comr 1125	. 2 ⊢ ((𝐶 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐷 ∈ (∞Met‘𝑋) → (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵))))
23	22	impcom 407	1 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ∀wral 3044   class class class wbr 5107   × cxp 5636  dom cdm 5638  ⟶wf 6507  ‘cfv 6511  (class class class)co 7387  0cc0 11068  ℝ^*cxr 11207   ≤ cle 11209   +_𝑒 cxad 13070  ∞Metcxmet 21249

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711  ax-cnex 11124  ax-resscn 11125

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-map 8801  df-xr 11212  df-xmet 21257

This theorem is referenced by:  mettri2  24229  xmetge0  24232  xmetsym  24235  xmetpsmet  24236  xmettri  24239  xmetres2  24249  prdsxmetlem  24256  imasf1oxmet  24263  xblss2  24290  xmstri2  24354  comet  24401