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

Theorem bitsf 12657
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 12652 . 2  |- bits  =  ( n  e.  ZZ  |->  { k  e.  NN0  |  -.  2  ||  ( |_
`  ( n  / 
( 2 ^ k
) ) ) } )
2 nn0ex 9519 . . . 4  |-  NN0  e.  _V
3 ssrab2 3327 . . . 4  |-  { k  e.  NN0  |  -.  2  ||  ( |_ `  ( n  /  (
2 ^ k ) ) ) }  C_  NN0
42, 3elpwi2 4275 . . 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 5834 1  |- bits : ZZ --> ~P NN0
Colors of variables: wff set class
Syntax hints:   -. wn 3    e. wcel 2205   {crab 2526   _Vcvv 2815   ~Pcpw 3674   class class class wbr 4114   -->wf 5353   ` cfv 5357  (class class class)co 6058    / cdiv 8963   2c2 9305   NN0cn0 9513   ZZcz 9594   |_cfl 10652   ^cexp 10924    || cdvds 12498  bitscbits 12651
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 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  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-i2m1 8248
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  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-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  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-fv 5365  df-inn 9255  df-n0 9514  df-bits 12652
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator