• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Std
  • Community
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
    • Gl
    • Esim
    • Vl2014
    • Sv
    • Fgl
    • Vwsim
    • Vl
      • Syntax
      • Loader
      • Warnings
      • Getting-started
      • Utilities
      • Printer
      • Kit
        • Vl-lint
          • Vl-lintconfig-p
          • Condcheck
          • Lint-warning-suppression
          • Lucid
          • Lvaluecheck
          • Vl-interfacelist-alwaysstyle
          • Truncation-warnings
          • Vl-modulelist-alwaysstyle
          • Skip-detection
          • Vl-lint-report
          • Vl-lintresult
          • Vl::vl-design-sv-use-set
          • Oddexpr-check
          • Leftright-check
          • Duplicate-detect
          • Selfassigns
          • *vl-lint-help*
          • Arith-compare-check
          • Dupeinst-check
            • Vl-dupeinst-alistp
            • Vl-modulelist-dupeinst-check
            • Vl-dupeinst-key-p
            • Vl-maybe-warn-dupeinst
            • Vl-warnings-for-dupeinst-alist
            • Vl-make-dupeinst-alist
            • Vl-module-dupeinst-check
            • Vl-dupeinst-trivial-p
            • Vl-design-dupeinst-check
            • Vl-pp-dupeinst-key
            • Vl-pp-dupeinst-alist
          • Qmarksize-check
          • Lint-whole-file-suppression
          • Run-vl-lint-main
          • Logicassign
          • Run-vl-lint
          • Vl-print-certain-warnings
          • Duperhs-check
          • Vl-lint-top
          • Sd-filter-problems
          • Vl-modulelist-add-svbad-warnings
          • Vl-module-add-svbad-warnings
          • Check-case
          • Vl-lint-extra-actions
          • Drop-lint-stubs
          • Vl-lint-print-warnings
          • Drop-user-submodules
          • Check-namespace
          • Vl-lintconfig-loadconfig
          • Vl-lint-design->svex-modalist-wrapper
          • Vl-delete-sd-problems-for-modnames-aux
          • Vl-collect-new-names-from-orignames
          • Vl-lint-print-all-warnings
          • Vl-design-remove-unnecessary-modules
          • Vl-delete-sd-problems-for-modnames
          • Vl-always-check-style
          • Vl-vardecllist-svbad-warnings
          • Vl-vardecl-svbad-warnings
          • Vl-reportcard-remove-suppressed
          • Vl-reportcard-keep-suppressed
          • Vl-alwayslist-check-style
          • Vl-remove-nameless-descriptions
          • Vl-lint-apply-quiet
          • Vl-warninglist-remove-suppressed
          • Vl-warninglist-keep-suppressed
          • Vl-print-eliminated-descs
          • Vl-module-alwaysstyle
          • Vl-jp-reportcard-aux
          • Vl-interface-alwaysstyle
          • Vl-design-alwaysstyle
          • Vl-jp-description-locations
          • Vl-jp-reportcard
          • Vl-pp-stringlist-lines
          • Vl-jp-design-locations
          • Vl-datatype-svbad-p
          • Unpacked-range-check
          • Sd-problem-major-p
          • Vl-alwaysstyle
        • Vl-server
        • Vl-gather
        • Vl-zip
        • Vl-main
        • Split-plusargs
        • Vl-shell
        • Vl-json
      • Mlib
      • Transforms
    • X86isa
    • Svl
    • Rtl
  • Software-verification
  • Math
  • Testing-utilities

• Dupeinst-check

Vl-dupeinst-alistp

(vl-dupeinst-alistp x) recognizes association lists where every key satisfies vl-dupeinst-key-p and each value satisfies vl-modinstlist-p.

The basic idea is to bind keys to the lists of modinsts that have that key, which lets us immediately see which modinsts have the same key.

Function: vl-dupeinst-alistp

