diff -r 2916415680b9 -r bed540afd4b3 doc-src/TutorialI/Rules/find2.thy --- a/doc-src/TutorialI/Rules/find2.thy Fri Jun 24 04:18:48 2005 +0200 +++ b/doc-src/TutorialI/Rules/find2.thy Fri Jun 24 13:22:08 2005 +0200 @@ -4,19 +4,19 @@ (*>*) txt{*\index{finding theorems}\index{searching theorems} In -\S\ref{sec:find} we introduced Proof General's \pgmenu{Find} button +\S\ref{sec:find}, we introduced Proof General's \pgmenu{Find} button for finding theorems in the database via pattern matching. If we are -inside a proof we can be more specific and search for introduction, -elimination and destruction rules \emph{w.r.t.\ the current goal}. -For this purpose \pgmenu{Find} provides 3 aditional search criteria: +inside a proof, we can be more specific; we can search for introduction, +elimination and destruction rules \emph{with respect to the current goal}. +For this purpose, \pgmenu{Find} provides three aditional search criteria: \texttt{intro}, \texttt{elim} and \texttt{dest}. For example, given the goal @{subgoals[display,indent=0,margin=65]} -when you click on \pgmenu{Find} and type in the search expression -\texttt{intro} you are shown a few rules ending in @{text"\ ?P \ ?Q"}, -among them @{thm[source]conjI}. This can be very effective for finding -if the very theorem you are trying to prove is already in the -database: given the goal *} +you can click on \pgmenu{Find} and type in the search expression +\texttt{intro}. You will be shown a few rules ending in @{text"\ ?P \ ?Q"}, +among them @{thm[source]conjI}\@. You may even discover that +the very theorem you are trying to prove is already in the +database. Given the goal *} (*<*) oops lemma "A \ A" @@ -31,7 +31,7 @@ "_ \at\ _" intro \end{ttbox} searches for all introduction rules that match the current goal and -contain the @{text"@"} function. +mention the @{text"@"} function. Searching for elimination and destruction rules via \texttt{elim} and \texttt{dest} is analogous to \texttt{intro} but takes the assumptions