MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fsumcl2lem Unicode version

Theorem fsumcl2lem 12204
Description: - Lemma for finite sum closures. (The "-" before "Lemma" forces the math content to be displayed in the Statement List - NM 11-Feb-2008.) (Contributed by Mario Carneiro, 3-Jun-2014.)
Hypotheses
Ref Expression
fsumcllem.1  |-  ( ph  ->  S  C_  CC )
fsumcllem.2  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  +  y )  e.  S )
fsumcllem.3  |-  ( ph  ->  A  e.  Fin )
fsumcllem.4  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  S )
fsumcl2lem.5  |-  ( ph  ->  A  =/=  (/) )
Assertion
Ref Expression
fsumcl2lem  |-  ( ph  -> 
sum_ k  e.  A  B  e.  S )
Distinct variable groups:    x, k,
y, A    x, B, y    ph, k, x, y    S, k, x, y
Allowed substitution hint:    B( k)

Proof of Theorem fsumcl2lem
Dummy variables  f  m are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fsumcl2lem.5 . . . 4  |-  ( ph  ->  A  =/=  (/) )
21a1d 22 . . 3  |-  ( ph  ->  ( -.  sum_ k  e.  A  B  e.  S  ->  A  =/=  (/) ) )
32necon4bd 2508 . 2  |-  ( ph  ->  ( A  =  (/)  -> 
sum_ k  e.  A  B  e.  S )
)
4 sumfc 12182 . . . . . . 7  |-  sum_ m  e.  A  ( (
k  e.  A  |->  B ) `  m )  =  sum_ k  e.  A  B
5 fveq2 5525 . . . . . . . 8  |-  ( m  =  ( f `  x )  ->  (
( k  e.  A  |->  B ) `  m
)  =  ( ( k  e.  A  |->  B ) `  ( f `
 x ) ) )
6 simprl 732 . . . . . . . 8  |-  ( (
ph  /\  ( ( # `
 A )  e.  NN  /\  f : ( 1 ... ( # `
 A ) ) -1-1-onto-> A ) )  ->  ( # `
 A )  e.  NN )
7 simprr 733 . . . . . . . 8  |-  ( (
ph  /\  ( ( # `
 A )  e.  NN  /\  f : ( 1 ... ( # `
 A ) ) -1-1-onto-> A ) )  ->  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A )
8 fsumcllem.1 . . . . . . . . . 10  |-  ( ph  ->  S  C_  CC )
98ad2antrr 706 . . . . . . . . 9  |-  ( ( ( ph  /\  (
( # `  A )  e.  NN  /\  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A ) )  /\  m  e.  A )  ->  S  C_  CC )
10 fsumcllem.4 . . . . . . . . . . . 12  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  S )
11 eqid 2283 . . . . . . . . . . . 12  |-  ( k  e.  A  |->  B )  =  ( k  e.  A  |->  B )
1210, 11fmptd 5684 . . . . . . . . . . 11  |-  ( ph  ->  ( k  e.  A  |->  B ) : A --> S )
1312adantr 451 . . . . . . . . . 10  |-  ( (
ph  /\  ( ( # `
 A )  e.  NN  /\  f : ( 1 ... ( # `
 A ) ) -1-1-onto-> A ) )  ->  (
k  e.  A  |->  B ) : A --> S )
14 ffvelrn 5663 . . . . . . . . . 10  |-  ( ( ( k  e.  A  |->  B ) : A --> S  /\  m  e.  A
)  ->  ( (
k  e.  A  |->  B ) `  m )  e.  S )
1513, 14sylan 457 . . . . . . . . 9  |-  ( ( ( ph  /\  (
( # `  A )  e.  NN  /\  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A ) )  /\  m  e.  A )  ->  ( ( k  e.  A  |->  B ) `  m )  e.  S
)
169, 15sseldd 3181 . . . . . . . 8  |-  ( ( ( ph  /\  (
( # `  A )  e.  NN  /\  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A ) )  /\  m  e.  A )  ->  ( ( k  e.  A  |->  B ) `  m )  e.  CC )
17 f1of 5472 . . . . . . . . . 10  |-  ( f : ( 1 ... ( # `  A
) ) -1-1-onto-> A  ->  f :
( 1 ... ( # `
 A ) ) --> A )
