| 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 34487 | . . 3 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) = inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}, ℝ, < )) |
| 10 | ltso 11233 | . . . . 5 ⊢ < Or ℝ | |
| 11 | 10 | a1i 11 | . . . 4 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → < Or ℝ) |
| 12 | fzfi 13916 | . . . . . 6 ⊢ (1...(𝑀 + 𝑁)) ∈ Fin | |
| 13 | ssrab2 4039 | . . . . . 6 ⊢ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ⊆ (1...(𝑀 + 𝑁)) | |
| 14 | ssfi 9115 | . . . . . 6 ⊢ (((1...(𝑀 + 𝑁)) ∈ Fin ∧ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ⊆ (1...(𝑀 + 𝑁))) → {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ∈ Fin) | |
| 15 | 12, 13, 14 | mp2an 692 | . . . . 5 ⊢ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ∈ Fin |
| 16 | 15 | a1i 11 | . . . 4 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ∈ Fin) |
| 17 | 1, 2, 3, 4, 5, 6, 7 | ballotlem5 34486 | . . . . 5 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ∃𝑘 ∈ (1...(𝑀 + 𝑁))((𝐹‘𝐶)‘𝑘) = 0) |
| 18 | rabn0 4348 | . . . . 5 ⊢ ({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ≠ ∅ ↔ ∃𝑘 ∈ (1...(𝑀 + 𝑁))((𝐹‘𝐶)‘𝑘) = 0) | |
| 19 | 17, 18 | sylibr 234 | . . . 4 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ≠ ∅) |
| 20 | fzssuz 13505 | . . . . . . . 8 ⊢ (1...(𝑀 + 𝑁)) ⊆ (ℤ≥‘1) | |
| 21 | uzssz 12793 | . . . . . . . 8 ⊢ (ℤ≥‘1) ⊆ ℤ | |
| 22 | 20, 21 | sstri 3953 | . . . . . . 7 ⊢ (1...(𝑀 + 𝑁)) ⊆ ℤ |
| 23 | zssre 12515 | . . . . . . 7 ⊢ ℤ ⊆ ℝ | |
| 24 | 22, 23 | sstri 3953 | . . . . . 6 ⊢ (1...(𝑀 + 𝑁)) ⊆ ℝ |
| 25 | 13, 24 | sstri 3953 | . . . . 5 ⊢ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ⊆ ℝ |
| 26 | 25 | a1i 11 | . . . 4 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ⊆ ℝ) |
| 27 | fiinfcl 9431 | . . . 4 ⊢ (( < Or ℝ ∧ ({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ∈ Fin ∧ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ≠ ∅ ∧ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ⊆ ℝ)) → inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}, ℝ, < ) ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}) | |
| 28 | 11, 16, 19, 26, 27 | syl13anc 1374 | . . 3 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}, ℝ, < ) ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}) |
| 29 | 9, 28 | eqeltrd 2828 | . 2 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0}) |
| 30 | fveqeq2 6850 | . . 3 ⊢ (𝑘 = (𝐼‘𝐶) → (((𝐹‘𝐶)‘𝑘) = 0 ↔ ((𝐹‘𝐶)‘(𝐼‘𝐶)) = 0)) | |
| 31 | 30 | elrab 3656 | . 2 ⊢ ((𝐼‘𝐶) ∈ {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} ↔ ((𝐼‘𝐶) ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘𝐶)‘(𝐼‘𝐶)) = 0)) |
| 32 | 29, 31 | sylib 218 | 1 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐼‘𝐶) ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘𝐶)‘(𝐼‘𝐶)) = 0)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ∀wral 3044 ∃wrex 3053 {crab 3402 ∖ cdif 3908 ∩ cin 3910 ⊆ wss 3911 ∅c0 4292 𝒫 cpw 4559 class class class wbr 5102 ↦ cmpt 5183 Or wor 5538 ‘cfv 6500 (class class class)co 7370 Fincfn 8896 infcinf 9369 ℝcr 11046 0cc0 11047 1c1 11048 + caddc 11050 < clt 11187 − cmin 11384 / cdiv 11814 ℕcn 12165 ℤcz 12508 ℤ≥cuz 12772 ...cfz 13447 ♯chash 14274 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7692 ax-cnex 11103 ax-resscn 11104 ax-1cn 11105 ax-icn 11106 ax-addcl 11107 ax-addrcl 11108 ax-mulcl 11109 ax-mulrcl 11110 ax-mulcom 11111 ax-addass 11112 ax-mulass 11113 ax-distr 11114 ax-i2m1 11115 ax-1ne0 11116 ax-1rid 11117 ax-rnegex 11118 ax-rrecex 11119 ax-cnre 11120 ax-pre-lttri 11121 ax-pre-lttrn 11122 ax-pre-ltadd 11123 ax-pre-mulgt0 11124 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-int 4907 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6263 df-ord 6324 df-on 6325 df-lim 6326 df-suc 6327 df-iota 6453 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-om 7824 df-1st 7948 df-2nd 7949 df-frecs 8238 df-wrecs 8269 df-recs 8318 df-rdg 8356 df-1o 8412 df-oadd 8416 df-er 8649 df-en 8897 df-dom 8898 df-sdom 8899 df-fin 8900 df-sup 9370 df-inf 9371 df-dju 9833 df-card 9871 df-pnf 11189 df-mnf 11190 df-xr 11191 df-ltxr 11192 df-le 11193 df-sub 11386 df-neg 11387 df-nn 12166 df-2 12228 df-n0 12422 df-z 12509 df-uz 12773 df-fz 13448 df-hash 14275 |
| This theorem is referenced by: ballotlemi1 34489 ballotlemii 34490 ballotlemimin 34492 ballotlemic 34493 ballotlem1c 34494 ballotlemsgt1 34497 ballotlemsdom 34498 ballotlemsel1i 34499 ballotlemsf1o 34500 ballotlemsi 34501 ballotlemsima 34502 ballotlemrv2 34508 ballotlemfrc 34513 ballotlemfrci 34514 ballotlemfrceq 34515 ballotlemfrcn0 34516 ballotlemrc 34517 ballotlemirc 34518 ballotlem1ri 34521 |
| Copyright terms: Public domain | W3C validator |