• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Community
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
    • Gl
    • Esim
    • Vl2014
      • Warnings
      • Primitives
      • Use-set
      • Syntax
      • Getting-started
      • Utilities
      • Loader
        • Preprocessor
          • Vl-iframe-p
          • Preprocessor-ifdef-minutia
          • Vl-preprocess-loop
          • Vl-read-until-end-of-define
          • Vl-expand-define
          • Vl-read-include
          • Vl-process-ifdef
          • Vl-substitute-into-macro-text
          • Vl-preprocess
          • Vl-define
            • Vl-define-formallist->defaults
            • Vl-define-formallist->names
            • Vl-define-fix
            • Vl-define-formal
            • Vl-define-equiv
            • Make-vl-define
            • Vl-add-define
            • Vl-define->formals
            • Vl-define-p
            • Change-vl-define
            • Vl-define->name
            • Vl-define->loc
            • Vl-define->body
            • Vl-pp-define
            • Vl-define-formallist
          • Vl-process-define
          • Vl-process-undef
          • Preprocessor-include-minutia
          • Vl-split-define-text
          • Vl-read-timescale
          • Vl-line-up-define-formals-and-actuals
          • Vl-process-else
          • Vl-process-endif
          • Vl-istack-p
          • Vl-is-compiler-directive-p
          • Vl-check-remaining-formals-all-have-defaults
          • Vl-safe-previous-n
          • Vl-safe-next-n
          • Vl-defines
          • *vl-preprocess-clock*
        • Vl-loadconfig
        • Lexer
        • Vl-loadstate
        • Parser
        • Vl-load-merge-descriptions
        • Scope-of-defines
        • Vl-load-file
        • Vl-flush-out-descriptions
        • Vl-description
        • Vl-loadresult
        • Vl-read-file
        • Vl-find-basename/extension
        • Vl-find-file
        • Vl-read-files
        • Extended-characters
        • Vl-load
        • Vl-load-main
        • Vl-load-description
        • Vl-descriptions-left-to-load
        • Inject-warnings
        • Vl-load-descriptions
        • Vl-load-files
        • Vl-load-summary
        • Vl-collect-modules-from-descriptions
        • Vl-descriptionlist
      • Transforms
      • Lint
      • Mlib
      • Server
      • Kit
      • Printer
      • Esim-vl
      • Well-formedness
    • Sv
    • Fgl
    • Vwsim
    • Vl
    • X86isa
    • Svl
    • Rtl
  • Software-verification
  • Math
  • Testing-utilities

• Vl-define

Vl-define-formallist->names

(vl-define-formallist->names x) maps vl-define-formal->name across a list.

Signature

(vl-define-formallist->names x) → names

Arguments

x — Guard (vl-define-formallist-p x).

Returns

names — Type (string-listp names).

This is an ordinary defprojection.

Definitions and Theorems

Function: vl-define-formallist->names-exec

