Recognizer for wellformed.
(wellformedp x) → fty::yes/no
Function:
(defun wellformedp (x) (declare (xargs :guard t)) (eq x :wellformed))
Theorem:
(defthm booleanp-of-wellformedp (b* ((fty::yes/no (wellformedp x))) (booleanp fty::yes/no)) :rule-classes :rewrite)