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

Theorem ballotlemfg 29914
 Description: Express the value of (𝐹‘𝐶) in terms of ↑. (Contributed by Thierry Arnoux, 21-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 𝑅 = (𝑐 ∈ (𝑂𝐸) ↦ ((𝑆𝑐) “ 𝑐))
ballotlemg = (𝑢 ∈ Fin, 𝑣 ∈ Fin ↦ ((#‘(𝑣𝑢)) − (#‘(𝑣𝑢))))
Assertion
Ref Expression
ballotlemfg ((𝐶 ∈ (𝑂𝐸) ∧ 𝐽 ∈ (0...(𝑀 + 𝑁))) → ((𝐹𝐶)‘𝐽) = (𝐶 (1...𝐽)))
Distinct variable groups:   𝑀,𝑐   𝑁,𝑐   𝑂,𝑐   𝑖,𝑀   𝑖,𝑁   𝑖,𝑂   𝑘,𝑀   𝑘,𝑁   𝑘,𝑂   𝑖,𝑐,𝐹,𝑘   𝐶,𝑖,𝑘   𝑖,𝐸,𝑘   𝐶,𝑘   𝑘,𝐼,𝑐   𝐸,𝑐   𝑖,𝐼,𝑐   𝑘,𝐽   𝑆,𝑘,𝑖,𝑐   𝑅,𝑖   𝑣,𝑢,𝐶   𝑢,𝐼,𝑣   𝑢,𝐽,𝑣   𝑢,𝑅,𝑣   𝑢,𝑆,𝑣   𝑖,𝐽
Allowed substitution hints:   𝐶(𝑥,𝑐)   𝑃(𝑥,𝑣,𝑢,𝑖,𝑘,𝑐)   𝑅(𝑥,𝑘,𝑐)   𝑆(𝑥)   𝐸(𝑥,𝑣,𝑢)   (𝑥,𝑣,𝑢,𝑖,𝑘,𝑐)   𝐹(𝑥,𝑣,𝑢)   𝐼(𝑥)   𝐽(𝑥,𝑐)   𝑀(𝑥,𝑣,𝑢)   𝑁(𝑥,𝑣,𝑢)   𝑂(𝑥,𝑣,𝑢)

Proof of Theorem ballotlemfg
StepHypRef Expression
1 ballotth.m . . 3 𝑀 ∈ ℕ
2 ballotth.n . . 3 𝑁 ∈ ℕ
3 ballotth.o . . 3 𝑂 = {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (#‘𝑐) = 𝑀}
4 ballotth.p . . 3 𝑃 = (𝑥 ∈ 𝒫 𝑂 ↦ ((#‘𝑥) / (#‘𝑂)))
5 ballotth.f . . 3 𝐹 = (𝑐𝑂 ↦ (𝑖 ∈ ℤ ↦ ((#‘((1...𝑖) ∩ 𝑐)) − (#‘((1...𝑖) ∖ 𝑐)))))
6 eldifi 3694 . . . 4 (𝐶 ∈ (𝑂𝐸) → 𝐶𝑂)
76adantr 480 . . 3 ((𝐶 ∈ (𝑂𝐸) ∧ 𝐽 ∈ (0...(𝑀 + 𝑁))) → 𝐶𝑂)
8 elfzelz 12213 . . . 4 (𝐽 ∈ (0...(𝑀 + 𝑁)) → 𝐽 ∈ ℤ)
98adantl 481 . . 3 ((𝐶 ∈ (𝑂𝐸) ∧ 𝐽 ∈ (0...(𝑀 + 𝑁))) → 𝐽 ∈ ℤ)
101, 2, 3, 4, 5, 7, 9ballotlemfval 29878 . 2 ((𝐶 ∈ (𝑂𝐸) ∧ 𝐽 ∈ (0...(𝑀 + 𝑁))) → ((𝐹𝐶)‘𝐽) = ((#‘((1...𝐽) ∩ 𝐶)) − (#‘((1...𝐽) ∖ 𝐶))))
11 fzfi 12633 . . . . 5 (1...(𝑀 + 𝑁)) ∈ Fin
121, 2, 3ballotlemelo 29876 . . . . . 6 (𝐶𝑂 ↔ (𝐶 ⊆ (1...(𝑀 + 𝑁)) ∧ (#‘𝐶) = 𝑀))
1312simplbi 475 . . . . 5 (𝐶𝑂𝐶 ⊆ (1...(𝑀 + 𝑁)))
14 ssfi 8065 . . . . 5 (((1...(𝑀 + 𝑁)) ∈ Fin ∧ 𝐶 ⊆ (1...(𝑀 + 𝑁))) → 𝐶 ∈ Fin)
1511, 13, 14sylancr 694 . . . 4 (𝐶𝑂𝐶 ∈ Fin)
167, 15syl 17 . . 3 ((𝐶 ∈ (𝑂𝐸) ∧ 𝐽 ∈ (0...(𝑀 + 𝑁))) → 𝐶 ∈ Fin)
17 fzfid 12634 . . 3 ((𝐶 ∈ (𝑂𝐸) ∧ 𝐽 ∈ (0...(𝑀 + 𝑁))) → (1...𝐽) ∈ Fin)
18 ballotth.e . . . 4 𝐸 = {𝑐𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹𝑐)‘𝑖)}
19 ballotth.mgtn . . . 4 𝑁 < 𝑀
20 ballotth.i . . . 4 𝐼 = (𝑐 ∈ (𝑂𝐸) ↦ inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹𝑐)‘𝑘) = 0}, ℝ, < ))
21 ballotth.s . . . 4 𝑆 = (𝑐 ∈ (𝑂𝐸) ↦ (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼𝑐), (((𝐼𝑐) + 1) − 𝑖), 𝑖)))
22 ballotth.r . . . 4 𝑅 = (𝑐 ∈ (𝑂𝐸) ↦ ((𝑆𝑐) “ 𝑐))
23 ballotlemg . . . 4 = (𝑢 ∈ Fin, 𝑣 ∈ Fin ↦ ((#‘(𝑣𝑢)) − (#‘(𝑣𝑢))))
241, 2, 3, 4, 5, 18, 19, 20, 21, 22, 23ballotlemgval 29912 . . 3 ((𝐶 ∈ Fin ∧ (1...𝐽) ∈ Fin) → (𝐶 (1...𝐽)) = ((#‘((1...𝐽) ∩ 𝐶)) − (#‘((1...𝐽) ∖ 𝐶))))
2516, 17, 24syl2anc 691 . 2 ((𝐶 ∈ (𝑂𝐸) ∧ 𝐽 ∈ (0...(𝑀 + 𝑁))) → (𝐶 (1...𝐽)) = ((#‘((1...𝐽) ∩ 𝐶)) − (#‘((1...𝐽) ∖ 𝐶))))
2610, 25eqtr4d 2647 1 ((𝐶 ∈ (𝑂𝐸) ∧ 𝐽 ∈ (0...(𝑀 + 𝑁))) → ((𝐹𝐶)‘𝐽) = (𝐶 (1...𝐽)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  ∀wral 2896  {crab 2900   ∖ cdif 3537   ∩ cin 3539   ⊆ wss 3540  ifcif 4036  𝒫 cpw 4108   class class class wbr 4583   ↦ cmpt 4643   “ cima 5041  ‘cfv 5804  (class class class)co 6549   ↦ cmpt2 6551  Fincfn 7841  infcinf 8230  ℝcr 9814  0cc0 9815  1c1 9816   + caddc 9818   < clt 9953   ≤ cle 9954   − cmin 10145   / cdiv 10563  ℕcn 10897  ℤcz 11254  ...cfz 12197  #chash 12979 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-er 7629  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-n0 11170  df-z 11255  df-uz 11564  df-fz 12198 This theorem is referenced by:  ballotlemfrci  29916  ballotlemfrceq  29917
 Copyright terms: Public domain W3C validator