| 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 10461 | . 2 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 < 𝑀 ∨ 𝐾 ∈ (𝑀...𝑁) ∨ 𝑁 < 𝐾)) | |
| 2 | zltnle 9702 | . . . . . . 7 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝐾 < 𝑀 ↔ ¬ 𝑀 ≤ 𝐾)) | |
| 3 | 2 | 3adant3 1048 | . . . . . 6 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 < 𝑀 ↔ ¬ 𝑀 ≤ 𝐾)) |
| 4 | simpl 109 | . . . . . . 7 ⊢ ((𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁) → 𝑀 ≤ 𝐾) | |
| 5 | 4 | con3i 641 | . . . . . 6 ⊢ (¬ 𝑀 ≤ 𝐾 → ¬ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)) |
| 6 | 3, 5 | biimtrdi 163 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 < 𝑀 → ¬ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
| 7 | elfz 10435 | . . . . . 6 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) ↔ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) | |
| 8 | 7 | biimpd 144 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) → (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
| 9 | 6, 8 | nsyld 657 | . . . 4 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 < 𝑀 → ¬ 𝐾 ∈ (𝑀...𝑁))) |
| 10 | olc 723 | . . . . 5 ⊢ (¬ 𝐾 ∈ (𝑀...𝑁) → (𝐾 ∈ (𝑀...𝑁) ∨ ¬ 𝐾 ∈ (𝑀...𝑁))) | |
| 11 | df-dc 847 | . . . . 5 ⊢ (DECID 𝐾 ∈ (𝑀...𝑁) ↔ (𝐾 ∈ (𝑀...𝑁) ∨ ¬ 𝐾 ∈ (𝑀...𝑁))) | |
| 12 | 10, 11 | sylibr 134 | . . . 4 ⊢ (¬ 𝐾 ∈ (𝑀...𝑁) → DECID 𝐾 ∈ (𝑀...𝑁)) |
| 13 | 9, 12 | syl6 33 | . . 3 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 < 𝑀 → DECID 𝐾 ∈ (𝑀...𝑁))) |
| 14 | orc 724 | . . . . 5 ⊢ (𝐾 ∈ (𝑀...𝑁) → (𝐾 ∈ (𝑀...𝑁) ∨ ¬ 𝐾 ∈ (𝑀...𝑁))) | |
| 15 | 14, 11 | sylibr 134 | . . . 4 ⊢ (𝐾 ∈ (𝑀...𝑁) → DECID 𝐾 ∈ (𝑀...𝑁)) |
| 16 | 15 | a1i 9 | . . 3 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) → DECID 𝐾 ∈ (𝑀...𝑁))) |
| 17 | zltnle 9702 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝑁 < 𝐾 ↔ ¬ 𝐾 ≤ 𝑁)) | |
| 18 | 17 | ancoms 268 | . . . . . . 7 ⊢ ((𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝐾 ↔ ¬ 𝐾 ≤ 𝑁)) |
| 19 | 18 | 3adant2 1047 | . . . . . 6 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝐾 ↔ ¬ 𝐾 ≤ 𝑁)) |
| 20 | simpr 110 | . . . . . . 7 ⊢ ((𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁) → 𝐾 ≤ 𝑁) | |
| 21 | 20 | con3i 641 | . . . . . 6 ⊢ (¬ 𝐾 ≤ 𝑁 → ¬ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)) |
| 22 | 19, 21 | biimtrdi 163 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝐾 → ¬ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
| 23 | 22, 8 | nsyld 657 | . . . 4 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝐾 → ¬ 𝐾 ∈ (𝑀...𝑁))) |
| 24 | 23, 12 | syl6 33 | . . 3 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝐾 → DECID 𝐾 ∈ (𝑀...𝑁))) |
| 25 | 13, 16, 24 | 3jaod 1345 | . 2 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 < 𝑀 ∨ 𝐾 ∈ (𝑀...𝑁) ∨ 𝑁 < 𝐾) → DECID 𝐾 ∈ (𝑀...𝑁))) |
| 26 | 1, 25 | mpd 13 | 1 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝐾 ∈ (𝑀...𝑁)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 720 DECID wdc 846 ∨ w3o 1008 ∧ w3a 1009 ∈ wcel 2209 class class class wbr 4131 (class class class)co 6088 < clt 8367 ≤ cle 8368 ℤcz 9656 ...cfz 10429 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-cnex 8277 ax-resscn 8278 ax-1cn 8279 ax-1re 8280 ax-icn 8281 ax-addcl 8282 ax-addrcl 8283 ax-mulcl 8284 ax-addcom 8286 ax-addass 8288 ax-distr 8290 ax-i2m1 8291 ax-0lt1 8292 ax-0id 8294 ax-rnegex 8295 ax-cnre 8297 ax-pre-ltirr 8298 ax-pre-ltwlin 8299 ax-pre-lttrn 8300 ax-pre-ltadd 8302 |
| This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-br 4132 df-opab 4194 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-iota 5340 df-fun 5382 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-pnf 8369 df-mnf 8370 df-xr 8371 df-ltxr 8372 df-le 8373 df-sub 8507 df-neg 8508 df-inn 9315 df-n0 9576 df-z 9657 df-fz 10430 |
| This theorem is used by: fzodcel 10578 iseqf1olemqcl 10958 iseqf1olemmo 10964 seqf1oglem1 10978 seqf1oglem2 10979 bcval 11210 bccmpl 11215 bcval5 11224 bcpasc 11227 bccl 11228 hashfibc 11306 fisumss 12185 fsum3ser 12190 binomlem 12276 mertenslemi1 12328 fprodssdc 12383 fprodm1 12391 fprodeq0 12410 pcfac 13159 ballotfilemdifcfi 13284 ballotfilemiex 13303 elply2 15973 elplyd 15979 ply1termlem 15980 plyaddlem1 15985 plymullem1 15986 plycoeid3 15995 dvply1 16003 ppiqfi 16254 chtdif 16276 bposlem1 16323 |
| Copyright terms: Public domain | W3C validator |