(update-parstate->bytes bytes parstate) → parstate
Function:
(defun update-parstate->bytes (bytes parstate) (declare (xargs :stobjs (parstate))) (declare (xargs :guard (byte-listp bytes))) (let ((__function__ 'update-parstate->bytes)) (declare (ignorable __function__)) (b* ((parstate (parstate-fix parstate))) (raw-update-parstate->bytes (byte-list-fix bytes) parstate))))
Theorem:
(defthm parstatep-of-update-parstate->bytes (b* ((parstate (update-parstate->bytes bytes parstate))) (parstatep parstate)) :rule-classes :rewrite)
Theorem:
(defthm update-parstate->bytes-of-byte-list-fix-bytes (equal (update-parstate->bytes (byte-list-fix bytes) parstate) (update-parstate->bytes bytes parstate)))
Theorem:
(defthm update-parstate->bytes-byte-list-equiv-congruence-on-bytes (implies (acl2::byte-list-equiv bytes bytes-equiv) (equal (update-parstate->bytes bytes parstate) (update-parstate->bytes bytes-equiv parstate))) :rule-classes :congruence)
Theorem:
(defthm update-parstate->bytes-of-parstate-fix-parstate (equal (update-parstate->bytes bytes (parstate-fix parstate)) (update-parstate->bytes bytes parstate)))
Theorem:
(defthm update-parstate->bytes-parstate-equiv-congruence-on-parstate (implies (parstate-equiv parstate parstate-equiv) (equal (update-parstate->bytes bytes parstate) (update-parstate->bytes bytes parstate-equiv))) :rule-classes :congruence)