Gather all top-level expressions from a vl-modinstlist-p.
(vl-modinstlist-lvalexprs x) → exprs
Function:
(defun vl-modinstlist-lvalexprs (x) (declare (xargs :guard (vl-modinstlist-p x))) (let ((__function__ 'vl-modinstlist-lvalexprs)) (declare (ignorable __function__)) (mbe :logic (if (atom x) nil (append (vl-modinst-lvalexprs (car x)) (vl-modinstlist-lvalexprs (cdr x)))) :exec (with-local-nrev (vl-modinstlist-lvalexprs-nrev x nrev)))))
Theorem:
(defthm vl-exprlist-p-of-vl-modinstlist-lvalexprs (b* ((exprs (vl-modinstlist-lvalexprs x))) (vl-exprlist-p exprs)) :rule-classes :rewrite)
Theorem:
(defthm true-listp-of-vl-modinstlist-lvalexprs (true-listp (vl-modinstlist-lvalexprs x)) :rule-classes :type-prescription)
Theorem:
(defthm vl-modinstlist-lvalexprs-nrev-removal (equal (vl-modinstlist-lvalexprs-nrev x nrev) (append nrev (vl-modinstlist-lvalexprs x))))
Theorem:
(defthm set-equiv-congruence-over-vl-modinstlist-lvalexprs (implies (set-equiv acl2::x acl2::y) (set-equiv (vl-modinstlist-lvalexprs acl2::x) (vl-modinstlist-lvalexprs acl2::y))) :rule-classes ((:congruence)))
Theorem:
(defthm subsetp-of-vl-modinstlist-lvalexprs-when-subsetp (implies (subsetp acl2::x acl2::y) (subsetp (vl-modinstlist-lvalexprs acl2::x) (vl-modinstlist-lvalexprs acl2::y))) :rule-classes ((:rewrite)))
Theorem:
(defthm member-in-vl-modinstlist-lvalexprs (implies (and (member acl2::k (vl-modinst-lvalexprs acl2::j)) (member acl2::j acl2::x)) (member acl2::k (vl-modinstlist-lvalexprs acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-modinstlist-lvalexprs-of-list-fix (equal (vl-modinstlist-lvalexprs (list-fix acl2::x)) (vl-modinstlist-lvalexprs acl2::x)) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-modinstlist-lvalexprs-of-append (equal (vl-modinstlist-lvalexprs (append acl2::a acl2::b)) (append (vl-modinstlist-lvalexprs acl2::a) (vl-modinstlist-lvalexprs acl2::b))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-modinstlist-lvalexprs-when-not-consp (implies (not (consp acl2::x)) (equal (vl-modinstlist-lvalexprs acl2::x) nil)) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-modinstlist-lvalexprs-of-cons (equal (vl-modinstlist-lvalexprs (cons acl2::a acl2::b)) (append (vl-modinst-lvalexprs acl2::a) (vl-modinstlist-lvalexprs acl2::b))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-exprlist-lvaluesp-of-vl-modinstlist-lvalexprs (vl-exprlist-lvaluesp (vl-modinstlist-lvalexprs x)))
Theorem:
(defthm vl-modinstlist-lvalexprs-of-vl-modinstlist-fix-x (equal (vl-modinstlist-lvalexprs (vl-modinstlist-fix x)) (vl-modinstlist-lvalexprs x)))
Theorem:
(defthm vl-modinstlist-lvalexprs-vl-modinstlist-equiv-congruence-on-x (implies (vl-modinstlist-equiv x x-equiv) (equal (vl-modinstlist-lvalexprs x) (vl-modinstlist-lvalexprs x-equiv))) :rule-classes :congruence)