[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 int2bytes-len-def
⊦ # int2bytes(i) = (# int2bits(i))-1 / 8 + 1
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: 9
Proof steps: 15
Used lemmas:
int2bytes-len-adjust
,
int2bytes-len-fits
,
Used spec theorems:
nat
/
add-03
nat-div
/
zero-01
Used simplifier rules:
nat
/
add-01
nat-mult
/
coef-17
nat
/
eq-02
list-data
/bitlista/
l
int2bits
/
int2bits-not-empty
nat-basic2
/
z
nat
/
ls-01
nat
/
lels
nat
/
fle-01
nat
/
not-zero
nat-basic2
/
eq
nat-mult
/
mult-c
nat-mult
/
mult-a
nat-div
/
mult
nat
/
lels-01
nat-basic1
/
one-01
nat-basic1
/
f
nat-div
/
div-elim
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
eq-01
nat
/
pred-03