|
|
|---|
|
|
|
|---|
Bitwise inclusive disjunction of a value of type
Function:
(defun bitior-uchar-sint (x y) (declare (xargs :guard (and (ucharp x) (sintp y)))) (bitior-sint-sint (sint-from-uchar x) y))
Theorem:
(defthm sintp-of-bitior-uchar-sint (sintp (bitior-uchar-sint x y)))
Theorem:
(defthm bitior-uchar-sint-of-uchar-fix-x (equal (bitior-uchar-sint (uchar-fix x) y) (bitior-uchar-sint x y)))
Theorem:
(defthm bitior-uchar-sint-uchar-equiv-congruence-on-x (implies (uchar-equiv x x-equiv) (equal (bitior-uchar-sint x y) (bitior-uchar-sint x-equiv y))) :rule-classes :congruence)
Theorem:
(defthm bitior-uchar-sint-of-sint-fix-y (equal (bitior-uchar-sint x (sint-fix y)) (bitior-uchar-sint x y)))
Theorem:
(defthm bitior-uchar-sint-sint-equiv-congruence-on-y (implies (sint-equiv y y-equiv) (equal (bitior-uchar-sint x y) (bitior-uchar-sint x y-equiv))) :rule-classes :congruence)