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

Theorem ballotlem1ri 24784
Description: When the vote on the first tie is for A, the first vote is also for A on the reverse counting. (Contributed by Thierry Arnoux, 18-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
) )
Assertion
Ref Expression
ballotlem1ri  |-  ( C  e.  ( O  \  E )  ->  (
1  e.  ( R `
 C )  <->  ( I `  C )  e.  C
) )
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    S, k, i, c    R, i, k    x, c   
x, C    x, F    x, M    x, N
Allowed substitution hints:    C( c)    P( x, i, k, c)    R( x, c)    S( x)    E( x)    I( x)    O( x)

Proof of Theorem ballotlem1ri
StepHypRef Expression
1 ballotth.m . . . . . 6  |-  M  e.  NN
2 ballotth.n . . . . . 6  |-  N  e.  NN
3 nnaddcl 10014 . . . . . 6  |-  ( ( M  e.  NN  /\  N  e.  NN )  ->  ( M  +  N
)  e.  NN )
41, 2, 3mp2an 654 . . . . 5  |-  ( M  +  N )  e.  NN
5 nnuz 10513 . . . . 5  |-  NN  =  ( ZZ>= `  1 )
64, 5eleqtri 2507 . . . 4  |-  ( M  +  N )  e.  ( ZZ>= `  1 )
7 eluzfz1 11056 . . . 4  |-  ( ( M  +  N )  e.  ( ZZ>= `  1
)  ->  1  e.  ( 1 ... ( M  +  N )
) )
86, 7mp1i 12 . . 3  |-  ( C  e.  ( O  \  E )  ->  1  e.  ( 1 ... ( M  +  N )
) )
9 ballotth.o . . . . . 6  |-  O  =  { c  e.  ~P ( 1 ... ( M  +  N )
)  |  ( # `  c )  =  M }
10 ballotth.p . . . . . 6  |-  P  =  ( x  e.  ~P O  |->  ( ( # `  x )  /  ( # `
 O ) ) )
