[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-fill
⊦ bits ≠ [] ∧ # bits % 8 = n ∧ n ≠ 0 → bits2bytes(bits) = bits2bytes(mklist(bits.first, 8 - n) + bits)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
fix-bits2bytes
,
fix-bits2bytes-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 20
Proof steps: 36
Used lemmas:
bits2bytes-rec-01
,
bits2bytes-base
,
bits2bytes-rec-02
,
Used spec theorems:
list-del
/bitlista/
rest-app
nat
/
sub-add
nat-mult
/
numeral-32
list-del
/bitlista/
firstn-app-02
nat
/
sub-succ
int2bits
/
bits2int-mklist
Used simplifier rules:
list-del
/bitlista/
firstN-empty
list-del
/bitlista/
firstn-first
list-del
/bitlista/
first-length
list
/bytelist/
a
list
/bytelist/
app-03
nat-basic2
/
z-01
nat-div
/
nummult-eq
nat-basic2
/
eq
nat
/
add-num-03
nat-mult
/
zero-01
nat
/
l-num-01
nat-basic2
/
succ
nat-basic1
/
trans-1
nat-basic1
/
trans
nat
/
zero-01
nat-basic2
/
l-01
nat
/
fle-01
nat
/
lep
nat
/
ls-03
nat-basic2
/
l-02
nat
/
eq-02
list
/bitlista/
c
list
/bitlista/
e-01
list
/bitlista/
len-02
list-last
/bitlista/
mk-last
int2bits
/
bits2int-mklist-01
list-data
/bitlista/
elim-list-c
byte
/
i2b-noteq
nat
/
lels-03
list
/bytelist/
c-04
nat
/
lels-01
nat-basic1
/
ls-02
list-data
/bitlista/
l
nat-basic1
/
lf-02
nat-basic2
/
z
nat
/
lep-01
nat-mult
/
mult-c
nat-mult
/
mult-a
nat-div
/
mod-mult
nat
/
prop-07
nat-basic1
/
f
nat-div
/
div-elim
nat-basic2
/
c
nat-basic2
/
a
nat
/
lep-02
nat
/
le
nat-div
/
mod-le-02
nat
/
lels
list
/bitlista/
a
list-last
/bitlista/
mk-len
list
/bitlista/
len