Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ballotlemfrci Structured version   Visualization version   Unicode version
Theorem ballotlemfrci 30589
Description: Reverse counting preserves a tie at the first tie. (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 ) |-> 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 ) )
ballotlemg |- .^ = ( u e. Fin , v e. Fin |-> ( ( # ` ( v i^i u ) ) - ( # ` ( v \ u ) ) ) )
Assertion
Ref Expression
ballotlemfrci |- ( C e. ( O \ E ) -> ( ( F ` ( R ` C ) ) ` ( I ` C ) ) = 0 )
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   v, u, C   u, I, v   u, R, v   u, S, v
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)   M( x, v, u)   N( x, v, u)   O( x, v, u)
Proof of Theorem ballotlemfrci
StepHypRef Expression
1 ballotth.m . . . . . . 7 |- M e. NN
2 ballotth.n . . . . . . 7 |- N e. NN
3 ballotth.o . . . . . . 7 |- O = { c e. ~P ( 1 ... ( M + N ) ) | ( # ` c ) = M }
4 ballotth.p . . . . . . 7 |- P = ( x e. ~P O |-> ( ( # ` x ) / ( # ` O ) ) )
5 ballotth.f . . . . . . 7 |- F = ( c e. O |-> ( i e. ZZ |-> ( ( # ` ( ( 1 ... i ) i^i c ) ) - ( # ` ( ( 1 ... i ) \ c ) ) ) ) )
6 ballotth.e . . . . . . 7 |- E = { c e. O | A. i e. ( 1 ... ( M + N ) ) 0 < ( ( F ` c ) ` i ) }
7 ballotth.mgtn . . . . . . 7 |- N < M
8 ballotth.i . . . . . . 7 |- I = ( c e. ( O \ E ) |-> inf ( { k e. ( 1 ... ( M + N ) ) | ( ( F ` c ) ` k ) = 0 } , RR , < ) )
91, 2, 3, 4, 5, 6, 7, 8ballotlemiex 30563 . . . . . 6 |- ( C e. ( O \ E ) -> ( ( I ` C ) e. ( 1 ... ( M + N ) ) /\ ( ( F ` C ) ` ( I ` C ) ) = 0 ) )
109simpld 475 . . . . 5 |- ( C e. ( O \ E ) -> ( I ` C ) e. ( 1 ... ( M + N ) ) )
11 elfzuz 12338 . . . . 5 |- ( ( I ` C ) e. ( 1 ... ( M + N ) ) -> ( I ` C ) e. ( ZZ>= ` 1 ) )
12 eluzfz2 12349 . . . . 5 |- ( ( I ` C ) e. ( ZZ>= ` 1 ) -> ( I ` C ) e. ( 1 ... ( I ` C ) ) )
1310, 11, 123syl 18 . . . 4 |- ( C e. ( O \ E ) -> ( I ` C ) e. ( 1 ... ( I ` C ) ) )
14 ballotth.s . . . . 5 |- S = ( c e. ( O \ E ) |-> ( i e. ( 1 ... ( M + N ) ) |-> if ( i <_ ( I ` c ) , ( ( ( I ` c ) + 1 ) - i ) , i ) ) )
15 ballotth.r . . . . 5 |- R = ( c e. ( O \ E ) |-> ( ( S ` c ) " c ) )
16 ballotlemg . . . . 5 |- .^ = ( u e. Fin , v e. Fin |-> ( ( # ` ( v i^i u ) ) - ( # ` ( v \ u ) ) ) )
171, 2, 3, 4, 5, 6, 7, 8, 14, 15, 16ballotlemfrc 30588 . . . 4 |- ( ( C e. ( O \ E ) /\ ( I ` C ) e. ( 1 ... ( I ` C ) ) ) -> ( ( F ` ( R ` C ) ) ` ( I ` C ) ) = ( C .^ ( ( ( S ` C ) ` ( I ` C ) ) ... ( I ` C ) ) ) )
1813, 17mpdan 702 . . 3 |- ( C e. ( O \ E ) -> ( ( F ` ( R ` C ) ) ` ( I ` C ) ) = ( C .^ ( ( ( S ` C ) ` ( I ` C ) ) ... ( I ` C ) ) ) )
191, 2, 3, 4, 5, 6, 7, 8, 14ballotlemsi 30576 . . . . 5 |- ( C e. ( O \ E ) -> ( ( S ` C ) ` ( I ` C ) ) = 1 )
2019oveq1d 6665 . . . 4 |- ( C e. ( O \ E ) -> ( ( ( S ` C ) ` ( I ` C ) ) ... ( I ` C ) ) = ( 1 ... ( I ` C ) ) )
2120oveq2d 6666 . . 3 |- ( C e. ( O \ E ) -> ( C .^ ( ( ( S ` C ) ` ( I ` C ) ) ... ( I ` C ) ) ) = ( C .^ ( 1 ... ( I ` C ) ) ) )
2218, 21eqtrd 2656 . 2 |- ( C e. ( O \ E ) -> ( ( F ` ( R ` C ) ) ` ( I ` C ) ) = ( C .^ ( 1 ... ( I ` C ) ) ) )
23 1eluzge0 11732 . . . . 5 |- 1 e. ( ZZ>= ` 0 )
24 fzss1 12380 . . . . 5 |- ( 1 e. ( ZZ>= ` 0 ) -> ( 1 ... ( M + N ) ) C_ ( 0 ... ( M + N ) ) )
2523, 24ax-mp 5 . . . 4 |- ( 1 ... ( M + N ) ) C_ ( 0 ... ( M + N ) )
2625, 10sseldi 3601 . . 3 |- ( C e. ( O \ E ) -> ( I ` C ) e. ( 0 ... ( M + N ) ) )
271, 2, 3, 4, 5, 6, 7, 8, 14, 15, 16ballotlemfg 30587 . . 3 |- ( ( C e. ( O \ E ) /\ ( I ` C ) e. ( 0 ... ( M + N ) ) ) -> ( ( F ` C ) ` ( I ` C ) ) = ( C .^ ( 1 ... ( I ` C ) ) ) )
2826, 27mpdan 702 . 2 |- ( C e. ( O \ E ) -> ( ( F ` C ) ` ( I ` C ) ) = ( C .^ ( 1 ... ( I ` C ) ) ) )
299simprd 479 . 2 |- ( C e. ( O \ E ) -> ( ( F ` C ) ` ( I ` C ) ) = 0 )
3022, 28, 293eqtr2d 2662 1 |- ( C e. ( O \ E ) -> ( ( F ` ( R ` C ) ) ` ( I ` C ) ) = 0 )
Colors of variables: wff setvar class
Syntax hints:   -> wi 4   = wceq 1483   e. wcel 1990   A.wral 2912   {crab 2916   \ cdif 3571   i^i cin 3573   C_ wss 3574   ifcif 4086   ~Pcpw 4158   class class class wbr 4653   |-> cmpt 4729   "cima 5117   ` cfv 5888  (class class class)co 6650   |-> cmpt2 6652   Fincfn 7955  infcinf 8347   RRcr 9935   0cc0 9936   1c1 9937   + caddc 9939   < clt 10074   <_ cle 10075   - cmin 10266   / cdiv 10684   NNcn 11020   ZZcz 11377   ZZ>=cuz 11687   ...cfz 12326   #chash 13117
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-cnex 9992  ax-resscn 9993  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-addrcl 9997  ax-mulcl 9998  ax-mulrcl 9999  ax-mulcom 10000  ax-addass 10001  ax-mulass 10002  ax-distr 10003  ax-i2m1 10004  ax-1ne0 10005  ax-1rid 10006  ax-rnegex 10007  ax-rrecex 10008  ax-cnre 10009  ax-pre-lttri 10010  ax-pre-lttrn 10011  ax-pre-ltadd 10012  ax-pre-mulgt0 10013
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-1st 7168  df-2nd 7169  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-1o 7560  df-oadd 7564  df-er 7742  df-en 7956  df-dom 7957  df-sdom 7958  df-fin 7959  df-sup 8348  df-inf 8349  df-card 8765  df-cda 8990  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-le 10080  df-sub 10268  df-neg 10269  df-nn 11021  df-2 11079  df-n0 11293  df-z 11378  df-uz 11688  df-rp 11833  df-fz 12327  df-hash 13118
This theorem is referenced by:  ballotlemrc  30592  ballotlemirc  30593
  Copyright terms: Public domain W3C validator