(vl-bitlist-to-sized-exprs x) maps vl-bit-to-sized-expr across a list.
(vl-bitlist-to-sized-exprs x) → *
This is an ordinary defprojection.
Function:
(defun vl-bitlist-to-sized-exprs-exec (x acc) (declare (xargs :guard (vl-bitlist-p x))) (let ((__function__ 'vl-bitlist-to-sized-exprs-exec)) (declare (ignorable __function__)) (if (consp x) (vl-bitlist-to-sized-exprs-exec (cdr x) (cons (vl-bit-to-sized-expr (car x)) acc)) acc)))
Function:
(defun vl-bitlist-to-sized-exprs-nrev (x nrev) (declare (xargs :stobjs (nrev))) (declare (xargs :guard (vl-bitlist-p x))) (let ((__function__ 'vl-bitlist-to-sized-exprs-nrev)) (declare (ignorable __function__)) (if (atom x) (nrev-fix nrev) (let ((nrev (nrev-push (vl-bit-to-sized-expr (car x)) nrev))) (vl-bitlist-to-sized-exprs-nrev (cdr x) nrev)))))
Function:
(defun vl-bitlist-to-sized-exprs (x) (declare (xargs :guard (vl-bitlist-p x))) (let ((__function__ 'vl-bitlist-to-sized-exprs)) (declare (ignorable __function__)) (mbe :logic (if (consp x) (cons (vl-bit-to-sized-expr (car x)) (vl-bitlist-to-sized-exprs (cdr x))) nil) :exec (if (atom x) nil (with-local-nrev (vl-bitlist-to-sized-exprs-nrev x nrev))))))
Theorem:
(defthm vl-bitlist-to-sized-exprs-of-update-nth (implies (<= (nfix acl2::n) (len acl2::x)) (equal (vl-bitlist-to-sized-exprs (update-nth acl2::n acl2::v acl2::x)) (update-nth acl2::n (vl-bit-to-sized-expr acl2::v) (vl-bitlist-to-sized-exprs acl2::x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-bitlist-to-sized-exprs-of-revappend (equal (vl-bitlist-to-sized-exprs (revappend acl2::x acl2::y)) (revappend (vl-bitlist-to-sized-exprs acl2::x) (vl-bitlist-to-sized-exprs acl2::y))) :rule-classes ((:rewrite)))
Theorem:
(defthm nthcdr-of-vl-bitlist-to-sized-exprs (equal (nthcdr acl2::n (vl-bitlist-to-sized-exprs acl2::x)) (vl-bitlist-to-sized-exprs (nthcdr acl2::n acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm nth-of-vl-bitlist-to-sized-exprs (equal (nth acl2::n (vl-bitlist-to-sized-exprs acl2::x)) (and (< (nfix acl2::n) (len acl2::x)) (vl-bit-to-sized-expr (nth acl2::n acl2::x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-bitlist-to-sized-exprs-nrev-removal (equal (vl-bitlist-to-sized-exprs-nrev acl2::x nrev) (append nrev (vl-bitlist-to-sized-exprs acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-bitlist-to-sized-exprs-exec-removal (equal (vl-bitlist-to-sized-exprs-exec acl2::x acl2::acc) (revappend (vl-bitlist-to-sized-exprs acl2::x) acl2::acc)) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-bitlist-to-sized-exprs-of-take (implies (<= (nfix acl2::n) (len acl2::x)) (equal (vl-bitlist-to-sized-exprs (take acl2::n acl2::x)) (take acl2::n (vl-bitlist-to-sized-exprs acl2::x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm set-equiv-congruence-over-vl-bitlist-to-sized-exprs (implies (set-equiv acl2::x acl2::y) (set-equiv (vl-bitlist-to-sized-exprs acl2::x) (vl-bitlist-to-sized-exprs acl2::y))) :rule-classes ((:congruence)))
Theorem:
(defthm subsetp-of-vl-bitlist-to-sized-exprs-when-subsetp (implies (subsetp acl2::x acl2::y) (subsetp (vl-bitlist-to-sized-exprs acl2::x) (vl-bitlist-to-sized-exprs acl2::y))) :rule-classes ((:rewrite)))
Theorem:
(defthm member-of-vl-bit-to-sized-expr-in-vl-bitlist-to-sized-exprs (implies (member acl2::k acl2::x) (member (vl-bit-to-sized-expr acl2::k) (vl-bitlist-to-sized-exprs acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-bitlist-to-sized-exprs-of-rev (equal (vl-bitlist-to-sized-exprs (rev acl2::x)) (rev (vl-bitlist-to-sized-exprs acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-bitlist-to-sized-exprs-of-list-fix (equal (vl-bitlist-to-sized-exprs (list-fix acl2::x)) (vl-bitlist-to-sized-exprs acl2::x)) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-bitlist-to-sized-exprs-of-append (equal (vl-bitlist-to-sized-exprs (append acl2::a acl2::b)) (append (vl-bitlist-to-sized-exprs acl2::a) (vl-bitlist-to-sized-exprs acl2::b))) :rule-classes ((:rewrite)))
Theorem:
(defthm cdr-of-vl-bitlist-to-sized-exprs (equal (cdr (vl-bitlist-to-sized-exprs acl2::x)) (vl-bitlist-to-sized-exprs (cdr acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm car-of-vl-bitlist-to-sized-exprs (equal (car (vl-bitlist-to-sized-exprs acl2::x)) (and (consp acl2::x) (vl-bit-to-sized-expr (car acl2::x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-bitlist-to-sized-exprs-under-iff (iff (vl-bitlist-to-sized-exprs acl2::x) (consp acl2::x)) :rule-classes ((:rewrite)))
Theorem:
(defthm consp-of-vl-bitlist-to-sized-exprs (equal (consp (vl-bitlist-to-sized-exprs acl2::x)) (consp acl2::x)) :rule-classes ((:rewrite)))
Theorem:
(defthm len-of-vl-bitlist-to-sized-exprs (equal (len (vl-bitlist-to-sized-exprs acl2::x)) (len acl2::x)) :rule-classes ((:rewrite)))
Theorem:
(defthm true-listp-of-vl-bitlist-to-sized-exprs (true-listp (vl-bitlist-to-sized-exprs acl2::x)) :rule-classes :type-prescription)
Theorem:
(defthm vl-bitlist-to-sized-exprs-when-not-consp (implies (not (consp acl2::x)) (equal (vl-bitlist-to-sized-exprs acl2::x) nil)) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-bitlist-to-sized-exprs-of-cons (equal (vl-bitlist-to-sized-exprs (cons acl2::a acl2::b)) (cons (vl-bit-to-sized-expr acl2::a) (vl-bitlist-to-sized-exprs acl2::b))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-exprlist-p-of-vl-bitlist-to-sized-exprs (vl-exprlist-p (vl-bitlist-to-sized-exprs x)))
Theorem:
(defthm vl-exprlist->finalwidths-of-vl-bitlist-to-sized-exprs (equal (vl-exprlist->finalwidths (vl-bitlist-to-sized-exprs x)) (replicate (len x) 1)))
Theorem:
(defthm vl-exprlist->finaltypes-of-vl-bitlist-to-sized-exprs (equal (vl-exprlist->finaltypes (vl-bitlist-to-sized-exprs x)) (replicate (len x) :vl-unsigned)))
Theorem:
(defthm vl-exprlist-welltyped-p-of-vl-bitlist-to-sized-exprs (vl-exprlist-welltyped-p (vl-bitlist-to-sized-exprs x)))