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

Theorem metdsle 18356
Description: The distance from a point to a set is bounded by the distance to any member of the set. (Contributed by Mario Carneiro, 5-Sep-2015.)
Hypothesis
Ref Expression
metdscn.f  |-  F  =  ( x  e.  X  |->  sup ( ran  (
y  e.  S  |->  ( x D y ) ) ,  RR* ,  `'  <  ) )
Assertion
Ref Expression
metdsle  |-  ( ( ( D  e.  ( * Met `  X
)  /\  S  C_  X
)  /\  ( A  e.  S  /\  B  e.  X ) )  -> 
( F `  B
)  <_  ( A D B ) )
Distinct variable groups:    x, y, A    x, D, y    x, B, y    x, S, y   
x, X, y
Allowed substitution hints:    F( x, y)

Proof of Theorem metdsle
StepHypRef Expression
1 simprr 733 . . . 4  |-  ( ( ( D  e.  ( * Met `  X
)  /\  S  C_  X
)  /\  ( A  e.  S  /\  B  e.  X ) )  ->  B  e.  X )
2 simpr 447 . . . . . 6  |-  ( ( D  e.  ( * Met `  X )  /\  S  C_  X
)  ->  S  C_  X
)
32sselda 3180 . . . . 5  |-  ( ( ( D  e.  ( * Met `  X
)  /\  S  C_  X
)  /\  A  e.  S )  ->  A  e.  X )
43adantrr 697 . . . 4  |-  ( ( ( D  e.  ( * Met `  X
)  /\  S  C_  X
)  /\  ( A  e.  S  /\  B  e.  X ) )  ->  A  e.  X )
51, 4jca 518 . . 3  |-  ( ( ( D  e.  ( * Met `  X
)  /\  S  C_  X
)  /\  ( A  e.  S  /\  B  e.  X ) )  -> 
( B  e.  X  /\  A  e.  X
) )
6 metdscn.f . . . 4  |-  F  =  ( x  e.  X  |->  sup ( ran  (
y  e.  S  |->  ( x D y ) ) ,  RR* ,  `'  <  ) )
76metdstri 18355 . . 3  |-  ( ( ( D  e.  ( * Met `  X
)  /\  S  C_  X
)  /\  ( B  e.  X  /\  A  e.  X ) )  -> 
( F `  B
)  <_  ( ( B D A ) + e ( F `  A ) ) )
85, 7syldan 456 . 2  |-  ( ( ( D  e.  ( * Met `  X
)  /\  S  C_  X
)  /\  ( A  e.  S  /\  B  e.  X ) )  -> 
( F `  B
)  <_  ( ( B D A ) + e ( F `  A ) ) )
9 simpll 730 . . . . 5  |-  ( ( ( D  e.  ( * Met `  X
)  /\  S  C_  X
)  /\  ( A  e.  S  /\  B  e.  X ) )  ->  D  e.  ( * Met `  X ) )
10 xmetsym 17912 . . . . 5  |-  ( ( D  e.  ( * Met `  X )  /\  B  e.  X  /\  A  e.  X
)  ->  ( B D A )  =  ( A D B ) )
119, 1, 4, 10syl3anc 1182 . . . 4  |-  ( ( ( D  e.  ( * Met `  X
)  /\  S  C_  X
)  /\  ( A  e.  S  /\  B  e.  X ) )  -> 
( B D A )  =  ( A D B ) )
126metds0 18354 . . . . . 6  |-  ( ( D  e.  ( * Met `  X )  /\  S  C_  X  /\  A  e.  S
)  ->  ( F `  A )  =  0 )
13123expa 1151 . . . . 5  |-  ( ( ( D  e.  ( * Met `  X
)  /\  S  C_  X
)  /\  A  e.  S )  ->  ( F `  A )  =  0 )
1413adantrr 697 . . . 4  |-  ( ( ( D  e.  ( * Met `  X
)  /\  S  C_  X
)  /\  ( A  e.  S  /\  B  e.  X ) )  -> 
( F `  A
)  =  0 )
1511, 14oveq12d 5876 . . 3  |-  ( ( ( D  e.  ( * Met `  X
)  /\  S  C_  X
)  /\  ( A  e.  S  /\  B  e.  X ) )  -> 
( ( B D A ) + e
( F `  A
) )  =  ( ( A D B ) + e 0 ) )
16 xmetcl 17896 . . . . 5  |-  ( ( D  e.  ( * Met `  X )  /\  A  e.  X  /\  B  e.  X
)  ->  ( A D B )  e.  RR* )
179, 4, 1, 16syl3anc 1182 . . . 4  |-  ( ( ( D  e.  ( * Met `  X
)  /\  S  C_  X
)  /\  ( A  e.  S  /\  B  e.  X ) )  -> 
( A D B )  e.  RR* )
18 xaddid1 10566 . . . 4  |-  ( ( A D B )  e.  RR*  ->  ( ( A D B ) + e 0 )  =  ( A D B ) )
1917, 18syl 15 . . 3  |-  ( ( ( D  e.  ( * Met `  X
)  /\  S  C_  X
)  /\  ( A  e.  S  /\  B  e.  X ) )  -> 
( ( A D B ) + e
0 )  =  ( A D B ) )
2015, 19eqtrd 2315 . 2  |-  ( ( ( D  e.  ( * Met `  X
)  /\  S  C_  X
)  /\  ( A  e.  S  /\  B  e.  X ) )  -> 
( ( B D A ) + e
( F `  A
) )  =  ( A D B ) )
218, 20breqtrd 4047 1  |-  ( ( ( D  e.  ( * Met `  X
)  /\  S  C_  X
)  /\  ( A  e.  S  /\  B  e.  X ) )  -> 
( F `  B
)  <_  ( A D B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    = wceq 1623    e. wcel 1684    C_ wss 3152   class class class wbr 4023    e. cmpt 4077   `'ccnv 4688   ran crn 4690   ` cfv 5255  (class class class)co 5858   supcsup 7193   0cc0 8737   RR*cxr 8866    < clt 8867    <_ cle 8868   + ecxad 10450   * Metcxmt 16369
This theorem is referenced by:  metdsre  18357
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-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-id 4309  df-po 4314  df-so 4315  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-er 6660  df-ec 6662  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-2 9804  df-rp 10355  df-xneg 10452  df-xadd 10453  df-xmul 10454  df-icc 10663  df-xmet 16373  df-bl 16375
  Copyright terms: Public domain W3C validator