
diff -r 3480725c71d2 -r 0debd22f0c0e src/Doc/Isar_Ref/Quick_Reference.thy
--- a/src/Doc/Isar_Ref/Quick_Reference.thy	Tue Oct 20 23:03:46 2015 +0200
+++ b/src/Doc/Isar_Ref/Quick_Reference.thy	Tue Oct 20 23:53:40 2015 +0200
@@ -10,39 +10,39 @@
 
 text \<open>
   \begin{tabular}{ll}
-    @{command "fix"}~@{text x} & augment context by @{text "\<And>x. \<box>"} \\
-    @{command "assume"}~@{text "a: \<phi>"} & augment context by @{text "\<phi> \<Longrightarrow> \<box>"} \\
+    @{command "fix"}~\<open>x\<close> & augment context by \<open>\<And>x. \<box>\<close> \\
+    @{command "assume"}~\<open>a: \<phi>\<close> & augment context by \<open>\<phi> \<Longrightarrow> \<box>\<close> \\
     @{command "then"} & indicate forward chaining of facts \\
-    @{command "have"}~@{text "a: \<phi>"} & prove local result \\
-    @{command "show"}~@{text "a: \<phi>"} & prove local result, refining some goal \\
-    @{command "using"}~@{text a} & indicate use of additional facts \\
-    @{command "unfolding"}~@{text a} & unfold definitional equations \\
-    @{command "proof"}~@{text "m\<^sub>1"}~\dots~@{command "qed"}~@{text "m\<^sub>2"} & indicate proof structure and refinements \\
-    @{command "{"}~@{text "\<dots>"}~@{command "}"} & indicate explicit blocks \\
+    @{command "have"}~\<open>a: \<phi>\<close> & prove local result \\
+    @{command "show"}~\<open>a: \<phi>\<close> & prove local result, refining some goal \\
+    @{command "using"}~\<open>a\<close> & indicate use of additional facts \\
+    @{command "unfolding"}~\<open>a\<close> & unfold definitional equations \\
+    @{command "proof"}~\<open>m\<^sub>1\<close>~\dots~@{command "qed"}~\<open>m\<^sub>2\<close> & indicate proof structure and refinements \\
+    @{command "{"}~\<open>\<dots>\<close>~@{command "}"} & indicate explicit blocks \\
     @{command "next"} & switch blocks \\
-    @{command "note"}~@{text "a = b"} & reconsider facts \\
-    @{command "let"}~@{text "p = t"} & abbreviate terms by higher-order matching \\
-    @{command "write"}~@{text "c  (mx)"} & declare local mixfix syntax \\
+    @{command "note"}~\<open>a = b\<close> & reconsider facts \\
+    @{command "let"}~\<open>p = t\<close> & abbreviate terms by higher-order matching \\
+    @{command "write"}~\<open>c  (mx)\<close> & declare local mixfix syntax \\
   \end{tabular}
 
   \<^medskip>
 
   \begin{tabular}{rcl}
-    @{text "proof"} & = & @{text "prfx\<^sup>*"}~@{command "proof"}~@{text "method\<^sup>? stmt\<^sup>*"}~@{command "qed"}~@{text "method\<^sup>?"} \\
-    & @{text "|"} & @{text "prfx\<^sup>*"}~@{command "done"} \\
-    @{text prfx} & = & @{command "apply"}~@{text method} \\
-    & @{text "|"} & @{command "using"}~@{text "facts"} \\
-    & @{text "|"} & @{command "unfolding"}~@{text "facts"} \\
-    @{text stmt} & = & @{command "{"}~@{text "stmt\<^sup>*"}~@{command "}"} \\
-    & @{text "|"} & @{command "next"} \\
-    & @{text "|"} & @{command "note"}~@{text "name = facts"} \\
-    & @{text "|"} & @{command "let"}~@{text "term = term"} \\
-    & @{text "|"} & @{command "write"}~@{text "name (mixfix)"} \\
-    & @{text "|"} & @{command "fix"}~@{text "var\<^sup>+"} \\
-    & @{text "|"} & @{command "assume"}~@{text "name: props"} \\
-    & @{text "|"} & @{command "then"}@{text "\<^sup>?"}~@{text goal} \\
-    @{text goal} & = & @{command "have"}~@{text "name: props proof"} \\
-    & @{text "|"} & @{command "show"}~@{text "name: props proof"} \\
+    \<open>proof\<close> & = & \<open>prfx\<^sup>*\<close>~@{command "proof"}~\<open>method\<^sup>? stmt\<^sup>*\<close>~@{command "qed"}~\<open>method\<^sup>?\<close> \\
+    & \<open>|\<close> & \<open>prfx\<^sup>*\<close>~@{command "done"} \\
+    \<open>prfx\<close> & = & @{command "apply"}~\<open>method\<close> \\
+    & \<open>|\<close> & @{command "using"}~\<open>facts\<close> \\
+    & \<open>|\<close> & @{command "unfolding"}~\<open>facts\<close> \\
+    \<open>stmt\<close> & = & @{command "{"}~\<open>stmt\<^sup>*\<close>~@{command "}"} \\
+    & \<open>|\<close> & @{command "next"} \\
+    & \<open>|\<close> & @{command "note"}~\<open>name = facts\<close> \\
+    & \<open>|\<close> & @{command "let"}~\<open>term = term\<close> \\
+    & \<open>|\<close> & @{command "write"}~\<open>name (mixfix)\<close> \\
+    & \<open>|\<close> & @{command "fix"}~\<open>var\<^sup>+\<close> \\
+    & \<open>|\<close> & @{command "assume"}~\<open>name: props\<close> \\
+    & \<open>|\<close> & @{command "then"}\<open>\<^sup>?\<close>~\<open>goal\<close> \\
+    \<open>goal\<close> & = & @{command "have"}~\<open>name: props proof\<close> \\
+    & \<open>|\<close> & @{command "show"}~\<open>name: props proof\<close> \\
   \end{tabular}
 \<close>
 
