(vl-modinst-lvalexprs-nrev x nrev) → nrev
Function:
(defun vl-modinst-lvalexprs-nrev$inline (x nrev) (declare (xargs :stobjs (nrev))) (declare (xargs :guard (vl-modinst-p x))) (let ((__function__ 'vl-modinst-lvalexprs-nrev)) (declare (ignorable __function__)) (b* ((x (vl-modinst-fix x))) (let ((args (vl-modinst->portargs x))) (if (eq (vl-arguments-kind args) :vl-arguments-named) (prog2$ (cw "; vl-modinst-lvalexprs: skipping unresolved instance ~s0 of ~s1~%" (vl-modinst->instname x) (vl-modinst->modname x)) (nrev-fix nrev)) (vl-plainarglist-lvalexprs-nrev (vl-arguments-plain->args args) nrev))))))
Theorem:
(defthm vl-modinst-lvalexprs-nrev$inline-of-vl-modinst-fix-x (equal (vl-modinst-lvalexprs-nrev$inline (vl-modinst-fix x) nrev) (vl-modinst-lvalexprs-nrev$inline x nrev)))
Theorem:
(defthm vl-modinst-lvalexprs-nrev$inline-vl-modinst-equiv-congruence-on-x (implies (vl-modinst-equiv x x-equiv) (equal (vl-modinst-lvalexprs-nrev$inline x nrev) (vl-modinst-lvalexprs-nrev$inline x-equiv nrev))) :rule-classes :congruence)