[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
⊦ bits ≠ [] → # bits2bytes(bits) = (# bits - 1) / 8 + 1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bits2bytes-len-01
,
bits2bytes-len-02
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 14
Used lemmas:
bits2bytes-rec
,
bits2bytes-base
,
Used spec theorems:
nat-div
/
rec
nat
/
shift
nat-div
/
zero-01
Used simplifier rules:
nat
/
not-zero
nat
/
let
nat-basic2
/
one
nat-basic1
/
one-01
nat
/
ls-02
nat-basic1
/
trans
nat-basic1
/
trans-1
nat
/
zero-01
list-del
/bitlista/
firstN-empty
list-del
/bitlista/
first-length
nat-basic1
/
ls-02
nat
/
ls-01
nat
/
lels
nat
/
lep-01
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
eq-01
list
/bytelist/
a
list
/bytelist/
len-02
list
/bytelist/
len
list
/bytelist/
Last
list-data
/bitlista/
l
nat-basic1
/
f
nat
/
lels-01