Bitwise inclusive disjunction of a value of type
Function:
(defun bitior-ushort-uint (x y) (declare (xargs :guard (and (ushortp x) (uintp y)))) (bitior-uint-uint (uint-from-ushort x) y))
Theorem:
(defthm uintp-of-bitior-ushort-uint (uintp (bitior-ushort-uint x y)))
Theorem:
(defthm bitior-ushort-uint-of-ushort-fix-x (equal (bitior-ushort-uint (ushort-fix x) y) (bitior-ushort-uint x y)))
Theorem:
(defthm bitior-ushort-uint-ushort-equiv-congruence-on-x (implies (ushort-equiv x x-equiv) (equal (bitior-ushort-uint x y) (bitior-ushort-uint x-equiv y))) :rule-classes :congruence)
Theorem:
(defthm bitior-ushort-uint-of-uint-fix-y (equal (bitior-ushort-uint x (uint-fix y)) (bitior-ushort-uint x y)))
Theorem:
(defthm bitior-ushort-uint-uint-equiv-congruence-on-y (implies (uint-equiv y y-equiv) (equal (bitior-ushort-uint x y) (bitior-ushort-uint x y-equiv))) :rule-classes :congruence)