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

Theorem psmetsym 14508
Description: The distance function of a pseudometric is symmetrical. (Contributed by Thierry Arnoux, 7-Feb-2018.)
Assertion
Ref Expression
psmetsym ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐷𝐵) = (𝐵𝐷𝐴))

Proof of Theorem psmetsym
StepHypRef Expression
1 simp1 999 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → 𝐷 ∈ (PsMet‘𝑋))
2 simp3 1001 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → 𝐵𝑋)
3 simp2 1000 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → 𝐴𝑋)
4 psmettri2 14507 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐵𝑋𝐴𝑋𝐵𝑋)) → (𝐴𝐷𝐵) ≤ ((𝐵𝐷𝐴) +𝑒 (𝐵𝐷𝐵)))
51, 2, 3, 2, 4syl13anc 1251 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐷𝐵) ≤ ((𝐵𝐷𝐴) +𝑒 (𝐵𝐷𝐵)))
6 psmet0 14506 . . . . . 6 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐵𝑋) → (𝐵𝐷𝐵) = 0)
763adant2 1018 . . . . 5 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐵𝐷𝐵) = 0)
87oveq2d 5935 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐵𝐷𝐴) +𝑒 (𝐵𝐷𝐵)) = ((𝐵𝐷𝐴) +𝑒 0))
9 psmetcl 14505 . . . . . 6 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐵𝑋𝐴𝑋) → (𝐵𝐷𝐴) ∈ ℝ*)
10 xaddid1 9931 . . . . . 6 ((𝐵𝐷𝐴) ∈ ℝ* → ((𝐵𝐷𝐴) +𝑒 0) = (𝐵𝐷𝐴))
119, 10syl 14 . . . . 5 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐵𝑋𝐴𝑋) → ((𝐵𝐷𝐴) +𝑒 0) = (𝐵𝐷𝐴))
12113com23 1211 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐵𝐷𝐴) +𝑒 0) = (𝐵𝐷𝐴))
138, 12eqtrd 2226 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐵𝐷𝐴) +𝑒 (𝐵𝐷𝐵)) = (𝐵𝐷𝐴))
145, 13breqtrd 4056 . 2 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐷𝐵) ≤ (𝐵𝐷𝐴))
15 psmettri2 14507 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑋)) → (𝐵𝐷𝐴) ≤ ((𝐴𝐷𝐵) +𝑒 (𝐴𝐷𝐴)))
161, 3, 2, 3, 15syl13anc 1251 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐵𝐷𝐴) ≤ ((𝐴𝐷𝐵) +𝑒 (𝐴𝐷𝐴)))
17 psmet0 14506 . . . . . 6 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋) → (𝐴𝐷𝐴) = 0)
18173adant3 1019 . . . . 5 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐷𝐴) = 0)
1918oveq2d 5935 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐴𝐷𝐵) +𝑒 (𝐴𝐷𝐴)) = ((𝐴𝐷𝐵) +𝑒 0))
20 psmetcl 14505 . . . . 5 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐷𝐵) ∈ ℝ*)
21 xaddid1 9931 . . . . 5 ((𝐴𝐷𝐵) ∈ ℝ* → ((𝐴𝐷𝐵) +𝑒 0) = (𝐴𝐷𝐵))
2220, 21syl 14 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐴𝐷𝐵) +𝑒 0) = (𝐴𝐷𝐵))
2319, 22eqtrd 2226 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐴𝐷𝐵) +𝑒 (𝐴𝐷𝐴)) = (𝐴𝐷𝐵))
2416, 23breqtrd 4056 . 2 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐵𝐷𝐴) ≤ (𝐴𝐷𝐵))
2593com23 1211 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐵𝐷𝐴) ∈ ℝ*)
26 xrletri3 9873 . . 3 (((𝐴𝐷𝐵) ∈ ℝ* ∧ (𝐵𝐷𝐴) ∈ ℝ*) → ((𝐴𝐷𝐵) = (𝐵𝐷𝐴) ↔ ((𝐴𝐷𝐵) ≤ (𝐵𝐷𝐴) ∧ (𝐵𝐷𝐴) ≤ (𝐴𝐷𝐵))))
2720, 25, 26syl2anc 411 . 2 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐴𝐷𝐵) = (𝐵𝐷𝐴) ↔ ((𝐴𝐷𝐵) ≤ (𝐵𝐷𝐴) ∧ (𝐵𝐷𝐴) ≤ (𝐴𝐷𝐵))))
2814, 24, 27mpbir2and 946 1 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐷𝐵) = (𝐵𝐷𝐴))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 980   = wceq 1364  wcel 2164   class class class wbr 4030  cfv 5255  (class class class)co 5919  0cc0 7874  *cxr 8055  cle 8057   +𝑒 cxad 9839  PsMetcpsmet 14034
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-cnex 7965  ax-resscn 7966  ax-1re 7968  ax-addrcl 7971  ax-0id 7982  ax-rnegex 7983  ax-pre-ltirr 7986  ax-pre-apti 7989
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-if 3559  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-fv 5263  df-ov 5922  df-oprab 5923  df-mpo 5924  df-map 6706  df-pnf 8058  df-mnf 8059  df-xr 8060  df-ltxr 8061  df-le 8062  df-xadd 9842  df-psmet 14042
This theorem is referenced by:  psmettri  14509  distspace  14514  elbl3ps  14573  blssps  14606
  Copyright terms: Public domain W3C validator