Theorem saying that the value recognizers imply valuep.
Theorem:
(defthm valuep-when-ucharp (implies (ucharp x) (valuep x)))
Theorem:
(defthm valuep-when-scharp (implies (scharp x) (valuep x)))
Theorem:
(defthm valuep-when-ushortp (implies (ushortp x) (valuep x)))
Theorem:
(defthm valuep-when-sshortp (implies (sshortp x) (valuep x)))
Theorem:
(defthm valuep-when-uintp (implies (uintp x) (valuep x)))
Theorem:
(defthm valuep-when-sintp (implies (sintp x) (valuep x)))
Theorem:
(defthm valuep-when-ulongp (implies (ulongp x) (valuep x)))
Theorem:
(defthm valuep-when-slongp (implies (slongp x) (valuep x)))
Theorem:
(defthm valuep-when-ullongp (implies (ullongp x) (valuep x)))
Theorem:
(defthm valuep-when-sllongp (implies (sllongp x) (valuep x)))
Theorem:
(defthm valuep-when-cintegerp (implies (cintegerp x) (valuep x)))