@@ -51,17 +51,17 @@
 
 text \<open>
   \begin{tabular}{rcl}
-    @{command "by"}~@{text "m\<^sub>1 m\<^sub>2"} & @{text "\<equiv>"} &
-      @{command "proof"}~@{text "m\<^sub>1"}~@{command "qed"}~@{text "m\<^sub>2"} \\
-    @{command ".."} & @{text "\<equiv>"} & @{command "by"}~@{text standard} \\
-    @{command "."} & @{text "\<equiv>"} & @{command "by"}~@{text this} \\
-    @{command "hence"} & @{text "\<equiv>"} & @{command "then"}~@{command "have"} \\
-    @{command "thus"} & @{text "\<equiv>"} & @{command "then"}~@{command "show"} \\
-    @{command "from"}~@{text a} & @{text "\<equiv>"} & @{command "note"}~@{text a}~@{command "then"} \\
-    @{command "with"}~@{text a} & @{text "\<equiv>"} & @{command "from"}~@{text "a \<AND> this"} \\
-    @{command "from"}~@{text this} & @{text "\<equiv>"} & @{command "then"} \\
-    @{command "from"}~@{text this}~@{command "have"} & @{text "\<equiv>"} & @{command "hence"} \\
-    @{command "from"}~@{text this}~@{command "show"} & @{text "\<equiv>"} & @{command "thus"} \\
+    @{command "by"}~\<open>m\<^sub>1 m\<^sub>2\<close> & \<open>\<equiv>\<close> &
+      @{command "proof"}~\<open>m\<^sub>1\<close>~@{command "qed"}~\<open>m\<^sub>2\<close> \\
+    @{command ".."} & \<open>\<equiv>\<close> & @{command "by"}~\<open>standard\<close> \\
+    @{command "."} & \<open>\<equiv>\<close> & @{command "by"}~\<open>this\<close> \\
+    @{command "hence"} & \<open>\<equiv>\<close> & @{command "then"}~@{command "have"} \\
+    @{command "thus"} & \<open>\<equiv>\<close> & @{command "then"}~@{command "show"} \\
+    @{command "from"}~\<open>a\<close> & \<open>\<equiv>\<close> & @{command "note"}~\<open>a\<close>~@{command "then"} \\
+    @{command "with"}~\<open>a\<close> & \<open>\<equiv>\<close> & @{command "from"}~\<open>a \<AND> this\<close> \\
+    @{command "from"}~\<open>this\<close> & \<open>\<equiv>\<close> & @{command "then"} \\
+    @{command "from"}~\<open>this\<close>~@{command "have"} & \<open>\<equiv>\<close> & @{command "hence"} \\
+    @{command "from"}~\<open>this\<close>~@{command "show"} & \<open>\<equiv>\<close> & @{command "thus"} \\
   \end{tabular}
 \<close>
 
@@ -70,26 +70,26 @@
 
 text \<open>
   \begin{tabular}{rcl}
