Theorem metidval 34402

Description: Value of the metric identification relation. (Contributed by Thierry Arnoux, 7-Feb-2018.)

Assertion

Ref	Expression
metidval	⊢ (𝐷 ∈ (PsMet‘𝑋) → (~Met‘𝐷) = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝑥𝐷𝑦) = 0)})

Distinct variable groups:   𝑥,𝑦,𝐷   𝑥,𝑋,𝑦

Proof of Theorem metidval

Dummy variable 𝑑 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-metid 34400	. 2 ⊢ ~Met = (𝑑 ∈ ∪ ran PsMet ↦ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ dom dom 𝑑 ∧ 𝑦 ∈ dom dom 𝑑) ∧ (𝑥𝑑𝑦) = 0)})
2		simpr 490	. . . . . . . . 9 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → 𝑑 = 𝐷)
3	2	dmeqd 5893	. . . . . . . 8 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → dom 𝑑 = dom 𝐷)
4	3	dmeqd 5893	. . . . . . 7 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → dom dom 𝑑 = dom dom 𝐷)
5		psmetdmdm 24535	. . . . . . . 8 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝑋 = dom dom 𝐷)
6	5	adantr 486	. . . . . . 7 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → 𝑋 = dom dom 𝐷)
7	4, 6	eqtr4d 2800	. . . . . 6 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → dom dom 𝑑 = 𝑋)
8	7	eleq2d 2848	. . . . 5 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → (𝑥 ∈ dom dom 𝑑 ↔ 𝑥 ∈ 𝑋))
9	7	eleq2d 2848	. . . . 5 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → (𝑦 ∈ dom dom 𝑑 ↔ 𝑦 ∈ 𝑋))
10	8, 9	anbi12d 644	. . . 4 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → ((𝑥 ∈ dom dom 𝑑 ∧ 𝑦 ∈ dom dom 𝑑) ↔ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)))
11	2	oveqd 7433	. . . . 5 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → (𝑥𝑑𝑦) = (𝑥𝐷𝑦))
12	11	eqeq1d 2764	. . . 4 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → ((𝑥𝑑𝑦) = 0 ↔ (𝑥𝐷𝑦) = 0))
13	10, 12	anbi12d 644	. . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → (((𝑥 ∈ dom dom 𝑑 ∧ 𝑦 ∈ dom dom 𝑑) ∧ (𝑥𝑑𝑦) = 0) ↔ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝑥𝐷𝑦) = 0)))
14	13	opabbidv 5175	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ dom dom 𝑑 ∧ 𝑦 ∈ dom dom 𝑑) ∧ (𝑥𝑑𝑦) = 0)} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝑥𝐷𝑦) = 0)})
15		elfvunirn 6912	. 2 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷 ∈ ∪ ran PsMet)
16		opabssxp 5751	. . 3 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝑥𝐷𝑦) = 0)} ⊆ (𝑋 × 𝑋)
17		elfvex 6917	. . . 4 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝑋 ∈ V)
18	17, 17	xpexd 7753	. . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝑋 × 𝑋) ∈ V)
19		ssexg 5288	. . 3 ⊢ (({⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝑥𝐷𝑦) = 0)} ⊆ (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ V) → {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝑥𝐷𝑦) = 0)} ∈ V)
20	16, 18, 19	sylancr 599	. 2 ⊢ (𝐷 ∈ (PsMet‘𝑋) → {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝑥𝐷𝑦) = 0)} ∈ V)
21	1, 14, 15, 20	fvmptd2 6999	1 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (~Met‘𝐷) = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝑥𝐷𝑦) = 0)})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3453   ⊆ wss 3902  ∪ cuni 4870  {copab 5171   × cxp 5657  dom cdm 5659  ran crn 5660  ‘cfv 6537  (class class class)co 7416  0cc0 11127  PsMetcpsmet 21573  ~_Metcmetid 34398

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-cnex 11183  ax-resscn 11184

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-map 8831  df-xr 11274  df-psmet 21581  df-metid 34400

This theorem is used by:  metidss  34403  metidv  34404