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

Theorem setsmsdsg 15471
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 13514 . . . 4  |-  ( dist 
= Slot  ( dist `  ndx )  /\  ( dist `  ndx )  e.  NN )
4 9re 9341 . . . . . 6  |-  9  e.  RR
5 1nn 9265 . . . . . . 7  |-  1  e.  NN
6 2nn0 9530 . . . . . . 7  |-  2  e.  NN0
7 9nn0 9537 . . . . . . 7  |-  9  e.  NN0
8 9lt10 9857 . . . . . . 7  |-  9  < ; 1
0
95, 6, 7, 8declti 9764 . . . . . 6  |-  9  < ; 1
2
104, 9gtneii 8385 . . . . 5  |- ; 1 2  =/=  9
11 dsndx 13512 . . . . . 6  |-  ( dist `  ndx )  = ; 1 2
12 tsetndx 13483 . . . . . 6  |-  (TopSet `  ndx )  =  9
1311, 12neeq12i 2431 . . . . 5  |-  ( (
dist `  ndx )  =/=  (TopSet `  ndx )  <-> ; 1 2  =/=  9
)
1410, 13mpbir 146 . . . 4  |-  ( dist `  ndx )  =/=  (TopSet ` 
ndx )
15 tsetslid 13485 . . . . 5  |-  (TopSet  = Slot  (TopSet `  ndx )  /\  (TopSet `  ndx )  e.  NN )
1615simpri 113 . . . 4  |-  (TopSet `  ndx )  e.  NN
173, 14, 16setsslnid 13348 . . 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 5679 . 2  |-  ( ph  ->  ( dist `  K
)  =  ( dist `  ( M sSet  <. (TopSet ` 
ndx ) ,  (
MetOpen `  D ) >.
) ) )
2118, 20eqtr4d 2270 1  |-  ( ph  ->  ( dist `  M
)  =  ( dist `  K ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398    e. wcel 2205    =/= wne 2414   <.cop 3697    X. cxp 4752    |` cres 4756   ` cfv 5357  (class class class)co 6058   1c1 8144   NNcn 9254   2c2 9305   9c9 9312  ;cdc 9727   ndxcnx 13293   sSet csts 13294  Slot cslot 13295   Basecbs 13296  TopSetcts 13380   distcds 13383   MetOpencmopn 14815
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-mulrcl 8242  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-precex 8253  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-ltadd 8259  ax-pre-mulgt0 8260
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-iota 5317  df-fun 5359  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-inn 9255  df-2 9313  df-3 9314  df-4 9315  df-5 9316  df-6 9317  df-7 9318  df-8 9319  df-9 9320  df-n0 9514  df-z 9595  df-dec 9728  df-ndx 13299  df-slot 13300  df-sets 13303  df-tset 13393  df-ds 13396
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator