		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Bitxor-ushort-uchar

Bitwise exclusive disjunction of a value of type unsigned short and a value of type unsigned char [C:6.5.11].

Definitions and Theorems

Function: bitxor-ushort-uchar

(defun bitxor-ushort-uchar (x y)
  (declare (xargs :guard (and (ushortp x) (ucharp y))))
  (bitxor-sint-sint (sint-from-ushort x)
                    (sint-from-uchar y)))

Theorem: sintp-of-bitxor-ushort-uchar

(defthm sintp-of-bitxor-ushort-uchar
  (sintp (bitxor-ushort-uchar x y)))

Theorem: bitxor-ushort-uchar-of-ushort-fix-x

(defthm bitxor-ushort-uchar-of-ushort-fix-x
  (equal (bitxor-ushort-uchar (ushort-fix x) y)
         (bitxor-ushort-uchar x y)))

Theorem: bitxor-ushort-uchar-ushort-equiv-congruence-on-x

(defthm bitxor-ushort-uchar-ushort-equiv-congruence-on-x
  (implies (ushort-equiv x x-equiv)
           (equal (bitxor-ushort-uchar x y)
                  (bitxor-ushort-uchar x-equiv y)))
  :rule-classes :congruence)

Theorem: bitxor-ushort-uchar-of-uchar-fix-y

(defthm bitxor-ushort-uchar-of-uchar-fix-y
  (equal (bitxor-ushort-uchar x (uchar-fix y))
         (bitxor-ushort-uchar x y)))

Theorem: bitxor-ushort-uchar-uchar-equiv-congruence-on-y

(defthm bitxor-ushort-uchar-uchar-equiv-congruence-on-y
  (implies (uchar-equiv y y-equiv)
           (equal (bitxor-ushort-uchar x y)
                  (bitxor-ushort-uchar x y-equiv)))
  :rule-classes :congruence)