ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  setsmstsetg GIF version

Theorem setsmstsetg 15584
Description: The topology of a constructed metric space. (Contributed by Mario Carneiro, 28-Aug-2015.) (Revised by Jim Kingdon, 7-May-2023.)
Hypotheses
Ref Expression
setsms.x (𝜑𝑋 = (Base‘𝑀))
setsms.d (𝜑𝐷 = ((dist‘𝑀) ↾ (𝑋 × 𝑋)))
setsms.k (𝜑𝐾 = (𝑀 sSet ⟨(TopSet‘ndx), (MetOpen‘𝐷)⟩))
setsmsbasg.m (𝜑𝑀𝑉)
setsmsbasg.d (𝜑 → (MetOpen‘𝐷) ∈ 𝑊)
Assertion
Ref Expression
setsmstsetg (𝜑 → (MetOpen‘𝐷) = (TopSet‘𝐾))

Proof of Theorem setsmstsetg
StepHypRef Expression
1 setsmsbasg.m . . 3 (𝜑𝑀𝑉)
2 setsmsbasg.d . . 3 (𝜑 → (MetOpen‘𝐷) ∈ 𝑊)
3 tsetslid 13544 . . . 4 (TopSet = Slot (TopSet‘ndx) ∧ (TopSet‘ndx) ∈ ℕ)
43setsslid 13405 . . 3 ((𝑀𝑉 ∧ (MetOpen‘𝐷) ∈ 𝑊) → (MetOpen‘𝐷) = (TopSet‘(𝑀 sSet ⟨(TopSet‘ndx), (MetOpen‘𝐷)⟩)))
51, 2, 4syl2anc 415 . 2 (𝜑 → (MetOpen‘𝐷) = (TopSet‘(𝑀 sSet ⟨(TopSet‘ndx), (MetOpen‘𝐷)⟩)))
6 setsms.k . . 3 (𝜑𝐾 = (𝑀 sSet ⟨(TopSet‘ndx), (MetOpen‘𝐷)⟩))
76fveq2d 5699 . 2 (𝜑 → (TopSet‘𝐾) = (TopSet‘(𝑀 sSet ⟨(TopSet‘ndx), (MetOpen‘𝐷)⟩)))
85, 7eqtr4d 2274 1 (𝜑 → (MetOpen‘𝐷) = (TopSet‘𝐾))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4   = wceq 1402  wcel 2209  cop 3712   × cxp 4772  cres 4776  cfv 5377  (class class class)co 6085  ndxcnx 13351   sSet csts 13352  Basecbs 13354  TopSetcts 13439  distcds 13442  MetOpencmopn 14880
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-inn 9306  df-2 9364  df-3 9365  df-4 9366  df-5 9367  df-6 9368  df-7 9369  df-8 9370  df-9 9371  df-ndx 13357  df-slot 13358  df-sets 13361  df-tset 13452
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator