		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Rem-ushort-sint-okp

Check if the remainder of a value of type unsigned short and a value of type signed int is well-defined.

Definitions and Theorems

Function: rem-ushort-sint-okp

(defun rem-ushort-sint-okp (x y)
  (declare (xargs :guard (and (ushortp x) (sintp y))))
  (rem-sint-sint-okp (sint-from-ushort x)
                     y))

Theorem: booleanp-of-rem-ushort-sint-okp

(defthm booleanp-of-rem-ushort-sint-okp
  (booleanp (rem-ushort-sint-okp x y)))

Theorem: rem-ushort-sint-okp-of-ushort-fix-x

(defthm rem-ushort-sint-okp-of-ushort-fix-x
  (equal (rem-ushort-sint-okp (ushort-fix x) y)
         (rem-ushort-sint-okp x y)))

Theorem: rem-ushort-sint-okp-ushort-equiv-congruence-on-x

(defthm rem-ushort-sint-okp-ushort-equiv-congruence-on-x
  (implies (ushort-equiv x x-equiv)
           (equal (rem-ushort-sint-okp x y)
                  (rem-ushort-sint-okp x-equiv y)))
  :rule-classes :congruence)

Theorem: rem-ushort-sint-okp-of-sint-fix-y

(defthm rem-ushort-sint-okp-of-sint-fix-y
  (equal (rem-ushort-sint-okp x (sint-fix y))
         (rem-ushort-sint-okp x y)))

Theorem: rem-ushort-sint-okp-sint-equiv-congruence-on-y

(defthm rem-ushort-sint-okp-sint-equiv-congruence-on-y
  (implies (sint-equiv y y-equiv)
           (equal (rem-ushort-sint-okp x y)
                  (rem-ushort-sint-okp x y-equiv)))
  :rule-classes :congruence)