Try to prove a list of named formulas, one after the other.
(prove-named-formulas named-formulas named-hints verbose state) → (mv success msg state)
Besides returning an indication of success or failure,
return a structured message (printable with
If the
Function:
(defun prove-named-formulas (named-formulas named-hints verbose state) (declare (xargs :stobjs (state))) (declare (xargs :guard (and (symbol-alistp named-formulas) (symbol-truelist-alistp named-hints) (booleanp verbose)))) (let ((__function__ 'prove-named-formulas)) (declare (ignorable __function__)) (cond ((endp named-formulas) (mv t "" state)) (t (b* ((named-formula (car named-formulas)) (name (car named-formula)) (formula (cdr named-formula)) (hints (cdr (assoc-eq name named-hints))) ((mv success msg state) (prove-named-formula name formula hints verbose state))) (if success (prove-named-formulas (cdr named-formulas) named-hints verbose state) (mv nil msg state)))))))