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 12903 | . . 3 ⊢ (𝐾 ∈ (1...𝑁) ↔ (𝐾 ∈ (ℤ≥‘1) ∧ 𝑁 ∈ (ℤ≥‘𝐾))) | |
2 | elnnuz 12283 | . . . 4 ⊢ (𝐾 ∈ ℕ ↔ 𝐾 ∈ (ℤ≥‘1)) | |
3 | 2 | anbi1i 625 | . . 3 ⊢ ((𝐾 ∈ ℕ ∧ 𝑁 ∈ (ℤ≥‘𝐾)) ↔ (𝐾 ∈ (ℤ≥‘1) ∧ 𝑁 ∈ (ℤ≥‘𝐾))) |
4 | 1, 3 | bitr4i 280 | . 2 ⊢ (𝐾 ∈ (1...𝑁) ↔ (𝐾 ∈ ℕ ∧ 𝑁 ∈ (ℤ≥‘𝐾))) |
5 | nnz 12005 | . . . . 5 ⊢ (𝐾 ∈ ℕ → 𝐾 ∈ ℤ) | |
6 | eluz 12258 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘𝐾) ↔ 𝐾 ≤ 𝑁)) | |
7 | 5, 6 | sylan 582 | . . . 4 ⊢ ((𝐾 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘𝐾) ↔ 𝐾 ≤ 𝑁)) |
8 | 7 | ancoms 461 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℕ) → (𝑁 ∈ (ℤ≥‘𝐾) ↔ 𝐾 ≤ 𝑁)) |
9 | 8 | pm5.32da 581 | . 2 ⊢ (𝑁 ∈ ℤ → ((𝐾 ∈ ℕ ∧ 𝑁 ∈ (ℤ≥‘𝐾)) ↔ (𝐾 ∈ ℕ ∧ 𝐾 ≤ 𝑁))) |
10 | 4, 9 | syl5bb 285 | 1 ⊢ (𝑁 ∈ ℤ → (𝐾 ∈ (1...𝑁) ↔ (𝐾 ∈ ℕ ∧ 𝐾 ≤ 𝑁))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∈ wcel 2114 class class class wbr 5066 ‘cfv 6355 (class class class)co 7156 1c1 10538 ≤ cle 10676 ℕcn 11638 ℤcz 11982 ℤ≥cuz 12244 ...cfz 12893 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-1st 7689 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-z 11983 df-uz 12245 df-fz 12894 |
This theorem is referenced by: elfz1b 12977 elfz1uz 12978 fznnfl 13231 isercoll 15024 incexc2 15193 dvdsssfz1 15668 prmind2 16029 vdwlem6 16322 prmdvdsprmo 16378 odlem2 18667 gexlem2 18707 gexcl2 18714 efgredlemd 18870 efgredlem 18873 ablfac1eu 19195 ablfaclem3 19209 dvdsflf1o 25764 vmasum 25792 logfac2 25793 lgseisenlem1 25951 lgseisenlem2 25952 lgseisenlem3 25953 lgsquadlem1 25956 lgsquadlem2 25957 2sqlem8 26002 chebbnd1lem1 26045 wwlksnredwwlkn0 27674 clwwlkf 27826 psgnfzto1stlem 30742 smatrcl 31061 reprinfz1 31893 poimirlem13 34920 poimirlem15 34922 |
Copyright terms: Public domain | W3C validator |