| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fzdcel | GIF version | ||
| Description: Decidability of membership in a finite interval of integers. (Contributed by Jim Kingdon, 1-Jun-2020.) |
| Ref | Expression |
|---|---|
| fzdcel | ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝐾 ∈ (𝑀...𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fztri3or 10393 | . 2 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 < 𝑀 ∨ 𝐾 ∈ (𝑀...𝑁) ∨ 𝑁 < 𝐾)) | |
| 2 | zltnle 9640 | . . . . . . 7 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝐾 < 𝑀 ↔ ¬ 𝑀 ≤ 𝐾)) | |
| 3 | 2 | 3adant3 1044 | . . . . . 6 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 < 𝑀 ↔ ¬ 𝑀 ≤ 𝐾)) |
| 4 | simpl 109 | . . . . . . 7 ⊢ ((𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁) → 𝑀 ≤ 𝐾) | |
| 5 | 4 | con3i 637 | . . . . . 6 ⊢ (¬ 𝑀 ≤ 𝐾 → ¬ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)) |
| 6 | 3, 5 | biimtrdi 163 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 < 𝑀 → ¬ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
| 7 | elfz 10367 | . . . . . 6 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) ↔ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) | |
| 8 | 7 | biimpd 144 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) → (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
| 9 | 6, 8 | nsyld 653 | . . . 4 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 < 𝑀 → ¬ 𝐾 ∈ (𝑀...𝑁))) |
| 10 | olc 719 | . . . . 5 ⊢ (¬ 𝐾 ∈ (𝑀...𝑁) → (𝐾 ∈ (𝑀...𝑁) ∨ ¬ 𝐾 ∈ (𝑀...𝑁))) | |
| 11 | df-dc 843 | . . . . 5 ⊢ (DECID 𝐾 ∈ (𝑀...𝑁) ↔ (𝐾 ∈ (𝑀...𝑁) ∨ ¬ 𝐾 ∈ (𝑀...𝑁))) | |
| 12 | 10, 11 | sylibr 134 | . . . 4 ⊢ (¬ 𝐾 ∈ (𝑀...𝑁) → DECID 𝐾 ∈ (𝑀...𝑁)) |
| 13 | 9, 12 | syl6 33 | . . 3 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 < 𝑀 → DECID 𝐾 ∈ (𝑀...𝑁))) |
| 14 | orc 720 | . . . . 5 ⊢ (𝐾 ∈ (𝑀...𝑁) → (𝐾 ∈ (𝑀...𝑁) ∨ ¬ 𝐾 ∈ (𝑀...𝑁))) | |
| 15 | 14, 11 | sylibr 134 | . . . 4 ⊢ (𝐾 ∈ (𝑀...𝑁) → DECID 𝐾 ∈ (𝑀...𝑁)) |
| 16 | 15 | a1i 9 | . . 3 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) → DECID 𝐾 ∈ (𝑀...𝑁))) |
| 17 | zltnle 9640 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝑁 < 𝐾 ↔ ¬ 𝐾 ≤ 𝑁)) | |
| 18 | 17 | ancoms 268 | . . . . . . 7 ⊢ ((𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝐾 ↔ ¬ 𝐾 ≤ 𝑁)) |
| 19 | 18 | 3adant2 1043 | . . . . . 6 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝐾 ↔ ¬ 𝐾 ≤ 𝑁)) |
| 20 | simpr 110 | . . . . . . 7 ⊢ ((𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁) → 𝐾 ≤ 𝑁) | |
| 21 | 20 | con3i 637 | . . . . . 6 ⊢ (¬ 𝐾 ≤ 𝑁 → ¬ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)) |
| 22 | 19, 21 | biimtrdi 163 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝐾 → ¬ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
| 23 | 22, 8 | nsyld 653 | . . . 4 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝐾 → ¬ 𝐾 ∈ (𝑀...𝑁))) |
| 24 | 23, 12 | syl6 33 | . . 3 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝐾 → DECID 𝐾 ∈ (𝑀...𝑁))) |
| 25 | 13, 16, 24 | 3jaod 1341 | . 2 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 < 𝑀 ∨ 𝐾 ∈ (𝑀...𝑁) ∨ 𝑁 < 𝐾) → DECID 𝐾 ∈ (𝑀...𝑁))) |
| 26 | 1, 25 | mpd 13 | 1 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝐾 ∈ (𝑀...𝑁)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 716 DECID wdc 842 ∨ w3o 1004 ∧ w3a 1005 ∈ wcel 2205 class class class wbr 4114 (class class class)co 6058 < clt 8324 ≤ cle 8325 ℤcz 9594 ...cfz 10361 |
| 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-sep 4233 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 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-addcom 8243 ax-addass 8245 ax-distr 8247 ax-i2m1 8248 ax-0lt1 8249 ax-0id 8251 ax-rnegex 8252 ax-cnre 8254 ax-pre-ltirr 8255 ax-pre-ltwlin 8256 ax-pre-lttrn 8257 ax-pre-ltadd 8259 |
| 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-rab 2531 df-v 2817 df-sbc 3046 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-br 4115 df-opab 4177 df-id 4419 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-iota 5317 df-fun 5359 df-fv 5365 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-sub 8462 df-neg 8463 df-inn 9255 df-n0 9514 df-z 9595 df-fz 10362 |
| This theorem is referenced by: fzodcel 10509 iseqf1olemqcl 10885 iseqf1olemmo 10891 seqf1oglem1 10905 seqf1oglem2 10906 bcval 11136 bccmpl 11141 bcval5 11150 bcpasc 11153 bccl 11154 hashfibc 11232 fisumss 12103 fsum3ser 12108 binomlem 12194 mertenslemi1 12246 fprodssdc 12301 fprodm1 12309 fprodeq0 12328 pcfac 13073 ballotfilemdifcfi 13169 ballotfilemiex 13188 elply2 15712 elplyd 15718 ply1termlem 15719 plyaddlem1 15724 plymullem1 15725 plycoeid3 15734 dvply1 15742 |
| Copyright terms: Public domain | W3C validator |