• 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
    • Defthm
    • Defthm<w

    Previous-subsumer-hints

    Hints to prove a theorem directly from previously-proved theorems.

    General Form:
    (previous-subsumer-hints term wrld)

    where term is a translated term (see term) and wrld is a logical world, such as (w state). See defthm<w for an explanation of what this function returns: in short, it either returns nil or suitable hints for proving term. Here is a log that illustrates this function.

    ACL2 !>(previous-subsumer-hints '(equal (car (cons u v)) u) (w state))
    (:BY CAR-CONS
         :DO-NOT *ALL-BUT-SIMPLIFY*)
    ACL2 !>:trans (and (equal (car (cons u v)) u)
                       (equal (cdr (cons a b)) b))
    
    (IF (EQUAL (CAR (CONS U V)) U)
        (EQUAL (CDR (CONS A B)) B)
        'NIL)
    
    => *
    
    ACL2 !>(previous-subsumer-hints '(IF (EQUAL (CAR (CONS U V)) U)
                                         (EQUAL (CDR (CONS A B)) B)
                                         'NIL)
                                     (w state))
    (:USE ((:INSTANCE CAR-CONS (Y V) (X U))
           (:INSTANCE CDR-CONS (Y B) (X A)))
          :IN-THEORY (THEORY 'MINIMAL-THEORY)
          :DO-NOT *ALL-BUT-SIMPLIFY*)
    ACL2 !>