theorem database now also indexes constants "Trueprop", "all",
"==>", "=="; thus thms_containing, findI etc. may retrieve more rules;

--- a/NEWS	Fri Oct 08 16:05:06 1999 +0200
+++ b/NEWS	Fri Oct 08 16:16:51 1999 +0200
@@ -119,6 +119,9 @@
 result is not stored, but proper checks and presentation of the result
 still apply;
 
+* theorem database now also indexes constants "Trueprop", "all",
+"==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
+
 
 *** HOL ***
 

--- a/doc-src/Ref/goals.tex	Fri Oct 08 16:05:06 1999 +0200
+++ b/doc-src/Ref/goals.tex	Fri Oct 08 16:16:51 1999 +0200
@@ -287,9 +287,8 @@
   premise of subgoal $i$.  Useful in connection with \texttt{eresolve_tac} and
   \texttt{dresolve_tac}.
   
-\item[\ttindexbold{thms_containing} $consts$] returns all theorems
-  that contain all of a given set of constants.  Note that a few basic
-  constants like \verb$==>$ are ignored.
+\item[\ttindexbold{thms_containing} $consts$] returns all theorems that
+  contain \emph{all} of the given constants.
 \end{ttdescription}
 
 

--- a/src/Pure/pure_thy.ML	Fri Oct 08 16:05:06 1999 +0200
+++ b/src/Pure/pure_thy.ML	Fri Oct 08 16:16:51 1999 +0200
@@ -141,13 +141,11 @@
 
 (* make index *)
 
-val ignore = ["Trueprop", "all", "==>", "=="];
-
 fun add_const_idx ((next, table), thm) =
   let
     val {hyps, prop, ...} = Thm.rep_thm thm;
     val consts =
-      foldr add_term_consts (hyps, add_term_consts (prop, [])) \\ ignore;
+      foldr add_term_consts (hyps, add_term_consts (prop, []));
 
     fun add (tab, c) =
       Symtab.update ((c, (next, thm) :: Symtab.lookup_multi (tab, c)), tab);
@@ -180,7 +178,7 @@
 (*search globally*)
 fun thms_containing thy consts =
   (case filter (is_none o Sign.const_type (Theory.sign_of thy)) consts of
-    [] => flat (map (containing (consts \\ ignore)) (thy :: Theory.ancestors_of thy))
+    [] => flat (map (containing consts) (thy :: Theory.ancestors_of thy))
   | cs => raise THEORY ("thms_containing: undeclared consts " ^ commas_quote cs, [thy]));