| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ballotfilemsle | GIF version | ||
| Description: The infimum of the set of zeroes of 𝐹 is a lower bound. (Contributed by Jim Kingdon, 12-Jun-2026.) |
| 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}, ℝ, < )) |
| ballotfilemscl.s | ⊢ 𝑆 = {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} |
| Ref | Expression |
|---|---|
| ballotfilemsle | ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑋 ∈ 𝑆) → inf(𝑆, ℝ, < ) ≤ 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ballotth.m | . . . 4 ⊢ 𝑀 ∈ ℕ | |
| 2 | ballotth.n | . . . 4 ⊢ 𝑁 ∈ ℕ | |
| 3 | ballotfilem.o | . . . 4 ⊢ 𝑂 = {𝑐 ∈ (𝒫 (1...(𝑀 + 𝑁)) ∩ Fin) ∣ (♯‘𝑐) = 𝑀} | |
| 4 | ballotfilem.p | . . . 4 ⊢ 𝑃 = (𝑥 ∈ (𝒫 𝑂 ∩ Fin) ↦ ((♯‘𝑥) / (♯‘𝑂))) | |
| 5 | ballotth.f | . . . 4 ⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐))))) | |
| 6 | ballotth.e | . . . 4 ⊢ 𝐸 = {𝑐 ∈ 𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑐)‘𝑖)} | |
| 7 | ballotth.mgtn | . . . 4 ⊢ 𝑁 < 𝑀 | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | ballotfilem5 13186 | . . 3 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ∃𝑗 ∈ (1...(𝑀 + 𝑁))((𝐹‘𝐶)‘𝑗) = 0) |
| 9 | 8 | adantr 276 | . 2 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑋 ∈ 𝑆) → ∃𝑗 ∈ (1...(𝑀 + 𝑁))((𝐹‘𝐶)‘𝑗) = 0) |
| 10 | ballotfilemscl.s | . . 3 ⊢ 𝑆 = {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝐶)‘𝑘) = 0} | |
| 11 | simplr 529 | . . 3 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑋 ∈ 𝑆) ∧ (𝑗 ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘𝐶)‘𝑗) = 0)) → 𝑋 ∈ 𝑆) | |
| 12 | eldifi 3345 | . . . . . 6 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → 𝐶 ∈ 𝑂) | |
| 13 | 12 | ad3antrrr 492 | . . . . 5 ⊢ ((((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑋 ∈ 𝑆) ∧ (𝑗 ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘𝐶)‘𝑗) = 0)) ∧ 𝑘 ∈ (1...𝑋)) → 𝐶 ∈ 𝑂) |
| 14 | elfzelz 10378 | . . . . . 6 ⊢ (𝑘 ∈ (1...𝑋) → 𝑘 ∈ ℤ) | |
| 15 | 14 | adantl 277 | . . . . 5 ⊢ ((((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑋 ∈ 𝑆) ∧ (𝑗 ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘𝐶)‘𝑗) = 0)) ∧ 𝑘 ∈ (1...𝑋)) → 𝑘 ∈ ℤ) |
| 16 | 1, 2, 3, 4, 5, 13, 15 | ballotfilemfelz 13174 | . . . 4 ⊢ ((((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑋 ∈ 𝑆) ∧ (𝑗 ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘𝐶)‘𝑗) = 0)) ∧ 𝑘 ∈ (1...𝑋)) → ((𝐹‘𝐶)‘𝑘) ∈ ℤ) |
| 17 | 0z 9605 | . . . 4 ⊢ 0 ∈ ℤ | |
| 18 | zdceq 9670 | . . . 4 ⊢ ((((𝐹‘𝐶)‘𝑘) ∈ ℤ ∧ 0 ∈ ℤ) → DECID ((𝐹‘𝐶)‘𝑘) = 0) | |
| 19 | 16, 17, 18 | sylancl 413 | . . 3 ⊢ ((((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑋 ∈ 𝑆) ∧ (𝑗 ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘𝐶)‘𝑗) = 0)) ∧ 𝑘 ∈ (1...𝑋)) → DECID ((𝐹‘𝐶)‘𝑘) = 0) |
| 20 | 10, 11, 19 | infssfzledc 10619 | . 2 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑋 ∈ 𝑆) ∧ (𝑗 ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘𝐶)‘𝑗) = 0)) → inf(𝑆, ℝ, < ) ≤ 𝑋) |
| 21 | 9, 20 | rexlimddv 2667 | 1 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 𝑋 ∈ 𝑆) → inf(𝑆, ℝ, < ) ≤ 𝑋) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 DECID wdc 842 = wceq 1398 ∈ wcel 2205 ∀wral 2522 ∃wrex 2523 {crab 2526 ∖ cdif 3211 ∩ cin 3213 𝒫 cpw 3674 class class class wbr 4114 ↦ cmpt 4176 ‘cfv 5357 (class class class)co 6058 Fincfn 6988 infcinf 7287 ℝcr 8142 0cc0 8143 1c1 8144 + caddc 8146 < clt 8324 ≤ cle 8325 − cmin 8460 / cdiv 8963 ℕcn 9254 ℤcz 9594 ...cfz 10361 ♯chash 11163 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-iinf 4715 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-mulrcl 8242 ax-addcom 8243 ax-mulcom 8244 ax-addass 8245 ax-mulass 8246 ax-distr 8247 ax-i2m1 8248 ax-0lt1 8249 ax-1rid 8250 ax-0id 8251 ax-rnegex 8252 ax-precex 8253 ax-cnre 8254 ax-pre-ltirr 8255 ax-pre-ltwlin 8256 ax-pre-lttrn 8257 ax-pre-apti 8258 ax-pre-ltadd 8259 ax-pre-mulgt0 8260 ax-pre-mulext 8261 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-if 3625 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-tr 4214 df-id 4419 df-po 4422 df-iso 4423 df-iord 4492 df-on 4494 df-ilim 4495 df-suc 4497 df-iom 4718 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-recs 6549 df-irdg 6614 df-frec 6635 df-1o 6660 df-oadd 6664 df-er 6780 df-en 6989 df-dom 6990 df-fin 6991 df-sup 7288 df-inf 7289 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-sub 8462 df-neg 8463 df-reap 8866 df-ap 8873 df-div 8964 df-inn 9255 df-2 9313 df-n0 9514 df-z 9595 df-uz 9872 df-q 9970 df-rp 10005 df-fz 10362 df-fzo 10499 df-ihash 11164 |
| This theorem is referenced by: ballotfilemimin 13193 ballotfilemfrcn0 13217 |
| Copyright terms: Public domain | W3C validator |