[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-rec-2pot-pos
⊦ 2 ^ i ≤ j ∧ 0 < i → int2bits(j) = int2bits(j / 2 ^ i) + fillsgn(i→n(i + 1), int2bits(j % 2 ^ i)).rest
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
intops
,
bytes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 3
Used lemmas:
int2bits-zero
,
int2bits-mod2pot
,
Used spec theorems:
Used simplifier rules:
list
/bitlista/
a
list
/bitlista/
app-01
nat-basic2
/
c
int-abs
/
lels
int-abs
/
anti
int-abs
/
lels-04
int-abs
/
lels-03
int-mult
/
Mult-zero
int-basic2
/
add-zero
int-mult
/
zero-gr
int-basic2
/
ls-02
int-abs
/
forward-lsle
int-abs
/
forward-le-01
int-mult
/
commutativity
int-mult
/
associativity
int-abs
/
zero-gels-04
int-mult
/
zero-ge-add
intnat
/
abs-succ-03
int-basic2
/
add-a
int-basic2
/
add-c
int-pot
/
pot2-pos
int-abs
/
lels-01
int-basic1
/
ls-01
int-abs
/
forward-le-02
int-abs
/
forward-le-05
int-abs
/
forward-lels
int-pot
/
two-lsz
int-div
/
div-elim-pospos