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

Theorem bitsfval 12493
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 6036 . . . . 5  |-  ( n  =  N  ->  ( |_ `  ( n  / 
( 2 ^ m
) ) )  =  ( |_ `  ( N  /  ( 2 ^ m ) ) ) )
21breq2d 4098 . . . 4  |-  ( n  =  N  ->  (
2  ||  ( |_ `  ( n  /  (
2 ^ m ) ) )  <->  2  ||  ( |_ `  ( N  /  ( 2 ^ m ) ) ) ) )
32notbid 671 . . 3  |-  ( n  =  N  ->  ( -.  2  ||  ( |_
`  ( n  / 
( 2 ^ m
) ) )  <->  -.  2  ||  ( |_ `  ( N  /  ( 2 ^ m ) ) ) ) )
43rabbidv 2789 . 2  |-  ( n  =  N  ->  { m  e.  NN0  |  -.  2  ||  ( |_ `  (
n  /  ( 2 ^ m ) ) ) }  =  {
m  e.  NN0  |  -.  2  ||  ( |_
`  ( N  / 
( 2 ^ m
) ) ) } )
5 df-bits 12492 . 2  |- bits  =  ( n  e.  ZZ  |->  { m  e.  NN0  |  -.  2  ||  ( |_
`  ( n  / 
( 2 ^ m
) ) ) } )
6 nn0ex 9398 . . 3  |-  NN0  e.  _V
76rabex 4232 . 2  |-  { m  e.  NN0  |  -.  2  ||  ( |_ `  ( N  /  ( 2 ^ m ) ) ) }  e.  _V
84, 5, 7fvmpt 5719 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 1395    e. wcel 2200   {crab 2512   class class class wbr 4086   ` cfv 5324  (class class class)co 6013    / cdiv 8842   2c2 9184   NN0cn0 9392   ZZcz 9469   |_cfl 10518   ^cexp 10790    || cdvds 12338  bitscbits 12491
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-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-i2m1 8127
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  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-ral 2513  df-rex 2514  df-rab 2517  df-v 2802  df-sbc 3030  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-iota 5284  df-fun 5326  df-fv 5332  df-ov 6016  df-inn 9134  df-n0 9393  df-bits 12492
This theorem is referenced by:  bitsval  12494
  Copyright terms: Public domain W3C validator