Theorem metidv 33888

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 638	. . . . 5 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) ↔ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)))
4		oveq12 7398	. . . . . 6 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → (𝑎𝐷𝑏) = (𝐴𝐷𝐵))
5	4	eqeq1d 2732	. . . . 5 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → ((𝑎𝐷𝑏) = 0 ↔ (𝐴𝐷𝐵) = 0))
6	3, 5	anbi12d 632	. . . 4 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → (((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) ∧ (𝑎𝐷𝑏) = 0) ↔ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐴𝐷𝐵) = 0)))
7		eqid 2730	. . . 4 ⊢ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) ∧ (𝑎𝐷𝑏) = 0)} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) ∧ (𝑎𝐷𝑏) = 0)}
8	6, 7	brabga 5496	. . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴{⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) ∧ (𝑎𝐷𝑏) = 0)}𝐵 ↔ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐴𝐷𝐵) = 0)))
9	8	adantl 481	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴{⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) ∧ (𝑎𝐷𝑏) = 0)}𝐵 ↔ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐴𝐷𝐵) = 0)))
10		metidval 33886	. . . 4 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (~Met‘𝐷) = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) ∧ (𝑎𝐷𝑏) = 0)})
11	10	adantr 480	. . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (~Met‘𝐷) = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) ∧ (𝑎𝐷𝑏) = 0)})
12	11	breqd 5120	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴(~Met‘𝐷)𝐵 ↔ 𝐴{⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) ∧ (𝑎𝐷𝑏) = 0)}𝐵))
13		ibar 528	. . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵) = 0 ↔ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐴𝐷𝐵) = 0)))
14	13	adantl 481	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝐴𝐷𝐵) = 0 ↔ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐴𝐷𝐵) = 0)))
15	9, 12, 14	3bitr4d 311	1 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴(~Met‘𝐷)𝐵 ↔ (𝐴𝐷𝐵) = 0))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109   class class class wbr 5109  {copab 5171  ‘cfv 6513  (class class class)co 7389  0cc0 11074  PsMetcpsmet 21254  ~_Metcmetid 33882

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5253  ax-nul 5263  ax-pow 5322  ax-pr 5389  ax-un 7713  ax-cnex 11130  ax-resscn 11131

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-sbc 3756  df-csb 3865  df-dif 3919  df-un 3921  df-in 3923  df-ss 3933  df-nul 4299  df-if 4491  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-br 5110  df-opab 5172  df-mpt 5191  df-id 5535  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-iota 6466  df-fun 6515  df-fn 6516  df-f 6517  df-fv 6521  df-ov 7392  df-oprab 7393  df-mpo 7394  df-map 8803  df-xr 11218  df-psmet 21262  df-metid 33884

This theorem is referenced by:  metideq  33889  metider  33890  pstmfval  33892  pstmxmet  33893