| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > elfz2nn0 | GIF version | ||
| Description: Membership in a finite set of sequential nonnegative integers. (Contributed by NM, 16-Sep-2005.) (Revised by Mario Carneiro, 28-Apr-2015.) |
| Ref | Expression |
|---|---|
| elfz2nn0 | ⊢ (𝐾 ∈ (0...𝑁) ↔ (𝐾 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0 ∧ 𝐾 ≤ 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elnn0uz 9656 | . . . 4 ⊢ (𝐾 ∈ ℕ0 ↔ 𝐾 ∈ (ℤ≥‘0)) | |
| 2 | 1 | anbi1i 458 | . . 3 ⊢ ((𝐾 ∈ ℕ0 ∧ 𝑁 ∈ (ℤ≥‘𝐾)) ↔ (𝐾 ∈ (ℤ≥‘0) ∧ 𝑁 ∈ (ℤ≥‘𝐾))) |
| 3 | eluznn0 9690 | . . . . . 6 ⊢ ((𝐾 ∈ ℕ0 ∧ 𝑁 ∈ (ℤ≥‘𝐾)) → 𝑁 ∈ ℕ0) | |
| 4 | eluzle 9630 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝐾) → 𝐾 ≤ 𝑁) | |
| 5 | 4 | adantl 277 | . . . . . 6 ⊢ ((𝐾 ∈ ℕ0 ∧ 𝑁 ∈ (ℤ≥‘𝐾)) → 𝐾 ≤ 𝑁) |
| 6 | 3, 5 | jca 306 | . . . . 5 ⊢ ((𝐾 ∈ ℕ0 ∧ 𝑁 ∈ (ℤ≥‘𝐾)) → (𝑁 ∈ ℕ0 ∧ 𝐾 ≤ 𝑁)) |
| 7 | nn0z 9363 | . . . . . . . 8 ⊢ (𝐾 ∈ ℕ0 → 𝐾 ∈ ℤ) | |
| 8 | nn0z 9363 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ) | |
| 9 | eluz 9631 | . . . . . . . 8 ⊢ ((𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘𝐾) ↔ 𝐾 ≤ 𝑁)) | |
| 10 | 7, 8, 9 | syl2an 289 | . . . . . . 7 ⊢ ((𝐾 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (𝑁 ∈ (ℤ≥‘𝐾) ↔ 𝐾 ≤ 𝑁)) |
| 11 | 10 | biimprd 158 | . . . . . 6 ⊢ ((𝐾 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (𝐾 ≤ 𝑁 → 𝑁 ∈ (ℤ≥‘𝐾))) |
| 12 | 11 | impr 379 | . . . . 5 ⊢ ((𝐾 ∈ ℕ0 ∧ (𝑁 ∈ ℕ0 ∧ 𝐾 ≤ 𝑁)) → 𝑁 ∈ (ℤ≥‘𝐾)) |
| 13 | 6, 12 | impbida 596 | . . . 4 ⊢ (𝐾 ∈ ℕ0 → (𝑁 ∈ (ℤ≥‘𝐾) ↔ (𝑁 ∈ ℕ0 ∧ 𝐾 ≤ 𝑁))) |
| 14 | 13 | pm5.32i 454 | . . 3 ⊢ ((𝐾 ∈ ℕ0 ∧ 𝑁 ∈ (ℤ≥‘𝐾)) ↔ (𝐾 ∈ ℕ0 ∧ (𝑁 ∈ ℕ0 ∧ 𝐾 ≤ 𝑁))) |
| 15 | 2, 14 | bitr3i 186 | . 2 ⊢ ((𝐾 ∈ (ℤ≥‘0) ∧ 𝑁 ∈ (ℤ≥‘𝐾)) ↔ (𝐾 ∈ ℕ0 ∧ (𝑁 ∈ ℕ0 ∧ 𝐾 ≤ 𝑁))) |
| 16 | elfzuzb 10111 | . 2 ⊢ (𝐾 ∈ (0...𝑁) ↔ (𝐾 ∈ (ℤ≥‘0) ∧ 𝑁 ∈ (ℤ≥‘𝐾))) | |
| 17 | 3anass 984 | . 2 ⊢ ((𝐾 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0 ∧ 𝐾 ≤ 𝑁) ↔ (𝐾 ∈ ℕ0 ∧ (𝑁 ∈ ℕ0 ∧ 𝐾 ≤ 𝑁))) | |
| 18 | 15, 16, 17 | 3bitr4i 212 | 1 ⊢ (𝐾 ∈ (0...𝑁) ↔ (𝐾 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0 ∧ 𝐾 ≤ 𝑁)) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 ∧ w3a 980 ∈ wcel 2167 class class class wbr 4034 ‘cfv 5259 (class class class)co 5925 0cc0 7896 ≤ cle 8079 ℕ0cn0 9266 ℤcz 9343 ℤ≥cuz 9618 ...cfz 10100 |
| 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 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-sep 4152 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-setind 4574 ax-cnex 7987 ax-resscn 7988 ax-1cn 7989 ax-1re 7990 ax-icn 7991 ax-addcl 7992 ax-addrcl 7993 ax-mulcl 7994 ax-addcom 7996 ax-addass 7998 ax-distr 8000 ax-i2m1 8001 ax-0lt1 8002 ax-0id 8004 ax-rnegex 8005 ax-cnre 8007 ax-pre-ltirr 8008 ax-pre-ltwlin 8009 ax-pre-lttrn 8010 ax-pre-ltadd 8012 |
| This theorem depends on definitions: df-bi 117 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-nel 2463 df-ral 2480 df-rex 2481 df-reu 2482 df-rab 2484 df-v 2765 df-sbc 2990 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-int 3876 df-br 4035 df-opab 4096 df-mpt 4097 df-id 4329 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-res 4676 df-ima 4677 df-iota 5220 df-fun 5261 df-fn 5262 df-f 5263 df-fv 5267 df-riota 5880 df-ov 5928 df-oprab 5929 df-mpo 5930 df-pnf 8080 df-mnf 8081 df-xr 8082 df-ltxr 8083 df-le 8084 df-sub 8216 df-neg 8217 df-inn 9008 df-n0 9267 df-z 9344 df-uz 9619 df-fz 10101 |
| This theorem is referenced by: elfznn0 10206 elfz3nn0 10207 0elfz 10210 fz0to3un2pr 10215 elfz0ubfz0 10217 elfz0fzfz0 10218 fz0fzelfz0 10219 uzsubfz0 10221 fz0fzdiffz0 10222 elfzmlbm 10223 elfzmlbp 10224 difelfzle 10226 difelfznle 10227 fzofzim 10281 elfzodifsumelfzo 10294 elfzom1elp1fzo 10295 fzo0to42pr 10313 fzo0sn0fzo1 10314 fvinim0ffz 10334 1elfz0hash 10915 prm23lt5 12457 lgsquadlem2 15403 |
| Copyright terms: Public domain | W3C validator |