[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-mklist
⊦ n % 8 = 0 ∧ n ≠ 0 → bits2bytes(mklist(false, n)) = mklist(i2b(0), n / 8)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bits2bytes-mklist-01
,
fix-bits2bytes
,
fix-bits2bytes-01
,
int2bytes-rec-neg-01
,
int2bytes-rec-neg-04
,
int2bytes-rec-pos-any
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 12
Proof steps: 23
Used lemmas:
bits2bytes-base
,
bits2bytes-rec
,
Used spec theorems:
nat-mult
/
leone
list-del
/bitlista/
first-mklist
list-del
/bitlista/
lastn-mklist
nat-div
/
modex
nat-mult
/
ls-04
nat-mult
/
dist-sub-01
nat-div
/
rec
Used simplifier rules:
list-last
/bytelist/
mk-plus
list-last
/bytelist/
mklist-one
list
/bytelist/
app-01
list
/bytelist/
a
list-last
/bytelist/
mk-last
nat
/
zero-01
nat-div
/
mod-mult-01
nat-basic1
/
one
nat
/
ls-01
nat
/
lep-01
int2bits
/
bits2uint-one-02
int2bits
/
bits2uint-zero
int2bits
/
bits2int-pos
list
/bitlista/
a
list
/bitlista/
app
list-last
/bitlista/
mk-zero
bitlista
/
mklist-num
nat
/
lep
nat
/
lels-03
nat-basic1
/
ls-02
nat
/
ls-03
nat-basic2
/
l-02
nat-basic2
/
a
nat-basic2
/
c
nat-basic1
/
f
list
/bytelist/
Last
nat
/
one-02
nat-div
/
div-mult
nat-mult
/
mult-c
nat-mult
/
mult-a
nat-mult
/
zero-01
list-last
/bytelist/
mk-one-01
int2bits
/
bits2int-zeros-03
nat
/
lels-01
nat
/
le-ls-simp
nat
/
lels
list-last
/bitlista/
mk-len