(vl-arguments-clean-selects x ss) → new-x
Function:
(defun vl-arguments-clean-selects (x ss) (declare (xargs :guard (and (vl-arguments-p x) (vl-scopestack-p ss)))) (declare (ignorable x ss)) (let ((__function__ 'vl-arguments-clean-selects)) (declare (ignorable __function__)) (vl-arguments-case x :vl-arguments-named (change-vl-arguments-named x :args (vl-namedarglist-clean-selects x.args ss)) :vl-arguments-plain (change-vl-arguments-plain x :args (vl-plainarglist-clean-selects x.args ss)))))
Theorem:
(defthm vl-arguments-p-of-vl-arguments-clean-selects (b* ((new-x (vl-arguments-clean-selects x ss))) (vl-arguments-p new-x)) :rule-classes :rewrite)
Theorem:
(defthm vl-arguments-clean-selects-of-vl-arguments-fix-x (equal (vl-arguments-clean-selects (vl-arguments-fix x) ss) (vl-arguments-clean-selects x ss)))
Theorem:
(defthm vl-arguments-clean-selects-vl-arguments-equiv-congruence-on-x (implies (vl-arguments-equiv x x-equiv) (equal (vl-arguments-clean-selects x ss) (vl-arguments-clean-selects x-equiv ss))) :rule-classes :congruence)
Theorem:
(defthm vl-arguments-clean-selects-of-vl-scopestack-fix-ss (equal (vl-arguments-clean-selects x (vl-scopestack-fix ss)) (vl-arguments-clean-selects x ss)))
Theorem:
(defthm vl-arguments-clean-selects-vl-scopestack-equiv-congruence-on-ss (implies (vl-scopestack-equiv ss ss-equiv) (equal (vl-arguments-clean-selects x ss) (vl-arguments-clean-selects x ss-equiv))) :rule-classes :congruence)