[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 bits2bytes-len-02
⊦ # bits % 8 ≠ 0 → # bits2bytes(bits) = # bits / 8 + 1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
fix-bits2bytes
,
fix-bits2bytes-01
,
int2bytes-bytes2int-length-01
,
int2bytes-len-adjust
,
int2bytes-len-neg256
,
int2bytes-rec-neg-02
,
int2bytes-rec-neg-05
,
int2bytes-rec-pos-any
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 9
Used lemmas:
bits2bytes-len
,
Used spec theorems:
nat
/
add-03
nat-div
/
zero-01
Used simplifier rules:
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
list-data
/bitlista/
size-01