• Top
    • Documentation
    • Books
    • Recursion-and-induction
    • Boolean-reasoning
    • Debugging
    • Projects
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
      • Kestrel-books
        • Crypto-hdwallet
        • Error-checking
        • Apt
        • Abnf
        • Fty-extensions
        • Isar
        • Kestrel-utilities
          • Omaps
          • Directed-untranslate
          • Include-book-paths
          • Ubi
          • Checkpoint-list
          • Digits-any-base
          • Context-message-pair
          • Numbered-names
          • With-auto-termination
          • Theorems-about-true-list-lists
            • Make-termination-theorem
            • Sublis-expr+
            • Prove$
            • Defthm<w
            • System-utilities-non-built-in
            • Integer-range-fix
            • Add-const-to-untranslate-preprocess
            • Integers-from-to
            • Minimize-ruler-extenders
            • Unsigned-byte-fix
            • Signed-byte-fix
            • Defthmr
            • Paired-names
            • Unsigned-byte-list-fix
            • Signed-byte-list-fix
            • Show-books
            • Checkpoint-list-pretty
            • List-utilities
            • Skip-in-book
            • Typed-tuplep
            • Defunt
            • Keyword-value-list-to-alist
            • Magic-macroexpand
            • Top-command-number-fn
            • Bits-as-digits-in-base-2
            • Show-checkpoint-list
            • Ubyte11s-as-digits-in-base-2048
            • Named-formulas
            • Bytes-as-digits-in-base-256
            • String-utilities
            • Make-keyword-value-list-from-keys-and-value
            • Integer-range-listp
            • Defmacroq
            • Apply-fn-if-known
            • Trans-eval-error-triple
            • Checkpoint-info-list
            • Previous-subsumer-hints
            • Fms!-lst
            • Zp-listp
            • Doublets-to-alist
            • Trans-eval-state
            • Injections
            • Theorems-about-osets
            • Typed-list-utilities
            • Book-runes-alist
            • User-interface
            • Bits/ubyte11s-digit-grouping
            • Bits/bytes-digit-grouping
            • Message-utilities
            • Subsetp-eq-linear
            • Strict-merge-sort-<
            • Miscellaneous-enumerations
            • Maybe-unquote
            • Oset-utilities
            • Thm<w
            • Defthmd<w
          • Prime-field-constraint-systems
          • Soft
          • Bv
          • Imp-language
          • Event-macros
          • Bitcoin
          • Ethereum
          • Yul
          • Zcash
          • ACL2-programming-language
          • Prime-fields
          • Java
          • C
          • Syntheto
          • Number-theory
          • Cryptography
          • Lists-light
          • File-io-light
          • Json
          • Built-ins
          • Solidity
          • Axe
          • Std-extensions
          • Htclient
          • Typed-lists-light
          • Arithmetic-light
        • X86isa
        • Execloader
        • Axe
      • Testing-utilities
      • Math
    • Kestrel-utilities
    • True-list-listp
    • Std/typed-lists

    Theorems-about-true-list-lists

    Theorems about true lists of true lists.

    These are generated via std::deflist.

    Definitions and Theorems

    Theorem: true-list-listp-of-cons

    (defthm true-list-listp-of-cons
            (equal (true-list-listp (cons a x))
                   (and (true-listp a)
                        (true-list-listp x)))
            :rule-classes ((:rewrite)))

    Theorem: true-list-listp-of-cdr-when-true-list-listp

    (defthm true-list-listp-of-cdr-when-true-list-listp
            (implies (true-list-listp (double-rewrite x))
                     (true-list-listp (cdr x)))
            :rule-classes ((:rewrite)))

    Theorem: true-list-listp-when-not-consp

    (defthm true-list-listp-when-not-consp
            (implies (not (consp x))
                     (equal (true-list-listp x) (not x)))
            :rule-classes ((:rewrite)))

    Theorem: true-listp-of-car-when-true-list-listp

    (defthm true-listp-of-car-when-true-list-listp
            (implies (true-list-listp x)
                     (true-listp (car x)))
            :rule-classes ((:rewrite)))

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

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

    Theorem: true-list-listp-of-list-fix

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

    Theorem: true-list-listp-of-sfix

    (defthm true-list-listp-of-sfix
            (iff (true-list-listp (set::sfix x))
                 (or (true-list-listp x)
                     (not (set::setp x))))
            :rule-classes ((:rewrite)))

    Theorem: true-list-listp-of-insert

    (defthm true-list-listp-of-insert
            (iff (true-list-listp (set::insert a x))
                 (and (true-list-listp (set::sfix x))
                      (true-listp a)))
            :rule-classes ((:rewrite)))

    Theorem: true-list-listp-of-delete

    (defthm true-list-listp-of-delete
            (implies (true-list-listp x)
                     (true-list-listp (set::delete k x)))
            :rule-classes ((:rewrite)))

    Theorem: true-list-listp-of-mergesort

    (defthm true-list-listp-of-mergesort
            (iff (true-list-listp (set::mergesort x))
                 (true-list-listp (list-fix x)))
            :rule-classes ((:rewrite)))

    Theorem: true-list-listp-of-union

    (defthm true-list-listp-of-union
            (iff (true-list-listp (set::union x y))
                 (and (true-list-listp (set::sfix x))
                      (true-list-listp (set::sfix y))))
            :rule-classes ((:rewrite)))

    Theorem: true-list-listp-of-intersect-1

    (defthm true-list-listp-of-intersect-1
            (implies (true-list-listp x)
                     (true-list-listp (set::intersect x y)))
            :rule-classes ((:rewrite)))

    Theorem: true-list-listp-of-intersect-2

    (defthm true-list-listp-of-intersect-2
            (implies (true-list-listp y)
                     (true-list-listp (set::intersect x y)))
            :rule-classes ((:rewrite)))

    Theorem: true-list-listp-of-difference

    (defthm true-list-listp-of-difference
            (implies (true-list-listp x)
                     (true-list-listp (set::difference x y)))
            :rule-classes ((:rewrite)))

    Theorem: true-list-listp-of-duplicated-members

    (defthm true-list-listp-of-duplicated-members
            (implies (true-list-listp x)
                     (true-list-listp (duplicated-members x)))
            :rule-classes ((:rewrite)))

    Theorem: true-list-listp-of-rev

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

    Theorem: true-list-listp-of-append

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

    Theorem: true-list-listp-of-rcons

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

    Theorem: true-listp-when-member-equal-of-true-list-listp

    (defthm true-listp-when-member-equal-of-true-list-listp
            (and (implies (and (member-equal a x)
                               (true-list-listp x))
                          (true-listp a))
                 (implies (and (true-list-listp x)
                               (member-equal a x))
                          (true-listp a)))
            :rule-classes ((:rewrite)))

    Theorem: true-list-listp-when-subsetp-equal

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

    Theorem: true-list-listp-of-set-difference-equal

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

    Theorem: true-list-listp-of-intersection-equal-1

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

    Theorem: true-list-listp-of-intersection-equal-2

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

    Theorem: true-list-listp-of-union-equal

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

    Theorem: true-list-listp-of-take

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

    Theorem: true-list-listp-of-repeat

    (defthm true-list-listp-of-repeat
            (iff (true-list-listp (repeat n x))
                 (or (true-listp x) (zp n)))
            :rule-classes ((:rewrite)))

    Theorem: true-listp-of-nth-when-true-list-listp

    (defthm true-listp-of-nth-when-true-list-listp
            (implies (true-list-listp x)
                     (true-listp (nth n x)))
            :rule-classes ((:rewrite)))

    Theorem: true-list-listp-of-update-nth

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

    Theorem: true-list-listp-of-butlast

    (defthm true-list-listp-of-butlast
            (implies (true-list-listp (double-rewrite x))
                     (true-list-listp (butlast x n)))
            :rule-classes ((:rewrite)))

    Theorem: true-list-listp-of-nthcdr

    (defthm true-list-listp-of-nthcdr
            (implies (true-list-listp (double-rewrite x))
                     (true-list-listp (nthcdr n x)))
            :rule-classes ((:rewrite)))

    Theorem: true-list-listp-of-last

    (defthm true-list-listp-of-last
            (implies (true-list-listp (double-rewrite x))
                     (true-list-listp (last x)))
            :rule-classes ((:rewrite)))

    Theorem: true-list-listp-of-remove

    (defthm true-list-listp-of-remove
            (implies (true-list-listp x)
                     (true-list-listp (remove a x)))
            :rule-classes ((:rewrite)))

    Theorem: true-list-listp-of-revappend

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