[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-less-2pot
0 ≤ j ⊦ j < 2 ^ (n→i(# int2bits(j)) - 1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
int2bits-less-2pot-01
,
int2bits-less-2pot-02
,
int2bits-neg-03
,
int2int-neg
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 7
Used lemmas:
uint2bits-zero-01
,
int2bits-pos
,
uint2bits-empty
,
uint2bits-zero
,
int2bits-zero
,
int2bits-eq
,
int2bits-first-02
,
uint2bits-2pot
,
int2bits-not-empty
,
uint2bits-len-mon
,
Used spec theorems:
intnat
/
rax-01
Used simplifier rules:
nat-basic1
/
ref-1
nat-basic1
/
f
nat-basic2
/
c
nat-basic2
/
a
nat
/
succ-01
nat
/
le-num-02
nat
/
le
nat
/
lels-01
nat-basic1
/
one-01
nat
/
pred-03
intnat
/
n2n
list
/bitlista/
app
list
/bitlista/
c
list-data
/bitlista/
lf-01
nat-basic1
/
one
list
/bitlista/
a
list-last
/bitlista/
mk-len
list
/bitlista/
len-02
list
/bitlista/
len
int-abs
/
sub-le-01
int-abs
/
leone
intnat
/
num-n2i-ls-02
nat-basic1
/
z
list-data
/bitlista/
l
int-abs
/
lels-04
int-pot
/
two-lsz
int-abs
/
lels-01
int-abs
/
lels