Ungroup bytes into bits, big-endian.
(bebytes=>bits digits) → new-digits
Function:
(defun bebytes=>bits (digits) (declare (xargs :guard (byte-listp digits))) (let ((__function__ 'bebytes=>bits)) (declare (ignorable __function__)) (ungroup-bendian 2 8 digits)))
Theorem:
(defthm bit-listp-of-bebytes=>bits (b* ((new-digits (bebytes=>bits digits))) (bit-listp new-digits)) :rule-classes :rewrite)
Theorem:
(defthm bebytes=>bits-of-byte-list-fix-digits (equal (bebytes=>bits (byte-list-fix digits)) (bebytes=>bits digits)))
Theorem:
(defthm bebytes=>bits-byte-list-equiv-congruence-on-digits (implies (byte-list-equiv digits digits-equiv) (equal (bebytes=>bits digits) (bebytes=>bits digits-equiv))) :rule-classes :congruence)