		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Shr-uint-okp

Check if the right shift of a value of type unsigned int by an integer is well-defined.

Definitions and Theorems

Function: shr-uint-okp

(defun shr-uint-okp (x y)
  (declare (xargs :guard (and (uintp x) (integerp y))))
  (integer-range-p 0 (int-bits) (ifix y)))

Theorem: booleanp-of-shr-uint-okp

(defthm booleanp-of-shr-uint-okp
  (booleanp (shr-uint-okp x y)))

Theorem: shr-uint-okp-of-uint-fix-x

(defthm shr-uint-okp-of-uint-fix-x
  (equal (shr-uint-okp (uint-fix x) y)
         (shr-uint-okp x y)))

Theorem: shr-uint-okp-uint-equiv-congruence-on-x

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

Theorem: shr-uint-okp-of-ifix-y

(defthm shr-uint-okp-of-ifix-y
  (equal (shr-uint-okp x (ifix y))
         (shr-uint-okp x y)))

Theorem: shr-uint-okp-int-equiv-congruence-on-y

(defthm shr-uint-okp-int-equiv-congruence-on-y
  (implies (acl2::int-equiv y y-equiv)
           (equal (shr-uint-okp x y)
                  (shr-uint-okp x y-equiv)))
  :rule-classes :congruence)