(vl-assignpat->subexprs x) → subexprs
Function:
(defun vl-assignpat->subexprs (x) (declare (xargs :guard (vl-assignpat-p x))) (let ((__function__ 'vl-assignpat->subexprs)) (declare (ignorable __function__)) (vl-assignpat-case x :positional x.vals :keyval (vl-keyvallist->subexprs x.pairs) :repeat (cons x.reps x.vals))))
Theorem:
(defthm vl-exprlist-p-of-vl-assignpat->subexprs (b* ((subexprs (vl-assignpat->subexprs x))) (vl-exprlist-p subexprs)) :rule-classes :rewrite)
Theorem:
(defthm vl-exprlist-count-of-vl-assignpat->subexprs (b* ((?subexprs (vl-assignpat->subexprs x))) (< (vl-exprlist-count subexprs) (vl-assignpat-count x))) :rule-classes :linear)
Theorem:
(defthm vl-assignpat->subexprs-of-vl-assignpat-fix-x (equal (vl-assignpat->subexprs (vl-assignpat-fix x)) (vl-assignpat->subexprs x)))
Theorem:
(defthm vl-assignpat->subexprs-vl-assignpat-equiv-congruence-on-x (implies (vl-assignpat-equiv x x-equiv) (equal (vl-assignpat->subexprs x) (vl-assignpat->subexprs x-equiv))) :rule-classes :congruence)