| 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 10274 | . 2 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 < 𝑀 ∨ 𝐾 ∈ (𝑀...𝑁) ∨ 𝑁 < 𝐾)) | |
| 2 | zltnle 9525 | . . . . . . 7 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝐾 < 𝑀 ↔ ¬ 𝑀 ≤ 𝐾)) | |
| 3 | 2 | 3adant3 1043 | . . . . . 6 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 < 𝑀 ↔ ¬ 𝑀 ≤ 𝐾)) |
| 4 | simpl 109 | . . . . . . 7 ⊢ ((𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁) → 𝑀 ≤ 𝐾) | |
| 5 | 4 | con3i 637 | . . . . . 6 ⊢ (¬ 𝑀 ≤ 𝐾 → ¬ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)) |
| 6 | 3, 5 | biimtrdi 163 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 < 𝑀 → ¬ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
| 7 | elfz 10249 | . . . . . 6 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) ↔ (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) | |
| 8 | 7 | biimpd 144 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) → (𝑀 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁))) |
| 9 | 6, 8 | nsyld 653 | . . . 4 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 < 𝑀 → ¬ 𝐾 ∈ (𝑀...𝑁))) |
| 10 | olc 718 | . . . . 5 ⊢ (¬ 𝐾 ∈ (𝑀...𝑁) → (𝐾 ∈ (𝑀...𝑁) ∨ ¬ 𝐾 ∈ (𝑀...𝑁))) | |
| 11 | df-dc 842 | . . . . 5 ⊢ (DECID 𝐾 ∈ (𝑀...𝑁) ↔ (𝐾 ∈ (𝑀...𝑁) ∨ ¬ 𝐾 ∈ (𝑀...𝑁))) | |
| 12 | 10, 11 | sylibr 134 | . . . 4 ⊢ (¬ 𝐾 ∈ (𝑀...𝑁) → DECID 𝐾 ∈ (𝑀...𝑁)) |
| 13 | 9, 12 | syl6 33 | . . 3 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 < 𝑀 → DECID 𝐾 ∈ (𝑀...𝑁))) |
| 14 | orc 719 | . . . . 5 ⊢ (𝐾 ∈ (𝑀...𝑁) → (𝐾 ∈ (𝑀...𝑁) ∨ ¬ 𝐾 ∈ (𝑀...𝑁))) | |
| 15 | 14, 11 | sylibr 134 | . . . 4 ⊢ (𝐾 ∈ (𝑀...𝑁) → DECID 𝐾 ∈ (𝑀...𝑁)) |
| 16 | 15 | a1i 9 | . . 3 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) → DECID 𝐾 ∈ (𝑀...𝑁))) |
| 17 | zltnle 9525 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝑁 < 𝐾 ↔ ¬ 𝐾 ≤ 𝑁)) | |
| 18 | 17 | ancoms 268 | . . . . . . 7 ⊢ ((𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝐾 ↔ ¬ 𝐾 ≤ 𝑁)) |
| 19 | 18 | 3adant2 1042 | . . . . . 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 1340 | . 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 715 DECID wdc 841 ∨ w3o 1003 ∧ w3a 1004 ∈ wcel 2202 class class class wbr 4088 (class class class)co 6018 < clt 8214 ≤ cle 8215 ℤcz 9479 ...cfz 10243 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-addass 8134 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-0id 8140 ax-rnegex 8141 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-ltadd 8148 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-br 4089 df-opab 4151 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-iota 5286 df-fun 5328 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-inn 9144 df-n0 9403 df-z 9480 df-fz 10244 |
| This theorem is referenced by: fzodcel 10388 iseqf1olemqcl 10762 iseqf1olemmo 10768 seqf1oglem1 10782 seqf1oglem2 10783 bcval 11012 bccmpl 11017 bcval5 11026 bcpasc 11029 bccl 11030 fisumss 11958 fsum3ser 11963 binomlem 12049 mertenslemi1 12101 fprodssdc 12156 fprodm1 12164 fprodeq0 12183 pcfac 12928 elply2 15465 elplyd 15471 ply1termlem 15472 plyaddlem1 15477 plymullem1 15478 plycoeid3 15487 dvply1 15495 |
| Copyright terms: Public domain | W3C validator |