Theorem ballotlemodife 35213

Description: Elements of (𝑂 ∖ 𝐸). (Contributed by Thierry Arnoux, 7-Dec-2016.)

Hypotheses

Ref	Expression
ballotth.m	⊢ 𝑀 ∈ ℕ
ballotth.n	⊢ 𝑁 ∈ ℕ
ballotth.o	⊢ 𝑂 = {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (♯‘𝑐) = 𝑀}
ballotth.p	⊢ 𝑃 = (𝑥 ∈ 𝒫 𝑂 ↦ ((♯‘𝑥) / (♯‘𝑂)))
ballotth.f	⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
ballotth.e	⊢ 𝐸 = {𝑐 ∈ 𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑐)‘𝑖)}

Assertion

Ref	Expression
ballotlemodife	⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) ↔ (𝐶 ∈ 𝑂 ∧ ∃𝑖 ∈ (1...(𝑀 + 𝑁))((𝐹‘𝐶)‘𝑖) ≤ 0))

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

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

Proof of Theorem ballotlemodife

Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eldif 4052	. 2 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) ↔ (𝐶 ∈ 𝑂 ∧ ¬ 𝐶 ∈ 𝐸))
2		df-or 862	. . . 4 ⊢ (((𝐶 ∈ 𝑂 ∧ ¬ 𝐶 ∈ 𝑂) ∨ (𝐶 ∈ 𝑂 ∧ ¬ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖))) ↔ (¬ (𝐶 ∈ 𝑂 ∧ ¬ 𝐶 ∈ 𝑂) → (𝐶 ∈ 𝑂 ∧ ¬ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖))))
3		pm3.24 408	. . . . 5 ⊢ ¬ (𝐶 ∈ 𝑂 ∧ ¬ 𝐶 ∈ 𝑂)
4	3	a1bi 365	. . . 4 ⊢ ((𝐶 ∈ 𝑂 ∧ ¬ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖)) ↔ (¬ (𝐶 ∈ 𝑂 ∧ ¬ 𝐶 ∈ 𝑂) → (𝐶 ∈ 𝑂 ∧ ¬ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖))))
5	2, 4	bitr4i 281	. . 3 ⊢ (((𝐶 ∈ 𝑂 ∧ ¬ 𝐶 ∈ 𝑂) ∨ (𝐶 ∈ 𝑂 ∧ ¬ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖))) ↔ (𝐶 ∈ 𝑂 ∧ ¬ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖)))
6		ballotth.m	. . . . . . 7 ⊢ 𝑀 ∈ ℕ
7		ballotth.n	. . . . . . 7 ⊢ 𝑁 ∈ ℕ
8		ballotth.o	. . . . . . 7 ⊢ 𝑂 = {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (♯‘𝑐) = 𝑀}
9		ballotth.p	. . . . . . 7 ⊢ 𝑃 = (𝑥 ∈ 𝒫 𝑂 ↦ ((♯‘𝑥) / (♯‘𝑂)))
10		ballotth.f	. . . . . . 7 ⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
11		ballotth.e	. . . . . . 7 ⊢ 𝐸 = {𝑐 ∈ 𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑐)‘𝑖)}
12	6, 7, 8, 9, 10, 11	ballotleme 35212	. . . . . 6 ⊢ (𝐶 ∈ 𝐸 ↔ (𝐶 ∈ 𝑂 ∧ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖)))
13	12	notbii 323	. . . . 5 ⊢ (¬ 𝐶 ∈ 𝐸 ↔ ¬ (𝐶 ∈ 𝑂 ∧ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖)))
14	13	anbi2i 635	. . . 4 ⊢ ((𝐶 ∈ 𝑂 ∧ ¬ 𝐶 ∈ 𝐸) ↔ (𝐶 ∈ 𝑂 ∧ ¬ (𝐶 ∈ 𝑂 ∧ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖))))
15		ianor 997	. . . . 5 ⊢ (¬ (𝐶 ∈ 𝑂 ∧ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖)) ↔ (¬ 𝐶 ∈ 𝑂 ∨ ¬ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖)))
16	15	anbi2i 635	. . . 4 ⊢ ((𝐶 ∈ 𝑂 ∧ ¬ (𝐶 ∈ 𝑂 ∧ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖))) ↔ (𝐶 ∈ 𝑂 ∧ (¬ 𝐶 ∈ 𝑂 ∨ ¬ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖))))
17		andi 1025	. . . 4 ⊢ ((𝐶 ∈ 𝑂 ∧ (¬ 𝐶 ∈ 𝑂 ∨ ¬ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖))) ↔ ((𝐶 ∈ 𝑂 ∧ ¬ 𝐶 ∈ 𝑂) ∨ (𝐶 ∈ 𝑂 ∧ ¬ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖))))
18	14, 16, 17	3bitri 300	. . 3 ⊢ ((𝐶 ∈ 𝑂 ∧ ¬ 𝐶 ∈ 𝐸) ↔ ((𝐶 ∈ 𝑂 ∧ ¬ 𝐶 ∈ 𝑂) ∨ (𝐶 ∈ 𝑂 ∧ ¬ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖))))
19		fz1ssfz0 13787	. . . . . . . . . . 11 ⊢ (1...(𝑀 + 𝑁)) ⊆ (0...(𝑀 + 𝑁))
20	19	a1i 11	. . . . . . . . . 10 ⊢ (𝐶 ∈ 𝑂 → (1...(𝑀 + 𝑁)) ⊆ (0...(𝑀 + 𝑁)))
21	20	sseld 3912	. . . . . . . . 9 ⊢ (𝐶 ∈ 𝑂 → (𝑖 ∈ (1...(𝑀 + 𝑁)) → 𝑖 ∈ (0...(𝑀 + 𝑁))))
22	21	imdistani 579	. . . . . . . 8 ⊢ ((𝐶 ∈ 𝑂 ∧ 𝑖 ∈ (1...(𝑀 + 𝑁))) → (𝐶 ∈ 𝑂 ∧ 𝑖 ∈ (0...(𝑀 + 𝑁))))
23		simpl 488	. . . . . . . . . . . 12 ⊢ ((𝐶 ∈ 𝑂 ∧ 𝑗 ∈ (0...(𝑀 + 𝑁))) → 𝐶 ∈ 𝑂)
24		elfzelz 13686	. . . . . . . . . . . . 13 ⊢ (𝑗 ∈ (0...(𝑀 + 𝑁)) → 𝑗 ∈ ℤ)
25	24	adantl 487	. . . . . . . . . . . 12 ⊢ ((𝐶 ∈ 𝑂 ∧ 𝑗 ∈ (0...(𝑀 + 𝑁))) → 𝑗 ∈ ℤ)
26	6, 7, 8, 9, 10, 23, 25	ballotlemfelz 35206	. . . . . . . . . . 11 ⊢ ((𝐶 ∈ 𝑂 ∧ 𝑗 ∈ (0...(𝑀 + 𝑁))) → ((𝐹‘𝐶)‘𝑗) ∈ ℤ)
27	26	zred 12833	. . . . . . . . . 10 ⊢ ((𝐶 ∈ 𝑂 ∧ 𝑗 ∈ (0...(𝑀 + 𝑁))) → ((𝐹‘𝐶)‘𝑗) ∈ ℝ)
28	27	sbimi 2113	. . . . . . . . 9 ⊢ ([𝑖 / 𝑗](𝐶 ∈ 𝑂 ∧ 𝑗 ∈ (0...(𝑀 + 𝑁))) → [𝑖 / 𝑗]((𝐹‘𝐶)‘𝑗) ∈ ℝ)
29		sban 2119	. . . . . . . . . 10 ⊢ ([𝑖 / 𝑗](𝐶 ∈ 𝑂 ∧ 𝑗 ∈ (0...(𝑀 + 𝑁))) ↔ ([𝑖 / 𝑗]𝐶 ∈ 𝑂 ∧ [𝑖 / 𝑗]𝑗 ∈ (0...(𝑀 + 𝑁))))
30		sbv 2127	. . . . . . . . . . 11 ⊢ ([𝑖 / 𝑗]𝐶 ∈ 𝑂 ↔ 𝐶 ∈ 𝑂)
31		clelsb1 2891	. . . . . . . . . . 11 ⊢ ([𝑖 / 𝑗]𝑗 ∈ (0...(𝑀 + 𝑁)) ↔ 𝑖 ∈ (0...(𝑀 + 𝑁)))
32	30, 31	anbi12i 640	. . . . . . . . . 10 ⊢ (([𝑖 / 𝑗]𝐶 ∈ 𝑂 ∧ [𝑖 / 𝑗]𝑗 ∈ (0...(𝑀 + 𝑁))) ↔ (𝐶 ∈ 𝑂 ∧ 𝑖 ∈ (0...(𝑀 + 𝑁))))
33	29, 32	bitri 278	. . . . . . . . 9 ⊢ ([𝑖 / 𝑗](𝐶 ∈ 𝑂 ∧ 𝑗 ∈ (0...(𝑀 + 𝑁))) ↔ (𝐶 ∈ 𝑂 ∧ 𝑖 ∈ (0...(𝑀 + 𝑁))))
34		nfv 1949	. . . . . . . . . 10 ⊢ Ⅎ𝑗((𝐹‘𝐶)‘𝑖) ∈ ℝ
35		fveq2 6911	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑖 → ((𝐹‘𝐶)‘𝑗) = ((𝐹‘𝐶)‘𝑖))
36	35	eleq1d 2849	. . . . . . . . . 10 ⊢ (𝑗 = 𝑖 → (((𝐹‘𝐶)‘𝑗) ∈ ℝ ↔ ((𝐹‘𝐶)‘𝑖) ∈ ℝ))
37	34, 36	sbiev 2349	. . . . . . . . 9 ⊢ ([𝑖 / 𝑗]((𝐹‘𝐶)‘𝑗) ∈ ℝ ↔ ((𝐹‘𝐶)‘𝑖) ∈ ℝ)
38	28, 33, 37	3imtr3i 294	. . . . . . . 8 ⊢ ((𝐶 ∈ 𝑂 ∧ 𝑖 ∈ (0...(𝑀 + 𝑁))) → ((𝐹‘𝐶)‘𝑖) ∈ ℝ)
39	22, 38	syl 18	. . . . . . 7 ⊢ ((𝐶 ∈ 𝑂 ∧ 𝑖 ∈ (1...(𝑀 + 𝑁))) → ((𝐹‘𝐶)‘𝑖) ∈ ℝ)
40		0red 11341	. . . . . . 7 ⊢ ((𝐶 ∈ 𝑂 ∧ 𝑖 ∈ (1...(𝑀 + 𝑁))) → 0 ∈ ℝ)
41	39, 40	lenltd 11486	. . . . . 6 ⊢ ((𝐶 ∈ 𝑂 ∧ 𝑖 ∈ (1...(𝑀 + 𝑁))) → (((𝐹‘𝐶)‘𝑖) ≤ 0 ↔ ¬ 0 < ((𝐹‘𝐶)‘𝑖)))
42	41	rexbidva 3188	. . . . 5 ⊢ (𝐶 ∈ 𝑂 → (∃𝑖 ∈ (1...(𝑀 + 𝑁))((𝐹‘𝐶)‘𝑖) ≤ 0 ↔ ∃𝑖 ∈ (1...(𝑀 + 𝑁)) ¬ 0 < ((𝐹‘𝐶)‘𝑖)))
43		rexnal 3118	. . . . 5 ⊢ (∃𝑖 ∈ (1...(𝑀 + 𝑁)) ¬ 0 < ((𝐹‘𝐶)‘𝑖) ↔ ¬ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖))
44	42, 43	bitrdi 290	. . . 4 ⊢ (𝐶 ∈ 𝑂 → (∃𝑖 ∈ (1...(𝑀 + 𝑁))((𝐹‘𝐶)‘𝑖) ≤ 0 ↔ ¬ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖)))
45	44	pm5.32i 585	. . 3 ⊢ ((𝐶 ∈ 𝑂 ∧ ∃𝑖 ∈ (1...(𝑀 + 𝑁))((𝐹‘𝐶)‘𝑖) ≤ 0) ↔ (𝐶 ∈ 𝑂 ∧ ¬ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖)))
46	5, 18, 45	3bitr4i 306	. 2 ⊢ ((𝐶 ∈ 𝑂 ∧ ¬ 𝐶 ∈ 𝐸) ↔ (𝐶 ∈ 𝑂 ∧ ∃𝑖 ∈ (1...(𝑀 + 𝑁))((𝐹‘𝐶)‘𝑖) ≤ 0))
47	1, 46	bitri 278	1 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) ↔ (𝐶 ∈ 𝑂 ∧ ∃𝑖 ∈ (1...(𝑀 + 𝑁))((𝐹‘𝐶)‘𝑖) ≤ 0))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570  [wsb 2101   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  {crab 3416   ⊆ wss 3900   ∖ cdif 4048   ∩ cin 4092  𝒫 cpw 4560   class class class wbr 5106   ↦ cmpt 5190  ‘cfv 6561  (class class class)co 7446  ℝcr 11229  0cc0 11230  1c1 11231   + caddc 11233   < clt 11373   ≤ cle 11374   − cmin 11571   / cdiv 12003  ℕcn 12365  ℤcz 12723  ...cfz 13669  ♯chash 14504

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778  ax-cnex 11286  ax-resscn 11287  ax-1cn 11288  ax-icn 11289  ax-addcl 11290  ax-addrcl 11291  ax-mulcl 11292  ax-mulrcl 11293  ax-mulcom 11294  ax-addass 11295  ax-mulass 11296  ax-distr 11297  ax-i2m1 11298  ax-1ne0 11299  ax-1rid 11300  ax-rnegex 11301  ax-rrecex 11302  ax-cnre 11303  ax-pre-lttri 11304  ax-pre-lttrn 11305  ax-pre-ltadd 11306  ax-pre-mulgt0 11307

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5551  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-pred 6325  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7403  df-ov 7449  df-oprab 7450  df-mpo 7451  df-om 7905  df-1st 8028  df-2nd 8029  df-frecs 8330  df-wrecs 8361  df-recs 8410  df-rdg 8449  df-1o 8507  df-er 8748  df-en 9005  df-dom 9006  df-sdom 9007  df-fin 9008  df-card 10050  df-pnf 11375  df-mnf 11376  df-xr 11377  df-ltxr 11378  df-le 11379  df-sub 11573  df-neg 11574  df-nn 12366  df-n0 12637  df-z 12724  df-uz 12996  df-fz 13670  df-hash 14505

This theorem is used by:  ballotlem5  35215  ballotlemrc  35246