MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  metss2 Unicode version

Theorem metss2 18058
Description: If the metric  D is "strongly finer" than  C (meaning that there is a positive real constant 
R such that  C ( x ,  y )  <_  R  x.  D (
x ,  y )), then  D generates a finer topology. (Using this theorem twice in each direction states that if two metrics are strongly equivalent, then they generate the same topology.) (Contributed by Mario Carneiro, 14-Sep-2015.)
Hypotheses
Ref Expression
metequiv.3  |-  J  =  ( MetOpen `  C )
metequiv.4  |-  K  =  ( MetOpen `  D )
metss2.1  |-  ( ph  ->  C  e.  ( Met `  X ) )
metss2.2  |-  ( ph  ->  D  e.  ( Met `  X ) )
metss2.3  |-  ( ph  ->  R  e.  RR+ )
metss2.4  |-  ( (
ph  /\  ( x  e.  X  /\  y  e.  X ) )  -> 
( x C y )  <_  ( R  x.  ( x D y ) ) )
Assertion
Ref Expression
metss2  |-  ( ph  ->  J  C_  K )
Distinct variable groups:    x, y, C    x, J, y    x, K, y    y, R    x, D, y    ph, x, y   
x, X, y
Allowed substitution hint:    R( x)

Proof of Theorem metss2
Dummy variables  s 
r are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 447 . . . . 5  |-  ( ( x  e.  X  /\  r  e.  RR+ )  -> 
r  e.  RR+ )
2 metss2.3 . . . . 5  |-  ( ph  ->  R  e.  RR+ )
3 rpdivcl 10376 . . . . 5  |-  ( ( r  e.  RR+  /\  R  e.  RR+ )  ->  (
r  /  R )  e.  RR+ )
41, 2, 3syl2anr 464 . . . 4  |-  ( (
ph  /\  ( x  e.  X  /\  r  e.  RR+ ) )  -> 
( r  /  R
)  e.  RR+ )
5 metequiv.3 . . . . 5  |-  J  =  ( MetOpen `  C )
6 metequiv.4 . . . . 5  |-  K  =  ( MetOpen `  D )
7 metss2.1 . . . . 5  |-  ( ph  ->  C  e.  ( Met `  X ) )
8 metss2.2 . . . . 5  |-  ( ph  ->  D  e.  ( Met `  X ) )
9 metss2.4 . . . . 5  |-  ( (
ph  /\  ( x  e.  X  /\  y  e.  X ) )  -> 
( x C y )  <_  ( R  x.  ( x D y ) ) )
105, 6, 7, 8, 2, 9metss2lem 18057 . . . 4  |-  ( (
ph  /\  ( x  e.  X  /\  r  e.  RR+ ) )  -> 
( x ( ball `  D ) ( r  /  R ) ) 
C_  ( x (
ball `  C )
r ) )
11 oveq2 5866 . . . . . 6  |-  ( s  =  ( r  /  R )  ->  (
x ( ball `  D
) s )  =  ( x ( ball `  D ) ( r  /  R ) ) )
1211sseq1d 3205 . . . . 5  |-  ( s  =  ( r  /  R )  ->  (
( x ( ball `  D ) s ) 
C_  ( x (
ball `  C )
r )  <->  ( x
( ball `  D )
( r  /  R
) )  C_  (
x ( ball `  C
) r ) ) )
1312rspcev 2884 . . . 4  |-  ( ( ( r  /  R
)  e.  RR+  /\  (
x ( ball `  D
) ( r  /  R ) )  C_  ( x ( ball `  C ) r ) )  ->  E. s  e.  RR+  ( x (
ball `  D )
s )  C_  (
x ( ball `  C
) r ) )
144, 10, 13syl2anc 642 . . 3  |-  ( (
ph  /\  ( x  e.  X  /\  r  e.  RR+ ) )  ->  E. s  e.  RR+  (
x ( ball `  D
) s )  C_  ( x ( ball `  C ) r ) )
1514ralrimivva 2635 . 2  |-  ( ph  ->  A. x  e.  X  A. r  e.  RR+  E. s  e.  RR+  ( x (
ball `  D )
s )  C_  (
x ( ball `  C
) r ) )
16 metxmet 17899 . . . 4  |-  ( C  e.  ( Met `  X
)  ->  C  e.  ( * Met `  X
) )
177, 16syl 15 . . 3  |-  ( ph  ->  C  e.  ( * Met `  X ) )
18 metxmet 17899 . . . 4  |-  ( D  e.  ( Met `  X
)  ->  D  e.  ( * Met `  X
) )
198, 18syl 15 . . 3  |-  ( ph  ->  D  e.  ( * Met `  X ) )
205, 6metss 18054 . . 3  |-  ( ( C  e.  ( * Met `  X )  /\  D  e.  ( * Met `  X
) )  ->  ( J  C_  K  <->  A. x  e.  X  A. r  e.  RR+  E. s  e.  RR+  ( x ( ball `  D ) s ) 
C_  ( x (
ball `  C )
r ) ) )
2117, 19, 20syl2anc 642 . 2  |-  ( ph  ->  ( J  C_  K  <->  A. x  e.  X  A. r  e.  RR+  E. s  e.  RR+  ( x (
ball `  D )
s )  C_  (
x ( ball `  C
) r ) ) )
2215, 21mpbird 223 1  |-  ( ph  ->  J  C_  K )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    = wceq 1623    e. wcel 1684   A.wral 2543   E.wrex 2544    C_ wss 3152   class class class wbr 4023   ` cfv 5255  (class class class)co 5858    x. cmul 8742    <_ cle 8868    / cdiv 9423   RR+crp 10354   * Metcxmt 16369   Metcme 16370   ballcbl 16371   MetOpencmopn 16372
This theorem is referenced by:  equivcmet  18741
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512  ax-cnex 8793  ax-resscn 8794  ax-1cn 8795  ax-icn 8796  ax-addcl 8797  ax-addrcl 8798  ax-mulcl 8799  ax-mulrcl 8800  ax-mulcom 8801  ax-addass 8802  ax-mulass 8803  ax-distr 8804  ax-i2m1 8805  ax-1ne0 8806  ax-1rid 8807  ax-rnegex 8808  ax-rrecex 8809  ax-cnre 8810  ax-pre-lttri 8811  ax-pre-lttrn 8812  ax-pre-ltadd 8813  ax-pre-mulgt0 8814  ax-pre-sup 8815
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-nel 2449  df-ral 2548  df-rex 2549  df-reu 2550  df-rmo 2551  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pss 3168  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-tp 3648  df-op 3649  df-uni 3828  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-tr 4114  df-eprel 4305  df-id 4309  df-po 4314  df-so 4315  df-fr 4352  df-we 4354  df-ord 4395  df-on 4396  df-lim 4397  df-suc 4398  df-om 4657  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ov 5861  df-oprab 5862  df-mpt2 5863  df-1st 6122  df-2nd 6123  df-riota 6304  df-recs 6388  df-rdg 6423  df-er 6660  df-map 6774  df-en 6864  df-dom 6865  df-sdom 6866  df-sup 7194  df-pnf 8869  df-mnf 8870  df-xr 8871  df-ltxr 8872  df-le 8873  df-sub 9039  df-neg 9040  df-div 9424  df-nn 9747  df-2 9804  df-n0 9966  df-z 10025  df-uz 10231  df-q 10317  df-rp 10355  df-xneg 10452  df-xadd 10453  df-xmul 10454  df-topgen 13344  df-xmet 16373  df-met 16374  df-bl 16375  df-mopn 16376  df-bases 16638
  Copyright terms: Public domain W3C validator