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

Theorem squeeze0 9051
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 8223 . . . . 5  |-  ( A  e.  RR  ->  -.  A  <  A )
213ad2ant1 1042 . . . 4  |-  ( ( A  e.  RR  /\  0  <_  A  /\  A. x  e.  RR  (
0  <  x  ->  A  <  x ) )  ->  -.  A  <  A )
3 breq2 4087 . . . . . . 7  |-  ( x  =  A  ->  (
0  <  x  <->  0  <  A ) )
4 breq2 4087 . . . . . . 7  |-  ( x  =  A  ->  ( A  <  x  <->  A  <  A ) )
53, 4imbi12d 234 . . . . . 6  |-  ( x  =  A  ->  (
( 0  <  x  ->  A  <  x )  <-> 
( 0  <  A  ->  A  <  A ) ) )
65rspcva 2905 . . . . 5  |-  ( ( A  e.  RR  /\  A. x  e.  RR  (
0  <  x  ->  A  <  x ) )  ->  ( 0  < 
A  ->  A  <  A ) )
763adant2 1040 . . . 4  |-  ( ( A  e.  RR  /\  0  <_  A  /\  A. x  e.  RR  (
0  <  x  ->  A  <  x ) )  ->  ( 0  < 
A  ->  A  <  A ) )
82, 7mtod 667 . . 3  |-  ( ( A  e.  RR  /\  0  <_  A  /\  A. x  e.  RR  (
0  <  x  ->  A  <  x ) )  ->  -.  0  <  A )
9 simp1 1021 . . . 4  |-  ( ( A  e.  RR  /\  0  <_  A  /\  A. x  e.  RR  (
0  <  x  ->  A  <  x ) )  ->  A  e.  RR )
10 0red 8147 . . . 4  |-  ( ( A  e.  RR  /\  0  <_  A  /\  A. x  e.  RR  (
0  <  x  ->  A  <  x ) )  ->  0  e.  RR )
119, 10lenltd 8264 . . 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 1022 . 2  |-  ( ( A  e.  RR  /\  0  <_  A  /\  A. x  e.  RR  (
0  <  x  ->  A  <  x ) )  ->  0  <_  A
)
149, 10letri3d 8262 . 2  |-  ( ( A  e.  RR  /\  0  <_  A  /\  A. x  e.  RR  (
0  <  x  ->  A  <  x ) )  ->  ( A  =  0  <->  ( A  <_ 
0  /\  0  <_  A ) ) )
1512, 13, 14mpbir2and 950 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 1002    = wceq 1395    e. wcel 2200   A.wral 2508   class class class wbr 4083   RRcr 7998   0cc0 7999    < clt 8181    <_ cle 8182
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8090  ax-resscn 8091  ax-1re 8093  ax-addrcl 8096  ax-rnegex 8108  ax-pre-ltirr 8111  ax-pre-apti 8114
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-xp 4725  df-cnv 4727  df-pnf 8183  df-mnf 8184  df-xr 8185  df-ltxr 8186  df-le 8187
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator