		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Bitior-sshort-sllong

Bitwise inclusive disjunction of a value of type signed short and a value of type signed long long [C17:6.5.12].

Definitions and Theorems

Function: bitior-sshort-sllong

(defun bitior-sshort-sllong (x y)
  (declare (xargs :guard (and (sshortp x) (sllongp y))))
  (bitior-sllong-sllong (sllong-from-sshort x)
                        y))

Theorem: sllongp-of-bitior-sshort-sllong

(defthm sllongp-of-bitior-sshort-sllong
  (sllongp (bitior-sshort-sllong x y)))

Theorem: bitior-sshort-sllong-of-sshort-fix-x

(defthm bitior-sshort-sllong-of-sshort-fix-x
  (equal (bitior-sshort-sllong (sshort-fix x) y)
         (bitior-sshort-sllong x y)))

Theorem: bitior-sshort-sllong-sshort-equiv-congruence-on-x

(defthm bitior-sshort-sllong-sshort-equiv-congruence-on-x
  (implies (sshort-equiv x x-equiv)
           (equal (bitior-sshort-sllong x y)
                  (bitior-sshort-sllong x-equiv y)))
  :rule-classes :congruence)

Theorem: bitior-sshort-sllong-of-sllong-fix-y

(defthm bitior-sshort-sllong-of-sllong-fix-y
  (equal (bitior-sshort-sllong x (sllong-fix y))
         (bitior-sshort-sllong x y)))

Theorem: bitior-sshort-sllong-sllong-equiv-congruence-on-y

(defthm bitior-sshort-sllong-sllong-equiv-congruence-on-y
  (implies (sllong-equiv y y-equiv)
           (equal (bitior-sshort-sllong x y)
                  (bitior-sshort-sllong x y-equiv)))
  :rule-classes :congruence)