Recognizer for rsh-of-concat-table structures.
(rsh-of-concat-table-p x) → *
Function:
(defun rsh-of-concat-table-p (x) (declare (xargs :guard t)) (let ((__function__ 'rsh-of-concat-table-p)) (declare (ignorable __function__)) (and (mbe :logic (and (alistp x) (equal (strip-cars x) '(alist alist-width tail))) :exec (fty::alist-with-carsp x '(alist alist-width tail))) (b* ((alist (cdr (std::da-nth 0 x))) (alist-width (cdr (std::da-nth 1 x))) (tail (cdr (std::da-nth 2 x)))) (and (rsh-of-concat-alist-p alist) (natp alist-width) (svex-p tail))))))
Theorem:
(defthm consp-when-rsh-of-concat-table-p (implies (rsh-of-concat-table-p x) (consp x)) :rule-classes :compound-recognizer)