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

Theorem recgt0 9072
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 8348 . . . . 5  |-  0  <  1
2 0re 8222 . . . . . 6  |-  0  e.  RR
3 1re 8221 . . . . . 6  |-  1  e.  RR
42, 3ltnsymi 8321 . . . . 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 8848 . . . . . . . . . . 11  |-  ( ( A  e.  RR  /\  0  <  A )  ->  A #  0 )
87adantr 276 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  A #  0
)
96, 8rerecclapd 9056 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( 1  /  A )  e.  RR )
109renegcld 8601 . . . . . . . 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 9056 . . . . . . . . . . 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 8737 . . . . . . . . 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 529 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  0  <  A )
1810, 6, 16, 17mulgt0d 8344 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  0  <  (
-u ( 1  /  A )  x.  A
) )
1912recnd 8250 . . . . . . . . . . 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 8901 . . . . . . . . . 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 8632 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( -u (
1  /  A )  x.  A )  = 
-u ( ( 1  /  A )  x.  A ) )
24 recidap2 8909 . . . . . . . . . 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 8416 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  -u ( ( 1  /  A )  x.  A )  = 
-u 1 )
2723, 26eqtrd 2264 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( -u (
1  /  A )  x.  A )  = 
-u 1 )
2818, 27breqtrd 4119 . . . . . 6  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  0  <  -u 1 )
29 1red 8237 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  1  e.  RR )
3029lt0neg1d 8737 . . . . . 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 670 . . 3  |-  ( ( A  e.  RR  /\  0  <  A )  ->  -.  ( 1  /  A
)  <  0 )
34 lenlt 8297 . . . 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 8907 . . . 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 8214 . . . 4  |-  0  e.  CC
41 apsym 8828 . . . 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 8854 . . 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 953 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 1398    e. wcel 2202   class class class wbr 4093  (class class class)co 6028   CCcc 8073   RRcr 8074   0cc0 8075   1c1 8076    x. cmul 8080    < clt 8256    <_ cle 8257   -ucneg 8393   # cap 8803    / cdiv 8894
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-mulrcl 8174  ax-addcom 8175  ax-mulcom 8176  ax-addass 8177  ax-mulass 8178  ax-distr 8179  ax-i2m1 8180  ax-0lt1 8181  ax-1rid 8182  ax-0id 8183  ax-rnegex 8184  ax-precex 8185  ax-cnre 8186  ax-pre-ltirr 8187  ax-pre-ltwlin 8188  ax-pre-lttrn 8189  ax-pre-apti 8190  ax-pre-ltadd 8191  ax-pre-mulgt0 8192  ax-pre-mulext 8193
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-id 4396  df-po 4399  df-iso 4400  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-iota 5293  df-fun 5335  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-pnf 8258  df-mnf 8259  df-xr 8260  df-ltxr 8261  df-le 8262  df-sub 8394  df-neg 8395  df-reap 8797  df-ap 8804  df-div 8895
This theorem is referenced by:  prodgt0gt0  9073  ltdiv1  9090  ltrec1  9110  lerec2  9111  lediv12a  9116  recgt1i  9120  recreclt  9122  recgt0i  9128  recgt0ii  9129  recgt0d  9156  nnrecgt0  9223  nnrecl  9442
  Copyright terms: Public domain W3C validator