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

Theorem bitsp1 12665
Description: The  M  +  1-th bit of  N is the  M-th bit of  |_ ( N  /  2 ). (Contributed by Mario Carneiro, 5-Sep-2016.)
Assertion
Ref Expression
bitsp1  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( ( M  + 
1 )  e.  (bits `  N )  <->  M  e.  (bits `  ( |_ `  ( N  /  2
) ) ) ) )

Proof of Theorem bitsp1
StepHypRef Expression
1 2nn 9419 . . . . . . . . . . . 12  |-  2  e.  NN
21a1i 9 . . . . . . . . . . 11  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
2  e.  NN )
32nncnd 9271 . . . . . . . . . 10  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
2  e.  CC )
4 simpr 110 . . . . . . . . . 10  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  ->  M  e.  NN0 )
53, 4expp1d 11064 . . . . . . . . 9  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( 2 ^ ( M  +  1 ) )  =  ( ( 2 ^ M )  x.  2 ) )
62, 4nnexpcld 11085 . . . . . . . . . . 11  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( 2 ^ M
)  e.  NN )
76nncnd 9271 . . . . . . . . . 10  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( 2 ^ M
)  e.  CC )
87, 3mulcomd 8311 . . . . . . . . 9  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( ( 2 ^ M )  x.  2 )  =  ( 2  x.  ( 2 ^ M ) ) )
95, 8eqtrd 2267 . . . . . . . 8  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( 2 ^ ( M  +  1 ) )  =  ( 2  x.  ( 2 ^ M ) ) )
109oveq2d 6074 . . . . . . 7  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( N  /  (
2 ^ ( M  +  1 ) ) )  =  ( N  /  ( 2  x.  ( 2 ^ M
) ) ) )
11 simpl 109 . . . . . . . . 9  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  ->  N  e.  ZZ )
1211zcnd 9722 . . . . . . . 8  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  ->  N  e.  CC )
132nnap0d 9303 . . . . . . . 8  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
2 #  0 )
146nnap0d 9303 . . . . . . . 8  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( 2 ^ M
) #  0 )
1512, 3, 7, 13, 14divdivap1d 9116 . . . . . . 7  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( ( N  / 
2 )  /  (
2 ^ M ) )  =  ( N  /  ( 2  x.  ( 2 ^ M
) ) ) )
1610, 15eqtr4d 2270 . . . . . 6  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( N  /  (
2 ^ ( M  +  1 ) ) )  =  ( ( N  /  2 )  /  ( 2 ^ M ) ) )
1716fveq2d 5679 . . . . 5  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( |_ `  ( N  /  ( 2 ^ ( M  +  1 ) ) ) )  =  ( |_ `  ( ( N  / 
2 )  /  (
2 ^ M ) ) ) )
18 znq 9977 . . . . . . 7  |-  ( ( N  e.  ZZ  /\  2  e.  NN )  ->  ( N  /  2
)  e.  QQ )
192, 18syldan 282 . . . . . 6  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( N  /  2
)  e.  QQ )
20 flqdiv 10710 . . . . . 6  |-  ( ( ( N  /  2
)  e.  QQ  /\  ( 2 ^ M
)  e.  NN )  ->  ( |_ `  ( ( |_ `  ( N  /  2
) )  /  (
2 ^ M ) ) )  =  ( |_ `  ( ( N  /  2 )  /  ( 2 ^ M ) ) ) )
2119, 6, 20syl2anc 411 . . . . 5  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( |_ `  (
( |_ `  ( N  /  2 ) )  /  ( 2 ^ M ) ) )  =  ( |_ `  ( ( N  / 
2 )  /  (
2 ^ M ) ) ) )
2217, 21eqtr4d 2270 . . . 4  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( |_ `  ( N  /  ( 2 ^ ( M  +  1 ) ) ) )  =  ( |_ `  ( ( |_ `  ( N  /  2
) )  /  (
2 ^ M ) ) ) )
2322breq2d 4126 . . 3  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( 2  ||  ( |_ `  ( N  / 
( 2 ^ ( M  +  1 ) ) ) )  <->  2  ||  ( |_ `  ( ( |_ `  ( N  /  2 ) )  /  ( 2 ^ M ) ) ) ) )
2423notbid 673 . 2  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( -.  2  ||  ( |_ `  ( N  /  ( 2 ^ ( M  +  1 ) ) ) )  <->  -.  2  ||  ( |_
`  ( ( |_
`  ( N  / 
2 ) )  / 
( 2 ^ M
) ) ) ) )
25 peano2nn0 9556 . . 3  |-  ( M  e.  NN0  ->  ( M  +  1 )  e. 
NN0 )
26 bitsval2 12658 . . 3  |-  ( ( N  e.  ZZ  /\  ( M  +  1
)  e.  NN0 )  ->  ( ( M  + 
1 )  e.  (bits `  N )  <->  -.  2  ||  ( |_ `  ( N  /  ( 2 ^ ( M  +  1 ) ) ) ) ) )
2725, 26sylan2 286 . 2  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( ( M  + 
1 )  e.  (bits `  N )  <->  -.  2  ||  ( |_ `  ( N  /  ( 2 ^ ( M  +  1 ) ) ) ) ) )
2819flqcld 10664 . . 3  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( |_ `  ( N  /  2 ) )  e.  ZZ )
29 bitsval2 12658 . . 3  |-  ( ( ( |_ `  ( N  /  2 ) )  e.  ZZ  /\  M  e.  NN0 )  ->  ( M  e.  (bits `  ( |_ `  ( N  / 
2 ) ) )  <->  -.  2  ||  ( |_
`  ( ( |_
`  ( N  / 
2 ) )  / 
( 2 ^ M
) ) ) ) )
3028, 29sylancom 420 . 2  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( M  e.  (bits `  ( |_ `  ( N  /  2 ) ) )  <->  -.  2  ||  ( |_ `  ( ( |_ `  ( N  /  2 ) )  /  ( 2 ^ M ) ) ) ) )
3124, 27, 303bitr4d 220 1  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( ( M  + 
1 )  e.  (bits `  N )  <->  M  e.  (bits `  ( |_ `  ( N  /  2
) ) ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2205   class class class wbr 4114   ` cfv 5357  (class class class)co 6058   1c1 8144    + caddc 8146    x. cmul 8148    / cdiv 8966   NNcn 9257   2c2 9308   NN0cn0 9516   ZZcz 9597   QQcq 9972   |_cfl 10655   ^cexp 10927    || cdvds 12501  bitscbits 12654
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-mulrcl 8242  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-precex 8253  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259  ax-pre-mulgt0 8260  ax-pre-mulext 8261  ax-arch 8262
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-po 4422  df-iso 4423  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-frec 6635  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8463  df-neg 8464  df-reap 8867  df-ap 8874  df-div 8967  df-inn 9258  df-2 9316  df-n0 9517  df-z 9598  df-uz 9875  df-q 9973  df-rp 10008  df-fl 10657  df-seqfrec 10837  df-exp 10928  df-bits 12655
This theorem is referenced by:  bitsp1e  12666  bitsp1o  12667
  Copyright terms: Public domain W3C validator