[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 uint2bits-2pot-neg-mone
⊦ 0 < j ∧ 0 < i → uint2bits(j * 2 ^ i - 1) = uint2bits(j - 1) + mklist(true, i→n(i))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
int2bits-2pot-neg-mone
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 16
Used lemmas:
uint2bits-inj
,
uint2bits-zero
,
uint2bits-one
,
uint2bits-rec-01
,
Used spec theorems:
int-pot
/
Pot-pos
int-div
/
two-odd
int-div
/
mod-two-pred
intnat
/
rax-01
list-last
/bitlista/
mklist-last
Used simplifier rules:
nat-basic2
/
c
list-last
/bitlista/
mk-inj-01
intnat
/
num-i2n-le-02
int-abs
/
lels-01
int-basic1
/
ls-01
nat
/
eq-02
nat-basic2
/
a
int-basic1
/
forward-pos
nat
/
pred-03
list-last
/bitlista/
mk-zero
list
/bitlista/
app
list
/bitlista/
Nil
intnat
/
abs-pred
int-abs
/
bet
int-mult
/
one
int-div
/
div-mult-num
int-div
/
mod-two-02
int-mult
/
eq-same
list
/bitlista/
Last
int-div
/
mod-two-06
int-abs
/
sub-ls-01
int-div
/
nummult-ls-02
int-mult
/
zero-gr
int-pot
/
pot2-pos
int-abs
/
sub-le-01
int-abs
/
leone
int-abs
/
lels
int-abs
/
lels-03
int-mult
/
associativity
int-mult
/
commutativity
int-abs
/
sub-eq
int-mult
/
eq-same-02
int-mult
/
eq-one
int-pot
/
abs-2pot
int-pot
/
eq-one
int-abs
/
sub-eq-01
int-mult
/
one-01
list
/bitlista/
Two
list
/bitlista/
app-01
list-last
/bitlista/
mk-one-01
intnat
/
num-i2n-eq
list
/bitlista/
a
int-abs
/
sub-pred
int-abs
/
forward-le-05