Print an unsigned suffix.
Function:
(defun print-usuffix (usuffix pstate) (declare (xargs :guard (and (usuffixp usuffix) (pristatep pstate)))) (let ((__function__ 'print-usuffix)) (declare (ignorable __function__)) (usuffix-case usuffix :locase-u (print-astring "u" pstate) :upcase-u (print-astring "U" pstate))))
Theorem:
(defthm pristatep-of-print-usuffix (b* ((new-pstate (print-usuffix usuffix pstate))) (pristatep new-pstate)) :rule-classes :rewrite)
Theorem:
(defthm print-usuffix-of-usuffix-fix-usuffix (equal (print-usuffix (usuffix-fix usuffix) pstate) (print-usuffix usuffix pstate)))
Theorem:
(defthm print-usuffix-usuffix-equiv-congruence-on-usuffix (implies (usuffix-equiv usuffix usuffix-equiv) (equal (print-usuffix usuffix pstate) (print-usuffix usuffix-equiv pstate))) :rule-classes :congruence)
Theorem:
(defthm print-usuffix-of-pristate-fix-pstate (equal (print-usuffix usuffix (pristate-fix pstate)) (print-usuffix usuffix pstate)))
Theorem:
(defthm print-usuffix-pristate-equiv-congruence-on-pstate (implies (pristate-equiv pstate pstate-equiv) (equal (print-usuffix usuffix pstate) (print-usuffix usuffix pstate-equiv))) :rule-classes :congruence)