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

Theorem squeeze0 9178
Description: If a nonnegative number is less than any positive number, it is zero. (Contributed by NM, 11-Feb-2006.)
Assertion
Ref Expression
squeeze0  |-  ( ( A  e.  RR  /\  0  <_  A  /\  A. x  e.  RR  (
0  <  x  ->  A  <  x ) )  ->  A  =  0 )
Distinct variable group:    x, A

Proof of Theorem squeeze0
StepHypRef Expression
1 ltnr 8350 . . . . 5  |-  ( A  e.  RR  ->  -.  A  <  A )
213ad2ant1 1045 . . . 4  |-  ( ( A  e.  RR  /\  0  <_  A  /\  A. x  e.  RR  (
0  <  x  ->  A  <  x ) )  ->  -.  A  <  A )
3 breq2 4113 . . . . . . 7  |-  ( x  =  A  ->  (
0  <  x  <->  0  <  A ) )
4 breq2 4113 . . . . . . 7  |-  ( x  =  A  ->  ( A  <  x  <->  A  <  A ) )
53, 4imbi12d 234 . . . . . 6  |-  ( x  =  A  ->  (
( 0  <  x  ->  A  <  x )  <-> 
( 0  <  A  ->  A  <  A ) ) )
65rspcva 2919 . . . . 5  |-  ( ( A  e.  RR  /\  A. x  e.  RR  (
0  <  x  ->  A  <  x ) )  ->  ( 0  < 
A  ->  A  <  A ) )
763adant2 1043 . . . 4  |-  ( ( A  e.  RR  /\  0  <_  A  /\  A. x  e.  RR  (
0  <  x  ->  A  <  x ) )  ->  ( 0  < 
A  ->  A  <  A ) )
82, 7mtod 669 . . 3  |-  ( ( A  e.  RR  /\  0  <_  A  /\  A. x  e.  RR  (
0  <  x  ->  A  <  x ) )  ->  -.  0  <  A )
9 simp1 1024 . . . 4  |-  ( ( A  e.  RR  /\  0  <_  A  /\  A. x  e.  RR  (
0  <  x  ->  A  <  x ) )  ->  A  e.  RR )
10 0red 8275 . . . 4  |-  ( ( A  e.  RR  /\  0  <_  A  /\  A. x  e.  RR  (
0  <  x  ->  A  <  x ) )  ->  0  e.  RR )
119, 10lenltd 8391 . . 3  |-  ( ( A  e.  RR  /\  0  <_  A  /\  A. x  e.  RR  (
0  <  x  ->  A  <  x ) )  ->  ( A  <_ 
0  <->  -.  0  <  A ) )
128, 11mpbird 167 . 2  |-  ( ( A  e.  RR  /\  0  <_  A  /\  A. x  e.  RR  (
0  <  x  ->  A  <  x ) )  ->  A  <_  0
)
13 simp2 1025 . 2  |-  ( ( A  e.  RR  /\  0  <_  A  /\  A. x  e.  RR  (
0  <  x  ->  A  <  x ) )  ->  0  <_  A
)
149, 10letri3d 8389 . 2  |-  ( ( A  e.  RR  /\  0  <_  A  /\  A. x  e.  RR  (
0  <  x  ->  A  <  x ) )  ->  ( A  =  0  <->  ( A  <_ 
0  /\  0  <_  A ) ) )
1512, 13, 14mpbir2and 953 1  |-  ( ( A  e.  RR  /\  0  <_  A  /\  A. x  e.  RR  (
0  <  x  ->  A  <  x ) )  ->  A  =  0 )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ w3a 1005    = wceq 1398    e. wcel 2203   A.wral 2520   class class class wbr 4109   RRcr 8126   0cc0 8127    < clt 8308    <_ cle 8309
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1re 8221  ax-addrcl 8224  ax-rnegex 8236  ax-pre-ltirr 8239  ax-pre-apti 8242
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-rab 2529  df-v 2815  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-xp 4755  df-cnv 4757  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator