Theorem ballotlemimin 32372

Description: (𝐼‘𝐶) is the first tie. (Contributed by Thierry Arnoux, 1-Dec-2016.) (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}, ℝ, < ))

Assertion

Ref	Expression
ballotlemimin	⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ¬ ∃𝑘 ∈ (1...((𝐼‘𝐶) − 1))((𝐹‘𝐶)‘𝑘) = 0)

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

Allowed substitution hints:   𝐶(𝑥,𝑐)   𝑃(𝑥,𝑖,𝑘,𝑐)   𝐸(𝑥)   𝐹(𝑥)   𝐼(𝑥,𝑐)   𝑀(𝑥)   𝑁(𝑥)   𝑂(𝑥)

Proof of Theorem ballotlemimin

Dummy variables 𝑦 𝑧 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elfzle2 13189	. . . . . 6 ⊢ (𝑘 ∈ (1...((𝐼‘𝐶) − 1)) → 𝑘 ≤ ((𝐼‘𝐶) − 1))
2	1	adantl 481	. . . . 5 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑘 ∈ (1...((𝐼‘𝐶) − 1))) → 𝑘 ≤ ((𝐼‘𝐶) − 1))
3		elfzelz 13185	. . . . . 6 ⊢ (𝑘 ∈ (1...((𝐼‘𝐶) − 1)) → 𝑘 ∈ ℤ)
4		ballotth.m	. . . . . . . . 9 ⊢ 𝑀 ∈ ℕ
5		ballotth.n	. . . . . . . . 9 ⊢ 𝑁 ∈ ℕ
6		ballotth.o	. . . . . . . . 9 ⊢ 𝑂 = {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (♯‘𝑐) = 𝑀}
7		ballotth.p	. . . . . . . . 9 ⊢ 𝑃 = (𝑥 ∈ 𝒫 𝑂 ↦ ((♯‘𝑥) / (♯‘𝑂)))
8		ballotth.f	. . . . . . . . 9 ⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
9		ballotth.e	. . . . . . . . 9 ⊢ 𝐸 = {𝑐 ∈ 𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑐)‘𝑖)}
10		ballotth.mgtn	. . . . . . . . 9 ⊢ 𝑁 < 𝑀
11		ballotth.i	. . . . . . . . 9 ⊢ 𝐼 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑐)‘𝑘) = 0}, ℝ, < ))
12	4, 5, 6, 7, 8, 9, 10, 11	ballotlemiex 32368	. . . . . . . 8 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐼‘𝐶) ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘𝐶)‘(𝐼‘𝐶)) = 0))
13	12	simpld 494	. . . . . . 7 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) ∈ (1...(𝑀 + 𝑁)))
14	13	elfzelzd 13186	. . . . . 6 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) ∈ ℤ)
15		zltlem1 12303	. . . . . 6 ⊢ ((𝑘 ∈ ℤ ∧ (𝐼‘𝐶) ∈ ℤ) → (𝑘 < (𝐼‘𝐶) ↔ 𝑘 ≤ ((𝐼‘𝐶) − 1)))
16	3, 14, 15	syl2anr 596	. . . . 5 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑘 ∈ (1...((𝐼‘𝐶) − 1))) → (𝑘 < (𝐼‘𝐶) ↔ 𝑘 ≤ ((𝐼‘𝐶) − 1)))
17	2, 16	mpbird 256	. . . 4 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑘 ∈ (1...((𝐼‘𝐶) − 1))) → 𝑘 < (𝐼‘𝐶))
18	17	adantr 480	. . 3 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑘 ∈ (1...((𝐼‘𝐶) − 1))) ∧ ((𝐹‘𝐶)‘𝑘) = 0) → 𝑘 < (𝐼‘𝐶))
19		1zzd 12281	. . . . . . . . . . . . 13 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → 1 ∈ ℤ)
20	14, 19	zsubcld 12360	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐼‘𝐶) − 1) ∈ ℤ)
21	20	zred 12355	. . . . . . . . . . 11 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐼‘𝐶) − 1) ∈ ℝ)
22		nnaddcl 11926	. . . . . . . . . . . . . 14 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑀 + 𝑁) ∈ ℕ)
23	4, 5, 22	mp2an 688	. . . . . . . . . . . . 13 ⊢ (𝑀 + 𝑁) ∈ ℕ
24	23	a1i 11	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑀 + 𝑁) ∈ ℕ)
25	24	nnred 11918	. . . . . . . . . . 11 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑀 + 𝑁) ∈ ℝ)
26		elfzle2 13189	. . . . . . . . . . . . 13 ⊢ ((𝐼‘𝐶) ∈ (1...(𝑀 + 𝑁)) → (𝐼‘𝐶) ≤ (𝑀 + 𝑁))
27	13, 26	syl 17	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) ≤ (𝑀 + 𝑁))
28	24	nnzd 12354	. . . . . . . . . . . . 13 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑀 + 𝑁) ∈ ℤ)
29		zlem1lt 12302	. . . . . . . . . . . . 13 ⊢ (((𝐼‘𝐶) ∈ ℤ ∧ (𝑀 + 𝑁) ∈ ℤ) → ((𝐼‘𝐶) ≤ (𝑀 + 𝑁) ↔ ((𝐼‘𝐶) − 1) < (𝑀 + 𝑁)))
30	14, 28, 29	syl2anc 583	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐼‘𝐶) ≤ (𝑀 + 𝑁) ↔ ((𝐼‘𝐶) − 1) < (𝑀 + 𝑁)))
31	27, 30	mpbid 231	. . . . . . . . . . 11 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐼‘𝐶) − 1) < (𝑀 + 𝑁))
32	21, 25, 31	ltled 11053	. . . . . . . . . 10 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐼‘𝐶) − 1) ≤ (𝑀 + 𝑁))
33		eluz 12525	. . . . . . . . . . 11 ⊢ ((((𝐼‘𝐶) − 1) ∈ ℤ ∧ (𝑀 + 𝑁) ∈ ℤ) → ((𝑀 + 𝑁) ∈ (ℤ≥‘((𝐼‘𝐶) − 1)) ↔ ((𝐼‘𝐶) − 1) ≤ (𝑀 + 𝑁)))
34	20, 28, 33	syl2anc 583	. . . . . . . . . 10 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝑀 + 𝑁) ∈ (ℤ≥‘((𝐼‘𝐶) − 1)) ↔ ((𝐼‘𝐶) − 1) ≤ (𝑀 + 𝑁)))
35	32, 34	mpbird 256	. . . . . . . . 9 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑀 + 𝑁) ∈ (ℤ≥‘((𝐼‘𝐶) − 1)))
36		fzss2 13225	. . . . . . . . 9 ⊢ ((𝑀 + 𝑁) ∈ (ℤ≥‘((𝐼‘𝐶) − 1)) → (1...((𝐼‘𝐶) − 1)) ⊆ (1...(𝑀 + 𝑁)))
37	35, 36	syl 17	. . . . . . . 8 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (1...((𝐼‘𝐶) − 1)) ⊆ (1...(𝑀 + 𝑁)))
38	37	sseld 3916	. . . . . . 7 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑘 ∈ (1...((𝐼‘𝐶) − 1)) → 𝑘 ∈ (1...(𝑀 + 𝑁))))
39		rabid 3304	. . . . . . . 8 ⊢ (𝑘 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ↔ (𝑘 ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘𝐶)‘𝑘) = 0))
40	4, 5, 6, 7, 8, 9, 10, 11	ballotlemsup 32371	. . . . . . . . . 10 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ∃𝑧 ∈ ℝ (∀𝑤 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ¬ 𝑤 < 𝑧 ∧ ∀𝑤 ∈ ℝ (𝑧 < 𝑤 → ∃𝑦 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}𝑦 < 𝑤)))
41		ltso 10986	. . . . . . . . . . . 12 ⊢ < Or ℝ
42	41	a1i 11	. . . . . . . . . . 11 ⊢ (∃𝑧 ∈ ℝ (∀𝑤 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ¬ 𝑤 < 𝑧 ∧ ∀𝑤 ∈ ℝ (𝑧 < 𝑤 → ∃𝑦 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}𝑦 < 𝑤)) → < Or ℝ)
43		id 22	. . . . . . . . . . 11 ⊢ (∃𝑧 ∈ ℝ (∀𝑤 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ¬ 𝑤 < 𝑧 ∧ ∀𝑤 ∈ ℝ (𝑧 < 𝑤 → ∃𝑦 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}𝑦 < 𝑤)) → ∃𝑧 ∈ ℝ (∀𝑤 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ¬ 𝑤 < 𝑧 ∧ ∀𝑤 ∈ ℝ (𝑧 < 𝑤 → ∃𝑦 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}𝑦 < 𝑤)))
44	42, 43	inflb 9178	. . . . . . . . . 10 ⊢ (∃𝑧 ∈ ℝ (∀𝑤 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ¬ 𝑤 < 𝑧 ∧ ∀𝑤 ∈ ℝ (𝑧 < 𝑤 → ∃𝑦 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}𝑦 < 𝑤)) → (𝑘 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} → ¬ 𝑘 < inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}, ℝ, < )))
45	40, 44	syl 17	. . . . . . . . 9 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑘 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} → ¬ 𝑘 < inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}, ℝ, < )))
46	4, 5, 6, 7, 8, 9, 10, 11	ballotlemi 32367	. . . . . . . . . . 11 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) = inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}, ℝ, < ))
47	46	breq2d 5082	. . . . . . . . . 10 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑘 < (𝐼‘𝐶) ↔ 𝑘 < inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}, ℝ, < )))
48	47	notbid 317	. . . . . . . . 9 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (¬ 𝑘 < (𝐼‘𝐶) ↔ ¬ 𝑘 < inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}, ℝ, < )))
49	45, 48	sylibrd 258	. . . . . . . 8 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑘 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} → ¬ 𝑘 < (𝐼‘𝐶)))
50	39, 49	syl5bir 242	. . . . . . 7 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝑘 ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘𝐶)‘𝑘) = 0) → ¬ 𝑘 < (𝐼‘𝐶)))
51	38, 50	syland 602	. . . . . 6 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝑘 ∈ (1...((𝐼‘𝐶) − 1)) ∧ ((𝐹‘𝐶)‘𝑘) = 0) → ¬ 𝑘 < (𝐼‘𝐶)))
52	51	imp 406	. . . . 5 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ (𝑘 ∈ (1...((𝐼‘𝐶) − 1)) ∧ ((𝐹‘𝐶)‘𝑘) = 0)) → ¬ 𝑘 < (𝐼‘𝐶))
53		biid 260	. . . . 5 ⊢ (𝑘 < (𝐼‘𝐶) ↔ 𝑘 < (𝐼‘𝐶))
54	52, 53	sylnib 327	. . . 4 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ (𝑘 ∈ (1...((𝐼‘𝐶) − 1)) ∧ ((𝐹‘𝐶)‘𝑘) = 0)) → ¬ 𝑘 < (𝐼‘𝐶))
55	54	anassrs 467	. . 3 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑘 ∈ (1...((𝐼‘𝐶) − 1))) ∧ ((𝐹‘𝐶)‘𝑘) = 0) → ¬ 𝑘 < (𝐼‘𝐶))
56	18, 55	pm2.65da 813	. 2 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑘 ∈ (1...((𝐼‘𝐶) − 1))) → ¬ ((𝐹‘𝐶)‘𝑘) = 0)
57	56	nrexdv 3197	1 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ¬ ∃𝑘 ∈ (1...((𝐼‘𝐶) − 1))((𝐹‘𝐶)‘𝑘) = 0)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1539   ∈ wcel 2108  ∀wral 3063  ∃wrex 3064  {crab 3067   ∖ cdif 3880   ∩ cin 3882   ⊆ wss 3883  𝒫 cpw 4530   class class class wbr 5070   ↦ cmpt 5153   Or wor 5493  ‘cfv 6418  (class class class)co 7255  infcinf 9130  ℝcr 10801  0cc0 10802  1c1 10803   + caddc 10805   < clt 10940   ≤ cle 10941   − cmin 11135   / cdiv 11562  ℕcn 11903  ℤcz 12249  ℤ_≥cuz 12511  ...cfz 13168  ♯chash 13972

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-cnex 10858  ax-resscn 10859  ax-1cn 10860  ax-icn 10861  ax-addcl 10862  ax-addrcl 10863  ax-mulcl 10864  ax-mulrcl 10865  ax-mulcom 10866  ax-addass 10867  ax-mulass 10868  ax-distr 10869  ax-i2m1 10870  ax-1ne0 10871  ax-1rid 10872  ax-rnegex 10873  ax-rrecex 10874  ax-cnre 10875  ax-pre-lttri 10876  ax-pre-lttrn 10877  ax-pre-ltadd 10878  ax-pre-mulgt0 10879

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-nel 3049  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-1st 7804  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-1o 8267  df-oadd 8271  df-er 8456  df-en 8692  df-dom 8693  df-sdom 8694  df-fin 8695  df-sup 9131  df-inf 9132  df-dju 9590  df-card 9628  df-pnf 10942  df-mnf 10943  df-xr 10944  df-ltxr 10945  df-le 10946  df-sub 11137  df-neg 11138  df-nn 11904  df-2 11966  df-n0 12164  df-z 12250  df-uz 12512  df-fz 13169  df-hash 13973

This theorem is referenced by:  ballotlemic  32373  ballotlem1c  32374