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