Theorem ballotlemirc 34204

Description: Applying 𝑅 does not change first ties. (Contributed by Thierry Arnoux, 19-Apr-2017.) (Revised by AV, 6-Oct-2020.)

Hypotheses

Ref	Expression
ballotth.m	⊢ 𝑀 ∈ ℕ
ballotth.n	⊢ 𝑁 ∈ ℕ
ballotth.o	⊢ 𝑂 = {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (♯‘𝑐) = 𝑀}
ballotth.p	⊢ 𝑃 = (𝑥 ∈ 𝒫 𝑂 ↦ ((♯‘𝑥) / (♯‘𝑂)))
ballotth.f	⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
ballotth.e	⊢ 𝐸 = {𝑐 ∈ 𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑐)‘𝑖)}
ballotth.mgtn	⊢ 𝑁 < 𝑀
ballotth.i	⊢ 𝐼 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑐)‘𝑘) = 0}, ℝ, < ))
ballotth.s	⊢ 𝑆 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼‘𝑐), (((𝐼‘𝑐) + 1) − 𝑖), 𝑖)))
ballotth.r	⊢ 𝑅 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ ((𝑆‘𝑐) “ 𝑐))

Assertion

Ref	Expression
ballotlemirc	⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘(𝑅‘𝐶)) = (𝐼‘𝐶))

Distinct variable groups:   𝑀,𝑐   𝑁,𝑐   𝑂,𝑐   𝑖,𝑀   𝑖,𝑁   𝑖,𝑂   𝑘,𝑀   𝑘,𝑁   𝑘,𝑂   𝑖,𝑐,𝐹,𝑘   𝐶,𝑖,𝑘   𝑖,𝐸,𝑘   𝐶,𝑘   𝑘,𝐼,𝑐   𝐸,𝑐   𝑖,𝐼,𝑐   𝑆,𝑘,𝑖,𝑐   𝑅,𝑖,𝑘   𝑥,𝑘,𝐶   𝑥,𝐹   𝑥,𝑀   𝑥,𝑁

Allowed substitution hints:   𝐶(𝑐)   𝑃(𝑥,𝑖,𝑘,𝑐)   𝑅(𝑥,𝑐)   𝑆(𝑥)   𝐸(𝑥)   𝐼(𝑥)   𝑂(𝑥)

Proof of Theorem ballotlemirc

Dummy variables 𝑦 𝑣 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ballotth.m	. . . 4 ⊢ 𝑀 ∈ ℕ
2		ballotth.n	. . . 4 ⊢ 𝑁 ∈ ℕ
3		ballotth.o	. . . 4 ⊢ 𝑂 = {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (♯‘𝑐) = 𝑀}
4		ballotth.p	. . . 4 ⊢ 𝑃 = (𝑥 ∈ 𝒫 𝑂 ↦ ((♯‘𝑥) / (♯‘𝑂)))
5		ballotth.f	. . . 4 ⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
6		ballotth.e	. . . 4 ⊢ 𝐸 = {𝑐 ∈ 𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑐)‘𝑖)}
7		ballotth.mgtn	. . . 4 ⊢ 𝑁 < 𝑀
8		ballotth.i	. . . 4 ⊢ 𝐼 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑐)‘𝑘) = 0}, ℝ, < ))
9		ballotth.s	. . . 4 ⊢ 𝑆 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼‘𝑐), (((𝐼‘𝑐) + 1) − 𝑖), 𝑖)))
10		ballotth.r	. . . 4 ⊢ 𝑅 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ ((𝑆‘𝑐) “ 𝑐))
11	1, 2, 3, 4, 5, 6, 7, 8, 9, 10	ballotlemrc 34203	. . 3 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑅‘𝐶) ∈ (𝑂 ∖ 𝐸))
12	1, 2, 3, 4, 5, 6, 7, 8	ballotlemi 34173	. . 3 ⊢ ((𝑅‘𝐶) ∈ (𝑂 ∖ 𝐸) → (𝐼‘(𝑅‘𝐶)) = inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘(𝑅‘𝐶))‘𝑘) = 0}, ℝ, < ))
13	11, 12	syl 17	. 2 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘(𝑅‘𝐶)) = inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘(𝑅‘𝐶))‘𝑘) = 0}, ℝ, < ))
14		ltso 11319	. . . 4 ⊢ < Or ℝ
15	14	a1i 11	. . 3 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → < Or ℝ)
16	1, 2, 3, 4, 5, 6, 7, 8	ballotlemiex 34174	. . . . . 6 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐼‘𝐶) ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘𝐶)‘(𝐼‘𝐶)) = 0))
17	16	simpld 493	. . . . 5 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) ∈ (1...(𝑀 + 𝑁)))
18	17	elfzelzd 13529	. . . 4 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) ∈ ℤ)
19	18	zred 12691	. . 3 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) ∈ ℝ)
20		eqid 2725	. . . . 5 ⊢ (𝑢 ∈ Fin, 𝑣 ∈ Fin ↦ ((♯‘(𝑣 ∩ 𝑢)) − (♯‘(𝑣 ∖ 𝑢)))) = (𝑢 ∈ Fin, 𝑣 ∈ Fin ↦ ((♯‘(𝑣 ∩ 𝑢)) − (♯‘(𝑣 ∖ 𝑢))))
21	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 20	ballotlemfrci 34200	. . . 4 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐹‘(𝑅‘𝐶))‘(𝐼‘𝐶)) = 0)
22		fveqeq2 6899	. . . . 5 ⊢ (𝑘 = (𝐼‘𝐶) → (((𝐹‘(𝑅‘𝐶))‘𝑘) = 0 ↔ ((𝐹‘(𝑅‘𝐶))‘(𝐼‘𝐶)) = 0))
23	22	elrab 3676	. . . 4 ⊢ ((𝐼‘𝐶) ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘(𝑅‘𝐶))‘𝑘) = 0} ↔ ((𝐼‘𝐶) ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘(𝑅‘𝐶))‘(𝐼‘𝐶)) = 0))
24	17, 21, 23	sylanbrc 581	. . 3 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘(𝑅‘𝐶))‘𝑘) = 0})
25		elrabi 3670	. . . . 5 ⊢ (𝑦 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘(𝑅‘𝐶))‘𝑘) = 0} → 𝑦 ∈ (1...(𝑀 + 𝑁)))
26	25	anim2i 615	. . . 4 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑦 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘(𝑅‘𝐶))‘𝑘) = 0}) → (𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑦 ∈ (1...(𝑀 + 𝑁))))
27		simpr 483	. . . . . . . 8 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑦 ∈ (1...(𝑀 + 𝑁))) ∧ 𝑦 < (𝐼‘𝐶)) → 𝑦 < (𝐼‘𝐶))
28	1, 2, 3, 4, 5, 6, 7, 8, 9, 10	ballotlemfrcn0 34202	. . . . . . . . . . 11 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑦 ∈ (1...(𝑀 + 𝑁)) ∧ 𝑦 < (𝐼‘𝐶)) → ((𝐹‘(𝑅‘𝐶))‘𝑦) ≠ 0)
29	28	neneqd 2935	. . . . . . . . . 10 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑦 ∈ (1...(𝑀 + 𝑁)) ∧ 𝑦 < (𝐼‘𝐶)) → ¬ ((𝐹‘(𝑅‘𝐶))‘𝑦) = 0)
30		fveqeq2 6899	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝑦 → (((𝐹‘(𝑅‘𝐶))‘𝑘) = 0 ↔ ((𝐹‘(𝑅‘𝐶))‘𝑦) = 0))
31	30	elrab 3676	. . . . . . . . . . 11 ⊢ (𝑦 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘(𝑅‘𝐶))‘𝑘) = 0} ↔ (𝑦 ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘(𝑅‘𝐶))‘𝑦) = 0))
32	31	simprbi 495	. . . . . . . . . 10 ⊢ (𝑦 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘(𝑅‘𝐶))‘𝑘) = 0} → ((𝐹‘(𝑅‘𝐶))‘𝑦) = 0)
33	29, 32	nsyl 140	. . . . . . . . 9 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑦 ∈ (1...(𝑀 + 𝑁)) ∧ 𝑦 < (𝐼‘𝐶)) → ¬ 𝑦 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘(𝑅‘𝐶))‘𝑘) = 0})
34	33	3expa 1115	. . . . . . . 8 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑦 ∈ (1...(𝑀 + 𝑁))) ∧ 𝑦 < (𝐼‘𝐶)) → ¬ 𝑦 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘(𝑅‘𝐶))‘𝑘) = 0})
35	27, 34	syldan 589	. . . . . . 7 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑦 ∈ (1...(𝑀 + 𝑁))) ∧ 𝑦 < (𝐼‘𝐶)) → ¬ 𝑦 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘(𝑅‘𝐶))‘𝑘) = 0})
36	35	ex 411	. . . . . 6 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑦 ∈ (1...(𝑀 + 𝑁))) → (𝑦 < (𝐼‘𝐶) → ¬ 𝑦 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘(𝑅‘𝐶))‘𝑘) = 0}))
37	36	con2d 134	. . . . 5 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑦 ∈ (1...(𝑀 + 𝑁))) → (𝑦 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘(𝑅‘𝐶))‘𝑘) = 0} → ¬ 𝑦 < (𝐼‘𝐶)))
38	37	imp 405	. . . 4 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑦 ∈ (1...(𝑀 + 𝑁))) ∧ 𝑦 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘(𝑅‘𝐶))‘𝑘) = 0}) → ¬ 𝑦 < (𝐼‘𝐶))
39	26, 38	sylancom 586	. . 3 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑦 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘(𝑅‘𝐶))‘𝑘) = 0}) → ¬ 𝑦 < (𝐼‘𝐶))
40	15, 19, 24, 39	infmin 9512	. 2 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘(𝑅‘𝐶))‘𝑘) = 0}, ℝ, < ) = (𝐼‘𝐶))
41	13, 40	eqtrd 2765	1 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘(𝑅‘𝐶)) = (𝐼‘𝐶))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 394   ∧ w3a 1084   = wceq 1533   ∈ wcel 2098  ∀wral 3051  {crab 3419   ∖ cdif 3938   ∩ cin 3940  ifcif 4525  𝒫 cpw 4599   class class class wbr 5144   ↦ cmpt 5227   Or wor 5584   “ cima 5676  ‘cfv 6543  (class class class)co 7413   ∈ cmpo 7415  Fincfn 8957  infcinf 9459  ℝcr 11132  0cc0 11133  1c1 11134   + caddc 11136   < clt 11273   ≤ cle 11274   − cmin 11469   / cdiv 11896  ℕcn 12237  ℤcz 12583  ...cfz 13511  ♯chash 14316

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-rep 5281  ax-sep 5295  ax-nul 5302  ax-pow 5360  ax-pr 5424  ax-un 7735  ax-cnex 11189  ax-resscn 11190  ax-1cn 11191  ax-icn 11192  ax-addcl 11193  ax-addrcl 11194  ax-mulcl 11195  ax-mulrcl 11196  ax-mulcom 11197  ax-addass 11198  ax-mulass 11199  ax-distr 11200  ax-i2m1 11201  ax-1ne0 11202  ax-1rid 11203  ax-rnegex 11204  ax-rrecex 11205  ax-cnre 11206  ax-pre-lttri 11207  ax-pre-lttrn 11208  ax-pre-ltadd 11209  ax-pre-mulgt0 11210

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2931  df-nel 3037  df-ral 3052  df-rex 3061  df-rmo 3364  df-reu 3365  df-rab 3420  df-v 3465  df-sbc 3771  df-csb 3887  df-dif 3944  df-un 3946  df-in 3948  df-ss 3958  df-pss 3961  df-nul 4320  df-if 4526  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4905  df-int 4946  df-iun 4994  df-br 5145  df-opab 5207  df-mpt 5228  df-tr 5262  df-id 5571  df-eprel 5577  df-po 5585  df-so 5586  df-fr 5628  df-we 5630  df-xp 5679  df-rel 5680  df-cnv 5681  df-co 5682  df-dm 5683  df-rn 5684  df-res 5685  df-ima 5686  df-pred 6301  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7369  df-ov 7416  df-oprab 7417  df-mpo 7418  df-om 7866  df-1st 7987  df-2nd 7988  df-frecs 8280  df-wrecs 8311  df-recs 8385  df-rdg 8424  df-1o 8480  df-oadd 8484  df-er 8718  df-en 8958  df-dom 8959  df-sdom 8960  df-fin 8961  df-sup 9460  df-inf 9461  df-dju 9919  df-card 9957  df-pnf 11275  df-mnf 11276  df-xr 11277  df-ltxr 11278  df-le 11279  df-sub 11471  df-neg 11472  df-nn 12238  df-2 12300  df-n0 12498  df-z 12584  df-uz 12848  df-rp 13002  df-fz 13512  df-hash 14317

This theorem is referenced by:  ballotlemrinv0  34205