(vl-slicesize->subexprs x) → subexprs
Function:
(defun vl-slicesize->subexprs (x) (declare (xargs :guard (vl-slicesize-p x))) (let ((__function__ 'vl-slicesize->subexprs)) (declare (ignorable __function__)) (vl-slicesize-case x :expr (list x.expr) :otherwise nil)))
Theorem:
(defthm vl-exprlist-p-of-vl-slicesize->subexprs (b* ((subexprs (vl-slicesize->subexprs x))) (vl-exprlist-p subexprs)) :rule-classes :rewrite)
Theorem:
(defthm vl-exprlist-count-of-vl-slicesize->subexprs (b* ((?subexprs (vl-slicesize->subexprs x))) (<= (vl-exprlist-count subexprs) (vl-slicesize-count x))) :rule-classes :linear)
Theorem:
(defthm vl-slicesize->subexprs-of-vl-slicesize-fix-x (equal (vl-slicesize->subexprs (vl-slicesize-fix x)) (vl-slicesize->subexprs x)))
Theorem:
(defthm vl-slicesize->subexprs-vl-slicesize-equiv-congruence-on-x (implies (vl-slicesize-equiv x x-equiv) (equal (vl-slicesize->subexprs x) (vl-slicesize->subexprs x-equiv))) :rule-classes :congruence)