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