![]() |
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 12903 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) ↔ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1)) | |
2 | 1 | orbi2i 912 | . 2 ⊢ ((𝑁 = 1 ∨ 𝑁 ∈ (ℤ≥‘2)) ↔ (𝑁 = 1 ∨ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1))) |
3 | exmidne 2951 | . . 3 ⊢ (𝑁 = 1 ∨ 𝑁 ≠ 1) | |
4 | ordi 1005 | . . 3 ⊢ ((𝑁 = 1 ∨ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1)) ↔ ((𝑁 = 1 ∨ 𝑁 ∈ ℕ) ∧ (𝑁 = 1 ∨ 𝑁 ≠ 1))) | |
5 | 3, 4 | mpbiran2 709 | . 2 ⊢ ((𝑁 = 1 ∨ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1)) ↔ (𝑁 = 1 ∨ 𝑁 ∈ ℕ)) |
6 | 1nn 12220 | . . . . 5 ⊢ 1 ∈ ℕ | |
7 | eleq1 2822 | . . . . 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 867 | . . 3 ⊢ (𝑁 ∈ ℕ → (𝑁 = 1 ∨ 𝑁 ∈ ℕ)) | |
12 | 10, 11 | impbii 208 | . 2 ⊢ ((𝑁 = 1 ∨ 𝑁 ∈ ℕ) ↔ 𝑁 ∈ ℕ) |
13 | 2, 5, 12 | 3bitrri 298 | 1 ⊢ (𝑁 ∈ ℕ ↔ (𝑁 = 1 ∨ 𝑁 ∈ (ℤ≥‘2))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∨ wo 846 = wceq 1542 ∈ wcel 2107 ≠ wne 2941 ‘cfv 6541 1c1 11108 ℕcn 12209 2c2 12264 ℤ≥cuz 12819 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7722 ax-cnex 11163 ax-resscn 11164 ax-1cn 11165 ax-icn 11166 ax-addcl 11167 ax-addrcl 11168 ax-mulcl 11169 ax-mulrcl 11170 ax-mulcom 11171 ax-addass 11172 ax-mulass 11173 ax-distr 11174 ax-i2m1 11175 ax-1ne0 11176 ax-1rid 11177 ax-rnegex 11178 ax-rrecex 11179 ax-cnre 11180 ax-pre-lttri 11181 ax-pre-lttrn 11182 ax-pre-ltadd 11183 ax-pre-mulgt0 11184 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6298 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6493 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7362 df-ov 7409 df-oprab 7410 df-mpo 7411 df-om 7853 df-2nd 7973 df-frecs 8263 df-wrecs 8294 df-recs 8368 df-rdg 8407 df-er 8700 df-en 8937 df-dom 8938 df-sdom 8939 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11443 df-neg 11444 df-nn 12210 df-2 12272 df-n0 12470 df-z 12556 df-uz 12820 |
This theorem is referenced by: indstr2 12908 fldiv4lem1div2 13799 relexpaddg 14997 dfphi2 16704 pc2dvds 16809 oddprmdvds 16833 prmreclem3 16848 4sqlem18 16892 vdwlem13 16923 efgs1b 19599 efgredlema 19603 ablfacrplem 19930 ablsimpgprmd 19980 bposlem2 26778 ostthlem1 27120 ostth 27132 psgnfzto1stlem 32247 subfacval3 34169 aks4d1p5 40934 jm2.23 41721 expdioph 41748 relexpaddss 42455 stirlinglem12 44788 fmtnofac1 46225 lighneallem2 46261 nn0o1gt2ALTV 46349 ztprmneprm 46977 nn0sumshdiglemB 47260 |
Copyright terms: Public domain | W3C validator |