Mod an N-bit unsigned by a natural creates an N-bit unsigned.
Theorem: basic-unsigned-byte-p-of-mod
(defthm basic-unsigned-byte-p-of-mod (implies (and (unsigned-byte-p n a) (natp b)) (unsigned-byte-p n (mod a b))))