(defun vl-define-formallist->names-exec (x acc)
  (declare (xargs :guard (vl-define-formallist-p x)))
  (declare (xargs :guard t))
  (let ((__function__ 'vl-define-formallist->names-exec))
    (declare (ignorable __function__))
    (if (consp x)
        (vl-define-formallist->names-exec
             (cdr x)
             (cons (vl-define-formal->name (car x))
                   acc))
      acc)))

Function: vl-define-formallist->names-nrev

(defun vl-define-formallist->names-nrev (x nrev)
  (declare (xargs :stobjs (nrev)))
  (declare (xargs :guard (vl-define-formallist-p x)))
  (declare (xargs :guard t))
  (let ((__function__ 'vl-define-formallist->names-nrev))
    (declare (ignorable __function__))
    (if (atom x)
        (nrev-fix nrev)
      (let ((nrev (nrev-push (vl-define-formal->name (car x))
                             nrev)))
        (vl-define-formallist->names-nrev (cdr x)
                                          nrev)))))

Function: vl-define-formallist->names

(defun vl-define-formallist->names (x)
 (declare (xargs :guard (vl-define-formallist-p x)))
 (declare (xargs :guard t))
 (let ((__function__ 'vl-define-formallist->names))
  (declare (ignorable __function__))
  (mbe
   :logic
   (if (consp x)
       (cons (vl-define-formal->name (car x))
             (vl-define-formallist->names (cdr x)))
     nil)
   :exec
   (if (atom x)
       nil
     (with-local-nrev (vl-define-formallist->names-nrev x nrev))))))

Theorem: string-listp-of-vl-define-formallist->names

(defthm string-listp-of-vl-define-formallist->names
  (b* ((names (vl-define-formallist->names x)))
    (string-listp names))
  :rule-classes :rewrite)

Theorem: vl-define-formallist->names-of-vl-define-formallist-fix-x

(defthm vl-define-formallist->names-of-vl-define-formallist-fix-x
  (equal (vl-define-formallist->names (vl-define-formallist-fix x))
         (vl-define-formallist->names x)))

Theorem: vl-define-formallist->names-vl-define-formallist-equiv-congruence-on-x

(defthm
 vl-define-formallist->names-vl-define-formallist-equiv-congruence-on-x
 (implies (vl-define-formallist-equiv x x-equiv)
          (equal (vl-define-formallist->names x)
                 (vl-define-formallist->names x-equiv)))
 :rule-classes :congruence)

Theorem: vl-define-formallist->names-of-update-nth

(defthm vl-define-formallist->names-of-update-nth
  (implies
       (<= (nfix acl2::n) (len acl2::x))
       (equal (vl-define-formallist->names
                   (update-nth acl2::n acl2::v acl2::x))
              (update-nth acl2::n (vl-define-formal->name acl2::v)
                          (vl-define-formallist->names acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: vl-define-formallist->names-of-revappend

(defthm vl-define-formallist->names-of-revappend
  (equal (vl-define-formallist->names (revappend acl2::x acl2::y))
         (revappend (vl-define-formallist->names acl2::x)
                    (vl-define-formallist->names acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: nthcdr-of-vl-define-formallist->names

(defthm nthcdr-of-vl-define-formallist->names
  (equal (nthcdr acl2::n
                 (vl-define-formallist->names acl2::x))
         (vl-define-formallist->names (nthcdr acl2::n acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: nth-of-vl-define-formallist->names

(defthm nth-of-vl-define-formallist->names
  (equal (nth acl2::n
              (vl-define-formallist->names acl2::x))
         (and (< (nfix acl2::n) (len acl2::x))
              (vl-define-formal->name (nth acl2::n acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: vl-define-formallist->names-nrev-removal

(defthm vl-define-formallist->names-nrev-removal
  (equal (vl-define-formallist->names-nrev acl2::x nrev)
         (append nrev
                 (vl-define-formallist->names acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-define-formallist->names-exec-removal

(defthm vl-define-formallist->names-exec-removal
  (equal (vl-define-formallist->names-exec acl2::x acl2::acc)
         (revappend (vl-define-formallist->names acl2::x)
                    acl2::acc))
  :rule-classes ((:rewrite)))

Theorem: vl-define-formallist->names-of-take

(defthm vl-define-formallist->names-of-take
  (implies
       (<= (nfix acl2::n) (len acl2::x))
       (equal (vl-define-formallist->names (take acl2::n acl2::x))
              (take acl2::n
                    (vl-define-formallist->names acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: set-equiv-congruence-over-vl-define-formallist->names

(defthm set-equiv-congruence-over-vl-define-formallist->names
  (implies (set-equiv acl2::x acl2::y)
           (set-equiv (vl-define-formallist->names acl2::x)
                      (vl-define-formallist->names acl2::y)))
  :rule-classes ((:congruence)))

Theorem: subsetp-of-vl-define-formallist->names-when-subsetp

(defthm subsetp-of-vl-define-formallist->names-when-subsetp
  (implies (subsetp acl2::x acl2::y)
           (subsetp (vl-define-formallist->names acl2::x)
                    (vl-define-formallist->names acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: member-of-vl-define-formal->name-in-vl-define-formallist->names

(defthm
    member-of-vl-define-formal->name-in-vl-define-formallist->names
  (implies (member acl2::k acl2::x)
           (member (vl-define-formal->name acl2::k)
                   (vl-define-formallist->names acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-define-formallist->names-of-rev

(defthm vl-define-formallist->names-of-rev
  (equal (vl-define-formallist->names (rev acl2::x))
         (rev (vl-define-formallist->names acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-define-formallist->names-of-list-fix

(defthm vl-define-formallist->names-of-list-fix
  (equal (vl-define-formallist->names (list-fix acl2::x))
         (vl-define-formallist->names acl2::x))
  :rule-classes ((:rewrite)))

Theorem: vl-define-formallist->names-of-append

(defthm vl-define-formallist->names-of-append
  (equal (vl-define-formallist->names (append acl2::a acl2::b))
         (append (vl-define-formallist->names acl2::a)
                 (vl-define-formallist->names acl2::b)))
  :rule-classes ((:rewrite)))

Theorem: cdr-of-vl-define-formallist->names

(defthm cdr-of-vl-define-formallist->names
  (equal (cdr (vl-define-formallist->names acl2::x))
         (vl-define-formallist->names (cdr acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: car-of-vl-define-formallist->names

(defthm car-of-vl-define-formallist->names
  (equal (car (vl-define-formallist->names acl2::x))
         (and (consp acl2::x)
              (vl-define-formal->name (car acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: vl-define-formallist->names-under-iff

(defthm vl-define-formallist->names-under-iff
  (iff (vl-define-formallist->names acl2::x)
       (consp acl2::x))
  :rule-classes ((:rewrite)))

Theorem: consp-of-vl-define-formallist->names

(defthm consp-of-vl-define-formallist->names
  (equal (consp (vl-define-formallist->names acl2::x))
         (consp acl2::x))
  :rule-classes ((:rewrite)))

Theorem: len-of-vl-define-formallist->names

(defthm len-of-vl-define-formallist->names
  (equal (len (vl-define-formallist->names acl2::x))
         (len acl2::x))
  :rule-classes ((:rewrite)))

Theorem: true-listp-of-vl-define-formallist->names

(defthm true-listp-of-vl-define-formallist->names
  (true-listp (vl-define-formallist->names acl2::x))
  :rule-classes :type-prescription)

Theorem: vl-define-formallist->names-when-not-consp

(defthm vl-define-formallist->names-when-not-consp
  (implies (not (consp acl2::x))
           (equal (vl-define-formallist->names acl2::x)
                  nil))
  :rule-classes ((:rewrite)))

Theorem: vl-define-formallist->names-of-cons

(defthm vl-define-formallist->names-of-cons
  (equal (vl-define-formallist->names (cons acl2::a acl2::b))
         (cons (vl-define-formal->name acl2::a)
               (vl-define-formallist->names acl2::b)))
  :rule-classes ((:rewrite)))