![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > eluz2b3 | Structured version Visualization version GIF version |
Description: Two ways to say "an integer greater than or equal to 2." (Contributed by Paul Chapman, 23-Nov-2012.) |
Ref | Expression |
---|---|
eluz2b3 | ⊢ (𝑁 ∈ (ℤ≥‘2) ↔ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eluz2b2 11954 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘2) ↔ (𝑁 ∈ ℕ ∧ 1 < 𝑁)) | |
2 | nngt1ne1 11239 | . . 3 ⊢ (𝑁 ∈ ℕ → (1 < 𝑁 ↔ 𝑁 ≠ 1)) | |
3 | 2 | pm5.32i 672 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 1 < 𝑁) ↔ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1)) |
4 | 1, 3 | bitri 264 | 1 ⊢ (𝑁 ∈ (ℤ≥‘2) ↔ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 196 ∧ wa 383 ∈ wcel 2139 ≠ wne 2932 class class class wbr 4804 ‘cfv 6049 1c1 10129 < clt 10266 ℕcn 11212 2c2 11262 ℤ≥cuz 11879 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1871 ax-4 1886 ax-5 1988 ax-6 2054 ax-7 2090 ax-8 2141 ax-9 2148 ax-10 2168 ax-11 2183 ax-12 2196 ax-13 2391 ax-ext 2740 ax-sep 4933 ax-nul 4941 ax-pow 4992 ax-pr 5055 ax-un 7114 ax-cnex 10184 ax-resscn 10185 ax-1cn 10186 ax-icn 10187 ax-addcl 10188 ax-addrcl 10189 ax-mulcl 10190 ax-mulrcl 10191 ax-mulcom 10192 ax-addass 10193 ax-mulass 10194 ax-distr 10195 ax-i2m1 10196 ax-1ne0 10197 ax-1rid 10198 ax-rnegex 10199 ax-rrecex 10200 ax-cnre 10201 ax-pre-lttri 10202 ax-pre-lttrn 10203 ax-pre-ltadd 10204 ax-pre-mulgt0 10205 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1635 df-ex 1854 df-nf 1859 df-sb 2047 df-eu 2611 df-mo 2612 df-clab 2747 df-cleq 2753 df-clel 2756 df-nfc 2891 df-ne 2933 df-nel 3036 df-ral 3055 df-rex 3056 df-reu 3057 df-rab 3059 df-v 3342 df-sbc 3577 df-csb 3675 df-dif 3718 df-un 3720 df-in 3722 df-ss 3729 df-pss 3731 df-nul 4059 df-if 4231 df-pw 4304 df-sn 4322 df-pr 4324 df-tp 4326 df-op 4328 df-uni 4589 df-iun 4674 df-br 4805 df-opab 4865 df-mpt 4882 df-tr 4905 df-id 5174 df-eprel 5179 df-po 5187 df-so 5188 df-fr 5225 df-we 5227 df-xp 5272 df-rel 5273 df-cnv 5274 df-co 5275 df-dm 5276 df-rn 5277 df-res 5278 df-ima 5279 df-pred 5841 df-ord 5887 df-on 5888 df-lim 5889 df-suc 5890 df-iota 6012 df-fun 6051 df-fn 6052 df-f 6053 df-f1 6054 df-fo 6055 df-f1o 6056 df-fv 6057 df-riota 6774 df-ov 6816 df-oprab 6817 df-mpt2 6818 df-om 7231 df-wrecs 7576 df-recs 7637 df-rdg 7675 df-er 7911 df-en 8122 df-dom 8123 df-sdom 8124 df-pnf 10268 df-mnf 10269 df-xr 10270 df-ltxr 10271 df-le 10272 df-sub 10460 df-neg 10461 df-nn 11213 df-2 11271 df-n0 11485 df-z 11570 df-uz 11880 |
This theorem is referenced by: 1nuz2 11957 elnn1uz2 11958 nn01to3 11974 relexpuzrel 13991 nno 15300 ncoprmgcdne1b 15565 isprm2 15597 isprm4 15599 rpexp 15634 dfphi2 15681 dvdsprmpweqnn 15791 expnprm 15808 prmirredlem 20043 domnchr 20082 ovolicc1 23484 musum 25116 lgsne0 25259 2sqlem8a 25349 2sqlem8 25350 2sqlem9 25351 frgrregord013 27563 2sqcoprm 29956 ballotlemic 30877 ballotlem1c 30878 signstfveq0a 30962 subfacp1lem3 31471 stoweidlem14 40734 lighneallem3 42034 lighneallem4 42037 eluz2cnn0n1 42811 |
Copyright terms: Public domain | W3C validator |