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

Theorem fprodge1 12431
Description: If all of the terms of a finite product are greater than or equal to  1, so is the product. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
Hypotheses
Ref Expression
fprodge1.ph  |-  F/ k
ph
fprodge1.a  |-  ( ph  ->  A  e.  Fin )
fprodge1.b  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  RR )
fprodge1.ge  |-  ( (
ph  /\  k  e.  A )  ->  1  <_  B )
Assertion
Ref Expression
fprodge1  |-  ( ph  ->  1  <_  prod_ k  e.  A  B )
Distinct variable group:    A, k
Allowed substitution hints:    ph( k)    B( k)

Proof of Theorem fprodge1
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 1xr 8390 . 2  |-  1  e.  RR*
2 pnfxr 8384 . 2  |- +oo  e.  RR*
3 fprodge1.ph . . 3  |-  F/ k
ph
4 1re 8331 . . . . . 6  |-  1  e.  RR
5 icossre 10373 . . . . . 6  |-  ( ( 1  e.  RR  /\ +oo  e.  RR* )  ->  (
1 [,) +oo )  C_  RR )
64, 2, 5mp2an 430 . . . . 5  |-  ( 1 [,) +oo )  C_  RR
7 ax-resscn 8277 . . . . 5  |-  RR  C_  CC
86, 7sstri 3257 . . . 4  |-  ( 1 [,) +oo )  C_  CC
98a1i 9 . . 3  |-  ( ph  ->  ( 1 [,) +oo )  C_  CC )
101a1i 9 . . . . 5  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  1  e.  RR* )
112a1i 9 . . . . 5  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  -> +oo  e.  RR* )
126sseli 3244 . . . . . . . 8  |-  ( x  e.  ( 1 [,) +oo )  ->  x  e.  RR )
1312adantr 276 . . . . . . 7  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  x  e.  RR )
146sseli 3244 . . . . . . . 8  |-  ( y  e.  ( 1 [,) +oo )  ->  y  e.  RR )
1514adantl 277 . . . . . . 7  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  y  e.  RR )
1613, 15remulcld 8362 . . . . . 6  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  ( x  x.  y )  e.  RR )
1716rexrd 8381 . . . . 5  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  ( x  x.  y )  e.  RR* )
18 1t1e1 9466 . . . . . 6  |-  ( 1  x.  1 )  =  1
194a1i 9 . . . . . . 7  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  1  e.  RR )
20 0le1 8816 . . . . . . . 8  |-  0  <_  1
2120a1i 9 . . . . . . 7  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  0  <_  1
)
22 icogelb 10717 . . . . . . . . 9  |-  ( ( 1  e.  RR*  /\ +oo  e.  RR*  /\  x  e.  ( 1 [,) +oo ) )  ->  1  <_  x )
231, 2, 22mp3an12 1368 . . . . . . . 8  |-  ( x  e.  ( 1 [,) +oo )  ->  1  <_  x )
2423adantr 276 . . . . . . 7  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  1  <_  x
)
25 icogelb 10717 . . . . . . . . 9  |-  ( ( 1  e.  RR*  /\ +oo  e.  RR*  /\  y  e.  ( 1 [,) +oo ) )  ->  1  <_  y )
261, 2, 25mp3an12 1368 . . . . . . . 8  |-  ( y  e.  ( 1 [,) +oo )  ->  1  <_ 
y )
2726adantl 277 . . . . . . 7  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  1  <_  y
)
2819, 13, 19, 15, 21, 21, 24, 27lemul12ad 9280 . . . . . 6  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  ( 1  x.  1 )  <_  (
x  x.  y ) )
2918, 28eqbrtrrid 4167 . . . . 5  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  1  <_  (
x  x.  y ) )
3016ltpnfd 10200 . . . . 5  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  ( x  x.  y )  < +oo )
3110, 11, 17, 29, 30elicod 10716 . . . 4  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  ( x  x.  y )  e.  ( 1 [,) +oo )
)
3231adantl 277 . . 3  |-  ( (
ph  /\  ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo )
) )  ->  (
x  x.  y )  e.  ( 1 [,) +oo ) )
33 fprodge1.a . . 3  |-  ( ph  ->  A  e.  Fin )
341a1i 9 . . . 4  |-  ( (
ph  /\  k  e.  A )  ->  1  e.  RR* )
352a1i 9 . . . 4  |-  ( (
ph  /\  k  e.  A )  -> +oo  e.  RR* )
36 fprodge1.b . . . . 5  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  RR )
3736rexrd 8381 . . . 4  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  RR* )
38 fprodge1.ge . . . 4  |-  ( (
ph  /\  k  e.  A )  ->  1  <_  B )
3936ltpnfd 10200 . . . 4  |-  ( (
ph  /\  k  e.  A )  ->  B  < +oo )
4034, 35, 37, 38, 39elicod 10716 . . 3  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  ( 1 [,) +oo ) )
41 1le1 8908 . . . . 5  |-  1  <_  1
42 ltpnf 10199 . . . . . 6  |-  ( 1  e.  RR  ->  1  < +oo )
434, 42ax-mp 5 . . . . 5  |-  1  < +oo
44 elico2 10356 . . . . . 6  |-  ( ( 1  e.  RR  /\ +oo  e.  RR* )  ->  (
1  e.  ( 1 [,) +oo )  <->  ( 1  e.  RR  /\  1  <_  1  /\  1  < +oo ) ) )
454, 2, 44mp2an 430 . . . . 5  |-  ( 1  e.  ( 1 [,) +oo )  <->  ( 1  e.  RR  /\  1  <_ 
1  /\  1  < +oo ) )
464, 41, 43, 45mpbir3an 1210 . . . 4  |-  1  e.  ( 1 [,) +oo )
4746a1i 9 . . 3  |-  ( ph  ->  1  e.  ( 1 [,) +oo ) )
483, 9, 32, 33, 40, 47fprodcllemf 12405 . 2  |-  ( ph  ->  prod_ k  e.  A  B  e.  ( 1 [,) +oo ) )
49 icogelb 10717 . 2  |-  ( ( 1  e.  RR*  /\ +oo  e.  RR*  /\  prod_ k  e.  A  B  e.  ( 1 [,) +oo ) )  ->  1  <_  prod_ k  e.  A  B )
501, 2, 48, 49mp3an12i 1382 1  |-  ( ph  ->  1  <_  prod_ k  e.  A  B )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009   F/wnf 1513    e. wcel 2209    C_ wss 3220   class class class wbr 4131  (class class class)co 6088   Fincfn 7026   CCcc 8183   RRcr 8184   0cc0 8185   1c1 8186    x. cmul 8190   +oocpnf 8363   RR*cxr 8365    < clt 8366    <_ cle 8367   [,)cico 10309   prod_cprod 12342
This proof depends on 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-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-mulrcl 8284  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-mulass 8288  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-1rid 8292  ax-0id 8293  ax-rnegex 8294  ax-precex 8295  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301  ax-pre-mulgt0 8302  ax-pre-mulext 8303  ax-arch 8304  ax-caucvg 8305
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  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-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-isom 5389  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-frec 6666  df-1o 6691  df-oadd 6695  df-er 6811  df-en 7027  df-dom 7028  df-fin 7029  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-reap 8911  df-ap 8918  df-div 9011  df-inn 9314  df-2 9372  df-3 9373  df-4 9374  df-n0 9575  df-z 9656  df-uz 9938  df-q 10036  df-rp 10072  df-ico 10313  df-fz 10429  df-fzo 10567  df-seqfrec 10906  df-exp 10997  df-ihash 11237  df-cj 11629  df-re 11630  df-im 11631  df-rsqrt 11786  df-abs 11787  df-clim 12070  df-proddc 12343
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator