Recognize admissible separators for paired names.
(paired-name-separator-p x) → yes/no
Any non-empty sequence of characters is allowed.
Function:
(defun paired-name-separator-p (x) (declare (xargs :guard t)) (let ((__function__ 'paired-name-separator-p)) (declare (ignorable __function__)) (and (stringp x) (not (equal x "")))))
Theorem:
(defthm booleanp-of-paired-name-separator-p (b* ((yes/no (paired-name-separator-p x))) (booleanp yes/no)) :rule-classes :rewrite)