		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Shl-sshort-uint-okp

Check if the left shift of a value of type signed short by a value of type unsigned int is well-defined.

Definitions and Theorems

Function: shl-sshort-uint-okp

(defun shl-sshort-uint-okp (x y)
  (declare (xargs :guard (and (sshortp x) (uintp y))))
  (shl-sshort-okp x (integer-from-uint y)))

Theorem: booleanp-of-shl-sshort-uint-okp

(defthm booleanp-of-shl-sshort-uint-okp
  (booleanp (shl-sshort-uint-okp x y)))

Theorem: shl-sshort-uint-okp-of-sshort-fix-x

(defthm shl-sshort-uint-okp-of-sshort-fix-x
  (equal (shl-sshort-uint-okp (sshort-fix x) y)
         (shl-sshort-uint-okp x y)))

Theorem: shl-sshort-uint-okp-sshort-equiv-congruence-on-x

(defthm shl-sshort-uint-okp-sshort-equiv-congruence-on-x
  (implies (sshort-equiv x x-equiv)
           (equal (shl-sshort-uint-okp x y)
                  (shl-sshort-uint-okp x-equiv y)))
  :rule-classes :congruence)

Theorem: shl-sshort-uint-okp-of-uint-fix-y

(defthm shl-sshort-uint-okp-of-uint-fix-y
  (equal (shl-sshort-uint-okp x (uint-fix y))
         (shl-sshort-uint-okp x y)))

Theorem: shl-sshort-uint-okp-uint-equiv-congruence-on-y

(defthm shl-sshort-uint-okp-uint-equiv-congruence-on-y
  (implies (uint-equiv y y-equiv)
           (equal (shl-sshort-uint-okp x y)
                  (shl-sshort-uint-okp x y-equiv)))
  :rule-classes :congruence)