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