[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-div2pot
0 ≤ i, 2 ^ i ≤ j ⊦ uint2bits(j / 2 ^ i) = butlastn(i→n(i), uint2bits(j))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
uint2bits-2potrec
,
uint2bits-div2pot-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 20
Used lemmas:
uint2bits-zero
,
uint2bits-rec
,
uint2bits-one
,
uint2bits-rec-01
,
Used spec theorems:
list-last
/bitlista/
blastN-rec
int-div
/
div-zero
int-div
/
num-ls
int-pot
/
Pot-pos
int-pot
/
div2-2pot-01
Used simplifier rules:
int-basic2
/
pred
int-mult
/
zero-gr
int-mult
/
commutativity
int-mult
/
associativity
int-div
/
nummult-ls-02
int-basic1
/
trans
int-basic1
/
lf-01
int-abs
/
forward-lels
int-abs
/
numle-02
int-pot
/
grz
int-abs
/
lels-04
int-abs
/
mone-06
int-abs
/
numls-02
int-abs
/
numadd-01
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
z
nat
/
add-01
intnat
/
rax
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
elim-sub
int-basic1
/
ls-01
int-abs
/
sub-le-01
intnat
/
labs
int-div
/
abs
int-abs
/
abs-16
int-div
/
div2-nle
int-abs
/
lels-02
nat
/
pred-03
int-abs
/
lels-03
int-abs
/
lsone
int-basic1
/
lst-01
int-abs
/
leone
int-div
/
one
int-basic1
/
lf-03
intnat
/
abs-zero
list
/bitlista/
Last
int-abs
/
lels
list
/bitlista/
Two
int-pot
/
two-leone
int-abs
/
bet-01
int-abs
/
lels-01
int-abs
/
forward-lele
int-pot
/
two-lez
int-basic1
/
lf-02
list-last
/bitlista/
butlastN-base
list
/bitlista/
app-01
list
/bitlista/
a