Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  tusval Structured version   Visualization version   GIF version

Theorem tusval 21880
 Description: The value of the uniform space mapping function. (Contributed by Thierry Arnoux, 5-Dec-2017.)
Assertion
Ref Expression
tusval (𝑈 ∈ (UnifOn‘𝑋) → (toUnifSp‘𝑈) = ({⟨(Base‘ndx), dom 𝑈⟩, ⟨(UnifSet‘ndx), 𝑈⟩} sSet ⟨(TopSet‘ndx), (unifTop‘𝑈)⟩))

Proof of Theorem tusval
Dummy variable 𝑢 is distinct from all other variables.
StepHypRef Expression
1 df-tus 21872 . . 3 toUnifSp = (𝑢 ran UnifOn ↦ ({⟨(Base‘ndx), dom 𝑢⟩, ⟨(UnifSet‘ndx), 𝑢⟩} sSet ⟨(TopSet‘ndx), (unifTop‘𝑢)⟩))
21a1i 11 . 2 (𝑈 ∈ (UnifOn‘𝑋) → toUnifSp = (𝑢 ran UnifOn ↦ ({⟨(Base‘ndx), dom 𝑢⟩, ⟨(UnifSet‘ndx), 𝑢⟩} sSet ⟨(TopSet‘ndx), (unifTop‘𝑢)⟩)))
3 simpr 476 . . . . . . 7 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → 𝑢 = 𝑈)
43unieqd 4382 . . . . . 6 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → 𝑢 = 𝑈)
54dmeqd 5248 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → dom 𝑢 = dom 𝑈)
65opeq2d 4347 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → ⟨(Base‘ndx), dom 𝑢⟩ = ⟨(Base‘ndx), dom 𝑈⟩)
73opeq2d 4347 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → ⟨(UnifSet‘ndx), 𝑢⟩ = ⟨(UnifSet‘ndx), 𝑈⟩)
86, 7preq12d 4220 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → {⟨(Base‘ndx), dom 𝑢⟩, ⟨(UnifSet‘ndx), 𝑢⟩} = {⟨(Base‘ndx), dom 𝑈⟩, ⟨(UnifSet‘ndx), 𝑈⟩})
93fveq2d 6107 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → (unifTop‘𝑢) = (unifTop‘𝑈))
109opeq2d 4347 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → ⟨(TopSet‘ndx), (unifTop‘𝑢)⟩ = ⟨(TopSet‘ndx), (unifTop‘𝑈)⟩)
118, 10oveq12d 6567 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → ({⟨(Base‘ndx), dom 𝑢⟩, ⟨(UnifSet‘ndx), 𝑢⟩} sSet ⟨(TopSet‘ndx), (unifTop‘𝑢)⟩) = ({⟨(Base‘ndx), dom 𝑈⟩, ⟨(UnifSet‘ndx), 𝑈⟩} sSet ⟨(TopSet‘ndx), (unifTop‘𝑈)⟩))
12 elrnust 21838 . 2 (𝑈 ∈ (UnifOn‘𝑋) → 𝑈 ran UnifOn)
13 ovex 6577 . . 3 ({⟨(Base‘ndx), dom 𝑈⟩, ⟨(UnifSet‘ndx), 𝑈⟩} sSet ⟨(TopSet‘ndx), (unifTop‘𝑈)⟩) ∈ V
1413a1i 11 . 2 (𝑈 ∈ (UnifOn‘𝑋) → ({⟨(Base‘ndx), dom 𝑈⟩, ⟨(UnifSet‘ndx), 𝑈⟩} sSet ⟨(TopSet‘ndx), (unifTop‘𝑈)⟩) ∈ V)
152, 11, 12, 14fvmptd 6197 1 (𝑈 ∈ (UnifOn‘𝑋) → (toUnifSp‘𝑈) = ({⟨(Base‘ndx), dom 𝑈⟩, ⟨(UnifSet‘ndx), 𝑈⟩} sSet ⟨(TopSet‘ndx), (unifTop‘𝑈)⟩))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  Vcvv 3173  {cpr 4127  ⟨cop 4131  ∪ cuni 4372   ↦ cmpt 4643  dom cdm 5038  ran crn 5039  ‘cfv 5804  (class class class)co 6549  ndxcnx 15692   sSet csts 15693  Basecbs 15695  TopSetcts 15774  UnifSetcunif 15778  UnifOncust 21813  unifTopcutop 21844  toUnifSpctus 21869 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-iota 5768  df-fun 5806  df-fn 5807  df-fv 5812  df-ov 6552  df-ust 21814  df-tus 21872 This theorem is referenced by:  tuslem  21881
 Copyright terms: Public domain W3C validator