		Search-engine friendly clone of the ACL2 documentation.

Bits/ubyte11s-digit-grouping

Bits=>leubyte11s

Group bits into unsigned 11-bit bytes, little-endian.

Signature
(bits=>leubyte11s digits) → new-digits
Arguments: digits — Guard (bit-listp digits).
Returns: new-digits — Type (ubyte11-listp new-digits).

Definitions and Theorems

Function: bits=>leubyte11s

(defun bits=>leubyte11s (digits)
  (declare (xargs :guard (bit-listp digits)))
  (declare (xargs :guard (integerp (/ (len digits) 11))))
  (let ((__function__ 'bits=>leubyte11s))
    (declare (ignorable __function__))
    (group-lendian 2 11 digits)))

Theorem: ubyte11-listp-of-bits=>leubyte11s

(defthm ubyte11-listp-of-bits=>leubyte11s
  (b* ((new-digits (bits=>leubyte11s digits)))
    (ubyte11-listp new-digits))
  :rule-classes :rewrite)

Theorem: bits=>leubyte11s-of-bit-list-fix-digits

(defthm bits=>leubyte11s-of-bit-list-fix-digits
  (equal (bits=>leubyte11s (bit-list-fix digits))
         (bits=>leubyte11s digits)))

Theorem: bits=>leubyte11s-bit-list-equiv-congruence-on-digits

(defthm bits=>leubyte11s-bit-list-equiv-congruence-on-digits
  (implies (bit-list-equiv digits digits-equiv)
           (equal (bits=>leubyte11s digits)
                  (bits=>leubyte11s digits-equiv)))
  :rule-classes :congruence)