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

Theorem psmetxrge0 15433
Description: The distance function of a pseudometric space is a function into the nonnegative extended real numbers. (Contributed by Thierry Arnoux, 24-Feb-2018.)
Assertion
Ref Expression
psmetxrge0  |-  ( D  e.  (PsMet `  X
)  ->  D :
( X  X.  X
) --> ( 0 [,] +oo ) )

Proof of Theorem psmetxrge0
Dummy variable  a is distinct from all other variables.
StepHypRef Expression
1 psmetf 15426 . . 3  |-  ( D  e.  (PsMet `  X
)  ->  D :
( X  X.  X
) --> RR* )
21ffnd 5534 . 2  |-  ( D  e.  (PsMet `  X
)  ->  D  Fn  ( X  X.  X
) )
31ffvelcdmda 5843 . . . . 5  |-  ( ( D  e.  (PsMet `  X )  /\  a  e.  ( X  X.  X
) )  ->  ( D `  a )  e.  RR* )
4 elxp6 6403 . . . . . . . 8  |-  ( a  e.  ( X  X.  X )  <->  ( a  =  <. ( 1st `  a
) ,  ( 2nd `  a ) >.  /\  (
( 1st `  a
)  e.  X  /\  ( 2nd `  a )  e.  X ) ) )
54simprbi 275 . . . . . . 7  |-  ( a  e.  ( X  X.  X )  ->  (
( 1st `  a
)  e.  X  /\  ( 2nd `  a )  e.  X ) )
6 psmetge0 15432 . . . . . . . 8  |-  ( ( D  e.  (PsMet `  X )  /\  ( 1st `  a )  e.  X  /\  ( 2nd `  a )  e.  X
)  ->  0  <_  ( ( 1st `  a
) D ( 2nd `  a ) ) )
763expb 1235 . . . . . . 7  |-  ( ( D  e.  (PsMet `  X )  /\  (
( 1st `  a
)  e.  X  /\  ( 2nd `  a )  e.  X ) )  ->  0  <_  (
( 1st `  a
) D ( 2nd `  a ) ) )
85, 7sylan2 286 . . . . . 6  |-  ( ( D  e.  (PsMet `  X )  /\  a  e.  ( X  X.  X
) )  ->  0  <_  ( ( 1st `  a
) D ( 2nd `  a ) ) )
9 1st2nd2 6409 . . . . . . . . 9  |-  ( a  e.  ( X  X.  X )  ->  a  =  <. ( 1st `  a
) ,  ( 2nd `  a ) >. )
109fveq2d 5699 . . . . . . . 8  |-  ( a  e.  ( X  X.  X )  ->  ( D `  a )  =  ( D `  <. ( 1st `  a
) ,  ( 2nd `  a ) >. )
)
11 df-ov 6088 . . . . . . . 8  |-  ( ( 1st `  a ) D ( 2nd `  a
) )  =  ( D `  <. ( 1st `  a ) ,  ( 2nd `  a
) >. )
1210, 11eqtr4di 2289 . . . . . . 7  |-  ( a  e.  ( X  X.  X )  ->  ( D `  a )  =  ( ( 1st `  a ) D ( 2nd `  a ) ) )
1312adantl 277 . . . . . 6  |-  ( ( D  e.  (PsMet `  X )  /\  a  e.  ( X  X.  X
) )  ->  ( D `  a )  =  ( ( 1st `  a ) D ( 2nd `  a ) ) )
148, 13breqtrrd 4158 . . . . 5  |-  ( ( D  e.  (PsMet `  X )  /\  a  e.  ( X  X.  X
) )  ->  0  <_  ( D `  a
) )
15 elxrge0 10380 . . . . 5  |-  ( ( D `  a )  e.  ( 0 [,] +oo )  <->  ( ( D `
 a )  e. 
RR*  /\  0  <_  ( D `  a ) ) )
163, 14, 15sylanbrc 421 . . . 4  |-  ( ( D  e.  (PsMet `  X )  /\  a  e.  ( X  X.  X
) )  ->  ( D `  a )  e.  ( 0 [,] +oo ) )
1716ralrimiva 2623 . . 3  |-  ( D  e.  (PsMet `  X
)  ->  A. a  e.  ( X  X.  X
) ( D `  a )  e.  ( 0 [,] +oo )
)
18 fnfvrnss 5868 . . 3  |-  ( ( D  Fn  ( X  X.  X )  /\  A. a  e.  ( X  X.  X ) ( D `  a )  e.  ( 0 [,] +oo ) )  ->  ran  D 
C_  ( 0 [,] +oo ) )
192, 17, 18syl2anc 415 . 2  |-  ( D  e.  (PsMet `  X
)  ->  ran  D  C_  ( 0 [,] +oo ) )
20 df-f 5381 . 2  |-  ( D : ( X  X.  X ) --> ( 0 [,] +oo )  <->  ( D  Fn  ( X  X.  X
)  /\  ran  D  C_  ( 0 [,] +oo ) ) )
212, 19, 20sylanbrc 421 1  |-  ( D  e.  (PsMet `  X
)  ->  D :
( X  X.  X
) --> ( 0 [,] +oo ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   A.wral 2528    C_ wss 3220   <.cop 3712   class class class wbr 4130    X. cxp 4772   ran crn 4775    Fn wfn 5372   -->wf 5373   ` cfv 5377  (class class class)co 6085   1stc1st 6372   2ndc2nd 6373   0cc0 8179   +oocpnf 8357   RR*cxr 8359    <_ cle 8361   [,]cicc 10293  PsMetcpsmet 14872
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-lttrn 8293  ax-pre-ltadd 8295  ax-pre-mulgt0 8296
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-map 6924  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-2 9363  df-xadd 10175  df-icc 10297  df-psmet 14880
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator