(modinstlist->modnames x) maps modinst->modname across a list.
(modinstlist->modnames x) → names
This is an ordinary defprojection.
Function:
(defun modinstlist->modnames-exec (x acc) (declare (xargs :guard (modinstlist-p x))) (declare (xargs :guard t)) (let ((__function__ 'modinstlist->modnames-exec)) (declare (ignorable __function__)) (if (consp x) (modinstlist->modnames-exec (cdr x) (cons (modinst->modname (car x)) acc)) acc)))
Function:
(defun modinstlist->modnames-nrev (x acl2::nrev) (declare (xargs :stobjs (acl2::nrev))) (declare (xargs :guard (modinstlist-p x))) (declare (xargs :guard t)) (let ((__function__ 'modinstlist->modnames-nrev)) (declare (ignorable __function__)) (if (atom x) (acl2::nrev-fix acl2::nrev) (let ((acl2::nrev (acl2::nrev-push (modinst->modname (car x)) acl2::nrev))) (modinstlist->modnames-nrev (cdr x) acl2::nrev)))))
Function:
(defun modinstlist->modnames (x) (declare (xargs :guard (modinstlist-p x))) (declare (xargs :guard t)) (let ((__function__ 'modinstlist->modnames)) (declare (ignorable __function__)) (mbe :logic (if (consp x) (cons (modinst->modname (car x)) (modinstlist->modnames (cdr x))) nil) :exec (if (atom x) nil (acl2::with-local-nrev (modinstlist->modnames-nrev x acl2::nrev))))))
Theorem:
(defthm modnamelist-p-of-modinstlist->modnames (b* ((names (modinstlist->modnames x))) (modnamelist-p names)) :rule-classes :rewrite)
Theorem:
(defthm modinstlist->modnames-of-modinstlist-fix-x (equal (modinstlist->modnames (modinstlist-fix x)) (modinstlist->modnames x)))
Theorem:
(defthm modinstlist->modnames-modinstlist-equiv-congruence-on-x (implies (modinstlist-equiv x x-equiv) (equal (modinstlist->modnames x) (modinstlist->modnames x-equiv))) :rule-classes :congruence)
Theorem:
(defthm modinstlist->modnames-of-take (implies (<= (nfix acl2::n) (len x)) (equal (modinstlist->modnames (take acl2::n x)) (take acl2::n (modinstlist->modnames x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm modinstlist->modnames-nrev-removal (equal (modinstlist->modnames-nrev x acl2::nrev) (append acl2::nrev (modinstlist->modnames x))) :rule-classes ((:rewrite)))
Theorem:
(defthm modinstlist->modnames-exec-removal (equal (modinstlist->modnames-exec x acl2::acc) (revappend (modinstlist->modnames x) acl2::acc)) :rule-classes ((:rewrite)))
Theorem:
(defthm modinstlist->modnames-of-rev (equal (modinstlist->modnames (rev x)) (rev (modinstlist->modnames x))) :rule-classes ((:rewrite)))
Theorem:
(defthm modinstlist->modnames-of-list-fix (equal (modinstlist->modnames (list-fix x)) (modinstlist->modnames x)) :rule-classes ((:rewrite)))
Theorem:
(defthm modinstlist->modnames-of-append (equal (modinstlist->modnames (append acl2::a acl2::b)) (append (modinstlist->modnames acl2::a) (modinstlist->modnames acl2::b))) :rule-classes ((:rewrite)))
Theorem:
(defthm cdr-of-modinstlist->modnames (equal (cdr (modinstlist->modnames x)) (modinstlist->modnames (cdr x))) :rule-classes ((:rewrite)))
Theorem:
(defthm car-of-modinstlist->modnames (equal (car (modinstlist->modnames x)) (and (consp x) (modinst->modname (car x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm modinstlist->modnames-under-iff (iff (modinstlist->modnames x) (consp x)) :rule-classes ((:rewrite)))
Theorem:
(defthm consp-of-modinstlist->modnames (equal (consp (modinstlist->modnames x)) (consp x)) :rule-classes ((:rewrite)))
Theorem:
(defthm len-of-modinstlist->modnames (equal (len (modinstlist->modnames x)) (len x)) :rule-classes ((:rewrite)))
Theorem:
(defthm true-listp-of-modinstlist->modnames (true-listp (modinstlist->modnames x)) :rule-classes :type-prescription)
Theorem:
(defthm modinstlist->modnames-when-not-consp (implies (not (consp x)) (equal (modinstlist->modnames x) nil)) :rule-classes ((:rewrite)))
Theorem:
(defthm modinstlist->modnames-of-cons (equal (modinstlist->modnames (cons acl2::a acl2::b)) (cons (modinst->modname acl2::a) (modinstlist->modnames acl2::b))) :rule-classes ((:rewrite)))