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

Theorem setsmsdsg 15148
Description: The distance function of a constructed metric space. (Contributed by Mario Carneiro, 28-Aug-2015.)
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
setsmsdsg  |-  ( ph  ->  ( dist `  M
)  =  ( dist `  K ) )

Proof of Theorem setsmsdsg
StepHypRef Expression
1 setsmsbasg.m . . 3  |-  ( ph  ->  M  e.  V )
2 setsmsbasg.d . . 3  |-  ( ph  ->  ( MetOpen `  D )  e.  W )
3 dsslid 13245 . . . 4  |-  ( dist 
= Slot  ( dist `  ndx )  /\  ( dist `  ndx )  e.  NN )
4 9re 9193 . . . . . 6  |-  9  e.  RR
5 1nn 9117 . . . . . . 7  |-  1  e.  NN
6 2nn0 9382 . . . . . . 7  |-  2  e.  NN0
7 9nn0 9389 . . . . . . 7  |-  9  e.  NN0
8 9lt10 9704 . . . . . . 7  |-  9  < ; 1
0
95, 6, 7, 8declti 9611 . . . . . 6  |-  9  < ; 1
2
104, 9gtneii 8238 . . . . 5  |- ; 1 2  =/=  9
11 dsndx 13243 . . . . . 6  |-  ( dist `  ndx )  = ; 1 2
12 tsetndx 13214 . . . . . 6  |-  (TopSet `  ndx )  =  9
1311, 12neeq12i 2417 . . . . 5  |-  ( (
dist `  ndx )  =/=  (TopSet `  ndx )  <-> ; 1 2  =/=  9
)
1410, 13mpbir 146 . . . 4  |-  ( dist `  ndx )  =/=  (TopSet ` 
ndx )
15 tsetslid 13216 . . . . 5  |-  (TopSet  = Slot  (TopSet `  ndx )  /\  (TopSet `  ndx )  e.  NN )
1615simpri 113 . . . 4  |-  (TopSet `  ndx )  e.  NN
173, 14, 16setsslnid 13079 . . 3  |-  ( ( M  e.  V  /\  ( MetOpen `  D )  e.  W )  ->  ( dist `  M )  =  ( dist `  ( M sSet  <. (TopSet `  ndx ) ,  ( MetOpen `  D ) >. )
) )
181, 2, 17syl2anc 411 . 2  |-  ( ph  ->  ( dist `  M
)  =  ( dist `  ( M sSet  <. (TopSet ` 
ndx ) ,  (
MetOpen `  D ) >.
) ) )
19 setsms.k . . 3  |-  ( ph  ->  K  =  ( M sSet  <. (TopSet `  ndx ) ,  ( MetOpen `  D ) >. ) )
2019fveq2d 5630 . 2  |-  ( ph  ->  ( dist `  K
)  =  ( dist `  ( M sSet  <. (TopSet ` 
ndx ) ,  (
MetOpen `  D ) >.
) ) )
2118, 20eqtr4d 2265 1  |-  ( ph  ->  ( dist `  M
)  =  ( dist `  K ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1395    e. wcel 2200    =/= wne 2400   <.cop 3669    X. cxp 4716    |` cres 4720   ` cfv 5317  (class class class)co 6000   1c1 7996   NNcn 9106   2c2 9157   9c9 9164  ;cdc 9574   ndxcnx 13024   sSet csts 13025  Slot cslot 13026   Basecbs 13027  TopSetcts 13111   distcds 13114   MetOpencmopn 14499
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-cnex 8086  ax-resscn 8087  ax-1cn 8088  ax-1re 8089  ax-icn 8090  ax-addcl 8091  ax-addrcl 8092  ax-mulcl 8093  ax-mulrcl 8094  ax-addcom 8095  ax-mulcom 8096  ax-addass 8097  ax-mulass 8098  ax-distr 8099  ax-i2m1 8100  ax-0lt1 8101  ax-1rid 8102  ax-0id 8103  ax-rnegex 8104  ax-precex 8105  ax-cnre 8106  ax-pre-ltirr 8107  ax-pre-ltwlin 8108  ax-pre-lttrn 8109  ax-pre-ltadd 8111  ax-pre-mulgt0 8112
This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-iota 5277  df-fun 5319  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-pnf 8179  df-mnf 8180  df-xr 8181  df-ltxr 8182  df-le 8183  df-sub 8315  df-neg 8316  df-inn 9107  df-2 9165  df-3 9166  df-4 9167  df-5 9168  df-6 9169  df-7 9170  df-8 9171  df-9 9172  df-n0 9366  df-z 9443  df-dec 9575  df-ndx 13030  df-slot 13031  df-sets 13034  df-tset 13124  df-ds 13127
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator