| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ballotlemiex | Structured version Visualization version GIF version | ||
| Description: Properties of (𝐼‘𝐶). (Contributed by Thierry Arnoux, 12-Dec-2016.) (Revised by AV, 6-Oct-2020.) |
| 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}, ℝ, < )) |
| Ref | Expression |
|---|---|
| ballotlemiex | ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐼‘𝐶) ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘𝐶)‘(𝐼‘𝐶)) = 0)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ballotth.m | . . . 4 ⊢ 𝑀 ∈ ℕ | |
| 2 | ballotth.n | . . . 4 ⊢ 𝑁 ∈ ℕ | |
| 3 | ballotth.o | . . . 4 ⊢ 𝑂 = {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (♯‘𝑐) = 𝑀} | |
| 4 | ballotth.p | . . . 4 ⊢ 𝑃 = (𝑥 ∈ 𝒫 𝑂 ↦ ((♯‘𝑥) / (♯‘𝑂))) | |
| 5 | ballotth.f | . . . 4 ⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐))))) | |
| 6 | ballotth.e | . . . 4 ⊢ 𝐸 = {𝑐 ∈ 𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑐)‘𝑖)} | |
| 7 | ballotth.mgtn | . . . 4 ⊢ 𝑁 < 𝑀 | |
| 8 | ballotth.i | . . . 4 ⊢ 𝐼 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑐)‘𝑘) = 0}, ℝ, < )) | |
| 9 | 1, 2, 3, 4, 5, 6, 7, 8 | ballotlemi 35203 | . . 3 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) = inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}, ℝ, < )) |
| 10 | ltso 11417 | . . . . 5 ⊢ < Or ℝ | |
| 11 | 10 | a1i 11 | . . . 4 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → < Or ℝ) |
| 12 | fzfi 14142 | . . . . . 6 ⊢ (1...(𝑀 + 𝑁)) ∈ Fin | |
| 13 | ssrab2 4008 | . . . . . 6 ⊢ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ⊆ (1...(𝑀 + 𝑁)) | |
| 14 | ssfi 9216 | . . . . . 6 ⊢ (((1...(𝑀 + 𝑁)) ∈ Fin ∧ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ⊆ (1...(𝑀 + 𝑁))) → {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ∈ Fin) | |
| 15 | 12, 13, 14 | mp2an 705 | . . . . 5 ⊢ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ∈ Fin |
| 16 | 15 | a1i 11 | . . . 4 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ∈ Fin) |
| 17 | 1, 2, 3, 4, 5, 6, 7 | ballotlem5 35202 | . . . . 5 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ∃𝑘 ∈ (1...(𝑀 + 𝑁))((𝐹‘𝐶)‘𝑘) = 0) |
| 18 | rabn0 4342 | . . . . 5 ⊢ ({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ≠ ∅ ↔ ∃𝑘 ∈ (1...(𝑀 + 𝑁))((𝐹‘𝐶)‘𝑘) = 0) | |
| 19 | 17, 18 | sylibr 237 | . . . 4 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ≠ ∅) |
| 20 | fzssuz 13726 | . . . . . . . 8 ⊢ (1...(𝑀 + 𝑁)) ⊆ (ℤ≥‘1) | |
| 21 | uzssz 13013 | . . . . . . . 8 ⊢ (ℤ≥‘1) ⊆ ℤ | |
| 22 | 20, 21 | sstri 3922 | . . . . . . 7 ⊢ (1...(𝑀 + 𝑁)) ⊆ ℤ |
| 23 | zssre 12727 | . . . . . . 7 ⊢ ℤ ⊆ ℝ | |
| 24 | 22, 23 | sstri 3922 | . . . . . 6 ⊢ (1...(𝑀 + 𝑁)) ⊆ ℝ |
| 25 | 13, 24 | sstri 3922 | . . . . 5 ⊢ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ⊆ ℝ |
| 26 | 25 | a1i 11 | . . . 4 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ⊆ ℝ) |
| 27 | fiinfcl 9522 | . . . 4 ⊢ (( < Or ℝ ∧ ({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ∈ Fin ∧ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ≠ ∅ ∧ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ⊆ ℝ)) → inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}, ℝ, < ) ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}) | |
| 28 | 11, 16, 19, 26, 27 | syl13anc 1400 | . . 3 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}, ℝ, < ) ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}) |
| 29 | 9, 28 | eqeltrd 2864 | . 2 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}) |
| 30 | fveqeq2 6917 | . . 3 ⊢ (𝑘 = (𝐼‘𝐶) → (((𝐹‘𝐶)‘𝑘) = 0 ↔ ((𝐹‘𝐶)‘(𝐼‘𝐶)) = 0)) | |
| 31 | 30 | elrab 3648 | . 2 ⊢ ((𝐼‘𝐶) ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ↔ ((𝐼‘𝐶) ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘𝐶)‘(𝐼‘𝐶)) = 0)) |
| 32 | 29, 31 | sylib 221 | 1 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐼‘𝐶) ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘𝐶)‘(𝐼‘𝐶)) = 0)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∀wral 3080 ∃wrex 3090 {crab 3416 ⊆ wss 3900 ∖ cdif 4048 ∩ cin 4092 ∅c0 4281 𝒫 cpw 4560 class class class wbr 5106 ↦ cmpt 5189 Or wor 5562 ‘cfv 6558 (class class class)co 7443 Fincfn 9001 infcinf 9460 ℝcr 11226 0cc0 11227 1c1 11228 + caddc 11230 < clt 11370 − cmin 11568 / cdiv 12000 ℕcn 12362 ℤcz 12720 ℤ≥cuz 12992 ...cfz 13666 ♯chash 14501 |
| 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 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-cnex 11283 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 ax-pre-mulgt0 11304 |
| 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-rmo 3369 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 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-1o 8504 df-oadd 8508 df-er 8745 df-en 9002 df-dom 9003 df-sdom 9004 df-fin 9005 df-sup 9461 df-inf 9462 df-dju 10009 df-card 10047 df-pnf 11372 df-mnf 11373 df-xr 11374 df-ltxr 11375 df-le 11376 df-sub 11570 df-neg 11571 df-nn 12363 df-2 12432 df-n0 12634 df-z 12721 df-uz 12993 df-fz 13667 df-hash 14502 |
| This theorem is used by: ballotlemi1 35205 ballotlemii 35206 ballotlemimin 35208 ballotlemic 35209 ballotlem1c 35210 ballotlemsgt1 35213 ballotlemsdom 35214 ballotlemsel1i 35215 ballotlemsf1o 35216 ballotlemsi 35217 ballotlemsima 35218 ballotlemrv2 35224 ballotlemfrc 35229 ballotlemfrci 35230 ballotlemfrceq 35231 ballotlemfrcn0 35232 ballotlemrc 35233 ballotlemirc 35234 ballotlem1ri 35237 |
| Copyright terms: Public domain | W3C validator |