| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nn0ge2m1nnALT | Structured version Visualization version GIF version | ||
| Description: Alternate proof of nn0ge2m1nn 12551: If a nonnegative integer is greater than or equal to two, the integer decreased by 1 is a positive integer. This version is proved using eluz2 12845, a theorem for upper sets of integers, which are defined later than the positive and nonnegative integers. This proof is, however, much shorter than the proof of nn0ge2m1nn 12551. (Contributed by Alexander van der Vekens, 1-Aug-2018.) (New usage is discouraged.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| nn0ge2m1nnALT | ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (𝑁 − 1) ∈ ℕ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2z 12603 | . . . 4 ⊢ 2 ∈ ℤ | |
| 2 | 1 | a1i 11 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → 2 ∈ ℤ) |
| 3 | nn0z 12592 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ) | |
| 4 | 3 | adantr 484 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → 𝑁 ∈ ℤ) |
| 5 | simpr 488 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → 2 ≤ 𝑁) | |
| 6 | eluz2 12845 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) ↔ (2 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 2 ≤ 𝑁)) | |
| 7 | 2, 4, 5, 6 | syl3anbrc 1357 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → 𝑁 ∈ (ℤ≥‘2)) |
| 8 | uz2m1nn 12924 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 − 1) ∈ ℕ) | |
| 9 | 7, 8 | syl 17 | 1 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (𝑁 − 1) ∈ ℕ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∈ wcel 2142 class class class wbr 5100 ‘cfv 6521 (class class class)co 7396 1c1 11074 ≤ cle 11217 − cmin 11414 ℕcn 12210 2c2 12272 ℕ0cn0 12481 ℤcz 12568 ℤ≥cuz 12839 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-cnex 11129 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149 ax-pre-mulgt0 11150 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-er 8678 df-en 8928 df-dom 8929 df-sdom 8930 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-le 11222 df-sub 11416 df-neg 11417 df-nn 12211 df-2 12280 df-n0 12482 df-z 12569 df-uz 12840 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |