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

Theorem psmetsym 14649
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 14648 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐵𝑋𝐴𝑋𝐵𝑋)) → (𝐴𝐷𝐵) ≤ ((𝐵𝐷𝐴) +𝑒 (𝐵𝐷𝐵)))
51, 2, 3, 2, 4syl13anc 1251 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐷𝐵) ≤ ((𝐵𝐷𝐴) +𝑒 (𝐵𝐷𝐵)))
6 psmet0 14647 . . . . . 6 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐵𝑋) → (𝐵𝐷𝐵) = 0)
763adant2 1018 . . . . 5 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐵𝐷𝐵) = 0)
87oveq2d 5941 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐵𝐷𝐴) +𝑒 (𝐵𝐷𝐵)) = ((𝐵𝐷𝐴) +𝑒 0))
9 psmetcl 14646 . . . . . 6 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐵𝑋𝐴𝑋) → (𝐵𝐷𝐴) ∈ ℝ*)
10 xaddid1 9954 . . . . . 6 ((𝐵𝐷𝐴) ∈ ℝ* → ((𝐵𝐷𝐴) +𝑒 0) = (𝐵𝐷𝐴))
119, 10syl 14 . . . . 5 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐵𝑋𝐴𝑋) → ((𝐵𝐷𝐴) +𝑒 0) = (𝐵𝐷𝐴))
12113com23 1211 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐵𝐷𝐴) +𝑒 0) = (𝐵𝐷𝐴))
138, 12eqtrd 2229 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐵𝐷𝐴) +𝑒 (𝐵𝐷𝐵)) = (𝐵𝐷𝐴))
145, 13breqtrd 4060 . 2 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐷𝐵) ≤ (𝐵𝐷𝐴))
15 psmettri2 14648 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑋)) → (𝐵𝐷𝐴) ≤ ((𝐴𝐷𝐵) +𝑒 (𝐴𝐷𝐴)))
161, 3, 2, 3, 15syl13anc 1251 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐵𝐷𝐴) ≤ ((𝐴𝐷𝐵) +𝑒 (𝐴𝐷𝐴)))
17 psmet0 14647 . . . . . 6 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋) → (𝐴𝐷𝐴) = 0)
18173adant3 1019 . . . . 5 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐷𝐴) = 0)
1918oveq2d 5941 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐴𝐷𝐵) +𝑒 (𝐴𝐷𝐴)) = ((𝐴𝐷𝐵) +𝑒 0))
20 psmetcl 14646 . . . . 5 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐷𝐵) ∈ ℝ*)
21 xaddid1 9954 . . . . 5 ((𝐴𝐷𝐵) ∈ ℝ* → ((𝐴𝐷𝐵) +𝑒 0) = (𝐴𝐷𝐵))
2220, 21syl 14 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐴𝐷𝐵) +𝑒 0) = (𝐴𝐷𝐵))
2319, 22eqtrd 2229 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐴𝐷𝐵) +𝑒 (𝐴𝐷𝐴)) = (𝐴𝐷𝐵))
2416, 23breqtrd 4060 . 2 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐵𝐷𝐴) ≤ (𝐴𝐷𝐵))
2593com23 1211 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → (𝐵𝐷𝐴) ∈ ℝ*)
26 xrletri3 9896 . . 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 2167   class class class wbr 4034  cfv 5259  (class class class)co 5925  0cc0 7896  *cxr 8077  cle 8079   +𝑒 cxad 9862  PsMetcpsmet 14167
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1re 7990  ax-addrcl 7993  ax-0id 8004  ax-rnegex 8005  ax-pre-ltirr 8008  ax-pre-apti 8011
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 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-if 3563  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-fv 5267  df-ov 5928  df-oprab 5929  df-mpo 5930  df-map 6718  df-pnf 8080  df-mnf 8081  df-xr 8082  df-ltxr 8083  df-le 8084  df-xadd 9865  df-psmet 14175
This theorem is referenced by:  psmettri  14650  distspace  14655  elbl3ps  14714  blssps  14747
  Copyright terms: Public domain W3C validator