Gather all top-level expressions from a vl-modinst-p.
(vl-modinst-allexprs x) → exprs
Function:
(defun vl-modinst-allexprs (x) (declare (xargs :guard (vl-modinst-p x))) (let ((__function__ 'vl-modinst-allexprs)) (declare (ignorable __function__)) (mbe :logic (b* ((x (vl-modinst-fix x))) (b* (((vl-modinst x) x)) (append (vl-maybe-range-allexprs x.range) (vl-paramargs-allexprs x.paramargs) (vl-arguments-allexprs x.portargs) (vl-maybe-gatedelay-allexprs x.delay)))) :exec (with-local-nrev (vl-modinst-allexprs-nrev x nrev)))))
Theorem:
(defthm vl-exprlist-p-of-vl-modinst-allexprs (b* ((exprs (vl-modinst-allexprs x))) (vl-exprlist-p exprs)) :rule-classes :rewrite)
Theorem:
(defthm true-listp-of-vl-modinst-allexprs (true-listp (vl-modinst-allexprs x)) :rule-classes :type-prescription)
Theorem:
(defthm vl-modinst-allexprs-nrev-removal (equal (vl-modinst-allexprs-nrev x nrev) (append nrev (vl-modinst-allexprs x))))
Theorem:
(defthm vl-modinst-allexprs-of-vl-modinst-fix-x (equal (vl-modinst-allexprs (vl-modinst-fix x)) (vl-modinst-allexprs x)))
Theorem:
(defthm vl-modinst-allexprs-vl-modinst-equiv-congruence-on-x (implies (vl-modinst-equiv x x-equiv) (equal (vl-modinst-allexprs x) (vl-modinst-allexprs x-equiv))) :rule-classes :congruence)