[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-01
0 ≤ i, 0 < j ⊦ uint2bits(j * 2 ^ i) = uint2bits(j) + mklist(false, i→n(i))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
int2bits-2pot-04
,
int2bits-add-high
,
int2int-neg
,
uint2bits-2pot-06
,
uint2bits-div2pot-01
,
uint2bits-mod2pot
,
Used by units in proved state:
intops
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 11
Used lemmas:
uint2bits-rec
,
uint2bits-one
,
uint2bits-2pot
,
uint2bits-rec-01
,
Used spec theorems:
int-pot
/
div2-2pot-02
Used simplifier rules:
intnat
/
rax-04
nat-basic2
/
s
intnat
/
labs
int-abs
/
absle
int-basic1
/
irref
int-abs
/
numle-02
int-abs
/
mone-06
int-abs
/
numls-02
nat-basic2
/
c
nat-basic2
/
a
list-last
/bitlista/
mk-last
list-last
/bitlista/
mklist-one
list-last
/bitlista/
mk-plus
intnat
/
rax
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
elim-sub
int-pot
/
mod2-2pot-03
int-abs
/
lels-03
int-abs
/
lsone
int-basic1
/
lst-01
list
/bitlista/
app
list-last
/bitlista/
mk-zero
int-mult
/
one
int-basic1
/
lf-03
int-abs
/
anti
int-abs
/
lels
int-basic1
/
ls-01
list
/bitlista/
Last
int-mult
/
zero-gr
int-pot
/
grz
int-abs
/
lels-01
int-abs
/
lels-04
int-mult
/
associativity
int-mult
/
commutativity
int-mult
/
eq-one
int-abs
/
abs-16
int-mult
/
one-01
list
/bitlista/
app-03
list
/bitlista/
a
int-basic1
/
lf-02
list
/bitlista/
Two
list
/bitlista/
app-01