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

Theorem recgt0 8869
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 0lt1 8146 . . . . 5  |-  0  <  1
2 0re 8019 . . . . . 6  |-  0  e.  RR
3 1re 8018 . . . . . 6  |-  1  e.  RR
42, 3ltnsymi 8119 . . . . 5  |-  ( 0  <  1  ->  -.  1  <  0 )
51, 4ax-mp 5 . . . 4  |-  -.  1  <  0
6 simpll 527 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  A  e.  RR )
7 gt0ap0 8645 . . . . . . . . . . 11  |-  ( ( A  e.  RR  /\  0  <  A )  ->  A #  0 )
87adantr 276 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  A #  0
)
96, 8rerecclapd 8853 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( 1  /  A )  e.  RR )
109renegcld 8399 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  -u ( 1  /  A )  e.  RR )
11 simpr 110 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( 1  /  A )  <  0 )
12 simpl 109 . . . . . . . . . . . 12  |-  ( ( A  e.  RR  /\  0  <  A )  ->  A  e.  RR )
1312, 7rerecclapd 8853 . . . . . . . . . . 11  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
( 1  /  A
)  e.  RR )
1413adantr 276 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( 1  /  A )  e.  RR )
1514lt0neg1d 8534 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( (
1  /  A )  <  0  <->  0  <  -u ( 1  /  A
) ) )
1611, 15mpbid 147 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  0  <  -u ( 1  /  A
) )
17 simplr 528 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  0  <  A )
1810, 6, 16, 17mulgt0d 8142 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  0  <  (
-u ( 1  /  A )  x.  A
) )
1912recnd 8048 . . . . . . . . . . 11  |-  ( ( A  e.  RR  /\  0  <  A )  ->  A  e.  CC )
2019adantr 276 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  A  e.  CC )
21 recclap 8698 . . . . . . . . . 10  |-  ( ( A  e.  CC  /\  A #  0 )  ->  (
1  /  A )  e.  CC )
2220, 8, 21syl2anc 411 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( 1  /  A )  e.  CC )
2322, 20mulneg1d 8430 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( -u (
1  /  A )  x.  A )  = 
-u ( ( 1  /  A )  x.  A ) )
24 recidap2 8706 . . . . . . . . . 10  |-  ( ( A  e.  CC  /\  A #  0 )  ->  (
( 1  /  A
)  x.  A )  =  1 )
2520, 8, 24syl2anc 411 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( (
1  /  A )  x.  A )  =  1 )
2625negeqd 8214 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  -u ( ( 1  /  A )  x.  A )  = 
-u 1 )
2723, 26eqtrd 2226 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( -u (
1  /  A )  x.  A )  = 
-u 1 )
2818, 27breqtrd 4055 . . . . . 6  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  0  <  -u 1 )
29 1red 8034 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  1  e.  RR )
3029lt0neg1d 8534 . . . . . 6  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( 1  <  0  <->  0  <  -u 1 ) )
3128, 30mpbird 167 . . . . 5  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  1  <  0 )
3231ex 115 . . . 4  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
( ( 1  /  A )  <  0  ->  1  <  0 ) )
335, 32mtoi 665 . . 3  |-  ( ( A  e.  RR  /\  0  <  A )  ->  -.  ( 1  /  A
)  <  0 )
34 lenlt 8095 . . . 4  |-  ( ( 0  e.  RR  /\  ( 1  /  A
)  e.  RR )  ->  ( 0  <_ 
( 1  /  A
)  <->  -.  ( 1  /  A )  <  0 ) )
352, 13, 34sylancr 414 . . 3  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
( 0  <_  (
1  /  A )  <->  -.  ( 1  /  A
)  <  0 ) )
3633, 35mpbird 167 . 2  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
0  <_  ( 1  /  A ) )
37 recap0 8704 . . . 4  |-  ( ( A  e.  CC  /\  A #  0 )  ->  (
1  /  A ) #  0 )
3819, 7, 37syl2anc 411 . . 3  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
( 1  /  A
) #  0 )
3919, 7, 21syl2anc 411 . . . 4  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
( 1  /  A
)  e.  CC )
40 0cn 8011 . . . 4  |-  0  e.  CC
41 apsym 8625 . . . 4  |-  ( ( ( 1  /  A
)  e.  CC  /\  0  e.  CC )  ->  ( ( 1  /  A ) #  0  <->  0 #  (
1  /  A ) ) )
4239, 40, 41sylancl 413 . . 3  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
( ( 1  /  A ) #  0  <->  0 #  (
1  /  A ) ) )
4338, 42mpbid 147 . 2  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
0 #  ( 1  /  A ) )
44 ltleap 8651 . . 3  |-  ( ( 0  e.  RR  /\  ( 1  /  A
)  e.  RR )  ->  ( 0  < 
( 1  /  A
)  <->  ( 0  <_ 
( 1  /  A
)  /\  0 #  (
1  /  A ) ) ) )
452, 13, 44sylancr 414 . 2  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
( 0  <  (
1  /  A )  <-> 
( 0  <_  (
1  /  A )  /\  0 #  ( 1  /  A ) ) ) )
4636, 43, 45mpbir2and 946 1  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
0  <  ( 1  /  A ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1364    e. wcel 2164   class class class wbr 4029  (class class class)co 5918   CCcc 7870   RRcr 7871   0cc0 7872   1c1 7873    x. cmul 7877    < clt 8054    <_ cle 8055   -ucneg 8191   # cap 8600    / cdiv 8691
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-mulrcl 7971  ax-addcom 7972  ax-mulcom 7973  ax-addass 7974  ax-mulass 7975  ax-distr 7976  ax-i2m1 7977  ax-0lt1 7978  ax-1rid 7979  ax-0id 7980  ax-rnegex 7981  ax-precex 7982  ax-cnre 7983  ax-pre-ltirr 7984  ax-pre-ltwlin 7985  ax-pre-lttrn 7986  ax-pre-apti 7987  ax-pre-ltadd 7988  ax-pre-mulgt0 7989  ax-pre-mulext 7990
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-opab 4091  df-id 4324  df-po 4327  df-iso 4328  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-iota 5215  df-fun 5256  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-pnf 8056  df-mnf 8057  df-xr 8058  df-ltxr 8059  df-le 8060  df-sub 8192  df-neg 8193  df-reap 8594  df-ap 8601  df-div 8692
This theorem is referenced by:  prodgt0gt0  8870  ltdiv1  8887  ltrec1  8907  lerec2  8908  lediv12a  8913  recgt1i  8917  recreclt  8919  recgt0i  8925  recgt0ii  8926  recgt0d  8953  nnrecgt0  9020  nnrecl  9238
  Copyright terms: Public domain W3C validator