• 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
        • Semantics
        • Abstract-syntax
          • Aexp
          • Bexp
            • Bexp-case
            • Bexp-fix
            • Bexpp
            • Bexp-count
            • Bexp-equiv
            • Bexp-less
            • Bexp-equal
            • Bexp-and
            • Bexp-const
            • Bexp-not
            • Bexp-kind
            • Comm
            • Comm-list
            • Command-fixtypes
          • Interpreter
        • Sidekick
        • Leftist-trees
        • Java
        • Taspi
        • Bitcoin
        • Riscv
        • 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
    • Bexp

    Bexp-kind

    Get the kind (tag) of a bexp structure.

    Signature
    (bexp-kind x) → kind
    Arguments
    x — Guard (bexpp x).

    Definitions and Theorems

    Function: bexp-kind$inline

    (defun bexp-kind$inline (x)
      (declare (xargs :guard (bexpp x)))
      (let ((__function__ 'bexp-kind))
        (declare (ignorable __function__))
        (mbe :logic (cond ((or (atom x) (eq (car x) :const))
                           :const)
                          ((eq (car x) :equal) :equal)
                          ((eq (car x) :less) :less)
                          ((eq (car x) :not) :not)
                          (t :and))
             :exec (car x))))

    Theorem: bexp-kind-possibilities

    (defthm bexp-kind-possibilities
     (or (equal (bexp-kind x) :const)
         (equal (bexp-kind x) :equal)
         (equal (bexp-kind x) :less)
         (equal (bexp-kind x) :not)
         (equal (bexp-kind x) :and))
     :rule-classes ((:forward-chaining :trigger-terms ((bexp-kind x)))))