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

Theorem nn1m1nn 8698
Description: Every positive integer is one or a successor. (Contributed by Mario Carneiro, 16-May-2014.)
Assertion
Ref Expression
nn1m1nn  |-  ( A  e.  NN  ->  ( A  =  1  \/  ( A  -  1
)  e.  NN ) )

Proof of Theorem nn1m1nn
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 orc 684 . . 3  |-  ( x  =  1  ->  (
x  =  1  \/  ( x  -  1 )  e.  NN ) )
2 1cnd 7746 . . 3  |-  ( x  =  1  ->  1  e.  CC )
31, 22thd 174 . 2  |-  ( x  =  1  ->  (
( x  =  1  \/  ( x  - 
1 )  e.  NN ) 
<->  1  e.  CC ) )
4 eqeq1 2122 . . 3  |-  ( x  =  y  ->  (
x  =  1  <->  y  =  1 ) )
5 oveq1 5747 . . . 4  |-  ( x  =  y  ->  (
x  -  1 )  =  ( y  - 
1 ) )
65eleq1d 2184 . . 3  |-  ( x  =  y  ->  (
( x  -  1 )  e.  NN  <->  ( y  -  1 )  e.  NN ) )
74, 6orbi12d 765 . 2  |-  ( x  =  y  ->  (
( x  =  1  \/  ( x  - 
1 )  e.  NN ) 
<->  ( y  =  1  \/  ( y  - 
1 )  e.  NN ) ) )
8 eqeq1 2122 . . 3  |-  ( x  =  ( y  +  1 )  ->  (
x  =  1  <->  (
y  +  1 )  =  1 ) )
9 oveq1 5747 . . . 4  |-  ( x  =  ( y  +  1 )  ->  (
x  -  1 )  =  ( ( y  +  1 )  - 
1 ) )
109eleq1d 2184 . . 3  |-  ( x  =  ( y  +  1 )  ->  (
( x  -  1 )  e.  NN  <->  ( (
y  +  1 )  -  1 )  e.  NN ) )
118, 10orbi12d 765 . 2  |-  ( x  =  ( y  +  1 )  ->  (
( x  =  1  \/  ( x  - 
1 )  e.  NN ) 
<->  ( ( y  +  1 )  =  1  \/  ( ( y  +  1 )  - 
1 )  e.  NN ) ) )
12 eqeq1 2122 . . 3  |-  ( x  =  A  ->  (
x  =  1  <->  A  =  1 ) )
13 oveq1 5747 . . . 4  |-  ( x  =  A  ->  (
x  -  1 )  =  ( A  - 
1 ) )
1413eleq1d 2184 . . 3  |-  ( x  =  A  ->  (
( x  -  1 )  e.  NN  <->  ( A  -  1 )  e.  NN ) )
1512, 14orbi12d 765 . 2  |-  ( x  =  A  ->  (
( x  =  1  \/  ( x  - 
1 )  e.  NN ) 
<->  ( A  =  1  \/  ( A  - 
1 )  e.  NN ) ) )
16 ax-1cn 7677 . 2  |-  1  e.  CC
17 nncn 8688 . . . . . 6  |-  ( y  e.  NN  ->  y  e.  CC )
18 pncan 7932 . . . . . 6  |-  ( ( y  e.  CC  /\  1  e.  CC )  ->  ( ( y  +  1 )  -  1 )  =  y )
1917, 16, 18sylancl 407 . . . . 5  |-  ( y  e.  NN  ->  (
( y  +  1 )  -  1 )  =  y )
20 id 19 . . . . 5  |-  ( y  e.  NN  ->  y  e.  NN )
2119, 20eqeltrd 2192 . . . 4  |-  ( y  e.  NN  ->  (
( y  +  1 )  -  1 )  e.  NN )
2221olcd 706 . . 3  |-  ( y  e.  NN  ->  (
( y  +  1 )  =  1  \/  ( ( y  +  1 )  -  1 )  e.  NN ) )
2322a1d 22 . 2  |-  ( y  e.  NN  ->  (
( y  =  1  \/  ( y  - 
1 )  e.  NN )  ->  ( ( y  +  1 )  =  1  \/  ( ( y  +  1 )  -  1 )  e.  NN ) ) )
243, 7, 11, 15, 16, 23nnind 8696 1  |-  ( A  e.  NN  ->  ( A  =  1  \/  ( A  -  1
)  e.  NN ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    \/ wo 680    = wceq 1314    e. wcel 1463  (class class class)co 5740   CCcc 7582   1c1 7585    + caddc 7587    - cmin 7897   NNcn 8680
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 586  ax-in2 587  ax-io 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-14 1475  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097  ax-sep 4014  ax-pow 4066  ax-pr 4099  ax-setind 4420  ax-cnex 7675  ax-resscn 7676  ax-1cn 7677  ax-1re 7678  ax-icn 7679  ax-addcl 7680  ax-addrcl 7681  ax-mulcl 7682  ax-addcom 7684  ax-addass 7686  ax-distr 7688  ax-i2m1 7689  ax-0id 7692  ax-rnegex 7693  ax-cnre 7695
This theorem depends on definitions:  df-bi 116  df-3an 947  df-tru 1317  df-fal 1320  df-nf 1420  df-sb 1719  df-eu 1978  df-mo 1979  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2245  df-ne 2284  df-ral 2396  df-rex 2397  df-reu 2398  df-rab 2400  df-v 2660  df-sbc 2881  df-dif 3041  df-un 3043  df-in 3045  df-ss 3052  df-pw 3480  df-sn 3501  df-pr 3502  df-op 3504  df-uni 3705  df-int 3740  df-br 3898  df-opab 3958  df-id 4183  df-xp 4513  df-rel 4514  df-cnv 4515  df-co 4516  df-dm 4517  df-iota 5056  df-fun 5093  df-fv 5099  df-riota 5696  df-ov 5743  df-oprab 5744  df-mpo 5745  df-sub 7899  df-inn 8681
This theorem is referenced by:  nn1suc  8699  nnsub  8719  nnm1nn0  8972  nn0ge2m1nn  8991
  Copyright terms: Public domain W3C validator