Turn a list of PFCS relation or variable names into a list of ACL2 symbols.
(name-list-to-symbol-list x state) → symbols
This is an ordinary std::defprojection.
Function:
(defun name-list-to-symbol-list-exec (x state acc) (declare (xargs :stobjs (state))) (declare (xargs :guard (string-listp x))) (let ((__function__ 'name-list-to-symbol-list-exec)) (declare (ignorable __function__)) (if (consp x) (name-list-to-symbol-list-exec (cdr x) state (cons (name-to-symbol (car x) state) acc)) acc)))
Function:
(defun name-list-to-symbol-list-nrev (x state acl2::nrev) (declare (xargs :stobjs (state acl2::nrev))) (declare (xargs :guard (string-listp x))) (let ((__function__ 'name-list-to-symbol-list-nrev)) (declare (ignorable __function__)) (if (atom x) (acl2::nrev-fix acl2::nrev) (let ((acl2::nrev (acl2::nrev-push (name-to-symbol (car x) state) acl2::nrev))) (name-list-to-symbol-list-nrev (cdr x) state acl2::nrev)))))
Function:
(defun name-list-to-symbol-list (x state) (declare (xargs :stobjs (state))) (declare (xargs :guard (string-listp x))) (let ((__function__ 'name-list-to-symbol-list)) (declare (ignorable __function__)) (mbe :logic (if (consp x) (cons (name-to-symbol (car x) state) (name-list-to-symbol-list (cdr x) state)) nil) :exec (if (atom x) nil (acl2::with-local-nrev (name-list-to-symbol-list-nrev x state acl2::nrev))))))
Theorem:
(defthm symbol-listp-of-name-list-to-symbol-list (b* ((symbols (name-list-to-symbol-list x state))) (symbol-listp symbols)) :rule-classes :rewrite)
Theorem:
(defthm name-list-to-symbol-list-of-take (implies (<= (nfix acl2::n) (len acl2::x)) (equal (name-list-to-symbol-list (take acl2::n acl2::x) state) (take acl2::n (name-list-to-symbol-list acl2::x state)))) :rule-classes ((:rewrite)))
Theorem:
(defthm set-equiv-congruence-over-name-list-to-symbol-list (implies (set-equiv acl2::x acl2::y) (set-equiv (name-list-to-symbol-list acl2::x state) (name-list-to-symbol-list acl2::y state))) :rule-classes ((:congruence)))
Theorem:
(defthm subsetp-of-name-list-to-symbol-list-when-subsetp (implies (subsetp acl2::x acl2::y) (subsetp (name-list-to-symbol-list acl2::x state) (name-list-to-symbol-list acl2::y state))) :rule-classes ((:rewrite)))
Theorem:
(defthm member-of-name-to-symbol-in-name-list-to-symbol-list (implies (member acl2::k acl2::x) (member (name-to-symbol acl2::k state) (name-list-to-symbol-list acl2::x state))) :rule-classes ((:rewrite)))
Theorem:
(defthm name-list-to-symbol-list-nrev-removal (equal (name-list-to-symbol-list-nrev acl2::x state acl2::nrev) (append acl2::nrev (name-list-to-symbol-list acl2::x state))) :rule-classes ((:rewrite)))
Theorem:
(defthm name-list-to-symbol-list-exec-removal (equal (name-list-to-symbol-list-exec acl2::x state acl2::acc) (revappend (name-list-to-symbol-list acl2::x state) acl2::acc)) :rule-classes ((:rewrite)))
Theorem:
(defthm name-list-to-symbol-list-of-rev (equal (name-list-to-symbol-list (rev acl2::x) state) (rev (name-list-to-symbol-list acl2::x state))) :rule-classes ((:rewrite)))
Theorem:
(defthm name-list-to-symbol-list-of-list-fix (equal (name-list-to-symbol-list (list-fix acl2::x) state) (name-list-to-symbol-list acl2::x state)) :rule-classes ((:rewrite)))
Theorem:
(defthm name-list-to-symbol-list-of-append (equal (name-list-to-symbol-list (append acl2::a acl2::b) state) (append (name-list-to-symbol-list acl2::a state) (name-list-to-symbol-list acl2::b state))) :rule-classes ((:rewrite)))
Theorem:
(defthm cdr-of-name-list-to-symbol-list (equal (cdr (name-list-to-symbol-list acl2::x state)) (name-list-to-symbol-list (cdr acl2::x) state)) :rule-classes ((:rewrite)))
Theorem:
(defthm car-of-name-list-to-symbol-list (equal (car (name-list-to-symbol-list acl2::x state)) (and (consp acl2::x) (name-to-symbol (car acl2::x) state))) :rule-classes ((:rewrite)))
Theorem:
(defthm name-list-to-symbol-list-under-iff (iff (name-list-to-symbol-list acl2::x state) (consp acl2::x)) :rule-classes ((:rewrite)))
Theorem:
(defthm consp-of-name-list-to-symbol-list (equal (consp (name-list-to-symbol-list acl2::x state)) (consp acl2::x)) :rule-classes ((:rewrite)))
Theorem:
(defthm len-of-name-list-to-symbol-list (equal (len (name-list-to-symbol-list acl2::x state)) (len acl2::x)) :rule-classes ((:rewrite)))
Theorem:
(defthm true-listp-of-name-list-to-symbol-list (true-listp (name-list-to-symbol-list acl2::x state)) :rule-classes :type-prescription)
Theorem:
(defthm name-list-to-symbol-list-when-not-consp (implies (not (consp acl2::x)) (equal (name-list-to-symbol-list acl2::x state) nil)) :rule-classes ((:rewrite)))
Theorem:
(defthm name-list-to-symbol-list-of-cons (equal (name-list-to-symbol-list (cons acl2::a acl2::b) state) (cons (name-to-symbol acl2::a state) (name-list-to-symbol-list acl2::b state))) :rule-classes ((:rewrite)))