-    @{command "also"}@{text "\<^sub>0"} & @{text "\<approx>"} &
-      @{command "note"}~@{text "calculation = this"} \\
-    @{command "also"}@{text "\<^sub>n\<^sub>+\<^sub>1"} & @{text "\<approx>"} &
-      @{command "note"}~@{text "calculation = trans [OF calculation this]"} \\
-    @{command "finally"} & @{text "\<approx>"} &
-      @{command "also"}~@{command "from"}~@{text calculation} \\[0.5ex]
-    @{command "moreover"} & @{text "\<approx>"} &
-      @{command "note"}~@{text "calculation = calculation this"} \\
-    @{command "ultimately"} & @{text "\<approx>"} &
-      @{command "moreover"}~@{command "from"}~@{text calculation} \\[0.5ex]
-    @{command "presume"}~@{text "a: \<phi>"} & @{text "\<approx>"} &
-      @{command "assume"}~@{text "a: \<phi>"} \\
-    @{command "def"}~@{text "a: x \<equiv> t"} & @{text "\<approx>"} &
-      @{command "fix"}~@{text x}~@{command "assume"}~@{text "a: x \<equiv> t"} \\
-    @{command "obtain"}~@{text "x \<WHERE> a: \<phi>"} & @{text "\<approx>"} &
-      @{text "\<dots>"}~@{command "fix"}~@{text x}~@{command "assume"}~@{text "a: \<phi>"} \\
-    @{command "case"}~@{text c} & @{text "\<approx>"} &
-      @{command "fix"}~@{text x}~@{command "assume"}~@{text "c: \<phi>"} \\
-    @{command "sorry"} & @{text "\<approx>"} &
-      @{command "by"}~@{text cheating} \\
+    @{command "also"}\<open>\<^sub>0\<close> & \<open>\<approx>\<close> &
+      @{command "note"}~\<open>calculation = this\<close> \\
+    @{command "also"}\<open>\<^sub>n\<^sub>+\<^sub>1\<close> & \<open>\<approx>\<close> &
+      @{command "note"}~\<open>calculation = trans [OF calculation this]\<close> \\
+    @{command "finally"} & \<open>\<approx>\<close> &
+      @{command "also"}~@{command "from"}~\<open>calculation\<close> \\[0.5ex]
+    @{command "moreover"} & \<open>\<approx>\<close> &
+      @{command "note"}~\<open>calculation = calculation this\<close> \\
+    @{command "ultimately"} & \<open>\<approx>\<close> &
+      @{command "moreover"}~@{command "from"}~\<open>calculation\<close> \\[0.5ex]
+    @{command "presume"}~\<open>a: \<phi>\<close> & \<open>\<approx>\<close> &
+      @{command "assume"}~\<open>a: \<phi>\<close> \\
+    @{command "def"}~\<open>a: x \<equiv> t\<close> & \<open>\<approx>\<close> &
+      @{command "fix"}~\<open>x\<close>~@{command "assume"}~\<open>a: x \<equiv> t\<close> \\
+    @{command "obtain"}~\<open>x \<WHERE> a: \<phi>\<close> & \<open>\<approx>\<close> &
+      \<open>\<dots>\<close>~@{command "fix"}~\<open>x\<close>~@{command "assume"}~\<open>a: \<phi>\<close> \\
+    @{command "case"}~\<open>c\<close> & \<open>\<approx>\<close> &
+      @{command "fix"}~\<open>x\<close>~@{command "assume"}~\<open>c: \<phi>\<close> \\
+    @{command "sorry"} & \<open>\<approx>\<close> &
+      @{command "by"}~\<open>cheating\<close> \\
   \end{tabular}
 \<close>
 
@@ -100,10 +100,10 @@
   \begin{tabular}{ll}
     @{command "print_state"} & print proof state \\
     @{command "print_statement"} & print fact in long statement form \\
-    @{command "thm"}~@{text a} & print fact \\
-    @{command "prop"}~@{text \<phi>} & print proposition \\
-    @{command "term"}~@{text t} & print term \\
-    @{command "typ"}~@{text \<tau>} & print type \\
+    @{command "thm"}~\<open>a\<close> & print fact \\
+    @{command "prop"}~\<open>\<phi>\<close> & print proposition \\
+    @{command "term"}~\<open>t\<close> & print term \\
+    @{command "typ"}~\<open>\<tau>\<close> & print type \\
   \end{tabular}
 \<close>
 
@@ -115,18 +115,18 @@
     \multicolumn{2}{l}{\<^bold>\<open>Single steps (forward-chaining facts)\<close>} \\[0.5ex]
     @{method assumption} & apply some assumption \\
     @{method this} & apply current facts \\
