Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ballotlemfg Structured version   Unicode version

Theorem ballotlemfg 27053
Description: Express the value of  ( F `
 C ) in terms of  .^. (Contributed by Thierry Arnoux, 21-Apr-2017.)
Hypotheses
Ref Expression
ballotth.m  |-  M  e.  NN
ballotth.n  |-  N  e.  NN
ballotth.o  |-  O  =  { c  e.  ~P ( 1 ... ( M  +  N )
)  |  ( # `  c )  =  M }
ballotth.p  |-  P  =  ( x  e.  ~P O  |->  ( ( # `  x )  /  ( # `
 O ) ) )
ballotth.f  |-  F  =  ( c  e.  O  |->  ( i  e.  ZZ  |->  ( ( # `  (
( 1 ... i
)  i^i  c )
)  -  ( # `  ( ( 1 ... i )  \  c
) ) ) ) )
ballotth.e  |-  E  =  { c  e.  O  |  A. i  e.  ( 1 ... ( M  +  N ) ) 0  <  ( ( F `  c ) `
 i ) }
ballotth.mgtn  |-  N  < 
M
ballotth.i  |-  I  =  ( c  e.  ( O  \  E ) 
|->  sup ( { k  e.  ( 1 ... ( M  +  N
) )  |  ( ( F `  c
) `  k )  =  0 } ,  RR ,  `'  <  ) )
ballotth.s  |-  S  =  ( c  e.  ( O  \  E ) 
|->  ( i  e.  ( 1 ... ( M  +  N ) ) 
|->  if ( i  <_ 
( I `  c
) ,  ( ( ( I `  c
)  +  1 )  -  i ) ,  i ) ) )
ballotth.r  |-  R  =  ( c  e.  ( O  \  E ) 
|->  ( ( S `  c ) " c
) )
ballotlemg  |-  .^  =  ( u  e.  Fin ,  v  e.  Fin  |->  ( ( # `  (
v  i^i  u )
)  -  ( # `  ( v  \  u
) ) ) )
Assertion
Ref Expression
ballotlemfg  |-  ( ( C  e.  ( O 
\  E )  /\  J  e.  ( 0 ... ( M  +  N ) ) )  ->  ( ( F `
 C ) `  J )  =  ( C  .^  ( 1 ... J ) ) )
Distinct variable groups:    M, c    N, c    O, c    i, M   
i, N    i, O    k, M    k, N    k, O    i, c, F, k    C, i, k    i, E, k    C, k    k, I, c    E, c    i, I, c    k, J    S, k, i, c    R, i   
v, u, C    u, I, v    u, J, v   
u, R, v    u, S, v    i, J
Allowed substitution hints:    C( x, c)    P( x, v, u, i, k, c)    R( x, k, c)    S( x)    E( x, v, u)    .^ ( x, v, u, i, k, c)    F( x, v, u)    I( x)    J( x, c)    M( x, v, u)    N( x, v, u)    O( x, v, u)

Proof of Theorem ballotlemfg
StepHypRef Expression
1 ballotth.m . . 3  |-  M  e.  NN
2 ballotth.n . . 3  |-  N  e.  NN
3 ballotth.o . . 3  |-  O  =  { c  e.  ~P ( 1 ... ( M  +  N )
)  |  ( # `  c )  =  M }
4 ballotth.p . . 3  |-  P  =  ( x  e.  ~P O  |->  ( ( # `  x )  /  ( # `
 O ) ) )
5 ballotth.f . . 3  |-  F  =  ( c  e.  O  |->  ( i  e.  ZZ  |->  ( ( # `  (
( 1 ... i
)  i^i  c )
)  -  ( # `  ( ( 1 ... i )  \  c
) ) ) ) )
6 eldifi 3587 . . . 4  |-  ( C  e.  ( O  \  E )  ->  C  e.  O )
76adantr 465 . . 3  |-  ( ( C  e.  ( O 
\  E )  /\  J  e.  ( 0 ... ( M  +  N ) ) )  ->  C  e.  O
)
8 elfzelz 11571 . . . 4  |-  ( J  e.  ( 0 ... ( M  +  N
) )  ->  J  e.  ZZ )
98adantl 466 . . 3  |-  ( ( C  e.  ( O 
\  E )  /\  J  e.  ( 0 ... ( M  +  N ) ) )  ->  J  e.  ZZ )
101, 2, 3, 4, 5, 7, 9ballotlemfval 27017 . 2  |-  ( ( C  e.  ( O 
\  E )  /\  J  e.  ( 0 ... ( M  +  N ) ) )  ->  ( ( F `
 C ) `  J )  =  ( ( # `  (
( 1 ... J
)  i^i  C )
)  -  ( # `  ( ( 1 ... J )  \  C
) ) ) )
11 fzfi 11912 . . . . 5  |-  ( 1 ... ( M  +  N ) )  e. 
Fin
121, 2, 3ballotlemelo 27015 . . . . . 6  |-  ( C  e.  O  <->  ( C  C_  ( 1 ... ( M  +  N )
)  /\  ( # `  C
)  =  M ) )
1312simplbi 460 . . . . 5  |-  ( C  e.  O  ->  C  C_  ( 1 ... ( M  +  N )
) )
14 ssfi 7645 . . . . 5  |-  ( ( ( 1 ... ( M  +  N )
)  e.  Fin  /\  C  C_  ( 1 ... ( M  +  N
) ) )  ->  C  e.  Fin )
1511, 13, 14sylancr 663 . . . 4  |-  ( C  e.  O  ->  C  e.  Fin )
167, 15syl 16 . . 3  |-  ( ( C  e.  ( O 
\  E )  /\  J  e.  ( 0 ... ( M  +  N ) ) )  ->  C  e.  Fin )
17 fzfid 11913 . . 3  |-  ( ( C  e.  ( O 
\  E )  /\  J  e.  ( 0 ... ( M  +  N ) ) )  ->  ( 1 ... J )  e.  Fin )
18 ballotth.e . . . 4  |-  E  =  { c  e.  O  |  A. i  e.  ( 1 ... ( M  +  N ) ) 0  <  ( ( F `  c ) `
 i ) }
19 ballotth.mgtn . . . 4  |-  N  < 
M
20 ballotth.i . . . 4  |-  I  =  ( c  e.  ( O  \  E ) 
|->  sup ( { k  e.  ( 1 ... ( M  +  N
) )  |  ( ( F `  c
) `  k )  =  0 } ,  RR ,  `'  <  ) )
21 ballotth.s . . . 4  |-  S  =  ( c  e.  ( O  \  E ) 
|->  ( i  e.  ( 1 ... ( M  +  N ) ) 
|->  if ( i  <_ 
( I `  c
) ,  ( ( ( I `  c
)  +  1 )  -  i ) ,  i ) ) )
22 ballotth.r . . . 4  |-  R  =  ( c  e.  ( O  \  E ) 
|->  ( ( S `  c ) " c
) )
23 ballotlemg . . . 4  |-  .^  =  ( u  e.  Fin ,  v  e.  Fin  |->  ( ( # `  (
v  i^i  u )
)  -  ( # `  ( v  \  u
) ) ) )
241, 2, 3, 4, 5, 18, 19, 20, 21, 22, 23ballotlemgval 27051 . . 3  |-  ( ( C  e.  Fin  /\  ( 1 ... J
)  e.  Fin )  ->  ( C  .^  (
1 ... J ) )  =  ( ( # `  ( ( 1 ... J )  i^i  C
) )  -  ( # `
 ( ( 1 ... J )  \  C ) ) ) )
2516, 17, 24syl2anc 661 . 2  |-  ( ( C  e.  ( O 
\  E )  /\  J  e.  ( 0 ... ( M  +  N ) ) )  ->  ( C  .^  ( 1 ... J
) )  =  ( ( # `  (
( 1 ... J
)  i^i  C )
)  -  ( # `  ( ( 1 ... J )  \  C
) ) ) )
2610, 25eqtr4d 2498 1  |-  ( ( C  e.  ( O 
\  E )  /\  J  e.  ( 0 ... ( M  +  N ) ) )  ->  ( ( F `
 C ) `  J )  =  ( C  .^  ( 1 ... J ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    = wceq 1370    e. wcel 1758   A.wral 2799   {crab 2803    \ cdif 3434    i^i cin 3436    C_ wss 3437   ifcif 3900   ~Pcpw 3969   class class class wbr 4401    |-> cmpt 4459   `'ccnv 4948   "cima 4952   ` cfv 5527  (class class class)co 6201    |-> cmpt2 6203   Fincfn 7421   supcsup 7802   RRcr 9393   0cc0 9394   1c1 9395    + caddc 9397    < clt 9530    <_ cle 9531    - cmin 9707    / cdiv 10105   NNcn 10434   ZZcz 10758   ...cfz 11555   #chash 12221
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-8 1760  ax-9 1762  ax-10 1777  ax-11 1782  ax-12 1794  ax-13 1955  ax-ext 2432  ax-rep 4512  ax-sep 4522  ax-nul 4530  ax-pow 4579  ax-pr 4640  ax-un 6483  ax-cnex 9450  ax-resscn 9451  ax-1cn 9452  ax-icn 9453  ax-addcl 9454  ax-addrcl 9455  ax-mulcl 9456  ax-mulrcl 9457  ax-mulcom 9458  ax-addass 9459  ax-mulass 9460  ax-distr 9461  ax-i2m1 9462  ax-1ne0 9463  ax-1rid 9464  ax-rnegex 9465  ax-rrecex 9466  ax-cnre 9467  ax-pre-lttri 9468  ax-pre-lttrn 9469  ax-pre-ltadd 9470  ax-pre-mulgt0 9471
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  df-3an 967  df-tru 1373  df-ex 1588  df-nf 1591  df-sb 1703  df-eu 2266  df-mo 2267  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-ne 2650  df-nel 2651  df-ral 2804  df-rex 2805  df-reu 2806  df-rab 2808  df-v 3080  df-sbc 3295  df-csb 3397  df-dif 3440  df-un 3442  df-in 3444  df-ss 3451  df-pss 3453  df-nul 3747  df-if 3901  df-pw 3971  df-sn 3987  df-pr 3989  df-tp 3991  df-op 3993  df-uni 4201  df-iun 4282  df-br 4402  df-opab 4460  df-mpt 4461  df-tr 4495  df-eprel 4741  df-id 4745  df-po 4750  df-so 4751  df-fr 4788  df-we 4790  df-ord 4831  df-on 4832  df-lim 4833  df-suc 4834  df-xp 4955  df-rel 4956  df-cnv 4957  df-co 4958  df-dm 4959  df-rn 4960  df-res 4961  df-ima 4962  df-iota 5490  df-fun 5529  df-fn 5530  df-f 5531  df-f1 5532  df-fo 5533  df-f1o 5534  df-fv 5535  df-riota 6162  df-ov 6204  df-oprab 6205  df-mpt2 6206  df-om 6588  df-1st 6688  df-2nd 6689  df-recs 6943  df-rdg 6977  df-1o 7031  df-er 7212  df-en 7422  df-dom 7423  df-sdom 7424  df-fin 7425  df-pnf 9532  df-mnf 9533  df-xr 9534  df-ltxr 9535  df-le 9536  df-sub 9709  df-neg 9710  df-nn 10435  df-n0 10692  df-z 10759  df-uz 10974  df-fz 11556
This theorem is referenced by:  ballotlemfrci  27055  ballotlemfrceq  27056
  Copyright terms: Public domain W3C validator