ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nn0ge2m1nnALT Unicode version

Theorem nn0ge2m1nnALT 9692
Description: Alternate proof of nn0ge2m1nn 9309: 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 9607, 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 9309. (Contributed by Alexander van der Vekens, 1-Aug-2018.) (New usage is discouraged.) (Proof modification is discouraged.)
Assertion
Ref Expression
nn0ge2m1nnALT  |-  ( ( N  e.  NN0  /\  2  <_  N )  -> 
( N  -  1 )  e.  NN )

Proof of Theorem nn0ge2m1nnALT
StepHypRef Expression
1 2z 9354 . . . 4  |-  2  e.  ZZ
21a1i 9 . . 3  |-  ( ( N  e.  NN0  /\  2  <_  N )  -> 
2  e.  ZZ )
3 nn0z 9346 . . . 4  |-  ( N  e.  NN0  ->  N  e.  ZZ )
43adantr 276 . . 3  |-  ( ( N  e.  NN0  /\  2  <_  N )  ->  N  e.  ZZ )
5 simpr 110 . . 3  |-  ( ( N  e.  NN0  /\  2  <_  N )  -> 
2  <_  N )
6 eluz2 9607 . . 3  |-  ( N  e.  ( ZZ>= `  2
)  <->  ( 2  e.  ZZ  /\  N  e.  ZZ  /\  2  <_  N ) )
72, 4, 5, 6syl3anbrc 1183 . 2  |-  ( ( N  e.  NN0  /\  2  <_  N )  ->  N  e.  ( ZZ>= ` 
2 ) )
8 uz2m1nn 9679 . 2  |-  ( N  e.  ( ZZ>= `  2
)  ->  ( N  -  1 )  e.  NN )
97, 8syl 14 1  |-  ( ( N  e.  NN0  /\  2  <_  N )  -> 
( N  -  1 )  e.  NN )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    e. wcel 2167   class class class wbr 4033   ` cfv 5258  (class class class)co 5922   1c1 7880    <_ cle 8062    - cmin 8197   NNcn 8990   2c2 9041   NN0cn0 9249   ZZcz 9326   ZZ>=cuz 9601
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-addcom 7979  ax-addass 7981  ax-distr 7983  ax-i2m1 7984  ax-0lt1 7985  ax-0id 7987  ax-rnegex 7988  ax-cnre 7990  ax-pre-ltirr 7991  ax-pre-ltwlin 7992  ax-pre-lttrn 7993  ax-pre-ltadd 7995
This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-pnf 8063  df-mnf 8064  df-xr 8065  df-ltxr 8066  df-le 8067  df-sub 8199  df-neg 8200  df-inn 8991  df-2 9049  df-n0 9250  df-z 9327  df-uz 9602
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator