• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
      • Vwsim
      • Isar
      • Wp-gen
      • Dimacs-reader
      • Pfcs
      • Legacy-defrstobj
      • Proof-checker-array
      • Soft
      • C
      • Farray
      • Rp-rewriter
      • Instant-runoff-voting
      • Imp-language
      • Sidekick
      • Leftist-trees
      • Java
      • Taspi
      • Bitcoin
      • Riscv
        • Instructions
        • States
        • Decoding
        • Encoding
        • Features
          • Feat-bits
          • Feat
            • Featp
              • Feat-fix
              • Feat-equiv
              • Make-feat
              • Change-feat
              • Feat->bits
            • Feat->xnum
            • Feat->xlen
            • Feat-64p
            • Feat-32p
          • Semantics
          • Execution
        • Des
        • Ethereum
        • X86isa
        • Sha-2
        • Yul
        • Zcash
        • Proof-checker-itp13
        • Regex
        • ACL2-programming-language
        • Json
        • Jfkr
        • Equational
        • Cryptography
        • Poseidon
        • Where-do-i-place-my-book
        • Axe
        • Bigmems
        • Builtins
        • Execloader
        • Aleo
        • Solidity
        • Paco
        • Concurrent-programs
        • Bls12-377-curves
      • Debugging
      • Std
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Feat

    Featp

    Recognizer for feat structures.

    Signature
    (featp x) → *

    Definitions and Theorems

    Function: featp

    (defun featp (x)
      (declare (xargs :guard t))
      (let ((__function__ 'featp))
        (declare (ignorable __function__))
        (and (mbe :logic (and (alistp x)
                              (equal (strip-cars x) '(bits)))
                  :exec (fty::alist-with-carsp x '(bits)))
             (b* ((bits (cdr (std::da-nth 0 x))))
               (feat-bitsp bits)))))

    Theorem: consp-when-featp

    (defthm consp-when-featp
      (implies (featp x) (consp x))
      :rule-classes :compound-recognizer)