[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
,
Proof step 231 from proof fix-bits2bytes-01 (
previous step
)
⊦ bits ≠ [] ∧ # bits % 8 = n ∧ n ≠ 0 → bits2bytes(bits) = bits2bytes(mklist(bits.first, 8 - n) + bits)
Lemma
bits2bytes-fill