(vl-modinstlist-blankfree-p x) recognizes lists where every element satisfies vl-modinst-blankfree-p.
(vl-modinstlist-blankfree-p x) → std::bool
This is an ordinary deflist. It is
"loose" in that it does not care whether
Function:
(defun vl-modinstlist-blankfree-p (x) (declare (xargs :guard (vl-modinstlist-p x))) (let ((__function__ 'vl-modinstlist-blankfree-p)) (declare (ignorable __function__)) (if (consp x) (and (vl-modinst-blankfree-p (car x)) (vl-modinstlist-blankfree-p (cdr x))) t)))
Theorem:
(defthm vl-modinstlist-blankfree-p-of-vl-modinstlist-fix-x (equal (vl-modinstlist-blankfree-p (vl-modinstlist-fix x)) (vl-modinstlist-blankfree-p x)))
Theorem:
(defthm vl-modinstlist-blankfree-p-vl-modinstlist-equiv-congruence-on-x (implies (vl-modinstlist-equiv x x-equiv) (equal (vl-modinstlist-blankfree-p x) (vl-modinstlist-blankfree-p x-equiv))) :rule-classes :congruence)