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

Theorem nn0n0n1ge2 9715
Description: A nonnegative integer which is neither 0 nor 1 is greater than or equal to 2. (Contributed by Alexander van der Vekens, 6-Dec-2017.)
Assertion
Ref Expression
nn0n0n1ge2  |-  ( ( N  e.  NN0  /\  N  =/=  0  /\  N  =/=  1 )  ->  2  <_  N )

Proof of Theorem nn0n0n1ge2
StepHypRef Expression
1 nn0cn 9573 . . . . . 6  |-  ( N  e.  NN0  ->  N  e.  CC )
2 1cnd 8342 . . . . . 6  |-  ( N  e.  NN0  ->  1  e.  CC )
31, 2, 2subsub4d 8668 . . . . 5  |-  ( N  e.  NN0  ->  ( ( N  -  1 )  -  1 )  =  ( N  -  (
1  +  1 ) ) )
4 1p1e2 9421 . . . . . 6  |-  ( 1  +  1 )  =  2
54oveq2i 6096 . . . . 5  |-  ( N  -  ( 1  +  1 ) )  =  ( N  -  2 )
63, 5eqtr2di 2288 . . . 4  |-  ( N  e.  NN0  ->  ( N  -  2 )  =  ( ( N  - 
1 )  -  1 ) )
763ad2ant1 1049 . . 3  |-  ( ( N  e.  NN0  /\  N  =/=  0  /\  N  =/=  1 )  ->  ( N  -  2 )  =  ( ( N  -  1 )  - 
1 ) )
8 3simpa 1025 . . . . . . 7  |-  ( ( N  e.  NN0  /\  N  =/=  0  /\  N  =/=  1 )  ->  ( N  e.  NN0  /\  N  =/=  0 ) )
9 elnnne0 9577 . . . . . . 7  |-  ( N  e.  NN  <->  ( N  e.  NN0  /\  N  =/=  0 ) )
108, 9sylibr 134 . . . . . 6  |-  ( ( N  e.  NN0  /\  N  =/=  0  /\  N  =/=  1 )  ->  N  e.  NN )
11 nnm1nn0 9604 . . . . . 6  |-  ( N  e.  NN  ->  ( N  -  1 )  e.  NN0 )
1210, 11syl 14 . . . . 5  |-  ( ( N  e.  NN0  /\  N  =/=  0  /\  N  =/=  1 )  ->  ( N  -  1 )  e.  NN0 )
131, 2subeq0ad 8647 . . . . . . . . 9  |-  ( N  e.  NN0  ->  ( ( N  -  1 )  =  0  <->  N  = 
1 ) )
1413biimpd 144 . . . . . . . 8  |-  ( N  e.  NN0  ->  ( ( N  -  1 )  =  0  ->  N  =  1 ) )
1514necon3d 2464 . . . . . . 7  |-  ( N  e.  NN0  ->  ( N  =/=  1  ->  ( N  -  1 )  =/=  0 ) )
1615imp 124 . . . . . 6  |-  ( ( N  e.  NN0  /\  N  =/=  1 )  -> 
( N  -  1 )  =/=  0 )
17163adant2 1047 . . . . 5  |-  ( ( N  e.  NN0  /\  N  =/=  0  /\  N  =/=  1 )  ->  ( N  -  1 )  =/=  0 )
18 elnnne0 9577 . . . . 5  |-  ( ( N  -  1 )  e.  NN  <->  ( ( N  -  1 )  e.  NN0  /\  ( N  -  1 )  =/=  0 ) )
1912, 17, 18sylanbrc 421 . . . 4  |-  ( ( N  e.  NN0  /\  N  =/=  0  /\  N  =/=  1 )  ->  ( N  -  1 )  e.  NN )
20 nnm1nn0 9604 . . . 4  |-  ( ( N  -  1 )  e.  NN  ->  (
( N  -  1 )  -  1 )  e.  NN0 )
2119, 20syl 14 . . 3  |-  ( ( N  e.  NN0  /\  N  =/=  0  /\  N  =/=  1 )  ->  (
( N  -  1 )  -  1 )  e.  NN0 )
227, 21eqeltrd 2315 . 2  |-  ( ( N  e.  NN0  /\  N  =/=  0  /\  N  =/=  1 )  ->  ( N  -  2 )  e.  NN0 )
23 2nn0 9580 . . . . 5  |-  2  e.  NN0
2423jctl 314 . . . 4  |-  ( N  e.  NN0  ->  ( 2  e.  NN0  /\  N  e. 
NN0 ) )
25243ad2ant1 1049 . . 3  |-  ( ( N  e.  NN0  /\  N  =/=  0  /\  N  =/=  1 )  ->  (
2  e.  NN0  /\  N  e.  NN0 ) )
26 nn0sub 9711 . . 3  |-  ( ( 2  e.  NN0  /\  N  e.  NN0 )  -> 
( 2  <_  N  <->  ( N  -  2 )  e.  NN0 ) )
2725, 26syl 14 . 2  |-  ( ( N  e.  NN0  /\  N  =/=  0  /\  N  =/=  1 )  ->  (
2  <_  N  <->  ( N  -  2 )  e. 
NN0 ) )
2822, 27mpbird 167 1  |-  ( ( N  e.  NN0  /\  N  =/=  0  /\  N  =/=  1 )  ->  2  <_  N )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009    = wceq 1402    e. wcel 2209    =/= wne 2420   class class class wbr 4130  (class class class)co 6085   0cc0 8179   1c1 8180    + caddc 8182    <_ cle 8361    - cmin 8497   NNcn 9304   2c2 9355   NN0cn0 9563
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-ltadd 8295
This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-inn 9305  df-2 9363  df-n0 9564  df-z 9645
This theorem is used by:  nn0n0n1ge2b  9725  umgrclwwlkge2  16643
  Copyright terms: Public domain W3C validator