\DOC list_mk_rerq_forall

\TYPE {list_mk_resq_forall : ((term # term) list # term) -> term)}

\SYNOPSIS
Iteratively constructs a restricted universal quantification.

\DESCRIBE
{
   list_mk_resq_forall([("x1","P1");...;("xn","Pn")],"t")
}
\noindent returns {"!x1::P1. ... !xn::Pn. t"}.

\FAILURE
Fails with {list_mk_resq_forall} if the first terms {xi} in the pairs are
not a variable or if the second terms {Pi} in the pairs and {t} 
are not of type {":bool"} if the list is non-empty. If the list is
empty the type of {t} can be anything.

\SEEALSO
strip_resq_forall, mk_resq_forall.

\ENDDOC
