		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Bitxor-ullong-ushort

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

Definitions and Theorems

Function: bitxor-ullong-ushort

(defun bitxor-ullong-ushort (x y)
  (declare (xargs :guard (and (ullongp x) (ushortp y))))
  (bitxor-ullong-ullong x (ullong-from-ushort y)))

Theorem: ullongp-of-bitxor-ullong-ushort

(defthm ullongp-of-bitxor-ullong-ushort
  (ullongp (bitxor-ullong-ushort x y)))

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

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

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

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

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

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

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

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