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

Theorem ltmul2 8964
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 8700 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( A  <  B  <->  ( A  x.  C )  <  ( B  x.  C ) ) )
2 recn 8093 . . . 4  |-  ( C  e.  RR  ->  C  e.  CC )
3 recn 8093 . . . . . . 7  |-  ( A  e.  RR  ->  A  e.  CC )
4 mulcom 8089 . . . . . . 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 1019 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  CC )  ->  ( A  x.  C )  =  ( C  x.  A ) )
7 recn 8093 . . . . . . 7  |-  ( B  e.  RR  ->  B  e.  CC )
8 mulcom 8089 . . . . . . 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 1018 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  CC )  ->  ( B  x.  C )  =  ( C  x.  B ) )
116, 10breq12d 4072 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  CC )  ->  (
( A  x.  C
)  <  ( B  x.  C )  <->  ( C  x.  A )  <  ( C  x.  B )
) )
122, 11syl3an3 1285 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  (
( A  x.  C
)  <  ( B  x.  C )  <->  ( C  x.  A )  <  ( C  x.  B )
) )
13123adant3r 1238 . 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 981    = wceq 1373    e. wcel 2178   class class class wbr 4059  (class class class)co 5967   CCcc 7958   RRcr 7959   0cc0 7960    x. cmul 7965    < clt 8142
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-cnex 8051  ax-resscn 8052  ax-1cn 8053  ax-1re 8054  ax-icn 8055  ax-addcl 8056  ax-addrcl 8057  ax-mulcl 8058  ax-mulrcl 8059  ax-addcom 8060  ax-mulcom 8061  ax-addass 8062  ax-mulass 8063  ax-distr 8064  ax-i2m1 8065  ax-1rid 8067  ax-0id 8068  ax-rnegex 8069  ax-precex 8070  ax-cnre 8071  ax-pre-ltadd 8076  ax-pre-mulgt0 8077
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-nel 2474  df-ral 2491  df-rex 2492  df-reu 2493  df-rab 2495  df-v 2778  df-sbc 3006  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-br 4060  df-opab 4122  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-iota 5251  df-fun 5292  df-fv 5298  df-riota 5922  df-ov 5970  df-oprab 5971  df-mpo 5972  df-pnf 8144  df-mnf 8145  df-ltxr 8147  df-sub 8280  df-neg 8281
This theorem is referenced by:  ltmul12a  8968  mulgt1  8971  ltmulgt11  8972  lt2msq1  8993  ltdiv2  8995  ltmul2i  9031  ltmul2d  9896  ef01bndlem  12182  cos01gt0  12189  sin4lt0  12193  pockthg  12795  tangtx  15425  lgsdilem  15619  lgsquadlem1  15669  lgsquadlem2  15670
  Copyright terms: Public domain W3C validator