| 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 12967 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) ↔ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1)) | |
| 2 | 1 | orbi2i 926 | . 2 ⊢ ((𝑁 = 1 ∨ 𝑁 ∈ (ℤ≥‘2)) ↔ (𝑁 = 1 ∨ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1))) |
| 3 | exmidne 2970 | . . 3 ⊢ (𝑁 = 1 ∨ 𝑁 ≠ 1) | |
| 4 | ordi 1023 | . . 3 ⊢ ((𝑁 = 1 ∨ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1)) ↔ ((𝑁 = 1 ∨ 𝑁 ∈ ℕ) ∧ (𝑁 = 1 ∨ 𝑁 ≠ 1))) | |
| 5 | 3, 4 | mpbiran2 723 | . 2 ⊢ ((𝑁 = 1 ∨ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1)) ↔ (𝑁 = 1 ∨ 𝑁 ∈ ℕ)) |
| 6 | 1nn 12264 | . . . . 5 ⊢ 1 ∈ ℕ | |
| 7 | eleq1 2853 | . . . . 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 2146 ≠ wne 2960 ‘cfv 6541 1c1 11121 ℕcn 12253 2c2 12315 ℤ≥cuz 12883 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7743 ax-cnex 11176 ax-resscn 11177 ax-1cn 11178 ax-icn 11179 ax-addcl 11180 ax-addrcl 11181 ax-mulcl 11182 ax-mulrcl 11183 ax-mulcom 11184 ax-addass 11185 ax-mulass 11186 ax-distr 11187 ax-i2m1 11188 ax-1ne0 11189 ax-1rid 11190 ax-rnegex 11191 ax-rrecex 11192 ax-cnre 11193 ax-pre-lttri 11194 ax-pre-lttrn 11195 ax-pre-ltadd 11196 ax-pre-mulgt0 11197 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7870 df-2nd 7994 df-frecs 8285 df-wrecs 8316 df-recs 8365 df-rdg 8404 df-er 8701 df-en 8951 df-dom 8952 df-sdom 8953 df-pnf 11265 df-mnf 11266 df-xr 11267 df-ltxr 11268 df-le 11269 df-sub 11463 df-neg 11464 df-nn 12254 df-2 12323 df-n0 12525 df-z 12612 df-uz 12884 |
| This theorem is used by: indstr2 12972 fldiv4lem1div2 13893 relexpaddg 15119 dfphi2 16860 pc2dvds 16966 oddprmdvds 16990 prmreclem3 17005 4sqlem18 17049 vdwlem13 17080 efgs1b 19855 efgredlema 19859 ablfacrplem 20186 ablsimpgprmd 20236 bposlem2 27505 ostthlem1 27847 ostth 27859 psgnfzto1stlem 33489 subfacval3 35723 aks4d1p5 42910 jm2.23 43801 expdioph 43828 relexpaddss 44522 stirlinglem12 46877 nnmul2 48145 ceilhalfnn 48155 fmtnofac1 48400 lighneallem2 48436 ppivalnn 48462 nn0o1gt2ALTV 48537 ztprmneprm 49204 nn0sumshdiglemB 49477 |
| Copyright terms: Public domain | W3C validator |