Lognot+1 (two's complement) of an N-bit unsigned is an N+1 bit signed.
Theorem: basic-signed-byte-p-of-1+lognot
(defthm basic-signed-byte-p-of-1+lognot (implies (unsigned-byte-p n x) (signed-byte-p (+ 1 n) (+ 1 (lognot x)))))