ballotlemrv - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > ballotlemrv		Structured version Visualization version GIF version

Theorem ballotlemrv 35145

Description: Value of 𝑅 evaluated at 𝐽. (Contributed by Thierry Arnoux, 17-Apr-2017.)

**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
ballotlemrv	⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝐽 ∈ (1...(𝑀 + 𝑁))) → (𝐽 ∈ (𝑅‘𝐶) ↔ if(𝐽 ≤ (𝐼‘𝐶), (((𝐼‘𝐶) + 1) − 𝐽), 𝐽) ∈ 𝐶))

Distinct variable groups: 𝑀,𝑐 𝑁,𝑐 𝑂,𝑐 𝑖,𝑀 𝑖,𝑁 𝑖,𝑂 𝑘,𝑀 𝑘,𝑁 𝑘,𝑂 𝑖,𝑐,𝐹,𝑘 𝐶,𝑖,𝑘 𝑖,𝐸,𝑘 𝐶,𝑘 𝑘,𝐼,𝑐 𝐸,𝑐 𝑖,𝐼,𝑐 𝑘,𝐽 𝑆,𝑘,𝑖,𝑐 Allowed substitution hints: 𝐶(𝑥, 𝑐) 𝑃(𝑥, 𝑖, 𝑘, 𝑐) 𝑅(𝑥, 𝑖, 𝑘, 𝑐) 𝑆(𝑥) 𝐸(𝑥) 𝐹(𝑥) 𝐼(𝑥) 𝐽(𝑥, 𝑖, 𝑐) 𝑀(𝑥) 𝑁(𝑥) 𝑂(𝑥)

