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

Theorem fprodge1 12280
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 8297 . 2  |-  1  e.  RR*
2 pnfxr 8291 . 2  |- +oo  e.  RR*
3 fprodge1.ph . . 3  |-  F/ k
ph
4 1re 8238 . . . . . 6  |-  1  e.  RR
5 icossre 10250 . . . . . 6  |-  ( ( 1  e.  RR  /\ +oo  e.  RR* )  ->  (
1 [,) +oo )  C_  RR )
64, 2, 5mp2an 426 . . . . 5  |-  ( 1 [,) +oo )  C_  RR
7 ax-resscn 8184 . . . . 5  |-  RR  C_  CC
86, 7sstri 3237 . . . 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 3224 . . . . . . . 8  |-  ( x  e.  ( 1 [,) +oo )  ->  x  e.  RR )
1312adantr 276 . . . . . . 7  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  x  e.  RR )
146sseli 3224 . . . . . . . 8  |-  ( y  e.  ( 1 [,) +oo )  ->  y  e.  RR )
1514adantl 277 . . . . . . 7  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  y  e.  RR )
1613, 15remulcld 8269 . . . . . 6  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  ( x  x.  y )  e.  RR )
1716rexrd 8288 . . . . 5  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  ( x  x.  y )  e.  RR* )
18 1t1e1 9355 . . . . . 6  |-  ( 1  x.  1 )  =  1
194a1i 9 . . . . . . 7  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  1  e.  RR )
20 0le1 8720 . . . . . . . 8  |-  0  <_  1
2120a1i 9 . . . . . . 7  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  0  <_  1
)
22 icogelb 10588 . . . . . . . . 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 10588 . . . . . . . . 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 9181 . . . . . 6  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  ( 1  x.  1 )  <_  (
x  x.  y ) )
2918, 28eqbrtrrid 4129 . . . . 5  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  1  <_  (
x  x.  y ) )
3016ltpnfd 10077 . . . . 5  |-  ( ( x  e.  ( 1 [,) +oo )  /\  y  e.  ( 1 [,) +oo ) )  ->  ( x  x.  y )  < +oo )
3110, 11, 17, 29, 30elicod 10587 . . . 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 8288 . . . 4  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  RR* )
38 fprodge1.ge . . . 4  |-  ( (
ph  /\  k  e.  A )  ->  1  <_  B )
3936ltpnfd 10077 . . . 4  |-  ( (
ph  /\  k  e.  A )  ->  B  < +oo )
4034, 35, 37, 38, 39elicod 10587 . . 3  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  ( 1 [,) +oo ) )
41 1le1 8811 . . . . 5  |-  1  <_  1
42 ltpnf 10076 . . . . . 6  |-  ( 1  e.  RR  ->  1  < +oo )
434, 42ax-mp 5 . . . . 5  |-  1  < +oo
44 elico2 10233 . . . . . 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 12254 . 2  |-  ( ph  ->  prod_ k  e.  A  B  e.  ( 1 [,) +oo ) )
49 icogelb 10588 . 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 2202    C_ wss 3201   class class class wbr 4093  (class class class)co 6028   Fincfn 6952   CCcc 8090   RRcr 8091   0cc0 8092   1c1 8093    x. cmul 8097   +oocpnf 8270   RR*cxr 8272    < clt 8273    <_ cle 8274   [,)cico 10186   prod_cprod 12191
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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-mulrcl 8191  ax-addcom 8192  ax-mulcom 8193  ax-addass 8194  ax-mulass 8195  ax-distr 8196  ax-i2m1 8197  ax-0lt1 8198  ax-1rid 8199  ax-0id 8200  ax-rnegex 8201  ax-precex 8202  ax-cnre 8203  ax-pre-ltirr 8204  ax-pre-ltwlin 8205  ax-pre-lttrn 8206  ax-pre-apti 8207  ax-pre-ltadd 8208  ax-pre-mulgt0 8209  ax-pre-mulext 8210  ax-arch 8211  ax-caucvg 8212
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 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-po 4399  df-iso 4400  df-iord 4469  df-on 4471  df-ilim 4472  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-isom 5342  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-irdg 6579  df-frec 6600  df-1o 6625  df-oadd 6629  df-er 6745  df-en 6953  df-dom 6954  df-fin 6955  df-pnf 8275  df-mnf 8276  df-xr 8277  df-ltxr 8278  df-le 8279  df-sub 8411  df-neg 8412  df-reap 8814  df-ap 8821  df-div 8912  df-inn 9203  df-2 9261  df-3 9262  df-4 9263  df-n0 9462  df-z 9541  df-uz 9817  df-q 9915  df-rp 9950  df-ico 10190  df-fz 10306  df-fzo 10440  df-seqfrec 10773  df-exp 10864  df-ihash 11101  df-cj 11482  df-re 11483  df-im 11484  df-rsqrt 11638  df-abs 11639  df-clim 11919  df-proddc 12192
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator