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