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

Theorem nn0ge2m1nnALT 9739
Description: Alternate proof of nn0ge2m1nn 9355: 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 9654, 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 9355. (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 9400 . . . 4  |-  2  e.  ZZ
21a1i 9 . . 3  |-  ( ( N  e.  NN0  /\  2  <_  N )  -> 
2  e.  ZZ )
3 nn0z 9392 . . . 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 9654 . . 3  |-  ( N  e.  ( ZZ>= `  2
)  <->  ( 2  e.  ZZ  /\  N  e.  ZZ  /\  2  <_  N ) )
72, 4, 5, 6syl3anbrc 1184 . 2  |-  ( ( N  e.  NN0  /\  2  <_  N )  ->  N  e.  ( ZZ>= ` 
2 ) )
8 uz2m1nn 9726 . 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 2176   class class class wbr 4044   ` cfv 5271  (class class class)co 5944   1c1 7926    <_ cle 8108    - cmin 8243   NNcn 9036   2c2 9087   NN0cn0 9295   ZZcz 9372   ZZ>=cuz 9648
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253  ax-un 4480  ax-setind 4585  ax-cnex 8016  ax-resscn 8017  ax-1cn 8018  ax-1re 8019  ax-icn 8020  ax-addcl 8021  ax-addrcl 8022  ax-mulcl 8023  ax-addcom 8025  ax-addass 8027  ax-distr 8029  ax-i2m1 8030  ax-0lt1 8031  ax-0id 8033  ax-rnegex 8034  ax-cnre 8036  ax-pre-ltirr 8037  ax-pre-ltwlin 8038  ax-pre-lttrn 8039  ax-pre-ltadd 8041
This theorem depends on definitions:  df-bi 117  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-nel 2472  df-ral 2489  df-rex 2490  df-reu 2491  df-rab 2493  df-v 2774  df-sbc 2999  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-int 3886  df-br 4045  df-opab 4106  df-mpt 4107  df-id 4340  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688  df-iota 5232  df-fun 5273  df-fn 5274  df-f 5275  df-fv 5279  df-riota 5899  df-ov 5947  df-oprab 5948  df-mpo 5949  df-pnf 8109  df-mnf 8110  df-xr 8111  df-ltxr 8112  df-le 8113  df-sub 8245  df-neg 8246  df-inn 9037  df-2 9095  df-n0 9296  df-z 9373  df-uz 9649
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator