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

Theorem setsmsdsg 15230
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 13320 . . . 4  |-  ( dist 
= Slot  ( dist `  ndx )  /\  ( dist `  ndx )  e.  NN )
4 9re 9232 . . . . . 6  |-  9  e.  RR
5 1nn 9156 . . . . . . 7  |-  1  e.  NN
6 2nn0 9421 . . . . . . 7  |-  2  e.  NN0
7 9nn0 9428 . . . . . . 7  |-  9  e.  NN0
8 9lt10 9743 . . . . . . 7  |-  9  < ; 1
0
95, 6, 7, 8declti 9650 . . . . . 6  |-  9  < ; 1
2
104, 9gtneii 8277 . . . . 5  |- ; 1 2  =/=  9
11 dsndx 13318 . . . . . 6  |-  ( dist `  ndx )  = ; 1 2
12 tsetndx 13289 . . . . . 6  |-  (TopSet `  ndx )  =  9
1311, 12neeq12i 2418 . . . . 5  |-  ( (
dist `  ndx )  =/=  (TopSet `  ndx )  <-> ; 1 2  =/=  9
)
1410, 13mpbir 146 . . . 4  |-  ( dist `  ndx )  =/=  (TopSet ` 
ndx )
15 tsetslid 13291 . . . . 5  |-  (TopSet  = Slot  (TopSet `  ndx )  /\  (TopSet `  ndx )  e.  NN )
1615simpri 113 . . . 4  |-  (TopSet `  ndx )  e.  NN
173, 14, 16setsslnid 13154 . . 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 5643 . 2  |-  ( ph  ->  ( dist `  K
)  =  ( dist `  ( M sSet  <. (TopSet ` 
ndx ) ,  (
MetOpen `  D ) >.
) ) )
2118, 20eqtr4d 2266 1  |-  ( ph  ->  ( dist `  M
)  =  ( dist `  K ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1397    e. wcel 2201    =/= wne 2401   <.cop 3671    X. cxp 4722    |` cres 4726   ` cfv 5325  (class class class)co 6020   1c1 8035   NNcn 9145   2c2 9196   9c9 9203  ;cdc 9613   ndxcnx 13099   sSet csts 13100  Slot cslot 13101   Basecbs 13102  TopSetcts 13186   distcds 13189   MetOpencmopn 14576
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2203  ax-14 2204  ax-ext 2212  ax-sep 4206  ax-pow 4263  ax-pr 4298  ax-un 4529  ax-setind 4634  ax-cnex 8125  ax-resscn 8126  ax-1cn 8127  ax-1re 8128  ax-icn 8129  ax-addcl 8130  ax-addrcl 8131  ax-mulcl 8132  ax-mulrcl 8133  ax-addcom 8134  ax-mulcom 8135  ax-addass 8136  ax-mulass 8137  ax-distr 8138  ax-i2m1 8139  ax-0lt1 8140  ax-1rid 8141  ax-0id 8142  ax-rnegex 8143  ax-precex 8144  ax-cnre 8145  ax-pre-ltirr 8146  ax-pre-ltwlin 8147  ax-pre-lttrn 8148  ax-pre-ltadd 8150  ax-pre-mulgt0 8151
This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ne 2402  df-nel 2497  df-ral 2514  df-rex 2515  df-reu 2516  df-rab 2518  df-v 2803  df-sbc 3031  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-nul 3494  df-pw 3653  df-sn 3674  df-pr 3675  df-op 3677  df-uni 3893  df-int 3928  df-br 4088  df-opab 4150  df-mpt 4151  df-id 4389  df-xp 4730  df-rel 4731  df-cnv 4732  df-co 4733  df-dm 4734  df-rn 4735  df-res 4736  df-iota 5285  df-fun 5327  df-fv 5333  df-riota 5973  df-ov 6023  df-oprab 6024  df-mpo 6025  df-pnf 8218  df-mnf 8219  df-xr 8220  df-ltxr 8221  df-le 8222  df-sub 8354  df-neg 8355  df-inn 9146  df-2 9204  df-3 9205  df-4 9206  df-5 9207  df-6 9208  df-7 9209  df-8 9210  df-9 9211  df-n0 9405  df-z 9482  df-dec 9614  df-ndx 13105  df-slot 13106  df-sets 13109  df-tset 13199  df-ds 13202
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator