• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Community
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
    • Gl
    • Esim
    • Vl2014
    • Sv
    • Fgl
    • Vwsim
    • Vl
      • Syntax
      • Loader
      • Warnings
      • Getting-started
      • Utilities
        • Name-database
        • Vl-gc
        • Symbol-list-names
        • Ints-from
        • Nats-from
        • Make-lookup-alist
        • Redundant-mergesort
        • Longest-common-prefix
        • Vl-plural-p
        • Vl-remove-keys
        • Vl-merge-contiguous-indices
        • Vl-edition-p
        • Sum-nats
        • Vl-maybe-integer-listp
          • Vl-maybe-integer-listp-basics
        • Fast-memberp
        • Nat-listp
        • Max-nats
        • Longest-common-prefix-list
        • Character-list-listp
        • Vl-character-list-list-values-p
        • Remove-from-alist
        • Prefix-of-eachp
        • Vl-string-keys-p
        • Vl-maybe-nat-listp
        • Vl-string-list-values-p
        • String-list-listp
        • Vl-string-values-p
        • True-list-listp
        • Symbol-list-listp
        • Explode-list
        • All-have-len
        • Pos-listp
        • Min-nats
        • Debuggable-and
        • Vl-starname
        • Remove-equal-without-guard
        • Vl-maybe-string-list
        • String-fix
        • Longer-than-p
        • Anyp
        • Fast-alist-free-each-alist-val
        • Not*
        • Free-list-of-fast-alists
        • *nls*
      • Printer
      • Kit
      • Mlib
      • Transforms
    • X86isa
    • Svl
    • Rtl
  • Software-verification
  • Math
  • Testing-utilities

• Vl-maybe-integer-listp

Vl-maybe-integer-listp-basics

Basic theorems about vl-maybe-integer-listp, generated by deflist.

Definitions and Theorems

Theorem: vl-maybe-integer-listp-of-cons

