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

Theorem nsmallnq 8601
Description: The is no smallest positive fraction. (Contributed by NM, 26-Apr-1996.) (Revised by Mario Carneiro, 10-May-2013.) (New usage is discouraged.)
Assertion
Ref Expression
nsmallnq  |-  ( A  e.  Q.  ->  E. x  x  <Q  A )
Distinct variable group:    x, A

Proof of Theorem nsmallnq
StepHypRef Expression
1 halfnq 8600 . 2  |-  ( A  e.  Q.  ->  E. x
( x  +Q  x
)  =  A )
2 eleq1a 2352 . . . . 5  |-  ( A  e.  Q.  ->  (
( x  +Q  x
)  =  A  -> 
( x  +Q  x
)  e.  Q. )
)
3 addnqf 8572 . . . . . . . 8  |-  +Q  :
( Q.  X.  Q. )
--> Q.
43fdmi 5394 . . . . . . 7  |-  dom  +Q  =  ( Q.  X.  Q. )
5 0nnq 8548 . . . . . . 7  |-  -.  (/)  e.  Q.
64, 5ndmovrcl 6006 . . . . . 6  |-  ( ( x  +Q  x )  e.  Q.  ->  (
x  e.  Q.  /\  x  e.  Q. )
)
7 ltaddnq 8598 . . . . . 6  |-  ( ( x  e.  Q.  /\  x  e.  Q. )  ->  x  <Q  ( x  +Q  x ) )
86, 7syl 15 . . . . 5  |-  ( ( x  +Q  x )  e.  Q.  ->  x  <Q  ( x  +Q  x
) )
92, 8syl6 29 . . . 4  |-  ( A  e.  Q.  ->  (
( x  +Q  x
)  =  A  ->  x  <Q  ( x  +Q  x ) ) )
10 breq2 4027 . . . 4  |-  ( ( x  +Q  x )  =  A  ->  (
x  <Q  ( x  +Q  x )  <->  x  <Q  A ) )
119, 10mpbidi 207 . . 3  |-  ( A  e.  Q.  ->  (
( x  +Q  x
)  =  A  ->  x  <Q  A ) )
1211eximdv 1608 . 2  |-  ( A  e.  Q.  ->  ( E. x ( x  +Q  x )  =  A  ->  E. x  x  <Q  A ) )
131, 12mpd 14 1  |-  ( A  e.  Q.  ->  E. x  x  <Q  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358   E.wex 1528    = wceq 1623    e. wcel 1684   class class class wbr 4023    X. cxp 4687  (class class class)co 5858   Q.cnq 8474    +Q cplq 8477    <Q cltq 8480
This theorem is referenced by:  ltbtwnnq  8602  nqpr  8638  reclem2pr  8672
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
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-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-pss 3168  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-tp 3648  df-op 3649  df-uni 3828  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-tr 4114  df-eprel 4305  df-id 4309  df-po 4314  df-so 4315  df-fr 4352  df-we 4354  df-ord 4395  df-on 4396  df-lim 4397  df-suc 4398  df-om 4657  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-recs 6388  df-rdg 6423  df-1o 6479  df-oadd 6483  df-omul 6484  df-er 6660  df-ni 8496  df-pli 8497  df-mi 8498  df-lti 8499  df-plpq 8532  df-mpq 8533  df-ltpq 8534  df-enq 8535  df-nq 8536  df-erq 8537  df-plq 8538  df-mq 8539  df-1nq 8540  df-rq 8541  df-ltnq 8542
  Copyright terms: Public domain W3C validator