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 9366 | . . . 4 ⊢ (𝐾 ∈ ℕ0 ↔ 𝐾 ∈ (ℤ≥‘0)) | |
2 | 1 | anbi1i 453 | . . 3 ⊢ ((𝐾 ∈ ℕ0 ∧ 𝑁 ∈ (ℤ≥‘𝐾)) ↔ (𝐾 ∈ (ℤ≥‘0) ∧ 𝑁 ∈ (ℤ≥‘𝐾))) |
3 | eluznn0 9396 | . . . . . 6 ⊢ ((𝐾 ∈ ℕ0 ∧ 𝑁 ∈ (ℤ≥‘𝐾)) → 𝑁 ∈ ℕ0) | |
4 | eluzle 9341 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝐾) → 𝐾 ≤ 𝑁) | |
5 | 4 | adantl 275 | . . . . . 6 ⊢ ((𝐾 ∈ ℕ0 ∧ 𝑁 ∈ (ℤ≥‘𝐾)) → 𝐾 ≤ 𝑁) |
6 | 3, 5 | jca 304 | . . . . 5 ⊢ ((𝐾 ∈ ℕ0 ∧ 𝑁 ∈ (ℤ≥‘𝐾)) → (𝑁 ∈ ℕ0 ∧ 𝐾 ≤ 𝑁)) |
7 | nn0z 9077 | . . . . . . . 8 ⊢ (𝐾 ∈ ℕ0 → 𝐾 ∈ ℤ) | |
8 | nn0z 9077 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ) | |
9 | eluz 9342 | . . . . . . . 8 ⊢ ((𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘𝐾) ↔ 𝐾 ≤ 𝑁)) | |
10 | 7, 8, 9 | syl2an 287 | . . . . . . 7 ⊢ ((𝐾 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (𝑁 ∈ (ℤ≥‘𝐾) ↔ 𝐾 ≤ 𝑁)) |
11 | 10 | biimprd 157 | . . . . . 6 ⊢ ((𝐾 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (𝐾 ≤ 𝑁 → 𝑁 ∈ (ℤ≥‘𝐾))) |
12 | 11 | impr 376 | . . . . 5 ⊢ ((𝐾 ∈ ℕ0 ∧ (𝑁 ∈ ℕ0 ∧ 𝐾 ≤ 𝑁)) → 𝑁 ∈ (ℤ≥‘𝐾)) |
13 | 6, 12 | impbida 585 | . . . 4 ⊢ (𝐾 ∈ ℕ0 → (𝑁 ∈ (ℤ≥‘𝐾) ↔ (𝑁 ∈ ℕ0 ∧ 𝐾 ≤ 𝑁))) |
14 | 13 | pm5.32i 449 | . . 3 ⊢ ((𝐾 ∈ ℕ0 ∧ 𝑁 ∈ (ℤ≥‘𝐾)) ↔ (𝐾 ∈ ℕ0 ∧ (𝑁 ∈ ℕ0 ∧ 𝐾 ≤ 𝑁))) |
15 | 2, 14 | bitr3i 185 | . 2 ⊢ ((𝐾 ∈ (ℤ≥‘0) ∧ 𝑁 ∈ (ℤ≥‘𝐾)) ↔ (𝐾 ∈ ℕ0 ∧ (𝑁 ∈ ℕ0 ∧ 𝐾 ≤ 𝑁))) |
16 | elfzuzb 9803 | . 2 ⊢ (𝐾 ∈ (0...𝑁) ↔ (𝐾 ∈ (ℤ≥‘0) ∧ 𝑁 ∈ (ℤ≥‘𝐾))) | |
17 | 3anass 966 | . 2 ⊢ ((𝐾 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0 ∧ 𝐾 ≤ 𝑁) ↔ (𝐾 ∈ ℕ0 ∧ (𝑁 ∈ ℕ0 ∧ 𝐾 ≤ 𝑁))) | |
18 | 15, 16, 17 | 3bitr4i 211 | 1 ⊢ (𝐾 ∈ (0...𝑁) ↔ (𝐾 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0 ∧ 𝐾 ≤ 𝑁)) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 103 ↔ wb 104 ∧ w3a 962 ∈ wcel 1480 class class class wbr 3929 ‘cfv 5123 (class class class)co 5774 0cc0 7623 ≤ cle 7804 ℕ0cn0 8980 ℤcz 9057 ℤ≥cuz 9329 ...cfz 9793 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-cnex 7714 ax-resscn 7715 ax-1cn 7716 ax-1re 7717 ax-icn 7718 ax-addcl 7719 ax-addrcl 7720 ax-mulcl 7721 ax-addcom 7723 ax-addass 7725 ax-distr 7727 ax-i2m1 7728 ax-0lt1 7729 ax-0id 7731 ax-rnegex 7732 ax-cnre 7734 ax-pre-ltirr 7735 ax-pre-ltwlin 7736 ax-pre-lttrn 7737 ax-pre-ltadd 7739 |
This theorem depends on definitions: df-bi 116 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-nel 2404 df-ral 2421 df-rex 2422 df-reu 2423 df-rab 2425 df-v 2688 df-sbc 2910 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-int 3772 df-br 3930 df-opab 3990 df-mpt 3991 df-id 4215 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-fv 5131 df-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-pnf 7805 df-mnf 7806 df-xr 7807 df-ltxr 7808 df-le 7809 df-sub 7938 df-neg 7939 df-inn 8724 df-n0 8981 df-z 9058 df-uz 9330 df-fz 9794 |
This theorem is referenced by: elfznn0 9897 elfz3nn0 9898 0elfz 9901 elfz0ubfz0 9905 elfz0fzfz0 9906 fz0fzelfz0 9907 uzsubfz0 9909 fz0fzdiffz0 9910 elfzmlbm 9911 elfzmlbp 9912 difelfzle 9914 difelfznle 9915 fzofzim 9968 elfzodifsumelfzo 9981 elfzom1elp1fzo 9982 fzo0to42pr 10000 fzo0sn0fzo1 10001 fvinim0ffz 10021 1elfz0hash 10555 |
Copyright terms: Public domain | W3C validator |