| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elnn1uz2 | Structured version Visualization version GIF version | ||
| Description: A positive integer is either 1 or greater than or equal to 2. (Contributed by Paul Chapman, 17-Nov-2012.) |
| Ref | Expression |
|---|---|
| elnn1uz2 | ⊢ (𝑁 ∈ ℕ ↔ (𝑁 = 1 ∨ 𝑁 ∈ (ℤ≥‘2))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluz2b3 12823 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) ↔ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1)) | |
| 2 | 1 | orbi2i 912 | . 2 ⊢ ((𝑁 = 1 ∨ 𝑁 ∈ (ℤ≥‘2)) ↔ (𝑁 = 1 ∨ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1))) |
| 3 | exmidne 2935 | . . 3 ⊢ (𝑁 = 1 ∨ 𝑁 ≠ 1) | |
| 4 | ordi 1007 | . . 3 ⊢ ((𝑁 = 1 ∨ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1)) ↔ ((𝑁 = 1 ∨ 𝑁 ∈ ℕ) ∧ (𝑁 = 1 ∨ 𝑁 ≠ 1))) | |
| 5 | 3, 4 | mpbiran2 710 | . 2 ⊢ ((𝑁 = 1 ∨ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1)) ↔ (𝑁 = 1 ∨ 𝑁 ∈ ℕ)) |
| 6 | 1nn 12139 | . . . . 5 ⊢ 1 ∈ ℕ | |
| 7 | eleq1 2816 | . . . . 5 ⊢ (𝑁 = 1 → (𝑁 ∈ ℕ ↔ 1 ∈ ℕ)) | |
| 8 | 6, 7 | mpbiri 258 | . . . 4 ⊢ (𝑁 = 1 → 𝑁 ∈ ℕ) |
| 9 | pm2.621 898 | . . . 4 ⊢ ((𝑁 = 1 → 𝑁 ∈ ℕ) → ((𝑁 = 1 ∨ 𝑁 ∈ ℕ) → 𝑁 ∈ ℕ)) | |
| 10 | 8, 9 | ax-mp 5 | . . 3 ⊢ ((𝑁 = 1 ∨ 𝑁 ∈ ℕ) → 𝑁 ∈ ℕ) |
| 11 | olc 868 | . . 3 ⊢ (𝑁 ∈ ℕ → (𝑁 = 1 ∨ 𝑁 ∈ ℕ)) | |
| 12 | 10, 11 | impbii 209 | . 2 ⊢ ((𝑁 = 1 ∨ 𝑁 ∈ ℕ) ↔ 𝑁 ∈ ℕ) |
| 13 | 2, 5, 12 | 3bitrri 298 | 1 ⊢ (𝑁 ∈ ℕ ↔ (𝑁 = 1 ∨ 𝑁 ∈ (ℤ≥‘2))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ‘cfv 6482 1c1 11010 ℕcn 12128 2c2 12183 ℤ≥cuz 12735 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 ax-cnex 11065 ax-resscn 11066 ax-1cn 11067 ax-icn 11068 ax-addcl 11069 ax-addrcl 11070 ax-mulcl 11071 ax-mulrcl 11072 ax-mulcom 11073 ax-addass 11074 ax-mulass 11075 ax-distr 11076 ax-i2m1 11077 ax-1ne0 11078 ax-1rid 11079 ax-rnegex 11080 ax-rrecex 11081 ax-cnre 11082 ax-pre-lttri 11083 ax-pre-lttrn 11084 ax-pre-ltadd 11085 ax-pre-mulgt0 11086 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6249 df-ord 6310 df-on 6311 df-lim 6312 df-suc 6313 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-riota 7306 df-ov 7352 df-oprab 7353 df-mpo 7354 df-om 7800 df-2nd 7925 df-frecs 8214 df-wrecs 8245 df-recs 8294 df-rdg 8332 df-er 8625 df-en 8873 df-dom 8874 df-sdom 8875 df-pnf 11151 df-mnf 11152 df-xr 11153 df-ltxr 11154 df-le 11155 df-sub 11349 df-neg 11350 df-nn 12129 df-2 12191 df-n0 12385 df-z 12472 df-uz 12736 |
| This theorem is referenced by: indstr2 12828 fldiv4lem1div2 13741 relexpaddg 14960 dfphi2 16685 pc2dvds 16791 oddprmdvds 16815 prmreclem3 16830 4sqlem18 16874 vdwlem13 16905 efgs1b 19615 efgredlema 19619 ablfacrplem 19946 ablsimpgprmd 19996 bposlem2 27194 ostthlem1 27536 ostth 27548 psgnfzto1stlem 33043 subfacval3 35172 aks4d1p5 42063 jm2.23 42979 expdioph 43006 relexpaddss 43701 stirlinglem12 46076 ceilhalfnn 47330 fmtnofac1 47564 lighneallem2 47600 nn0o1gt2ALTV 47688 ztprmneprm 48341 nn0sumshdiglemB 48615 |
| Copyright terms: Public domain | W3C validator |