| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eluz2b2 | 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 |
|---|---|
| eluz2b2 | ⊢ (𝑁 ∈ (ℤ≥‘2) ↔ (𝑁 ∈ ℕ ∧ 1 < 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluz2b1 13039 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘2) ↔ (𝑁 ∈ ℤ ∧ 1 < 𝑁)) | |
| 2 | 1re 11301 | . . . . . . 7 ⊢ 1 ∈ ℝ | |
| 3 | zre 12690 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
| 4 | ltle 11391 | . . . . . . 7 ⊢ ((1 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (1 < 𝑁 → 1 ≤ 𝑁)) | |
| 5 | 2, 3, 4 | sylancr 599 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → (1 < 𝑁 → 1 ≤ 𝑁)) |
| 6 | 5 | imdistani 579 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 1 < 𝑁) → (𝑁 ∈ ℤ ∧ 1 ≤ 𝑁)) |
| 7 | elnnz1 12715 | . . . . 5 ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℤ ∧ 1 ≤ 𝑁)) | |
| 8 | 6, 7 | sylibr 237 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ 1 < 𝑁) → 𝑁 ∈ ℕ) |
| 9 | simpr 490 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ 1 < 𝑁) → 1 < 𝑁) | |
| 10 | 8, 9 | jca 521 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 1 < 𝑁) → (𝑁 ∈ ℕ ∧ 1 < 𝑁)) |
| 11 | nnz 12707 | . . . 4 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℤ) | |
| 12 | 11 | anim1i 627 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 1 < 𝑁) → (𝑁 ∈ ℤ ∧ 1 < 𝑁)) |
| 13 | 10, 12 | impbii 212 | . 2 ⊢ ((𝑁 ∈ ℤ ∧ 1 < 𝑁) ↔ (𝑁 ∈ ℕ ∧ 1 < 𝑁)) |
| 14 | 1, 13 | bitri 278 | 1 ⊢ (𝑁 ∈ (ℤ≥‘2) ↔ (𝑁 ∈ ℕ ∧ 1 < 𝑁)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2145 class class class wbr 5103 ‘cfv 6537 ℝcr 11192 1c1 11194 < clt 11336 ≤ cle 11337 ℕcn 12328 2c2 12390 ℤcz 12686 ℤ≥cuz 12958 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-er 8710 df-en 8967 df-dom 8968 df-sdom 8969 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-nn 12329 df-2 12398 df-n0 12600 df-z 12687 df-uz 12959 |
| This theorem is used by: eluz2b3 13042 nprmi 16857 ge2nprmge4 16870 pockthlem 17076 prmunb 17085 prmlem1a 17277 sylow3lem6 19839 chtge0 27432 muval1 27453 chtwordi 27476 vma1 27486 mersenne 27547 perfectlem2 27550 lgsne0 27655 chtppilimlem1 27793 padicabvcxp 27952 ostth2lem3 27955 ostth2lem4 27956 ostth2 27957 ostth3 27958 umgr2cwwkdifex 30649 ex-mod 31043 rmspecnonsq 43893 rmspecfund 43895 ltrmxnn0 43935 itgsinexp 46934 wallispilem3 47046 fmtno4prm 48629 perfectALTVlem2 48789 |
| Copyright terms: Public domain | W3C validator |