• Top
    • Documentation
    • Books
    • Recursion-and-induction
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
      • Std/lists
      • Std/alists
      • Obags
      • Std/util
      • Std/strings
      • Std/io
      • Std/osets
      • Std/system
      • Std/basic
        • Maybe-stringp
        • Maybe-natp
        • Two-nats-measure
        • Impossible
        • Nat-list-measure
        • Bytep
        • Maybe-posp
        • Nibblep
        • Mbt$
        • Organize-symbols-by-pkg
        • Organize-symbols-by-name
        • Good-valuep
        • Lnfix
        • Streqv
        • Chareqv
        • Symbol-package-name-non-cl
        • Std/basic-extensions
        • Arith-equivs
        • Induction-schemes
        • Maybe-integerp
        • Char-fix
        • Symbol-package-name-lst
        • Pos-fix
        • Maybe-bitp
          • Maybe-bit-fix
          • Maybe-bit-equiv
        • Good-pseudo-termp
        • Str-fix
        • Maybe-string-fix
        • Lifix
        • Bfix
        • Std/basic/if*
        • Impliez
        • Tuplep
        • Std/basic/symbol-name-lst
        • Std/basic/intern-in-package-of-symbol
        • Lbfix
        • True
        • Std/basic/member-symbol-name
        • False
      • Std/typed-lists
      • Std/bitsets
      • Std/testing
      • Std/typed-alists
      • Std/stobjs
      • Std-extensions
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
    • Testing-utilities
    • Math
  • Std/basic
  • Bitp

Maybe-bitp

Recognizer for bits and nil.

This is like an option type; when x satisfies maybe-bitp, then either it is a bitp or nothing.

Definitions and Theorems

Function: maybe-bitp$inline

(defun maybe-bitp$inline (x)
       (declare (xargs :guard t))
       (or (not x) (bitp x)))

Theorem: maybe-bitp-compound-recognizer

(defthm maybe-bitp-compound-recognizer
        (implies (maybe-bitp x)
                 (or (not x) (bitp x)))
        :rule-classes :compound-recognizer)

Subtopics

Maybe-bit-fix
(maybe-bit-fix x) is the identity for maybe-bitps, or coerces any non-bitp to nil.
Maybe-bit-equiv
(maybe-bitp-equiv x y) is an equivalence relation for maybe-bitps, i.e., equality up to maybe-bit-fix.