![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > ballotlemfmpn | Structured version Visualization version GIF version |
Description: (𝐹‘𝐶) finishes counting at (𝑀 − 𝑁). (Contributed by Thierry Arnoux, 25-Nov-2016.) |
Ref | Expression |
---|---|
ballotth.m | ⊢ 𝑀 ∈ ℕ |
ballotth.n | ⊢ 𝑁 ∈ ℕ |
ballotth.o | ⊢ 𝑂 = {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (♯‘𝑐) = 𝑀} |
ballotth.p | ⊢ 𝑃 = (𝑥 ∈ 𝒫 𝑂 ↦ ((♯‘𝑥) / (♯‘𝑂))) |
ballotth.f | ⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐))))) |
Ref | Expression |
---|---|
ballotlemfmpn | ⊢ (𝐶 ∈ 𝑂 → ((𝐹‘𝐶)‘(𝑀 + 𝑁)) = (𝑀 − 𝑁)) |
Step | Hyp | Ref | 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 | id 22 | . . 3 ⊢ (𝐶 ∈ 𝑂 → 𝐶 ∈ 𝑂) | |
7 | nnaddcl 11243 | . . . . . 6 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑀 + 𝑁) ∈ ℕ) | |
8 | 1, 2, 7 | mp2an 664 | . . . . 5 ⊢ (𝑀 + 𝑁) ∈ ℕ |
9 | 8 | nnzi 11602 | . . . 4 ⊢ (𝑀 + 𝑁) ∈ ℤ |
10 | 9 | a1i 11 | . . 3 ⊢ (𝐶 ∈ 𝑂 → (𝑀 + 𝑁) ∈ ℤ) |
11 | 1, 2, 3, 4, 5, 6, 10 | ballotlemfval 30885 | . 2 ⊢ (𝐶 ∈ 𝑂 → ((𝐹‘𝐶)‘(𝑀 + 𝑁)) = ((♯‘((1...(𝑀 + 𝑁)) ∩ 𝐶)) − (♯‘((1...(𝑀 + 𝑁)) ∖ 𝐶)))) |
12 | ssrab2 3834 | . . . . . . . . 9 ⊢ {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (♯‘𝑐) = 𝑀} ⊆ 𝒫 (1...(𝑀 + 𝑁)) | |
13 | 3, 12 | eqsstri 3782 | . . . . . . . 8 ⊢ 𝑂 ⊆ 𝒫 (1...(𝑀 + 𝑁)) |
14 | 13 | sseli 3746 | . . . . . . 7 ⊢ (𝐶 ∈ 𝑂 → 𝐶 ∈ 𝒫 (1...(𝑀 + 𝑁))) |
15 | 14 | elpwid 4307 | . . . . . 6 ⊢ (𝐶 ∈ 𝑂 → 𝐶 ⊆ (1...(𝑀 + 𝑁))) |
16 | sseqin2 3966 | . . . . . 6 ⊢ (𝐶 ⊆ (1...(𝑀 + 𝑁)) ↔ ((1...(𝑀 + 𝑁)) ∩ 𝐶) = 𝐶) | |
17 | 15, 16 | sylib 208 | . . . . 5 ⊢ (𝐶 ∈ 𝑂 → ((1...(𝑀 + 𝑁)) ∩ 𝐶) = 𝐶) |
18 | 17 | fveq2d 6336 | . . . 4 ⊢ (𝐶 ∈ 𝑂 → (♯‘((1...(𝑀 + 𝑁)) ∩ 𝐶)) = (♯‘𝐶)) |
19 | rabssab 3838 | . . . . . . 7 ⊢ {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (♯‘𝑐) = 𝑀} ⊆ {𝑐 ∣ (♯‘𝑐) = 𝑀} | |
20 | 19 | sseli 3746 | . . . . . 6 ⊢ (𝐶 ∈ {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (♯‘𝑐) = 𝑀} → 𝐶 ∈ {𝑐 ∣ (♯‘𝑐) = 𝑀}) |
21 | 20, 3 | eleq2s 2867 | . . . . 5 ⊢ (𝐶 ∈ 𝑂 → 𝐶 ∈ {𝑐 ∣ (♯‘𝑐) = 𝑀}) |
22 | fveq2 6332 | . . . . . . 7 ⊢ (𝑏 = 𝐶 → (♯‘𝑏) = (♯‘𝐶)) | |
23 | 22 | eqeq1d 2772 | . . . . . 6 ⊢ (𝑏 = 𝐶 → ((♯‘𝑏) = 𝑀 ↔ (♯‘𝐶) = 𝑀)) |
24 | fveq2 6332 | . . . . . . . 8 ⊢ (𝑐 = 𝑏 → (♯‘𝑐) = (♯‘𝑏)) | |
25 | 24 | eqeq1d 2772 | . . . . . . 7 ⊢ (𝑐 = 𝑏 → ((♯‘𝑐) = 𝑀 ↔ (♯‘𝑏) = 𝑀)) |
26 | 25 | cbvabv 2895 | . . . . . 6 ⊢ {𝑐 ∣ (♯‘𝑐) = 𝑀} = {𝑏 ∣ (♯‘𝑏) = 𝑀} |
27 | 23, 26 | elab2g 3502 | . . . . 5 ⊢ (𝐶 ∈ 𝑂 → (𝐶 ∈ {𝑐 ∣ (♯‘𝑐) = 𝑀} ↔ (♯‘𝐶) = 𝑀)) |
28 | 21, 27 | mpbid 222 | . . . 4 ⊢ (𝐶 ∈ 𝑂 → (♯‘𝐶) = 𝑀) |
29 | 18, 28 | eqtrd 2804 | . . 3 ⊢ (𝐶 ∈ 𝑂 → (♯‘((1...(𝑀 + 𝑁)) ∩ 𝐶)) = 𝑀) |
30 | fzfi 12978 | . . . . 5 ⊢ (1...(𝑀 + 𝑁)) ∈ Fin | |
31 | hashssdif 13401 | . . . . 5 ⊢ (((1...(𝑀 + 𝑁)) ∈ Fin ∧ 𝐶 ⊆ (1...(𝑀 + 𝑁))) → (♯‘((1...(𝑀 + 𝑁)) ∖ 𝐶)) = ((♯‘(1...(𝑀 + 𝑁))) − (♯‘𝐶))) | |
32 | 30, 15, 31 | sylancr 567 | . . . 4 ⊢ (𝐶 ∈ 𝑂 → (♯‘((1...(𝑀 + 𝑁)) ∖ 𝐶)) = ((♯‘(1...(𝑀 + 𝑁))) − (♯‘𝐶))) |
33 | 8 | nnnn0i 11501 | . . . . . 6 ⊢ (𝑀 + 𝑁) ∈ ℕ0 |
34 | hashfz1 13337 | . . . . . 6 ⊢ ((𝑀 + 𝑁) ∈ ℕ0 → (♯‘(1...(𝑀 + 𝑁))) = (𝑀 + 𝑁)) | |
35 | 33, 34 | mp1i 13 | . . . . 5 ⊢ (𝐶 ∈ 𝑂 → (♯‘(1...(𝑀 + 𝑁))) = (𝑀 + 𝑁)) |
36 | 35, 28 | oveq12d 6810 | . . . 4 ⊢ (𝐶 ∈ 𝑂 → ((♯‘(1...(𝑀 + 𝑁))) − (♯‘𝐶)) = ((𝑀 + 𝑁) − 𝑀)) |
37 | 1 | nncni 11231 | . . . . . 6 ⊢ 𝑀 ∈ ℂ |
38 | 2 | nncni 11231 | . . . . . 6 ⊢ 𝑁 ∈ ℂ |
39 | pncan2 10489 | . . . . . 6 ⊢ ((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ) → ((𝑀 + 𝑁) − 𝑀) = 𝑁) | |
40 | 37, 38, 39 | mp2an 664 | . . . . 5 ⊢ ((𝑀 + 𝑁) − 𝑀) = 𝑁 |
41 | 40 | a1i 11 | . . . 4 ⊢ (𝐶 ∈ 𝑂 → ((𝑀 + 𝑁) − 𝑀) = 𝑁) |
42 | 32, 36, 41 | 3eqtrd 2808 | . . 3 ⊢ (𝐶 ∈ 𝑂 → (♯‘((1...(𝑀 + 𝑁)) ∖ 𝐶)) = 𝑁) |
43 | 29, 42 | oveq12d 6810 | . 2 ⊢ (𝐶 ∈ 𝑂 → ((♯‘((1...(𝑀 + 𝑁)) ∩ 𝐶)) − (♯‘((1...(𝑀 + 𝑁)) ∖ 𝐶))) = (𝑀 − 𝑁)) |
44 | 11, 43 | eqtrd 2804 | 1 ⊢ (𝐶 ∈ 𝑂 → ((𝐹‘𝐶)‘(𝑀 + 𝑁)) = (𝑀 − 𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1630 ∈ wcel 2144 {cab 2756 {crab 3064 ∖ cdif 3718 ∩ cin 3720 ⊆ wss 3721 𝒫 cpw 4295 ↦ cmpt 4861 ‘cfv 6031 (class class class)co 6792 Fincfn 8108 ℂcc 10135 1c1 10138 + caddc 10140 − cmin 10467 / cdiv 10885 ℕcn 11221 ℕ0cn0 11493 ℤcz 11578 ...cfz 12532 ♯chash 13320 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1869 ax-4 1884 ax-5 1990 ax-6 2056 ax-7 2092 ax-8 2146 ax-9 2153 ax-10 2173 ax-11 2189 ax-12 2202 ax-13 2407 ax-ext 2750 ax-rep 4902 ax-sep 4912 ax-nul 4920 ax-pow 4971 ax-pr 5034 ax-un 7095 ax-cnex 10193 ax-resscn 10194 ax-1cn 10195 ax-icn 10196 ax-addcl 10197 ax-addrcl 10198 ax-mulcl 10199 ax-mulrcl 10200 ax-mulcom 10201 ax-addass 10202 ax-mulass 10203 ax-distr 10204 ax-i2m1 10205 ax-1ne0 10206 ax-1rid 10207 ax-rnegex 10208 ax-rrecex 10209 ax-cnre 10210 ax-pre-lttri 10211 ax-pre-lttrn 10212 ax-pre-ltadd 10213 ax-pre-mulgt0 10214 |
This theorem depends on definitions: df-bi 197 df-an 383 df-or 827 df-3or 1071 df-3an 1072 df-tru 1633 df-ex 1852 df-nf 1857 df-sb 2049 df-eu 2621 df-mo 2622 df-clab 2757 df-cleq 2763 df-clel 2766 df-nfc 2901 df-ne 2943 df-nel 3046 df-ral 3065 df-rex 3066 df-reu 3067 df-rmo 3068 df-rab 3069 df-v 3351 df-sbc 3586 df-csb 3681 df-dif 3724 df-un 3726 df-in 3728 df-ss 3735 df-pss 3737 df-nul 4062 df-if 4224 df-pw 4297 df-sn 4315 df-pr 4317 df-tp 4319 df-op 4321 df-uni 4573 df-int 4610 df-iun 4654 df-br 4785 df-opab 4845 df-mpt 4862 df-tr 4885 df-id 5157 df-eprel 5162 df-po 5170 df-so 5171 df-fr 5208 df-we 5210 df-xp 5255 df-rel 5256 df-cnv 5257 df-co 5258 df-dm 5259 df-rn 5260 df-res 5261 df-ima 5262 df-pred 5823 df-ord 5869 df-on 5870 df-lim 5871 df-suc 5872 df-iota 5994 df-fun 6033 df-fn 6034 df-f 6035 df-f1 6036 df-fo 6037 df-f1o 6038 df-fv 6039 df-riota 6753 df-ov 6795 df-oprab 6796 df-mpt2 6797 df-om 7212 df-1st 7314 df-2nd 7315 df-wrecs 7558 df-recs 7620 df-rdg 7658 df-1o 7712 df-oadd 7716 df-er 7895 df-en 8109 df-dom 8110 df-sdom 8111 df-fin 8112 df-card 8964 df-cda 9191 df-pnf 10277 df-mnf 10278 df-xr 10279 df-ltxr 10280 df-le 10281 df-sub 10469 df-neg 10470 df-nn 11222 df-n0 11494 df-z 11579 df-uz 11888 df-fz 12533 df-hash 13321 |
This theorem is referenced by: ballotlem5 30895 |
Copyright terms: Public domain | W3C validator |