11 ballotth.f . . . . . 6  |-  F  =  ( c  e.  O  |->  ( i  e.  ZZ  |->  ( ( # `  (
( 1 ... i
)  i^i  c )
)  -  ( # `  ( ( 1 ... i )  \  c
) ) ) ) )
12 ballotth.e . . . . . 6  |-  E  =  { c  e.  O  |  A. i  e.  ( 1 ... ( M  +  N ) ) 0  <  ( ( F `  c ) `
 i ) }
13 ballotth.mgtn . . . . . 6  |-  N  < 
M
14 ballotth.i . . . . . 6  |-  I  =  ( c  e.  ( O  \  E ) 
|->  sup ( { k  e.  ( 1 ... ( M  +  N
) )  |  ( ( F `  c
) `  k )  =  0 } ,  RR ,  `'  <  ) )
151, 2, 9, 10, 11, 12, 13, 14ballotlemiex 24751 . . . . 5  |-  ( C  e.  ( O  \  E )  ->  (
( I `  C
)  e.  ( 1 ... ( M  +  N ) )  /\  ( ( F `  C ) `  (
I `  C )
)  =  0 ) )
1615simpld 446 . . . 4  |-  ( C  e.  ( O  \  E )  ->  (
I `  C )  e.  ( 1 ... ( M  +  N )
) )
17 elfzle1 11052 . . . 4  |-  ( ( I `  C )  e.  ( 1 ... ( M  +  N
) )  ->  1  <_  ( I `  C
) )
1816, 17syl 16 . . 3  |-  ( C  e.  ( O  \  E )  ->  1  <_  ( I `  C
) )
19 ballotth.s . . . 4  |-  S  =  ( c  e.  ( O  \  E ) 
|->  ( i  e.  ( 1 ... ( M  +  N ) ) 
|->  if ( i  <_ 
( I `  c
) ,  ( ( ( I `  c
)  +  1 )  -  i ) ,  i ) ) )
20 ballotth.r . . . 4  |-  R  =  ( c  e.  ( O  \  E ) 
|->  ( ( S `  c ) " c
) )
211, 2, 9, 10, 11, 12, 13, 14, 19, 20ballotlemrv1 24770 . . 3  |-  ( ( C  e.  ( O 
\  E )  /\  1  e.  ( 1 ... ( M  +  N ) )  /\  1  <_  ( I `  C ) )  -> 
( 1  e.  ( R `  C )  <-> 
( ( ( I `
 C )  +  1 )  -  1 )  e.  C ) )
228, 18, 21mpd3an23 1281 . 2  |-  ( C  e.  ( O  \  E )  ->  (
1  e.  ( R `
 C )  <->  ( (
( I `  C
)  +  1 )  -  1 )  e.  C ) )
23 elfzelz 11051 . . . . . 6  |-  ( ( I `  C )  e.  ( 1 ... ( M  +  N
) )  ->  (
I `  C )  e.  ZZ )
2416, 23syl 16 . . . . 5  |-  ( C  e.  ( O  \  E )  ->  (
I `  C )  e.  ZZ )
2524zcnd 10368 . . . 4  |-  ( C  e.  ( O  \  E )  ->  (
I `  C )  e.  CC )
26 ax-1cn 9040 . . . . 5  |-  1  e.  CC
2726a1i 11 . . . 4  |-  ( C  e.  ( O  \  E )  ->  1  e.  CC )
2825, 27pncand 9404 . . 3  |-  ( C  e.  ( O  \  E )  ->  (
( ( I `  C )  +  1 )  -  1 )  =  ( I `  C ) )
2928eleq1d 2501 . 2  |-  ( C  e.  ( O  \  E )  ->  (
( ( ( I `
 C )  +  1 )  -  1 )  e.  C  <->  ( I `  C )  e.  C
) )
3022, 29bitrd 245 1  |-  ( C  e.  ( O  \  E )  ->  (
1  e.  ( R `
 C )  <->  ( I `  C )  e.  C
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177    = wceq 1652    e. wcel 1725   A.wral 2697   {crab 2701    \ cdif 3309    i^i cin 3311   ifcif 3731   ~Pcpw 3791   class class class wbr 4204    e. cmpt 4258   `'ccnv 4869   "cima 4873   ` cfv 5446  (class class class)co 6073   supcsup 7437   CCcc 8980   RRcr 8981   0cc0 8982   1c1 8983    + caddc 8985    < clt 9112    <_ cle 9113    - cmin 9283    / cdiv 9669   NNcn 9992   ZZcz 10274   ZZ>=cuz 10480   ...cfz 11035   #chash 11610
This theorem is referenced by:  ballotlem7  24785
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-13 1727  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416  ax-rep 4312  ax-sep 4322  ax-nul 4330  ax-pow 4369  ax-pr 4395  ax-un 4693  ax-cnex 9038  ax-resscn 9039  ax-1cn 9040  ax-icn 9041  ax-addcl 9042  ax-addrcl 9043  ax-mulcl 9044  ax-mulrcl 9045  ax-mulcom 9046  ax-addass 9047  ax-mulass 9048  ax-distr 9049  ax-i2m1 9050  ax-1ne0 9051  ax-1rid 9052  ax-rnegex 9053  ax-rrecex 9054  ax-cnre 9055  ax-pre-lttri 9056  ax-pre-lttrn 9057  ax-pre-ltadd 9058  ax-pre-mulgt0 9059
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2284  df-mo 2285  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ne 2600  df-nel 2601  df-ral 2702  df-rex 2703  df-reu 2704  df-rmo 2705  df-rab 2706  df-v 2950  df-sbc 3154  df-csb 3244  df-dif 3315  df-un 3317  df-in 3319  df-ss 3326  df-pss 3328  df-nul 3621  df-if 3732  df-pw 3793  df-sn 3812  df-pr 3813  df-tp 3814  df-op 3815  df-uni 4008  df-int 4043  df-iun 4087  df-br 4205  df-opab 4259  df-mpt 4260  df-tr 4295  df-eprel 4486  df-id 4490  df-po 4495  df-so 4496  df-fr 4533  df-we 4535  df-ord 4576  df-on 4577  df-lim 4578  df-suc 4579  df-om 4838  df-xp 4876  df-rel 4877  df-cnv 4878  df-co 4879  df-dm 4880  df-rn 4881  df-res 4882  df-ima 4883  df-iota 5410  df-fun 5448  df-fn 5449  df-f 5450  df-f1 5451  df-fo 5452  df-f1o 5453  df-fv 5454  df-ov 6076  df-oprab 6077  df-mpt2 6078  df-1st 6341  df-2nd 6342  df-riota 6541  df-recs 6625  df-rdg 6660  df-1o 6716  df-oadd 6720  df-er 6897  df-en 7102  df-dom 7103  df-sdom 7104  df-fin 7105  df-sup 7438  df-card 7818  df-cda 8040  df-pnf 9114  df-mnf 9115  df-xr 9116  df-ltxr 9117  df-le 9118  df-sub 9285  df-neg 9286  df-nn 9993  df-2 10050  df-n0 10214  df-z 10275  df-uz 10481  df-rp 10605  df-fz 11036  df-hash 11611
  Copyright terms: Public domain W3C validator