• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
    • Apt
    • Zfc
    • Acre
    • Milawa
    • Smtlink
    • Abnf
    • Vwsim
    • Isar
    • Wp-gen
    • Dimacs-reader
    • Pfcs
    • Legacy-defrstobj
    • C
    • Proof-checker-array
    • Soft
    • Farray
    • Rp-rewriter
    • Instant-runoff-voting
    • Imp-language
    • Sidekick
    • Ethereum
    • Leftist-trees
    • Java
    • Riscv
    • Taspi
    • Bitcoin
    • Zcash
    • Des
    • X86isa
    • Sha-2
    • Yul
    • Proof-checker-itp13
    • Regex
    • ACL2-programming-language
    • Json
    • Jfkr
    • Equational
    • Cryptography
    • Axe
    • Poseidon
    • Where-do-i-place-my-book
    • Aleo
      • Aleobft
      • Aleovm
      • Leo
        • Grammar
        • Early-version
          • Json2ast
          • Testing
          • Definition
            • Flattening
            • Abstract-syntax
              • Expression
              • Syntax-abstraction
              • Statement
              • Files
                • Funparam-list->name-list
                • Fundecl
                • Var/const-sort
                • Structdecl
                • File
                • Finalizer-option
                • Topdecl
                • Mappingdecl
                • Fundecl-option
                • Finalizer
                • Funparam
                • Fun-sort
                • Programdecl
                • Compdecl
                • Var/const-sort-result
                • Topdecl-list-result
                • Programdecl-list-result
                • Importdecl-list-result
                • Funparam-list-result
                • Finalizer-option-result
                • Compdecl-list-result
                • Topdecl-result
                • Structdecl-result
                • Programdecl-result
                • Mappingdecl-result
                • Importdecl-result
                • Importdecl
                • Funparam-result
                • Fundecl-result
                • Fun-sort-result
                • Finalizer-result
                • Compdecl-result
                • File-result
                • Funparam-list
                • Programdecl-list
                • Importdecl-list
                  • Importdecl-list-fix
                  • Importdecl-list-equiv
                  • Importdecl-listp
                    • Importdecl-listp-basics
                • Compdecl-list
                • Var/const-sort-list
                • Topdecl-list
                • Fundecl-list
              • Input-files
              • Identifiers
              • Types
              • Struct-init
              • Branch
              • Statements
              • Format-strings
              • Input-syntax-abstraction
              • Expressions
              • Output-files
              • Addresses
              • Literals
              • Characters
              • Expression-list
              • Statement-list
              • Output-syntax-abstraction
              • Struct-init-list
              • Branch-list
              • Annotations
              • Abstract-syntax-trees
              • Symbols
              • Keywords
              • Programs
              • Packages
              • Bit-sizes
            • Dynamic-semantics
            • Compilation
            • Static-semantics
            • Concrete-syntax
    • Bigmems
    • Builtins
    • Execloader
    • Solidity
    • Paco
    • Concurrent-programs
    • Bls12-377-curves
  • Debugging
  • Community
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Math
  • Testing-utilities

• Importdecl-listp

Importdecl-listp-basics

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

Definitions and Theorems

Theorem: importdecl-listp-of-cons

(defthm importdecl-listp-of-cons
  (equal (importdecl-listp (cons acl2::a acl2::x))
         (and (importdeclp acl2::a)
              (importdecl-listp acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: importdecl-listp-of-cdr-when-importdecl-listp

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

Theorem: importdecl-listp-when-not-consp

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

Theorem: importdeclp-of-car-when-importdecl-listp

(defthm importdeclp-of-car-when-importdecl-listp
  (implies (importdecl-listp acl2::x)
           (iff (importdeclp (car acl2::x))
                (consp acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: true-listp-when-importdecl-listp-compound-recognizer

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

Theorem: importdecl-listp-of-list-fix

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

Theorem: importdecl-listp-of-sfix

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

Theorem: importdecl-listp-of-insert

(defthm importdecl-listp-of-insert
  (iff (importdecl-listp (insert acl2::a acl2::x))
       (and (importdecl-listp (sfix acl2::x))
            (importdeclp acl2::a)))
  :rule-classes ((:rewrite)))

Theorem: importdecl-listp-of-delete

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

Theorem: importdecl-listp-of-mergesort

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

Theorem: importdecl-listp-of-union

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

Theorem: importdecl-listp-of-intersect-1

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

Theorem: importdecl-listp-of-intersect-2

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

Theorem: importdecl-listp-of-difference

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

Theorem: importdecl-listp-of-duplicated-members

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

Theorem: importdecl-listp-of-rev

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

Theorem: importdecl-listp-of-append

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

Theorem: importdecl-listp-of-rcons

(defthm importdecl-listp-of-rcons
  (iff (importdecl-listp (rcons acl2::a acl2::x))
       (and (importdeclp acl2::a)
            (importdecl-listp (list-fix acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: importdeclp-when-member-equal-of-importdecl-listp

(defthm importdeclp-when-member-equal-of-importdecl-listp
  (and (implies (and (member-equal acl2::a acl2::x)
                     (importdecl-listp acl2::x))
                (importdeclp acl2::a))
       (implies (and (importdecl-listp acl2::x)
                     (member-equal acl2::a acl2::x))
                (importdeclp acl2::a)))
  :rule-classes ((:rewrite)))

Theorem: importdecl-listp-when-subsetp-equal

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

Theorem: importdecl-listp-of-set-difference-equal

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

Theorem: importdecl-listp-of-intersection-equal-1

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

Theorem: importdecl-listp-of-intersection-equal-2

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

Theorem: importdecl-listp-of-union-equal

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

Theorem: importdecl-listp-of-take

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

Theorem: importdecl-listp-of-repeat

(defthm importdecl-listp-of-repeat
  (iff (importdecl-listp (repeat acl2::n acl2::x))
       (or (importdeclp acl2::x) (zp acl2::n)))
  :rule-classes ((:rewrite)))

Theorem: importdeclp-of-nth-when-importdecl-listp

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

Theorem: importdecl-listp-of-update-nth

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

Theorem: importdecl-listp-of-butlast

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

Theorem: importdecl-listp-of-nthcdr

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

Theorem: importdecl-listp-of-last

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

Theorem: importdecl-listp-of-remove

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

Theorem: importdecl-listp-of-revappend

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