• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
    • Apt
    • Zfc
    • Acre
    • Milawa
    • Smtlink
    • Abnf
      • Deftreeops
        • Deftreeops-implementation
          • Deftreeops-event-generation
          • Deftreeops-info
            • Deftreeops-rulename-info
            • Deftreeops-conc-info
            • Deftreeops-rep-info
            • Deftreeops-numrange-info
            • Deftreeops-charval-info
            • Deftreeops-rep-info-list
              • Deftreeops-rep-info-list-fix
              • Deftreeops-rep-info-list-equiv
              • Deftreeops-rep-info-listp
                • Deftreeops-rep-info-listp-basics
            • Deftreeops-conc-info-list
            • Deftreeops-charval-info-alist
            • Deftreeops-rulename-info-alist
            • Deftreeops-numrange-info-alist
          • Deftreeops-process-inputs-and-gen-everything
          • Deftreeops-fn
          • Deftreeops-table
          • Deftreeops-input-processing
          • Deftreeops-macro-definition
        • Deftreeops-show-event
        • Deftreeops-show-info
      • Defdefparse
      • Defgrammar
      • Tree-utilities
      • Notation
      • Grammar-parser
      • Meta-circular-validation
      • Parsing-primitives-defresult
      • Parsing-primitives-seq
      • Operations
      • Examples
      • Differences-with-paper
      • Constructor-utilities
      • Grammar-printer
      • Parsing-tools
    • 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
    • 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

• Deftreeops-rep-info-listp

Deftreeops-rep-info-listp-basics

Basic theorems about deftreeops-rep-info-listp, generated by std::deflist.

Definitions and Theorems

Theorem: deftreeops-rep-info-listp-of-cons

(defthm deftreeops-rep-info-listp-of-cons
  (equal (deftreeops-rep-info-listp (cons acl2::a acl2::x))
         (and (deftreeops-rep-infop acl2::a)
              (deftreeops-rep-info-listp acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: deftreeops-rep-info-listp-of-cdr-when-deftreeops-rep-info-listp

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

Theorem: deftreeops-rep-info-listp-when-not-consp

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

Theorem: deftreeops-rep-infop-of-car-when-deftreeops-rep-info-listp

(defthm deftreeops-rep-infop-of-car-when-deftreeops-rep-info-listp
  (implies (deftreeops-rep-info-listp acl2::x)
           (iff (deftreeops-rep-infop (car acl2::x))
                (consp acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: true-listp-when-deftreeops-rep-info-listp-compound-recognizer

(defthm
      true-listp-when-deftreeops-rep-info-listp-compound-recognizer
  (implies (deftreeops-rep-info-listp acl2::x)
           (true-listp acl2::x))
  :rule-classes :compound-recognizer)

Theorem: deftreeops-rep-info-listp-of-list-fix

(defthm deftreeops-rep-info-listp-of-list-fix
  (implies (deftreeops-rep-info-listp acl2::x)
           (deftreeops-rep-info-listp (list-fix acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: deftreeops-rep-info-listp-of-sfix

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

Theorem: deftreeops-rep-info-listp-of-insert

(defthm deftreeops-rep-info-listp-of-insert
  (iff (deftreeops-rep-info-listp (insert acl2::a acl2::x))
       (and (deftreeops-rep-info-listp (sfix acl2::x))
            (deftreeops-rep-infop acl2::a)))
  :rule-classes ((:rewrite)))

Theorem: deftreeops-rep-info-listp-of-delete

(defthm deftreeops-rep-info-listp-of-delete
  (implies (deftreeops-rep-info-listp acl2::x)
           (deftreeops-rep-info-listp (delete acl2::k acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: deftreeops-rep-info-listp-of-mergesort

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

Theorem: deftreeops-rep-info-listp-of-union

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

Theorem: deftreeops-rep-info-listp-of-intersect-1

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

Theorem: deftreeops-rep-info-listp-of-intersect-2

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

Theorem: deftreeops-rep-info-listp-of-difference

(defthm deftreeops-rep-info-listp-of-difference
  (implies (deftreeops-rep-info-listp acl2::x)
           (deftreeops-rep-info-listp (difference acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: deftreeops-rep-info-listp-of-duplicated-members

(defthm deftreeops-rep-info-listp-of-duplicated-members
  (implies (deftreeops-rep-info-listp acl2::x)
           (deftreeops-rep-info-listp (duplicated-members acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: deftreeops-rep-info-listp-of-rev

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

Theorem: deftreeops-rep-info-listp-of-append

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

Theorem: deftreeops-rep-info-listp-of-rcons

(defthm deftreeops-rep-info-listp-of-rcons
  (iff (deftreeops-rep-info-listp (rcons acl2::a acl2::x))
       (and (deftreeops-rep-infop acl2::a)
            (deftreeops-rep-info-listp (list-fix acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: deftreeops-rep-infop-when-member-equal-of-deftreeops-rep-info-listp

(defthm
 deftreeops-rep-infop-when-member-equal-of-deftreeops-rep-info-listp
 (and (implies (and (member-equal acl2::a acl2::x)
                    (deftreeops-rep-info-listp acl2::x))
               (deftreeops-rep-infop acl2::a))
      (implies (and (deftreeops-rep-info-listp acl2::x)
                    (member-equal acl2::a acl2::x))
               (deftreeops-rep-infop acl2::a)))
 :rule-classes ((:rewrite)))

Theorem: deftreeops-rep-info-listp-when-subsetp-equal

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

Theorem: deftreeops-rep-info-listp-of-set-difference-equal

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

Theorem: deftreeops-rep-info-listp-of-intersection-equal-1

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

Theorem: deftreeops-rep-info-listp-of-intersection-equal-2

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

Theorem: deftreeops-rep-info-listp-of-union-equal

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

Theorem: deftreeops-rep-info-listp-of-take

(defthm deftreeops-rep-info-listp-of-take
  (implies (deftreeops-rep-info-listp (double-rewrite acl2::x))
           (iff (deftreeops-rep-info-listp (take acl2::n acl2::x))
                (or (deftreeops-rep-infop nil)
                    (<= (nfix acl2::n) (len acl2::x)))))
  :rule-classes ((:rewrite)))

Theorem: deftreeops-rep-info-listp-of-repeat

(defthm deftreeops-rep-info-listp-of-repeat
  (iff (deftreeops-rep-info-listp (repeat acl2::n acl2::x))
       (or (deftreeops-rep-infop acl2::x)
           (zp acl2::n)))
  :rule-classes ((:rewrite)))

Theorem: deftreeops-rep-infop-of-nth-when-deftreeops-rep-info-listp

(defthm deftreeops-rep-infop-of-nth-when-deftreeops-rep-info-listp
  (implies (deftreeops-rep-info-listp acl2::x)
           (iff (deftreeops-rep-infop (nth acl2::n acl2::x))
                (< (nfix acl2::n) (len acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: deftreeops-rep-info-listp-of-update-nth

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

Theorem: deftreeops-rep-info-listp-of-butlast

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

Theorem: deftreeops-rep-info-listp-of-nthcdr

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

Theorem: deftreeops-rep-info-listp-of-last

(defthm deftreeops-rep-info-listp-of-last
  (implies (deftreeops-rep-info-listp (double-rewrite acl2::x))
           (deftreeops-rep-info-listp (last acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: deftreeops-rep-info-listp-of-remove

(defthm deftreeops-rep-info-listp-of-remove
  (implies (deftreeops-rep-info-listp acl2::x)
           (deftreeops-rep-info-listp (remove acl2::a acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: deftreeops-rep-info-listp-of-revappend

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