		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Rem-uchar-ushort-okp

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

Definitions and Theorems

Function: rem-uchar-ushort-okp

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

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

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

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

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

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

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

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

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

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

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