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

Theorem mul2lt0rlt0 10139
Description: If the result of a multiplication is strictly negative, then multiplicands are of different signs. (Contributed by Thierry Arnoux, 19-Sep-2018.)
Hypotheses
Ref Expression
mul2lt0.1  |-  ( ph  ->  A  e.  RR )
mul2lt0.2  |-  ( ph  ->  B  e.  RR )
mul2lt0.3  |-  ( ph  ->  ( A  x.  B
)  <  0 )
Assertion
Ref Expression
mul2lt0rlt0  |-  ( (
ph  /\  B  <  0 )  ->  0  <  A )

Proof of Theorem mul2lt0rlt0
StepHypRef Expression
1 mul2lt0.1 . . . . . 6  |-  ( ph  ->  A  e.  RR )
2 mul2lt0.2 . . . . . 6  |-  ( ph  ->  B  e.  RR )
31, 2remulcld 8346 . . . . 5  |-  ( ph  ->  ( A  x.  B
)  e.  RR )
43adantr 276 . . . 4  |-  ( (
ph  /\  B  <  0 )  ->  ( A  x.  B )  e.  RR )
5 0red 8317 . . . 4  |-  ( (
ph  /\  B  <  0 )  ->  0  e.  RR )
62adantr 276 . . . . 5  |-  ( (
ph  /\  B  <  0 )  ->  B  e.  RR )
7 simpr 110 . . . . 5  |-  ( (
ph  /\  B  <  0 )  ->  B  <  0 )
86, 7negelrpd 10068 . . . 4  |-  ( (
ph  /\  B  <  0 )  ->  -u B  e.  RR+ )
9 mul2lt0.3 . . . . 5  |-  ( ph  ->  ( A  x.  B
)  <  0 )
109adantr 276 . . . 4  |-  ( (
ph  /\  B  <  0 )  ->  ( A  x.  B )  <  0 )
114, 5, 8, 10ltdiv1dd 10134 . . 3  |-  ( (
ph  /\  B  <  0 )  ->  (
( A  x.  B
)  /  -u B
)  <  ( 0  /  -u B ) )
121recnd 8344 . . . . . . 7  |-  ( ph  ->  A  e.  CC )
1312adantr 276 . . . . . 6  |-  ( (
ph  /\  B  <  0 )  ->  A  e.  CC )
142recnd 8344 . . . . . . 7  |-  ( ph  ->  B  e.  CC )
1514adantr 276 . . . . . 6  |-  ( (
ph  /\  B  <  0 )  ->  B  e.  CC )
1613, 15mulcld 8336 . . . . 5  |-  ( (
ph  /\  B  <  0 )  ->  ( A  x.  B )  e.  CC )
176, 7lt0ap0d 8967 . . . . 5  |-  ( (
ph  /\  B  <  0 )  ->  B #  0 )
1816, 15, 17divneg2apd 9124 . . . 4  |-  ( (
ph  /\  B  <  0 )  ->  -u (
( A  x.  B
)  /  B )  =  ( ( A  x.  B )  /  -u B ) )
1913, 15, 17divcanap4d 9116 . . . . 5  |-  ( (
ph  /\  B  <  0 )  ->  (
( A  x.  B
)  /  B )  =  A )
2019negeqd 8511 . . . 4  |-  ( (
ph  /\  B  <  0 )  ->  -u (
( A  x.  B
)  /  B )  =  -u A )
2118, 20eqtr3d 2273 . . 3  |-  ( (
ph  /\  B  <  0 )  ->  (
( A  x.  B
)  /  -u B
)  =  -u A
)
2215negcld 8614 . . . 4  |-  ( (
ph  /\  B  <  0 )  ->  -u B  e.  CC )
2315, 17negap0d 8949 . . . 4  |-  ( (
ph  /\  B  <  0 )  ->  -u B #  0 )
2422, 23div0apd 9107 . . 3  |-  ( (
ph  /\  B  <  0 )  ->  (
0  /  -u B
)  =  0 )
2511, 21, 243brtr3d 4156 . 2  |-  ( (
ph  /\  B  <  0 )  ->  -u A  <  0 )
261adantr 276 . . 3  |-  ( (
ph  /\  B  <  0 )  ->  A  e.  RR )
2726lt0neg2d 8834 . 2  |-  ( (
ph  /\  B  <  0 )  ->  (
0  <  A  <->  -u A  <  0 ) )
2825, 27mpbird 167 1  |-  ( (
ph  /\  B  <  0 )  ->  0  <  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    e. wcel 2209   class class class wbr 4125  (class class class)co 6075   CCcc 8167   RRcr 8168   0cc0 8169    x. cmul 8174    < clt 8350   -ucneg 8488    / cdiv 8992
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 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 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulrcl 8268  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-precex 8279  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285  ax-pre-mulgt0 8286  ax-pre-mulext 8287
This theorem 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-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-id 4433  df-po 4436  df-iso 4437  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-iota 5332  df-fun 5374  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-reap 8893  df-ap 8900  df-div 8993  df-rp 10034
This theorem is referenced by:  mul2lt0llt0  10141
  Copyright terms: Public domain W3C validator