doc-src/Ref/defining.tex
changeset 5205 602354039306
parent 4597 a0bdee64194c
child 5371 e27558a68b8d
--- a/doc-src/Ref/defining.tex	Tue Jul 28 16:30:56 1998 +0200
+++ b/doc-src/Ref/defining.tex	Tue Jul 28 16:33:43 1998 +0200
@@ -799,7 +799,7 @@
 After loading this definition from the file {\tt Hilbert.thy}, you can
 start to prove theorems in the logic:
 \begin{ttbox}
-goal Hilbert.thy "P --> P";
+Goal "P --> P";
 {\out Level 0}
 {\out P --> P}
 {\out  1.  P --> P}
@@ -880,7 +880,7 @@
 \end{ttbox}
 Now we can prove mixed theorems like
 \begin{ttbox}
-goal MinIFC.thy "P & False --> Q";
+Goal "P & False --> Q";
 by (resolve_tac [MinI.impI] 1);
 by (dresolve_tac [MinC.conjE2] 1);
 by (eresolve_tac [MinIF.FalseE] 1);