| 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 12825 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘3) → 𝑁 ∈ (ℤ≥‘2)) | |
| 2 | eluz2nn 12829 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘2) → 𝑁 ∈ ℕ) | |
| 3 | 1, 2 | syl 17 | 1 ⊢ (𝑁 ∈ (ℤ≥‘3) → 𝑁 ∈ ℕ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2114 ‘cfv 6492 ℕcn 12165 2c2 12227 3c3 12228 ℤ≥cuz 12779 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-2 12235 df-3 12236 df-z 12516 df-uz 12780 |
| This theorem is referenced by: eluz5nn 12832 uz3m2nn 12835 modaddid 13860 m1modge3gt1 13871 prmgaplem3 17015 axlowdimlem7 29031 axlowdimlem15 29039 axlowdimlem16 29040 axlowdimlem17 29041 clwwlknonex2 30194 2clwwlk2clwwlklem 30431 numclwlk1lem2 30455 nrt2irr 30558 dffltz 43081 fltltc 43108 fltnltalem 43109 fltnlta 43110 gpgedgvtx1lem 47795 1elfzo1ceilhalf1 47801 modmknepk 47828 modm1p1ne 47836 2timesltsq 47838 2timesltsqm1 47839 lighneallem4a 48083 bgoldbtbndlem2 48294 bgoldbtbndlem3 48295 bgoldbtbndlem4 48296 bgoldbtbnd 48297 gpgvtxel 48535 gpgedgel 48538 gpgprismgriedgdmel 48539 gpgprismgriedgdmss 48540 gpgvtx0 48541 gpgvtx1 48542 opgpgvtx 48543 gpgusgralem 48544 gpgusgra 48545 gpgedgvtx0 48549 gpgedgvtx1 48550 gpgedg2iv 48555 gpg3nbgrvtx0 48564 gpgprismgr4cycllem3 48585 gpgprismgr4cycllem9 48591 gpgprismgr4cycllem10 48592 |
| Copyright terms: Public domain | W3C validator |