[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-lelen-04
⊦ i < 0 ∧ 0 ≤ j ∧ ~ i ≠ 2 ^ j → (2 ^ j + i ≤ 0 ↔ ¬ # int2bits(i) ≤ i→n(j) + 1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
int2bits-add-low
,
int2bits-lelen-07
,
Used by units in proved state:
bytes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 1
Used lemmas:
uint2bits-one
,
int2bits-neg-num
,
int2bits-lelen-03
,
Used spec theorems:
Used simplifier rules:
int-basic1
/
lf-01
int-abs
/
numlef
int-basic1
/
numlsf
int-basic1
/
lf-02
int-abs
/
anti
int-basic1
/
ls-01
int-abs
/
lels-01
int-basic2
/
add-zero
int-abs
/
numsub
intnat
/
i2i-pos-01
intnat
/
n2i-add
int-abs
/
negeq
int-basic2
/
add-c
int-abs
/
lels-02
int-abs
/
lels
int-abs
/
mone-08
int-abs
/
forward-lsle
int-basic1
/
lf-03
int-abs
/
mone-01
int-basic2
/
add-a
int-abs
/
sub-ls
int-pot
/
2pot-leone
int-abs
/
lels-04
list
/bitlista/
Two
bitopsaux
/
invert-zero
bitopsaux
/
inv-one-01
list
/bitlista/
c
list
/bitlista/
a
bitopsaux
/
succ-zero
list
/bitlista/
Last
bitopsaux
/
sgn-two-01
list
/bitlista/
len-02
nat
/
lels-01
nat-basic2
/
l-02
nat-basic2
/
a
nat-basic2
/
c