187, 17syl 15 . . . . . . . . 9  |-  ( (
ph  /\  ( ( # `
 A )  e.  NN  /\  f : ( 1 ... ( # `
 A ) ) -1-1-onto-> A ) )  ->  f : ( 1 ... ( # `  A
) ) --> A )
19 fvco3 5596 . . . . . . . . 9  |-  ( ( f : ( 1 ... ( # `  A
) ) --> A  /\  x  e.  ( 1 ... ( # `  A
) ) )  -> 
( ( ( k  e.  A  |->  B )  o.  f ) `  x )  =  ( ( k  e.  A  |->  B ) `  (
f `  x )
) )
2018, 19sylan 457 . . . . . . . 8  |-  ( ( ( ph  /\  (
( # `  A )  e.  NN  /\  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A ) )  /\  x  e.  ( 1 ... ( # `  A
) ) )  -> 
( ( ( k  e.  A  |->  B )  o.  f ) `  x )  =  ( ( k  e.  A  |->  B ) `  (
f `  x )
) )
215, 6, 7, 16, 20fsum 12193 . . . . . . 7  |-  ( (
ph  /\  ( ( # `
 A )  e.  NN  /\  f : ( 1 ... ( # `
 A ) ) -1-1-onto-> A ) )  ->  sum_ m  e.  A  ( (
k  e.  A  |->  B ) `  m )  =  (  seq  1
(  +  ,  ( ( k  e.  A  |->  B )  o.  f
) ) `  ( # `
 A ) ) )
224, 21syl5eqr 2329 . . . . . 6  |-  ( (
ph  /\  ( ( # `
 A )  e.  NN  /\  f : ( 1 ... ( # `
 A ) ) -1-1-onto-> A ) )  ->  sum_ k  e.  A  B  =  (  seq  1 (  +  ,  ( ( k  e.  A  |->  B )  o.  f ) ) `
 ( # `  A
) ) )
23 nnuz 10263 . . . . . . . 8  |-  NN  =  ( ZZ>= `  1 )
246, 23syl6eleq 2373 . . . . . . 7  |-  ( (
ph  /\  ( ( # `
 A )  e.  NN  /\  f : ( 1 ... ( # `
 A ) ) -1-1-onto-> A ) )  ->  ( # `
 A )  e.  ( ZZ>= `  1 )
)
25 fco 5398 . . . . . . . . 9  |-  ( ( ( k  e.  A  |->  B ) : A --> S  /\  f : ( 1 ... ( # `  A ) ) --> A )  ->  ( (
k  e.  A  |->  B )  o.  f ) : ( 1 ... ( # `  A
) ) --> S )
2613, 18, 25syl2anc 642 . . . . . . . 8  |-  ( (
ph  /\  ( ( # `
 A )  e.  NN  /\  f : ( 1 ... ( # `
 A ) ) -1-1-onto-> A ) )  ->  (
( k  e.  A  |->  B )  o.  f
) : ( 1 ... ( # `  A
) ) --> S )
27 ffvelrn 5663 . . . . . . . 8  |-  ( ( ( ( k  e.  A  |->  B )  o.  f ) : ( 1 ... ( # `  A ) ) --> S  /\  x  e.  ( 1 ... ( # `  A ) ) )  ->  ( ( ( k  e.  A  |->  B )  o.  f ) `
 x )  e.  S )
2826, 27sylan 457 . . . . . . 7  |-  ( ( ( ph  /\  (
( # `  A )  e.  NN  /\  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A ) )  /\  x  e.  ( 1 ... ( # `  A
) ) )  -> 
( ( ( k  e.  A  |->  B )  o.  f ) `  x )  e.  S
)
29 fsumcllem.2 . . . . . . . 8  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  +  y )  e.  S )
3029adantlr 695 . . . . . . 7  |-  ( ( ( ph  /\  (
( # `  A )  e.  NN  /\  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A ) )  /\  ( x  e.  S  /\  y  e.  S
) )  ->  (
x  +  y )  e.  S )
3124, 28, 30seqcl 11066 . . . . . 6  |-  ( (
ph  /\  ( ( # `
 A )  e.  NN  /\  f : ( 1 ... ( # `
 A ) ) -1-1-onto-> A ) )  ->  (  seq  1 (  +  , 
( ( k  e.  A  |->  B )  o.  f ) ) `  ( # `  A ) )  e.  S )
3222, 31eqeltrd 2357 . . . . 5  |-  ( (
ph  /\  ( ( # `
 A )  e.  NN  /\  f : ( 1 ... ( # `
 A ) ) -1-1-onto-> A ) )  ->  sum_ k  e.  A  B  e.  S )
3332expr 598 . . . 4  |-  ( (
ph  /\  ( # `  A
)  e.  NN )  ->  ( f : ( 1 ... ( # `
 A ) ) -1-1-onto-> A  ->  sum_ k  e.  A  B  e.  S )
)
3433exlimdv 1664 . . 3  |-  ( (
ph  /\  ( # `  A
)  e.  NN )  ->  ( E. f 
f : ( 1 ... ( # `  A
) ) -1-1-onto-> A  ->  sum_ k  e.  A  B  e.  S
) )
3534expimpd 586 . 2  |-  ( ph  ->  ( ( ( # `  A )  e.  NN  /\ 
E. f  f : ( 1 ... ( # `
 A ) ) -1-1-onto-> A )  ->  sum_ k  e.  A  B  e.  S
) )
36 fsumcllem.3 . . 3  |-  ( ph  ->  A  e.  Fin )
37 fz1f1o 12183 . . 3  |-  ( A  e.  Fin  ->  ( A  =  (/)  \/  (
( # `  A )  e.  NN  /\  E. f  f : ( 1 ... ( # `  A ) ) -1-1-onto-> A ) ) )
3836, 37syl 15 . 2  |-  ( ph  ->  ( A  =  (/)  \/  ( ( # `  A
)  e.  NN  /\  E. f  f : ( 1 ... ( # `  A ) ) -1-1-onto-> A ) ) )
393, 35, 38mpjaod 370 1  |-  ( ph  -> 
sum_ k  e.  A  B  e.  S )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    \/ wo 357    /\ wa 358   E.wex 1528    = wceq 1623    e. wcel 1684    =/= wne 2446    C_ wss 3152   (/)c0 3455    e. cmpt 4077    o. ccom 4693   -->wf 5251   -1-1-onto->wf1o 5254   ` cfv 5255  (class class class)co 5858   Fincfn 6863   CCcc 8735   1c1 8738    + caddc 8740   NNcn 9746   ZZ>=cuz 10230   ...cfz 10782    seq cseq 11046   #chash 11337   sum_csu 12158
This theorem is referenced by:  fsumcllem  12205  fsumrpcl  12210
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-rep 4131  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512  ax-inf2 7342  ax-cnex 8793  ax-resscn 8794  ax-1cn 8795  ax-icn 8796  ax-addcl 8797  ax-addrcl 8798  ax-mulcl 8799  ax-mulrcl 8800  ax-mulcom 8801  ax-addass 8802  ax-mulass 8803  ax-distr 8804  ax-i2m1 8805  ax-1ne0 8806  ax-1rid 8807  ax-rnegex 8808  ax-rrecex 8809  ax-cnre 8810  ax-pre-lttri 8811  ax-pre-lttrn 8812  ax-pre-ltadd 8813  ax-pre-mulgt0 8814  ax-pre-sup 8815
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-nel 2449  df-ral 2548  df-rex 2549  df-reu 2550  df-rmo 2551  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pss 3168  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-tp 3648  df-op 3649  df-uni 3828  df-int 3863  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-tr 4114  df-eprel 4305  df-id 4309  df-po 4314  df-so 4315  df-fr 4352  df-se 4353  df-we 4354  df-ord 4395  df-on 4396  df-lim 4397  df-suc 4398  df-om 4657  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-isom 5264  df-ov 5861  df-oprab 5862  df-mpt2 5863  df-1st 6122  df-2nd 6123  df-riota 6304  df-recs 6388  df-rdg 6423  df-1o 6479  df-oadd 6483  df-er 6660  df-en 6864  df-dom 6865  df-sdom 6866  df-fin 6867  df-sup 7194  df-oi 7225  df-card 7572  df-pnf 8869  df-mnf 8870  df-xr 8871  df-ltxr 8872  df-le 8873  df-sub 9039  df-neg 9040  df-div 9424  df-nn 9747  df-2 9804  df-3 9805  df-n0 9966  df-z 10025  df-uz 10231  df-rp 10355  df-fz 10783  df-fzo 10871  df-seq 11047  df-exp 11105  df-hash 11338  df-cj 11584  df-re 11585  df-im 11586  df-sqr 11720  df-abs 11721  df-clim 11962  df-sum 12159
  Copyright terms: Public domain W3C validator