Theorem metidv 33765

Description: 𝐴 and 𝐵 identify by the metric 𝐷 if their distance is zero. (Contributed by Thierry Arnoux, 7-Feb-2018.)

Assertion

Ref	Expression
metidv	⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴(~Met‘𝐷)𝐵 ↔ (𝐴𝐷𝐵) = 0))

Proof of Theorem metidv

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1 2817	. . . . . 6 ⊢ (𝑎 = 𝐴 → (𝑎 ∈ 𝑋 ↔ 𝐴 ∈ 𝑋))
2		eleq1 2817	. . . . . 6 ⊢ (𝑏 = 𝐵 → (𝑏 ∈ 𝑋 ↔ 𝐵 ∈ 𝑋))
3	1, 2	bi2anan9 636	. . . . 5 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) ↔ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)))
4		oveq12 7439	. . . . . 6 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → (𝑎𝐷𝑏) = (𝐴𝐷𝐵))
5	4	eqeq1d 2731	. . . . 5 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → ((𝑎𝐷𝑏) = 0 ↔ (𝐴𝐷𝐵) = 0))
6	3, 5	anbi12d 630	. . . 4 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → (((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) ∧ (𝑎𝐷𝑏) = 0) ↔ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐴𝐷𝐵) = 0)))
7		eqid 2729	. . . 4 ⊢ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) ∧ (𝑎𝐷𝑏) = 0)} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) ∧ (𝑎𝐷𝑏) = 0)}
8	6, 7	brabga 5544	. . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴{⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) ∧ (𝑎𝐷𝑏) = 0)}𝐵 ↔ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐴𝐷𝐵) = 0)))
9	8	adantl 480	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴{⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) ∧ (𝑎𝐷𝑏) = 0)}𝐵 ↔ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐴𝐷𝐵) = 0)))
10		metidval 33763	. . . 4 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (~Met‘𝐷) = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) ∧ (𝑎𝐷𝑏) = 0)})
11	10	adantr 479	. . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (~Met‘𝐷) = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) ∧ (𝑎𝐷𝑏) = 0)})
12	11	breqd 5167	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴(~Met‘𝐷)𝐵 ↔ 𝐴{⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) ∧ (𝑎𝐷𝑏) = 0)}𝐵))
13		ibar 527	. . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵) = 0 ↔ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐴𝐷𝐵) = 0)))
14	13	adantl 480	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝐴𝐷𝐵) = 0 ↔ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐴𝐷𝐵) = 0)))
15	9, 12, 14	3bitr4d 310	1 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴(~Met‘𝐷)𝐵 ↔ (𝐴𝐷𝐵) = 0))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   = wceq 1534   ∈ wcel 2100   class class class wbr 5156  {copab 5218  ‘cfv 6558  (class class class)co 7430  0cc0 11165  PsMetcpsmet 21349  ~_Metcmetid 33759

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2102  ax-9 2110  ax-10 2133  ax-11 2150  ax-12 2170  ax-ext 2700  ax-sep 5307  ax-nul 5314  ax-pow 5373  ax-pr 5437  ax-un 7751  ax-cnex 11221  ax-resscn 11222

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2062  df-mo 2532  df-eu 2561  df-clab 2707  df-cleq 2721  df-clel 2806  df-nfc 2881  df-ne 2934  df-ral 3055  df-rex 3064  df-rab 3429  df-v 3474  df-sbc 3789  df-csb 3905  df-dif 3962  df-un 3964  df-in 3966  df-ss 3976  df-nul 4336  df-if 4537  df-pw 4612  df-sn 4637  df-pr 4639  df-op 4643  df-uni 4919  df-br 5157  df-opab 5219  df-mpt 5240  df-id 5584  df-xp 5692  df-rel 5693  df-cnv 5694  df-co 5695  df-dm 5696  df-rn 5697  df-iota 6510  df-fun 6560  df-fn 6561  df-f 6562  df-fv 6566  df-ov 7433  df-oprab 7434  df-mpo 7435  df-map 8865  df-xr 11309  df-psmet 21357  df-metid 33761

This theorem is referenced by:  metideq  33766  metider  33767  pstmfval  33769  pstmxmet  33770