• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
      • Theories
      • Rule-classes
      • Proof-builder
      • Recursion-and-induction
      • Hons-and-memoization
      • Events
      • Parallelism
      • History
      • Programming
        • Defun
        • Declare
        • System-utilities
        • Stobj
        • State
        • Mutual-recursion
        • Memoize
        • Mbe
        • Io
        • Defpkg
        • Apply$
        • Loop$
        • Programming-with-state
        • Arrays
        • Characters
        • Time$
        • Defmacro
        • Loop$-primer
        • Fast-alists
        • Defconst
        • Evaluation
        • Guard
        • Equality-variants
        • Compilation
        • Hons
        • ACL2-built-ins
        • Developers-guide
        • System-attachments
        • Advanced-features
        • Set-check-invariant-risk
        • Numbers
        • Efficiency
        • Irrelevant-formals
        • Introduction-to-programming-in-ACL2-for-those-who-know-lisp
        • Redefining-programs
        • Lists
        • Invariant-risk
        • Errors
        • Defabbrev
        • Conses
        • Alists
        • Set-register-invariant-risk
        • Strings
          • Std/strings
            • Pretty-printing
            • Printtree
            • Base64
            • Charset-p
            • Strtok!
            • Cases
            • Concatenation
            • Html-encoding
            • Character-kinds
            • Substrings
            • Strtok
            • Equivalences
              • Charlisteqv
              • Icharlisteqv
              • Istreqv
              • Ichareqv
              • Streqv
              • Chareqv
                • Char-fix
                • Str-fix
              • Url-encoding
              • Lines
              • Explode-implode-equalities
              • Ordering
              • Numbers
              • Pad-trim
              • Coercion
              • Std/strings/digit-to-char
              • Substitution
              • Symbols
            • String-listp
            • Stringp
            • Length
            • Search
            • Remove-duplicates
            • Position
            • Coerce
            • Concatenate
            • Reverse
            • String
            • Subseq
            • Substitute
            • String-upcase
            • String-downcase
            • Count
            • Char
            • String<
            • String-equal
            • String-utilities
            • String-append
            • String>=
            • String<=
            • String>
            • Hex-digit-char-theorems
            • String-downcase-gen
            • String-upcase-gen
          • Program-wrapper
          • Get-internal-time
          • Basics
          • Packages
          • Oracle-eval
          • Defmacro-untouchable
          • <<
          • Primitive
          • Revert-world
          • Unmemoize
          • Set-duplicate-keys-action
          • Symbols
          • Def-list-constructor
          • Easy-simplify-term
          • Defiteration
          • Fake-oracle-eval
          • Defopen
          • Sleep
        • Operational-semantics
        • Real
        • Start-here
        • Debugging
        • Miscellaneous
        • Output-controls
        • Macros
        • Interfacing-tools
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Std/basic
    • Equivalences

    Chareqv

    Case-sensitive character equivalence test.

    (chareqv x y) determines if x and y are equivalent when interpreted as characters. That is, non-characters are first coerced to be the NUL character (via char-fix), then we see if these coerced arguments are equal.

    See also str::ichareqv for a case-insensitive alternative.

    Definitions and Theorems

    Function: chareqv$inline

    (defun chareqv$inline (x y)
      (declare (xargs :guard t))
      (eql (char-fix x) (char-fix y)))

    Theorem: chareqv-is-an-equivalence

    (defthm chareqv-is-an-equivalence
      (and (booleanp (chareqv x y))
           (chareqv x x)
           (implies (chareqv x y) (chareqv y x))
           (implies (and (chareqv x y) (chareqv y z))
                    (chareqv x z)))
      :rule-classes (:equivalence))

    Theorem: chareqv-of-char-fix

    (defthm chareqv-of-char-fix
      (chareqv (char-fix x) x))

    Theorem: chareqv-implies-equal-char-fix-1

    (defthm chareqv-implies-equal-char-fix-1
      (implies (chareqv x x-equiv)
               (equal (char-fix x) (char-fix x-equiv)))
      :rule-classes (:congruence))

    Theorem: chareqv-implies-equal-char-code-1

    (defthm chareqv-implies-equal-char-code-1
      (implies (chareqv x x-equiv)
               (equal (char-code x)
                      (char-code x-equiv)))
      :rule-classes (:congruence))

    Theorem: chareqv-implies-equal-char<-1

    (defthm chareqv-implies-equal-char<-1
      (implies (chareqv x x-equiv)
               (equal (char< x y) (char< x-equiv y)))
      :rule-classes (:congruence))

    Theorem: chareqv-implies-equal-char<-2

    (defthm chareqv-implies-equal-char<-2
      (implies (chareqv y y-equiv)
               (equal (char< x y) (char< x y-equiv)))
      :rule-classes (:congruence))