292 \item[\ttindexbold{has_fewer_prems} $n$ $thm$] |
292 \item[\ttindexbold{has_fewer_prems} $n$ $thm$] |
293 reports whether $thm$ has fewer than~$n$ premises. By currying, |
293 reports whether $thm$ has fewer than~$n$ premises. By currying, |
294 \hbox{\tt has_fewer_prems $n$} is a predicate on theorems; it may |
294 \hbox{\tt has_fewer_prems $n$} is a predicate on theorems; it may |
295 be given to the searching tacticals. |
295 be given to the searching tacticals. |
296 |
296 |
297 \item[\ttindexbold{eq_thm} ($thm_1$, $thm_2$)] reports whether $thm_1$ |
297 \item[\ttindexbold{eq_thm} ($thm@1$, $thm@2$)] reports whether $thm@1$ and |
298 and $thm_2$ are equal. Both theorems must have identical |
298 $thm@2$ are equal. Both theorems must have identical signatures. Both |
299 signatures. Both theorems must have the same conclusions, and the |
299 theorems must have the same conclusions, and the same hypotheses, in the |
300 same hypotheses, in the same order. Names of bound variables are |
300 same order. Names of bound variables are ignored. |
301 ignored. |
|
302 |
301 |
303 \item[\ttindexbold{size_of_thm} $thm$] |
302 \item[\ttindexbold{size_of_thm} $thm$] |
304 computes the size of $thm$, namely the number of variables, constants and |
303 computes the size of $thm$, namely the number of variables, constants and |
305 abstractions in its conclusion. It may serve as a distance function for |
304 abstractions in its conclusion. It may serve as a distance function for |
306 \ttindex{BEST_FIRST}. |
305 \ttindex{BEST_FIRST}. |