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

Theorem mulgt1 9154
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 109 . . . . 5  |-  ( ( 1  <  A  /\  1  <  B )  -> 
1  <  A )
21a1i 9 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( ( 1  < 
A  /\  1  <  B )  ->  1  <  A ) )
3 0lt1 8416 . . . . . . . . 9  |-  0  <  1
4 0re 8290 . . . . . . . . . 10  |-  0  e.  RR
5 1re 8289 . . . . . . . . . 10  |-  1  e.  RR
6 lttr 8363 . . . . . . . . . 10  |-  ( ( 0  e.  RR  /\  1  e.  RR  /\  A  e.  RR )  ->  (
( 0  <  1  /\  1  <  A )  ->  0  <  A
) )
74, 5, 6mp3an12 1364 . . . . . . . . 9  |-  ( A  e.  RR  ->  (
( 0  <  1  /\  1  <  A )  ->  0  <  A
) )
83, 7mpani 430 . . . . . . . 8  |-  ( A  e.  RR  ->  (
1  <  A  ->  0  <  A ) )
98adantr 276 . . . . . . 7  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( 1  <  A  ->  0  <  A ) )
10 ltmul2 9147 . . . . . . . . . . 11  |-  ( ( 1  e.  RR  /\  B  e.  RR  /\  ( A  e.  RR  /\  0  <  A ) )  -> 
( 1  <  B  <->  ( A  x.  1 )  <  ( A  x.  B ) ) )
1110biimpd 144 . . . . . . . . . 10  |-  ( ( 1  e.  RR  /\  B  e.  RR  /\  ( A  e.  RR  /\  0  <  A ) )  -> 
( 1  <  B  ->  ( A  x.  1 )  <  ( A  x.  B ) ) )
125, 11mp3an1 1361 . . . . . . . . 9  |-  ( ( B  e.  RR  /\  ( A  e.  RR  /\  0  <  A ) )  ->  ( 1  <  B  ->  ( A  x.  1 )  <  ( A  x.  B ) ) )
1312exp32 365 . . . . . . . 8  |-  ( B  e.  RR  ->  ( A  e.  RR  ->  ( 0  <  A  -> 
( 1  <  B  ->  ( A  x.  1 )  <  ( A  x.  B ) ) ) ) )
1413impcom 125 . . . . . . 7  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( 0  <  A  ->  ( 1  <  B  ->  ( A  x.  1 )  <  ( A  x.  B ) ) ) )
159, 14syld 45 . . . . . 6  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( 1  <  A  ->  ( 1  <  B  ->  ( A  x.  1 )  <  ( A  x.  B ) ) ) )
1615impd 254 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( ( 1  < 
A  /\  1  <  B )  ->  ( A  x.  1 )  <  ( A  x.  B )
) )
17 ax-1rid 8250 . . . . . . 7  |-  ( A  e.  RR  ->  ( A  x.  1 )  =  A )
1817adantr 276 . . . . . 6  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  x.  1 )  =  A )
1918breq1d 4124 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( ( A  x.  1 )  <  ( A  x.  B )  <->  A  <  ( A  x.  B ) ) )
2016, 19sylibd 149 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( ( 1  < 
A  /\  1  <  B )  ->  A  <  ( A  x.  B ) ) )
212, 20jcad 307 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( ( 1  < 
A  /\  1  <  B )  ->  ( 1  <  A  /\  A  <  ( A  x.  B
) ) ) )
22 remulcl 8271 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  x.  B
)  e.  RR )
23 lttr 8363 . . . . 5  |-  ( ( 1  e.  RR  /\  A  e.  RR  /\  ( A  x.  B )  e.  RR )  ->  (
( 1  <  A  /\  A  <  ( A  x.  B ) )  ->  1  <  ( A  x.  B )
) )
245, 23mp3an1 1361 . . . 4  |-  ( ( A  e.  RR  /\  ( A  x.  B
)  e.  RR )  ->  ( ( 1  <  A  /\  A  <  ( A  x.  B
) )  ->  1  <  ( A  x.  B
) ) )
2522, 24syldan 282 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( ( 1  < 
A  /\  A  <  ( A  x.  B ) )  ->  1  <  ( A  x.  B ) ) )
2621, 25syld 45 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( ( 1  < 
A  /\  1  <  B )  ->  1  <  ( A  x.  B ) ) )
2726imp 124 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 104    /\ w3a 1005    = wceq 1398    e. wcel 2205   class class class wbr 4114  (class class class)co 6058   RRcr 8142   0cc0 8143   1c1 8144    x. cmul 8148    < clt 8324
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-mulrcl 8242  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-precex 8253  ax-cnre 8254  ax-pre-lttrn 8257  ax-pre-ltadd 8259  ax-pre-mulgt0 8260
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-iota 5317  df-fun 5359  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-pnf 8326  df-mnf 8327  df-ltxr 8329  df-sub 8462  df-neg 8463
This theorem is referenced by:  mulgt1d  9227  addltmul  9492  uz2mulcl  9958
  Copyright terms: Public domain W3C validator