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

Theorem mulgt1 8008
Description: The product of two numbers greater than 1 is greater than 1. (Contributed by NM, 13-Feb-2005.)
Assertion
Ref Expression
mulgt1  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( 1  < 
A  /\  1  <  B ) )  ->  1  <  ( A  x.  B
) )

Proof of Theorem mulgt1
StepHypRef Expression
1 simpl 107 . . . . 5  |-  ( ( 1  <  A  /\  1  <  B )  -> 
1  <  A )
21a1i 9 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( ( 1  < 
A  /\  1  <  B )  ->  1  <  A ) )
3 0lt1 7303 . . . . . . . . 9  |-  0  <  1
4 0re 7181 . . . . . . . . . 10  |-  0  e.  RR
5 1re 7180 . . . . . . . . . 10  |-  1  e.  RR
6 lttr 7252 . . . . . . . . . 10  |-  ( ( 0  e.  RR  /\  1  e.  RR  /\  A  e.  RR )  ->  (
( 0  <  1  /\  1  <  A )  ->  0  <  A
) )
74, 5, 6mp3an12 1259 . . . . . . . . 9  |-  ( A  e.  RR  ->  (
( 0  <  1  /\  1  <  A )  ->  0  <  A
) )
83, 7mpani 421 . . . . . . . 8  |-  ( A  e.  RR  ->  (
1  <  A  ->  0  <  A ) )
98adantr 270 . . . . . . 7  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( 1  <  A  ->  0  <  A ) )
10 ltmul2 8001 . . . . . . . . . . 11  |-  ( ( 1  e.  RR  /\  B  e.  RR  /\  ( A  e.  RR  /\  0  <  A ) )  -> 
( 1  <  B  <->  ( A  x.  1 )  <  ( A  x.  B ) ) )
1110biimpd 142 . . . . . . . . . 10  |-  ( ( 1  e.  RR  /\  B  e.  RR  /\  ( A  e.  RR  /\  0  <  A ) )  -> 
( 1  <  B  ->  ( A  x.  1 )  <  ( A  x.  B ) ) )
125, 11mp3an1 1256 . . . . . . . . 9  |-  ( ( B  e.  RR  /\  ( A  e.  RR  /\  0  <  A ) )  ->  ( 1  <  B  ->  ( A  x.  1 )  <  ( A  x.  B ) ) )
1312exp32 357 . . . . . . . 8  |-  ( B  e.  RR  ->  ( A  e.  RR  ->  ( 0  <  A  -> 
( 1  <  B  ->  ( A  x.  1 )  <  ( A  x.  B ) ) ) ) )
1413impcom 123 . . . . . . 7  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( 0  <  A  ->  ( 1  <  B  ->  ( A  x.  1 )  <  ( A  x.  B ) ) ) )
159, 14syld 44 . . . . . 6  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( 1  <  A  ->  ( 1  <  B  ->  ( A  x.  1 )  <  ( A  x.  B ) ) ) )
1615impd 251 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( ( 1  < 
A  /\  1  <  B )  ->  ( A  x.  1 )  <  ( A  x.  B )
) )
17 ax-1rid 7145 . . . . . . 7  |-  ( A  e.  RR  ->  ( A  x.  1 )  =  A )
1817adantr 270 . . . . . 6  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  x.  1 )  =  A )
1918breq1d 3803 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( ( A  x.  1 )  <  ( A  x.  B )  <->  A  <  ( A  x.  B ) ) )
2016, 19sylibd 147 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( ( 1  < 
A  /\  1  <  B )  ->  A  <  ( A  x.  B ) ) )
212, 20jcad 301 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( ( 1  < 
A  /\  1  <  B )  ->  ( 1  <  A  /\  A  <  ( A  x.  B
) ) ) )
22 remulcl 7163 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  x.  B
)  e.  RR )
23 lttr 7252 . . . . 5  |-  ( ( 1  e.  RR  /\  A  e.  RR  /\  ( A  x.  B )  e.  RR )  ->  (
( 1  <  A  /\  A  <  ( A  x.  B ) )  ->  1  <  ( A  x.  B )
) )
245, 23mp3an1 1256 . . . 4  |-  ( ( A  e.  RR  /\  ( A  x.  B
)  e.  RR )  ->  ( ( 1  <  A  /\  A  <  ( A  x.  B
) )  ->  1  <  ( A  x.  B
) ) )
2522, 24syldan 276 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( ( 1  < 
A  /\  A  <  ( A  x.  B ) )  ->  1  <  ( A  x.  B ) ) )
2621, 25syld 44 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( ( 1  < 
A  /\  1  <  B )  ->  1  <  ( A  x.  B ) ) )
2726imp 122 1  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( 1  < 
A  /\  1  <  B ) )  ->  1  <  ( A  x.  B
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    /\ w3a 920    = wceq 1285    e. wcel 1434   class class class wbr 3793  (class class class)co 5543   RRcr 7042   0cc0 7043   1c1 7044    x. cmul 7048    < clt 7215
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-13 1445  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2064  ax-sep 3904  ax-pow 3956  ax-pr 3972  ax-un 4196  ax-setind 4288  ax-cnex 7129  ax-resscn 7130  ax-1cn 7131  ax-1re 7132  ax-icn 7133  ax-addcl 7134  ax-addrcl 7135  ax-mulcl 7136  ax-mulrcl 7137  ax-addcom 7138  ax-mulcom 7139  ax-addass 7140  ax-mulass 7141  ax-distr 7142  ax-i2m1 7143  ax-0lt1 7144  ax-1rid 7145  ax-0id 7146  ax-rnegex 7147  ax-precex 7148  ax-cnre 7149  ax-pre-lttrn 7152  ax-pre-ltadd 7154  ax-pre-mulgt0 7155
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-fal 1291  df-nf 1391  df-sb 1687  df-eu 1945  df-mo 1946  df-clab 2069  df-cleq 2075  df-clel 2078  df-nfc 2209  df-ne 2247  df-nel 2341  df-ral 2354  df-rex 2355  df-reu 2356  df-rab 2358  df-v 2604  df-sbc 2817  df-dif 2976  df-un 2978  df-in 2980  df-ss 2987  df-pw 3392  df-sn 3412  df-pr 3413  df-op 3415  df-uni 3610  df-br 3794  df-opab 3848  df-id 4056  df-xp 4377  df-rel 4378  df-cnv 4379  df-co 4380  df-dm 4381  df-iota 4897  df-fun 4934  df-fv 4940  df-riota 5499  df-ov 5546  df-oprab 5547  df-mpt2 5548  df-pnf 7217  df-mnf 7218  df-ltxr 7220  df-sub 7348  df-neg 7349
This theorem is referenced by:  mulgt1d  8081  addltmul  8334  uz2mulcl  8776
  Copyright terms: Public domain W3C validator