| 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 13573 | . . 3 ⊢ (𝐾 ∈ (1...𝑁) ↔ (𝐾 ∈ (ℤ≥‘1) ∧ 𝑁 ∈ (ℤ≥‘𝐾))) | |
| 2 | elnnuz 12928 | . . . 4 ⊢ (𝐾 ∈ ℕ ↔ 𝐾 ∈ (ℤ≥‘1)) | |
| 3 | 2 | anbi1i 636 | . . 3 ⊢ ((𝐾 ∈ ℕ ∧ 𝑁 ∈ (ℤ≥‘𝐾)) ↔ (𝐾 ∈ (ℤ≥‘1) ∧ 𝑁 ∈ (ℤ≥‘𝐾))) |
| 4 | 1, 3 | bitr4i 281 | . 2 ⊢ (𝐾 ∈ (1...𝑁) ↔ (𝐾 ∈ ℕ ∧ 𝑁 ∈ (ℤ≥‘𝐾))) |
| 5 | nnz 12637 | . . . . 5 ⊢ (𝐾 ∈ ℕ → 𝐾 ∈ ℤ) | |
| 6 | eluz 12902 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘𝐾) ↔ 𝐾 ≤ 𝑁)) | |
| 7 | 5, 6 | sylan 592 | . . . 4 ⊢ ((𝐾 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘𝐾) ↔ 𝐾 ≤ 𝑁)) |
| 8 | 7 | ancoms 464 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℕ) → (𝑁 ∈ (ℤ≥‘𝐾) ↔ 𝐾 ≤ 𝑁)) |
| 9 | 8 | pm5.32da 590 | . 2 ⊢ (𝑁 ∈ ℤ → ((𝐾 ∈ ℕ ∧ 𝑁 ∈ (ℤ≥‘𝐾)) ↔ (𝐾 ∈ ℕ ∧ 𝐾 ≤ 𝑁))) |
| 10 | 4, 9 | bitrid 286 | 1 ⊢ (𝑁 ∈ ℤ → (𝐾 ∈ (1...𝑁) ↔ (𝐾 ∈ ℕ ∧ 𝐾 ≤ 𝑁))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2145 class class class wbr 5103 ‘cfv 6533 (class class class)co 7414 1c1 11126 ≤ cle 11269 ℕcn 12258 ℤcz 12616 ℤ≥cuz 12888 ...cfz 13562 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11181 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-pre-mulgt0 11202 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-er 8697 df-en 8954 df-dom 8955 df-sdom 8956 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-sub 11468 df-neg 11469 df-nn 12259 df-z 12617 df-uz 12889 df-fz 13563 |
| This theorem is used by: elfz1b 13649 elfz1uz 13650 fznnfl 13924 isercoll 15756 incexc2 15928 dvdsssfz1 16409 prmind2 16776 vdwlem6 17079 prmdvdsprmo 17135 odlem2 19667 gexlem2 19710 gexcl2 19717 efgredlemd 19872 efgredlem 19875 ablfac1eu 20203 ablfaclem3 20217 dvdsflf1o 27424 vmasum 27453 logfac2 27454 lgseisenlem1 27612 lgseisenlem2 27613 lgseisenlem3 27614 lgsquadlem1 27617 lgsquadlem2 27618 2sqlem8 27663 chebbnd1lem1 27706 wwlksnredwwlkn0 30365 clwwlkf 30518 psgnfzto1stlem 33541 smatrcl 34307 reprinfz1 35131 poimirlem13 38383 poimirlem15 38385 lcmineqlem4 42899 |
| Copyright terms: Public domain | W3C validator |