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