• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
    • Gl
    • Esim
    • Vl2014
      • Warnings
      • Primitives
      • Use-set
      • Syntax
      • Getting-started
      • Utilities
      • Loader
      • Transforms
        • Expression-sizing
        • Occform
        • Oprewrite
        • Expand-functions
        • Delayredux
        • Unparameterization
        • Caseelim
        • Split
        • Selresolve
        • Weirdint-elim
        • Vl-delta
        • Replicate-insts
        • Rangeresolve
        • Propagate
        • Clean-selects
        • Clean-params
        • Blankargs
        • Inline-mods
        • Expr-simp
        • Trunc
        • Always-top
        • Gatesplit
        • Gate-elim
        • Expression-optimization
        • Elim-supplies
        • Wildelim
        • Drop-blankports
        • Clean-warnings
        • Addinstnames
        • Custom-transform-hooks
        • Annotate
          • Make-implicit-wires
            • Vl-modulelist-make-implicit-wires
            • Vl-make-implicit-wires-aux
            • Shadowcheck
              • Vl-shadowcheck-reference-name
              • Vl-shadowcheck-aux
              • Vl-shadowcheck-reference-names
              • Vl-shadowcheck-declare-names
              • Vl-shadowcheck-declare-name
              • Vl-shadowcheck-fundecl
              • Vl-shadowcheck-declare-typedefs
              • Vl-shadowcheck-blockitemlist
              • Vl-shadowcheck-taskdecl
              • Vl-shadowcheck-portdecllist
              • Vl-shadowcheck-paramdecls
              • Vl-shadowcheck-taskdecls
              • Vl-shadowcheck-paramdecl
              • Vl-shadowcheck-gateinst
              • Vl-shadowcheck-vardecls
              • Vl-shadowcheck-vardecl
              • Vl-shadowcheck-portdecl
              • Vl-shadowcheck-modinst
              • Vl-shadowcheck-imports
              • Vl-shadowcheck-import
              • Vl-shadowcheck-fundecls
              • Vl-shadowcheck-blockitem
              • Vl-shadowcheck-ports
              • Vl-shadowcheck-port
              • Vl-shadowcheck-initial
              • Vl-shadowcheck-assign
              • Vl-shadowcheck-always
              • Vl-shadowcheck-alias
              • Vl-shadowcheck-state
              • Vl-shadowcheck-module
              • Vl-shadowcheck-modules
              • Vl-shadowcheck-push-scope
              • Vl-lexscopes
              • Vl-shadowcheck-design
              • Vl-shadowcheck-pop-scope
              • Vl-lexscope
                • Vl-lexscope-p
                • Vl-lexscope-fix
                • Vl-lexscope-entry
                • Vl-lexscope-equiv
                • Vl-lexscope-find
                • Vl-empty-lexscope
            • Vl-stmt-check-undeclared
            • Vl-make-implicit-wires-main
            • Vl-fundecl-check-undeclared
            • Vl-warn-about-undeclared-wires
            • Vl-implicitst
            • Vl-blockitem-check-undeclared
            • Vl-taskdecl-check-undeclared
            • Vl-modinst-exprs-for-implicit-wires
            • Vl-blockitemlist-check-undeclared
            • Vl-import-check-undeclared
            • Vl-make-ordinary-implicit-wires
            • Vl-gateinst-exprs-for-implicit-wires
            • Vl-remove-declared-wires
            • Vl-make-port-implicit-wires
            • Vl-module-make-implicit-wires
            • Vl-vardecl-exprs-for-implicit-wires
            • Vl-design-make-implicit-wires
          • Resolve-indexing
          • Origexprs
          • Argresolve
          • Portdecl-sign
          • Designwires
          • Udp-elim
          • Vl-annotate-design
        • Latchcode
        • Elim-unused-vars
        • Problem-modules
      • Lint
      • Mlib
      • Server
      • Kit
      • Printer
      • Esim-vl
      • Well-formedness
    • Sv
    • Fgl
    • Vwsim
    • Vl
    • X86isa
    • Svl
    • Rtl
  • Software-verification
  • Math
  • Testing-utilities