-    @{method rule}~@{text a} & apply some rule  \\
+    @{method rule}~\<open>a\<close> & apply some rule  \\
     @{method standard} & apply standard rule (default for @{command "proof"}) \\
-    @{method contradiction} & apply @{text "\<not>"} elimination rule (any order) \\
-    @{method cases}~@{text t} & case analysis (provides cases) \\
-    @{method induct}~@{text x} & proof by induction (provides cases) \\[2ex]
+    @{method contradiction} & apply \<open>\<not>\<close> elimination rule (any order) \\
+    @{method cases}~\<open>t\<close> & case analysis (provides cases) \\
+    @{method induct}~\<open>x\<close> & proof by induction (provides cases) \\[2ex]
 
     \multicolumn{2}{l}{\<^bold>\<open>Repeated steps (inserting facts)\<close>} \\[0.5ex]
     @{method "-"} & no rules \\
-    @{method intro}~@{text a} & introduction rules \\
+    @{method intro}~\<open>a\<close> & introduction rules \\
     @{method intro_classes} & class introduction rules \\
-    @{method elim}~@{text a} & elimination rules \\
-    @{method unfold}~@{text a} & definitional rewrite rules \\[2ex]
+    @{method elim}~\<open>a\<close> & elimination rules \\
+    @{method unfold}~\<open>a\<close> & definitional rewrite rules \\[2ex]
 
     \multicolumn{2}{l}{\<^bold>\<open>Automated proof tools (inserting facts)\<close>} \\[0.5ex]
     @{method iprover} & intuitionistic proof search \\
@@ -143,11 +143,11 @@
 text \<open>
   \begin{tabular}{ll}
     \multicolumn{2}{l}{\<^bold>\<open>Rules\<close>} \\[0.5ex]
-    @{attribute OF}~@{text a} & rule resolved with facts (skipping ``@{text _}'') \\
-    @{attribute of}~@{text t} & rule instantiated with terms (skipping ``@{text _}'') \\
-    @{attribute "where"}~@{text "x = t"} & rule instantiated with terms, by variable name \\
+    @{attribute OF}~\<open>a\<close> & rule resolved with facts (skipping ``\<open>_\<close>'') \\
+    @{attribute of}~\<open>t\<close> & rule instantiated with terms (skipping ``\<open>_\<close>'') \\
+    @{attribute "where"}~\<open>x = t\<close> & rule instantiated with terms, by variable name \\
     @{attribute symmetric} & resolution with symmetry rule \\
-    @{attribute THEN}~@{text b} & resolution with another rule \\
+    @{attribute THEN}~\<open>b\<close> & resolution with another rule \\
     @{attribute rule_format} & result put into standard rule format \\
     @{attribute elim_format} & destruct rule turned into elimination rule format \\[1ex]
 
@@ -169,26 +169,26 @@
       & @{method rule} & @{method iprover} & @{method blast} & @{method simp} & @{method auto} \\
       &                &                   & @{method fast} & @{method simp_all} & @{method force} \\
     \hline
-    @{attribute Pure.elim}@{text "!"} @{attribute Pure.intro}@{text "!"}
-      & @{text "\<times>"}    & @{text "\<times>"} \\
+    @{attribute Pure.elim}\<open>!\<close> @{attribute Pure.intro}\<open>!\<close>
+      & \<open>\<times>\<close>    & \<open>\<times>\<close> \\
     @{attribute Pure.elim} @{attribute Pure.intro}
-      & @{text "\<times>"}    & @{text "\<times>"} \\
-    @{attribute elim}@{text "!"} @{attribute intro}@{text "!"}
-      & @{text "\<times>"}    &                    & @{text "\<times>"}          &                     & @{text "\<times>"} \\
+      & \<open>\<times>\<close>    & \<open>\<times>\<close> \\
+    @{attribute elim}\<open>!\<close> @{attribute intro}\<open>!\<close>
+      & \<open>\<times>\<close>    &                    & \<open>\<times>\<close>          &                     & \<open>\<times>\<close> \\
     @{attribute elim} @{attribute intro}
-      & @{text "\<times>"}    &                    & @{text "\<times>"}          &                     & @{text "\<times>"} \\
+      & \<open>\<times>\<close>    &                    & \<open>\<times>\<close>          &                     & \<open>\<times>\<close> \\
     @{attribute iff}
