| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eluz3nn | Structured version Visualization version GIF version | ||
| Description: An integer greater than or equal to 3 is a positive integer. (Contributed by Alexander van der Vekens, 17-Sep-2018.) (Proof shortened by AV, 30-Nov-2025.) |
| Ref | Expression |
|---|---|
| eluz3nn | ⊢ (𝑁 ∈ (ℤ≥‘3) → 𝑁 ∈ ℕ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uzuzle23 12903 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘3) → 𝑁 ∈ (ℤ≥‘2)) | |
| 2 | eluz2nn 12907 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘2) → 𝑁 ∈ ℕ) | |
| 3 | 1, 2 | syl 18 | 1 ⊢ (𝑁 ∈ (ℤ≥‘3) → 𝑁 ∈ ℕ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2143 ‘cfv 6536 ℕcn 12228 2c2 12290 3c3 12291 ℤ≥cuz 12857 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-nn 12229 df-2 12298 df-3 12299 df-z 12587 df-uz 12858 |
| This theorem is referenced by: eluz5nn 12910 uz3m2nn 12913 modaddid 13939 m1modge3gt1 13950 prmgaplem3 17108 axlowdimlem7 29298 axlowdimlem15 29306 axlowdimlem16 29307 axlowdimlem17 29308 clwwlknonex2 30460 2clwwlk2clwwlklem 30697 numclwlk1lem2 30721 nrt2irr 30824 dffltz 43366 fltltc 43393 fltnltalem 43394 fltnlta 43395 gpgedgvtx1lem 48072 1elfzo1ceilhalf1 48078 modmknepk 48105 modm1p1ne 48113 2timesltsq 48115 2timesltsqm1 48116 lighneallem4a 48360 bgoldbtbndlem2 48571 bgoldbtbndlem3 48572 bgoldbtbndlem4 48573 bgoldbtbnd 48574 gpgvtxel 48812 gpgedgel 48815 gpgprismgriedgdmel 48816 gpgprismgriedgdmss 48817 gpgvtx0 48818 gpgvtx1 48819 opgpgvtx 48820 gpgusgralem 48821 gpgusgra 48822 gpgedgvtx0 48826 gpgedgvtx1 48827 gpgedg2iv 48832 gpg3nbgrvtx0 48841 gpgprismgr4cycllem3 48862 gpgprismgr4cycllem9 48868 gpgprismgr4cycllem10 48869 |
| Copyright terms: Public domain | W3C validator |