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

Theorem mulge0 8566
Description: The product of two nonnegative numbers is nonnegative. (Contributed by NM, 8-Oct-1999.) (Revised by Mario Carneiro, 27-May-2016.)
Assertion
Ref Expression
mulge0  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B )
)  ->  0  <_  ( A  x.  B ) )

Proof of Theorem mulge0
StepHypRef Expression
1 remulcl 7930 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  x.  B
)  e.  RR )
21ad2ant2r 509 . . . 4  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B )
)  ->  ( A  x.  B )  e.  RR )
3 0re 7948 . . . 4  |-  0  e.  RR
4 ltnsym2 8038 . . . 4  |-  ( ( ( A  x.  B
)  e.  RR  /\  0  e.  RR )  ->  -.  ( ( A  x.  B )  <  0  /\  0  < 
( A  x.  B
) ) )
52, 3, 4sylancl 413 . . 3  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B )
)  ->  -.  (
( A  x.  B
)  <  0  /\  0  <  ( A  x.  B ) ) )
6 orc 712 . . . . . 6  |-  ( ( A  x.  B )  <  0  ->  (
( A  x.  B
)  <  0  \/  0  <  ( A  x.  B ) ) )
7 reaplt 8535 . . . . . . 7  |-  ( ( ( A  x.  B
)  e.  RR  /\  0  e.  RR )  ->  ( ( A  x.  B ) #  0  <->  ( ( A  x.  B )  <  0  \/  0  < 
( A  x.  B
) ) ) )
82, 3, 7sylancl 413 . . . . . 6  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B )
)  ->  ( ( A  x.  B ) #  0 
<->  ( ( A  x.  B )  <  0  \/  0  <  ( A  x.  B ) ) ) )
96, 8syl5ibr 156 . . . . 5  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B )
)  ->  ( ( A  x.  B )  <  0  ->  ( A  x.  B ) #  0 ) )
10 simplll 533 . . . . . . 7  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  x.  B
) #  0 )  ->  A  e.  RR )
11 simplrl 535 . . . . . . 7  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  x.  B
) #  0 )  ->  B  e.  RR )
12 recn 7935 . . . . . . . . . . . . . 14  |-  ( B  e.  RR  ->  B  e.  CC )
13 recn 7935 . . . . . . . . . . . . . . 15  |-  ( A  e.  RR  ->  A  e.  CC )
14 mulap0r 8562 . . . . . . . . . . . . . . 15  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( A  x.  B ) #  0 )  ->  ( A #  0  /\  B #  0 ) )
1513, 14syl3an1 1271 . . . . . . . . . . . . . 14  |-  ( ( A  e.  RR  /\  B  e.  CC  /\  ( A  x.  B ) #  0 )  ->  ( A #  0  /\  B #  0 ) )
1612, 15syl3an2 1272 . . . . . . . . . . . . 13  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  x.  B ) #  0 )  ->  ( A #  0  /\  B #  0 ) )
17163expia 1205 . . . . . . . . . . . 12  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( ( A  x.  B ) #  0  ->  ( A #  0  /\  B #  0 ) ) )
1817ad2ant2r 509 . . . . . . . . . . 11  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B )
)  ->  ( ( A  x.  B ) #  0  ->  ( A #  0  /\  B #  0 ) ) )
1918imp 124 . . . . . . . . . 10  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  x.  B
) #  0 )  -> 
( A #  0  /\  B #  0 ) )
2019simpld 112 . . . . . . . . 9  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  x.  B
) #  0 )  ->  A #  0 )
21 reaplt 8535 . . . . . . . . . . 11  |-  ( ( A  e.  RR  /\  0  e.  RR )  ->  ( A #  0  <->  ( A  <  0  \/  0  <  A ) ) )
223, 21mpan2 425 . . . . . . . . . 10  |-  ( A  e.  RR  ->  ( A #  0  <->  ( A  <  0  \/  0  < 
A ) ) )
2322ad3antrrr 492 . . . . . . . . 9  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  x.  B
) #  0 )  -> 
( A #  0  <->  ( A  <  0  \/  0  <  A ) ) )
2420, 23mpbid 147 . . . . . . . 8  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  x.  B
) #  0 )  -> 
( A  <  0  \/  0  <  A ) )
25 lenlt 8023 . . . . . . . . . . . 12  |-  ( ( 0  e.  RR  /\  A  e.  RR )  ->  ( 0  <_  A  <->  -.  A  <  0 ) )
263, 25mpan 424 . . . . . . . . . . 11  |-  ( A  e.  RR  ->  (
0  <_  A  <->  -.  A  <  0 ) )
2726biimpa 296 . . . . . . . . . 10  |-  ( ( A  e.  RR  /\  0  <_  A )  ->  -.  A  <  0
)
2827ad2antrr 488 . . . . . . . . 9  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  x.  B
) #  0 )  ->  -.  A  <  0
)
29 biorf 744 . . . . . . . . 9  |-  ( -.  A  <  0  -> 
( 0  <  A  <->  ( A  <  0  \/  0  <  A ) ) )
3028, 29syl 14 . . . . . . . 8  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  x.  B
) #  0 )  -> 
( 0  <  A  <->  ( A  <  0  \/  0  <  A ) ) )
3124, 30mpbird 167 . . . . . . 7  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  x.  B
) #  0 )  -> 
0  <  A )
3219simprd 114 . . . . . . . . 9  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  x.  B
) #  0 )  ->  B #  0 )
33 reaplt 8535 . . . . . . . . . . . 12  |-  ( ( B  e.  RR  /\  0  e.  RR )  ->  ( B #  0  <->  ( B  <  0  \/  0  <  B ) ) )
343, 33mpan2 425 . . . . . . . . . . 11  |-  ( B  e.  RR  ->  ( B #  0  <->  ( B  <  0  \/  0  < 
B ) ) )
3534ad2antrl 490 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B )
)  ->  ( B #  0 
<->  ( B  <  0  \/  0  <  B ) ) )
3635adantr 276 . . . . . . . . 9  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  x.  B
) #  0 )  -> 
( B #  0  <->  ( B  <  0  \/  0  <  B ) ) )
3732, 36mpbid 147 . . . . . . . 8  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  x.  B
) #  0 )  -> 
( B  <  0  \/  0  <  B ) )
38 lenlt 8023 . . . . . . . . . . . 12  |-  ( ( 0  e.  RR  /\  B  e.  RR )  ->  ( 0  <_  B  <->  -.  B  <  0 ) )
393, 38mpan 424 . . . . . . . . . . 11  |-  ( B  e.  RR  ->  (
0  <_  B  <->  -.  B  <  0 ) )
4039biimpa 296 . . . . . . . . . 10  |-  ( ( B  e.  RR  /\  0  <_  B )  ->  -.  B  <  0
)
4140ad2antlr 489 . . . . . . . . 9  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  x.  B
) #  0 )  ->  -.  B  <  0
)
42 biorf 744 . . . . . . . . 9  |-  ( -.  B  <  0  -> 
( 0  <  B  <->  ( B  <  0  \/  0  <  B ) ) )
4341, 42syl 14 . . . . . . . 8  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  x.  B
) #  0 )  -> 
( 0  <  B  <->  ( B  <  0  \/  0  <  B ) ) )
4437, 43mpbird 167 . . . . . . 7  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  x.  B
) #  0 )  -> 
0  <  B )
4510, 11, 31, 44mulgt0d 8070 . . . . . 6  |-  ( ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B ) )  /\  ( A  x.  B
) #  0 )  -> 
0  <  ( A  x.  B ) )
4645ex 115 . . . . 5  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B )
)  ->  ( ( A  x.  B ) #  0  ->  0  <  ( A  x.  B )
) )
479, 46syld 45 . . . 4  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B )
)  ->  ( ( A  x.  B )  <  0  ->  0  <  ( A  x.  B ) ) )
4847ancld 325 . . 3  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B )
)  ->  ( ( A  x.  B )  <  0  ->  ( ( A  x.  B )  <  0  /\  0  < 
( A  x.  B
) ) ) )
495, 48mtod 663 . 2  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B )
)  ->  -.  ( A  x.  B )  <  0 )
50 lenlt 8023 . . 3  |-  ( ( 0  e.  RR  /\  ( A  x.  B
)  e.  RR )  ->  ( 0  <_ 
( A  x.  B
)  <->  -.  ( A  x.  B )  <  0
) )
513, 2, 50sylancr 414 . 2  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B )
)  ->  ( 0  <_  ( A  x.  B )  <->  -.  ( A  x.  B )  <  0 ) )
5249, 51mpbird 167 1  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <_  B )
)  ->  0  <_  ( A  x.  B ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 708    e. wcel 2148   class class class wbr 4000  (class class class)co 5869   CCcc 7800   RRcr 7801   0cc0 7802    x. cmul 7807    < clt 7982    <_ cle 7983   # cap 8528
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4118  ax-pow 4171  ax-pr 4206  ax-un 4430  ax-setind 4533  ax-cnex 7893  ax-resscn 7894  ax-1cn 7895  ax-1re 7896  ax-icn 7897  ax-addcl 7898  ax-addrcl 7899  ax-mulcl 7900  ax-mulrcl 7901  ax-addcom 7902  ax-mulcom 7903  ax-addass 7904  ax-mulass 7905  ax-distr 7906  ax-i2m1 7907  ax-0lt1 7908  ax-1rid 7909  ax-0id 7910  ax-rnegex 7911  ax-precex 7912  ax-cnre 7913  ax-pre-ltirr 7914  ax-pre-ltwlin 7915  ax-pre-lttrn 7916  ax-pre-apti 7917  ax-pre-ltadd 7918  ax-pre-mulgt0 7919  ax-pre-mulext 7920
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-br 4001  df-opab 4062  df-id 4290  df-po 4293  df-iso 4294  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-iota 5174  df-fun 5214  df-fv 5220  df-riota 5825  df-ov 5872  df-oprab 5873  df-mpo 5874  df-pnf 7984  df-mnf 7985  df-xr 7986  df-ltxr 7987  df-le 7988  df-sub 8120  df-neg 8121  df-reap 8522  df-ap 8529
This theorem is referenced by:  mulge0i  8567  mulge0d  8568  ge0mulcl  9969  expge0  10542  bernneq  10626  sqrtmul  11028  amgm2  11111
  Copyright terms: Public domain W3C validator