Theorem psmettri2 24170

Description: Triangle inequality for the distance function of a pseudometric. (Contributed by Thierry Arnoux, 11-Feb-2018.)

Assertion

Ref	Expression
psmettri2	⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵)))

Proof of Theorem psmettri2

Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elfvex 6923	. . . . . . . 8 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝑋 ∈ V)
2		ispsmet 24165	. . . . . . . 8 ⊢ (𝑋 ∈ V → (𝐷 ∈ (PsMet‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑎 ∈ 𝑋 ((𝑎𝐷𝑎) = 0 ∧ ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏))))))
3	1, 2	syl 17	. . . . . . 7 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐷 ∈ (PsMet‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑎 ∈ 𝑋 ((𝑎𝐷𝑎) = 0 ∧ ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏))))))
4	3	ibi 267	. . . . . 6 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑎 ∈ 𝑋 ((𝑎𝐷𝑎) = 0 ∧ ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)))))
5	4	simprd 495	. . . . 5 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ∀𝑎 ∈ 𝑋 ((𝑎𝐷𝑎) = 0 ∧ ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏))))
6	5	r19.21bi 3242	. . . 4 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ 𝑋) → ((𝑎𝐷𝑎) = 0 ∧ ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏))))
7	6	simprd 495	. . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ 𝑋) → ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)))
8	7	ralrimiva 3140	. 2 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)))
9		oveq1 7412	. . . . 5 ⊢ (𝑎 = 𝐴 → (𝑎𝐷𝑏) = (𝐴𝐷𝑏))
10		oveq2 7413	. . . . . 6 ⊢ (𝑎 = 𝐴 → (𝑐𝐷𝑎) = (𝑐𝐷𝐴))
11	10	oveq1d 7420	. . . . 5 ⊢ (𝑎 = 𝐴 → ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)) = ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝑏)))
12	9, 11	breq12d 5154	. . . 4 ⊢ (𝑎 = 𝐴 → ((𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)) ↔ (𝐴𝐷𝑏) ≤ ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝑏))))
13		oveq2 7413	. . . . 5 ⊢ (𝑏 = 𝐵 → (𝐴𝐷𝑏) = (𝐴𝐷𝐵))
14		oveq2 7413	. . . . . 6 ⊢ (𝑏 = 𝐵 → (𝑐𝐷𝑏) = (𝑐𝐷𝐵))
15	14	oveq2d 7421	. . . . 5 ⊢ (𝑏 = 𝐵 → ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝑏)) = ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝐵)))
16	13, 15	breq12d 5154	. . . 4 ⊢ (𝑏 = 𝐵 → ((𝐴𝐷𝑏) ≤ ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝑏)) ↔ (𝐴𝐷𝐵) ≤ ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝐵))))
17		oveq1 7412	. . . . . 6 ⊢ (𝑐 = 𝐶 → (𝑐𝐷𝐴) = (𝐶𝐷𝐴))
18		oveq1 7412	. . . . . 6 ⊢ (𝑐 = 𝐶 → (𝑐𝐷𝐵) = (𝐶𝐷𝐵))
19	17, 18	oveq12d 7423	. . . . 5 ⊢ (𝑐 = 𝐶 → ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝐵)) = ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵)))
20	19	breq2d 5153	. . . 4 ⊢ (𝑐 = 𝐶 → ((𝐴𝐷𝐵) ≤ ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝐵)) ↔ (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵))))
21	12, 16, 20	rspc3v 3622	. . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)) → (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵))))
22	21	3comr 1122	. 2 ⊢ ((𝐶 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)) → (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵))))
23	8, 22	mpan9 506	1 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1084   = wceq 1533   ∈ wcel 2098  ∀wral 3055  Vcvv 3468   class class class wbr 5141   × cxp 5667  ⟶wf 6533  ‘cfv 6537  (class class class)co 7405  0cc0 11112  ℝ^*cxr 11251   ≤ cle 11253   +_𝑒 cxad 13096  PsMetcpsmet 21224

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697  ax-sep 5292  ax-nul 5299  ax-pow 5356  ax-pr 5420  ax-un 7722  ax-cnex 11168  ax-resscn 11169

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2704  df-cleq 2718  df-clel 2804  df-nfc 2879  df-ne 2935  df-ral 3056  df-rex 3065  df-rab 3427  df-v 3470  df-sbc 3773  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-pw 4599  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-br 5142  df-opab 5204  df-mpt 5225  df-id 5567  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-rn 5680  df-iota 6489  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7408  df-oprab 7409  df-mpo 7410  df-map 8824  df-xr 11256  df-psmet 21232

This theorem is referenced by:  psmetsym  24171  psmettri  24172  psmetge0  24173  psmetres2  24175  xblss2ps  24262  metideq  33403  metider  33404  pstmxmet  33407