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

Theorem nneoor 9748
Description: A positive integer is even or odd. (Contributed by Jim Kingdon, 15-Mar-2020.)
Assertion
Ref Expression
nneoor  |-  ( N  e.  NN  ->  (
( N  /  2
)  e.  NN  \/  ( ( N  + 
1 )  /  2
)  e.  NN ) )

Proof of Theorem nneoor
Dummy variables  j  k are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq1 6092 . . . . . 6  |-  ( j  =  1  ->  (
j  +  1 )  =  ( 1  +  1 ) )
21oveq1d 6100 . . . . 5  |-  ( j  =  1  ->  (
( j  +  1 )  /  2 )  =  ( ( 1  +  1 )  / 
2 ) )
32eleq1d 2307 . . . 4  |-  ( j  =  1  ->  (
( ( j  +  1 )  /  2
)  e.  NN  <->  ( (
1  +  1 )  /  2 )  e.  NN ) )
4 oveq1 6092 . . . . 5  |-  ( j  =  1  ->  (
j  /  2 )  =  ( 1  / 
2 ) )
54eleq1d 2307 . . . 4  |-  ( j  =  1  ->  (
( j  /  2
)  e.  NN  <->  ( 1  /  2 )  e.  NN ) )
63, 5orbi12d 805 . . 3  |-  ( j  =  1  ->  (
( ( ( j  +  1 )  / 
2 )  e.  NN  \/  ( j  /  2
)  e.  NN )  <-> 
( ( ( 1  +  1 )  / 
2 )  e.  NN  \/  ( 1  /  2
)  e.  NN ) ) )
7 oveq1 6092 . . . . . 6  |-  ( j  =  k  ->  (
j  +  1 )  =  ( k  +  1 ) )
87oveq1d 6100 . . . . 5  |-  ( j  =  k  ->  (
( j  +  1 )  /  2 )  =  ( ( k  +  1 )  / 
2 ) )
98eleq1d 2307 . . . 4  |-  ( j  =  k  ->  (
( ( j  +  1 )  /  2
)  e.  NN  <->  ( (
k  +  1 )  /  2 )  e.  NN ) )
10 oveq1 6092 . . . . 5  |-  ( j  =  k  ->  (
j  /  2 )  =  ( k  / 
2 ) )
1110eleq1d 2307 . . . 4  |-  ( j  =  k  ->  (
( j  /  2
)  e.  NN  <->  ( k  /  2 )  e.  NN ) )
129, 11orbi12d 805 . . 3  |-  ( j  =  k  ->  (
( ( ( j  +  1 )  / 
2 )  e.  NN  \/  ( j  /  2
)  e.  NN )  <-> 
( ( ( k  +  1 )  / 
2 )  e.  NN  \/  ( k  /  2
)  e.  NN ) ) )
13 oveq1 6092 . . . . . 6  |-  ( j  =  ( k  +  1 )  ->  (
j  +  1 )  =  ( ( k  +  1 )  +  1 ) )
1413oveq1d 6100 . . . . 5  |-  ( j  =  ( k  +  1 )  ->  (
( j  +  1 )  /  2 )  =  ( ( ( k  +  1 )  +  1 )  / 
2 ) )
1514eleq1d 2307 . . . 4  |-  ( j  =  ( k  +  1 )  ->  (
( ( j  +  1 )  /  2
)  e.  NN  <->  ( (
( k  +  1 )  +  1 )  /  2 )  e.  NN ) )
16 oveq1 6092 . . . . 5  |-  ( j  =  ( k  +  1 )  ->  (
j  /  2 )  =  ( ( k  +  1 )  / 
2 ) )
1716eleq1d 2307 . . . 4  |-  ( j  =  ( k  +  1 )  ->  (
( j  /  2
)  e.  NN  <->  ( (
k  +  1 )  /  2 )  e.  NN ) )
1815, 17orbi12d 805 . . 3  |-  ( j  =  ( k  +  1 )  ->  (
( ( ( j  +  1 )  / 
2 )  e.  NN  \/  ( j  /  2
)  e.  NN )  <-> 
( ( ( ( k  +  1 )  +  1 )  / 
2 )  e.  NN  \/  ( ( k  +  1 )  /  2
)  e.  NN ) ) )
19 oveq1 6092 . . . . . 6  |-  ( j  =  N  ->  (
j  +  1 )  =  ( N  + 
1 ) )
2019oveq1d 6100 . . . . 5  |-  ( j  =  N  ->  (
( j  +  1 )  /  2 )  =  ( ( N  +  1 )  / 
2 ) )
2120eleq1d 2307 . . . 4  |-  ( j  =  N  ->  (
( ( j  +  1 )  /  2
)  e.  NN  <->  ( ( N  +  1 )  /  2 )  e.  NN ) )
22 oveq1 6092 . . . . 5  |-  ( j  =  N  ->  (
j  /  2 )  =  ( N  / 
2 ) )
2322eleq1d 2307 . . . 4  |-  ( j  =  N  ->  (
( j  /  2
)  e.  NN  <->  ( N  /  2 )  e.  NN ) )
2421, 23orbi12d 805 . . 3  |-  ( j  =  N  ->  (
( ( ( j  +  1 )  / 
2 )  e.  NN  \/  ( j  /  2
)  e.  NN )  <-> 
( ( ( N  +  1 )  / 
2 )  e.  NN  \/  ( N  /  2
)  e.  NN ) ) )
25 df-2 9363 . . . . . . 7  |-  2  =  ( 1  +  1 )
2625oveq1i 6095 . . . . . 6  |-  ( 2  /  2 )  =  ( ( 1  +  1 )  /  2
)
27 2div2e1 9437 . . . . . 6  |-  ( 2  /  2 )  =  1
2826, 27eqtr3i 2261 . . . . 5  |-  ( ( 1  +  1 )  /  2 )  =  1
29 1nn 9315 . . . . 5  |-  1  e.  NN
3028, 29eqeltri 2311 . . . 4  |-  ( ( 1  +  1 )  /  2 )  e.  NN
3130orci 743 . . 3  |-  ( ( ( 1  +  1 )  /  2 )  e.  NN  \/  (
1  /  2 )  e.  NN )
32 peano2nn 9316 . . . . . 6  |-  ( ( k  /  2 )  e.  NN  ->  (
( k  /  2
)  +  1 )  e.  NN )
33 nncn 9312 . . . . . . . 8  |-  ( k  e.  NN  ->  k  e.  CC )
34 add1p1 9555 . . . . . . . . . 10  |-  ( k  e.  CC  ->  (
( k  +  1 )  +  1 )  =  ( k  +  2 ) )
3534oveq1d 6100 . . . . . . . . 9  |-  ( k  e.  CC  ->  (
( ( k  +  1 )  +  1 )  /  2 )  =  ( ( k  +  2 )  / 
2 ) )
36 2cn 9375 . . . . . . . . . . 11  |-  2  e.  CC
37 2ap0 9397 . . . . . . . . . . . 12  |-  2 #  0
3836, 37pm3.2i 272 . . . . . . . . . . 11  |-  ( 2  e.  CC  /\  2 #  0 )
39 divdirap 9027 . . . . . . . . . . 11  |-  ( ( k  e.  CC  /\  2  e.  CC  /\  (
2  e.  CC  /\  2 #  0 ) )  -> 
( ( k  +  2 )  /  2
)  =  ( ( k  /  2 )  +  ( 2  / 
2 ) ) )
4036, 38, 39mp3an23 1370 . . . . . . . . . 10  |-  ( k  e.  CC  ->  (
( k  +  2 )  /  2 )  =  ( ( k  /  2 )  +  ( 2  /  2
) ) )
4127oveq2i 6096 . . . . . . . . . 10  |-  ( ( k  /  2 )  +  ( 2  / 
2 ) )  =  ( ( k  / 
2 )  +  1 )
4240, 41eqtrdi 2287 . . . . . . . . 9  |-  ( k  e.  CC  ->  (
( k  +  2 )  /  2 )  =  ( ( k  /  2 )  +  1 ) )
4335, 42eqtrd 2271 . . . . . . . 8  |-  ( k  e.  CC  ->  (
( ( k  +  1 )  +  1 )  /  2 )  =  ( ( k  /  2 )  +  1 ) )
4433, 43syl 14 . . . . . . 7  |-  ( k  e.  NN  ->  (
( ( k  +  1 )  +  1 )  /  2 )  =  ( ( k  /  2 )  +  1 ) )
4544eleq1d 2307 . . . . . 6  |-  ( k  e.  NN  ->  (
( ( ( k  +  1 )  +  1 )  /  2
)  e.  NN  <->  ( (
k  /  2 )  +  1 )  e.  NN ) )
4632, 45imbitrrid 156 . . . . 5  |-  ( k  e.  NN  ->  (
( k  /  2
)  e.  NN  ->  ( ( ( k  +  1 )  +  1 )  /  2 )  e.  NN ) )
4746orim2d 800 . . . 4  |-  ( k  e.  NN  ->  (
( ( ( k  +  1 )  / 
2 )  e.  NN  \/  ( k  /  2
)  e.  NN )  ->  ( ( ( k  +  1 )  /  2 )  e.  NN  \/  ( ( ( k  +  1 )  +  1 )  /  2 )  e.  NN ) ) )
48 orcom 740 . . . 4  |-  ( ( ( ( k  +  1 )  /  2
)  e.  NN  \/  ( ( ( k  +  1 )  +  1 )  /  2
)  e.  NN )  <-> 
( ( ( ( k  +  1 )  +  1 )  / 
2 )  e.  NN  \/  ( ( k  +  1 )  /  2
)  e.  NN ) )
4947, 48imbitrdi 161 . . 3  |-  ( k  e.  NN  ->  (
( ( ( k  +  1 )  / 
2 )  e.  NN  \/  ( k  /  2
)  e.  NN )  ->  ( ( ( ( k  +  1 )  +  1 )  /  2 )  e.  NN  \/  ( ( k  +  1 )  /  2 )  e.  NN ) ) )
506, 12, 18, 24, 31, 49nnind 9320 . 2  |-  ( N  e.  NN  ->  (
( ( N  + 
1 )  /  2
)  e.  NN  \/  ( N  /  2
)  e.  NN ) )
5150orcomd 741 1  |-  ( N  e.  NN  ->  (
( N  /  2
)  e.  NN  \/  ( ( N  + 
1 )  /  2
)  e.  NN ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    \/ wo 720    = wceq 1402    e. wcel 2209   class class class wbr 4130  (class class class)co 6085   CCcc 8177   0cc0 8179   1c1 8180    + caddc 8182   # cap 8909    / cdiv 9002   NNcn 9304   2c2 9355
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-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297
This proof depends on definitions:  df-bi 117  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-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  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-po 4441  df-iso 4442  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-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-2 9363
This theorem is used by:  nneo  9749  zeo  9751
  Copyright terms: Public domain W3C validator