• Vl-lexscope

Vl-lexscope-p

Recognizer for vl-lexscope.

Signature

(vl-lexscope-p x) → *

Definitions and Theorems

Function: vl-lexscope-p

(defun vl-lexscope-p (x)
  (declare (xargs :guard t))
  (let ((__function__ 'vl-lexscope-p))
    (declare (ignorable __function__))
    (if (atom x)
        t
      (and (consp (car x))
           (stringp (caar x))
           (vl-lexscope-entry-p (cdar x))
           (vl-lexscope-p (cdr x))))))

Theorem: vl-lexscope-p-of-revappend

(defthm vl-lexscope-p-of-revappend
  (equal (vl-lexscope-p (revappend acl2::x acl2::y))
         (and (vl-lexscope-p (list-fix acl2::x))
              (vl-lexscope-p acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-remove

(defthm vl-lexscope-p-of-remove
  (implies (vl-lexscope-p acl2::x)
           (vl-lexscope-p (remove acl2::a acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-last

(defthm vl-lexscope-p-of-last
  (implies (vl-lexscope-p (double-rewrite acl2::x))
           (vl-lexscope-p (last acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-nthcdr

(defthm vl-lexscope-p-of-nthcdr
  (implies (vl-lexscope-p (double-rewrite acl2::x))
           (vl-lexscope-p (nthcdr acl2::n acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-butlast

(defthm vl-lexscope-p-of-butlast
  (implies (vl-lexscope-p (double-rewrite acl2::x))
           (vl-lexscope-p (butlast acl2::x acl2::n)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-update-nth

(defthm vl-lexscope-p-of-update-nth
  (implies (vl-lexscope-p (double-rewrite acl2::x))
           (iff (vl-lexscope-p (update-nth acl2::n acl2::y acl2::x))
                (and (and (consp acl2::y)
                          (stringp (car acl2::y))
                          (vl-lexscope-entry-p (cdr acl2::y)))
                     (or (<= (nfix acl2::n) (len acl2::x))
                         (and (consp nil)
                              (stringp (car nil))
                              (vl-lexscope-entry-p (cdr nil)))))))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-repeat

(defthm vl-lexscope-p-of-repeat
  (iff (vl-lexscope-p (repeat acl2::n acl2::x))
       (or (and (consp acl2::x)
                (stringp (car acl2::x))
                (vl-lexscope-entry-p (cdr acl2::x)))
           (zp acl2::n)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-take

(defthm vl-lexscope-p-of-take
  (implies (vl-lexscope-p (double-rewrite acl2::x))
           (iff (vl-lexscope-p (take acl2::n acl2::x))
                (or (and (consp nil)
                         (stringp (car nil))
                         (vl-lexscope-entry-p (cdr nil)))
                    (<= (nfix acl2::n) (len acl2::x)))))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-union-equal

(defthm vl-lexscope-p-of-union-equal
  (equal (vl-lexscope-p (union-equal acl2::x acl2::y))
         (and (vl-lexscope-p (list-fix acl2::x))
              (vl-lexscope-p (double-rewrite acl2::y))))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-intersection-equal-2

(defthm vl-lexscope-p-of-intersection-equal-2
  (implies (vl-lexscope-p (double-rewrite acl2::y))
           (vl-lexscope-p (intersection-equal acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-intersection-equal-1

(defthm vl-lexscope-p-of-intersection-equal-1
  (implies (vl-lexscope-p (double-rewrite acl2::x))
           (vl-lexscope-p (intersection-equal acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-set-difference-equal

(defthm vl-lexscope-p-of-set-difference-equal
  (implies (vl-lexscope-p acl2::x)
           (vl-lexscope-p (set-difference-equal acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-set-equiv-congruence

(defthm vl-lexscope-p-set-equiv-congruence
  (implies (set-equiv acl2::x acl2::y)
           (equal (vl-lexscope-p acl2::x)
                  (vl-lexscope-p acl2::y)))
  :rule-classes :congruence)

Theorem: vl-lexscope-p-when-subsetp-equal

(defthm vl-lexscope-p-when-subsetp-equal
  (and (implies (and (subsetp-equal acl2::x acl2::y)
                     (vl-lexscope-p acl2::y))
                (vl-lexscope-p acl2::x))
       (implies (and (vl-lexscope-p acl2::y)
                     (subsetp-equal acl2::x acl2::y))
                (vl-lexscope-p acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-rcons

(defthm vl-lexscope-p-of-rcons
  (iff (vl-lexscope-p (acl2::rcons acl2::a acl2::x))
       (and (and (consp acl2::a)
                 (stringp (car acl2::a))
                 (vl-lexscope-entry-p (cdr acl2::a)))
            (vl-lexscope-p (list-fix acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-rev

(defthm vl-lexscope-p-of-rev
  (equal (vl-lexscope-p (rev acl2::x))
         (vl-lexscope-p (list-fix acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-duplicated-members

(defthm vl-lexscope-p-of-duplicated-members
  (implies (vl-lexscope-p acl2::x)
           (vl-lexscope-p (duplicated-members acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-difference

(defthm vl-lexscope-p-of-difference
  (implies (vl-lexscope-p acl2::x)
           (vl-lexscope-p (difference acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-intersect-2

(defthm vl-lexscope-p-of-intersect-2
  (implies (vl-lexscope-p acl2::y)
           (vl-lexscope-p (intersect acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-intersect-1

(defthm vl-lexscope-p-of-intersect-1
  (implies (vl-lexscope-p acl2::x)
           (vl-lexscope-p (intersect acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-union

(defthm vl-lexscope-p-of-union
  (iff (vl-lexscope-p (union acl2::x acl2::y))
       (and (vl-lexscope-p (sfix acl2::x))
            (vl-lexscope-p (sfix acl2::y))))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-mergesort

(defthm vl-lexscope-p-of-mergesort
  (iff (vl-lexscope-p (mergesort acl2::x))
       (vl-lexscope-p (list-fix acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-delete

(defthm vl-lexscope-p-of-delete
  (implies (vl-lexscope-p acl2::x)
           (vl-lexscope-p (delete acl2::k acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-insert

(defthm vl-lexscope-p-of-insert
  (iff (vl-lexscope-p (insert acl2::a acl2::x))
       (and (vl-lexscope-p (sfix acl2::x))
            (and (consp acl2::a)
                 (stringp (car acl2::a))
                 (vl-lexscope-entry-p (cdr acl2::a)))))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-sfix

(defthm vl-lexscope-p-of-sfix
  (iff (vl-lexscope-p (sfix acl2::x))
       (or (vl-lexscope-p acl2::x)
           (not (setp acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-list-fix

(defthm vl-lexscope-p-of-list-fix
  (equal (vl-lexscope-p (list-fix acl2::x))
         (vl-lexscope-p acl2::x))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-append

(defthm vl-lexscope-p-of-append
  (equal (vl-lexscope-p (append acl2::a acl2::b))
         (and (vl-lexscope-p acl2::a)
              (vl-lexscope-p acl2::b)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-when-not-consp

(defthm vl-lexscope-p-when-not-consp
  (implies (not (consp acl2::x))
           (vl-lexscope-p acl2::x))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-cdr-when-vl-lexscope-p

(defthm vl-lexscope-p-of-cdr-when-vl-lexscope-p
  (implies (vl-lexscope-p (double-rewrite acl2::x))
           (vl-lexscope-p (cdr acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-cons

(defthm vl-lexscope-p-of-cons
  (equal (vl-lexscope-p (cons acl2::a acl2::x))
         (and (and (consp acl2::a)
                   (stringp (car acl2::a))
                   (vl-lexscope-entry-p (cdr acl2::a)))
              (vl-lexscope-p acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-make-fal

(defthm vl-lexscope-p-of-make-fal
  (implies (and (vl-lexscope-p acl2::x)
                (vl-lexscope-p acl2::y))
           (vl-lexscope-p (make-fal acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-entry-p-of-cdr-when-member-equal-of-vl-lexscope-p

(defthm
      vl-lexscope-entry-p-of-cdr-when-member-equal-of-vl-lexscope-p
  (and (implies (and (vl-lexscope-p acl2::x)
                     (member-equal acl2::a acl2::x))
                (vl-lexscope-entry-p (cdr acl2::a)))
       (implies (and (member-equal acl2::a acl2::x)
                     (vl-lexscope-p acl2::x))
                (vl-lexscope-entry-p (cdr acl2::a))))
  :rule-classes ((:rewrite)))

Theorem: stringp-of-car-when-member-equal-of-vl-lexscope-p

(defthm stringp-of-car-when-member-equal-of-vl-lexscope-p
  (and (implies (and (vl-lexscope-p acl2::x)
                     (member-equal acl2::a acl2::x))
                (stringp (car acl2::a)))
       (implies (and (member-equal acl2::a acl2::x)
                     (vl-lexscope-p acl2::x))
                (stringp (car acl2::a))))
  :rule-classes ((:rewrite)))

Theorem: consp-when-member-equal-of-vl-lexscope-p

(defthm consp-when-member-equal-of-vl-lexscope-p
  (implies (and (vl-lexscope-p acl2::x)
                (member-equal acl2::a acl2::x))
           (consp acl2::a))
  :rule-classes
  ((:rewrite :backchain-limit-lst (0 0))
   (:rewrite :backchain-limit-lst (0 0)
             :corollary (implies (if (member-equal acl2::a acl2::x)
                                     (vl-lexscope-p acl2::x)
                                   'nil)
                                 (consp acl2::a)))))

Theorem: vl-lexscope-p-of-fast-alist-clean

(defthm vl-lexscope-p-of-fast-alist-clean
  (implies (vl-lexscope-p acl2::x)
           (vl-lexscope-p (fast-alist-clean acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-hons-shrink-alist

(defthm vl-lexscope-p-of-hons-shrink-alist
  (implies (and (vl-lexscope-p acl2::x)
                (vl-lexscope-p acl2::y))
           (vl-lexscope-p (hons-shrink-alist acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-p-of-hons-acons

(defthm vl-lexscope-p-of-hons-acons
  (equal (vl-lexscope-p (hons-acons acl2::a acl2::n acl2::x))
         (and (stringp acl2::a)
              (vl-lexscope-entry-p acl2::n)
              (vl-lexscope-p acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-lexscope-entry-p-of-cdr-of-hons-assoc-equal-when-vl-lexscope-p

(defthm
  vl-lexscope-entry-p-of-cdr-of-hons-assoc-equal-when-vl-lexscope-p
 (implies
  (vl-lexscope-p acl2::x)
  (iff
      (vl-lexscope-entry-p (cdr (hons-assoc-equal acl2::k acl2::x)))
      (or (hons-assoc-equal acl2::k acl2::x)
          (vl-lexscope-entry-p nil))))
 :rule-classes ((:rewrite)))

Theorem: vl-lexscope-entry-p-of-cdar-when-vl-lexscope-p

(defthm vl-lexscope-entry-p-of-cdar-when-vl-lexscope-p
  (implies (vl-lexscope-p acl2::x)
           (iff (vl-lexscope-entry-p (cdar acl2::x))
                (or (consp acl2::x)
                    (vl-lexscope-entry-p nil))))
  :rule-classes ((:rewrite)))

Theorem: stringp-of-caar-when-vl-lexscope-p

(defthm stringp-of-caar-when-vl-lexscope-p
  (implies (vl-lexscope-p acl2::x)
           (iff (stringp (caar acl2::x))
                (or (consp acl2::x) (stringp nil))))
  :rule-classes ((:rewrite)))