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