| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uz2m1nn | Structured version Visualization version GIF version | ||
| Description: One less than an integer greater than or equal to 2 is a positive integer. (Contributed by Paul Chapman, 17-Nov-2012.) |
| Ref | Expression |
|---|---|
| uz2m1nn | ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 − 1) ∈ ℕ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluz2b1 12961 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘2) ↔ (𝑁 ∈ ℤ ∧ 1 < 𝑁)) | |
| 2 | 1z 12647 | . . . 4 ⊢ 1 ∈ ℤ | |
| 3 | znnsub 12663 | . . . 4 ⊢ ((1 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (1 < 𝑁 ↔ (𝑁 − 1) ∈ ℕ)) | |
| 4 | 2, 3 | mpan 690 | . . 3 ⊢ (𝑁 ∈ ℤ → (1 < 𝑁 ↔ (𝑁 − 1) ∈ ℕ)) |
| 5 | 4 | biimpa 476 | . 2 ⊢ ((𝑁 ∈ ℤ ∧ 1 < 𝑁) → (𝑁 − 1) ∈ ℕ) |
| 6 | 1, 5 | sylbi 217 | 1 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 − 1) ∈ ℕ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2108 class class class wbr 5143 ‘cfv 6561 (class class class)co 7431 1c1 11156 < clt 11295 − cmin 11492 ℕcn 12266 2c2 12321 ℤcz 12613 ℤ≥cuz 12878 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 ax-cnex 11211 ax-resscn 11212 ax-1cn 11213 ax-icn 11214 ax-addcl 11215 ax-addrcl 11216 ax-mulcl 11217 ax-mulrcl 11218 ax-mulcom 11219 ax-addass 11220 ax-mulass 11221 ax-distr 11222 ax-i2m1 11223 ax-1ne0 11224 ax-1rid 11225 ax-rnegex 11226 ax-rrecex 11227 ax-cnre 11228 ax-pre-lttri 11229 ax-pre-lttrn 11230 ax-pre-ltadd 11231 ax-pre-mulgt0 11232 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-lim 6389 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-2nd 8015 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-rdg 8450 df-er 8745 df-en 8986 df-dom 8987 df-sdom 8988 df-pnf 11297 df-mnf 11298 df-xr 11299 df-ltxr 11300 df-le 11301 df-sub 11494 df-neg 11495 df-nn 12267 df-2 12329 df-n0 12527 df-z 12614 df-uz 12879 |
| This theorem is referenced by: nn0ge2m1nnALT 12984 bernneq3 14270 pfxtrcfv0 14732 climcndslem1 15885 exprmfct 16741 oddprm 16848 pockthg 16944 vdwlem5 17023 vdwlem8 17026 efgs1b 19754 efgredlema 19758 wilthlem3 27113 ppiprm 27194 ppinprm 27195 chtprm 27196 chtnprm 27197 lgsval2lem 27351 lgsqrlem2 27391 lgseisenlem1 27419 lgseisenlem3 27421 lgsquadlem3 27426 rplogsumlem1 27528 rplogsumlem2 27529 rpvmasumlem 27531 clwwisshclwwslemlem 30032 umgr2cwwk2dif 30083 psgnfzto1stlem 33120 ballotlemic 34509 ballotlem1c 34510 signstfveq0 34592 expeqidd 42360 fltnltalem 42672 fltnlta 42673 jm3.1lem1 43029 jm3.1lem2 43030 trclfvdecomr 43741 itgsinexp 45970 stirlinglem12 46100 fourierdlem54 46175 fourierdlem102 46223 fourierdlem114 46235 blennngt2o2 48513 |
| Copyright terms: Public domain | W3C validator |