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