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

Theorem psmettri2 15431
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.
StepHypRef Expression
1 df-psmet 14882 . . . . . . . . 9 PsMet = (𝑑 ∈ V ↦ {𝑒 ∈ (ℝ*𝑚 (𝑑 × 𝑑)) ∣ ∀𝑎𝑑 ((𝑎𝑒𝑎) = 0 ∧ ∀𝑏𝑑𝑐𝑑 (𝑎𝑒𝑏) ≤ ((𝑐𝑒𝑎) +𝑒 (𝑐𝑒𝑏)))})
21mptrcl 5788 . . . . . . . 8 (𝐷 ∈ (PsMet‘𝑋) → 𝑋 ∈ V)
3 ispsmet 15426 . . . . . . . 8 (𝑋 ∈ V → (𝐷 ∈ (PsMet‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑎𝑋 ((𝑎𝐷𝑎) = 0 ∧ ∀𝑏𝑋𝑐𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏))))))
42, 3syl 14 . . . . . . 7 (𝐷 ∈ (PsMet‘𝑋) → (𝐷 ∈ (PsMet‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑎𝑋 ((𝑎𝐷𝑎) = 0 ∧ ∀𝑏𝑋𝑐𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏))))))
54ibi 176 . . . . . 6 (𝐷 ∈ (PsMet‘𝑋) → (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑎𝑋 ((𝑎𝐷𝑎) = 0 ∧ ∀𝑏𝑋𝑐𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)))))
65simprd 114 . . . . 5 (𝐷 ∈ (PsMet‘𝑋) → ∀𝑎𝑋 ((𝑎𝐷𝑎) = 0 ∧ ∀𝑏𝑋𝑐𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏))))
76r19.21bi 2638 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎𝑋) → ((𝑎𝐷𝑎) = 0 ∧ ∀𝑏𝑋𝑐𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏))))
87simprd 114 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎𝑋) → ∀𝑏𝑋𝑐𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)))
98ralrimiva 2623 . 2 (𝐷 ∈ (PsMet‘𝑋) → ∀𝑎𝑋𝑏𝑋𝑐𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)))
10 oveq1 6092 . . . . 5 (𝑎 = 𝐴 → (𝑎𝐷𝑏) = (𝐴𝐷𝑏))
11 oveq2 6093 . . . . . 6 (𝑎 = 𝐴 → (𝑐𝐷𝑎) = (𝑐𝐷𝐴))
1211oveq1d 6100 . . . . 5 (𝑎 = 𝐴 → ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)) = ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝑏)))
1310, 12breq12d 4143 . . . 4 (𝑎 = 𝐴 → ((𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)) ↔ (𝐴𝐷𝑏) ≤ ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝑏))))
14 oveq2 6093 . . . . 5 (𝑏 = 𝐵 → (𝐴𝐷𝑏) = (𝐴𝐷𝐵))
15 oveq2 6093 . . . . . 6 (𝑏 = 𝐵 → (𝑐𝐷𝑏) = (𝑐𝐷𝐵))
1615oveq2d 6101 . . . . 5 (𝑏 = 𝐵 → ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝑏)) = ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝐵)))
1714, 16breq12d 4143 . . . 4 (𝑏 = 𝐵 → ((𝐴𝐷𝑏) ≤ ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝑏)) ↔ (𝐴𝐷𝐵) ≤ ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝐵))))
18 oveq1 6092 . . . . . 6 (𝑐 = 𝐶 → (𝑐𝐷𝐴) = (𝐶𝐷𝐴))
19 oveq1 6092 . . . . . 6 (𝑐 = 𝐶 → (𝑐𝐷𝐵) = (𝐶𝐷𝐵))
2018, 19oveq12d 6103 . . . . 5 (𝑐 = 𝐶 → ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝐵)) = ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵)))
2120breq2d 4142 . . . 4 (𝑐 = 𝐶 → ((𝐴𝐷𝐵) ≤ ((𝑐𝐷𝐴) +𝑒 (𝑐𝐷𝐵)) ↔ (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵))))
2213, 17, 21rspc3v 2946 . . 3 ((𝐴𝑋𝐵𝑋𝐶𝑋) → (∀𝑎𝑋𝑏𝑋𝑐𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)) → (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵))))
23223comr 1242 . 2 ((𝐶𝑋𝐴𝑋𝐵𝑋) → (∀𝑎𝑋𝑏𝑋𝑐𝑋 (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)) → (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵))))
249, 23mpan9 281 1 ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐶𝑋𝐴𝑋𝐵𝑋)) → (𝐴𝐷𝐵) ≤ ((𝐶𝐷𝐴) +𝑒 (𝐶𝐷𝐵)))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104  wb 105  w3a 1009   = wceq 1402  wcel 2209  wral 2528  {crab 2532  Vcvv 2821   class class class wbr 4130   × cxp 4772  wf 5373  cfv 5377  (class class class)co 6085  𝑚 cmap 6922  0cc0 8179  *cxr 8359  cle 8361   +𝑒 cxad 10174  PsMetcpsmet 14874
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-map 6924  df-pnf 8362  df-mnf 8363  df-xr 8364  df-psmet 14882
This theorem is used by:  psmetsym  15432  psmettri  15433  psmetge0  15434  psmetres2  15436  xblss2ps  15507
  Copyright terms: Public domain W3C validator