ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ballotfilemfg GIF version

Theorem ballotfilemfg 13252
Description: Express the value of (𝐹𝐶) in terms of . (Contributed by Thierry Arnoux, 21-Apr-2017.)
Hypotheses
Ref Expression
ballotth.m 𝑀 ∈ ℕ
ballotth.n 𝑁 ∈ ℕ
ballotfilem.o 𝑂 = {𝑐 ∈ (𝒫 (1...(𝑀 + 𝑁)) ∩ Fin) ∣ (♯‘𝑐) = 𝑀}
ballotfilem.p 𝑃 = (𝑥 ∈ (𝒫 𝑂 ∩ Fin) ↦ ((♯‘𝑥) / (♯‘𝑂)))
ballotth.f 𝐹 = (𝑐𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
ballotth.e 𝐸 = {𝑐𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹𝑐)‘𝑖)}
ballotth.mgtn 𝑁 < 𝑀
ballotth.i 𝐼 = (𝑐 ∈ (𝑂𝐸) ↦ inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹𝑐)‘𝑘) = 0}, ℝ, < ))
ballotth.s 𝑆 = (𝑐 ∈ (𝑂𝐸) ↦ (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼𝑐), (((𝐼𝑐) + 1) − 𝑖), 𝑖)))
ballotth.r 𝑅 = (𝑐 ∈ (𝑂𝐸) ↦ ((𝑆𝑐) “ 𝑐))
ballotlemg = (𝑢𝑂, 𝑣 ∈ Fin ↦ ((♯‘(𝑣𝑢)) − (♯‘(𝑣𝑢))))
Assertion
Ref Expression
ballotfilemfg ((𝐶 ∈ (𝑂𝐸) ∧ 𝐽 ∈ (0...(𝑀 + 𝑁))) → ((𝐹𝐶)‘𝐽) = (𝐶 (1...𝐽)))
Distinct variable groups:   𝑀,𝑐   𝑁,𝑐   𝑂,𝑐   𝑖,𝑀   𝑖,𝑁   𝑖,𝑂   𝑘,𝑀   𝑘,𝑁   𝑘,𝑂   𝑖,𝑐,𝐹,𝑘   𝐶,𝑖,𝑘   𝑖,𝐸,𝑘   𝐶,𝑘   𝑘,𝐼,𝑐   𝐸,𝑐   𝑖,𝐼,𝑐   𝑘,𝐽   𝑆,𝑘,𝑖,𝑐   𝑅,𝑖   𝑣,𝑢,𝐶   𝑢,𝐼,𝑣   𝑢,𝐽,𝑣   𝑢,𝑅,𝑣   𝑢,𝑆,𝑣   𝑢,𝑂,𝑣   𝑖,𝐽
Allowed substitution hints:   𝐶(𝑥,𝑐)   𝑃(𝑥,𝑣,𝑢,𝑖,𝑘,𝑐)   𝑅(𝑥,𝑘,𝑐)   𝑆(𝑥)   𝐸(𝑥,𝑣,𝑢)   (𝑥,𝑣,𝑢,𝑖,𝑘,𝑐)   𝐹(𝑥,𝑣,𝑢)   𝐼(𝑥)   𝐽(𝑥,𝑐)   𝑀(𝑥,𝑣,𝑢)   𝑁(𝑥,𝑣,𝑢)   𝑂(𝑥)

Proof of Theorem ballotfilemfg
StepHypRef Expression
1 ballotth.m . . 3 𝑀 ∈ ℕ
2 ballotth.n . . 3 𝑁 ∈ ℕ
3 ballotfilem.o . . 3 𝑂 = {𝑐 ∈ (𝒫 (1...(𝑀 + 𝑁)) ∩ Fin) ∣ (♯‘𝑐) = 𝑀}
4 ballotfilem.p . . 3 𝑃 = (𝑥 ∈ (𝒫 𝑂 ∩ Fin) ↦ ((♯‘𝑥) / (♯‘𝑂)))
5 ballotth.f . . 3 𝐹 = (𝑐𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
6 eldifi 3351 . . . 4 (𝐶 ∈ (𝑂𝐸) → 𝐶𝑂)
76adantr 276 . . 3 ((𝐶 ∈ (𝑂𝐸) ∧ 𝐽 ∈ (0...(𝑀 + 𝑁))) → 𝐶𝑂)
8 elfzelz 10411 . . . 4 (𝐽 ∈ (0...(𝑀 + 𝑁)) → 𝐽 ∈ ℤ)
98adantl 277 . . 3 ((𝐶 ∈ (𝑂𝐸) ∧ 𝐽 ∈ (0...(𝑀 + 𝑁))) → 𝐽 ∈ ℤ)
101, 2, 3, 4, 5, 7, 9ballotfilemfval 13212 . 2 ((𝐶 ∈ (𝑂𝐸) ∧ 𝐽 ∈ (0...(𝑀 + 𝑁))) → ((𝐹𝐶)‘𝐽) = ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))))
11 ballotth.e . . 3 𝐸 = {𝑐𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹𝑐)‘𝑖)}
12 ballotth.mgtn . . 3 𝑁 < 𝑀
13 ballotth.i . . 3 𝐼 = (𝑐 ∈ (𝑂𝐸) ↦ inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹𝑐)‘𝑘) = 0}, ℝ, < ))
14 ballotth.s . . 3 𝑆 = (𝑐 ∈ (𝑂𝐸) ↦ (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼𝑐), (((𝐼𝑐) + 1) − 𝑖), 𝑖)))
15 ballotth.r . . 3 𝑅 = (𝑐 ∈ (𝑂𝐸) ↦ ((𝑆𝑐) “ 𝑐))
16 ballotlemg . . 3 = (𝑢𝑂, 𝑣 ∈ Fin ↦ ((♯‘(𝑣𝑢)) − (♯‘(𝑣𝑢))))
17 1zzd 9654 . . 3 ((𝐶 ∈ (𝑂𝐸) ∧ 𝐽 ∈ (0...(𝑀 + 𝑁))) → 1 ∈ ℤ)
18 eqidd 2239 . . 3 ((𝐶 ∈ (𝑂𝐸) ∧ 𝐽 ∈ (0...(𝑀 + 𝑁))) → (1...𝐽) = (1...𝐽))
191, 2, 3, 4, 5, 11, 12, 13, 14, 15, 16, 7, 17, 9, 18ballotfilemgval 13250 . 2 ((𝐶 ∈ (𝑂𝐸) ∧ 𝐽 ∈ (0...(𝑀 + 𝑁))) → (𝐶 (1...𝐽)) = ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))))
2010, 19eqtr4d 2274 1 ((𝐶 ∈ (𝑂𝐸) ∧ 𝐽 ∈ (0...(𝑀 + 𝑁))) → ((𝐹𝐶)‘𝐽) = (𝐶 (1...𝐽)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1402  wcel 2209  wral 2528  {crab 2532  cdif 3217  cin 3219  ifcif 3638  𝒫 cpw 3688   class class class wbr 4128  cmpt 4190  cima 4775  cfv 5375  (class class class)co 6079  cmpo 6081  Fincfn 7016  infcinf 7317  cr 8172  0cc0 8173  1c1 8174   + caddc 8176   < clt 8354  cle 8355  cmin 8491   / cdiv 8996  cn 9287  cz 9627  ...cfz 10394  chash 11197
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4244  ax-sep 4247  ax-nul 4257  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-iinf 4733  ax-cnex 8264  ax-resscn 8265  ax-1cn 8266  ax-1re 8267  ax-icn 8268  ax-addcl 8269  ax-addrcl 8270  ax-mulcl 8271  ax-addcom 8273  ax-addass 8275  ax-distr 8277  ax-i2m1 8278  ax-0lt1 8279  ax-0id 8281  ax-rnegex 8282  ax-cnre 8284  ax-pre-ltirr 8285  ax-pre-ltwlin 8286  ax-pre-lttrn 8287  ax-pre-apti 8288  ax-pre-ltadd 8289
This theorem depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-tr 4228  df-id 4436  df-iord 4509  df-on 4511  df-ilim 4512  df-suc 4514  df-iom 4736  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-riota 6032  df-ov 6082  df-oprab 6083  df-mpo 6084  df-1st 6368  df-2nd 6369  df-recs 6570  df-frec 6656  df-1o 6681  df-er 6801  df-en 7017  df-dom 7018  df-fin 7019  df-pnf 8356  df-mnf 8357  df-xr 8358  df-ltxr 8359  df-le 8360  df-sub 8493  df-neg 8494  df-inn 9288  df-n0 9547  df-z 9628  df-uz 9905  df-fz 10395  df-ihash 11198
This theorem is referenced by:  ballotfilemfrci  13254  ballotfilemfrceq  13255
  Copyright terms: Public domain W3C validator