Theorem ltmul2 9026

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 8762	. 2 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ 0 < C ) ) -> ( A < B <-> ( A x. C ) < ( B x. C ) ) )
2		recn 8155	. . . 4 |- ( C e. RR -> C e. CC )
3		recn 8155	. . . . . . 7 |- ( A e. RR -> A e. CC )
4		mulcom 8151	. . . . . . 7 |- ( ( A e. CC /\ C e. CC ) -> ( A x. C ) = ( C x. A ) )
5	3, 4	sylan 283	. . . . . 6 |- ( ( A e. RR /\ C e. CC ) -> ( A x. C ) = ( C x. A ) )
6	5	3adant2 1040	. . . . 5 |- ( ( A e. RR /\ B e. RR /\ C e. CC ) -> ( A x. C ) = ( C x. A ) )
7		recn 8155	. . . . . . 7 |- ( B e. RR -> B e. CC )
8		mulcom 8151	. . . . . . 7 |- ( ( B e. CC /\ C e. CC ) -> ( B x. C ) = ( C x. B ) )
9	7, 8	sylan 283	. . . . . 6 |- ( ( B e. RR /\ C e. CC ) -> ( B x. C ) = ( C x. B ) )
10	9	3adant1 1039	. . . . 5 |- ( ( A e. RR /\ B e. RR /\ C e. CC ) -> ( B x. C ) = ( C x. B ) )
11	6, 10	breq12d 4099	. . . 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 1306	. . 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 1259	. 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 188	1 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ 0 < C ) ) -> ( A < B <-> ( C x. A ) < ( C x. B ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1002   = wceq 1395   e. wcel 2200   class class class wbr 4086  (class class class)co 6013   CCcc 8020   RRcr 8021   0cc0 8022   x. cmul 8027   < clt 8204

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-mulrcl 8121  ax-addcom 8122  ax-mulcom 8123  ax-addass 8124  ax-mulass 8125  ax-distr 8126  ax-i2m1 8127  ax-1rid 8129  ax-0id 8130  ax-rnegex 8131  ax-precex 8132  ax-cnre 8133  ax-pre-ltadd 8138  ax-pre-mulgt0 8139

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-opab 4149  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-iota 5284  df-fun 5326  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-pnf 8206  df-mnf 8207  df-ltxr 8209  df-sub 8342  df-neg 8343

This theorem is referenced by:  ltmul12a  9030  mulgt1  9033  ltmulgt11  9034  lt2msq1  9055  ltdiv2  9057  ltmul2i  9093  ltmul2d  9964  ef01bndlem  12307  cos01gt0  12314  sin4lt0  12318  pockthg  12920  tangtx  15552  lgsdilem  15746  lgsquadlem1  15796  lgsquadlem2  15797