• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Community
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
      • Kestrel-books
        • Crypto-hdwallet
        • Apt
        • Error-checking
        • Fty-extensions
        • Isar
        • Kestrel-utilities
        • Set
        • C
        • Soft
        • Bv
        • Imp-language
        • Ethereum
        • Event-macros
        • Java
        • Riscv
        • Bitcoin
        • Zcash
        • Yul
        • ACL2-programming-language
        • Prime-fields
        • Json
        • Syntheto
          • Process-syntheto-toplevel-fn
          • Translation
          • Language
            • Static-semantics
            • Abstract-syntax
            • Outcome
            • Abstract-syntax-operations
            • Outcome-list
              • Outcome-list-fix
              • Outcome-list-equiv
              • Outcome-listp
                • Outcome-listp-basics
              • Outcomes
            • Process-syntheto-toplevel
            • Shallow-embedding
          • File-io-light
          • Cryptography
          • Number-theory
          • Axe
          • Lists-light
          • Builtins
          • Solidity
          • Helpers
          • Htclient
          • Typed-lists-light
          • Arithmetic-light
        • X86isa
        • Axe
        • Execloader
      • Math
      • Testing-utilities
    • Outcome-listp

    Outcome-listp-basics

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

    Definitions and Theorems

    Theorem: outcome-listp-of-cons

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

    Theorem: outcome-listp-of-cdr-when-outcome-listp

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

    Theorem: outcome-listp-when-not-consp

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

    Theorem: outcomep-of-car-when-outcome-listp

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

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

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

    Theorem: outcome-listp-of-list-fix

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

    Theorem: outcome-listp-of-rev

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

    Theorem: outcome-listp-of-append

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