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

Theorem 2tp1odd 12570
Description: A number which is twice an integer increased by 1 is odd. (Contributed by AV, 16-Jul-2021.)
Assertion
Ref Expression
2tp1odd  |-  ( ( A  e.  ZZ  /\  B  =  ( (
2  x.  A )  +  1 ) )  ->  -.  2  ||  B )

Proof of Theorem 2tp1odd
Dummy variable  k is distinct from all other variables.
StepHypRef Expression
1 id 19 . . . . 5  |-  ( A  e.  ZZ  ->  A  e.  ZZ )
2 oveq2 6058 . . . . . . . 8  |-  ( k  =  A  ->  (
2  x.  k )  =  ( 2  x.  A ) )
32oveq1d 6065 . . . . . . 7  |-  ( k  =  A  ->  (
( 2  x.  k
)  +  1 )  =  ( ( 2  x.  A )  +  1 ) )
43eqeq1d 2241 . . . . . 6  |-  ( k  =  A  ->  (
( ( 2  x.  k )  +  1 )  =  ( ( 2  x.  A )  +  1 )  <->  ( (
2  x.  A )  +  1 )  =  ( ( 2  x.  A )  +  1 ) ) )
54adantl 277 . . . . 5  |-  ( ( A  e.  ZZ  /\  k  =  A )  ->  ( ( ( 2  x.  k )  +  1 )  =  ( ( 2  x.  A
)  +  1 )  <-> 
( ( 2  x.  A )  +  1 )  =  ( ( 2  x.  A )  +  1 ) ) )
6 eqidd 2233 . . . . 5  |-  ( A  e.  ZZ  ->  (
( 2  x.  A
)  +  1 )  =  ( ( 2  x.  A )  +  1 ) )
71, 5, 6rspcedvd 2927 . . . 4  |-  ( A  e.  ZZ  ->  E. k  e.  ZZ  ( ( 2  x.  k )  +  1 )  =  ( ( 2  x.  A
)  +  1 ) )
8 2z 9605 . . . . . . . 8  |-  2  e.  ZZ
98a1i 9 . . . . . . 7  |-  ( A  e.  ZZ  ->  2  e.  ZZ )
109, 1zmulcld 9706 . . . . . 6  |-  ( A  e.  ZZ  ->  (
2  x.  A )  e.  ZZ )
1110peano2zd 9703 . . . . 5  |-  ( A  e.  ZZ  ->  (
( 2  x.  A
)  +  1 )  e.  ZZ )
12 odd2np1 12559 . . . . 5  |-  ( ( ( 2  x.  A
)  +  1 )  e.  ZZ  ->  ( -.  2  ||  ( ( 2  x.  A )  +  1 )  <->  E. k  e.  ZZ  ( ( 2  x.  k )  +  1 )  =  ( ( 2  x.  A
)  +  1 ) ) )
1311, 12syl 14 . . . 4  |-  ( A  e.  ZZ  ->  ( -.  2  ||  ( ( 2  x.  A )  +  1 )  <->  E. k  e.  ZZ  ( ( 2  x.  k )  +  1 )  =  ( ( 2  x.  A
)  +  1 ) ) )
147, 13mpbird 167 . . 3  |-  ( A  e.  ZZ  ->  -.  2  ||  ( ( 2  x.  A )  +  1 ) )
1514adantr 276 . 2  |-  ( ( A  e.  ZZ  /\  B  =  ( (
2  x.  A )  +  1 ) )  ->  -.  2  ||  ( ( 2  x.  A )  +  1 ) )
16 breq2 4113 . . 3  |-  ( B  =  ( ( 2  x.  A )  +  1 )  ->  (
2  ||  B  <->  2  ||  ( ( 2  x.  A )  +  1 ) ) )
1716adantl 277 . 2  |-  ( ( A  e.  ZZ  /\  B  =  ( (
2  x.  A )  +  1 ) )  ->  ( 2  ||  B 
<->  2  ||  ( ( 2  x.  A )  +  1 ) ) )
1815, 17mtbird 680 1  |-  ( ( A  e.  ZZ  /\  B  =  ( (
2  x.  A )  +  1 ) )  ->  -.  2  ||  B )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2203   E.wrex 2521   class class class wbr 4109  (class class class)co 6050   1c1 8128    + caddc 8130    x. cmul 8132   2c2 9288   ZZcz 9577    || cdvds 12473
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 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-mulrcl 8226  ax-addcom 8227  ax-mulcom 8228  ax-addass 8229  ax-mulass 8230  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-1rid 8234  ax-0id 8235  ax-rnegex 8236  ax-precex 8237  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-apti 8242  ax-pre-ltadd 8243  ax-pre-mulgt0 8244  ax-pre-mulext 8245
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 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-br 4110  df-opab 4172  df-id 4414  df-po 4417  df-iso 4418  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-iota 5312  df-fun 5354  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-reap 8849  df-ap 8856  df-div 8947  df-inn 9238  df-2 9296  df-n0 9497  df-z 9578  df-dvds 12474
This theorem is referenced by:  2lgslem3b1  15971  2lgslem3c1  15972
  Copyright terms: Public domain W3C validator