| 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 12879 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘3) → 𝑁 ∈ (ℤ≥‘2)) | |
| 2 | eluz2nn 12883 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘2) → 𝑁 ∈ ℕ) | |
| 3 | 1, 2 | syl 17 | 1 ⊢ (𝑁 ∈ (ℤ≥‘3) → 𝑁 ∈ ℕ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2141 ‘cfv 6516 ℕcn 12204 2c2 12266 3c3 12267 ℤ≥cuz 12833 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-cnex 11123 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 ax-pre-mulgt0 11144 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-om 7842 df-2nd 7966 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-er 8672 df-en 8922 df-dom 8923 df-sdom 8924 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-nn 12205 df-2 12274 df-3 12275 df-z 12563 df-uz 12834 |
| This theorem is referenced by: eluz5nn 12886 uz3m2nn 12889 modaddid 13914 m1modge3gt1 13925 prmgaplem3 17080 axlowdimlem7 29106 axlowdimlem15 29114 axlowdimlem16 29115 axlowdimlem17 29116 clwwlknonex2 30268 2clwwlk2clwwlklem 30505 numclwlk1lem2 30529 nrt2irr 30632 dffltz 43177 fltltc 43204 fltnltalem 43205 fltnlta 43206 gpgedgvtx1lem 47890 1elfzo1ceilhalf1 47896 modmknepk 47923 modm1p1ne 47931 2timesltsq 47933 2timesltsqm1 47934 lighneallem4a 48178 bgoldbtbndlem2 48389 bgoldbtbndlem3 48390 bgoldbtbndlem4 48391 bgoldbtbnd 48392 gpgvtxel 48630 gpgedgel 48633 gpgprismgriedgdmel 48634 gpgprismgriedgdmss 48635 gpgvtx0 48636 gpgvtx1 48637 opgpgvtx 48638 gpgusgralem 48639 gpgusgra 48640 gpgedgvtx0 48644 gpgedgvtx1 48645 gpgedg2iv 48650 gpg3nbgrvtx0 48659 gpgprismgr4cycllem3 48680 gpgprismgr4cycllem9 48686 gpgprismgr4cycllem10 48687 |
| Copyright terms: Public domain | W3C validator |