(defthm vl-maybe-integer-listp-of-cons
  (equal (vl-maybe-integer-listp (cons acl2::a acl2::x))
         (and (maybe-integerp acl2::a)
              (vl-maybe-integer-listp acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-cdr-when-vl-maybe-integer-listp

(defthm vl-maybe-integer-listp-of-cdr-when-vl-maybe-integer-listp
  (implies (vl-maybe-integer-listp (double-rewrite acl2::x))
           (vl-maybe-integer-listp (cdr acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-when-not-consp

(defthm vl-maybe-integer-listp-when-not-consp
  (implies (not (consp acl2::x))
           (equal (vl-maybe-integer-listp acl2::x)
                  (not acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: maybe-integerp-of-car-when-vl-maybe-integer-listp

(defthm maybe-integerp-of-car-when-vl-maybe-integer-listp
  (implies (vl-maybe-integer-listp acl2::x)
           (maybe-integerp (car acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: true-listp-when-vl-maybe-integer-listp-compound-recognizer

(defthm true-listp-when-vl-maybe-integer-listp-compound-recognizer
  (implies (vl-maybe-integer-listp acl2::x)
           (true-listp acl2::x))
  :rule-classes :compound-recognizer)

Theorem: vl-maybe-integer-listp-of-list-fix

(defthm vl-maybe-integer-listp-of-list-fix
  (implies (vl-maybe-integer-listp acl2::x)
           (vl-maybe-integer-listp (list-fix acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-sfix

(defthm vl-maybe-integer-listp-of-sfix
  (iff (vl-maybe-integer-listp (sfix acl2::x))
       (or (vl-maybe-integer-listp acl2::x)
           (not (setp acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-insert

(defthm vl-maybe-integer-listp-of-insert
  (iff (vl-maybe-integer-listp (insert acl2::a acl2::x))
       (and (vl-maybe-integer-listp (sfix acl2::x))
            (maybe-integerp acl2::a)))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-delete

(defthm vl-maybe-integer-listp-of-delete
  (implies (vl-maybe-integer-listp acl2::x)
           (vl-maybe-integer-listp (delete acl2::k acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-mergesort

(defthm vl-maybe-integer-listp-of-mergesort
  (iff (vl-maybe-integer-listp (mergesort acl2::x))
       (vl-maybe-integer-listp (list-fix acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-union

(defthm vl-maybe-integer-listp-of-union
  (iff (vl-maybe-integer-listp (union acl2::x acl2::y))
       (and (vl-maybe-integer-listp (sfix acl2::x))
            (vl-maybe-integer-listp (sfix acl2::y))))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-intersect-1

(defthm vl-maybe-integer-listp-of-intersect-1
  (implies (vl-maybe-integer-listp acl2::x)
           (vl-maybe-integer-listp (intersect acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-intersect-2

(defthm vl-maybe-integer-listp-of-intersect-2
  (implies (vl-maybe-integer-listp acl2::y)
           (vl-maybe-integer-listp (intersect acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-difference

(defthm vl-maybe-integer-listp-of-difference
  (implies (vl-maybe-integer-listp acl2::x)
           (vl-maybe-integer-listp (difference acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-duplicated-members

(defthm vl-maybe-integer-listp-of-duplicated-members
  (implies (vl-maybe-integer-listp acl2::x)
           (vl-maybe-integer-listp (duplicated-members acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-rev

(defthm vl-maybe-integer-listp-of-rev
  (equal (vl-maybe-integer-listp (rev acl2::x))
         (vl-maybe-integer-listp (list-fix acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-append

(defthm vl-maybe-integer-listp-of-append
  (equal (vl-maybe-integer-listp (append acl2::a acl2::b))
         (and (vl-maybe-integer-listp (list-fix acl2::a))
              (vl-maybe-integer-listp acl2::b)))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-rcons

(defthm vl-maybe-integer-listp-of-rcons
  (iff (vl-maybe-integer-listp (acl2::rcons acl2::a acl2::x))
       (and (maybe-integerp acl2::a)
            (vl-maybe-integer-listp (list-fix acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: maybe-integerp-when-member-equal-of-vl-maybe-integer-listp

(defthm maybe-integerp-when-member-equal-of-vl-maybe-integer-listp
  (and (implies (and (member-equal acl2::a acl2::x)
                     (vl-maybe-integer-listp acl2::x))
                (maybe-integerp acl2::a))
       (implies (and (vl-maybe-integer-listp acl2::x)
                     (member-equal acl2::a acl2::x))
                (maybe-integerp acl2::a)))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-when-subsetp-equal

(defthm vl-maybe-integer-listp-when-subsetp-equal
  (and (implies (and (subsetp-equal acl2::x acl2::y)
                     (vl-maybe-integer-listp acl2::y))
                (equal (vl-maybe-integer-listp acl2::x)
                       (true-listp acl2::x)))
       (implies (and (vl-maybe-integer-listp acl2::y)
                     (subsetp-equal acl2::x acl2::y))
                (equal (vl-maybe-integer-listp acl2::x)
                       (true-listp acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-set-difference-equal

(defthm vl-maybe-integer-listp-of-set-difference-equal
 (implies
    (vl-maybe-integer-listp acl2::x)
    (vl-maybe-integer-listp (set-difference-equal acl2::x acl2::y)))
 :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-intersection-equal-1

(defthm vl-maybe-integer-listp-of-intersection-equal-1
 (implies
      (vl-maybe-integer-listp (double-rewrite acl2::x))
      (vl-maybe-integer-listp (intersection-equal acl2::x acl2::y)))
 :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-intersection-equal-2

(defthm vl-maybe-integer-listp-of-intersection-equal-2
 (implies
      (vl-maybe-integer-listp (double-rewrite acl2::y))
      (vl-maybe-integer-listp (intersection-equal acl2::x acl2::y)))
 :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-union-equal

(defthm vl-maybe-integer-listp-of-union-equal
  (equal (vl-maybe-integer-listp (union-equal acl2::x acl2::y))
         (and (vl-maybe-integer-listp (list-fix acl2::x))
              (vl-maybe-integer-listp (double-rewrite acl2::y))))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-take

(defthm vl-maybe-integer-listp-of-take
  (implies (vl-maybe-integer-listp (double-rewrite acl2::x))
           (iff (vl-maybe-integer-listp (take acl2::n acl2::x))
                (or (maybe-integerp nil)
                    (<= (nfix acl2::n) (len acl2::x)))))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-repeat

(defthm vl-maybe-integer-listp-of-repeat
  (iff (vl-maybe-integer-listp (repeat acl2::n acl2::x))
       (or (maybe-integerp acl2::x)
           (zp acl2::n)))
  :rule-classes ((:rewrite)))

Theorem: maybe-integerp-of-nth-when-vl-maybe-integer-listp

(defthm maybe-integerp-of-nth-when-vl-maybe-integer-listp
  (implies (vl-maybe-integer-listp acl2::x)
           (maybe-integerp (nth acl2::n acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-update-nth

(defthm vl-maybe-integer-listp-of-update-nth
 (implies
  (vl-maybe-integer-listp (double-rewrite acl2::x))
  (iff (vl-maybe-integer-listp (update-nth acl2::n acl2::y acl2::x))
       (and (maybe-integerp acl2::y)
            (or (<= (nfix acl2::n) (len acl2::x))
                (maybe-integerp nil)))))
 :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-butlast

(defthm vl-maybe-integer-listp-of-butlast
  (implies (vl-maybe-integer-listp (double-rewrite acl2::x))
           (vl-maybe-integer-listp (butlast acl2::x acl2::n)))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-nthcdr

(defthm vl-maybe-integer-listp-of-nthcdr
  (implies (vl-maybe-integer-listp (double-rewrite acl2::x))
           (vl-maybe-integer-listp (nthcdr acl2::n acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-last

(defthm vl-maybe-integer-listp-of-last
  (implies (vl-maybe-integer-listp (double-rewrite acl2::x))
           (vl-maybe-integer-listp (last acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-remove

(defthm vl-maybe-integer-listp-of-remove
  (implies (vl-maybe-integer-listp acl2::x)
           (vl-maybe-integer-listp (remove acl2::a acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-integer-listp-of-revappend

(defthm vl-maybe-integer-listp-of-revappend
  (equal (vl-maybe-integer-listp (revappend acl2::x acl2::y))
         (and (vl-maybe-integer-listp (list-fix acl2::x))
              (vl-maybe-integer-listp acl2::y)))
  :rule-classes ((:rewrite)))