Print a binary exponent prefix.
(print-bin-expo-prefix prefix pstate) → new-pstate
Function:
(defun print-bin-expo-prefix (prefix pstate) (declare (xargs :guard (and (bin-expo-prefixp prefix) (pristatep pstate)))) (let ((__function__ 'print-bin-expo-prefix)) (declare (ignorable __function__)) (bin-expo-prefix-case prefix :locase-p (print-astring "p" pstate) :upcase-p (print-astring "P" pstate))))
Theorem:
(defthm pristatep-of-print-bin-expo-prefix (b* ((new-pstate (print-bin-expo-prefix prefix pstate))) (pristatep new-pstate)) :rule-classes :rewrite)
Theorem:
(defthm print-bin-expo-prefix-of-bin-expo-prefix-fix-prefix (equal (print-bin-expo-prefix (bin-expo-prefix-fix prefix) pstate) (print-bin-expo-prefix prefix pstate)))
Theorem:
(defthm print-bin-expo-prefix-bin-expo-prefix-equiv-congruence-on-prefix (implies (bin-expo-prefix-equiv prefix prefix-equiv) (equal (print-bin-expo-prefix prefix pstate) (print-bin-expo-prefix prefix-equiv pstate))) :rule-classes :congruence)
Theorem:
(defthm print-bin-expo-prefix-of-pristate-fix-pstate (equal (print-bin-expo-prefix prefix (pristate-fix pstate)) (print-bin-expo-prefix prefix pstate)))
Theorem:
(defthm print-bin-expo-prefix-pristate-equiv-congruence-on-pstate (implies (pristate-equiv pstate pstate-equiv) (equal (print-bin-expo-prefix prefix pstate) (print-bin-expo-prefix prefix pstate-equiv))) :rule-classes :congruence)