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

Theorem recgt0 10161
Description: The reciprocal of a positive number is positive. Exercise 4 of [Apostol] p. 21. (Contributed by NM, 25-Aug-1999.) (Revised by Mario Carneiro, 27-May-2016.)
Assertion
Ref Expression
recgt0  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
0  <  ( 1  /  A ) )

Proof of Theorem recgt0
StepHypRef Expression
1 simpl 454 . . . . . . 7  |-  ( ( A  e.  RR  /\  0  <  A )  ->  A  e.  RR )
21recnd 9400 . . . . . 6  |-  ( ( A  e.  RR  /\  0  <  A )  ->  A  e.  CC )
3 gt0ne0 9792 . . . . . 6  |-  ( ( A  e.  RR  /\  0  <  A )  ->  A  =/=  0 )
42, 3recne0d 10089 . . . . 5  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
( 1  /  A
)  =/=  0 )
54necomd 2685 . . . 4  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
0  =/=  ( 1  /  A ) )
65neneqd 2614 . . 3  |-  ( ( A  e.  RR  /\  0  <  A )  ->  -.  0  =  (
1  /  A ) )
7 0lt1 9850 . . . . 5  |-  0  <  1
8 0re 9374 . . . . . 6  |-  0  e.  RR
9 1re 9373 . . . . . 6  |-  1  e.  RR
108, 9ltnsymi 9481 . . . . 5  |-  ( 0  <  1  ->  -.  1  <  0 )
117, 10ax-mp 5 . . . 4  |-  -.  1  <  0
12 simpll 746 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  A  e.  RR )
133adantr 462 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  A  =/=  0 )
1412, 13rereccld 10146 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( 1  /  A )  e.  RR )
1514renegcld 9763 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  -u ( 1  /  A )  e.  RR )
16 simpr 458 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( 1  /  A )  <  0 )
171, 3rereccld 10146 . . . . . . . . . . 11  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
( 1  /  A
)  e.  RR )
1817adantr 462 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( 1  /  A )  e.  RR )
1918lt0neg1d 9897 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( (
1  /  A )  <  0  <->  0  <  -u ( 1  /  A
) ) )
2016, 19mpbid 210 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  0  <  -u ( 1  /  A
) )
21 simplr 747 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  0  <  A )
2215, 12, 20, 21mulgt0d 9514 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  0  <  (
-u ( 1  /  A )  x.  A
) )
232adantr 462 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  A  e.  CC )
2423, 13reccld 10088 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( 1  /  A )  e.  CC )
2524, 23mulneg1d 9785 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( -u (
1  /  A )  x.  A )  = 
-u ( ( 1  /  A )  x.  A ) )
2623, 13recid2d 10091 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( (
1  /  A )  x.  A )  =  1 )
2726negeqd 9592 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  -u ( ( 1  /  A )  x.  A )  = 
-u 1 )
2825, 27eqtrd 2465 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( -u (
1  /  A )  x.  A )  = 
-u 1 )
2922, 28breqtrd 4304 . . . . . 6  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  0  <  -u 1 )
30 1red 9389 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  1  e.  RR )
3130lt0neg1d 9897 . . . . . 6  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( 1  <  0  <->  0  <  -u 1 ) )
3229, 31mpbird 232 . . . . 5  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  1  <  0 )
3332ex 434 . . . 4  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
( ( 1  /  A )  <  0  ->  1  <  0 ) )
3411, 33mtoi 178 . . 3  |-  ( ( A  e.  RR  /\  0  <  A )  ->  -.  ( 1  /  A
)  <  0 )
35 ioran 487 . . 3  |-  ( -.  ( 0  =  ( 1  /  A )  \/  ( 1  /  A )  <  0
)  <->  ( -.  0  =  ( 1  /  A )  /\  -.  ( 1  /  A
)  <  0 ) )
366, 34, 35sylanbrc 657 . 2  |-  ( ( A  e.  RR  /\  0  <  A )  ->  -.  ( 0  =  ( 1  /  A )  \/  ( 1  /  A )  <  0
) )
37 axlttri 9434 . . 3  |-  ( ( 0  e.  RR  /\  ( 1  /  A
)  e.  RR )  ->  ( 0  < 
( 1  /  A
)  <->  -.  ( 0  =  ( 1  /  A )  \/  (
1  /  A )  <  0 ) ) )
388, 17, 37sylancr 656 . 2  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
( 0  <  (
1  /  A )  <->  -.  ( 0  =  ( 1  /  A )  \/  ( 1  /  A )  <  0
) ) )
3936, 38mpbird 232 1  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
0  <  ( 1  /  A ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 184    \/ wo 368    /\ wa 369    = wceq 1362    e. wcel 1755    =/= wne 2596   class class class wbr 4280  (class class class)co 6080   CCcc 9268   RRcr 9269   0cc0 9270   1c1 9271    x. cmul 9275    < clt 9406   -ucneg 9584    / cdiv 9981
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1594  ax-4 1605  ax-5 1669  ax-6 1707  ax-7 1727  ax-8 1757  ax-9 1759  ax-10 1774  ax-11 1779  ax-12 1791  ax-13 1942  ax-ext 2414  ax-sep 4401  ax-nul 4409  ax-pow 4458  ax-pr 4519  ax-un 6361  ax-resscn 9327  ax-1cn 9328  ax-icn 9329  ax-addcl 9330  ax-addrcl 9331  ax-mulcl 9332  ax-mulrcl 9333  ax-mulcom 9334  ax-addass 9335  ax-mulass 9336  ax-distr 9337  ax-i2m1 9338  ax-1ne0 9339  ax-1rid 9340  ax-rnegex 9341  ax-rrecex 9342  ax-cnre 9343  ax-pre-lttri 9344  ax-pre-lttrn 9345  ax-pre-ltadd 9346  ax-pre-mulgt0 9347
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 959  df-3an 960  df-tru 1365  df-ex 1590  df-nf 1593  df-sb 1700  df-eu 2258  df-mo 2259  df-clab 2420  df-cleq 2426  df-clel 2429  df-nfc 2558  df-ne 2598  df-nel 2599  df-ral 2710  df-rex 2711  df-reu 2712  df-rmo 2713  df-rab 2714  df-v 2964  df-sbc 3176  df-csb 3277  df-dif 3319  df-un 3321  df-in 3323  df-ss 3330  df-nul 3626  df-if 3780  df-pw 3850  df-sn 3866  df-pr 3868  df-op 3872  df-uni 4080  df-br 4281  df-opab 4339  df-mpt 4340  df-id 4623  df-po 4628  df-so 4629  df-xp 4833  df-rel 4834  df-cnv 4835  df-co 4836  df-dm 4837  df-rn 4838  df-res 4839  df-ima 4840  df-iota 5369  df-fun 5408  df-fn 5409  df-f 5410  df-f1 5411  df-fo 5412  df-f1o 5413  df-fv 5414  df-riota 6039  df-ov 6083  df-oprab 6084  df-mpt2 6085  df-er 7089  df-en 7299  df-dom 7300  df-sdom 7301  df-pnf 9408  df-mnf 9409  df-xr 9410  df-ltxr 9411  df-le 9412  df-sub 9585  df-neg 9586  df-div 9982
This theorem is referenced by:  prodgt0  10162  ltdiv1  10181  ltrec1  10207  lerec2  10208  lediv12a  10213  recgt1i  10217  recreclt  10219  recgt0i  10225  recgt0d  10255  nnrecgt0  10347  nnrecl  10565  resqrex  12724  leopmul  25361  cdj1i  25660
  Copyright terms: Public domain W3C validator