| 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 10317 | . 2 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 < 𝑀 ∨ 𝐾 ∈ (𝑀...𝑁) ∨ 𝑁 < 𝐾)) | |
| 2 | zltnle 9568 | . . . . . . 7 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝐾 < 𝑀 ↔ ¬ 𝑀 ≤ 𝐾)) | |
| 3 | 2 | 3adant3 1044 | . . . . . 6 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 < 𝑀 ↔ ¬ 𝑀 ≤ 𝐾)) |
| 4 | simpl 109 | . . . . . . 7 ⊢ ((𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁) → 𝑀 ≤ 𝐾) | |
| 5 | 4 | con3i 637 | . . . . . 6 ⊢ (¬ 𝑀 ≤ 𝐾 → ¬ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)) |
| 6 | 3, 5 | biimtrdi 163 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 < 𝑀 → ¬ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
| 7 | elfz 10292 | . . . . . 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 9568 | . . . . . . . 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 2202 class class class wbr 4093 (class class class)co 6028 < clt 8257 ≤ cle 8258 ℤcz 9522 ...cfz 10286 |
| 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 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-addass 8177 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-0id 8183 ax-rnegex 8184 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-ltadd 8191 |
| 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 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-br 4094 df-opab 4156 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-iota 5293 df-fun 5335 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-pnf 8259 df-mnf 8260 df-xr 8261 df-ltxr 8262 df-le 8263 df-sub 8395 df-neg 8396 df-inn 9187 df-n0 9446 df-z 9523 df-fz 10287 |
| This theorem is referenced by: fzodcel 10431 iseqf1olemqcl 10805 iseqf1olemmo 10811 seqf1oglem1 10825 seqf1oglem2 10826 bcval 11055 bccmpl 11060 bcval5 11069 bcpasc 11072 bccl 11073 fisumss 12014 fsum3ser 12019 binomlem 12105 mertenslemi1 12157 fprodssdc 12212 fprodm1 12220 fprodeq0 12239 pcfac 12984 elply2 15526 elplyd 15532 ply1termlem 15533 plyaddlem1 15538 plymullem1 15539 plycoeid3 15548 dvply1 15556 |
| Copyright terms: Public domain | W3C validator |