memoized version of SUBLIS which uses fast-alists.
Function:
(defun hons-sublis (fal x) (declare (xargs :guard t)) (let ((ret (hons-sublis-aux fal x))) (prog2$ (clear-memoize-table 'hons-sublis-aux) ret)))
Theorem:
(defthm hons-sublis-removal (implies (alistp fal) (equal (hons-sublis fal x) (sublis fal x))))