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

Theorem recgt0 8809
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 8086 . . . . 5  |-  0  <  1
2 0re 7959 . . . . . 6  |-  0  e.  RR
3 1re 7958 . . . . . 6  |-  1  e.  RR
42, 3ltnsymi 8059 . . . . 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 8585 . . . . . . . . . . 11  |-  ( ( A  e.  RR  /\  0  <  A )  ->  A #  0 )
87adantr 276 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  A #  0
)
96, 8rerecclapd 8793 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( 1  /  A )  e.  RR )
109renegcld 8339 . . . . . . . 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 8793 . . . . . . . . . . 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 8474 . . . . . . . . 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 8082 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  0  <  (
-u ( 1  /  A )  x.  A
) )
1912recnd 7988 . . . . . . . . . . 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 8638 . . . . . . . . . 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 8370 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( -u (
1  /  A )  x.  A )  = 
-u ( ( 1  /  A )  x.  A ) )
24 recidap2 8646 . . . . . . . . . 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 8154 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  -u ( ( 1  /  A )  x.  A )  = 
-u 1 )
2723, 26eqtrd 2210 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  ( -u (
1  /  A )  x.  A )  = 
-u 1 )
2818, 27breqtrd 4031 . . . . . 6  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  0  <  -u 1 )
29 1red 7974 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( 1  /  A )  <  0
)  ->  1  e.  RR )
3029lt0neg1d 8474 . . . . . 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 664 . . 3  |-  ( ( A  e.  RR  /\  0  <  A )  ->  -.  ( 1  /  A
)  <  0 )
34 lenlt 8035 . . . 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 8644 . . . 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 7951 . . . 4  |-  0  e.  CC
41 apsym 8565 . . . 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 8591 . . 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 944 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 1353    e. wcel 2148   class class class wbr 4005  (class class class)co 5877   CCcc 7811   RRcr 7812   0cc0 7813   1c1 7814    x. cmul 7818    < clt 7994    <_ cle 7995   -ucneg 8131   # cap 8540    / cdiv 8631
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-cnex 7904  ax-resscn 7905  ax-1cn 7906  ax-1re 7907  ax-icn 7908  ax-addcl 7909  ax-addrcl 7910  ax-mulcl 7911  ax-mulrcl 7912  ax-addcom 7913  ax-mulcom 7914  ax-addass 7915  ax-mulass 7916  ax-distr 7917  ax-i2m1 7918  ax-0lt1 7919  ax-1rid 7920  ax-0id 7921  ax-rnegex 7922  ax-precex 7923  ax-cnre 7924  ax-pre-ltirr 7925  ax-pre-ltwlin 7926  ax-pre-lttrn 7927  ax-pre-apti 7928  ax-pre-ltadd 7929  ax-pre-mulgt0 7930  ax-pre-mulext 7931
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2741  df-sbc 2965  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-br 4006  df-opab 4067  df-id 4295  df-po 4298  df-iso 4299  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-iota 5180  df-fun 5220  df-fv 5226  df-riota 5833  df-ov 5880  df-oprab 5881  df-mpo 5882  df-pnf 7996  df-mnf 7997  df-xr 7998  df-ltxr 7999  df-le 8000  df-sub 8132  df-neg 8133  df-reap 8534  df-ap 8541  df-div 8632
This theorem is referenced by:  prodgt0gt0  8810  ltdiv1  8827  ltrec1  8847  lerec2  8848  lediv12a  8853  recgt1i  8857  recreclt  8859  recgt0i  8865  recgt0ii  8866  recgt0d  8893  nnrecgt0  8959  nnrecl  9176
  Copyright terms: Public domain W3C validator