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

Theorem bitsf 12628
Description: The bits function is a function from integers to subsets of nonnegative integers. (Contributed by Mario Carneiro, 5-Sep-2016.)
Assertion
Ref Expression
bitsf  |- bits : ZZ --> ~P NN0

Proof of Theorem bitsf
Dummy variables  k  n are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-bits 12623 . 2  |- bits  =  ( n  e.  ZZ  |->  { k  e.  NN0  |  -.  2  ||  ( |_
`  ( n  / 
( 2 ^ k
) ) ) } )
2 nn0ex 9501 . . . 4  |-  NN0  e.  _V
3 ssrab2 3322 . . . 4  |-  { k  e.  NN0  |  -.  2  ||  ( |_ `  ( n  /  (
2 ^ k ) ) ) }  C_  NN0
42, 3elpwi2 4269 . . 3  |-  { k  e.  NN0  |  -.  2  ||  ( |_ `  ( n  /  (
2 ^ k ) ) ) }  e.  ~P NN0
54a1i 9 . 2  |-  ( n  e.  ZZ  ->  { k  e.  NN0  |  -.  2  ||  ( |_ `  ( n  /  (
2 ^ k ) ) ) }  e.  ~P NN0 )
61, 5fmpti 5828 1  |- bits : ZZ --> ~P NN0
Colors of variables: wff set class
Syntax hints:   -. wn 3    e. wcel 2203   {crab 2524   _Vcvv 2812   ~Pcpw 3668   class class class wbr 4108   -->wf 5347   ` cfv 5351  (class class class)co 6049    / cdiv 8945   2c2 9287   NN0cn0 9495   ZZcz 9576   |_cfl 10627   ^cexp 10899    || cdvds 12469  bitscbits 12622
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-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 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-cnex 8217  ax-resscn 8218  ax-1cn 8219  ax-1re 8220  ax-icn 8221  ax-addcl 8222  ax-addrcl 8223  ax-mulcl 8224  ax-i2m1 8231
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 2814  df-sbc 3042  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-fv 5359  df-inn 9237  df-n0 9496  df-bits 12623
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator