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