• 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
          • Nibble
          • Nibblep-additional-theorems
          • 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
          • 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
    • Nibblep
    • Nibble

    Nibblep-additional-theorems

    Additional theorems about nibble.

    Definitions and Theorems

    Theorem: nibblep-forward-unsigned-byte-p

    (defthm nibblep-forward-unsigned-byte-p
      (implies (nibblep x)
               (unsigned-byte-p 4 x))
      :rule-classes :forward-chaining)

    Theorem: unsigned-byte-p-rewrite-nibblep

    (defthm unsigned-byte-p-rewrite-nibblep
      (equal (unsigned-byte-p 4 x)
             (nibblep x)))

    Theorem: natp-when-nibblep

    (defthm natp-when-nibblep
      (implies (nibblep x) (natp x))
      :rule-classes :compound-recognizer)