Theorem ltmul2 9817

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

Step	Hyp	Ref	Expression
1		ltmul1 9816	. 2 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ 0 < C ) ) -> ( A < B <-> ( A x. C ) < ( B x. C ) ) )
2		recn 9036	. . . 4 |- ( C e. RR -> C e. CC )
3		recn 9036	. . . . . . 7 |- ( A e. RR -> A e. CC )
4		mulcom 9032	. . . . . . 7 |- ( ( A e. CC /\ C e. CC ) -> ( A x. C ) = ( C x. A ) )
5	3, 4	sylan 458	. . . . . 6 |- ( ( A e. RR /\ C e. CC ) -> ( A x. C ) = ( C x. A ) )
6	5	3adant2 976	. . . . 5 |- ( ( A e. RR /\ B e. RR /\ C e. CC ) -> ( A x. C ) = ( C x. A ) )
7		recn 9036	. . . . . . 7 |- ( B e. RR -> B e. CC )
8		mulcom 9032	. . . . . . 7 |- ( ( B e. CC /\ C e. CC ) -> ( B x. C ) = ( C x. B ) )
9	7, 8	sylan 458	. . . . . 6 |- ( ( B e. RR /\ C e. CC ) -> ( B x. C ) = ( C x. B ) )
10	9	3adant1 975	. . . . 5 |- ( ( A e. RR /\ B e. RR /\ C e. CC ) -> ( B x. C ) = ( C x. B ) )
11	6, 10	breq12d 4185	. . . 4 |- ( ( A e. RR /\ B e. RR /\ C e. CC ) -> ( ( A x. C ) < ( B x. C ) <-> ( C x. A ) < ( C x. B ) ) )
12	2, 11	syl3an3 1219	. . 3 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( A x. C ) < ( B x. C ) <-> ( C x. A ) < ( C x. B ) ) )
13	12	3adant3r 1181	. 2 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ 0 < C ) ) -> ( ( A x. C ) < ( B x. C ) <-> ( C x. A ) < ( C x. B ) ) )
14	1, 13	bitrd 245	1 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ 0 < C ) ) -> ( A < B <-> ( C x. A ) < ( C x. B ) ) )

Syntax hints:   -> wi 4   <-> wb 177   /\ wa 359   /\ w3a 936   = wceq 1649   e. wcel 1721   class class class wbr 4172  (class class class)co 6040   CCcc 8944   RRcr 8945   0cc0 8946   x. cmul 8951   < clt 9076

This theorem is referenced by:  ltmul12a  9822  mulgt1  9825  ltmulgt11  9826  lt2msq1  9849  ltdiv2  9851  ltmul2i  9888  ltmul2d  10642  ef01bndlem  12740  cos01gt0  12747  sin4lt0  12751  iserodd  13164  pockthg  13229  prmreclem1  13239  prmreclem5  13243  blcvx  18782  dvcvx  19857  itgulm  20277  tangtx  20366  chtub  20949  bposlem1  21021  bposlem2  21022  bposlem7  21027  lgsdilem  21059  lgsquadlem1  21091  lgsquadlem2  21092  chebbnd1lem3  21118  chto1ub  21123  pntlemb  21244  irrapxlem1  26775  irrapxlem2  26776  irrapxlem5  26779  pellexlem2  26783  rmspecsqrnq  26859  stoweidlem11  27627  stoweidlem26  27642

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-13 1723  ax-14 1725  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2385  ax-sep 4290  ax-nul 4298  ax-pow 4337  ax-pr 4363  ax-un 4660  ax-resscn 9003  ax-1cn 9004  ax-icn 9005  ax-addcl 9006  ax-addrcl 9007  ax-mulcl 9008  ax-mulrcl 9009  ax-mulcom 9010  ax-addass 9011  ax-mulass 9012  ax-distr 9013  ax-i2m1 9014  ax-1ne0 9015  ax-1rid 9016  ax-rnegex 9017  ax-rrecex 9018  ax-cnre 9019  ax-pre-lttri 9020  ax-pre-lttrn 9021  ax-pre-ltadd 9022  ax-pre-mulgt0 9023

This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2258  df-mo 2259  df-clab 2391  df-cleq 2397  df-clel 2400  df-nfc 2529  df-ne 2569  df-nel 2570  df-ral 2671  df-rex 2672  df-reu 2673  df-rab 2675  df-v 2918  df-sbc 3122  df-csb 3212  df-dif 3283  df-un 3285  df-in 3287  df-ss 3294  df-nul 3589  df-if 3700  df-pw 3761  df-sn 3780  df-pr 3781  df-op 3783  df-uni 3976  df-br 4173  df-opab 4227  df-mpt 4228  df-id 4458  df-po 4463  df-so 4464  df-xp 4843  df-rel 4844  df-cnv 4845  df-co 4846  df-dm 4847  df-rn 4848  df-res 4849  df-ima 4850  df-iota 5377  df-fun 5415  df-fn 5416  df-f 5417  df-f1 5418  df-fo 5419  df-f1o 5420  df-fv 5421  df-ov 6043  df-oprab 6044  df-mpt2 6045  df-riota 6508  df-er 6864  df-en 7069  df-dom 7070  df-sdom 7071  df-pnf 9078  df-mnf 9079  df-ltxr 9081  df-sub 9249  df-neg 9250