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

Theorem oddnn02np1 12559
Description: A nonnegative integer is odd iff it is one plus twice another nonnegative integer. (Contributed by AV, 19-Jun-2021.)
Assertion
Ref Expression
oddnn02np1  |-  ( N  e.  NN0  ->  ( -.  2  ||  N  <->  E. n  e.  NN0  ( ( 2  x.  n )  +  1 )  =  N ) )
Distinct variable group:    n, N

Proof of Theorem oddnn02np1
StepHypRef Expression
1 eleq1 2295 . . . . . . . 8  |-  ( ( ( 2  x.  n
)  +  1 )  =  N  ->  (
( ( 2  x.  n )  +  1 )  e.  NN0  <->  N  e.  NN0 ) )
2 elnn0z 9586 . . . . . . . . 9  |-  ( ( ( 2  x.  n
)  +  1 )  e.  NN0  <->  ( ( ( 2  x.  n )  +  1 )  e.  ZZ  /\  0  <_ 
( ( 2  x.  n )  +  1 ) ) )
3 2tnp1ge0ge0 10657 . . . . . . . . . . . . 13  |-  ( n  e.  ZZ  ->  (
0  <_  ( (
2  x.  n )  +  1 )  <->  0  <_  n ) )
43biimpd 144 . . . . . . . . . . . 12  |-  ( n  e.  ZZ  ->  (
0  <_  ( (
2  x.  n )  +  1 )  -> 
0  <_  n )
)
54imdistani 445 . . . . . . . . . . 11  |-  ( ( n  e.  ZZ  /\  0  <_  ( ( 2  x.  n )  +  1 ) )  -> 
( n  e.  ZZ  /\  0  <_  n )
)
65expcom 116 . . . . . . . . . 10  |-  ( 0  <_  ( ( 2  x.  n )  +  1 )  ->  (
n  e.  ZZ  ->  ( n  e.  ZZ  /\  0  <_  n ) ) )
7 elnn0z 9586 . . . . . . . . . 10  |-  ( n  e.  NN0  <->  ( n  e.  ZZ  /\  0  <_  n ) )
86, 7imbitrrdi 162 . . . . . . . . 9  |-  ( 0  <_  ( ( 2  x.  n )  +  1 )  ->  (
n  e.  ZZ  ->  n  e.  NN0 ) )
92, 8simplbiim 387 . . . . . . . 8  |-  ( ( ( 2  x.  n
)  +  1 )  e.  NN0  ->  ( n  e.  ZZ  ->  n  e.  NN0 ) )
101, 9biimtrrdi 164 . . . . . . 7  |-  ( ( ( 2  x.  n
)  +  1 )  =  N  ->  ( N  e.  NN0  ->  (
n  e.  ZZ  ->  n  e.  NN0 ) ) )
1110com13 80 . . . . . 6  |-  ( n  e.  ZZ  ->  ( N  e.  NN0  ->  (
( ( 2  x.  n )  +  1 )  =  N  ->  n  e.  NN0 ) ) )
1211impcom 125 . . . . 5  |-  ( ( N  e.  NN0  /\  n  e.  ZZ )  ->  ( ( ( 2  x.  n )  +  1 )  =  N  ->  n  e.  NN0 ) )
1312pm4.71rd 394 . . . 4  |-  ( ( N  e.  NN0  /\  n  e.  ZZ )  ->  ( ( ( 2  x.  n )  +  1 )  =  N  <-> 
( n  e.  NN0  /\  ( ( 2  x.  n )  +  1 )  =  N ) ) )
1413bicomd 141 . . 3  |-  ( ( N  e.  NN0  /\  n  e.  ZZ )  ->  ( ( n  e. 
NN0  /\  ( (
2  x.  n )  +  1 )  =  N )  <->  ( (
2  x.  n )  +  1 )  =  N ) )
1514rexbidva 2539 . 2  |-  ( N  e.  NN0  ->  ( E. n  e.  ZZ  (
n  e.  NN0  /\  ( ( 2  x.  n )  +  1 )  =  N )  <->  E. n  e.  ZZ  ( ( 2  x.  n )  +  1 )  =  N ) )
16 nn0ssz 9591 . . 3  |-  NN0  C_  ZZ
17 rexss 3304 . . 3  |-  ( NN0  C_  ZZ  ->  ( E. n  e.  NN0  ( ( 2  x.  n )  +  1 )  =  N  <->  E. n  e.  ZZ  ( n  e.  NN0  /\  ( ( 2  x.  n )  +  1 )  =  N ) ) )
1816, 17mp1i 10 . 2  |-  ( N  e.  NN0  ->  ( E. n  e.  NN0  (
( 2  x.  n
)  +  1 )  =  N  <->  E. n  e.  ZZ  ( n  e. 
NN0  /\  ( (
2  x.  n )  +  1 )  =  N ) ) )
19 nn0z 9593 . . 3  |-  ( N  e.  NN0  ->  N  e.  ZZ )
20 odd2np1 12552 . . 3  |-  ( N  e.  ZZ  ->  ( -.  2  ||  N  <->  E. n  e.  ZZ  ( ( 2  x.  n )  +  1 )  =  N ) )
2119, 20syl 14 . 2  |-  ( N  e.  NN0  ->  ( -.  2  ||  N  <->  E. n  e.  ZZ  ( ( 2  x.  n )  +  1 )  =  N ) )
2215, 18, 213bitr4rd 221 1  |-  ( N  e.  NN0  ->  ( -.  2  ||  N  <->  E. n  e.  NN0  ( ( 2  x.  n )  +  1 )  =  N ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2203   E.wrex 2521    C_ wss 3210   class class class wbr 4108  (class class class)co 6049   0cc0 8123   1c1 8124    + caddc 8126    x. cmul 8128    <_ cle 8305   2c2 9284   NN0cn0 9492   ZZcz 9573    || cdvds 12466
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-cnex 8214  ax-resscn 8215  ax-1cn 8216  ax-1re 8217  ax-icn 8218  ax-addcl 8219  ax-addrcl 8220  ax-mulcl 8221  ax-mulrcl 8222  ax-addcom 8223  ax-mulcom 8224  ax-addass 8225  ax-mulass 8226  ax-distr 8227  ax-i2m1 8228  ax-0lt1 8229  ax-1rid 8230  ax-0id 8231  ax-rnegex 8232  ax-precex 8233  ax-cnre 8234  ax-pre-ltirr 8235  ax-pre-ltwlin 8236  ax-pre-lttrn 8237  ax-pre-apti 8238  ax-pre-ltadd 8239  ax-pre-mulgt0 8240  ax-pre-mulext 8241
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-xor 1421  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2814  df-sbc 3042  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-br 4109  df-opab 4171  df-id 4413  df-po 4416  df-iso 4417  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-iota 5311  df-fun 5353  df-fv 5359  df-riota 6002  df-ov 6052  df-oprab 6053  df-mpo 6054  df-pnf 8306  df-mnf 8307  df-xr 8308  df-ltxr 8309  df-le 8310  df-sub 8442  df-neg 8443  df-reap 8845  df-ap 8852  df-div 8943  df-inn 9234  df-2 9292  df-n0 9493  df-z 9574  df-dvds 12467
This theorem is referenced by:  oddge22np1  12560  2lgslem1c  15950
  Copyright terms: Public domain W3C validator