Theorem ballotfilem4 13299

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
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 ) }

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 9333	. . . . . . . 8 |- ( ( M e. NN /\ N e. NN ) -> ( M + N ) e. NN )
4	1, 2, 3	mp2an 430	. . . . . . 7 |- ( M + N ) e. NN
5		elnnuz 9975	. . . . . . 7 |- ( ( M + N ) e. NN <-> ( M + N ) e. ( ZZ>= ` 1 ) )
6	4, 5	mpbi 145	. . . . . 6 |- ( M + N ) e. ( ZZ>= ` 1 )
7		eluzfz1 10452	. . . . . 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 8816	. . . . . . . . . 10 |- 0 <_ 1
10		0re 8332	. . . . . . . . . . 11 |- 0 e. RR
11		1re 8331	. . . . . . . . . . 11 |- 1 e. RR
12	10, 11	lenlti 8433	. . . . . . . . . 10 |- ( 0 <_ 1 <-> -. 1 < 0 )
13	9, 12	mpbi 145	. . . . . . . . 9 |- -. 1 < 0
14		ltsub13 8778	. . . . . . . . . . 11 |- ( ( 0 e. RR /\ 0 e. RR /\ 1 e. RR ) -> ( 0 < ( 0 - 1 ) <-> 1 < ( 0 - 0 ) ) )
15	10, 10, 11, 14	mp3an 1378	. . . . . . . . . 10 |- ( 0 < ( 0 - 1 ) <-> 1 < ( 0 - 0 ) )
16		0m0e0 9425	. . . . . . . . . . 11 |- ( 0 - 0 ) = 0
17	16	breq2i 4139	. . . . . . . . . 10 |- ( 1 < ( 0 - 0 ) <-> 1 < 0 )
18	15, 17	bitri 184	. . . . . . . . 9 |- ( 0 < ( 0 - 1 ) <-> 1 < 0 )
19	13, 18	mtbir 682	. . . . . . . 8 |- -. 0 < ( 0 - 1 )
20		1m1e0 9382	. . . . . . . . . . . 12 |- ( 1 - 1 ) = 0
21	20	fveq2i 5701	. . . . . . . . . . 11 |- ( ( F ` C ) ` ( 1 - 1 ) ) = ( ( F ` C ) ` 0 )
22		ballotfilem.o	. . . . . . . . . . . 12 |- O = { c e. ( ~P ( 1 ... ( M + N ) ) i^i Fin ) | (♯ ` c ) = M }
23		ballotfilem.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 13293	. . . . . . . . . . 11 |- ( C e. O -> ( ( F ` C ) ` 0 ) = 0 )
26	21, 25	eqtrid 2283	. . . . . . . . . 10 |- ( C e. O -> ( ( F ` C ) ` ( 1 - 1 ) ) = 0 )
27	26	oveq1d 6103	. . . . . . . . 9 |- ( C e. O -> ( ( ( F ` C ) ` ( 1 - 1 ) ) - 1 ) = ( 0 - 1 ) )
28	27	breq2d 4143	. . . . . . . 8 |- ( C e. O -> ( 0 < ( ( ( F ` C ) ` ( 1 - 1 ) ) - 1 ) <-> 0 < ( 0 - 1 ) ) )
29	19, 28	mtbiri 686	. . . . . . 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 9324	. . . . . . . . . . . 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 13289	. . . . . . . . . 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 429	. . . . . . . 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 4143	. . . . . 6 |- ( ( C e. O /\ -. 1 e. C ) -> ( 0 < ( ( F ` C ) ` 1 ) <-> 0 < ( ( ( F ` C ) ` ( 1 - 1 ) ) - 1 ) ) )
39	30, 38	mtbird 684	. . . . 5 |- ( ( C e. O /\ -. 1 e. C ) -> -. 0 < ( ( F ` C ) ` 1 ) )
40		fveq2 5698	. . . . . . . 8 |- ( i = 1 -> ( ( F ` C ) ` i ) = ( ( F ` C ) ` 1 ) )
41	40	breq2d 4143	. . . . . . 7 |- ( i = 1 -> ( 0 < ( ( F ` C ) ` i ) <-> 0 < ( ( F ` C ) ` 1 ) ) )
42	41	notbid 677	. . . . . 6 |- ( i = 1 -> ( -. 0 < ( ( F ` C ) ` i ) <-> -. 0 < ( ( F ` C ) ` 1 ) ) )
43	42	rspcev 2929	. . . . 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 418	. . . 4 |- ( ( C e. O /\ -. 1 e. C ) -> E. i e. ( 1 ... ( M + N ) ) -. 0 < ( ( F ` C ) ` i ) )
45		rexnalim 2539	. . . 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 13294	. . . 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 637	. 2 |- ( ( C e. O /\ -. 1 e. C ) -> -. C e. E )
51	50	ex 115	1 |- ( C e. O -> ( -. 1 e. C -> -. C e. E ) )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   A.wral 2528   E.wrex 2529   {crab 2532   \ cdif 3217   i^i cin 3219   ~Pcpw 3688   class class class wbr 4131   |-> cmpt 4193   ` cfv 5380  (class class class)co 6088   Fincfn 7026   RRcr 8184   0cc0 8185   1c1 8186   + caddc 8188   < clt 8366   <_ cle 8367   - cmin 8504   / cdiv 9010   NNcn 9313   ZZcz 9655   ZZ>=cuz 9937   ...cfz 10428  ♯chash 11236

This proof depends on 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 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301

This proof 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-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 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-frec 6666  df-1o 6691  df-oadd 6695  df-er 6811  df-en 7027  df-dom 7028  df-fin 7029  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-inn 9314  df-n0 9575  df-z 9656  df-uz 9938  df-fz 10429  df-ihash 11237

This theorem is used by:  ballotfilemth  13339