![]() |
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 481 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → 𝑁 ∈ ℕ0) | |
2 | 1red 11253 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → 1 ∈ ℝ) | |
3 | 2re 12324 | . . . . . . . 8 ⊢ 2 ∈ ℝ | |
4 | 3 | a1i 11 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → 2 ∈ ℝ) |
5 | nn0re 12519 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
6 | 2, 4, 5 | 3jca 1125 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (1 ∈ ℝ ∧ 2 ∈ ℝ ∧ 𝑁 ∈ ℝ)) |
7 | 6 | adantr 479 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (1 ∈ ℝ ∧ 2 ∈ ℝ ∧ 𝑁 ∈ ℝ)) |
8 | simpr 483 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → 2 ≤ 𝑁) | |
9 | 1lt2 12421 | . . . . . 6 ⊢ 1 < 2 | |
10 | 8, 9 | jctil 518 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (1 < 2 ∧ 2 ≤ 𝑁)) |
11 | ltleletr 11345 | . . . . 5 ⊢ ((1 ∈ ℝ ∧ 2 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((1 < 2 ∧ 2 ≤ 𝑁) → 1 ≤ 𝑁)) | |
12 | 7, 10, 11 | sylc 65 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → 1 ≤ 𝑁) |
13 | elnnnn0c 12555 | . . . 4 ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℕ0 ∧ 1 ≤ 𝑁)) | |
14 | 1, 12, 13 | sylanbrc 581 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → 𝑁 ∈ ℕ) |
15 | nn1m1nn 12271 | . . 3 ⊢ (𝑁 ∈ ℕ → (𝑁 = 1 ∨ (𝑁 − 1) ∈ ℕ)) | |
16 | 14, 15 | syl 17 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (𝑁 = 1 ∨ (𝑁 − 1) ∈ ℕ)) |
17 | breq2 5156 | . . . . 5 ⊢ (𝑁 = 1 → (2 ≤ 𝑁 ↔ 2 ≤ 1)) | |
18 | 1re 11252 | . . . . . . . 8 ⊢ 1 ∈ ℝ | |
19 | 18, 3 | ltnlei 11373 | . . . . . . 7 ⊢ (1 < 2 ↔ ¬ 2 ≤ 1) |
20 | pm2.21 123 | . . . . . . 7 ⊢ (¬ 2 ≤ 1 → (2 ≤ 1 → (𝑁 − 1) ∈ ℕ)) | |
21 | 19, 20 | sylbi 216 | . . . . . 6 ⊢ (1 < 2 → (2 ≤ 1 → (𝑁 − 1) ∈ ℕ)) |
22 | 9, 21 | ax-mp 5 | . . . . 5 ⊢ (2 ≤ 1 → (𝑁 − 1) ∈ ℕ) |
23 | 17, 22 | biimtrdi 252 | . . . 4 ⊢ (𝑁 = 1 → (2 ≤ 𝑁 → (𝑁 − 1) ∈ ℕ)) |
24 | 23 | adantld 489 | . . 3 ⊢ (𝑁 = 1 → ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (𝑁 − 1) ∈ ℕ)) |
25 | ax-1 6 | . . 3 ⊢ ((𝑁 − 1) ∈ ℕ → ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (𝑁 − 1) ∈ ℕ)) | |
26 | 24, 25 | jaoi 855 | . 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 394 ∨ wo 845 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 class class class wbr 5152 (class class class)co 7426 ℝcr 11145 1c1 11147 < clt 11286 ≤ cle 11287 − cmin 11482 ℕcn 12250 2c2 12305 ℕ0cn0 12510 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2699 ax-sep 5303 ax-nul 5310 ax-pow 5369 ax-pr 5433 ax-un 7746 ax-resscn 11203 ax-1cn 11204 ax-icn 11205 ax-addcl 11206 ax-addrcl 11207 ax-mulcl 11208 ax-mulrcl 11209 ax-mulcom 11210 ax-addass 11211 ax-mulass 11212 ax-distr 11213 ax-i2m1 11214 ax-1ne0 11215 ax-1rid 11216 ax-rnegex 11217 ax-rrecex 11218 ax-cnre 11219 ax-pre-lttri 11220 ax-pre-lttrn 11221 ax-pre-ltadd 11222 ax-pre-mulgt0 11223 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-reu 3375 df-rab 3431 df-v 3475 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4327 df-if 4533 df-pw 4608 df-sn 4633 df-pr 4635 df-op 4639 df-uni 4913 df-iun 5002 df-br 5153 df-opab 5215 df-mpt 5236 df-tr 5270 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-pred 6310 df-ord 6377 df-on 6378 df-lim 6379 df-suc 6380 df-iota 6505 df-fun 6555 df-fn 6556 df-f 6557 df-f1 6558 df-fo 6559 df-f1o 6560 df-fv 6561 df-riota 7382 df-ov 7429 df-oprab 7430 df-mpo 7431 df-om 7877 df-2nd 8000 df-frecs 8293 df-wrecs 8324 df-recs 8398 df-rdg 8437 df-er 8731 df-en 8971 df-dom 8972 df-sdom 8973 df-pnf 11288 df-mnf 11289 df-xr 11290 df-ltxr 11291 df-le 11292 df-sub 11484 df-neg 11485 df-nn 12251 df-2 12313 df-n0 12511 |
This theorem is referenced by: nn0ge2m1nn0 12580 wwlksm1edg 29712 clwlkclwwlklem2fv2 29826 clwlkclwwlk 29832 pfxlsw2ccat 32694 fmtnoprmfac1 46934 logbpw2m1 47718 blenpw2m1 47730 nnolog2flm1 47741 |
Copyright terms: Public domain | W3C validator |