doc-src/IsarRef/pure.tex
changeset 10223 31346d22bb54
parent 10160 bb8f9412fec6
child 10550 93ca45370c59
--- a/doc-src/IsarRef/pure.tex	Sun Oct 15 19:51:19 2000 +0200
+++ b/doc-src/IsarRef/pure.tex	Sun Oct 15 19:51:56 2000 +0200
@@ -170,8 +170,8 @@
   of existing classes $\vec c$.  Cyclic class structures are ruled out.
 \item [$\isarkeyword{classrel}~c@1<c@2$] states a subclass relation between
   existing classes $c@1$ and $c@2$.  This is done axiomatically!  The
-  $\isarkeyword{instance}$ command (see \S\ref{sec:axclass}) provides a way to
-  introduce proven class relations.
+  $\INSTANCE$ command (see \S\ref{sec:axclass}) provides a way to introduce
+  proven class relations.
 \item [$\isarkeyword{defaultsort}~s$] makes sort $s$ the new default sort for
   any type variables given without sort constraints.  Usually, the default
   sort would be only changed when defining new object-logics.
@@ -213,8 +213,8 @@
   Isabelle's inner syntax of terms or types.
 \item [$\isarkeyword{arities}~t::(\vec s)s$] augments Isabelle's order-sorted
   signature of types by new type constructor arities.  This is done
-  axiomatically!  The $\isarkeyword{instance}$ command (see
-  \S\ref{sec:axclass}) provides a way to introduce proven type arities.
+  axiomatically!  The $\INSTANCE$ command (see \S\ref{sec:axclass}) provides a
+  way to introduce proven type arities.
 \end{descr}
 
 
@@ -1083,13 +1083,13 @@
 \end{rail}
 
 \begin{descr}
-\item [$\isarkeyword{apply}~(m)$] applies proof method $m$ in initial
-  position, but unlike $\PROOFNAME$ it retains ``$proof(prove)$'' mode.  Thus
-  consecutive method applications may be given just as in tactic scripts.
+\item [$\APPLY{m}$] applies proof method $m$ in initial position, but unlike
+  $\PROOFNAME$ it retains ``$proof(prove)$'' mode.  Thus consecutive method
+  applications may be given just as in tactic scripts.
   
   Facts are passed to $m$ as indicated by the goal's forward-chain mode, and
-  are \emph{consumed} afterwards.  Thus any further $\isarkeyword{apply}$
-  command would always work in a purely backward manner.
+  are \emph{consumed} afterwards.  Thus any further $\APPLYNAME$ command would
+  always work in a purely backward manner.
   
 \item [$\isarkeyword{apply_end}~(m)$] applies proof method $m$ as if in
   terminal position.  Basically, this simulates a multi-step tactic script for
@@ -1121,9 +1121,8 @@
 \end{descr}
 
 Any proper Isar proof method may be used with tactic script commands such as
-$\isarkeyword{apply}$.  A few additional emulations of actual tactics are
-provided as well; these would be never used in actual structured proofs, of
-course.
+$\APPLYNAME$.  A few additional emulations of actual tactics are provided as
+well; these would be never used in actual structured proofs, of course.
 
 
 \subsection{Meta-linguistic features}