• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
      • Kestrel-books
        • Crypto-hdwallet
        • Apt
        • Error-checking
        • Fty-extensions
        • Isar
        • Kestrel-utilities
          • Omaps
          • Directed-untranslate
          • Include-book-paths
          • Ubi
          • Numbered-names
          • Digits-any-base
          • Context-message-pair
          • With-auto-termination
          • Make-termination-theorem
          • Theorems-about-true-list-lists
          • Checkpoint-list
          • Sublis-expr+
          • Integers-from-to
          • Prove$
          • Defthm<w
          • System-utilities-non-built-in
          • Integer-range-fix
          • Minimize-ruler-extenders
          • Add-const-to-untranslate-preprocess
          • Unsigned-byte-fix
          • Signed-byte-fix
          • Defthmr
          • Paired-names
          • Unsigned-byte-list-fix
          • Signed-byte-list-fix
          • Show-books
          • Skip-in-book
          • Typed-tuplep
          • List-utilities
            • Set-size
            • List-len-const-theorems
            • Nthcdr-theorems
              • Append-theorems
              • Rev-theorems
              • Prefixp-theorems
              • Take-theorems
              • Intersectp-equal-theorems
              • List-primitive-theorems
              • Set-difference-equal-theorems
              • Intersection-equal-theorems
              • Index-of-theorems
              • Last-theorems
            • Checkpoint-list-pretty
            • 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
            • Defmacroq
            • Integer-range-listp
            • Apply-fn-if-known
            • Trans-eval-error-triple
            • Checkpoint-info-list
            • Previous-subsumer-hints
            • Fms!-lst
            • Zp-listp
            • Trans-eval-state
            • Injections
            • Doublets-to-alist
            • Theorems-about-osets
            • Typed-list-utilities
            • Book-runes-alist
            • User-interface
            • Bits/ubyte11s-digit-grouping
            • Bits/bytes-digit-grouping
            • Message-utilities
            • Subsetp-eq-linear
            • Oset-utilities
            • Strict-merge-sort-<
            • Miscellaneous-enumerations
            • Maybe-unquote
            • Thm<w
            • Defthmd<w
            • Io-utilities
          • Set
          • Soft
          • C
          • Bv
          • Imp-language
          • Event-macros
          • Java
          • Bitcoin
          • Ethereum
          • Yul
          • Zcash
          • ACL2-programming-language
          • Prime-fields
          • Json
          • Syntheto
          • File-io-light
          • Cryptography
          • Number-theory
          • Lists-light
          • Axe
          • Builtins
          • Solidity
          • Helpers
          • Htclient
          • Typed-lists-light
          • Arithmetic-light
        • X86isa
        • Axe
        • Execloader
      • Math
      • Testing-utilities
    • List-utilities
    • Nthcdr

    Nthcdr-theorems

    Some theorems about the built-in function nthcdr.

    The theorems nthcdr-of-append-when-leq-len-first and nthcdr-of-append-when-gt-len-first are disabled by default. They are special cases of nthcdr-of-append, which is enabled by default and is perhaps more useful in general.

    Definitions and Theorems

    Theorem: nthcdr-of-append-when-leq-len-first

    (defthm nthcdr-of-append-when-leq-len-first
      (implies (<= n (len a))
               (equal (nthcdr n (append a b))
                      (append (nthcdr n a) b))))

    Theorem: nthcdr-of-append-when-gt-len-first

    (defthm nthcdr-of-append-when-gt-len-first
      (implies (and (natp n) (> n (len a)))
               (equal (nthcdr n (append a b))
                      (nthcdr (- n (len a)) b))))

    Theorem: nthcdr-of-append

    (defthm nthcdr-of-append
      (implies (natp n)
               (equal (nthcdr n (append a b))
                      (if (<= n (len a))
                          (append (nthcdr n a) b)
                        (nthcdr (- n (len a)) b)))))

    Theorem: nthcdr-when-len

    (defthm nthcdr-when-len
      (implies (equal n (len x))
               (list-equiv (nthcdr n x) nil)))