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 11907 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
2 | 2re 11712 | . . . . 5 ⊢ 2 ∈ ℝ | |
3 | 2 | a1i 11 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → 2 ∈ ℝ) |
4 | 1, 3 | leloed 10783 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ≤ 2 ↔ (𝑁 < 2 ∨ 𝑁 = 2))) |
5 | nn0z 12006 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ) | |
6 | 2z 12015 | . . . . . . . . 9 ⊢ 2 ∈ ℤ | |
7 | zltlem1 12036 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℤ ∧ 2 ∈ ℤ) → (𝑁 < 2 ↔ 𝑁 ≤ (2 − 1))) | |
8 | 5, 6, 7 | sylancl 588 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → (𝑁 < 2 ↔ 𝑁 ≤ (2 − 1))) |
9 | 2m1e1 11764 | . . . . . . . . . 10 ⊢ (2 − 1) = 1 | |
10 | 9 | a1i 11 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → (2 − 1) = 1) |
11 | 10 | breq2d 5078 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ≤ (2 − 1) ↔ 𝑁 ≤ 1)) |
12 | 8, 11 | bitrd 281 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → (𝑁 < 2 ↔ 𝑁 ≤ 1)) |
13 | 1red 10642 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → 1 ∈ ℝ) | |
14 | 1, 13 | leloed 10783 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ≤ 1 ↔ (𝑁 < 1 ∨ 𝑁 = 1))) |
15 | nn0lt10b 12045 | . . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ0 → (𝑁 < 1 ↔ 𝑁 = 0)) | |
16 | 3mix1 1326 | . . . . . . . . . . . 12 ⊢ (𝑁 = 0 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2)) | |
17 | 15, 16 | syl6bi 255 | . . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ0 → (𝑁 < 1 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
18 | 17 | com12 32 | . . . . . . . . . 10 ⊢ (𝑁 < 1 → (𝑁 ∈ ℕ0 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
19 | 3mix2 1327 | . . . . . . . . . . 11 ⊢ (𝑁 = 1 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2)) | |
20 | 19 | a1d 25 | . . . . . . . . . 10 ⊢ (𝑁 = 1 → (𝑁 ∈ ℕ0 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
21 | 18, 20 | jaoi 853 | . . . . . . . . 9 ⊢ ((𝑁 < 1 ∨ 𝑁 = 1) → (𝑁 ∈ ℕ0 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
22 | 21 | com12 32 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 < 1 ∨ 𝑁 = 1) → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
23 | 14, 22 | sylbid 242 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ≤ 1 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
24 | 12, 23 | sylbid 242 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (𝑁 < 2 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
25 | 24 | com12 32 | . . . . 5 ⊢ (𝑁 < 2 → (𝑁 ∈ ℕ0 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
26 | 3mix3 1328 | . . . . . 6 ⊢ (𝑁 = 2 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2)) | |
27 | 26 | a1d 25 | . . . . 5 ⊢ (𝑁 = 2 → (𝑁 ∈ ℕ0 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
28 | 25, 27 | jaoi 853 | . . . 4 ⊢ ((𝑁 < 2 ∨ 𝑁 = 2) → (𝑁 ∈ ℕ0 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
29 | 28 | com12 32 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 < 2 ∨ 𝑁 = 2) → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
30 | 4, 29 | sylbid 242 | . 2 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ≤ 2 → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2))) |
31 | 30 | imp 409 | 1 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ≤ 2) → (𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∨ wo 843 ∨ w3o 1082 = wceq 1537 ∈ wcel 2114 class class class wbr 5066 (class class class)co 7156 ℝcr 10536 0cc0 10537 1c1 10538 < clt 10675 ≤ cle 10676 − cmin 10870 2c2 11693 ℕ0cn0 11898 ℤcz 11982 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-2 11701 df-n0 11899 df-z 11983 |
This theorem is referenced by: xnn0le2is012 12640 2sq2 26009 exple2lt6 44432 |
Copyright terms: Public domain | W3C validator |