[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-01
⊦ n % 8 ≠ 0 → bits2bytes(mklist(false, n)) = mklist(i2b(0), n / 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: 10
Proof steps: 16
Used lemmas:
bits2bytes-mklist
,
bits2bytes-base
,
bits2bytes-app
,
Used spec theorems:
nat-mult
/
zero-01
list-last
/bitlista/
mk-plus
Used simplifier rules:
nat-div
/
mult-01
list-last
/bytelist/
mk-inj-01
nat
/
lels-03
list
/bytelist/
app-01
nat-mult
/
zero-01
list
/bytelist/
c-04
int2bits
/
bits2int-zeros-03
nat
/
lels-01
nat-basic1
/
ls-02
list
/bytelist/
app
list-last
/bytelist/
mk-zero
list
/bitlista/
a
list
/bitlista/
app
list-last
/bitlista/
mk-zero
list-last
/bitlista/
mk-empty
nat-mult
/
mult-c
nat-mult
/
mult-a
nat-div
/
mod-mult-01
list-last
/bitlista/
mk-len
nat-basic1
/
f
list-last
/bitlista/
mk-plus
nat-basic2
/
c
nat-basic2
/
a
list
/bytelist/
a
list-last
/bytelist/
mk-last
list-last
/bytelist/
mklist-one
list-last
/bytelist/
mk-plus
nat-div
/
div-elim