• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Community
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
    • Kestrel-books
      • Crypto-hdwallet
      • Apt
      • Error-checking
      • Fty-extensions
      • Isar
      • Kestrel-utilities
      • Set
      • C
        • Syntax-for-tools
        • Atc
        • Transformation-tools
        • Language
          • Abstract-syntax
          • Integer-ranges
            • Def-integer-range
            • Integer-type-rangep
            • Ushort-integer
            • Ullong-integer
            • Sshort-integer
            • Sllong-integer
            • Ulong-integer
            • Uint-integer
            • Uchar-integer
            • Slong-integer
            • Sint-integer
            • Schar-integer
            • Ushort-max
            • Slong-max
            • Sllong-max
            • Integer-type-min
            • Integer-type-max
            • Uint-max
            • Sint-max
            • Ulong-max
            • Uchar-max
            • Def-integer-range-loop
            • Sshort-min
            • Sshort-max
            • Slong-min
            • Sint-min
            • Ullong-max
            • Sllong-min
            • Schar-min
            • Schar-max
            • Ushort-integer-list
            • Ulong-integer-list
            • Ullong-integer-list
            • Uint-integer-list
            • Uchar-integer-list
            • Sshort-integer-list
            • Slong-integer-list
            • Sllong-integer-list
            • Sint-integer-list
              • Sint-integer-list-fix
              • Sint-integer-list-equiv
              • Sint-integer-listp
                • Sint-integer-listp-basics
            • Schar-integer-list
            • Uchar-integerp-alt-def
            • Ushort-integerp-alt-def
            • Ulong-integerp-alt-def
            • Ullong-integerp-alt-def
            • Uint-integerp-alt-def
            • Sshort-integerp-alt-def
            • Slong-integerp-alt-def
            • Sllong-integerp-alt-def
            • Sint-integerp-alt-def
            • Schar-integerp-alt-def
          • Implementation-environments
          • Dynamic-semantics
          • Static-semantics
          • Grammar
          • Types
          • Integer-formats-definitions
          • Computation-states
          • Portable-ascii-identifiers
          • Values
          • Integer-operations
          • Object-designators
          • Operations
          • Errors
          • Tag-environments
          • Function-environments
          • Character-sets
          • Flexible-array-member-removal
          • Arithmetic-operations
          • Pointer-operations
          • Real-operations
          • Array-operations
          • Scalar-operations
          • Structure-operations
        • Representation
        • Insertion-sort
        • Pack
      • Soft
      • Bv
      • Imp-language
      • Ethereum
      • Event-macros
      • Java
      • Riscv
      • Bitcoin
      • Zcash
      • Yul
      • ACL2-programming-language
      • Prime-fields
      • Json
      • Syntheto
      • File-io-light
      • Cryptography
      • Number-theory
      • Axe
      • Lists-light
      • Builtins
      • Solidity
      • Helpers
      • Htclient
      • Typed-lists-light
      • Arithmetic-light
    • X86isa
    • Axe
    • Execloader
  • Math
  • Testing-utilities

• Sint-integer-listp

Sint-integer-listp-basics

Basic theorems about sint-integer-listp, generated by std::deflist.

Definitions and Theorems

Theorem: sint-integer-listp-of-cons

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

Theorem: sint-integer-listp-of-cdr-when-sint-integer-listp

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

Theorem: sint-integer-listp-when-not-consp

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

Theorem: sint-integerp-of-car-when-sint-integer-listp

(defthm sint-integerp-of-car-when-sint-integer-listp
  (implies (sint-integer-listp acl2::x)
           (iff (sint-integerp (car acl2::x))
                (consp acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: true-listp-when-sint-integer-listp-compound-recognizer

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

Theorem: sint-integer-listp-of-list-fix

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

Theorem: sint-integer-listp-of-sfix

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

Theorem: sint-integer-listp-of-insert

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

Theorem: sint-integer-listp-of-delete

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

Theorem: sint-integer-listp-of-mergesort

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

Theorem: sint-integer-listp-of-union

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

Theorem: sint-integer-listp-of-intersect-1

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

Theorem: sint-integer-listp-of-intersect-2

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

Theorem: sint-integer-listp-of-difference

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

Theorem: sint-integer-listp-of-duplicated-members

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

Theorem: sint-integer-listp-of-rev

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

Theorem: sint-integer-listp-of-append

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

Theorem: sint-integer-listp-of-rcons

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

Theorem: sint-integerp-when-member-equal-of-sint-integer-listp

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

Theorem: sint-integer-listp-when-subsetp-equal

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

Theorem: sint-integer-listp-of-set-difference-equal

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

Theorem: sint-integer-listp-of-intersection-equal-1

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

Theorem: sint-integer-listp-of-intersection-equal-2

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

Theorem: sint-integer-listp-of-union-equal

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

Theorem: sint-integer-listp-of-take

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

Theorem: sint-integer-listp-of-repeat

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

Theorem: sint-integerp-of-nth-when-sint-integer-listp

(defthm sint-integerp-of-nth-when-sint-integer-listp
  (implies (sint-integer-listp acl2::x)
           (iff (sint-integerp (nth acl2::n acl2::x))
                (< (nfix acl2::n) (len acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: sint-integer-listp-of-update-nth

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

Theorem: sint-integer-listp-of-butlast

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

Theorem: sint-integer-listp-of-nthcdr

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

Theorem: sint-integer-listp-of-last

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

Theorem: sint-integer-listp-of-remove

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

Theorem: sint-integer-listp-of-revappend

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