		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Bitior-ushort-schar

Bitwise inclusive disjunction of a value of type unsigned short and a value of type signed char [C:6.5.12].

Definitions and Theorems

Function: bitior-ushort-schar

(defun bitior-ushort-schar (x y)
  (declare (xargs :guard (and (ushortp x) (scharp y))))
  (bitior-sint-sint (sint-from-ushort x)
                    (sint-from-schar y)))

Theorem: sintp-of-bitior-ushort-schar

(defthm sintp-of-bitior-ushort-schar
  (sintp (bitior-ushort-schar x y)))

Theorem: bitior-ushort-schar-of-ushort-fix-x

(defthm bitior-ushort-schar-of-ushort-fix-x
  (equal (bitior-ushort-schar (ushort-fix x) y)
         (bitior-ushort-schar x y)))

Theorem: bitior-ushort-schar-ushort-equiv-congruence-on-x

(defthm bitior-ushort-schar-ushort-equiv-congruence-on-x
  (implies (ushort-equiv x x-equiv)
           (equal (bitior-ushort-schar x y)
                  (bitior-ushort-schar x-equiv y)))
  :rule-classes :congruence)

Theorem: bitior-ushort-schar-of-schar-fix-y

(defthm bitior-ushort-schar-of-schar-fix-y
  (equal (bitior-ushort-schar x (schar-fix y))
         (bitior-ushort-schar x y)))

Theorem: bitior-ushort-schar-schar-equiv-congruence-on-y

(defthm bitior-ushort-schar-schar-equiv-congruence-on-y
  (implies (schar-equiv y y-equiv)
           (equal (bitior-ushort-schar x y)
                  (bitior-ushort-schar x y-equiv)))
  :rule-classes :congruence)