Theorem psmettri2 24541

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 6917	. . . . . . . 8 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝑋 ∈ V)
2		ispsmet 24536	. . . . . . . 8 ⊢ (𝑋 ∈ V → (𝐷 ∈ (PsMet‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑎 ∈ 𝑋 ((𝑎𝐷𝑎) = 0 ∧ ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏))))))
3	1, 2	syl 18	. . . . . . 7 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐷 ∈ (PsMet‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑎 ∈ 𝑋 ((𝑎𝐷𝑎) = 0 ∧ ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏))))))
4	3	ibi 270	. . . . . 6 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑎 ∈ 𝑋 ((𝑎𝐷𝑎) = 0 ∧ ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)))))
5	4	simprd 501	. . . . 5 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ∀𝑎 ∈ 𝑋 ((𝑎𝐷𝑎) = 0 ∧ ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏))))
6	5	r19.21bi 3256	. . . 4 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ 𝑋) → ((𝑎𝐷𝑎) = 0 ∧ ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏))))
7	6	simprd 501	. . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ 𝑋) → ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)))
8	7	ralrimiva 3156	. 2 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)))
9		oveq1 7424	. . . . 5 ⊢ (𝑎 = 𝐴 → (𝑎𝐷𝑏) = (𝐴𝐷𝑏))
10		oveq2 7425	. . . . . 6 ⊢ (𝑎 = 𝐴 → (𝑐𝐷𝑎) = (𝑐𝐷𝐴))
11	10	oveq1d 7432	. . . . 5 ⊢ (𝑎 = 𝐴 → ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)) = ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝑏)))
12	9, 11	breq12d 5120	. . . 4 ⊢ (𝑎 = 𝐴 → ((𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)) ↔ (𝐴𝐷𝑏) ≤ ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝑏))))
13		oveq2 7425	. . . . 5 ⊢ (𝑏 = 𝐵 → (𝐴𝐷𝑏) = (𝐴𝐷𝐵))
14		oveq2 7425	. . . . . 6 ⊢ (𝑏 = 𝐵 → (𝑐𝐷𝑏) = (𝑐𝐷𝐵))
15	14	oveq2d 7433	. . . . 5 ⊢ (𝑏 = 𝐵 → ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝑏)) = ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝐵)))
16	13, 15	breq12d 5120	. . . 4 ⊢ (𝑏 = 𝐵 → ((𝐴𝐷𝑏) ≤ ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝑏)) ↔ (𝐴𝐷𝐵) ≤ ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝐵))))
17		oveq1 7424	. . . . . 6 ⊢ (𝑐 = 𝐶 → (𝑐𝐷𝐴) = (𝐶𝐷𝐴))
18		oveq1 7424	. . . . . 6 ⊢ (𝑐 = 𝐶 → (𝑐𝐷𝐵) = (𝐶𝐷𝐵))
19	17, 18	oveq12d 7435	. . . . 5 ⊢ (𝑐 = 𝐶 → ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝐵)) = ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵)))
20	19	breq2d 5119	. . . 4 ⊢ (𝑐 = 𝐶 → ((𝐴𝐷𝐵) ≤ ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝐵)) ↔ (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵))))
21	12, 16, 20	rspc3v 3595	. . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)) → (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵))))
22	21	3comr 1143	. 2 ⊢ ((𝐶 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)) → (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵))))
23	8, 22	mpan9 516	1 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3078  Vcvv 3453   class class class wbr 5107   × cxp 5657  ⟶wf 6533  ‘cfv 6537  (class class class)co 7417  0cc0 11128  ℝ^*cxr 11270   ≤ cle 11272   +_𝑒 cxad 13165  PsMetcpsmet 21575

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740  ax-cnex 11184  ax-resscn 11185

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-map 8832  df-xr 11275  df-psmet 21583

This theorem is used by:  psmetsym  24542  psmettri  24543  psmetge0  24544  psmetres2  24546  xblss2ps  24633  metideq  34411  metider  34412  pstmxmet  34415