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

Theorem psmetsym 15082
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 1023 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → 𝐷 ∈ (PsMet‘𝑋))
2 simp3 1025 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → 𝐵𝑋)
3 simp2 1024 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → 𝐴𝑋)
4 psmettri2 15081 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐵𝑋𝐴𝑋𝐵𝑋)) → (𝐴𝐷𝐵) ≤ ((𝐵𝐷𝐴) +𝑒 (𝐵𝐷𝐵)))
51, 2, 3, 2, 4syl13anc 1275 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐷𝐵) ≤ ((𝐵𝐷𝐴) +𝑒 (𝐵𝐷𝐵)))
6 psmet0 15080 . . . . . 6 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐵𝑋) → (𝐵𝐷𝐵) = 0)
763adant2 1042 . . . . 5 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐵𝐷𝐵) = 0)
87oveq2d 6039 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐵𝐷𝐴) +𝑒 (𝐵𝐷𝐵)) = ((𝐵𝐷𝐴) +𝑒 0))
9 psmetcl 15079 . . . . . 6 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐵𝑋𝐴𝑋) → (𝐵𝐷𝐴) ∈ ℝ*)
10 xaddid1 10102 . . . . . 6 ((𝐵𝐷𝐴) ∈ ℝ* → ((𝐵𝐷𝐴) +𝑒 0) = (𝐵𝐷𝐴))
119, 10syl 14 . . . . 5 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐵𝑋𝐴𝑋) → ((𝐵𝐷𝐴) +𝑒 0) = (𝐵𝐷𝐴))
12113com23 1235 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐵𝐷𝐴) +𝑒 0) = (𝐵𝐷𝐴))
138, 12eqtrd 2263 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐵𝐷𝐴) +𝑒 (𝐵𝐷𝐵)) = (𝐵𝐷𝐴))
145, 13breqtrd 4115 . 2 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐷𝐵) ≤ (𝐵𝐷𝐴))
15 psmettri2 15081 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑋)) → (𝐵𝐷𝐴) ≤ ((𝐴𝐷𝐵) +𝑒 (𝐴𝐷𝐴)))
161, 3, 2, 3, 15syl13anc 1275 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐵𝐷𝐴) ≤ ((𝐴𝐷𝐵) +𝑒 (𝐴𝐷𝐴)))
17 psmet0 15080 . . . . . 6 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋) → (𝐴𝐷𝐴) = 0)
18173adant3 1043 . . . . 5 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐷𝐴) = 0)
1918oveq2d 6039 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐴𝐷𝐵) +𝑒 (𝐴𝐷𝐴)) = ((𝐴𝐷𝐵) +𝑒 0))
20 psmetcl 15079 . . . . 5 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐷𝐵) ∈ ℝ*)
21 xaddid1 10102 . . . . 5 ((𝐴𝐷𝐵) ∈ ℝ* → ((𝐴𝐷𝐵) +𝑒 0) = (𝐴𝐷𝐵))
2220, 21syl 14 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐴𝐷𝐵) +𝑒 0) = (𝐴𝐷𝐵))
2319, 22eqtrd 2263 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐴𝐷𝐵) +𝑒 (𝐴𝐷𝐴)) = (𝐴𝐷𝐵))
2416, 23breqtrd 4115 . 2 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐵𝐷𝐴) ≤ (𝐴𝐷𝐵))
2593com23 1235 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐵𝐷𝐴) ∈ ℝ*)
26 xrletri3 10044 . . 3 (((𝐴𝐷𝐵) ∈ ℝ* ∧ (𝐵𝐷𝐴) ∈ ℝ*) → ((𝐴𝐷𝐵) = (𝐵𝐷𝐴) ↔ ((𝐴𝐷𝐵) ≤ (𝐵𝐷𝐴) ∧ (𝐵𝐷𝐴) ≤ (𝐴𝐷𝐵))))
2720, 25, 26syl2anc 411 . 2 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐴𝐷𝐵) = (𝐵𝐷𝐴) ↔ ((𝐴𝐷𝐵) ≤ (𝐵𝐷𝐴) ∧ (𝐵𝐷𝐴) ≤ (𝐴𝐷𝐵))))
2814, 24, 27mpbir2and 952 1 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐷𝐵) = (𝐵𝐷𝐴))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1004   = wceq 1397  wcel 2201   class class class wbr 4089  cfv 5328  (class class class)co 6023  0cc0 8037  *cxr 8218  cle 8220   +𝑒 cxad 10010  PsMetcpsmet 14573
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2203  ax-14 2204  ax-ext 2212  ax-sep 4208  ax-pow 4266  ax-pr 4301  ax-un 4532  ax-setind 4637  ax-cnex 8128  ax-resscn 8129  ax-1re 8131  ax-addrcl 8134  ax-0id 8145  ax-rnegex 8146  ax-pre-ltirr 8149  ax-pre-apti 8152
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ne 2402  df-nel 2497  df-ral 2514  df-rex 2515  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-if 3605  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-br 4090  df-opab 4152  df-mpt 4153  df-id 4392  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-res 4739  df-ima 4740  df-iota 5288  df-fun 5330  df-fn 5331  df-f 5332  df-fv 5336  df-ov 6026  df-oprab 6027  df-mpo 6028  df-map 6824  df-pnf 8221  df-mnf 8222  df-xr 8223  df-ltxr 8224  df-le 8225  df-xadd 10013  df-psmet 14581
This theorem is referenced by:  psmettri  15083  distspace  15088  elbl3ps  15147  blssps  15180
  Copyright terms: Public domain W3C validator