(svstate-free x) → *
Function:
(defun svstate-free (x) (declare (xargs :guard (svstate-p x))) (let ((__function__ 'svstate-free)) (declare (ignorable __function__)) (b* (((svstate x) (svstate-fix x))) (progn$ (svstack-free x.blkst) (fast-alist-free x.nonblkst) x))))
Theorem:
(defthm svstate-free-of-svstate-fix-x (equal (svstate-free (svstate-fix x)) (svstate-free x)))
Theorem:
(defthm svstate-free-svstate-equiv-congruence-on-x (implies (svstate-equiv x x-equiv) (equal (svstate-free x) (svstate-free x-equiv))) :rule-classes :congruence)