Check if a list of expressions is statically well-formed.
(check-expression-list exprs ctxt) → result
We require each expression to be single-valued. So the list of types in the type result consists of the types of the expressions, in order.
Theorem:
(defthm len-of-result-types (b* ((?result (check-expression-list exprs ctxt))) (implies (type-result-case result :ok) (equal (len (type-result-ok->types result)) (len exprs)))))