		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Rem-sint-schar

Remainder of a value of type signed int and a value of type signed char [C:6.5.5].

Definitions and Theorems

Function: rem-sint-schar

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

Theorem: sintp-of-rem-sint-schar

(defthm sintp-of-rem-sint-schar
  (sintp (rem-sint-schar x y)))

Theorem: rem-sint-schar-of-sint-fix-x

(defthm rem-sint-schar-of-sint-fix-x
  (equal (rem-sint-schar (sint-fix x) y)
         (rem-sint-schar x y)))

Theorem: rem-sint-schar-sint-equiv-congruence-on-x

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

Theorem: rem-sint-schar-of-schar-fix-y

(defthm rem-sint-schar-of-schar-fix-y
  (equal (rem-sint-schar x (schar-fix y))
         (rem-sint-schar x y)))

Theorem: rem-sint-schar-schar-equiv-congruence-on-y

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