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

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

Proof of Theorem fprodm1
Dummy variable  j is distinct from all other variables.
StepHypRef Expression
1 fzp1nel 10489 . . . . 5  |-  -.  (
( N  -  1 )  +  1 )  e.  ( M ... ( N  -  1
) )
2 fprodm1.1 . . . . . . . . 9  |-  ( ph  ->  N  e.  ( ZZ>= `  M ) )
3 eluzelz 9910 . . . . . . . . 9  |-  ( N  e.  ( ZZ>= `  M
)  ->  N  e.  ZZ )
42, 3syl 14 . . . . . . . 8  |-  ( ph  ->  N  e.  ZZ )
54zcnd 9748 . . . . . . 7  |-  ( ph  ->  N  e.  CC )
6 1cnd 8332 . . . . . . 7  |-  ( ph  ->  1  e.  CC )
75, 6npcand 8631 . . . . . 6  |-  ( ph  ->  ( ( N  - 
1 )  +  1 )  =  N )
87eleq1d 2307 . . . . 5  |-  ( ph  ->  ( ( ( N  -  1 )  +  1 )  e.  ( M ... ( N  -  1 ) )  <-> 
N  e.  ( M ... ( N  - 
1 ) ) ) )
91, 8mtbii 685 . . . 4  |-  ( ph  ->  -.  N  e.  ( M ... ( N  -  1 ) ) )
10 disjsn 3767 . . . 4  |-  ( ( ( M ... ( N  -  1 ) )  i^i  { N } )  =  (/)  <->  -.  N  e.  ( M ... ( N  -  1 ) ) )
119, 10sylibr 134 . . 3  |-  ( ph  ->  ( ( M ... ( N  -  1
) )  i^i  { N } )  =  (/) )
12 eluzel2 9905 . . . . . 6  |-  ( N  e.  ( ZZ>= `  M
)  ->  M  e.  ZZ )
132, 12syl 14 . . . . 5  |-  ( ph  ->  M  e.  ZZ )
14 peano2zm 9661 . . . . . . 7  |-  ( M  e.  ZZ  ->  ( M  -  1 )  e.  ZZ )
1513, 14syl 14 . . . . . 6  |-  ( ph  ->  ( M  -  1 )  e.  ZZ )
1613zcnd 9748 . . . . . . . . 9  |-  ( ph  ->  M  e.  CC )
1716, 6npcand 8631 . . . . . . . 8  |-  ( ph  ->  ( ( M  - 
1 )  +  1 )  =  M )
1817fveq2d 5694 . . . . . . 7  |-  ( ph  ->  ( ZZ>= `  ( ( M  -  1 )  +  1 ) )  =  ( ZZ>= `  M
) )
192, 18eleqtrrd 2318 . . . . . 6  |-  ( ph  ->  N  e.  ( ZZ>= `  ( ( M  - 
1 )  +  1 ) ) )
20 eluzp1m1 9925 . . . . . 6  |-  ( ( ( M  -  1 )  e.  ZZ  /\  N  e.  ( ZZ>= `  ( ( M  - 
1 )  +  1 ) ) )  -> 
( N  -  1 )  e.  ( ZZ>= `  ( M  -  1
) ) )
2115, 19, 20syl2anc 415 . . . . 5  |-  ( ph  ->  ( N  -  1 )  e.  ( ZZ>= `  ( M  -  1
) ) )
22 fzsuc2 10464 . . . . 5  |-  ( ( M  e.  ZZ  /\  ( N  -  1
)  e.  ( ZZ>= `  ( M  -  1
) ) )  -> 
( M ... (
( N  -  1 )  +  1 ) )  =  ( ( M ... ( N  -  1 ) )  u.  { ( ( N  -  1 )  +  1 ) } ) )
2313, 21, 22syl2anc 415 . . . 4  |-  ( ph  ->  ( M ... (
( N  -  1 )  +  1 ) )  =  ( ( M ... ( N  -  1 ) )  u.  { ( ( N  -  1 )  +  1 ) } ) )
247oveq2d 6091 . . . 4  |-  ( ph  ->  ( M ... (
( N  -  1 )  +  1 ) )  =  ( M ... N ) )
257sneqd 3718 . . . . 5  |-  ( ph  ->  { ( ( N  -  1 )  +  1 ) }  =  { N } )
2625uneq2d 3383 . . . 4  |-  ( ph  ->  ( ( M ... ( N  -  1
) )  u.  {
( ( N  - 
1 )  +  1 ) } )  =  ( ( M ... ( N  -  1
) )  u.  { N } ) )
2723, 24, 263eqtr3d 2279 . . 3  |-  ( ph  ->  ( M ... N
)  =  ( ( M ... ( N  -  1 ) )  u.  { N }
) )
2813, 4fzfigd 10846 . . 3  |-  ( ph  ->  ( M ... N
)  e.  Fin )
29 elfzelz 10407 . . . . . 6  |-  ( j  e.  ( M ... N )  ->  j  e.  ZZ )
3029adantl 277 . . . . 5  |-  ( (
ph  /\  j  e.  ( M ... N ) )  ->  j  e.  ZZ )
3113adantr 276 . . . . 5  |-  ( (
ph  /\  j  e.  ( M ... N ) )  ->  M  e.  ZZ )
324adantr 276 . . . . . 6  |-  ( (
ph  /\  j  e.  ( M ... N ) )  ->  N  e.  ZZ )
33 peano2zm 9661 . . . . . 6  |-  ( N  e.  ZZ  ->  ( N  -  1 )  e.  ZZ )
3432, 33syl 14 . . . . 5  |-  ( (
ph  /\  j  e.  ( M ... N ) )  ->  ( N  -  1 )  e.  ZZ )
35 fzdcel 10423 . . . . 5  |-  ( ( j  e.  ZZ  /\  M  e.  ZZ  /\  ( N  -  1 )  e.  ZZ )  -> DECID  j  e.  ( M ... ( N  -  1 ) ) )
3630, 31, 34, 35syl3anc 1278 . . . 4  |-  ( (
ph  /\  j  e.  ( M ... N ) )  -> DECID  j  e.  ( M ... ( N  - 
1 ) ) )
3736ralrimiva 2623 . . 3  |-  ( ph  ->  A. j  e.  ( M ... N )DECID  j  e.  ( M ... ( N  -  1
) ) )
38 fprodm1.2 . . 3  |-  ( (
ph  /\  k  e.  ( M ... N ) )  ->  A  e.  CC )
3911, 27, 28, 37, 38fprodsplitdc 12341 . 2  |-  ( ph  ->  prod_ k  e.  ( M ... N ) A  =  ( prod_
k  e.  ( M ... ( N  - 
1 ) ) A  x.  prod_ k  e.  { N } A ) )
40 fprodm1.3 . . . . . 6  |-  ( k  =  N  ->  A  =  B )
4140eleq1d 2307 . . . . 5  |-  ( k  =  N  ->  ( A  e.  CC  <->  B  e.  CC ) )
4238ralrimiva 2623 . . . . 5  |-  ( ph  ->  A. k  e.  ( M ... N ) A  e.  CC )
43 eluzfz2 10415 . . . . . 6  |-  ( N  e.  ( ZZ>= `  M
)  ->  N  e.  ( M ... N ) )
442, 43syl 14 . . . . 5  |-  ( ph  ->  N  e.  ( M ... N ) )
4541, 42, 44rspcdva 2934 . . . 4  |-  ( ph  ->  B  e.  CC )
4640prodsn 12338 . . . 4  |-  ( ( N  e.  ( ZZ>= `  M )  /\  B  e.  CC )  ->  prod_ k  e.  { N } A  =  B )
472, 45, 46syl2anc 415 . . 3  |-  ( ph  ->  prod_ k  e.  { N } A  =  B )
4847oveq2d 6091 . 2  |-  ( ph  ->  ( prod_ k  e.  ( M ... ( N  -  1 ) ) A  x.  prod_ k  e.  { N } A
)  =  ( prod_
k  e.  ( M ... ( N  - 
1 ) ) A  x.  B ) )
4939, 48eqtrd 2271 1  |-  ( ph  ->  prod_ k  e.  ( M ... N ) A  =  ( prod_
k  e.  ( M ... ( N  - 
1 ) ) A  x.  B ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104  DECID wdc 846    = wceq 1402    e. wcel 2209    u. cun 3218    i^i cin 3219   (/)c0 3520   {csn 3705   ` cfv 5372  (class class class)co 6075   CCcc 8167   1c1 8170    + caddc 8172    x. cmul 8174    - cmin 8487   ZZcz 9623   ZZ>=cuz 9900   ...cfz 10390   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-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:  fprodp1  12345  fprodm1s  12346
  Copyright terms: Public domain W3C validator