MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  xmeteq0 Structured version   Visualization version   GIF version

Theorem xmeteq0 22056
Description: The value of an extended metric is zero iff its arguments are equal. (Contributed by Mario Carneiro, 20-Aug-2015.)
Assertion
Ref Expression
xmeteq0 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐴𝐷𝐵) = 0 ↔ 𝐴 = 𝐵))

Proof of Theorem xmeteq0
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elfvdm 6179 . . . . . . 7 (𝐷 ∈ (∞Met‘𝑋) → 𝑋 ∈ dom ∞Met)
2 isxmet 22042 . . . . . . 7 (𝑋 ∈ dom ∞Met → (𝐷 ∈ (∞Met‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥𝑋𝑦𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))))
31, 2syl 17 . . . . . 6 (𝐷 ∈ (∞Met‘𝑋) → (𝐷 ∈ (∞Met‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥𝑋𝑦𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))))
43ibi 256 . . . . 5 (𝐷 ∈ (∞Met‘𝑋) → (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥𝑋𝑦𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))))
54simprd 479 . . . 4 (𝐷 ∈ (∞Met‘𝑋) → ∀𝑥𝑋𝑦𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))
6 simpl 473 . . . . . 6 ((((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))) → ((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦))
76ralimi 2947 . . . . 5 (∀𝑦𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))) → ∀𝑦𝑋 ((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦))
87ralimi 2947 . . . 4 (∀𝑥𝑋𝑦𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))) → ∀𝑥𝑋𝑦𝑋 ((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦))
95, 8syl 17 . . 3 (𝐷 ∈ (∞Met‘𝑋) → ∀𝑥𝑋𝑦𝑋 ((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦))
10 oveq1 6614 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝐷𝑦) = (𝐴𝐷𝑦))
1110eqeq1d 2623 . . . . 5 (𝑥 = 𝐴 → ((𝑥𝐷𝑦) = 0 ↔ (𝐴𝐷𝑦) = 0))
12 eqeq1 2625 . . . . 5 (𝑥 = 𝐴 → (𝑥 = 𝑦𝐴 = 𝑦))
1311, 12bibi12d 335 . . . 4 (𝑥 = 𝐴 → (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ↔ ((𝐴𝐷𝑦) = 0 ↔ 𝐴 = 𝑦)))
14 oveq2 6615 . . . . . 6 (𝑦 = 𝐵 → (𝐴𝐷𝑦) = (𝐴𝐷𝐵))
1514eqeq1d 2623 . . . . 5 (𝑦 = 𝐵 → ((𝐴𝐷𝑦) = 0 ↔ (𝐴𝐷𝐵) = 0))
16 eqeq2 2632 . . . . 5 (𝑦 = 𝐵 → (𝐴 = 𝑦𝐴 = 𝐵))
1715, 16bibi12d 335 . . . 4 (𝑦 = 𝐵 → (((𝐴𝐷𝑦) = 0 ↔ 𝐴 = 𝑦) ↔ ((𝐴𝐷𝐵) = 0 ↔ 𝐴 = 𝐵)))
1813, 17rspc2v 3307 . . 3 ((𝐴𝑋𝐵𝑋) → (∀𝑥𝑋𝑦𝑋 ((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) → ((𝐴𝐷𝐵) = 0 ↔ 𝐴 = 𝐵)))
199, 18syl5com 31 . 2 (𝐷 ∈ (∞Met‘𝑋) → ((𝐴𝑋𝐵𝑋) → ((𝐴𝐷𝐵) = 0 ↔ 𝐴 = 𝐵)))
20193impib 1259 1 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴𝑋𝐵𝑋) → ((𝐴𝐷𝐵) = 0 ↔ 𝐴 = 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384  w3a 1036   = wceq 1480  wcel 1987  wral 2907   class class class wbr 4615   × cxp 5074  dom cdm 5076  wf 5845  cfv 5849  (class class class)co 6607  0cc0 9883  *cxr 10020  cle 10022   +𝑒 cxad 11891  ∞Metcxmt 19653
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4743  ax-nul 4751  ax-pow 4805  ax-pr 4869  ax-un 6905  ax-cnex 9939  ax-resscn 9940
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3188  df-sbc 3419  df-dif 3559  df-un 3561  df-in 3563  df-ss 3570  df-nul 3894  df-if 4061  df-pw 4134  df-sn 4151  df-pr 4153  df-op 4157  df-uni 4405  df-br 4616  df-opab 4676  df-mpt 4677  df-id 4991  df-xp 5082  df-rel 5083  df-cnv 5084  df-co 5085  df-dm 5086  df-rn 5087  df-iota 5812  df-fun 5851  df-fn 5852  df-f 5853  df-fv 5857  df-ov 6610  df-oprab 6611  df-mpt2 6612  df-map 7807  df-xr 10025  df-xmet 19661
This theorem is referenced by:  meteq0  22057  xmet0  22060  xmetgt0  22076  xmetres2  22079  prdsxmetlem  22086  imasf1oxmet  22093  xblss2  22120  xmseq0  22182  comet  22231
  Copyright terms: Public domain W3C validator