Recognizer for function-recursion structures.
(function-recursionp x) → *
Function:
(defun function-recursionp (x) (declare (xargs :guard t)) (let ((__function__ 'function-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)))) (function-definition-listp definitions)))))
Theorem:
(defthm consp-when-function-recursionp (implies (function-recursionp x) (consp x)) :rule-classes :compound-recognizer)