Concatenate 2 nibbles together to form an 8-bit result.
(merge-2-u4s a1 a0) → result
Function:
(defun acl2::merge-2-u4s$inline (a1 a0) (declare (type (unsigned-byte 4) a1 a0)) (declare (xargs :guard t)) (let ((__function__ 'merge-2-u4s)) (declare (ignorable __function__)) (mbe :logic (logapp* 4 (nfix a0) (nfix a1) 0) :exec (b* ((ans a0)) (the (unsigned-byte 8) (logior (the (unsigned-byte 8) (ash a1 (* 1 4))) (the (unsigned-byte 8) ans)))))))
Theorem:
(defthm acl2::natp-of-merge-2-u4s (b* ((result (acl2::merge-2-u4s$inline a1 a0))) (natp result)) :rule-classes :type-prescription)
Theorem:
(defthm unsigned-byte-p-8-of-merge-2-u4s (unsigned-byte-p 8 (merge-2-u4s a1 a0)) :rule-classes ((:rewrite :corollary (implies (>= (nfix n) 8) (unsigned-byte-p n (merge-2-u4s a1 a0))) :hints (("Goal" :in-theory (disable unsigned-byte-p))))))
Theorem:
(defthm merge-2-u4s-is-merge-unsigneds (equal (merge-2-u4s a1 a0) (merge-unsigneds 4 (list (nfix a1) (nfix a0)))))
Theorem:
(defthm nat-equiv-implies-equal-merge-2-u4s-2 (implies (nat-equiv a0 a0-equiv) (equal (merge-2-u4s a1 a0) (merge-2-u4s a1 a0-equiv))) :rule-classes (:congruence))
Theorem:
(defthm nat-equiv-implies-equal-merge-2-u4s-1 (implies (nat-equiv a1 a1-equiv) (equal (merge-2-u4s a1 a0) (merge-2-u4s a1-equiv a0))) :rule-classes (:congruence))