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

Theorem ballotfilem1ri 13261
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
ballotfilem.o  |-  O  =  { c  e.  ( ~P ( 1 ... ( M  +  N
) )  i^i  Fin )  |  ( `  c
)  =  M }
ballotfilem.p  |-  P  =  ( x  e.  ( ~P O  i^i  Fin )  |->  ( ( `  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 ) 
|-> inf ( { 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
ballotfilem1ri  |-  ( 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 ballotfilem1ri
StepHypRef Expression
1 ballotth.m . . . . . 6  |-  M  e.  NN
2 ballotth.n . . . . . 6  |-  N  e.  NN
3 nnaddcl 9307 . . . . . 6  |-  ( ( M  e.  NN  /\  N  e.  NN )  ->  ( M  +  N
)  e.  NN )
41, 2, 3mp2an 430 . . . . 5  |-  ( M  +  N )  e.  NN
5 nnuz 9941 . . . . 5  |-  NN  =  ( ZZ>= `  1 )
64, 5eleqtri 2313 . . . 4  |-  ( M  +  N )  e.  ( ZZ>= `  1 )
7 eluzfz1 10418 . . . 4  |-  ( ( M  +  N )  e.  ( ZZ>= `  1
)  ->  1  e.  ( 1 ... ( M  +  N )
) )
86, 7mp1i 10 . . 3  |-  ( C  e.  ( O  \  E )  ->  1  e.  ( 1 ... ( M  +  N )
) )
9 ballotfilem.o . . . . . 6  |-  O  =  { c  e.  ( ~P ( 1 ... ( M  +  N
) )  i^i  Fin )  |  ( `  c
)  =  M }
10 ballotfilem.p . . . . . 6  |-  P  =  ( x  e.  ( ~P O  i^i  Fin )  |->  ( ( `  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 ) 
|-> inf ( { k  e.  ( 1 ... ( M  +  N )
)  |  ( ( F `  c ) `
 k )  =  0 } ,  RR ,  <  ) )
151, 2, 9, 10, 11, 12, 13, 14ballotfilemiex 13227 . . . . 5  |-  ( C  e.  ( O  \  E )  ->  (
( I `  C
)  e.  ( 1 ... ( M  +  N ) )  /\  ( ( F `  C ) `  (
I `  C )
)  =  0 ) )
1615simpld 112 . . . 4  |-  ( C  e.  ( O  \  E )  ->  (
I `  C )  e.  ( 1 ... ( M  +  N )
) )
17 elfzle1 10414 . . . 4  |-  ( ( I `  C )  e.  ( 1 ... ( M  +  N
) )  ->  1  <_  ( I `  C
) )
1816, 17syl 14 . . 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, 20ballotfilemrv1 13247 . . 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 1380 . 2  |-  ( C  e.  ( O  \  E )  ->  (
1  e.  ( R `
 C )  <->  ( (
( I `  C
)  +  1 )  -  1 )  e.  C ) )
2316elfzelzd 10412 . . . . 5  |-  ( C  e.  ( O  \  E )  ->  (
I `  C )  e.  ZZ )
2423zcnd 9752 . . . 4  |-  ( C  e.  ( O  \  E )  ->  (
I `  C )  e.  CC )
25 1cnd 8336 . . . 4  |-  ( C  e.  ( O  \  E )  ->  1  e.  CC )
2624, 25pncand 8632 . . 3  |-  ( C  e.  ( O  \  E )  ->  (
( ( I `  C )  +  1 )  -  1 )  =  ( I `  C ) )
2726eleq1d 2307 . 2  |-  ( C  e.  ( O  \  E )  ->  (
( ( ( I `
 C )  +  1 )  -  1 )  e.  C  <->  ( I `  C )  e.  C
) )
2822, 27bitrd 188 1  |-  ( C  e.  ( O  \  E )  ->  (
1  e.  ( R `
 C )  <->  ( I `  C )  e.  C
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1402    e. wcel 2209   A.wral 2528   {crab 2532    \ cdif 3217    i^i cin 3219   ifcif 3638   ~Pcpw 3688   class class class wbr 4128    |-> cmpt 4190   "cima 4775   ` cfv 5375  (class class class)co 6079   Fincfn 7016  infcinf 7317   RRcr 8172   0cc0 8173   1c1 8174    + caddc 8176    < clt 8354    <_ cle 8355    - cmin 8491    / cdiv 8996   NNcn 9287   ZZcz 9627   ZZ>=cuz 9904   ...cfz 10394  ♯chash 11197
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 4244  ax-sep 4247  ax-nul 4257  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-iinf 4733  ax-cnex 8264  ax-resscn 8265  ax-1cn 8266  ax-1re 8267  ax-icn 8268  ax-addcl 8269  ax-addrcl 8270  ax-mulcl 8271  ax-mulrcl 8272  ax-addcom 8273  ax-mulcom 8274  ax-addass 8275  ax-mulass 8276  ax-distr 8277  ax-i2m1 8278  ax-0lt1 8279  ax-1rid 8280  ax-0id 8281  ax-rnegex 8282  ax-precex 8283  ax-cnre 8284  ax-pre-ltirr 8285  ax-pre-ltwlin 8286  ax-pre-lttrn 8287  ax-pre-apti 8288  ax-pre-ltadd 8289  ax-pre-mulgt0 8290  ax-pre-mulext 8291
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 3639  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-tr 4228  df-id 4436  df-po 4439  df-iso 4440  df-iord 4509  df-on 4511  df-ilim 4512  df-suc 4514  df-iom 4736  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-isom 5384  df-riota 6032  df-ov 6082  df-oprab 6083  df-mpo 6084  df-1st 6368  df-2nd 6369  df-recs 6570  df-irdg 6635  df-frec 6656  df-1o 6681  df-oadd 6685  df-er 6801  df-en 7017  df-dom 7018  df-fin 7019  df-sup 7318  df-inf 7319  df-pnf 8356  df-mnf 8357  df-xr 8358  df-ltxr 8359  df-le 8360  df-sub 8493  df-neg 8494  df-reap 8897  df-ap 8904  df-div 8997  df-inn 9288  df-2 9346  df-n0 9547  df-z 9628  df-uz 9905  df-q 10003  df-rp 10038  df-fz 10395  df-fzo 10533  df-ihash 11198
This theorem is referenced by:  ballotfilem7  13262
  Copyright terms: Public domain W3C validator