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