Recognizer for type-recursion structures.
(type-recursionp x) → *
Function:
(defun type-recursionp (x) (declare (xargs :guard t)) (let ((__function__ 'type-recursionp)) (declare (ignorable __function__)) (and (mbe :logic (and (alistp x) (equal (strip-cars x) '(definitions))) :exec (fty::alist-with-carsp x '(definitions))) (b* ((definitions (cdr (std::da-nth 0 x)))) (type-definition-listp definitions)))))
Theorem:
(defthm consp-when-type-recursionp (implies (type-recursionp x) (consp x)) :rule-classes :compound-recognizer)