ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  mulgt1 Unicode version
Theorem mulgt1 9033
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 8296 . . . . . . . . 9 |- 0 < 1
4 0re 8169 . . . . . . . . . 10 |- 0 e. RR
5 1re 8168 . . . . . . . . . 10 |- 1 e. RR
6 lttr 8243 . . . . . . . . . 10 |- ( ( 0 e. RR /\ 1 e. RR /\ A e. RR ) -> ( ( 0 < 1 /\ 1 < A ) -> 0 < A ) )
74, 5, 6mp3an12 1361 . . . . . . . . 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 9026 . . . . . . . . . . 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 1358 . . . . . . . . 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 8129 . . . . . . 7 |- ( A e. RR -> ( A x. 1 ) = A )
1817adantr 276 . . . . . 6 |- ( ( A e. RR /\ B e. RR ) -> ( A x. 1 ) = A )
1918breq1d 4096 . . . . 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 8150 . . . 4 |- ( ( A e. RR /\ B e. RR ) -> ( A x. B ) e. RR )
23 lttr 8243 . . . . 5 |- ( ( 1 e. RR /\ A e. RR /\ ( A x. B ) e. RR ) -> ( ( 1 < A /\ A < ( A x. B ) ) -> 1 < ( A x. B ) ) )
245, 23mp3an1 1358 . . . 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 1002   = wceq 1395   e. wcel 2200   class class class wbr 4086  (class class class)co 6013   RRcr 8021   0cc0 8022   1c1 8023   x. cmul 8027   < clt 8204
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-mulrcl 8121  ax-addcom 8122  ax-mulcom 8123  ax-addass 8124  ax-mulass 8125  ax-distr 8126  ax-i2m1 8127  ax-0lt1 8128  ax-1rid 8129  ax-0id 8130  ax-rnegex 8131  ax-precex 8132  ax-cnre 8133  ax-pre-lttrn 8136  ax-pre-ltadd 8138  ax-pre-mulgt0 8139
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-opab 4149  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-iota 5284  df-fun 5326  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-pnf 8206  df-mnf 8207  df-ltxr 8209  df-sub 8342  df-neg 8343
This theorem is referenced by:  mulgt1d  9106  addltmul  9371  uz2mulcl  9832
  Copyright terms: Public domain W3C validator