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

Theorem bitsfval 12628
Description: Expand the definition of the bits of an integer. (Contributed by Mario Carneiro, 5-Sep-2016.)
Assertion
Ref Expression
bitsfval  |-  ( N  e.  ZZ  ->  (bits `  N )  =  {
m  e.  NN0  |  -.  2  ||  ( |_
`  ( N  / 
( 2 ^ m
) ) ) } )
Distinct variable group:    m, N

Proof of Theorem bitsfval
Dummy variable  n is distinct from all other variables.
StepHypRef Expression
1 fvoveq1 6073 . . . . 5  |-  ( n  =  N  ->  ( |_ `  ( n  / 
( 2 ^ m
) ) )  =  ( |_ `  ( N  /  ( 2 ^ m ) ) ) )
21breq2d 4121 . . . 4  |-  ( n  =  N  ->  (
2  ||  ( |_ `  ( n  /  (
2 ^ m ) ) )  <->  2  ||  ( |_ `  ( N  /  ( 2 ^ m ) ) ) ) )
32notbid 673 . . 3  |-  ( n  =  N  ->  ( -.  2  ||  ( |_
`  ( n  / 
( 2 ^ m
) ) )  <->  -.  2  ||  ( |_ `  ( N  /  ( 2 ^ m ) ) ) ) )
43rabbidv 2802 . 2  |-  ( n  =  N  ->  { m  e.  NN0  |  -.  2  ||  ( |_ `  (
n  /  ( 2 ^ m ) ) ) }  =  {
m  e.  NN0  |  -.  2  ||  ( |_
`  ( N  / 
( 2 ^ m
) ) ) } )
5 df-bits 12627 . 2  |- bits  =  ( n  e.  ZZ  |->  { m  e.  NN0  |  -.  2  ||  ( |_
`  ( n  / 
( 2 ^ m
) ) ) } )
6 nn0ex 9502 . . 3  |-  NN0  e.  _V
76rabex 4256 . 2  |-  { m  e.  NN0  |  -.  2  ||  ( |_ `  ( N  /  ( 2 ^ m ) ) ) }  e.  _V
84, 5, 7fvmpt 5754 1  |-  ( N  e.  ZZ  ->  (bits `  N )  =  {
m  e.  NN0  |  -.  2  ||  ( |_
`  ( N  / 
( 2 ^ m
) ) ) } )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    = wceq 1398    e. wcel 2203   {crab 2524   class class class wbr 4109   ` cfv 5352  (class class class)co 6050    / cdiv 8946   2c2 9288   NN0cn0 9496   ZZcz 9577   |_cfl 10628   ^cexp 10900    || cdvds 12473  bitscbits 12626
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-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-i2m1 8232
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  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-ral 2525  df-rex 2526  df-rab 2529  df-v 2815  df-sbc 3043  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-mpt 4173  df-id 4414  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-ov 6053  df-inn 9238  df-n0 9497  df-bits 12627
This theorem is referenced by:  bitsval  12629
  Copyright terms: Public domain W3C validator