| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nn0ge2m1nn | Structured version Visualization version GIF version | ||
| Description: If a nonnegative integer is greater than or equal to two, the integer decreased by 1 is a positive integer. (Contributed by Alexander van der Vekens, 1-Aug-2018.) (Revised by AV, 4-Jan-2020.) |
| Ref | Expression |
|---|---|
| nn0ge2m1nn | ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (𝑁 − 1) ∈ ℕ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 488 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → 𝑁 ∈ ℕ0) | |
| 2 | 1red 11348 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → 1 ∈ ℝ) | |
| 3 | 2re 12457 | . . . . . . . 8 ⊢ 2 ∈ ℝ | |
| 4 | 3 | a1i 11 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → 2 ∈ ℝ) |
| 5 | nn0re 12655 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
| 6 | 2, 4, 5 | 3jca 1146 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (1 ∈ ℝ ∧ 2 ∈ ℝ ∧ 𝑁 ∈ ℝ)) |
| 7 | 6 | adantr 486 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (1 ∈ ℝ ∧ 2 ∈ ℝ ∧ 𝑁 ∈ ℝ)) |
| 8 | simpr 490 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → 2 ≤ 𝑁) | |
| 9 | 1lt2 12555 | . . . . . 6 ⊢ 1 < 2 | |
| 10 | 8, 9 | jctil 529 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (1 < 2 ∧ 2 ≤ 𝑁)) |
| 11 | ltleletr 11442 | . . . . 5 ⊢ ((1 ∈ ℝ ∧ 2 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((1 < 2 ∧ 2 ≤ 𝑁) → 1 ≤ 𝑁)) | |
| 12 | 7, 10, 11 | sylc 66 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → 1 ≤ 𝑁) |
| 13 | elnnnn0c 12691 | . . . 4 ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℕ0 ∧ 1 ≤ 𝑁)) | |
| 14 | 1, 12, 13 | sylanbrc 595 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → 𝑁 ∈ ℕ) |
| 15 | nn1m1nn 12396 | . . 3 ⊢ (𝑁 ∈ ℕ → (𝑁 = 1 ∨ (𝑁 − 1) ∈ ℕ)) | |
| 16 | 14, 15 | syl 18 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (𝑁 = 1 ∨ (𝑁 − 1) ∈ ℕ)) |
| 17 | breq2 5112 | . . . . 5 ⊢ (𝑁 = 1 → (2 ≤ 𝑁 ↔ 2 ≤ 1)) | |
| 18 | 1re 11347 | . . . . . . . 8 ⊢ 1 ∈ ℝ | |
| 19 | 18, 3 | ltnlei 11470 | . . . . . . 7 ⊢ (1 < 2 ↔ ¬ 2 ≤ 1) |
| 20 | pm2.21 124 | . . . . . . 7 ⊢ (¬ 2 ≤ 1 → (2 ≤ 1 → (𝑁 − 1) ∈ ℕ)) | |
| 21 | 19, 20 | sylbi 220 | . . . . . 6 ⊢ (1 < 2 → (2 ≤ 1 → (𝑁 − 1) ∈ ℕ)) |
| 22 | 9, 21 | ax-mp 5 | . . . . 5 ⊢ (2 ≤ 1 → (𝑁 − 1) ∈ ℕ) |
| 23 | 17, 22 | biimtrdi 256 | . . . 4 ⊢ (𝑁 = 1 → (2 ≤ 𝑁 → (𝑁 − 1) ∈ ℕ)) |
| 24 | 23 | adantld 496 | . . 3 ⊢ (𝑁 = 1 → ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (𝑁 − 1) ∈ ℕ)) |
| 25 | ax-1 6 | . . 3 ⊢ ((𝑁 − 1) ∈ ℕ → ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (𝑁 − 1) ∈ ℕ)) | |
| 26 | 24, 25 | jaoi 871 | . 2 ⊢ ((𝑁 = 1 ∨ (𝑁 − 1) ∈ ℕ) → ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (𝑁 − 1) ∈ ℕ)) |
| 27 | 16, 26 | mpcom 39 | 1 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (𝑁 − 1) ∈ ℕ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 class class class wbr 5108 (class class class)co 7451 ℝcr 11238 1c1 11240 < clt 11382 ≤ cle 11383 − cmin 11580 ℕcn 12375 2c2 12437 ℕ0cn0 12646 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-n0 12647 |
| This theorem is used by: nn0ge2m1nn0 12717 wwlksm1edg 30527 clwlkclwwlklem2fv2 30644 clwlkclwwlk 30650 pfxlsw2ccat 33609 fmtnoprmfac1 48923 logbpw2m1 50010 blenpw2m1 50022 nnolog2flm1 50033 |
| Copyright terms: Public domain | W3C validator |