		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Bitior-ulong-uchar

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

Definitions and Theorems

Function: bitior-ulong-uchar

(defun bitior-ulong-uchar (x y)
  (declare (xargs :guard (and (ulongp x) (ucharp y))))
  (bitior-ulong-ulong x (ulong-from-uchar y)))

Theorem: ulongp-of-bitior-ulong-uchar

(defthm ulongp-of-bitior-ulong-uchar
  (ulongp (bitior-ulong-uchar x y)))

Theorem: bitior-ulong-uchar-of-ulong-fix-x

(defthm bitior-ulong-uchar-of-ulong-fix-x
  (equal (bitior-ulong-uchar (ulong-fix x) y)
         (bitior-ulong-uchar x y)))

Theorem: bitior-ulong-uchar-ulong-equiv-congruence-on-x

(defthm bitior-ulong-uchar-ulong-equiv-congruence-on-x
  (implies (ulong-equiv x x-equiv)
           (equal (bitior-ulong-uchar x y)
                  (bitior-ulong-uchar x-equiv y)))
  :rule-classes :congruence)

Theorem: bitior-ulong-uchar-of-uchar-fix-y

(defthm bitior-ulong-uchar-of-uchar-fix-y
  (equal (bitior-ulong-uchar x (uchar-fix y))
         (bitior-ulong-uchar x y)))

Theorem: bitior-ulong-uchar-uchar-equiv-congruence-on-y

(defthm bitior-ulong-uchar-uchar-equiv-congruence-on-y
  (implies (uchar-equiv y y-equiv)
           (equal (bitior-ulong-uchar x y)
                  (bitior-ulong-uchar x y-equiv)))
  :rule-classes :congruence)