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

Theorem setsmsdsg 14648
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 12830 . . . 4  |-  ( dist 
= Slot  ( dist `  ndx )  /\  ( dist `  ndx )  e.  NN )
4 9re 9069 . . . . . 6  |-  9  e.  RR
5 1nn 8993 . . . . . . 7  |-  1  e.  NN
6 2nn0 9257 . . . . . . 7  |-  2  e.  NN0
7 9nn0 9264 . . . . . . 7  |-  9  e.  NN0
8 9lt10 9578 . . . . . . 7  |-  9  < ; 1
0
95, 6, 7, 8declti 9485 . . . . . 6  |-  9  < ; 1
2
104, 9gtneii 8115 . . . . 5  |- ; 1 2  =/=  9
11 dsndx 12828 . . . . . 6  |-  ( dist `  ndx )  = ; 1 2
12 tsetndx 12803 . . . . . 6  |-  (TopSet `  ndx )  =  9
1311, 12neeq12i 2381 . . . . 5  |-  ( (
dist `  ndx )  =/=  (TopSet `  ndx )  <-> ; 1 2  =/=  9
)
1410, 13mpbir 146 . . . 4  |-  ( dist `  ndx )  =/=  (TopSet ` 
ndx )
15 tsetslid 12805 . . . . 5  |-  (TopSet  = Slot  (TopSet `  ndx )  /\  (TopSet `  ndx )  e.  NN )
1615simpri 113 . . . 4  |-  (TopSet `  ndx )  e.  NN
173, 14, 16setsslnid 12670 . . 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 5558 . 2  |-  ( ph  ->  ( dist `  K
)  =  ( dist `  ( M sSet  <. (TopSet ` 
ndx ) ,  (
MetOpen `  D ) >.
) ) )
2118, 20eqtr4d 2229 1  |-  ( ph  ->  ( dist `  M
)  =  ( dist `  K ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1364    e. wcel 2164    =/= wne 2364   <.cop 3621    X. cxp 4657    |` cres 4661   ` cfv 5254  (class class class)co 5918   1c1 7873   NNcn 8982   2c2 9033   9c9 9040  ;cdc 9448   ndxcnx 12615   sSet csts 12616  Slot cslot 12617   Basecbs 12618  TopSetcts 12701   distcds 12704   MetOpencmopn 14037
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-mulrcl 7971  ax-addcom 7972  ax-mulcom 7973  ax-addass 7974  ax-mulass 7975  ax-distr 7976  ax-i2m1 7977  ax-0lt1 7978  ax-1rid 7979  ax-0id 7980  ax-rnegex 7981  ax-precex 7982  ax-cnre 7983  ax-pre-ltirr 7984  ax-pre-ltwlin 7985  ax-pre-lttrn 7986  ax-pre-ltadd 7988  ax-pre-mulgt0 7989
This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-iota 5215  df-fun 5256  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-pnf 8056  df-mnf 8057  df-xr 8058  df-ltxr 8059  df-le 8060  df-sub 8192  df-neg 8193  df-inn 8983  df-2 9041  df-3 9042  df-4 9043  df-5 9044  df-6 9045  df-7 9046  df-8 9047  df-9 9048  df-n0 9241  df-z 9318  df-dec 9449  df-ndx 12621  df-slot 12622  df-sets 12625  df-tset 12714  df-ds 12717
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator