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