(vl-modinst-immdeps x ans &key (ss 'ss)) → new-ans
Function:
(defun vl-modinst-immdeps-fn (x ans ss) (declare (xargs :guard (and (vl-modinst-p x) (vl-immdeps-p ans) (vl-scopestack-p ss)))) (let ((__function__ 'vl-modinst-immdeps)) (declare (ignorable __function__)) (b* ((x (vl-modinst-fix x)) (ans (vl-immdeps-fix ans)) (ss (vl-scopestack-fix ss))) (b* (((vl-modinst x)) (ctx x) (ans (vl-immdeps-add-definition x.modname ans)) (ans (vl-maybe-range-immdeps x.range ans)) (ans (vl-paramargs-immdeps x.paramargs ans)) (ans (vl-arguments-immdeps x.portargs ans)) (ans (vl-maybe-gatedelay-immdeps x.delay ans))) ans))))
Theorem:
(defthm vl-immdeps-p-of-vl-modinst-immdeps (b* ((new-ans (vl-modinst-immdeps-fn x ans ss))) (vl-immdeps-p new-ans)) :rule-classes :rewrite)
Theorem:
(defthm vl-modinst-immdeps-fn-of-vl-modinst-fix-x (equal (vl-modinst-immdeps-fn (vl-modinst-fix x) ans ss) (vl-modinst-immdeps-fn x ans ss)))
Theorem:
(defthm vl-modinst-immdeps-fn-vl-modinst-equiv-congruence-on-x (implies (vl-modinst-equiv x x-equiv) (equal (vl-modinst-immdeps-fn x ans ss) (vl-modinst-immdeps-fn x-equiv ans ss))) :rule-classes :congruence)
Theorem:
(defthm vl-modinst-immdeps-fn-of-vl-immdeps-fix-ans (equal (vl-modinst-immdeps-fn x (vl-immdeps-fix ans) ss) (vl-modinst-immdeps-fn x ans ss)))
Theorem:
(defthm vl-modinst-immdeps-fn-vl-immdeps-equiv-congruence-on-ans (implies (vl-immdeps-equiv ans ans-equiv) (equal (vl-modinst-immdeps-fn x ans ss) (vl-modinst-immdeps-fn x ans-equiv ss))) :rule-classes :congruence)
Theorem:
(defthm vl-modinst-immdeps-fn-of-vl-scopestack-fix-ss (equal (vl-modinst-immdeps-fn x ans (vl-scopestack-fix ss)) (vl-modinst-immdeps-fn x ans ss)))
Theorem:
(defthm vl-modinst-immdeps-fn-vl-scopestack-equiv-congruence-on-ss (implies (vl-scopestack-equiv ss ss-equiv) (equal (vl-modinst-immdeps-fn x ans ss) (vl-modinst-immdeps-fn x ans ss-equiv))) :rule-classes :congruence)