[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-neg-02
j < 0, ¬(∃ i. ~(2 ^ i) = j) ⊦ int2bits(j) = int2bits(2 ^ n→i(# int2bits(~ j)) + j).rest
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
int2bits-add-low
,
int2bits-neg-04
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 6
Used lemmas:
int2bits-restsgn
,
int2bits-neg-03
,
Used spec theorems:
Used simplifier rules:
int-abs
/
subneg
int-basic2
/
succ-01
int-basic2
/
ls
int-basic1
/
trans
int-basic1
/
lf-01
int-basic1
/
lf-03
int-basic2
/
ls-02
int-basic1
/
lf-02
int-basic1
/
ls-01
int-abs
/
lels-01
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
add-zero
int-abs
/
negle-07
int-abs
/
negeq