Substitute into a vl-gatedelay-p.
(vl-gatedelay-subst x sigma) → new-x
Function:
(defun vl-gatedelay-subst (x sigma) (declare (xargs :guard (and (vl-gatedelay-p x) (vl-sigma-p sigma)))) (declare (ignorable x sigma)) (let ((__function__ 'vl-gatedelay-subst)) (declare (ignorable __function__)) (change-vl-gatedelay x :rise (vl-expr-subst (vl-gatedelay->rise x) sigma) :fall (vl-expr-subst (vl-gatedelay->fall x) sigma) :high (vl-maybe-expr-subst (vl-gatedelay->high x) sigma))))
Theorem:
(defthm vl-gatedelay-p-of-vl-gatedelay-subst (b* ((new-x (vl-gatedelay-subst x sigma))) (vl-gatedelay-p new-x)) :rule-classes :rewrite)
Theorem:
(defthm vl-gatedelay-subst-of-vl-gatedelay-fix-x (equal (vl-gatedelay-subst (vl-gatedelay-fix x) sigma) (vl-gatedelay-subst x sigma)))
Theorem:
(defthm vl-gatedelay-subst-vl-gatedelay-equiv-congruence-on-x (implies (vl-gatedelay-equiv x x-equiv) (equal (vl-gatedelay-subst x sigma) (vl-gatedelay-subst x-equiv sigma))) :rule-classes :congruence)
Theorem:
(defthm vl-gatedelay-subst-of-vl-sigma-fix-sigma (equal (vl-gatedelay-subst x (vl-sigma-fix sigma)) (vl-gatedelay-subst x sigma)))
Theorem:
(defthm vl-gatedelay-subst-vl-sigma-equiv-congruence-on-sigma (implies (vl-sigma-equiv sigma sigma-equiv) (equal (vl-gatedelay-subst x sigma) (vl-gatedelay-subst x sigma-equiv))) :rule-classes :congruence)