(defun vl-dupeinst-alistp (x)
  (declare (xargs :guard t))
  (if (consp x)
      (and (consp (car x))
           (vl-dupeinst-key-p (caar x))
           (vl-modinstlist-p (cdar x))
           (vl-dupeinst-alistp (cdr x)))
    t))

Definitions and Theorems

Function: vl-dupeinst-alistp

(defun vl-dupeinst-alistp (x)
  (declare (xargs :guard t))
  (if (consp x)
      (and (consp (car x))
           (vl-dupeinst-key-p (caar x))
           (vl-modinstlist-p (cdar x))
           (vl-dupeinst-alistp (cdr x)))
    t))

Theorem: vl-dupeinst-alistp-of-revappend

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

Theorem: vl-dupeinst-alistp-of-remove

(defthm vl-dupeinst-alistp-of-remove
  (implies (vl-dupeinst-alistp acl2::x)
           (vl-dupeinst-alistp (remove acl2::a acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-dupeinst-alistp-of-last

(defthm vl-dupeinst-alistp-of-last
  (implies (vl-dupeinst-alistp (double-rewrite acl2::x))
           (vl-dupeinst-alistp (last acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-dupeinst-alistp-of-nthcdr

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

Theorem: vl-dupeinst-alistp-of-butlast

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

Theorem: vl-dupeinst-alistp-of-update-nth

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

Theorem: vl-dupeinst-alistp-of-repeat

(defthm vl-dupeinst-alistp-of-repeat
  (iff (vl-dupeinst-alistp (repeat acl2::n acl2::x))
       (or (and (consp acl2::x)
                (vl-dupeinst-key-p (car acl2::x))
                (vl-modinstlist-p (cdr acl2::x)))
           (zp acl2::n)))
  :rule-classes ((:rewrite)))

Theorem: vl-dupeinst-alistp-of-take

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

Theorem: vl-dupeinst-alistp-of-union-equal

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

Theorem: vl-dupeinst-alistp-of-intersection-equal-2

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

Theorem: vl-dupeinst-alistp-of-intersection-equal-1

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

Theorem: vl-dupeinst-alistp-of-set-difference-equal

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

Theorem: vl-dupeinst-alistp-set-equiv-congruence

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

Theorem: vl-dupeinst-alistp-when-subsetp-equal

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

Theorem: vl-dupeinst-alistp-of-rcons

(defthm vl-dupeinst-alistp-of-rcons
  (iff (vl-dupeinst-alistp (acl2::rcons acl2::a acl2::x))
       (and (and (consp acl2::a)
                 (vl-dupeinst-key-p (car acl2::a))
                 (vl-modinstlist-p (cdr acl2::a)))
            (vl-dupeinst-alistp (list-fix acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: vl-dupeinst-alistp-of-rev

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

Theorem: vl-dupeinst-alistp-of-duplicated-members

(defthm vl-dupeinst-alistp-of-duplicated-members
  (implies (vl-dupeinst-alistp acl2::x)
           (vl-dupeinst-alistp (duplicated-members acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-dupeinst-alistp-of-difference

(defthm vl-dupeinst-alistp-of-difference
  (implies (vl-dupeinst-alistp acl2::x)
           (vl-dupeinst-alistp (difference acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: vl-dupeinst-alistp-of-intersect-2

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

Theorem: vl-dupeinst-alistp-of-intersect-1

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

Theorem: vl-dupeinst-alistp-of-union

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

Theorem: vl-dupeinst-alistp-of-mergesort

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

Theorem: vl-dupeinst-alistp-of-delete

(defthm vl-dupeinst-alistp-of-delete
  (implies (vl-dupeinst-alistp acl2::x)
           (vl-dupeinst-alistp (delete acl2::k acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-dupeinst-alistp-of-insert

(defthm vl-dupeinst-alistp-of-insert
  (iff (vl-dupeinst-alistp (insert acl2::a acl2::x))
       (and (vl-dupeinst-alistp (sfix acl2::x))
            (and (consp acl2::a)
                 (vl-dupeinst-key-p (car acl2::a))
                 (vl-modinstlist-p (cdr acl2::a)))))
  :rule-classes ((:rewrite)))

Theorem: vl-dupeinst-alistp-of-sfix

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

Theorem: vl-dupeinst-alistp-of-list-fix

(defthm vl-dupeinst-alistp-of-list-fix
  (equal (vl-dupeinst-alistp (list-fix acl2::x))
         (vl-dupeinst-alistp acl2::x))
  :rule-classes ((:rewrite)))

Theorem: vl-dupeinst-alistp-of-append

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

Theorem: vl-dupeinst-alistp-when-not-consp

(defthm vl-dupeinst-alistp-when-not-consp
  (implies (not (consp acl2::x))
           (vl-dupeinst-alistp acl2::x))
  :rule-classes ((:rewrite)))

Theorem: vl-dupeinst-alistp-of-cdr-when-vl-dupeinst-alistp

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

Theorem: vl-dupeinst-alistp-of-cons

(defthm vl-dupeinst-alistp-of-cons
  (equal (vl-dupeinst-alistp (cons acl2::a acl2::x))
         (and (and (consp acl2::a)
                   (vl-dupeinst-key-p (car acl2::a))
                   (vl-modinstlist-p (cdr acl2::a)))
              (vl-dupeinst-alistp acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-dupeinst-alistp-of-make-fal

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

Theorem: vl-modinstlist-p-of-cdr-when-member-equal-of-vl-dupeinst-alistp

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

Theorem: vl-dupeinst-key-p-of-car-when-member-equal-of-vl-dupeinst-alistp

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

Theorem: consp-when-member-equal-of-vl-dupeinst-alistp

(defthm consp-when-member-equal-of-vl-dupeinst-alistp
  (implies (and (vl-dupeinst-alistp 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-dupeinst-alistp acl2::x)
                                   'nil)
                                 (consp acl2::a)))))

Theorem: vl-modinstlist-p-of-cdr-of-assoc-when-vl-dupeinst-alistp

(defthm vl-modinstlist-p-of-cdr-of-assoc-when-vl-dupeinst-alistp
  (implies (vl-dupeinst-alistp acl2::x)
           (vl-modinstlist-p (cdr (assoc-equal acl2::k acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: vl-dupeinst-alistp-of-fast-alist-clean

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

Theorem: vl-dupeinst-alistp-of-hons-shrink-alist

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

Theorem: vl-dupeinst-alistp-of-hons-acons

(defthm vl-dupeinst-alistp-of-hons-acons
  (equal (vl-dupeinst-alistp (hons-acons acl2::a acl2::n acl2::x))
         (and (vl-dupeinst-key-p acl2::a)
              (vl-modinstlist-p acl2::n)
              (vl-dupeinst-alistp acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-modinstlist-p-of-cdr-of-hons-assoc-equal-when-vl-dupeinst-alistp

(defthm
 vl-modinstlist-p-of-cdr-of-hons-assoc-equal-when-vl-dupeinst-alistp
 (implies
      (vl-dupeinst-alistp acl2::x)
      (vl-modinstlist-p (cdr (hons-assoc-equal acl2::k acl2::x))))
 :rule-classes ((:rewrite)))

Theorem: vl-dupeinst-key-p-of-caar-when-vl-dupeinst-alistp

(defthm vl-dupeinst-key-p-of-caar-when-vl-dupeinst-alistp
  (implies (vl-dupeinst-alistp acl2::x)
           (iff (vl-dupeinst-key-p (caar acl2::x))
                (consp acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-modinstlist-p-of-cdar-when-vl-dupeinst-alistp

(defthm vl-modinstlist-p-of-cdar-when-vl-dupeinst-alistp
  (implies (vl-dupeinst-alistp acl2::x)
           (vl-modinstlist-p (cdar acl2::x)))
  :rule-classes ((:rewrite)))