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

Theorem fprodge1 12350
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 8348 . 2  |-  1  e.  RR*
2 pnfxr 8342 . 2  |- +oo  e.  RR*
3 fprodge1.ph . . 3  |-  F/ k
ph
4 1re 8289 . . . . . 6  |-  1  e.  RR
5 icossre 10306 . . . . . 6  |-  ( ( 1  e.  RR  /\ +oo  e.  RR* )  ->  (
1 [,) +oo )  C_  RR )
64, 2, 5mp2an 426 . . . . 5  |-  ( 1 [,) +oo )  C_  RR
7 ax-resscn 8235 . . . . 5  |-  RR  C_  CC
86, 7sstri 3251 . . . 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 3238 . . . . . . . 8  |-  ( x  e.  ( 1 [,) +oo )  ->  x  e.  RR )
1312adantr 276 . . . . . . 7  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  x  e.  RR )
146sseli 3238 . . . . . . . 8  |-  ( y  e.  ( 1 [,) +oo )  ->  y  e.  RR )
1514adantl 277 . . . . . . 7  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  y  e.  RR )
1613, 15remulcld 8320 . . . . . 6  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  ( x  x.  y )  e.  RR )
1716rexrd 8339 . . . . 5  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  ( x  x.  y )  e.  RR* )
18 1t1e1 9407 . . . . . 6  |-  ( 1  x.  1 )  =  1
194a1i 9 . . . . . . 7  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  1  e.  RR )
20 0le1 8772 . . . . . . . 8  |-  0  <_  1
2120a1i 9 . . . . . . 7  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  0  <_  1
)
22 icogelb 10649 . . . . . . . . 9  |-  ( ( 1  e.  RR*  /\ +oo  e.  RR*  /\  x  e.  ( 1 [,) +oo ) )  ->  1  <_  x )
231, 2, 22mp3an12 1364 . . . . . . . 8  |-  ( x  e.  ( 1 [,) +oo )  ->  1  <_  x )
2423adantr 276 . . . . . . 7  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  1  <_  x
)
25 icogelb 10649 . . . . . . . . 9  |-  ( ( 1  e.  RR*  /\ +oo  e.  RR*  /\  y  e.  ( 1 [,) +oo ) )  ->  1  <_  y )
261, 2, 25mp3an12 1364 . . . . . . . 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 9233 . . . . . 6  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  ( 1  x.  1 )  <_  (
x  x.  y ) )
2918, 28eqbrtrrid 4150 . . . . 5  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  1  <_  (
x  x.  y ) )
3016ltpnfd 10133 . . . . 5  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  ( x  x.  y )  < +oo )
3110, 11, 17, 29, 30elicod 10648 . . . 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 8339 . . . 4  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  RR* )
38 fprodge1.ge . . . 4  |-  ( (
ph  /\  k  e.  A )  ->  1  <_  B )
3936ltpnfd 10133 . . . 4  |-  ( (
ph  /\  k  e.  A )  ->  B  < +oo )
4034, 35, 37, 38, 39elicod 10648 . . 3  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  ( 1 [,) +oo ) )
41 1le1 8863 . . . . 5  |-  1  <_  1
42 ltpnf 10132 . . . . . 6  |-  ( 1  e.  RR  ->  1  < +oo )
434, 42ax-mp 5 . . . . 5  |-  1  < +oo
44 elico2 10289 . . . . . 6  |-  ( ( 1  e.  RR  /\ +oo  e.  RR* )  ->  (
1  e.  ( 1 [,) +oo )  <->  ( 1  e.  RR  /\  1  <_  1  /\  1  < +oo ) ) )
454, 2, 44mp2an 426 . . . . 5  |-  ( 1  e.  ( 1 [,) +oo )  <->  ( 1  e.  RR  /\  1  <_ 
1  /\  1  < +oo ) )
464, 41, 43, 45mpbir3an 1206 . . . 4  |-  1  e.  ( 1 [,) +oo )
4746a1i 9 . . 3  |-  ( ph  ->  1  e.  ( 1 [,) +oo ) )
483, 9, 32, 33, 40, 47fprodcllemf 12324 . 2  |-  ( ph  ->  prod_ k  e.  A  B  e.  ( 1 [,) +oo ) )
49 icogelb 10649 . 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 1378 1  |-  ( ph  ->  1  <_  prod_ k  e.  A  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1005   F/wnf 1509    e. wcel 2205    C_ wss 3214   class class class wbr 4114  (class class class)co 6058   Fincfn 6988   CCcc 8141   RRcr 8142   0cc0 8143   1c1 8144    x. cmul 8148   +oocpnf 8321   RR*cxr 8323    < clt 8324    <_ cle 8325   [,)cico 10242   prod_cprod 12261
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-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  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-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259  ax-pre-mulgt0 8260  ax-pre-mulext 8261  ax-arch 8262  ax-caucvg 8263
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  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-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-po 4422  df-iso 4423  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-isom 5366  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-irdg 6614  df-frec 6635  df-1o 6660  df-oadd 6664  df-er 6780  df-en 6989  df-dom 6990  df-fin 6991  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-reap 8866  df-ap 8873  df-div 8964  df-inn 9255  df-2 9313  df-3 9314  df-4 9315  df-n0 9514  df-z 9595  df-uz 9872  df-q 9970  df-rp 10005  df-ico 10246  df-fz 10362  df-fzo 10499  df-seqfrec 10834  df-exp 10925  df-ihash 11164  df-cj 11552  df-re 11553  df-im 11554  df-rsqrt 11708  df-abs 11709  df-clim 11989  df-proddc 12262
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator