Theorem ballotlemimin 34487

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 13565	. . . . . 6 ⊢ (𝑘 ∈ (1...((𝐼‘𝐶) − 1)) → 𝑘 ≤ ((𝐼‘𝐶) − 1))
2	1	adantl 481	. . . . 5 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑘 ∈ (1...((𝐼‘𝐶) − 1))) → 𝑘 ≤ ((𝐼‘𝐶) − 1))
3		elfzelz 13561	. . . . . 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 34483	. . . . . . . 8 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐼‘𝐶) ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘𝐶)‘(𝐼‘𝐶)) = 0))
13	12	simpld 494	. . . . . . 7 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) ∈ (1...(𝑀 + 𝑁)))
14	13	elfzelzd 13562	. . . . . 6 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) ∈ ℤ)
15		zltlem1 12668	. . . . . 6 ⊢ ((𝑘 ∈ ℤ ∧ (𝐼‘𝐶) ∈ ℤ) → (𝑘 < (𝐼‘𝐶) ↔ 𝑘 ≤ ((𝐼‘𝐶) − 1)))
16	3, 14, 15	syl2anr 597	. . . . 5 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑘 ∈ (1...((𝐼‘𝐶) − 1))) → (𝑘 < (𝐼‘𝐶) ↔ 𝑘 ≤ ((𝐼‘𝐶) − 1)))
17	2, 16	mpbird 257	. . . 4 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑘 ∈ (1...((𝐼‘𝐶) − 1))) → 𝑘 < (𝐼‘𝐶))
18	17	adantr 480	. . 3 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑘 ∈ (1...((𝐼‘𝐶) − 1))) ∧ ((𝐹‘𝐶)‘𝑘) = 0) → 𝑘 < (𝐼‘𝐶))
19		1zzd 12646	. . . . . . . . . . . . 13 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → 1 ∈ ℤ)
20	14, 19	zsubcld 12725	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐼‘𝐶) − 1) ∈ ℤ)
21	20	zred 12720	. . . . . . . . . . 11 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐼‘𝐶) − 1) ∈ ℝ)
22		nnaddcl 12287	. . . . . . . . . . . . . 14 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑀 + 𝑁) ∈ ℕ)
23	4, 5, 22	mp2an 692	. . . . . . . . . . . . 13 ⊢ (𝑀 + 𝑁) ∈ ℕ
24	23	a1i 11	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑀 + 𝑁) ∈ ℕ)
25	24	nnred 12279	. . . . . . . . . . 11 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑀 + 𝑁) ∈ ℝ)
26		elfzle2 13565	. . . . . . . . . . . . 13 ⊢ ((𝐼‘𝐶) ∈ (1...(𝑀 + 𝑁)) → (𝐼‘𝐶) ≤ (𝑀 + 𝑁))
27	13, 26	syl 17	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) ≤ (𝑀 + 𝑁))
28	24	nnzd 12638	. . . . . . . . . . . . 13 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑀 + 𝑁) ∈ ℤ)
29		zlem1lt 12667	. . . . . . . . . . . . 13 ⊢ (((𝐼‘𝐶) ∈ ℤ ∧ (𝑀 + 𝑁) ∈ ℤ) → ((𝐼‘𝐶) ≤ (𝑀 + 𝑁) ↔ ((𝐼‘𝐶) − 1) < (𝑀 + 𝑁)))
30	14, 28, 29	syl2anc 584	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐼‘𝐶) ≤ (𝑀 + 𝑁) ↔ ((𝐼‘𝐶) − 1) < (𝑀 + 𝑁)))
31	27, 30	mpbid 232	. . . . . . . . . . 11 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐼‘𝐶) − 1) < (𝑀 + 𝑁))
32	21, 25, 31	ltled 11407	. . . . . . . . . 10 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐼‘𝐶) − 1) ≤ (𝑀 + 𝑁))
33		eluz 12890	. . . . . . . . . . 11 ⊢ ((((𝐼‘𝐶) − 1) ∈ ℤ ∧ (𝑀 + 𝑁) ∈ ℤ) → ((𝑀 + 𝑁) ∈ (ℤ≥‘((𝐼‘𝐶) − 1)) ↔ ((𝐼‘𝐶) − 1) ≤ (𝑀 + 𝑁)))
34	20, 28, 33	syl2anc 584	. . . . . . . . . 10 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝑀 + 𝑁) ∈ (ℤ≥‘((𝐼‘𝐶) − 1)) ↔ ((𝐼‘𝐶) − 1) ≤ (𝑀 + 𝑁)))
35	32, 34	mpbird 257	. . . . . . . . 9 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑀 + 𝑁) ∈ (ℤ≥‘((𝐼‘𝐶) − 1)))
36		fzss2 13601	. . . . . . . . 9 ⊢ ((𝑀 + 𝑁) ∈ (ℤ≥‘((𝐼‘𝐶) − 1)) → (1...((𝐼‘𝐶) − 1)) ⊆ (1...(𝑀 + 𝑁)))
37	35, 36	syl 17	. . . . . . . 8 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (1...((𝐼‘𝐶) − 1)) ⊆ (1...(𝑀 + 𝑁)))
38	37	sseld 3994	. . . . . . 7 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑘 ∈ (1...((𝐼‘𝐶) − 1)) → 𝑘 ∈ (1...(𝑀 + 𝑁))))
39		rabid 3455	. . . . . . . 8 ⊢ (𝑘 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ↔ (𝑘 ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘𝐶)‘𝑘) = 0))
40	4, 5, 6, 7, 8, 9, 10, 11	ballotlemsup 34486	. . . . . . . . . 10 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ∃𝑧 ∈ ℝ (∀𝑤 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ¬ 𝑤 < 𝑧 ∧ ∀𝑤 ∈ ℝ (𝑧 < 𝑤 → ∃𝑦 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}𝑦 < 𝑤)))
41		ltso 11339	. . . . . . . . . . . 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 9527	. . . . . . . . . 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 34482	. . . . . . . . . . 11 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) = inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}, ℝ, < ))
47	46	breq2d 5160	. . . . . . . . . 10 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑘 < (𝐼‘𝐶) ↔ 𝑘 < inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}, ℝ, < )))
48	47	notbid 318	. . . . . . . . 9 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (¬ 𝑘 < (𝐼‘𝐶) ↔ ¬ 𝑘 < inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}, ℝ, < )))
49	45, 48	sylibrd 259	. . . . . . . 8 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑘 ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} → ¬ 𝑘 < (𝐼‘𝐶)))
50	39, 49	biimtrrid 243	. . . . . . 7 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝑘 ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘𝐶)‘𝑘) = 0) → ¬ 𝑘 < (𝐼‘𝐶)))
51	38, 50	syland 603	. . . . . 6 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝑘 ∈ (1...((𝐼‘𝐶) − 1)) ∧ ((𝐹‘𝐶)‘𝑘) = 0) → ¬ 𝑘 < (𝐼‘𝐶)))
52	51	imp 406	. . . . 5 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ (𝑘 ∈ (1...((𝐼‘𝐶) − 1)) ∧ ((𝐹‘𝐶)‘𝑘) = 0)) → ¬ 𝑘 < (𝐼‘𝐶))
53		biid 261	. . . . 5 ⊢ (𝑘 < (𝐼‘𝐶) ↔ 𝑘 < (𝐼‘𝐶))
54	52, 53	sylnib 328	. . . 4 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ (𝑘 ∈ (1...((𝐼‘𝐶) − 1)) ∧ ((𝐹‘𝐶)‘𝑘) = 0)) → ¬ 𝑘 < (𝐼‘𝐶))
55	54	anassrs 467	. . 3 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑘 ∈ (1...((𝐼‘𝐶) − 1))) ∧ ((𝐹‘𝐶)‘𝑘) = 0) → ¬ 𝑘 < (𝐼‘𝐶))
56	18, 55	pm2.65da 817	. 2 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑘 ∈ (1...((𝐼‘𝐶) − 1))) → ¬ ((𝐹‘𝐶)‘𝑘) = 0)
57	56	nrexdv 3147	1 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ¬ ∃𝑘 ∈ (1...((𝐼‘𝐶) − 1))((𝐹‘𝐶)‘𝑘) = 0)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2106  ∀wral 3059  ∃wrex 3068  {crab 3433   ∖ cdif 3960   ∩ cin 3962   ⊆ wss 3963  𝒫 cpw 4605   class class class wbr 5148   ↦ cmpt 5231   Or wor 5596  ‘cfv 6563  (class class class)co 7431  infcinf 9479  ℝcr 11152  0cc0 11153  1c1 11154   + caddc 11156   < clt 11293   ≤ cle 11294   − cmin 11490   / cdiv 11918  ℕcn 12264  ℤcz 12611  ℤ_≥cuz 12876  ...cfz 13544  ♯chash 14366

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754  ax-cnex 11209  ax-resscn 11210  ax-1cn 11211  ax-icn 11212  ax-addcl 11213  ax-addrcl 11214  ax-mulcl 11215  ax-mulrcl 11216  ax-mulcom 11217  ax-addass 11218  ax-mulass 11219  ax-distr 11220  ax-i2m1 11221  ax-1ne0 11222  ax-1rid 11223  ax-rnegex 11224  ax-rrecex 11225  ax-cnre 11226  ax-pre-lttri 11227  ax-pre-lttrn 11228  ax-pre-ltadd 11229  ax-pre-mulgt0 11230

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-int 4952  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8013  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-1o 8505  df-oadd 8509  df-er 8744  df-en 8985  df-dom 8986  df-sdom 8987  df-fin 8988  df-sup 9480  df-inf 9481  df-dju 9939  df-card 9977  df-pnf 11295  df-mnf 11296  df-xr 11297  df-ltxr 11298  df-le 11299  df-sub 11492  df-neg 11493  df-nn 12265  df-2 12327  df-n0 12525  df-z 12612  df-uz 12877  df-fz 13545  df-hash 14367

This theorem is referenced by:  ballotlemic  34488  ballotlem1c  34489