Theorem tmsval 24830

Description: For any metric there is an associated metric space. (Contributed by Mario Carneiro, 2-Sep-2015.)

Hypotheses

Ref	Expression
tmsval.m	⊢ 𝑀 = {⟨(Base‘ndx), 𝑋⟩, ⟨(dist‘ndx), 𝐷⟩}
tmsval.k	⊢ 𝐾 = (toMetSp‘𝐷)

Assertion

Ref	Expression
tmsval	⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐾 = (𝑀 sSet ⟨(TopSet‘ndx), (MetOpen‘𝐷)⟩))

Proof of Theorem tmsval

Dummy variable 𝑑 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		tmsval.k	. 2 ⊢ 𝐾 = (toMetSp‘𝐷)
2		df-tms 24671	. . 3 ⊢ toMetSp = (𝑑 ∈ ∪ ran ∞Met ↦ ({⟨(Base‘ndx), dom dom 𝑑⟩, ⟨(dist‘ndx), 𝑑⟩} sSet ⟨(TopSet‘ndx), (MetOpen‘𝑑)⟩))
3		dmeq 5892	. . . . . . . . 9 ⊢ (𝑑 = 𝐷 → dom 𝑑 = dom 𝐷)
4	3	dmeqd 5894	. . . . . . . 8 ⊢ (𝑑 = 𝐷 → dom dom 𝑑 = dom dom 𝐷)
5		xmetf 24678	. . . . . . . . . . 11 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ*)
6	5	fdmd 6742	. . . . . . . . . 10 ⊢ (𝐷 ∈ (∞Met‘𝑋) → dom 𝐷 = (𝑋 × 𝑋))
7	6	dmeqd 5894	. . . . . . . . 9 ⊢ (𝐷 ∈ (∞Met‘𝑋) → dom dom 𝐷 = dom (𝑋 × 𝑋))
8		dmxpid 5919	. . . . . . . . 9 ⊢ dom (𝑋 × 𝑋) = 𝑋
9	7, 8	eqtrdi 2814	. . . . . . . 8 ⊢ (𝐷 ∈ (∞Met‘𝑋) → dom dom 𝐷 = 𝑋)
10	4, 9	sylan9eqr 2820	. . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑑 = 𝐷) → dom dom 𝑑 = 𝑋)
11	10	opeq2d 4850	. . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑑 = 𝐷) → ⟨(Base‘ndx), dom dom 𝑑⟩ = ⟨(Base‘ndx), 𝑋⟩)
12		simpr 490	. . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑑 = 𝐷) → 𝑑 = 𝐷)
13	12	opeq2d 4850	. . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑑 = 𝐷) → ⟨(dist‘ndx), 𝑑⟩ = ⟨(dist‘ndx), 𝐷⟩)
14	11, 13	preq12d 4702	. . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑑 = 𝐷) → {⟨(Base‘ndx), dom dom 𝑑⟩, ⟨(dist‘ndx), 𝑑⟩} = {⟨(Base‘ndx), 𝑋⟩, ⟨(dist‘ndx), 𝐷⟩})
15		tmsval.m	. . . . 5 ⊢ 𝑀 = {⟨(Base‘ndx), 𝑋⟩, ⟨(dist‘ndx), 𝐷⟩}
16	14, 15	eqtr4di 2816	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑑 = 𝐷) → {⟨(Base‘ndx), dom dom 𝑑⟩, ⟨(dist‘ndx), 𝑑⟩} = 𝑀)
17	12	fveq2d 6912	. . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑑 = 𝐷) → (MetOpen‘𝑑) = (MetOpen‘𝐷))
18	17	opeq2d 4850	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑑 = 𝐷) → ⟨(TopSet‘ndx), (MetOpen‘𝑑)⟩ = ⟨(TopSet‘ndx), (MetOpen‘𝐷)⟩)
19	16, 18	oveq12d 7461	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑑 = 𝐷) → ({⟨(Base‘ndx), dom dom 𝑑⟩, ⟨(dist‘ndx), 𝑑⟩} sSet ⟨(TopSet‘ndx), (MetOpen‘𝑑)⟩) = (𝑀 sSet ⟨(TopSet‘ndx), (MetOpen‘𝐷)⟩))
20		fvssunirn 6939	. . . 4 ⊢ (∞Met‘𝑋) ⊆ ∪ ran ∞Met
21	20	sseli 3909	. . 3 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐷 ∈ ∪ ran ∞Met)
22		ovexd 7478	. . 3 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝑀 sSet ⟨(TopSet‘ndx), (MetOpen‘𝐷)⟩) ∈ V)
23	2, 19, 21, 22	fvmptd2 7025	. 2 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (toMetSp‘𝐷) = (𝑀 sSet ⟨(TopSet‘ndx), (MetOpen‘𝐷)⟩))
24	1, 23	eqtrid 2810	1 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐾 = (𝑀 sSet ⟨(TopSet‘ndx), (MetOpen‘𝐷)⟩))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454  {cpr 4590  ⟨cop 4838  ∪ cuni 4870   × cxp 5653  dom cdm 5655  ran crn 5656  ‘cfv 6558  (class class class)co 7443  ℝ^*cxr 11369   sSet csts 17370  ndxcnx 17400  Basecbs 17416  TopSetcts 17463  distcds 17466  ∞Metcxmet 21693  MetOpencmopn 21698  toMetSpctms 24668

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-cnex 11283  ax-resscn 11284

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-map 8877  df-xr 11374  df-xmet 21701  df-tms 24671

This theorem is used by:  tmslem  24831