| 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 482 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → 𝑁 ∈ ℕ0) | |
| 2 | 1red 11145 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → 1 ∈ ℝ) | |
| 3 | 2re 12231 | . . . . . . . 8 ⊢ 2 ∈ ℝ | |
| 4 | 3 | a1i 11 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → 2 ∈ ℝ) |
| 5 | nn0re 12422 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
| 6 | 2, 4, 5 | 3jca 1129 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (1 ∈ ℝ ∧ 2 ∈ ℝ ∧ 𝑁 ∈ ℝ)) |
| 7 | 6 | adantr 480 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (1 ∈ ℝ ∧ 2 ∈ ℝ ∧ 𝑁 ∈ ℝ)) |
| 8 | simpr 484 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → 2 ≤ 𝑁) | |
| 9 | 1lt2 12323 | . . . . . 6 ⊢ 1 < 2 | |
| 10 | 8, 9 | jctil 519 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (1 < 2 ∧ 2 ≤ 𝑁)) |
| 11 | ltleletr 11238 | . . . . 5 ⊢ ((1 ∈ ℝ ∧ 2 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((1 < 2 ∧ 2 ≤ 𝑁) → 1 ≤ 𝑁)) | |
| 12 | 7, 10, 11 | sylc 65 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → 1 ≤ 𝑁) |
| 13 | elnnnn0c 12458 | . . . 4 ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℕ0 ∧ 1 ≤ 𝑁)) | |
| 14 | 1, 12, 13 | sylanbrc 584 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → 𝑁 ∈ ℕ) |
| 15 | nn1m1nn 12178 | . . 3 ⊢ (𝑁 ∈ ℕ → (𝑁 = 1 ∨ (𝑁 − 1) ∈ ℕ)) | |
| 16 | 14, 15 | syl 17 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (𝑁 = 1 ∨ (𝑁 − 1) ∈ ℕ)) |
| 17 | breq2 5104 | . . . . 5 ⊢ (𝑁 = 1 → (2 ≤ 𝑁 ↔ 2 ≤ 1)) | |
| 18 | 1re 11144 | . . . . . . . 8 ⊢ 1 ∈ ℝ | |
| 19 | 18, 3 | ltnlei 11266 | . . . . . . 7 ⊢ (1 < 2 ↔ ¬ 2 ≤ 1) |
| 20 | pm2.21 123 | . . . . . . 7 ⊢ (¬ 2 ≤ 1 → (2 ≤ 1 → (𝑁 − 1) ∈ ℕ)) | |
| 21 | 19, 20 | sylbi 217 | . . . . . 6 ⊢ (1 < 2 → (2 ≤ 1 → (𝑁 − 1) ∈ ℕ)) |
| 22 | 9, 21 | ax-mp 5 | . . . . 5 ⊢ (2 ≤ 1 → (𝑁 − 1) ∈ ℕ) |
| 23 | 17, 22 | biimtrdi 253 | . . . 4 ⊢ (𝑁 = 1 → (2 ≤ 𝑁 → (𝑁 − 1) ∈ ℕ)) |
| 24 | 23 | adantld 490 | . . 3 ⊢ (𝑁 = 1 → ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (𝑁 − 1) ∈ ℕ)) |
| 25 | ax-1 6 | . . 3 ⊢ ((𝑁 − 1) ∈ ℕ → ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (𝑁 − 1) ∈ ℕ)) | |
| 26 | 24, 25 | jaoi 858 | . 2 ⊢ ((𝑁 = 1 ∨ (𝑁 − 1) ∈ ℕ) → ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (𝑁 − 1) ∈ ℕ)) |
| 27 | 16, 26 | mpcom 38 | 1 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (𝑁 − 1) ∈ ℕ) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 848 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 class class class wbr 5100 (class class class)co 7368 ℝcr 11037 1c1 11039 < clt 11178 ≤ cle 11179 − cmin 11376 ℕcn 12157 2c2 12212 ℕ0cn0 12413 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-nn 12158 df-2 12220 df-n0 12414 |
| This theorem is referenced by: nn0ge2m1nn0 12484 wwlksm1edg 29966 clwlkclwwlklem2fv2 30083 clwlkclwwlk 30089 pfxlsw2ccat 33043 fmtnoprmfac1 47925 logbpw2m1 48927 blenpw2m1 48939 nnolog2flm1 48950 |
| Copyright terms: Public domain | W3C validator |