| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > elnnz1 | GIF version | ||
| Description: Positive integer property expressed in terms of integers. (Contributed by NM, 10-May-2004.) (Proof shortened by Mario Carneiro, 16-May-2014.) |
| Ref | Expression |
|---|---|
| elnnz1 | ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℤ ∧ 1 ≤ 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnz 9674 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℤ) | |
| 2 | nnge1 9336 | . . 3 ⊢ (𝑁 ∈ ℕ → 1 ≤ 𝑁) | |
| 3 | 1, 2 | jca 306 | . 2 ⊢ (𝑁 ∈ ℕ → (𝑁 ∈ ℤ ∧ 1 ≤ 𝑁)) |
| 4 | 0lt1 8460 | . . . . 5 ⊢ 0 < 1 | |
| 5 | zre 9659 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
| 6 | 0re 8332 | . . . . . . 7 ⊢ 0 ∈ ℝ | |
| 7 | 1re 8331 | . . . . . . 7 ⊢ 1 ∈ ℝ | |
| 8 | ltletr 8421 | . . . . . . 7 ⊢ ((0 ∈ ℝ ∧ 1 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((0 < 1 ∧ 1 ≤ 𝑁) → 0 < 𝑁)) | |
| 9 | 6, 7, 8 | mp3an12 1368 | . . . . . 6 ⊢ (𝑁 ∈ ℝ → ((0 < 1 ∧ 1 ≤ 𝑁) → 0 < 𝑁)) |
| 10 | 5, 9 | syl 14 | . . . . 5 ⊢ (𝑁 ∈ ℤ → ((0 < 1 ∧ 1 ≤ 𝑁) → 0 < 𝑁)) |
| 11 | 4, 10 | mpani 434 | . . . 4 ⊢ (𝑁 ∈ ℤ → (1 ≤ 𝑁 → 0 < 𝑁)) |
| 12 | 11 | imdistani 449 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 1 ≤ 𝑁) → (𝑁 ∈ ℤ ∧ 0 < 𝑁)) |
| 13 | elnnz 9665 | . . 3 ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℤ ∧ 0 < 𝑁)) | |
| 14 | 12, 13 | sylibr 134 | . 2 ⊢ ((𝑁 ∈ ℤ ∧ 1 ≤ 𝑁) → 𝑁 ∈ ℕ) |
| 15 | 3, 14 | impbii 126 | 1 ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℤ ∧ 1 ≤ 𝑁)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2209 class class class wbr 4131 ℝcr 8184 0cc0 8185 1c1 8186 < clt 8366 ≤ cle 8367 ℕcn 9313 ℤcz 9655 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-addcom 8285 ax-addass 8287 ax-distr 8289 ax-i2m1 8290 ax-0lt1 8291 ax-0id 8293 ax-rnegex 8294 ax-cnre 8296 ax-pre-ltirr 8297 ax-pre-ltwlin 8298 ax-pre-lttrn 8299 ax-pre-ltadd 8301 |
| This proof depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-br 4132 df-opab 4194 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-iota 5340 df-fun 5382 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-pnf 8368 df-mnf 8369 df-xr 8370 df-ltxr 8371 df-le 8372 df-sub 8506 df-neg 8507 df-inn 9314 df-z 9656 |
| This theorem is used by: nnzrab 9679 znnnlt1 9703 eluz2b2 10019 elfznn 10477 flqge1nn 10750 resqrexlemdecn 11800 cvgratz 12324 prmdc 12933 4sqlem11 13209 oddennn 13341 nninfdclemlt 13400 psrbaglesuppg 15166 ppiqnncl 16278 bcmono 16304 zabsle1 16323 gausslemma2dlem1a 16382 gausslemma2dlem4 16388 |
| Copyright terms: Public domain | W3C validator |