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