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