Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nn0le2is012 | Structured version Visualization version GIF version |
Description: A nonnegative integer which is less than or equal to 2 is either 0 or 1 or 2. (Contributed by AV, 16-Mar-2019.) |
Ref | Expression |
---|---|
nn0le2is012 | ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ≤ 2) → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nn0re 11894 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
2 | 2re 11699 | . . . . 5 ⊢ 2 ∈ ℝ | |
3 | 2 | a1i 11 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → 2 ∈ ℝ) |
4 | 1, 3 | leloed 10771 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ≤ 2 ↔ (𝑁 < 2 ∨ 𝑁 = 2))) |
5 | nn0z 11993 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ) | |
6 | 2z 12002 | . . . . . . . . 9 ⊢ 2 ∈ ℤ | |
7 | zltlem1 12023 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℤ ∧ 2 ∈ ℤ) → (𝑁 < 2 ↔ 𝑁 ≤ (2 − 1))) | |
8 | 5, 6, 7 | sylancl 586 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → (𝑁 < 2 ↔ 𝑁 ≤ (2 − 1))) |
9 | 2m1e1 11751 | . . . . . . . . . 10 ⊢ (2 − 1) = 1 | |
10 | 9 | a1i 11 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → (2 − 1) = 1) |
11 | 10 | breq2d 5069 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ≤ (2 − 1) ↔ 𝑁 ≤ 1)) |
12 | 8, 11 | bitrd 280 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → (𝑁 < 2 ↔ 𝑁 ≤ 1)) |
13 | 1red 10630 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → 1 ∈ ℝ) | |
14 | 1, 13 | leloed 10771 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ≤ 1 ↔ (𝑁 < 1 ∨ 𝑁 = 1))) |
15 | nn0lt10b 12032 | . . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ0 → (𝑁 < 1 ↔ 𝑁 = 0)) | |
16 | 3mix1 1322 | . . . . . . . . . . . 12 ⊢ (𝑁 = 0 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2)) | |
17 | 15, 16 | syl6bi 254 | . . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ0 → (𝑁 < 1 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
18 | 17 | com12 32 | . . . . . . . . . 10 ⊢ (𝑁 < 1 → (𝑁 ∈ ℕ0 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
19 | 3mix2 1323 | . . . . . . . . . . 11 ⊢ (𝑁 = 1 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2)) | |
20 | 19 | a1d 25 | . . . . . . . . . 10 ⊢ (𝑁 = 1 → (𝑁 ∈ ℕ0 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
21 | 18, 20 | jaoi 851 | . . . . . . . . 9 ⊢ ((𝑁 < 1 ∨ 𝑁 = 1) → (𝑁 ∈ ℕ0 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
22 | 21 | com12 32 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 < 1 ∨ 𝑁 = 1) → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
23 | 14, 22 | sylbid 241 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ≤ 1 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
24 | 12, 23 | sylbid 241 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (𝑁 < 2 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
25 | 24 | com12 32 | . . . . 5 ⊢ (𝑁 < 2 → (𝑁 ∈ ℕ0 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
26 | 3mix3 1324 | . . . . . 6 ⊢ (𝑁 = 2 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2)) | |
27 | 26 | a1d 25 | . . . . 5 ⊢ (𝑁 = 2 → (𝑁 ∈ ℕ0 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
28 | 25, 27 | jaoi 851 | . . . 4 ⊢ ((𝑁 < 2 ∨ 𝑁 = 2) → (𝑁 ∈ ℕ0 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
29 | 28 | com12 32 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 < 2 ∨ 𝑁 = 2) → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
30 | 4, 29 | sylbid 241 | . 2 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ≤ 2 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
31 | 30 | imp 407 | 1 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ≤ 2) → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∨ wo 841 ∨ w3o 1078 = wceq 1528 ∈ wcel 2105 class class class wbr 5057 (class class class)co 7145 ℝcr 10524 0cc0 10525 1c1 10526 < clt 10663 ≤ cle 10664 − cmin 10858 2c2 11680 ℕ0cn0 11885 ℤcz 11969 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-er 8278 df-en 8498 df-dom 8499 df-sdom 8500 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-nn 11627 df-2 11688 df-n0 11886 df-z 11970 |
This theorem is referenced by: xnn0le2is012 12627 2sq2 25936 exple2lt6 44340 |
Copyright terms: Public domain | W3C validator |