Recognizer for let-binding structures.
(let-binding-p x) → *
Function:
(defun let-binding-p (x) (declare (xargs :guard t)) (let ((acl2::__function__ 'let-binding-p)) (declare (ignorable acl2::__function__)) (and (mbe :logic (and (alistp x) (equal (strip-cars x) '(bindings hypotheses))) :exec (fty::alist-with-carsp x '(bindings hypotheses))) (b* ((bindings (cdr (std::da-nth 0 x))) (hypotheses (cdr (std::da-nth 1 x)))) (and (binding-listp bindings) (hint-pair-listp hypotheses))))))
Theorem:
(defthm consp-when-let-binding-p (implies (let-binding-p x) (consp x)) :rule-classes :compound-recognizer)