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

Theorem psmet0 15428
Description: The distance function of a pseudometric space is zero if its arguments are equal. (Contributed by Thierry Arnoux, 7-Feb-2018.)
Assertion
Ref Expression
psmet0  |-  ( ( D  e.  (PsMet `  X )  /\  A  e.  X )  ->  ( A D A )  =  0 )

Proof of Theorem psmet0
Dummy variables  a  b  c  d  e are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-psmet 14880 . . . . . . . . 9  |- PsMet  =  ( d  e.  _V  |->  { e  e.  ( RR*  ^m  ( d  X.  d
) )  |  A. a  e.  d  (
( a e a )  =  0  /\ 
A. b  e.  d 
A. c  e.  d  ( a e b )  <_  ( (
c e a ) +e ( c e b ) ) ) } )
21mptrcl 5788 . . . . . . . 8  |-  ( D  e.  (PsMet `  X
)  ->  X  e.  _V )
3 ispsmet 15424 . . . . . . . 8  |-  ( X  e.  _V  ->  ( D  e.  (PsMet `  X
)  <->  ( D :
( X  X.  X
) --> RR*  /\  A. a  e.  X  ( (
a D a )  =  0  /\  A. b  e.  X  A. c  e.  X  (
a D b )  <_  ( ( c D a ) +e ( c D b ) ) ) ) ) )
42, 3syl 14 . . . . . . 7  |-  ( D  e.  (PsMet `  X
)  ->  ( D  e.  (PsMet `  X )  <->  ( D : ( X  X.  X ) --> RR* 
/\  A. a  e.  X  ( ( a D a )  =  0  /\  A. b  e.  X  A. c  e.  X  ( a D b )  <_  (
( c D a ) +e ( c D b ) ) ) ) ) )
54ibi 176 . . . . . 6  |-  ( D  e.  (PsMet `  X
)  ->  ( D : ( X  X.  X ) --> RR*  /\  A. a  e.  X  (
( a D a )  =  0  /\ 
A. b  e.  X  A. c  e.  X  ( a D b )  <_  ( (
c D a ) +e ( c D b ) ) ) ) )
65simprd 114 . . . . 5  |-  ( D  e.  (PsMet `  X
)  ->  A. a  e.  X  ( (
a D a )  =  0  /\  A. b  e.  X  A. c  e.  X  (
a D b )  <_  ( ( c D a ) +e ( c D b ) ) ) )
76r19.21bi 2638 . . . 4  |-  ( ( D  e.  (PsMet `  X )  /\  a  e.  X )  ->  (
( a D a )  =  0  /\ 
A. b  e.  X  A. c  e.  X  ( a D b )  <_  ( (
c D a ) +e ( c D b ) ) ) )
87simpld 112 . . 3  |-  ( ( D  e.  (PsMet `  X )  /\  a  e.  X )  ->  (
a D a )  =  0 )
98ralrimiva 2623 . 2  |-  ( D  e.  (PsMet `  X
)  ->  A. a  e.  X  ( a D a )  =  0 )
10 id 19 . . . . 5  |-  ( a  =  A  ->  a  =  A )
1110, 10oveq12d 6103 . . . 4  |-  ( a  =  A  ->  (
a D a )  =  ( A D A ) )
1211eqeq1d 2247 . . 3  |-  ( a  =  A  ->  (
( a D a )  =  0  <->  ( A D A )  =  0 ) )
1312rspcv 2925 . 2  |-  ( A  e.  X  ->  ( A. a  e.  X  ( a D a )  =  0  -> 
( A D A )  =  0 ) )
149, 13mpan9 281 1  |-  ( ( D  e.  (PsMet `  X )  /\  A  e.  X )  ->  ( A D A )  =  0 )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   A.wral 2528   {crab 2532   _Vcvv 2821   class class class wbr 4130    X. cxp 4772   -->wf 5373   ` cfv 5377  (class class class)co 6085    ^m cmap 6922   0cc0 8179   RR*cxr 8359    <_ cle 8361   +ecxad 10172  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
This proof depends on definitions:  df-bi 117  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-ral 2533  df-rex 2534  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-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  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-ov 6088  df-oprab 6089  df-mpo 6090  df-map 6924  df-pnf 8362  df-mnf 8363  df-xr 8364  df-psmet 14880
This theorem is used by:  psmetsym  15430  psmetge0  15432  psmetres2  15434  distspace  15436  xblcntrps  15514  ssblps  15526
  Copyright terms: Public domain W3C validator