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

Theorem bitsp1 12505
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 9298 . . . . . . . . . . . 12  |-  2  e.  NN
21a1i 9 . . . . . . . . . . 11  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
2  e.  NN )
32nncnd 9150 . . . . . . . . . 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 10929 . . . . . . . . 9  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( 2 ^ ( M  +  1 ) )  =  ( ( 2 ^ M )  x.  2 ) )
62, 4nnexpcld 10950 . . . . . . . . . . 11  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( 2 ^ M
)  e.  NN )
76nncnd 9150 . . . . . . . . . 10  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( 2 ^ M
)  e.  CC )
87, 3mulcomd 8194 . . . . . . . . 9  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( ( 2 ^ M )  x.  2 )  =  ( 2  x.  ( 2 ^ M ) ) )
95, 8eqtrd 2262 . . . . . . . 8  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( 2 ^ ( M  +  1 ) )  =  ( 2  x.  ( 2 ^ M ) ) )
109oveq2d 6029 . . . . . . 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 9596 . . . . . . . 8  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  ->  N  e.  CC )
132nnap0d 9182 . . . . . . . 8  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
2 #  0 )
146nnap0d 9182 . . . . . . . 8  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( 2 ^ M
) #  0 )
1512, 3, 7, 13, 14divdivap1d 8995 . . . . . . 7  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( ( N  / 
2 )  /  (
2 ^ M ) )  =  ( N  /  ( 2  x.  ( 2 ^ M
) ) ) )
1610, 15eqtr4d 2265 . . . . . 6  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( N  /  (
2 ^ ( M  +  1 ) ) )  =  ( ( N  /  2 )  /  ( 2 ^ M ) ) )
1716fveq2d 5639 . . . . 5  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( |_ `  ( N  /  ( 2 ^ ( M  +  1 ) ) ) )  =  ( |_ `  ( ( N  / 
2 )  /  (
2 ^ M ) ) ) )
18 znq 9851 . . . . . . 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 10576 . . . . . 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 2265 . . . 4  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( |_ `  ( N  /  ( 2 ^ ( M  +  1 ) ) ) )  =  ( |_ `  ( ( |_ `  ( N  /  2
) )  /  (
2 ^ M ) ) ) )
2322breq2d 4098 . . 3  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( 2  ||  ( |_ `  ( N  / 
( 2 ^ ( M  +  1 ) ) ) )  <->  2  ||  ( |_ `  ( ( |_ `  ( N  /  2 ) )  /  ( 2 ^ M ) ) ) ) )
2423notbid 671 . 2  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( -.  2  ||  ( |_ `  ( N  /  ( 2 ^ ( M  +  1 ) ) ) )  <->  -.  2  ||  ( |_
`  ( ( |_
`  ( N  / 
2 ) )  / 
( 2 ^ M
) ) ) ) )
25 peano2nn0 9435 . . 3  |-  ( M  e.  NN0  ->  ( M  +  1 )  e. 
NN0 )
26 bitsval2 12498 . . 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 10530 . . 3  |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  -> 
( |_ `  ( N  /  2 ) )  e.  ZZ )
29 bitsval2 12498 . . 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 1395    e. wcel 2200   class class class wbr 4086   ` cfv 5324  (class class class)co 6013   1c1 8026    + caddc 8028    x. cmul 8030    / cdiv 8845   NNcn 9136   2c2 9187   NN0cn0 9395   ZZcz 9472   QQcq 9846   |_cfl 10521   ^cexp 10793    || cdvds 12341  bitscbits 12494
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684  ax-cnex 8116  ax-resscn 8117  ax-1cn 8118  ax-1re 8119  ax-icn 8120  ax-addcl 8121  ax-addrcl 8122  ax-mulcl 8123  ax-mulrcl 8124  ax-addcom 8125  ax-mulcom 8126  ax-addass 8127  ax-mulass 8128  ax-distr 8129  ax-i2m1 8130  ax-0lt1 8131  ax-1rid 8132  ax-0id 8133  ax-rnegex 8134  ax-precex 8135  ax-cnre 8136  ax-pre-ltirr 8137  ax-pre-ltwlin 8138  ax-pre-lttrn 8139  ax-pre-apti 8140  ax-pre-ltadd 8141  ax-pre-mulgt0 8142  ax-pre-mulext 8143  ax-arch 8144
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-if 3604  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-po 4391  df-iso 4392  df-iord 4461  df-on 4463  df-ilim 4464  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-recs 6466  df-frec 6552  df-pnf 8209  df-mnf 8210  df-xr 8211  df-ltxr 8212  df-le 8213  df-sub 8345  df-neg 8346  df-reap 8748  df-ap 8755  df-div 8846  df-inn 9137  df-2 9195  df-n0 9396  df-z 9473  df-uz 9749  df-q 9847  df-rp 9882  df-fl 10523  df-seqfrec 10703  df-exp 10794  df-bits 12495
This theorem is referenced by:  bitsp1e  12506  bitsp1o  12507
  Copyright terms: Public domain W3C validator