doc-src/Ref/simplifier.tex
changeset 12725 7ede865e1fe5
parent 12717 2d6b5e22e05d
child 13474 f326c5d97d76
--- a/doc-src/Ref/simplifier.tex	Fri Jan 11 18:49:25 2002 +0100
+++ b/doc-src/Ref/simplifier.tex	Sat Jan 12 16:37:58 2002 +0100
@@ -1335,7 +1335,7 @@
 automatically.  Preprocessing involves extracting atomic rewrites at the
 object-level, then reflecting them to the meta-level.
 
-To start, the function \texttt{forall_elim_vars_safe} strips any meta-level
+To start, the function \texttt{gen_all} strips any meta-level
 quantifiers from the front of the given theorem.
 
 The function \texttt{atomize} analyses a theorem in order to extract
@@ -1398,7 +1398,7 @@
   | _                           => th RS iff_reflection_T;
 \end{ttbox}
 The 
-three functions \texttt{forall_elim_vars_safe}, \texttt{atomize} and \texttt{mk_eq} 
+three functions \texttt{gen_all}, \texttt{atomize} and \texttt{mk_eq} 
 will be composed together and supplied below to \texttt{setmksimps}.
 
 
@@ -1427,7 +1427,7 @@
 %
 The basic simpset for intuitionistic FOL is \ttindexbold{FOL_basic_ss}.  It
 preprocess rewrites using 
-{\tt forall_elim_vars_safe}, \texttt{atomize} and \texttt{mk_eq}.
+{\tt gen_all}, \texttt{atomize} and \texttt{mk_eq}.
 It solves simplified subgoals using \texttt{triv_rls} and assumptions, and by
 detecting contradictions.  It uses \ttindex{asm_simp_tac} to tackle subgoals
 of conditional rewrites.
@@ -1451,7 +1451,7 @@
                addsimprocs [defALL_regroup, defEX_regroup]
                setSSolver   safe_solver
                setSolver  unsafe_solver
-               setmksimps (map mk_eq o atomize o forall_elim_vars_safe)
+               setmksimps (map mk_eq o atomize o gen_all)
                setmkcong mk_meta_cong;
 
 val IFOL_ss =