| 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 12888 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) ↔ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1)) | |
| 2 | 1 | orbi2i 912 | . 2 ⊢ ((𝑁 = 1 ∨ 𝑁 ∈ (ℤ≥‘2)) ↔ (𝑁 = 1 ∨ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1))) |
| 3 | exmidne 2936 | . . 3 ⊢ (𝑁 = 1 ∨ 𝑁 ≠ 1) | |
| 4 | ordi 1007 | . . 3 ⊢ ((𝑁 = 1 ∨ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1)) ↔ ((𝑁 = 1 ∨ 𝑁 ∈ ℕ) ∧ (𝑁 = 1 ∨ 𝑁 ≠ 1))) | |
| 5 | 3, 4 | mpbiran2 710 | . 2 ⊢ ((𝑁 = 1 ∨ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1)) ↔ (𝑁 = 1 ∨ 𝑁 ∈ ℕ)) |
| 6 | 1nn 12204 | . . . . 5 ⊢ 1 ∈ ℕ | |
| 7 | eleq1 2817 | . . . . 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 2926 ‘cfv 6514 1c1 11076 ℕcn 12193 2c2 12248 ℤ≥cuz 12800 |
| 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 2702 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 |
| 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 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7846 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-nn 12194 df-2 12256 df-n0 12450 df-z 12537 df-uz 12801 |
| This theorem is referenced by: indstr2 12893 fldiv4lem1div2 13806 relexpaddg 15026 dfphi2 16751 pc2dvds 16857 oddprmdvds 16881 prmreclem3 16896 4sqlem18 16940 vdwlem13 16971 efgs1b 19673 efgredlema 19677 ablfacrplem 20004 ablsimpgprmd 20054 bposlem2 27203 ostthlem1 27545 ostth 27557 psgnfzto1stlem 33064 subfacval3 35183 aks4d1p5 42075 jm2.23 42992 expdioph 43019 relexpaddss 43714 stirlinglem12 46090 ceilhalfnn 47341 fmtnofac1 47575 lighneallem2 47611 nn0o1gt2ALTV 47699 ztprmneprm 48339 nn0sumshdiglemB 48613 |
| Copyright terms: Public domain | W3C validator |