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

Theorem recgt0 9180
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 8453 . . . . 5  |-  0  <  1
2 0re 8326 . . . . . 6  |-  0  e.  RR
3 1re 8325 . . . . . 6  |-  1  e.  RR
42, 3ltnsymi 8425 . . . . 5  |-  ( 0  <  1  ->  -.  1  <  0 )
51, 4ax-mp 5 . . . 4  |-  -.  1  <  0
6 simpll 531 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  A  e.  RR )
7 gt0ap0 8954 . . . . . . . . . . 11  |-  ( ( A  e.  RR  /\  0  <  A )  ->  A #  0 )
87adantr 276 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  A #  0
)
96, 8rerecclapd 9164 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( 1  /  A )  e.  RR )
109renegcld 8707 . . . . . . . 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 9164 . . . . . . . . . . 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 8843 . . . . . . . . 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 533 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  0  <  A )
1810, 6, 16, 17mulgt0d 8449 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  0  <  (
-u ( 1  /  A )  x.  A
) )
1912recnd 8354 . . . . . . . . . . 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 9009 . . . . . . . . . 10  |-  ( ( A  e.  CC  /\  A #  0 )  ->  (
1  /  A )  e.  CC )
2220, 8, 21syl2anc 415 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( 1  /  A )  e.  CC )
2322, 20mulneg1d 8738 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( -u (
1  /  A )  x.  A )  = 
-u ( ( 1  /  A )  x.  A ) )
24 recidap2 9017 . . . . . . . . . 10  |-  ( ( A  e.  CC  /\  A #  0 )  ->  (
( 1  /  A
)  x.  A )  =  1 )
2520, 8, 24syl2anc 415 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( (
1  /  A )  x.  A )  =  1 )
2625negeqd 8521 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  -u ( ( 1  /  A )  x.  A )  = 
-u 1 )
2723, 26eqtrd 2271 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( -u (
1  /  A )  x.  A )  = 
-u 1 )
2818, 27breqtrd 4156 . . . . . 6  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  0  <  -u 1 )
29 1red 8341 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  1  e.  RR )
3029lt0neg1d 8843 . . . . . 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 674 . . 3  |-  ( ( A  e.  RR  /\  0  <  A )  ->  -.  ( 1  /  A
)  <  0 )
34 lenlt 8401 . . . 4  |-  ( ( 0  e.  RR  /\  ( 1  /  A
)  e.  RR )  ->  ( 0  <_ 
( 1  /  A
)  <->  -.  ( 1  /  A )  <  0 ) )
352, 13, 34sylancr 418 . . 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 9015 . . . 4  |-  ( ( A  e.  CC  /\  A #  0 )  ->  (
1  /  A ) #  0 )
3819, 7, 37syl2anc 415 . . 3  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
( 1  /  A
) #  0 )
3919, 7, 21syl2anc 415 . . . 4  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
( 1  /  A
)  e.  CC )
40 0cn 8318 . . . 4  |-  0  e.  CC
41 apsym 8934 . . . 4  |-  ( ( ( 1  /  A
)  e.  CC  /\  0  e.  CC )  ->  ( ( 1  /  A ) #  0  <->  0 #  (
1  /  A ) ) )
4239, 40, 41sylancl 417 . . 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 8960 . . 3  |-  ( ( 0  e.  RR  /\  ( 1  /  A
)  e.  RR )  ->  ( 0  < 
( 1  /  A
)  <->  ( 0  <_ 
( 1  /  A
)  /\  0 #  (
1  /  A ) ) ) )
452, 13, 44sylancr 418 . 2  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
( 0  <  (
1  /  A )  <-> 
( 0  <_  (
1  /  A )  /\  0 #  ( 1  /  A ) ) ) )
4636, 43, 45mpbir2and 957 1  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
0  <  ( 1  /  A ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   class class class wbr 4130  (class class class)co 6085   CCcc 8177   RRcr 8178   0cc0 8179   1c1 8180    x. cmul 8184    < clt 8360    <_ cle 8361   -ucneg 8498   # cap 8909    / cdiv 9002
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-po 4441  df-iso 4442  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003
This theorem is used by:  prodgt0gt0  9181  ltdiv1  9198  ltrec1  9218  lerec2  9219  lediv12a  9224  recgt1i  9228  recreclt  9230  recgt0i  9236  recgt0ii  9237  recgt0d  9264  nnrecgt0  9342  nnrecl  9561
  Copyright terms: Public domain W3C validator