![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > nn0n0n1ge2 | Structured version Visualization version GIF version |
Description: A nonnegative integer which is neither 0 nor 1 is greater than or equal to 2. (Contributed by Alexander van der Vekens, 6-Dec-2017.) |
Ref | Expression |
---|---|
nn0n0n1ge2 | ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ≠ 0 ∧ 𝑁 ≠ 1) → 2 ≤ 𝑁) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nn0cn 12422 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℂ) | |
2 | 1cnd 11149 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → 1 ∈ ℂ) | |
3 | 1, 2, 2 | subsub4d 11542 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 − 1) − 1) = (𝑁 − (1 + 1))) |
4 | 1p1e2 12277 | . . . . . 6 ⊢ (1 + 1) = 2 | |
5 | 4 | oveq2i 7367 | . . . . 5 ⊢ (𝑁 − (1 + 1)) = (𝑁 − 2) |
6 | 3, 5 | eqtr2di 2793 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (𝑁 − 2) = ((𝑁 − 1) − 1)) |
7 | 6 | 3ad2ant1 1133 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ≠ 0 ∧ 𝑁 ≠ 1) → (𝑁 − 2) = ((𝑁 − 1) − 1)) |
8 | 3simpa 1148 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ≠ 0 ∧ 𝑁 ≠ 1) → (𝑁 ∈ ℕ0 ∧ 𝑁 ≠ 0)) | |
9 | elnnne0 12426 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℕ0 ∧ 𝑁 ≠ 0)) | |
10 | 8, 9 | sylibr 233 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ≠ 0 ∧ 𝑁 ≠ 1) → 𝑁 ∈ ℕ) |
11 | nnm1nn0 12453 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → (𝑁 − 1) ∈ ℕ0) | |
12 | 10, 11 | syl 17 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ≠ 0 ∧ 𝑁 ≠ 1) → (𝑁 − 1) ∈ ℕ0) |
13 | 1, 2 | subeq0ad 11521 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 − 1) = 0 ↔ 𝑁 = 1)) |
14 | 13 | biimpd 228 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 − 1) = 0 → 𝑁 = 1)) |
15 | 14 | necon3d 2964 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ≠ 1 → (𝑁 − 1) ≠ 0)) |
16 | 15 | imp 407 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ≠ 1) → (𝑁 − 1) ≠ 0) |
17 | 16 | 3adant2 1131 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ≠ 0 ∧ 𝑁 ≠ 1) → (𝑁 − 1) ≠ 0) |
18 | elnnne0 12426 | . . . . 5 ⊢ ((𝑁 − 1) ∈ ℕ ↔ ((𝑁 − 1) ∈ ℕ0 ∧ (𝑁 − 1) ≠ 0)) | |
19 | 12, 17, 18 | sylanbrc 583 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ≠ 0 ∧ 𝑁 ≠ 1) → (𝑁 − 1) ∈ ℕ) |
20 | nnm1nn0 12453 | . . . 4 ⊢ ((𝑁 − 1) ∈ ℕ → ((𝑁 − 1) − 1) ∈ ℕ0) | |
21 | 19, 20 | syl 17 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ≠ 0 ∧ 𝑁 ≠ 1) → ((𝑁 − 1) − 1) ∈ ℕ0) |
22 | 7, 21 | eqeltrd 2838 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ≠ 0 ∧ 𝑁 ≠ 1) → (𝑁 − 2) ∈ ℕ0) |
23 | 2nn0 12429 | . . . . 5 ⊢ 2 ∈ ℕ0 | |
24 | 23 | jctl 524 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (2 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0)) |
25 | 24 | 3ad2ant1 1133 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ≠ 0 ∧ 𝑁 ≠ 1) → (2 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0)) |
26 | nn0sub 12462 | . . 3 ⊢ ((2 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (2 ≤ 𝑁 ↔ (𝑁 − 2) ∈ ℕ0)) | |
27 | 25, 26 | syl 17 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ≠ 0 ∧ 𝑁 ≠ 1) → (2 ≤ 𝑁 ↔ (𝑁 − 2) ∈ ℕ0)) |
28 | 22, 27 | mpbird 256 | 1 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ≠ 0 ∧ 𝑁 ≠ 1) → 2 ≤ 𝑁) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ≠ wne 2943 class class class wbr 5105 (class class class)co 7356 0cc0 11050 1c1 11051 + caddc 11053 ≤ cle 11189 − cmin 11384 ℕcn 12152 2c2 12207 ℕ0cn0 12412 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7671 ax-resscn 11107 ax-1cn 11108 ax-icn 11109 ax-addcl 11110 ax-addrcl 11111 ax-mulcl 11112 ax-mulrcl 11113 ax-mulcom 11114 ax-addass 11115 ax-mulass 11116 ax-distr 11117 ax-i2m1 11118 ax-1ne0 11119 ax-1rid 11120 ax-rnegex 11121 ax-rrecex 11122 ax-cnre 11123 ax-pre-lttri 11124 ax-pre-lttrn 11125 ax-pre-ltadd 11126 ax-pre-mulgt0 11127 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3065 df-rex 3074 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-pss 3929 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-tr 5223 df-id 5531 df-eprel 5537 df-po 5545 df-so 5546 df-fr 5588 df-we 5590 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-pred 6253 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-riota 7312 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7802 df-2nd 7921 df-frecs 8211 df-wrecs 8242 df-recs 8316 df-rdg 8355 df-er 8647 df-en 8883 df-dom 8884 df-sdom 8885 df-pnf 11190 df-mnf 11191 df-xr 11192 df-ltxr 11193 df-le 11194 df-sub 11386 df-neg 11387 df-nn 12153 df-2 12215 df-n0 12413 |
This theorem is referenced by: nn0n0n1ge2b 12480 umgrclwwlkge2 28882 clwwisshclwwslem 28905 nnne1ge2 43500 iccpartiltu 45585 |
Copyright terms: Public domain | W3C validator |