(parstate->bytes parstate) → bytes
Function:
(defun parstate->bytes (parstate) (declare (xargs :stobjs (parstate))) (declare (xargs :guard t)) (let ((__function__ 'parstate->bytes)) (declare (ignorable __function__)) (mbe :logic (if (parstatep parstate) (raw-parstate->bytes parstate) nil) :exec (raw-parstate->bytes parstate))))
Theorem:
(defthm byte-listp-of-parstate->bytes (b* ((bytes (parstate->bytes parstate))) (byte-listp bytes)) :rule-classes :rewrite)
Theorem:
(defthm true-listp-of-parstate->bytes (b* ((bytes (parstate->bytes parstate))) (true-listp bytes)) :rule-classes :type-prescription)
Theorem:
(defthm parstate->bytes-of-parstate-fix-parstate (equal (parstate->bytes (parstate-fix parstate)) (parstate->bytes parstate)))
Theorem:
(defthm parstate->bytes-parstate-equiv-congruence-on-parstate (implies (parstate-equiv parstate parstate-equiv) (equal (parstate->bytes parstate) (parstate->bytes parstate-equiv))) :rule-classes :congruence)