![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > nn0lt2 | Structured version Visualization version GIF version |
Description: A nonnegative integer less than 2 must be 0 or 1. (Contributed by Alexander van der Vekens, 16-Sep-2018.) |
Ref | Expression |
---|---|
nn0lt2 | ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 < 2) → (𝑁 = 0 ∨ 𝑁 = 1)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | olc 866 | . . 3 ⊢ (𝑁 = 1 → (𝑁 = 0 ∨ 𝑁 = 1)) | |
2 | 1 | a1d 25 | . 2 ⊢ (𝑁 = 1 → ((𝑁 ∈ ℕ0 ∧ 𝑁 < 2) → (𝑁 = 0 ∨ 𝑁 = 1))) |
3 | nn0z 12619 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ) | |
4 | 2z 12630 | . . . . . . 7 ⊢ 2 ∈ ℤ | |
5 | zltlem1 12651 | . . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ 2 ∈ ℤ) → (𝑁 < 2 ↔ 𝑁 ≤ (2 − 1))) | |
6 | 3, 4, 5 | sylancl 584 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (𝑁 < 2 ↔ 𝑁 ≤ (2 − 1))) |
7 | 2m1e1 12374 | . . . . . . 7 ⊢ (2 − 1) = 1 | |
8 | 7 | breq2i 5158 | . . . . . 6 ⊢ (𝑁 ≤ (2 − 1) ↔ 𝑁 ≤ 1) |
9 | 6, 8 | bitrdi 286 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (𝑁 < 2 ↔ 𝑁 ≤ 1)) |
10 | necom 2990 | . . . . . 6 ⊢ (𝑁 ≠ 1 ↔ 1 ≠ 𝑁) | |
11 | nn0re 12517 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
12 | 1re 11250 | . . . . . . . . 9 ⊢ 1 ∈ ℝ | |
13 | ltlen 11351 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℝ ∧ 1 ∈ ℝ) → (𝑁 < 1 ↔ (𝑁 ≤ 1 ∧ 1 ≠ 𝑁))) | |
14 | 11, 12, 13 | sylancl 584 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → (𝑁 < 1 ↔ (𝑁 ≤ 1 ∧ 1 ≠ 𝑁))) |
15 | nn0lt10b 12660 | . . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ0 → (𝑁 < 1 ↔ 𝑁 = 0)) | |
16 | 15 | biimpa 475 | . . . . . . . . . 10 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 < 1) → 𝑁 = 0) |
17 | 16 | orcd 871 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 < 1) → (𝑁 = 0 ∨ 𝑁 = 1)) |
18 | 17 | ex 411 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → (𝑁 < 1 → (𝑁 = 0 ∨ 𝑁 = 1))) |
19 | 14, 18 | sylbird 259 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 ≤ 1 ∧ 1 ≠ 𝑁) → (𝑁 = 0 ∨ 𝑁 = 1))) |
20 | 19 | expd 414 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ≤ 1 → (1 ≠ 𝑁 → (𝑁 = 0 ∨ 𝑁 = 1)))) |
21 | 10, 20 | syl7bi 254 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ≤ 1 → (𝑁 ≠ 1 → (𝑁 = 0 ∨ 𝑁 = 1)))) |
22 | 9, 21 | sylbid 239 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (𝑁 < 2 → (𝑁 ≠ 1 → (𝑁 = 0 ∨ 𝑁 = 1)))) |
23 | 22 | imp 405 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 < 2) → (𝑁 ≠ 1 → (𝑁 = 0 ∨ 𝑁 = 1))) |
24 | 23 | com12 32 | . 2 ⊢ (𝑁 ≠ 1 → ((𝑁 ∈ ℕ0 ∧ 𝑁 < 2) → (𝑁 = 0 ∨ 𝑁 = 1))) |
25 | 2, 24 | pm2.61ine 3021 | 1 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 < 2) → (𝑁 = 0 ∨ 𝑁 = 1)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∨ wo 845 = wceq 1533 ∈ wcel 2098 ≠ wne 2936 class class class wbr 5150 (class class class)co 7424 ℝcr 11143 0cc0 11144 1c1 11145 < clt 11284 ≤ cle 11285 − cmin 11480 2c2 12303 ℕ0cn0 12508 ℤcz 12594 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2698 ax-sep 5301 ax-nul 5308 ax-pow 5367 ax-pr 5431 ax-un 7744 ax-resscn 11201 ax-1cn 11202 ax-icn 11203 ax-addcl 11204 ax-addrcl 11205 ax-mulcl 11206 ax-mulrcl 11207 ax-mulcom 11208 ax-addass 11209 ax-mulass 11210 ax-distr 11211 ax-i2m1 11212 ax-1ne0 11213 ax-1rid 11214 ax-rnegex 11215 ax-rrecex 11216 ax-cnre 11217 ax-pre-lttri 11218 ax-pre-lttrn 11219 ax-pre-ltadd 11220 ax-pre-mulgt0 11221 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2937 df-nel 3043 df-ral 3058 df-rex 3067 df-reu 3373 df-rab 3429 df-v 3473 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4325 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4911 df-iun 5000 df-br 5151 df-opab 5213 df-mpt 5234 df-tr 5268 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5635 df-we 5637 df-xp 5686 df-rel 5687 df-cnv 5688 df-co 5689 df-dm 5690 df-rn 5691 df-res 5692 df-ima 5693 df-pred 6308 df-ord 6375 df-on 6376 df-lim 6377 df-suc 6378 df-iota 6503 df-fun 6553 df-fn 6554 df-f 6555 df-f1 6556 df-fo 6557 df-f1o 6558 df-fv 6559 df-riota 7380 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7875 df-2nd 7998 df-frecs 8291 df-wrecs 8322 df-recs 8396 df-rdg 8435 df-er 8729 df-en 8969 df-dom 8970 df-sdom 8971 df-pnf 11286 df-mnf 11287 df-xr 11288 df-ltxr 11289 df-le 11290 df-sub 11482 df-neg 11483 df-nn 12249 df-2 12311 df-n0 12509 df-z 12595 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |