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

Theorem ltmul2 9176
Description: Multiplication of both sides of 'less than' by a positive number. Theorem I.19 of [Apostol] p. 20. (Contributed by NM, 13-Feb-2005.)
Assertion
Ref Expression
ltmul2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( A  <  B  <->  ( C  x.  A )  <  ( C  x.  B ) ) )

Proof of Theorem ltmul2
StepHypRef Expression
1 ltmul1 8910 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( A  <  B  <->  ( A  x.  C )  <  ( B  x.  C ) ) )
2 recn 8302 . . . 4  |-  ( C  e.  RR  ->  C  e.  CC )
3 recn 8302 . . . . . . 7  |-  ( A  e.  RR  ->  A  e.  CC )
4 mulcom 8298 . . . . . . 7  |-  ( ( A  e.  CC  /\  C  e.  CC )  ->  ( A  x.  C
)  =  ( C  x.  A ) )
53, 4sylan 283 . . . . . 6  |-  ( ( A  e.  RR  /\  C  e.  CC )  ->  ( A  x.  C
)  =  ( C  x.  A ) )
653adant2 1047 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  CC )  ->  ( A  x.  C )  =  ( C  x.  A ) )
7 recn 8302 . . . . . . 7  |-  ( B  e.  RR  ->  B  e.  CC )
8 mulcom 8298 . . . . . . 7  |-  ( ( B  e.  CC  /\  C  e.  CC )  ->  ( B  x.  C
)  =  ( C  x.  B ) )
97, 8sylan 283 . . . . . 6  |-  ( ( B  e.  RR  /\  C  e.  CC )  ->  ( B  x.  C
)  =  ( C  x.  B ) )
1093adant1 1046 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  CC )  ->  ( B  x.  C )  =  ( C  x.  B ) )
116, 10breq12d 4138 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  CC )  ->  (
( A  x.  C
)  <  ( B  x.  C )  <->  ( C  x.  A )  <  ( C  x.  B )
) )
122, 11syl3an3 1313 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  (
( A  x.  C
)  <  ( B  x.  C )  <->  ( C  x.  A )  <  ( C  x.  B )
) )
13123adant3r 1266 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( ( A  x.  C )  <  ( B  x.  C )  <->  ( C  x.  A )  <  ( C  x.  B ) ) )
141, 13bitrd 188 1  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( A  <  B  <->  ( C  x.  A )  <  ( C  x.  B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009    = wceq 1402    e. wcel 2209   class class class wbr 4125  (class class class)co 6075   CCcc 8167   RRcr 8168   0cc0 8169    x. cmul 8174    < clt 8350
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 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 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulrcl 8268  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-precex 8279  ax-cnre 8280  ax-pre-ltadd 8285  ax-pre-mulgt0 8286
This theorem 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-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-iota 5332  df-fun 5374  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-ltxr 8355  df-sub 8489  df-neg 8490
This theorem is referenced by:  ltmul12a  9180  mulgt1  9183  ltmulgt11  9184  lt2msq1  9205  ltdiv2  9207  ltmul2i  9243  ltmul2d  10119  ef01bndlem  12501  cos01gt0  12508  sin4lt0  12512  pockthg  13114  tangtx  15862  pellexlem2  16006  lgsdilem  16060  lgsquadlem1  16110  lgsquadlem2  16111
  Copyright terms: Public domain W3C validator