• 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
        • Byte
        • Bytes-as-digits-in-base-256
        • Bytep-additional-theorems
      • 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
      • 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

• Bytep
• Byte

Bytep-additional-theorems

Additional theorems about byte.

Definitions and Theorems

Theorem: bytep-forward-unsigned-byte-p

(defthm bytep-forward-unsigned-byte-p
        (implies (bytep x)
                 (unsigned-byte-p 8 x))
        :rule-classes :forward-chaining)

Theorem: unsigned-byte-p-rewrite-bytep

(defthm unsigned-byte-p-rewrite-bytep
        (equal (unsigned-byte-p 8 x) (bytep x)))

Theorem: natp-when-bytep

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