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

Theorem fprodge1 12384
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 8374 . 2  |-  1  e.  RR*
2 pnfxr 8368 . 2  |- +oo  e.  RR*
3 fprodge1.ph . . 3  |-  F/ k
ph
4 1re 8315 . . . . . 6  |-  1  e.  RR
5 icossre 10335 . . . . . 6  |-  ( ( 1  e.  RR  /\ +oo  e.  RR* )  ->  (
1 [,) +oo )  C_  RR )
64, 2, 5mp2an 430 . . . . 5  |-  ( 1 [,) +oo )  C_  RR
7 ax-resscn 8261 . . . . 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 8346 . . . . . 6  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  ( x  x.  y )  e.  RR )
1716rexrd 8365 . . . . 5  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  ( x  x.  y )  e.  RR* )
18 1t1e1 9436 . . . . . 6  |-  ( 1  x.  1 )  =  1
194a1i 9 . . . . . . 7  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  1  e.  RR )
20 0le1 8799 . . . . . . . 8  |-  0  <_  1
2120a1i 9 . . . . . . 7  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  0  <_  1
)
22 icogelb 10678 . . . . . . . . 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 10678 . . . . . . . . 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 9262 . . . . . 6  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  ( 1  x.  1 )  <_  (
x  x.  y ) )
2918, 28eqbrtrrid 4161 . . . . 5  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  1  <_  (
x  x.  y ) )
3016ltpnfd 10162 . . . . 5  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  ( x  x.  y )  < +oo )
3110, 11, 17, 29, 30elicod 10677 . . . 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 8365 . . . 4  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  RR* )
38 fprodge1.ge . . . 4  |-  ( (
ph  /\  k  e.  A )  ->  1  <_  B )
3936ltpnfd 10162 . . . 4  |-  ( (
ph  /\  k  e.  A )  ->  B  < +oo )
4034, 35, 37, 38, 39elicod 10677 . . 3  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  ( 1 [,) +oo ) )
41 1le1 8890 . . . . 5  |-  1  <_  1
42 ltpnf 10161 . . . . . 6  |-  ( 1  e.  RR  ->  1  < +oo )
434, 42ax-mp 5 . . . . 5  |-  1  < +oo
44 elico2 10318 . . . . . 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 12358 . 2  |-  ( ph  ->  prod_ k  e.  A  B  e.  ( 1 [,) +oo ) )
49 icogelb 10678 . 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
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009   F/wnf 1513    e. wcel 2209    C_ wss 3220   class class class wbr 4125  (class class class)co 6075   Fincfn 7012   CCcc 8167   RRcr 8168   0cc0 8169   1c1 8170    x. cmul 8174   +oocpnf 8347   RR*cxr 8349    < clt 8350    <_ cle 8351   [,)cico 10271   prod_cprod 12295
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 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 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulrcl 8268  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-precex 8279  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285  ax-pre-mulgt0 8286  ax-pre-mulext 8287  ax-arch 8288  ax-caucvg 8289
This theorem 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 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-po 4436  df-iso 4437  df-iord 4506  df-on 4508  df-ilim 4509  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-isom 5381  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-irdg 6631  df-frec 6652  df-1o 6677  df-oadd 6681  df-er 6797  df-en 7013  df-dom 7014  df-fin 7015  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-reap 8893  df-ap 8900  df-div 8993  df-inn 9284  df-2 9342  df-3 9343  df-4 9344  df-n0 9543  df-z 9624  df-uz 9901  df-q 9999  df-rp 10034  df-ico 10275  df-fz 10391  df-fzo 10528  df-seqfrec 10863  df-exp 10954  df-ihash 11193  df-cj 11585  df-re 11586  df-im 11587  df-rsqrt 11742  df-abs 11743  df-clim 12023  df-proddc 12296
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator