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

Theorem fprod1p 12159
Description: Separate out the first term in a finite product. (Contributed by Scott Fenton, 24-Dec-2017.)
Hypotheses
Ref Expression
fprod1p.1  |-  ( ph  ->  N  e.  ( ZZ>= `  M ) )
fprod1p.2  |-  ( (
ph  /\  k  e.  ( M ... N ) )  ->  A  e.  CC )
fprod1p.3  |-  ( k  =  M  ->  A  =  B )
Assertion
Ref Expression
fprod1p  |-  ( ph  ->  prod_ k  e.  ( M ... N ) A  =  ( B  x.  prod_ k  e.  ( ( M  +  1 ) ... N ) A ) )
Distinct variable groups:    B, k    ph, k    k, M    k, N
Allowed substitution hint:    A( k)

Proof of Theorem fprod1p
Dummy variable  j is distinct from all other variables.
StepHypRef Expression
1 fprod1p.1 . . . . . . . 8  |-  ( ph  ->  N  e.  ( ZZ>= `  M ) )
2 eluzfz1 10265 . . . . . . . 8  |-  ( N  e.  ( ZZ>= `  M
)  ->  M  e.  ( M ... N ) )
31, 2syl 14 . . . . . . 7  |-  ( ph  ->  M  e.  ( M ... N ) )
4 elfzelz 10259 . . . . . . 7  |-  ( M  e.  ( M ... N )  ->  M  e.  ZZ )
53, 4syl 14 . . . . . 6  |-  ( ph  ->  M  e.  ZZ )
6 fzsn 10300 . . . . . 6  |-  ( M  e.  ZZ  ->  ( M ... M )  =  { M } )
75, 6syl 14 . . . . 5  |-  ( ph  ->  ( M ... M
)  =  { M } )
87ineq1d 3407 . . . 4  |-  ( ph  ->  ( ( M ... M )  i^i  (
( M  +  1 ) ... N ) )  =  ( { M }  i^i  (
( M  +  1 ) ... N ) ) )
95zred 9601 . . . . . 6  |-  ( ph  ->  M  e.  RR )
109ltp1d 9109 . . . . 5  |-  ( ph  ->  M  <  ( M  +  1 ) )
11 fzdisj 10286 . . . . 5  |-  ( M  <  ( M  + 
1 )  ->  (
( M ... M
)  i^i  ( ( M  +  1 ) ... N ) )  =  (/) )
1210, 11syl 14 . . . 4  |-  ( ph  ->  ( ( M ... M )  i^i  (
( M  +  1 ) ... N ) )  =  (/) )
138, 12eqtr3d 2266 . . 3  |-  ( ph  ->  ( { M }  i^i  ( ( M  + 
1 ) ... N
) )  =  (/) )
14 fzsplit 10285 . . . . 5  |-  ( M  e.  ( M ... N )  ->  ( M ... N )  =  ( ( M ... M )  u.  (
( M  +  1 ) ... N ) ) )
153, 14syl 14 . . . 4  |-  ( ph  ->  ( M ... N
)  =  ( ( M ... M )  u.  ( ( M  +  1 ) ... N ) ) )
167uneq1d 3360 . . . 4  |-  ( ph  ->  ( ( M ... M )  u.  (
( M  +  1 ) ... N ) )  =  ( { M }  u.  (
( M  +  1 ) ... N ) ) )
1715, 16eqtrd 2264 . . 3  |-  ( ph  ->  ( M ... N
)  =  ( { M }  u.  (
( M  +  1 ) ... N ) ) )
18 eluzelz 9764 . . . . 5  |-  ( N  e.  ( ZZ>= `  M
)  ->  N  e.  ZZ )
191, 18syl 14 . . . 4  |-  ( ph  ->  N  e.  ZZ )
205, 19fzfigd 10692 . . 3  |-  ( ph  ->  ( M ... N
)  e.  Fin )
21 elfzelz 10259 . . . . . 6  |-  ( j  e.  ( M ... N )  ->  j  e.  ZZ )
22 zdceq 9554 . . . . . 6  |-  ( ( j  e.  ZZ  /\  M  e.  ZZ )  -> DECID  j  =  M )
2321, 5, 22syl2anr 290 . . . . 5  |-  ( (
ph  /\  j  e.  ( M ... N ) )  -> DECID  j  =  M
)
24 velsn 3686 . . . . . 6  |-  ( j  e.  { M }  <->  j  =  M )
2524dcbii 847 . . . . 5  |-  (DECID  j  e. 
{ M }  <-> DECID  j  =  M
)
2623, 25sylibr 134 . . . 4  |-  ( (
ph  /\  j  e.  ( M ... N ) )  -> DECID  j  e.  { M } )
2726ralrimiva 2605 . . 3  |-  ( ph  ->  A. j  e.  ( M ... N )DECID  j  e.  { M }
)
28 fprod1p.2 . . 3  |-  ( (
ph  /\  k  e.  ( M ... N ) )  ->  A  e.  CC )
2913, 17, 20, 27, 28fprodsplitdc 12156 . 2  |-  ( ph  ->  prod_ k  e.  ( M ... N ) A  =  ( prod_
k  e.  { M } A  x.  prod_ k  e.  ( ( M  +  1 ) ... N ) A ) )
30 fprod1p.3 . . . . . 6  |-  ( k  =  M  ->  A  =  B )
3130eleq1d 2300 . . . . 5  |-  ( k  =  M  ->  ( A  e.  CC  <->  B  e.  CC ) )
3228ralrimiva 2605 . . . . 5  |-  ( ph  ->  A. k  e.  ( M ... N ) A  e.  CC )
3331, 32, 3rspcdva 2915 . . . 4  |-  ( ph  ->  B  e.  CC )
3430prodsn 12153 . . . 4  |-  ( ( M  e.  ( M ... N )  /\  B  e.  CC )  ->  prod_ k  e.  { M } A  =  B )
353, 33, 34syl2anc 411 . . 3  |-  ( ph  ->  prod_ k  e.  { M } A  =  B )
3635oveq1d 6032 . 2  |-  ( ph  ->  ( prod_ k  e.  { M } A  x.  prod_ k  e.  ( ( M  +  1 ) ... N ) A )  =  ( B  x.  prod_ k  e.  ( ( M  +  1 ) ... N ) A ) )
3729, 36eqtrd 2264 1  |-  ( ph  ->  prod_ k  e.  ( M ... N ) A  =  ( B  x.  prod_ k  e.  ( ( M  +  1 ) ... N ) A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104  DECID wdc 841    = wceq 1397    e. wcel 2202    u. cun 3198    i^i cin 3199   (/)c0 3494   {csn 3669   class class class wbr 4088   ` cfv 5326  (class class class)co 6017   CCcc 8029   1c1 8032    + caddc 8034    x. cmul 8036    < clt 8213   ZZcz 9478   ZZ>=cuz 9754   ...cfz 10242   prod_cprod 12110
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-mulrcl 8130  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-precex 8141  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147  ax-pre-mulgt0 8148  ax-pre-mulext 8149  ax-arch 8150  ax-caucvg 8151
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-ilim 4466  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-isom 5335  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-irdg 6535  df-frec 6556  df-1o 6581  df-oadd 6585  df-er 6701  df-en 6909  df-dom 6910  df-fin 6911  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-reap 8754  df-ap 8761  df-div 8852  df-inn 9143  df-2 9201  df-3 9202  df-4 9203  df-n0 9402  df-z 9479  df-uz 9755  df-q 9853  df-rp 9888  df-fz 10243  df-fzo 10377  df-seqfrec 10709  df-exp 10800  df-ihash 11037  df-cj 11402  df-re 11403  df-im 11404  df-rsqrt 11558  df-abs 11559  df-clim 11839  df-proddc 12111
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator