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