Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > elnnz1 | Structured version Visualization version 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 12003 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℤ) | |
2 | nnge1 11664 | . . 3 ⊢ (𝑁 ∈ ℕ → 1 ≤ 𝑁) | |
3 | 1, 2 | jca 514 | . 2 ⊢ (𝑁 ∈ ℕ → (𝑁 ∈ ℤ ∧ 1 ≤ 𝑁)) |
4 | 0lt1 11161 | . . . . 5 ⊢ 0 < 1 | |
5 | 0re 10642 | . . . . . 6 ⊢ 0 ∈ ℝ | |
6 | 1re 10640 | . . . . . 6 ⊢ 1 ∈ ℝ | |
7 | zre 11984 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
8 | ltletr 10731 | . . . . . 6 ⊢ ((0 ∈ ℝ ∧ 1 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((0 < 1 ∧ 1 ≤ 𝑁) → 0 < 𝑁)) | |
9 | 5, 6, 7, 8 | mp3an12i 1461 | . . . . 5 ⊢ (𝑁 ∈ ℤ → ((0 < 1 ∧ 1 ≤ 𝑁) → 0 < 𝑁)) |
10 | 4, 9 | mpani 694 | . . . 4 ⊢ (𝑁 ∈ ℤ → (1 ≤ 𝑁 → 0 < 𝑁)) |
11 | 10 | imdistani 571 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 1 ≤ 𝑁) → (𝑁 ∈ ℤ ∧ 0 < 𝑁)) |
12 | elnnz 11990 | . . 3 ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℤ ∧ 0 < 𝑁)) | |
13 | 11, 12 | sylibr 236 | . 2 ⊢ ((𝑁 ∈ ℤ ∧ 1 ≤ 𝑁) → 𝑁 ∈ ℕ) |
14 | 3, 13 | impbii 211 | 1 ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℤ ∧ 1 ≤ 𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∈ wcel 2110 class class class wbr 5065 ℝcr 10535 0cc0 10536 1c1 10537 < clt 10674 ≤ cle 10675 ℕcn 11637 ℤcz 11980 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-ord 6193 df-on 6194 df-lim 6195 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-om 7580 df-wrecs 7946 df-recs 8007 df-rdg 8045 df-er 8288 df-en 8509 df-dom 8510 df-sdom 8511 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 df-nn 11638 df-z 11981 |
This theorem is referenced by: znnnlt1 12008 nnzrab 12009 eluz2b2 12320 elfznn 12935 elfz1b 12975 flge1nn 13190 gcdcllem3 15849 4sqlem11 16290 ovolunlem1a 24096 ovoliunlem1 24102 ppinncl 25750 bcmono 25852 zabsle1 25871 gausslemma2dlem1a 25940 gausslemma2dlem4 25944 axlowdimlem16 26742 nndiffz1 30508 tgoldbachgnn 31930 poimirlem7 34898 fz1eqin 39364 lzenom 39365 dirkertrigeqlem3 42384 |
Copyright terms: Public domain | W3C validator |