• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
      • Std/lists
      • Std/alists
      • Obags
      • Std/util
      • Std/strings
        • Pretty-printing
        • Printtree
        • Base64
        • Charset-p
        • Strtok!
        • Cases
        • Concatenation
        • Html-encoding
        • Character-kinds
          • Letter/digit/uscore/dollar-char-p
          • Letter/digit/uscore/dash-char-p
          • Letter/uscore/dollar-char-p
          • Letter/digit/uscore-char-p
          • Letter/digit/dash-char-p
          • Letter-char-p
            • Letter-charlist-p
            • Letter-chars
          • Letter/digit-char-p
          • Lcletter/digit-char-p
          • Ucletter/digit-char-p
          • Printable-char-p
          • Nondigit-char-p
          • Ucletter-char-p
          • Lcletter-char-p
        • Substrings
        • Strtok
        • Equivalences
        • Url-encoding
        • Lines
        • Explode-implode-equalities
        • Ordering
        • Numbers
        • Pad-trim
        • Coercion
        • Std/strings/digit-to-char
        • Substitution
        • Symbols
      • Std/osets
      • Std/io
      • Std/basic
      • 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
  • Character-kinds

Letter-char-p

Recognize ASCII letters.

The built-in alpha-char-p has a guard requiring characters. In contrast, this recognizer has guard t.

Definitions and Theorems

Function: letter-char-p

(defun letter-char-p (x)
  (declare (xargs :guard t))
  (and (characterp x)
       (b* ((code (char-code x)))
         (or (and (<= (char-code #\A) code)
                  (<= code (char-code #\Z)))
             (and (<= (char-code #\a) code)
                  (<= code (char-code #\z)))))))

Theorem: booleanp-of-letter-char-p

(defthm booleanp-of-letter-char-p
  (booleanp (letter-char-p x))
  :rule-classes :type-prescription)

Theorem: characterp-when-letter-char-p

(defthm characterp-when-letter-char-p
  (implies (letter-char-p x)
           (characterp x))
  :rule-classes :compound-recognizer)

Subtopics

Letter-charlist-p
(letter-charlist-p x) recognizes lists where every element satisfies letter-char-p.
Letter-chars
A character set for letter-char-p.