Theorem metidval 34055

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 34053	. 2 ⊢ ~Met = (𝑑 ∈ ∪ ran PsMet ↦ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ dom dom 𝑑 ∧ 𝑦 ∈ dom dom 𝑑) ∧ (𝑥𝑑𝑦) = 0)})
2		simpr 484	. . . . . . . . 9 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → 𝑑 = 𝐷)
3	2	dmeqd 5852	. . . . . . . 8 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → dom 𝑑 = dom 𝐷)
4	3	dmeqd 5852	. . . . . . 7 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → dom dom 𝑑 = dom dom 𝐷)
5		psmetdmdm 24279	. . . . . . . 8 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝑋 = dom dom 𝐷)
6	5	adantr 480	. . . . . . 7 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → 𝑋 = dom dom 𝐷)
7	4, 6	eqtr4d 2775	. . . . . 6 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → dom dom 𝑑 = 𝑋)
8	7	eleq2d 2823	. . . . 5 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → (𝑥 ∈ dom dom 𝑑 ↔ 𝑥 ∈ 𝑋))
9	7	eleq2d 2823	. . . . 5 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → (𝑦 ∈ dom dom 𝑑 ↔ 𝑦 ∈ 𝑋))
10	8, 9	anbi12d 633	. . . 4 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → ((𝑥 ∈ dom dom 𝑑 ∧ 𝑦 ∈ dom dom 𝑑) ↔ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)))
11	2	oveqd 7375	. . . . 5 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → (𝑥𝑑𝑦) = (𝑥𝐷𝑦))
12	11	eqeq1d 2739	. . . 4 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → ((𝑥𝑑𝑦) = 0 ↔ (𝑥𝐷𝑦) = 0))
13	10, 12	anbi12d 633	. . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → (((𝑥 ∈ dom dom 𝑑 ∧ 𝑦 ∈ dom dom 𝑑) ∧ (𝑥𝑑𝑦) = 0) ↔ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝑥𝐷𝑦) = 0)))
14	13	opabbidv 5152	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑑 = 𝐷) → {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ dom dom 𝑑 ∧ 𝑦 ∈ dom dom 𝑑) ∧ (𝑥𝑑𝑦) = 0)} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝑥𝐷𝑦) = 0)})
15		elfvunirn 6862	. 2 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷 ∈ ∪ ran PsMet)
16		opabssxp 5714	. . 3 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝑥𝐷𝑦) = 0)} ⊆ (𝑋 × 𝑋)
17		elfvex 6867	. . . 4 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝑋 ∈ V)
18	17, 17	xpexd 7696	. . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝑋 × 𝑋) ∈ V)
19		ssexg 5258	. . 3 ⊢ (({⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝑥𝐷𝑦) = 0)} ⊆ (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ V) → {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝑥𝐷𝑦) = 0)} ∈ V)
20	16, 18, 19	sylancr 588	. 2 ⊢ (𝐷 ∈ (PsMet‘𝑋) → {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝑥𝐷𝑦) = 0)} ∈ V)
21	1, 14, 15, 20	fvmptd2 6948	1 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (~Met‘𝐷) = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝑥𝐷𝑦) = 0)})

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  Vcvv 3430   ⊆ wss 3890  ∪ cuni 4851  {copab 5148   × cxp 5620  dom cdm 5622  ran crn 5623  ‘cfv 6490  (class class class)co 7358  0cc0 11027  PsMetcpsmet 21326  ~_Metcmetid 34051

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-nul 5241  ax-pow 5300  ax-pr 5368  ax-un 7680  ax-cnex 11083  ax-resscn 11084

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-fv 6498  df-ov 7361  df-oprab 7362  df-mpo 7363  df-map 8766  df-xr 11172  df-psmet 21334  df-metid 34053

This theorem is referenced by:  metidss  34056  metidv  34057