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