| 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 12863 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘2) ↔ (𝑁 ∈ ℤ ∧ 1 < 𝑁)) | |
| 2 | 1re 11138 | . . . . . . 7 ⊢ 1 ∈ ℝ | |
| 3 | zre 12522 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
| 4 | ltle 11228 | . . . . . . 7 ⊢ ((1 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (1 < 𝑁 → 1 ≤ 𝑁)) | |
| 5 | 2, 3, 4 | sylancr 588 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → (1 < 𝑁 → 1 ≤ 𝑁)) |
| 6 | 5 | imdistani 568 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 1 < 𝑁) → (𝑁 ∈ ℤ ∧ 1 ≤ 𝑁)) |
| 7 | elnnz1 12547 | . . . . 5 ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℤ ∧ 1 ≤ 𝑁)) | |
| 8 | 6, 7 | sylibr 234 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ 1 < 𝑁) → 𝑁 ∈ ℕ) |
| 9 | simpr 484 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ 1 < 𝑁) → 1 < 𝑁) | |
| 10 | 8, 9 | jca 511 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 1 < 𝑁) → (𝑁 ∈ ℕ ∧ 1 < 𝑁)) |
| 11 | nnz 12539 | . . . 4 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℤ) | |
| 12 | 11 | anim1i 616 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 1 < 𝑁) → (𝑁 ∈ ℤ ∧ 1 < 𝑁)) |
| 13 | 10, 12 | impbii 209 | . 2 ⊢ ((𝑁 ∈ ℤ ∧ 1 < 𝑁) ↔ (𝑁 ∈ ℕ ∧ 1 < 𝑁)) |
| 14 | 1, 13 | bitri 275 | 1 ⊢ (𝑁 ∈ (ℤ≥‘2) ↔ (𝑁 ∈ ℕ ∧ 1 < 𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2114 class class class wbr 5086 ‘cfv 6493 ℝcr 11031 1c1 11033 < clt 11173 ≤ cle 11174 ℕcn 12168 2c2 12230 ℤcz 12518 ℤ≥cuz 12782 |
| 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 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 ax-cnex 11088 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-mulcom 11096 ax-addass 11097 ax-mulass 11098 ax-distr 11099 ax-i2m1 11100 ax-1ne0 11101 ax-1rid 11102 ax-rnegex 11103 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 ax-pre-ltadd 11108 ax-pre-mulgt0 11109 |
| 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 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-2nd 7937 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11175 df-mnf 11176 df-xr 11177 df-ltxr 11178 df-le 11179 df-sub 11373 df-neg 11374 df-nn 12169 df-2 12238 df-n0 12432 df-z 12519 df-uz 12783 |
| This theorem is referenced by: eluz2b3 12866 nprmi 16652 ge2nprmge4 16665 pockthlem 16870 prmunb 16879 prmlem1a 17071 sylow3lem6 19601 chtge0 27092 muval1 27113 chtwordi 27136 vma1 27146 mersenne 27207 perfectlem2 27210 lgsne0 27315 chtppilimlem1 27453 padicabvcxp 27612 ostth2lem3 27615 ostth2lem4 27616 ostth2 27617 ostth3 27618 umgr2cwwkdifex 30153 ex-mod 30537 rmspecnonsq 43356 rmspecfund 43358 ltrmxnn0 43398 itgsinexp 46404 wallispilem3 46516 fmtno4prm 48053 perfectALTVlem2 48213 |
| Copyright terms: Public domain | W3C validator |