[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-len-add
⊦ j < 0 ∧ j0 < 0 ∧ abs(j0) < 2 ^ i ∧ 0 ≤ i → # int2bits(~(j * 2 ^ i + j0)) = # int2bits(~ j) + i→n(i)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
int2bits-add-high
,
int2bits-add-low
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 11
Used lemmas:
uint2bits-len-add
,
int2bits-pos
,
Used spec theorems:
int-mult
/
commutativity
int-mult
/
zero-gr-add-01
Used simplifier rules:
int-abs
/
zero-gels-03
int-abs
/
zero-gels-01
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
eq-01
int-abs
/
neg
int-abs
/
lels-04
int-mult
/
commutativity
int-mult
/
minus-left
int-mult
/
associativity
int-abs
/
neg-11
int-abs
/
neg-12
int-abs
/
forward-le-04
int-pot
/
two-lsz
int-abs
/
lels
int-abs
/
lels-03
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
/
forward-le-01
int-abs
/
forward-le-02
int-abs
/
forward-le-05
int-abs
/
neg-13
int-abs
/
abs-08