Theorem ballotfilem4 13159

Description: If the first pick is a vote for B, A is not ahead throughout the count. (Contributed by Thierry Arnoux, 25-Nov-2016.)

Hypotheses

Ref	Expression
ballotth.m	|- M e. NN
ballotth.n	|- N e. NN
ballotfi.o	|- O = { c e. ( ~P ( 1 ... ( M + N ) ) i^i Fin ) | (♯ ` c ) = M }
ballotfi.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 ) }

Assertion

Ref	Expression
ballotfilem4	|- ( C e. O -> ( -. 1 e. C -> -. C e. E ) )

Distinct variable groups:   M, c   N, c   O, c   i, M   i, N   i, O, c   F, c, i   C, i

Allowed substitution hints:   C( x, c)   P( x, i, c)   E( x, i, c)   F( x)   M( x)   N( x)   O( x)

Proof of Theorem ballotfilem4

Step	Hyp	Ref	Expression
1		ballotth.m	. . . . . . . 8 |- M e. NN
2		ballotth.n	. . . . . . . 8 |- N e. NN
3		nnaddcl 9259	. . . . . . . 8 |- ( ( M e. NN /\ N e. NN ) -> ( M + N ) e. NN )
4	1, 2, 3	mp2an 426	. . . . . . 7 |- ( M + N ) e. NN
5		elnnuz 9894	. . . . . . 7 |- ( ( M + N ) e. NN <-> ( M + N ) e. ( ZZ>= ` 1 ) )
6	4, 5	mpbi 145	. . . . . 6 |- ( M + N ) e. ( ZZ>= ` 1 )
7		eluzfz1 10368	. . . . . 6 |- ( ( M + N ) e. ( ZZ>= ` 1 ) -> 1 e. ( 1 ... ( M + N ) ) )
8	6, 7	ax-mp 5	. . . . 5 |- 1 e. ( 1 ... ( M + N ) )
9		0le1 8757	. . . . . . . . . 10 |- 0 <_ 1
10		0re 8276	. . . . . . . . . . 11 |- 0 e. RR
11		1re 8275	. . . . . . . . . . 11 |- 1 e. RR
12	10, 11	lenlti 8376	. . . . . . . . . 10 |- ( 0 <_ 1 <-> -. 1 < 0 )
13	9, 12	mpbi 145	. . . . . . . . 9 |- -. 1 < 0
14		ltsub13 8719	. . . . . . . . . . 11 |- ( ( 0 e. RR /\ 0 e. RR /\ 1 e. RR ) -> ( 0 < ( 0 - 1 ) <-> 1 < ( 0 - 0 ) ) )
15	10, 10, 11, 14	mp3an 1374	. . . . . . . . . 10 |- ( 0 < ( 0 - 1 ) <-> 1 < ( 0 - 0 ) )
16		0m0e0 9351	. . . . . . . . . . 11 |- ( 0 - 0 ) = 0
17	16	breq2i 4119	. . . . . . . . . 10 |- ( 1 < ( 0 - 0 ) <-> 1 < 0 )
18	15, 17	bitri 184	. . . . . . . . 9 |- ( 0 < ( 0 - 1 ) <-> 1 < 0 )
19	13, 18	mtbir 678	. . . . . . . 8 |- -. 0 < ( 0 - 1 )
20		1m1e0 9308	. . . . . . . . . . . 12 |- ( 1 - 1 ) = 0
21	20	fveq2i 5675	. . . . . . . . . . 11 |- ( ( F ` C ) ` ( 1 - 1 ) ) = ( ( F ` C ) ` 0 )
22		ballotfi.o	. . . . . . . . . . . 12 |- O = { c e. ( ~P ( 1 ... ( M + N ) ) i^i Fin ) | (♯ ` c ) = M }
23		ballotfi.p	. . . . . . . . . . . 12 |- P = ( x e. ( ~P O i^i Fin ) |-> ( (♯ ` x ) / (♯ ` O ) ) )
24		ballotth.f	. . . . . . . . . . . 12 |- F = ( c e. O |-> ( i e. ZZ |-> ( (♯ ` ( ( 1 ... i ) i^i c ) ) - (♯ ` ( ( 1 ... i ) \ c ) ) ) ) )
25	1, 2, 22, 23, 24	ballotfilemfval0 13156	. . . . . . . . . . 11 |- ( C e. O -> ( ( F ` C ) ` 0 ) = 0 )
26	21, 25	eqtrid 2279	. . . . . . . . . 10 |- ( C e. O -> ( ( F ` C ) ` ( 1 - 1 ) ) = 0 )
27	26	oveq1d 6067	. . . . . . . . 9 |- ( C e. O -> ( ( ( F ` C ) ` ( 1 - 1 ) ) - 1 ) = ( 0 - 1 ) )
28	27	breq2d 4123	. . . . . . . 8 |- ( C e. O -> ( 0 < ( ( ( F ` C ) ` ( 1 - 1 ) ) - 1 ) <-> 0 < ( 0 - 1 ) ) )
29	19, 28	mtbiri 682	. . . . . . 7 |- ( C e. O -> -. 0 < ( ( ( F ` C ) ` ( 1 - 1 ) ) - 1 ) )
30	29	adantr 276	. . . . . 6 |- ( ( C e. O /\ -. 1 e. C ) -> -. 0 < ( ( ( F ` C ) ` ( 1 - 1 ) ) - 1 ) )
31		simpl 109	. . . . . . . . . . 11 |- ( ( C e. O /\ 1 e. ( 1 ... ( M + N ) ) ) -> C e. O )
32		1nn 9250	. . . . . . . . . . . 12 |- 1 e. NN
33	32	a1i 9	. . . . . . . . . . 11 |- ( ( C e. O /\ 1 e. ( 1 ... ( M + N ) ) ) -> 1 e. NN )
34	1, 2, 22, 23, 24, 31, 33	ballotfilemfp1 13152	. . . . . . . . . 10 |- ( ( C e. O /\ 1 e. ( 1 ... ( M + N ) ) ) -> ( ( -. 1 e. C -> ( ( F ` C ) ` 1 ) = ( ( ( F ` C ) ` ( 1 - 1 ) ) - 1 ) ) /\ ( 1 e. C -> ( ( F ` C ) ` 1 ) = ( ( ( F ` C ) ` ( 1 - 1 ) ) + 1 ) ) ) )
35	34	simpld 112	. . . . . . . . 9 |- ( ( C e. O /\ 1 e. ( 1 ... ( M + N ) ) ) -> ( -. 1 e. C -> ( ( F ` C ) ` 1 ) = ( ( ( F ` C ) ` ( 1 - 1 ) ) - 1 ) ) )
36	8, 35	mpan2 425	. . . . . . . 8 |- ( C e. O -> ( -. 1 e. C -> ( ( F ` C ) ` 1 ) = ( ( ( F ` C ) ` ( 1 - 1 ) ) - 1 ) ) )
37	36	imp 124	. . . . . . 7 |- ( ( C e. O /\ -. 1 e. C ) -> ( ( F ` C ) ` 1 ) = ( ( ( F ` C ) ` ( 1 - 1 ) ) - 1 ) )
38	37	breq2d 4123	. . . . . 6 |- ( ( C e. O /\ -. 1 e. C ) -> ( 0 < ( ( F ` C ) ` 1 ) <-> 0 < ( ( ( F ` C ) ` ( 1 - 1 ) ) - 1 ) ) )
39	30, 38	mtbird 680	. . . . 5 |- ( ( C e. O /\ -. 1 e. C ) -> -. 0 < ( ( F ` C ) ` 1 ) )
40		fveq2 5672	. . . . . . . 8 |- ( i = 1 -> ( ( F ` C ) ` i ) = ( ( F ` C ) ` 1 ) )
41	40	breq2d 4123	. . . . . . 7 |- ( i = 1 -> ( 0 < ( ( F ` C ) ` i ) <-> 0 < ( ( F ` C ) ` 1 ) ) )
42	41	notbid 673	. . . . . 6 |- ( i = 1 -> ( -. 0 < ( ( F ` C ) ` i ) <-> -. 0 < ( ( F ` C ) ` 1 ) ) )
43	42	rspcev 2923	. . . . 5 |- ( ( 1 e. ( 1 ... ( M + N ) ) /\ -. 0 < ( ( F ` C ) ` 1 ) ) -> E. i e. ( 1 ... ( M + N ) ) -. 0 < ( ( F ` C ) ` i ) )
44	8, 39, 43	sylancr 414	. . . 4 |- ( ( C e. O /\ -. 1 e. C ) -> E. i e. ( 1 ... ( M + N ) ) -. 0 < ( ( F ` C ) ` i ) )
45		rexnalim 2533	. . . 4 |- ( E. i e. ( 1 ... ( M + N ) ) -. 0 < ( ( F ` C ) ` i ) -> -. A. i e. ( 1 ... ( M + N ) ) 0 < ( ( F ` C ) ` i ) )
46	44, 45	syl 14	. . 3 |- ( ( C e. O /\ -. 1 e. C ) -> -. A. i e. ( 1 ... ( M + N ) ) 0 < ( ( F ` C ) ` i ) )
47		ballotth.e	. . . . 5 |- E = { c e. O | A. i e. ( 1 ... ( M + N ) ) 0 < ( ( F ` c ) ` i ) }
48	1, 2, 22, 23, 24, 47	ballotfileme 13157	. . . 4 |- ( C e. E <-> ( C e. O /\ A. i e. ( 1 ... ( M + N ) ) 0 < ( ( F ` C ) ` i ) ) )
49	48	simprbi 275	. . 3 |- ( C e. E -> A. i e. ( 1 ... ( M + N ) ) 0 < ( ( F ` C ) ` i ) )
50	46, 49	nsyl 633	. 2 |- ( ( C e. O /\ -. 1 e. C ) -> -. C e. E )
51	50	ex 115	1 |- ( C e. O -> ( -. 1 e. C -> -. C e. E ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1398   e. wcel 2205   A.wral 2522   E.wrex 2523   {crab 2526   \ cdif 3210   i^i cin 3212   ~Pcpw 3671   class class class wbr 4111   |-> cmpt 4173   ` cfv 5354  (class class class)co 6052   Fincfn 6977   RRcr 8128   0cc0 8129   1c1 8130   + caddc 8132   < clt 8310   <_ cle 8311   - cmin 8446   / cdiv 8948   NNcn 9239   ZZcz 9579   ZZ>=cuz 9856   ...cfz 10345  ♯chash 11142

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-nul 4238  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-iinf 4712  ax-cnex 8220  ax-resscn 8221  ax-1cn 8222  ax-1re 8223  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-addcom 8229  ax-addass 8231  ax-distr 8233  ax-i2m1 8234  ax-0lt1 8235  ax-0id 8237  ax-rnegex 8238  ax-cnre 8240  ax-pre-ltirr 8241  ax-pre-ltwlin 8242  ax-pre-lttrn 8243  ax-pre-apti 8244  ax-pre-ltadd 8245

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-if 3623  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-tr 4211  df-id 4416  df-iord 4489  df-on 4491  df-ilim 4492  df-suc 4494  df-iom 4715  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-recs 6538  df-irdg 6603  df-frec 6624  df-1o 6649  df-oadd 6653  df-er 6769  df-en 6978  df-dom 6979  df-fin 6980  df-pnf 8312  df-mnf 8313  df-xr 8314  df-ltxr 8315  df-le 8316  df-sub 8448  df-neg 8449  df-inn 9240  df-n0 9499  df-z 9580  df-uz 9857  df-fz 10346  df-ihash 11143

This theorem is referenced by: (None)