Theorem nn0ge2m1nnALT 9968

Description: Alternate proof of nn0ge2m1nn 9577: 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 9877, 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 9577. (Contributed by Alexander van der Vekens, 1-Aug-2018.) (New usage is discouraged.) (Proof modification is discouraged.)

Assertion

Ref	Expression
nn0ge2m1nnALT	⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (𝑁 − 1) ∈ ℕ)

Proof of Theorem nn0ge2m1nnALT

Step	Hyp	Ref	Expression
1		2z 9622	. . . 4 ⊢ 2 ∈ ℤ
2	1	a1i 9	. . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → 2 ∈ ℤ)
3		nn0z 9614	. . . 4 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ)
4	3	adantr 276	. . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → 𝑁 ∈ ℤ)
5		simpr 110	. . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → 2 ≤ 𝑁)
6		eluz2 9877	. . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) ↔ (2 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 2 ≤ 𝑁))
7	2, 4, 5, 6	syl3anbrc 1208	. 2 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → 𝑁 ∈ (ℤ≥‘2))
8		uz2m1nn 9955	. 2 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 − 1) ∈ ℕ)
9	7, 8	syl 14	1 ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (𝑁 − 1) ∈ ℕ)

Syntax hints:   → wi 4   ∧ wa 104   ∈ wcel 2205   class class class wbr 4114  ‘cfv 5357  (class class class)co 6058  1c1 8144   ≤ cle 8325   − cmin 8460  ℕcn 9254  2c2 9305  ℕ₀cn0 9513  ℤcz 9594  ℤ_≥cuz 9871

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-ltadd 8259

This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-inn 9255  df-2 9313  df-n0 9514  df-z 9595  df-uz 9872

This theorem is referenced by: (None)