Overapproximation of all of the nodes in the graph.
(transdeps-allnodes graph) → nodes
Never executed. We just use this for termination. It's possibly an overapproximation because of shadowed pairs in the graph.
Function:
(defun transdeps-allnodes (graph) (declare (xargs :guard t)) (let ((__function__ 'transdeps-allnodes)) (declare (ignorable __function__)) (mergesort (append (alist-keys graph) (flatten (alist-vals graph))))))
Theorem:
(defthm setp-of-transdeps-allnodes (b* ((nodes (transdeps-allnodes graph))) (setp nodes)) :rule-classes :rewrite)