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

Theorem ltmul2 8928
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 8664 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( A  <  B  <->  ( A  x.  C )  <  ( B  x.  C ) ) )
2 recn 8057 . . . 4  |-  ( C  e.  RR  ->  C  e.  CC )
3 recn 8057 . . . . . . 7  |-  ( A  e.  RR  ->  A  e.  CC )
4 mulcom 8053 . . . . . . 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 1018 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  CC )  ->  ( A  x.  C )  =  ( C  x.  A ) )
7 recn 8057 . . . . . . 7  |-  ( B  e.  RR  ->  B  e.  CC )
8 mulcom 8053 . . . . . . 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 1017 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  CC )  ->  ( B  x.  C )  =  ( C  x.  B ) )
116, 10breq12d 4056 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  CC )  ->  (
( A  x.  C
)  <  ( B  x.  C )  <->  ( C  x.  A )  <  ( C  x.  B )
) )
122, 11syl3an3 1284 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  (
( A  x.  C
)  <  ( B  x.  C )  <->  ( C  x.  A )  <  ( C  x.  B )
) )
13123adant3r 1237 . 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 980    = wceq 1372    e. wcel 2175   class class class wbr 4043  (class class class)co 5943   CCcc 7922   RRcr 7923   0cc0 7924    x. cmul 7929    < clt 8106
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 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-pow 4217  ax-pr 4252  ax-un 4479  ax-setind 4584  ax-cnex 8015  ax-resscn 8016  ax-1cn 8017  ax-1re 8018  ax-icn 8019  ax-addcl 8020  ax-addrcl 8021  ax-mulcl 8022  ax-mulrcl 8023  ax-addcom 8024  ax-mulcom 8025  ax-addass 8026  ax-mulass 8027  ax-distr 8028  ax-i2m1 8029  ax-1rid 8031  ax-0id 8032  ax-rnegex 8033  ax-precex 8034  ax-cnre 8035  ax-pre-ltadd 8040  ax-pre-mulgt0 8041
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-fal 1378  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ne 2376  df-nel 2471  df-ral 2488  df-rex 2489  df-reu 2490  df-rab 2492  df-v 2773  df-sbc 2998  df-dif 3167  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-br 4044  df-opab 4105  df-id 4339  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-iota 5231  df-fun 5272  df-fv 5278  df-riota 5898  df-ov 5946  df-oprab 5947  df-mpo 5948  df-pnf 8108  df-mnf 8109  df-ltxr 8111  df-sub 8244  df-neg 8245
This theorem is referenced by:  ltmul12a  8932  mulgt1  8935  ltmulgt11  8936  lt2msq1  8957  ltdiv2  8959  ltmul2i  8995  ltmul2d  9860  ef01bndlem  12038  cos01gt0  12045  sin4lt0  12049  pockthg  12651  tangtx  15281  lgsdilem  15475  lgsquadlem1  15525  lgsquadlem2  15526
  Copyright terms: Public domain W3C validator