(vl-program-immdeps* x graph &key ss) → new-graph
Function:
(defun vl-program-immdeps*-fn (x graph ss) (declare (xargs :guard (and (vl-program-p x) (vl-immdepgraph-p graph) (vl-scopestack-p ss)))) (declare (ignorable ss)) (let ((__function__ 'vl-program-immdeps*)) (declare (ignorable __function__)) (b* (((vl-program x) (vl-program-fix x)) (ans (make-vl-immdeps))) (vl-immdepgraph-merge (hons-copy x.name) ans graph))))
Theorem:
(defthm vl-immdepgraph-p-of-vl-program-immdeps* (b* ((new-graph (vl-program-immdeps*-fn x graph ss))) (vl-immdepgraph-p new-graph)) :rule-classes :rewrite)
Theorem:
(defthm vl-program-immdeps*-fn-of-vl-program-fix-x (equal (vl-program-immdeps*-fn (vl-program-fix x) graph ss) (vl-program-immdeps*-fn x graph ss)))
Theorem:
(defthm vl-program-immdeps*-fn-vl-program-equiv-congruence-on-x (implies (vl-program-equiv x x-equiv) (equal (vl-program-immdeps*-fn x graph ss) (vl-program-immdeps*-fn x-equiv graph ss))) :rule-classes :congruence)
Theorem:
(defthm vl-program-immdeps*-fn-of-vl-immdepgraph-fix-graph (equal (vl-program-immdeps*-fn x (vl-immdepgraph-fix graph) ss) (vl-program-immdeps*-fn x graph ss)))
Theorem:
(defthm vl-program-immdeps*-fn-vl-immdepgraph-equiv-congruence-on-graph (implies (vl-immdepgraph-equiv graph graph-equiv) (equal (vl-program-immdeps*-fn x graph ss) (vl-program-immdeps*-fn x graph-equiv ss))) :rule-classes :congruence)
Theorem:
(defthm vl-program-immdeps*-fn-of-vl-scopestack-fix-ss (equal (vl-program-immdeps*-fn x graph (vl-scopestack-fix ss)) (vl-program-immdeps*-fn x graph ss)))
Theorem:
(defthm vl-program-immdeps*-fn-vl-scopestack-equiv-congruence-on-ss (implies (vl-scopestack-equiv ss ss-equiv) (equal (vl-program-immdeps*-fn x graph ss) (vl-program-immdeps*-fn x graph ss-equiv))) :rule-classes :congruence)