![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fznn | Structured version Visualization version GIF version |
Description: Finite set of sequential integers starting at 1. (Contributed by NM, 31-Aug-2011.) (Revised by Mario Carneiro, 18-Jun-2015.) |
Ref | Expression |
---|---|
fznn | ⊢ (𝑁 ∈ ℤ → (𝐾 ∈ (1...𝑁) ↔ (𝐾 ∈ ℕ ∧ 𝐾 ≤ 𝑁))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elfzuzb 13477 | . . 3 ⊢ (𝐾 ∈ (1...𝑁) ↔ (𝐾 ∈ (ℤ≥‘1) ∧ 𝑁 ∈ (ℤ≥‘𝐾))) | |
2 | elnnuz 12848 | . . . 4 ⊢ (𝐾 ∈ ℕ ↔ 𝐾 ∈ (ℤ≥‘1)) | |
3 | 2 | anbi1i 624 | . . 3 ⊢ ((𝐾 ∈ ℕ ∧ 𝑁 ∈ (ℤ≥‘𝐾)) ↔ (𝐾 ∈ (ℤ≥‘1) ∧ 𝑁 ∈ (ℤ≥‘𝐾))) |
4 | 1, 3 | bitr4i 277 | . 2 ⊢ (𝐾 ∈ (1...𝑁) ↔ (𝐾 ∈ ℕ ∧ 𝑁 ∈ (ℤ≥‘𝐾))) |
5 | nnz 12561 | . . . . 5 ⊢ (𝐾 ∈ ℕ → 𝐾 ∈ ℤ) | |
6 | eluz 12818 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘𝐾) ↔ 𝐾 ≤ 𝑁)) | |
7 | 5, 6 | sylan 580 | . . . 4 ⊢ ((𝐾 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘𝐾) ↔ 𝐾 ≤ 𝑁)) |
8 | 7 | ancoms 459 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℕ) → (𝑁 ∈ (ℤ≥‘𝐾) ↔ 𝐾 ≤ 𝑁)) |
9 | 8 | pm5.32da 579 | . 2 ⊢ (𝑁 ∈ ℤ → ((𝐾 ∈ ℕ ∧ 𝑁 ∈ (ℤ≥‘𝐾)) ↔ (𝐾 ∈ ℕ ∧ 𝐾 ≤ 𝑁))) |
10 | 4, 9 | bitrid 282 | 1 ⊢ (𝑁 ∈ ℤ → (𝐾 ∈ (1...𝑁) ↔ (𝐾 ∈ ℕ ∧ 𝐾 ≤ 𝑁))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∈ wcel 2106 class class class wbr 5141 ‘cfv 6532 (class class class)co 7393 1c1 11093 ≤ cle 11231 ℕcn 12194 ℤcz 12540 ℤ≥cuz 12804 ...cfz 13466 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2702 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7708 ax-cnex 11148 ax-resscn 11149 ax-1cn 11150 ax-icn 11151 ax-addcl 11152 ax-addrcl 11153 ax-mulcl 11154 ax-mulrcl 11155 ax-mulcom 11156 ax-addass 11157 ax-mulass 11158 ax-distr 11159 ax-i2m1 11160 ax-1ne0 11161 ax-1rid 11162 ax-rnegex 11163 ax-rrecex 11164 ax-cnre 11165 ax-pre-lttri 11166 ax-pre-lttrn 11167 ax-pre-ltadd 11168 ax-pre-mulgt0 11169 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4523 df-pw 4598 df-sn 4623 df-pr 4625 df-op 4629 df-uni 4902 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6289 df-ord 6356 df-on 6357 df-lim 6358 df-suc 6359 df-iota 6484 df-fun 6534 df-fn 6535 df-f 6536 df-f1 6537 df-fo 6538 df-f1o 6539 df-fv 6540 df-riota 7349 df-ov 7396 df-oprab 7397 df-mpo 7398 df-om 7839 df-1st 7957 df-2nd 7958 df-frecs 8248 df-wrecs 8279 df-recs 8353 df-rdg 8392 df-er 8686 df-en 8923 df-dom 8924 df-sdom 8925 df-pnf 11232 df-mnf 11233 df-xr 11234 df-ltxr 11235 df-le 11236 df-sub 11428 df-neg 11429 df-nn 12195 df-z 12541 df-uz 12805 df-fz 13467 |
This theorem is referenced by: elfz1b 13552 elfz1uz 13553 fznnfl 13809 isercoll 15596 incexc2 15766 dvdsssfz1 16243 prmind2 16604 vdwlem6 16901 prmdvdsprmo 16957 odlem2 19371 gexlem2 19414 gexcl2 19421 efgredlemd 19576 efgredlem 19579 ablfac1eu 19902 ablfaclem3 19916 dvdsflf1o 26618 vmasum 26646 logfac2 26647 lgseisenlem1 26805 lgseisenlem2 26806 lgseisenlem3 26807 lgsquadlem1 26810 lgsquadlem2 26811 2sqlem8 26856 chebbnd1lem1 26899 wwlksnredwwlkn0 29015 clwwlkf 29165 psgnfzto1stlem 32130 smatrcl 32605 reprinfz1 33463 poimirlem13 36303 poimirlem15 36305 lcmineqlem4 40700 |
Copyright terms: Public domain | W3C validator |