Theorem mullt0 8815

Description: The product of two negative numbers is positive. (Contributed by Jeff Hankins, 8-Jun-2009.)

Assertion

Ref	Expression
mullt0	|- ( ( ( A e. RR /\ A < 0 ) /\ ( B e. RR /\ B < 0 ) ) -> 0 < ( A x. B ) )

Proof of Theorem mullt0

Step	Hyp	Ref	Expression
1		renegcl 8594	. . . . 5 |- ( A e. RR -> -u A e. RR )
2	1	adantr 276	. . . 4 |- ( ( A e. RR /\ A < 0 ) -> -u A e. RR )
3		lt0neg1 8803	. . . . 5 |- ( A e. RR -> ( A < 0 <-> 0 < -u A ) )
4	3	biimpa 296	. . . 4 |- ( ( A e. RR /\ A < 0 ) -> 0 < -u A )
5	2, 4	jca 306	. . 3 |- ( ( A e. RR /\ A < 0 ) -> ( -u A e. RR /\ 0 < -u A ) )
6		renegcl 8594	. . . . 5 |- ( B e. RR -> -u B e. RR )
7	6	adantr 276	. . . 4 |- ( ( B e. RR /\ B < 0 ) -> -u B e. RR )
8		lt0neg1 8803	. . . . 5 |- ( B e. RR -> ( B < 0 <-> 0 < -u B ) )
9	8	biimpa 296	. . . 4 |- ( ( B e. RR /\ B < 0 ) -> 0 < -u B )
10	7, 9	jca 306	. . 3 |- ( ( B e. RR /\ B < 0 ) -> ( -u B e. RR /\ 0 < -u B ) )
11		mulgt0 8406	. . 3 |- ( ( ( -u A e. RR /\ 0 < -u A ) /\ ( -u B e. RR /\ 0 < -u B ) ) -> 0 < ( -u A x. -u B ) )
12	5, 10, 11	syl2an 289	. 2 |- ( ( ( A e. RR /\ A < 0 ) /\ ( B e. RR /\ B < 0 ) ) -> 0 < ( -u A x. -u B ) )
13		recn 8318	. . . 4 |- ( A e. RR -> A e. CC )
14		recn 8318	. . . 4 |- ( B e. RR -> B e. CC )
15		mul2neg 8732	. . . 4 |- ( ( A e. CC /\ B e. CC ) -> ( -u A x. -u B ) = ( A x. B ) )
16	13, 14, 15	syl2an 289	. . 3 |- ( ( A e. RR /\ B e. RR ) -> ( -u A x. -u B ) = ( A x. B ) )
17	16	ad2ant2r 513	. 2 |- ( ( ( A e. RR /\ A < 0 ) /\ ( B e. RR /\ B < 0 ) ) -> ( -u A x. -u B ) = ( A x. B ) )
18	12, 17	breqtrd 4157	1 |- ( ( ( A e. RR /\ A < 0 ) /\ ( B e. RR /\ B < 0 ) ) -> 0 < ( A x. B ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   class class class wbr 4131  (class class class)co 6088   CCcc 8183   RRcr 8184   0cc0 8185   x. cmul 8190   < clt 8366   -ucneg 8505

This proof depends on 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 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-mulrcl 8284  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-distr 8289  ax-i2m1 8290  ax-0id 8293  ax-rnegex 8294  ax-cnre 8296  ax-pre-ltadd 8301  ax-pre-mulgt0 8302

This proof 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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4132  df-opab 4194  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-iota 5340  df-fun 5382  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-pnf 8368  df-mnf 8369  df-ltxr 8371  df-sub 8506  df-neg 8507

This theorem is used by:  inelr  8920  apsqgt0  8937