		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Bitior-slong-uint

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

Definitions and Theorems

Function: bitior-slong-uint

(defun bitior-slong-uint (x y)
  (declare (xargs :guard (and (slongp x) (uintp y))))
  (bitior-slong-slong x (slong-from-uint y)))

Theorem: slongp-of-bitior-slong-uint

(defthm slongp-of-bitior-slong-uint
  (slongp (bitior-slong-uint x y)))

Theorem: bitior-slong-uint-of-slong-fix-x

(defthm bitior-slong-uint-of-slong-fix-x
  (equal (bitior-slong-uint (slong-fix x) y)
         (bitior-slong-uint x y)))

Theorem: bitior-slong-uint-slong-equiv-congruence-on-x

(defthm bitior-slong-uint-slong-equiv-congruence-on-x
  (implies (slong-equiv x x-equiv)
           (equal (bitior-slong-uint x y)
                  (bitior-slong-uint x-equiv y)))
  :rule-classes :congruence)

Theorem: bitior-slong-uint-of-uint-fix-y

(defthm bitior-slong-uint-of-uint-fix-y
  (equal (bitior-slong-uint x (uint-fix y))
         (bitior-slong-uint x y)))

Theorem: bitior-slong-uint-uint-equiv-congruence-on-y

(defthm bitior-slong-uint-uint-equiv-congruence-on-y
  (implies (uint-equiv y y-equiv)
           (equal (bitior-slong-uint x y)
                  (bitior-slong-uint x y-equiv)))
  :rule-classes :congruence)