(vl-datatypelist-resolved-p x) → *
Function:
(defun vl-datatypelist-resolved-p (x) (declare (xargs :guard (vl-datatypelist-p x))) (let ((__function__ 'vl-datatypelist-resolved-p)) (declare (ignorable __function__)) (if (atom x) t (and (vl-datatype-resolved-p (car x)) (vl-datatypelist-resolved-p (cdr x))))))
Theorem:
(defthm vl-datatypelist-resolved-p-of-repeat (implies (vl-datatype-resolved-p x) (vl-datatypelist-resolved-p (repeat n x))))
Theorem:
(defthm vl-datatypelist-resolved-p-of-vl-datatypelist-fix-x (equal (vl-datatypelist-resolved-p (vl-datatypelist-fix x)) (vl-datatypelist-resolved-p x)))
Theorem:
(defthm vl-datatypelist-resolved-p-vl-datatypelist-equiv-congruence-on-x (implies (vl-datatypelist-equiv x x-equiv) (equal (vl-datatypelist-resolved-p x) (vl-datatypelist-resolved-p x-equiv))) :rule-classes :congruence)