**Proof of Theorem ballotlemrv**
Step	Hyp	Ref	Expression
1		simpl 488	. . . 4 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝐽 ∈ (1...(𝑀 + 𝑁))) → 𝐶 ∈ (𝑂 ∖ 𝐸))
2		ballotth.m	. . . . . 6 ⊢ 𝑀 ∈ ℕ
3		ballotth.n	. . . . . 6 ⊢ 𝑁 ∈ ℕ
4		ballotth.o	. . . . . 6 ⊢ 𝑂 = {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (♯‘𝑐) = 𝑀}
5		ballotth.p	. . . . . 6 ⊢ 𝑃 = (𝑥 ∈ 𝒫 𝑂 ↦ ((♯‘𝑥) / (♯‘𝑂)))
6		ballotth.f	. . . . . 6 ⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
7		ballotth.e	. . . . . 6 ⊢ 𝐸 = {𝑐 ∈ 𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑐)‘𝑖)}
8		ballotth.mgtn	. . . . . 6 ⊢ 𝑁 < 𝑀
9		ballotth.i	. . . . . 6 ⊢ 𝐼 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑐)‘𝑘) = 0}, ℝ, < ))
10		ballotth.s	. . . . . 6 ⊢ 𝑆 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼‘𝑐), (((𝐼‘𝑐) + 1) − 𝑖), 𝑖)))
11	2, 3, 4, 5, 6, 7, 8, 9, 10	ballotlemsf1o 35139	. . . . 5 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝑆‘𝐶):(1...(𝑀 + 𝑁))–1-1-onto→(1...(𝑀 + 𝑁)) ∧ ^◡(𝑆‘𝐶) = (𝑆‘𝐶)))
12	11	simpld 500	. . . 4 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑆‘𝐶):(1...(𝑀 + 𝑁))–1-1-onto→(1...(𝑀 + 𝑁)))
13		f1ofun 6824	. . . 4 ⊢ ((𝑆‘𝐶):(1...(𝑀 + 𝑁))–1-1-onto→(1...(𝑀 + 𝑁)) → Fun (𝑆‘𝐶))
14	1, 12, 13	3syl 19	. . 3 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝐽 ∈ (1...(𝑀 + 𝑁))) → Fun (𝑆‘𝐶))
15		simpr 490	. . . 4 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝐽 ∈ (1...(𝑀 + 𝑁))) → 𝐽 ∈ (1...(𝑀 + 𝑁)))
16		f1odm 6826	. . . . 5 ⊢ ((𝑆‘𝐶):(1...(𝑀 + 𝑁))–1-1-onto→(1...(𝑀 + 𝑁)) → dom (𝑆‘𝐶) = (1...(𝑀 + 𝑁)))
17	1, 12, 16	3syl 19	. . . 4 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝐽 ∈ (1...(𝑀 + 𝑁))) → dom (𝑆‘𝐶) = (1...(𝑀 + 𝑁)))
18	15, 17	eleqtrrd 2864	. . 3 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝐽 ∈ (1...(𝑀 + 𝑁))) → 𝐽 ∈ dom (𝑆‘𝐶))
19		fvimacnv 7050	. . 3 ⊢ ((Fun (𝑆‘𝐶) ∧ 𝐽 ∈ dom (𝑆‘𝐶)) → (((𝑆‘𝐶)‘𝐽) ∈ 𝐶 ↔ 𝐽 ∈ (^◡(𝑆‘𝐶) “ 𝐶)))
20	14, 18, 19	syl2anc 596	. 2 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝐽 ∈ (1...(𝑀 + 𝑁))) → (((𝑆‘𝐶)‘𝐽) ∈ 𝐶 ↔ 𝐽 ∈ (^◡(𝑆‘𝐶) “ 𝐶)))
21	2, 3, 4, 5, 6, 7, 8, 9, 10	ballotlemsv 35135	. . 3 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝐽 ∈ (1...(𝑀 + 𝑁))) → ((𝑆‘𝐶)‘𝐽) = if(𝐽 ≤ (𝐼‘𝐶), (((𝐼‘𝐶) + 1) − 𝐽), 𝐽))
22	21	eleq1d 2846	. 2 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝐽 ∈ (1...(𝑀 + 𝑁))) → (((𝑆‘𝐶)‘𝐽) ∈ 𝐶 ↔ if(𝐽 ≤ (𝐼‘𝐶), (((𝐼‘𝐶) + 1) − 𝐽), 𝐽) ∈ 𝐶))
23	11	simprd 501	. . . . . 6 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ^◡(𝑆‘𝐶) = (𝑆‘𝐶))
24	23	imaeq1d 6051	. . . . 5 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (^◡(𝑆‘𝐶) “ 𝐶) = ((𝑆‘𝐶) “ 𝐶))
25		ballotth.r	. . . . . 6 ⊢ 𝑅 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ ((𝑆‘𝑐) “ 𝑐))
26	2, 3, 4, 5, 6, 7, 8, 9, 10, 25	ballotlemrval 35143	. . . . 5 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑅‘𝐶) = ((𝑆‘𝐶) “ 𝐶))
27	24, 26	eqtr4d 2799	. . . 4 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (^◡(𝑆‘𝐶) “ 𝐶) = (𝑅‘𝐶))
28	27	eleq2d 2847	. . 3 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐽 ∈ (^◡(𝑆‘𝐶) “ 𝐶) ↔ 𝐽 ∈ (𝑅‘𝐶)))
29	1, 28	syl 18	. 2 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝐽 ∈ (1...(𝑀 + 𝑁))) → (𝐽 ∈ (^◡(𝑆‘𝐶) “ 𝐶) ↔ 𝐽 ∈ (𝑅‘𝐶)))
30	20, 22, 29	3bitr3rd 313	1 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝐽 ∈ (1...(𝑀 + 𝑁))) → (𝐽 ∈ (𝑅‘𝐶) ↔ if(𝐽 ≤ (𝐼‘𝐶), (((𝐼‘𝐶) + 1) − 𝐽), 𝐽) ∈ 𝐶))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3077 {crab 3413 ∖ cdif 3896 ∩ cin 3898 ifcif 4482 𝒫 cpw 4557 class class class wbr 5103 ↦ cmpt 5186 ^◡ccnv 5650 dom cdm 5651 “ cima 5654 Fun wfun 6531 –1-1-onto→wf1o 6536 ‘cfv 6537 (class class class)co 7418 infcinf 9426 ℝcr 11192 0cc0 11193 1c1 11194 + caddc 11196 < clt 11336 ≤ cle 11337 − cmin 11534 / cdiv 11966 ℕcn 12328 ℤcz 12686 ...cfz 13632 ♯chash 14467

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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270

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 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-1st 7999 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-1o 8469 df-oadd 8473 df-er 8710 df-en 8967 df-dom 8968 df-sdom 8969 df-fin 8970 df-sup 9427 df-inf 9428 df-dju 9975 df-card 10013 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-nn 12329 df-2 12398 df-n0 12600 df-z 12687 df-uz 12959 df-rp 13114 df-fz 13633 df-hash 14468

This theorem is used by: ballotlemrv1 35146 ballotlemrv2 35147

W3C validator