(vl-maybe-exprlist->subexprs x) → subexprs
Function:
(defun vl-maybe-exprlist->subexprs (x) (declare (xargs :guard (vl-maybe-exprlist-p x))) (let ((__function__ 'vl-maybe-exprlist->subexprs)) (declare (ignorable __function__)) (if (atom x) nil (if (car x) (cons (vl-expr-fix (car x)) (vl-maybe-exprlist->subexprs (cdr x))) (vl-maybe-exprlist->subexprs (cdr x))))))
Theorem:
(defthm vl-exprlist-p-of-vl-maybe-exprlist->subexprs (b* ((subexprs (vl-maybe-exprlist->subexprs x))) (vl-exprlist-p subexprs)) :rule-classes :rewrite)
Theorem:
(defthm vl-exprlist-count-of-vl-maybe-exprlist->subexprs (b* ((?subexprs (vl-maybe-exprlist->subexprs x))) (<= (vl-exprlist-count subexprs) (vl-maybe-exprlist-count x))) :rule-classes :linear)
Theorem:
(defthm vl-maybe-exprlist->subexprs-of-vl-maybe-exprlist-fix-x (equal (vl-maybe-exprlist->subexprs (vl-maybe-exprlist-fix x)) (vl-maybe-exprlist->subexprs x)))
Theorem:
(defthm vl-maybe-exprlist->subexprs-vl-maybe-exprlist-equiv-congruence-on-x (implies (vl-maybe-exprlist-equiv x x-equiv) (equal (vl-maybe-exprlist->subexprs x) (vl-maybe-exprlist->subexprs x-equiv))) :rule-classes :congruence)