-      & @{text "\<times>"}    &                    & @{text "\<times>"}          & @{text "\<times>"}         & @{text "\<times>"} \\
-    @{attribute iff}@{text "?"}
-      & @{text "\<times>"} \\
-    @{attribute elim}@{text "?"} @{attribute intro}@{text "?"}
-      & @{text "\<times>"} \\
+      & \<open>\<times>\<close>    &                    & \<open>\<times>\<close>          & \<open>\<times>\<close>         & \<open>\<times>\<close> \\
+    @{attribute iff}\<open>?\<close>
+      & \<open>\<times>\<close> \\
+    @{attribute elim}\<open>?\<close> @{attribute intro}\<open>?\<close>
+      & \<open>\<times>\<close> \\
     @{attribute simp}
-      &                &                    &                      & @{text "\<times>"}         & @{text "\<times>"} \\
+      &                &                    &                      & \<open>\<times>\<close>         & \<open>\<times>\<close> \\
     @{attribute cong}
-      &                &                    &                      & @{text "\<times>"}         & @{text "\<times>"} \\
+      &                &                    &                      & \<open>\<times>\<close>         & \<open>\<times>\<close> \\
     @{attribute split}
-      &                &                    &                      & @{text "\<times>"}         & @{text "\<times>"} \\
+      &                &                    &                      & \<open>\<times>\<close>         & \<open>\<times>\<close> \\
   \end{tabular}
 \<close>
 
@@ -199,11 +199,11 @@
 
 text \<open>
   \begin{tabular}{ll}
-    @{command "apply"}~@{text m} & apply proof method at initial position \\
-    @{command "apply_end"}~@{text m} & apply proof method near terminal position \\
+    @{command "apply"}~\<open>m\<close> & apply proof method at initial position \\
+    @{command "apply_end"}~\<open>m\<close> & apply proof method near terminal position \\
     @{command "done"} & complete proof \\
-    @{command "defer"}~@{text n} & move subgoal to end \\
-    @{command "prefer"}~@{text n} & move subgoal to beginning \\
+    @{command "defer"}~\<open>n\<close> & move subgoal to end \\
+    @{command "prefer"}~\<open>n\<close> & move subgoal to beginning \\
     @{command "back"} & backtrack last command \\
   \end{tabular}
 \<close>
@@ -213,19 +213,19 @@
 
 text \<open>
   \begin{tabular}{ll}
-    @{method rule_tac}~@{text insts} & resolution (with instantiation) \\
-    @{method erule_tac}~@{text insts} & elim-resolution (with instantiation) \\
-    @{method drule_tac}~@{text insts} & destruct-resolution (with instantiation) \\
-    @{method frule_tac}~@{text insts} & forward-resolution (with instantiation) \\
-    @{method cut_tac}~@{text insts} & insert facts (with instantiation) \\
-    @{method thin_tac}~@{text \<phi>} & delete assumptions \\
-    @{method subgoal_tac}~@{text \<phi>} & new claims \\
-    @{method rename_tac}~@{text x} & rename innermost goal parameters \\
-    @{method rotate_tac}~@{text n} & rotate assumptions of goal \\
-    @{method tactic}~@{text "text"} & arbitrary ML tactic \\
-    @{method case_tac}~@{text t} & exhaustion (datatypes) \\
-    @{method induct_tac}~@{text x} & induction (datatypes) \\
-    @{method ind_cases}~@{text t} & exhaustion + simplification (inductive predicates) \\
+    @{method rule_tac}~\<open>insts\<close> & resolution (with instantiation) \\
+    @{method erule_tac}~\<open>insts\<close> & elim-resolution (with instantiation) \\
+    @{method drule_tac}~\<open>insts\<close> & destruct-resolution (with instantiation) \\
+    @{method frule_tac}~\<open>insts\<close> & forward-resolution (with instantiation) \\
+    @{method cut_tac}~\<open>insts\<close> & insert facts (with instantiation) \\
+    @{method thin_tac}~\<open>\<phi>\<close> & delete assumptions \\
+    @{method subgoal_tac}~\<open>\<phi>\<close> & new claims \\
+    @{method rename_tac}~\<open>x\<close> & rename innermost goal parameters \\
+    @{method rotate_tac}~\<open>n\<close> & rotate assumptions of goal \\
+    @{method tactic}~\<open>text\<close> & arbitrary ML tactic \\
+    @{method case_tac}~\<open>t\<close> & exhaustion (datatypes) \\
+    @{method induct_tac}~\<open>x\<close> & induction (datatypes) \\
+    @{method ind_cases}~\<open>t\<close> & exhaustion + simplification (inductive predicates) \\
   \end{tabular}
 \<close>
 




