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

• Fty::basetypes
• Maybe-bitp

Maybe-bit-fix

(maybe-bit-fix x) is the identity for maybe-bitps, or coerces any non-bitp to nil.

Performance note. In the execution this is just an inlined identity function, i.e., it should have zero runtime cost.

Definitions and Theorems

Function: maybe-bit-fix$inline

(defun maybe-bit-fix$inline (x)
  (declare (xargs :guard (maybe-bitp x)))
  (mbe :logic (if x (bfix x) nil)
       :exec x))

Theorem: maybe-bitp-of-maybe-bit-fix

(defthm maybe-bitp-of-maybe-bit-fix
  (maybe-bitp (maybe-bit-fix x))
  :rule-classes (:rewrite :type-prescription))

Theorem: maybe-bit-fix-when-maybe-bitp

(defthm maybe-bit-fix-when-maybe-bitp
  (implies (maybe-bitp x)
           (equal (maybe-bit-fix x) x)))

Theorem: maybe-bit-fix-under-iff

(defthm maybe-bit-fix-under-iff
  (iff (maybe-bit-fix x) x))

Theorem: maybe-bit-fix-under-bit-equiv

(defthm maybe-bit-fix-under-bit-equiv
  (bit-equiv (maybe-bit-fix x) x))