| 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 12996 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) ↔ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1)) | |
| 2 | 1 | orbi2i 926 | . 2 ⊢ ((𝑁 = 1 ∨ 𝑁 ∈ (ℤ≥‘2)) ↔ (𝑁 = 1 ∨ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1))) |
| 3 | exmidne 2965 | . . 3 ⊢ (𝑁 = 1 ∨ 𝑁 ≠ 1) | |
| 4 | ordi 1023 | . . 3 ⊢ ((𝑁 = 1 ∨ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1)) ↔ ((𝑁 = 1 ∨ 𝑁 ∈ ℕ) ∧ (𝑁 = 1 ∨ 𝑁 ≠ 1))) | |
| 5 | 3, 4 | mpbiran2 723 | . 2 ⊢ ((𝑁 = 1 ∨ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1)) ↔ (𝑁 = 1 ∨ 𝑁 ∈ ℕ)) |
| 6 | 1nn 12293 | . . . . 5 ⊢ 1 ∈ ℕ | |
| 7 | eleq1 2848 | . . . . 5 ⊢ (𝑁 = 1 → (𝑁 ∈ ℕ ↔ 1 ∈ ℕ)) | |
| 8 | 6, 7 | mpbiri 261 | . . . 4 ⊢ (𝑁 = 1 → 𝑁 ∈ ℕ) |
| 9 | pm2.621 912 | . . . 4 ⊢ ((𝑁 = 1 → 𝑁 ∈ ℕ) → ((𝑁 = 1 ∨ 𝑁 ∈ ℕ) → 𝑁 ∈ ℕ)) | |
| 10 | 8, 9 | ax-mp 5 | . . 3 ⊢ ((𝑁 = 1 ∨ 𝑁 ∈ ℕ) → 𝑁 ∈ ℕ) |
| 11 | olc 882 | . . 3 ⊢ (𝑁 ∈ ℕ → (𝑁 = 1 ∨ 𝑁 ∈ ℕ)) | |
| 12 | 10, 11 | impbii 212 | . 2 ⊢ ((𝑁 = 1 ∨ 𝑁 ∈ ℕ) ↔ 𝑁 ∈ ℕ) |
| 13 | 2, 5, 12 | 3bitrri 301 | 1 ⊢ (𝑁 ∈ ℕ ↔ (𝑁 = 1 ∨ 𝑁 ∈ (ℤ≥‘2))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 ‘cfv 6535 1c1 11150 ℕcn 12282 2c2 12344 ℤ≥cuz 12912 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7742 ax-cnex 11205 ax-resscn 11206 ax-1cn 11207 ax-icn 11208 ax-addcl 11209 ax-addrcl 11210 ax-mulcl 11211 ax-mulrcl 11212 ax-mulcom 11213 ax-addass 11214 ax-mulass 11215 ax-distr 11216 ax-i2m1 11217 ax-1ne0 11218 ax-1rid 11219 ax-rnegex 11220 ax-rrecex 11221 ax-cnre 11222 ax-pre-lttri 11223 ax-pre-lttrn 11224 ax-pre-ltadd 11225 ax-pre-mulgt0 11226 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6301 df-ord 6362 df-on 6363 df-lim 6364 df-suc 6365 df-iota 6491 df-fun 6537 df-fn 6538 df-f 6539 df-f1 6540 df-fo 6541 df-f1o 6542 df-fv 6543 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7869 df-2nd 7993 df-frecs 8285 df-wrecs 8316 df-recs 8365 df-rdg 8404 df-er 8703 df-en 8960 df-dom 8961 df-sdom 8962 df-pnf 11294 df-mnf 11295 df-xr 11296 df-ltxr 11297 df-le 11298 df-sub 11492 df-neg 11493 df-nn 12283 df-2 12352 df-n0 12554 df-z 12641 df-uz 12913 |
| This theorem is used by: indstr2 13001 fldiv4lem1div2 13923 relexpaddg 15151 dfphi2 16890 pc2dvds 16996 oddprmdvds 17020 prmreclem3 17035 4sqlem18 17079 vdwlem13 17110 efgs1b 19889 efgredlema 19893 ablfacrplem 20220 ablsimpgprmd 20270 bposlem2 27553 ostthlem1 27895 ostth 27907 psgnfzto1stlem 33572 subfacval3 35851 aks4d1p5 43011 jm2.23 43902 expdioph 43929 relexpaddss 44623 stirlinglem12 46978 nnmul2 48283 ceilhalfnn 48293 fmtnofac1 48538 lighneallem2 48574 ppivalnn 48600 nn0o1gt2ALTV 48675 ztprmneprm 49342 nn0sumshdiglemB 49615 |
| Copyright terms: Public domain | W3C validator |