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

Theorem fprodm1 12024
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 10261 . . . . 5  |-  -.  (
( N  -  1 )  +  1 )  e.  ( M ... ( N  -  1
) )
2 fprodm1.1 . . . . . . . . 9  |-  ( ph  ->  N  e.  ( ZZ>= `  M ) )
3 eluzelz 9692 . . . . . . . . 9  |-  ( N  e.  ( ZZ>= `  M
)  ->  N  e.  ZZ )
42, 3syl 14 . . . . . . . 8  |-  ( ph  ->  N  e.  ZZ )
54zcnd 9531 . . . . . . 7  |-  ( ph  ->  N  e.  CC )
6 1cnd 8123 . . . . . . 7  |-  ( ph  ->  1  e.  CC )
75, 6npcand 8422 . . . . . 6  |-  ( ph  ->  ( ( N  - 
1 )  +  1 )  =  N )
87eleq1d 2276 . . . . 5  |-  ( ph  ->  ( ( ( N  -  1 )  +  1 )  e.  ( M ... ( N  -  1 ) )  <-> 
N  e.  ( M ... ( N  - 
1 ) ) ) )
91, 8mtbii 676 . . . 4  |-  ( ph  ->  -.  N  e.  ( M ... ( N  -  1 ) ) )
10 disjsn 3705 . . . 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 9688 . . . . . 6  |-  ( N  e.  ( ZZ>= `  M
)  ->  M  e.  ZZ )
132, 12syl 14 . . . . 5  |-  ( ph  ->  M  e.  ZZ )
14 peano2zm 9445 . . . . . . 7  |-  ( M  e.  ZZ  ->  ( M  -  1 )  e.  ZZ )
1513, 14syl 14 . . . . . 6  |-  ( ph  ->  ( M  -  1 )  e.  ZZ )
1613zcnd 9531 . . . . . . . . 9  |-  ( ph  ->  M  e.  CC )
1716, 6npcand 8422 . . . . . . . 8  |-  ( ph  ->  ( ( M  - 
1 )  +  1 )  =  M )
1817fveq2d 5603 . . . . . . 7  |-  ( ph  ->  ( ZZ>= `  ( ( M  -  1 )  +  1 ) )  =  ( ZZ>= `  M
) )
192, 18eleqtrrd 2287 . . . . . 6  |-  ( ph  ->  N  e.  ( ZZ>= `  ( ( M  - 
1 )  +  1 ) ) )
20 eluzp1m1 9707 . . . . . 6  |-  ( ( ( M  -  1 )  e.  ZZ  /\  N  e.  ( ZZ>= `  ( ( M  - 
1 )  +  1 ) ) )  -> 
( N  -  1 )  e.  ( ZZ>= `  ( M  -  1
) ) )
2115, 19, 20syl2anc 411 . . . . 5  |-  ( ph  ->  ( N  -  1 )  e.  ( ZZ>= `  ( M  -  1
) ) )
22 fzsuc2 10236 . . . . 5  |-  ( ( M  e.  ZZ  /\  ( N  -  1
)  e.  ( ZZ>= `  ( M  -  1
) ) )  -> 
( M ... (
( N  -  1 )  +  1 ) )  =  ( ( M ... ( N  -  1 ) )  u.  { ( ( N  -  1 )  +  1 ) } ) )
2313, 21, 22syl2anc 411 . . . 4  |-  ( ph  ->  ( M ... (
( N  -  1 )  +  1 ) )  =  ( ( M ... ( N  -  1 ) )  u.  { ( ( N  -  1 )  +  1 ) } ) )
247oveq2d 5983 . . . 4  |-  ( ph  ->  ( M ... (
( N  -  1 )  +  1 ) )  =  ( M ... N ) )
257sneqd 3656 . . . . 5  |-  ( ph  ->  { ( ( N  -  1 )  +  1 ) }  =  { N } )
2625uneq2d 3335 . . . 4  |-  ( ph  ->  ( ( M ... ( N  -  1
) )  u.  {
( ( N  - 
1 )  +  1 ) } )  =  ( ( M ... ( N  -  1
) )  u.  { N } ) )
2723, 24, 263eqtr3d 2248 . . 3  |-  ( ph  ->  ( M ... N
)  =  ( ( M ... ( N  -  1 ) )  u.  { N }
) )
2813, 4fzfigd 10613 . . 3  |-  ( ph  ->  ( M ... N
)  e.  Fin )
29 elfzelz 10182 . . . . . 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 9445 . . . . . 6  |-  ( N  e.  ZZ  ->  ( N  -  1 )  e.  ZZ )
3432, 33syl 14 . . . . 5  |-  ( (
ph  /\  j  e.  ( M ... N ) )  ->  ( N  -  1 )  e.  ZZ )
35 fzdcel 10197 . . . . 5  |-  ( ( j  e.  ZZ  /\  M  e.  ZZ  /\  ( N  -  1 )  e.  ZZ )  -> DECID  j  e.  ( M ... ( N  -  1 ) ) )
3630, 31, 34, 35syl3anc 1250 . . . 4  |-  ( (
ph  /\  j  e.  ( M ... N ) )  -> DECID  j  e.  ( M ... ( N  - 
1 ) ) )
3736ralrimiva 2581 . . 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 12022 . 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 2276 . . . . 5  |-  ( k  =  N  ->  ( A  e.  CC  <->  B  e.  CC ) )
4238ralrimiva 2581 . . . . 5  |-  ( ph  ->  A. k  e.  ( M ... N ) A  e.  CC )
43 eluzfz2 10189 . . . . . 6  |-  ( N  e.  ( ZZ>= `  M
)  ->  N  e.  ( M ... N ) )
442, 43syl 14 . . . . 5  |-  ( ph  ->  N  e.  ( M ... N ) )
4541, 42, 44rspcdva 2889 . . . 4  |-  ( ph  ->  B  e.  CC )
4640prodsn 12019 . . . 4  |-  ( ( N  e.  ( ZZ>= `  M )  /\  B  e.  CC )  ->  prod_ k  e.  { N } A  =  B )
472, 45, 46syl2anc 411 . . 3  |-  ( ph  ->  prod_ k  e.  { N } A  =  B )
4847oveq2d 5983 . 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 2240 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 836    = wceq 1373    e. wcel 2178    u. cun 3172    i^i cin 3173   (/)c0 3468   {csn 3643   ` cfv 5290  (class class class)co 5967   CCcc 7958   1c1 7961    + caddc 7963    x. cmul 7965    - cmin 8278   ZZcz 9407   ZZ>=cuz 9683   ...cfz 10165   prod_cprod 11976
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-nul 4186  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-iinf 4654  ax-cnex 8051  ax-resscn 8052  ax-1cn 8053  ax-1re 8054  ax-icn 8055  ax-addcl 8056  ax-addrcl 8057  ax-mulcl 8058  ax-mulrcl 8059  ax-addcom 8060  ax-mulcom 8061  ax-addass 8062  ax-mulass 8063  ax-distr 8064  ax-i2m1 8065  ax-0lt1 8066  ax-1rid 8067  ax-0id 8068  ax-rnegex 8069  ax-precex 8070  ax-cnre 8071  ax-pre-ltirr 8072  ax-pre-ltwlin 8073  ax-pre-lttrn 8074  ax-pre-apti 8075  ax-pre-ltadd 8076  ax-pre-mulgt0 8077  ax-pre-mulext 8078  ax-arch 8079  ax-caucvg 8080
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-nel 2474  df-ral 2491  df-rex 2492  df-reu 2493  df-rmo 2494  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-if 3580  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-tr 4159  df-id 4358  df-po 4361  df-iso 4362  df-iord 4431  df-on 4433  df-ilim 4434  df-suc 4436  df-iom 4657  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-isom 5299  df-riota 5922  df-ov 5970  df-oprab 5971  df-mpo 5972  df-1st 6249  df-2nd 6250  df-recs 6414  df-irdg 6479  df-frec 6500  df-1o 6525  df-oadd 6529  df-er 6643  df-en 6851  df-dom 6852  df-fin 6853  df-pnf 8144  df-mnf 8145  df-xr 8146  df-ltxr 8147  df-le 8148  df-sub 8280  df-neg 8281  df-reap 8683  df-ap 8690  df-div 8781  df-inn 9072  df-2 9130  df-3 9131  df-4 9132  df-n0 9331  df-z 9408  df-uz 9684  df-q 9776  df-rp 9811  df-fz 10166  df-fzo 10300  df-seqfrec 10630  df-exp 10721  df-ihash 10958  df-cj 11268  df-re 11269  df-im 11270  df-rsqrt 11424  df-abs 11425  df-clim 11705  df-proddc 11977
This theorem is referenced by:  fprodp1  12026  fprodm1s  12027
  Copyright terms: Public domain W3C validator