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