[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Theorem int2bits-leneq-pos
⊦ 0 ≤ j ∧ 1 < n → (# int2bits(j) = n ↔ 2 ^ (n→i(n) - 2) ≤ j ∧ j < 2 ^ (n→i(n) - 1))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
intops
,
bytes
,
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 17
Used lemmas:
int2bits-len-pos
,
int2bits-lelen-01
,
int2bits-lslen-01
,
int2bits-not-empty
,
int2bits-len-one
,
Used spec theorems:
intnat
/
sub
intnat
/
num-n2i-eq
Used simplifier rules:
int-abs
/
Sub-def
int-abs
/
minus-add
nat
/
ler
intnat
/
le
int-abs
/
succ-02
int-abs
/
numsub
int-abs
/
sub-add-01
int-abs
/
sub-ls
int-pot
/
ls-pos-2pot-01
nat-basic1
/
twols-01
int-abs
/
forward-lels
intnat
/
minus-one
int-basic1
/
numlsf
int-abs
/
numle-02
int-abs
/
numadd-01
int-abs
/
mone-06
intnat
/
rax-04
nat-basic2
/
l
int-abs
/
elim-sub
int-abs
/
leone
nat-basic1
/
zero
int-abs
/
lels
nat-basic1
/
lf-01
nat
/
add-num-03
nat
/
add-num-04
nat-basic2
/
eq
nat-basic2
/
l-01
nat
/
le-num-02
nat
/
le-add
nat
/
elim-sub
nat
/
zero-01
intnat
/
n2n
nat
/
lels-02
nat-basic2
/
c
nat-basic2
/
a
intnat
/
num-i2n-eq
intnat
/
num-n2i-eq
int-abs
/
sub-eq
intnat
/
abs-zero
nat
/
l-num-04
nat
/
fle
nat
/
lels-01
nat-basic1
/
ls-02
nat-basic1
/
f
nat
/
lels-03
intnat
/
num-n2i-ls-02
int-abs
/
sub-ls-01
int-pot
/
pot2-pos-01
intnat
/
num-n2i-ls-06
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
sub-le-01
int-pot
/
pot2-pos
int-basic1
/
forward-pos
int-abs
/
lels-01
int-abs
/
forward-le-05
int-abs
/
lels-02
list-data
/bitlista/
l
int-abs
/
forward-le-01
nat-basic1
/
one