Theorem xmettri2 24476

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 6915	. . . . . . 7 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝑋 ∈ dom ∞Met)
2		isxmet 24460	. . . . . . 7 ⊢ (𝑋 ∈ dom ∞Met → (𝐷 ∈ (∞Met‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))))
3	1, 2	syl 18	. . . . . 6 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝐷 ∈ (∞Met‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))))
4	3	ibi 270	. . . . 5 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))))
5		simpr 489	. . . . . 6 ⊢ ((((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))) → ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))
6	5	2ralimi 3133	. . . . 5 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))
7	4, 6	simpl2im 512	. . . 4 ⊢ (𝐷 ∈ (∞Met‘𝑋) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))
8		oveq1 7417	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥𝐷𝑦) = (𝐴𝐷𝑦))
9		oveq2 7418	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑧𝐷𝑥) = (𝑧𝐷𝐴))
10	9	oveq1d 7425	. . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)) = ((𝑧𝐷𝐴) +𝑒 (𝑧𝐷𝑦)))
11	8, 10	breq12d 5121	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)) ↔ (𝐴𝐷𝑦) ≤ ((𝑧𝐷𝐴) +𝑒 (𝑧𝐷𝑦))))
12		oveq2 7418	. . . . . 6 ⊢ (𝑦 = 𝐵 → (𝐴𝐷𝑦) = (𝐴𝐷𝐵))
13		oveq2 7418	. . . . . . 7 ⊢ (𝑦 = 𝐵 → (𝑧𝐷𝑦) = (𝑧𝐷𝐵))
14	13	oveq2d 7426	. . . . . 6 ⊢ (𝑦 = 𝐵 → ((𝑧𝐷𝐴) +𝑒 (𝑧𝐷𝑦)) = ((𝑧𝐷𝐴) +𝑒 (𝑧𝐷𝐵)))
15	12, 14	breq12d 5121	. . . . 5 ⊢ (𝑦 = 𝐵 → ((𝐴𝐷𝑦) ≤ ((𝑧𝐷𝐴) +𝑒 (𝑧𝐷𝑦)) ↔ (𝐴𝐷𝐵) ≤ ((𝑧𝐷𝐴) +𝑒 (𝑧𝐷𝐵))))
16		oveq1 7417	. . . . . . 7 ⊢ (𝑧 = 𝐶 → (𝑧𝐷𝐴) = (𝐶𝐷𝐴))
17		oveq1 7417	. . . . . . 7 ⊢ (𝑧 = 𝐶 → (𝑧𝐷𝐵) = (𝐶𝐷𝐵))
18	16, 17	oveq12d 7428	. . . . . 6 ⊢ (𝑧 = 𝐶 → ((𝑧𝐷𝐴) +𝑒 (𝑧𝐷𝐵)) = ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵)))
19	18	breq2d 5120	. . . . 5 ⊢ (𝑧 = 𝐶 → ((𝐴𝐷𝐵) ≤ ((𝑧𝐷𝐴) +𝑒 (𝑧𝐷𝐵)) ↔ (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵))))
20	11, 15, 19	rspc3v 3596	. . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)) → (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵))))
21	7, 20	syl5 35	. . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐷 ∈ (∞Met‘𝑋) → (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵))))
22	21	3comr 1141	. 2 ⊢ ((𝐶 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐷 ∈ (∞Met‘𝑋) → (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵))))
23	22	impcom 412	1 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1101   = wceq 1568   ∈ wcel 2141  ∀wral 3077   class class class wbr 5108   × cxp 5659  dom cdm 5661  ⟶wf 6532  ‘cfv 6536  (class class class)co 7410  0cc0 11099  ℝ^*cxr 11241   ≤ cle 11243   +_𝑒 cxad 13134  ∞Metcxmet 21486

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5256  ax-nul 5268  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-cnex 11155  ax-resscn 11156

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2095  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3415  df-v 3455  df-sbc 3744  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-map 8825  df-xr 11246  df-xmet 21494

This theorem is referenced by:  mettri2  24477  xmetge0  24480  xmetsym  24483  xmetpsmet  24484  xmettri  24487  xmetres2  24497  prdsxmetlem  24504  imasf1oxmet  24511  xblss2  24538  xmstri2  24602  comet  24649