		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Bitxor-uint-ushort

Bitwise exclusive disjunction of a value of type unsigned int and a value of type unsigned short [C17:6.5.11].

Definitions and Theorems

Function: bitxor-uint-ushort

(defun bitxor-uint-ushort (x y)
  (declare (xargs :guard (and (uintp x) (ushortp y))))
  (bitxor-uint-uint x (uint-from-ushort y)))

Theorem: uintp-of-bitxor-uint-ushort

(defthm uintp-of-bitxor-uint-ushort
  (uintp (bitxor-uint-ushort x y)))

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

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

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

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

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

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

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

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