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

Theorem setsmstsetg 15707
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  |-  ( ph  ->  X  =  ( Base `  M ) )
setsms.d  |-  ( ph  ->  D  =  ( (
dist `  M )  |`  ( X  X.  X
) ) )
setsms.k  |-  ( ph  ->  K  =  ( M sSet  <. (TopSet `  ndx ) ,  ( MetOpen `  D ) >. ) )
setsmsbasg.m  |-  ( ph  ->  M  e.  V )
setsmsbasg.d  |-  ( ph  ->  ( MetOpen `  D )  e.  W )
Assertion
Ref Expression
setsmstsetg  |-  ( ph  ->  ( MetOpen `  D )  =  (TopSet `  K )
)

Proof of Theorem setsmstsetg
StepHypRef Expression
1 setsmsbasg.m . . 3  |-  ( ph  ->  M  e.  V )
2 setsmsbasg.d . . 3  |-  ( ph  ->  ( MetOpen `  D )  e.  W )
3 tsetslid 13601 . . . 4  |-  (TopSet  = Slot  (TopSet `  ndx )  /\  (TopSet `  ndx )  e.  NN )
43setsslid 13461 . . 3  |-  ( ( M  e.  V  /\  ( MetOpen `  D )  e.  W )  ->  ( MetOpen
`  D )  =  (TopSet `  ( M sSet  <.
(TopSet `  ndx ) ,  ( MetOpen `  D ) >. ) ) )
51, 2, 4syl2anc 415 . 2  |-  ( ph  ->  ( MetOpen `  D )  =  (TopSet `  ( M sSet  <.
(TopSet `  ndx ) ,  ( MetOpen `  D ) >. ) ) )
6 setsms.k . . 3  |-  ( ph  ->  K  =  ( M sSet  <. (TopSet `  ndx ) ,  ( MetOpen `  D ) >. ) )
76fveq2d 5702 . 2  |-  ( ph  ->  (TopSet `  K )  =  (TopSet `  ( M sSet  <.
(TopSet `  ndx ) ,  ( MetOpen `  D ) >. ) ) )
85, 7eqtr4d 2274 1  |-  ( ph  ->  ( MetOpen `  D )  =  (TopSet `  K )
)
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402    e. wcel 2209   <.cop 3712    X. cxp 4774    |` cres 4778   ` cfv 5380  (class class class)co 6088   ndxcnx 13407   sSet csts 13408   Basecbs 13410  TopSetcts 13496   distcds 13499   MetOpencmopn 14987
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 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1re 8279  ax-addrcl 8282
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 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-iota 5340  df-fun 5382  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-inn 9314  df-2 9372  df-3 9373  df-4 9374  df-5 9375  df-6 9376  df-7 9377  df-8 9378  df-9 9379  df-ndx 13413  df-slot 13414  df-sets 13417  df-tset 13509
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator