
diff -r c8a2755bf220 -r ff784d5a5bfb src/Doc/Tutorial/Inductive/Mutual.thy
--- a/src/Doc/Tutorial/Inductive/Mutual.thy	Sat Jan 05 17:00:43 2019 +0100
+++ b/src/Doc/Tutorial/Inductive/Mutual.thy	Sat Jan 05 17:24:33 2019 +0100
@@ -58,7 +58,7 @@
 subsection\<open>Inductively Defined Predicates\label{sec:ind-predicates}\<close>
 
 text\<open>\index{inductive predicates|(}
-Instead of a set of even numbers one can also define a predicate on @{typ nat}:
+Instead of a set of even numbers one can also define a predicate on \<^typ>\<open>nat\<close>:
 \<close>
 
 inductive evn :: "nat \<Rightarrow> bool" where
@@ -67,13 +67,13 @@
 
 text\<open>\noindent Everything works as before, except that
 you write \commdx{inductive} instead of \isacommand{inductive\_set} and
-@{prop"evn n"} instead of @{prop"n \<in> Even"}.
+\<^prop>\<open>evn n\<close> instead of \<^prop>\<open>n \<in> Even\<close>.
 When defining an n-ary relation as a predicate, it is recommended to curry
 the predicate: its type should be \mbox{\<open>\<tau>\<^sub>1 \<Rightarrow> \<dots> \<Rightarrow> \<tau>\<^sub>n \<Rightarrow> bool\<close>}
 rather than
 \<open>\<tau>\<^sub>1 \<times> \<dots> \<times> \<tau>\<^sub>n \<Rightarrow> bool\<close>. The curried version facilitates inductions.
 
-When should you choose sets and when predicates? If you intend to combine your notion with set theoretic notation, define it as an inductive set. If not, define it as an inductive predicate, thus avoiding the \<open>\<in>\<close> notation. But note that predicates of more than one argument cannot be combined with the usual set theoretic operators: @{term"P \<union> Q"} is not well-typed if \<open>P, Q :: \<tau>\<^sub>1 \<Rightarrow> \<tau>\<^sub>2 \<Rightarrow> bool\<close>, you have to write @{term"%x y. P x y & Q x y"} instead.
+When should you choose sets and when predicates? If you intend to combine your notion with set theoretic notation, define it as an inductive set. If not, define it as an inductive predicate, thus avoiding the \<open>\<in>\<close> notation. But note that predicates of more than one argument cannot be combined with the usual set theoretic operators: \<^term>\<open>P \<union> Q\<close> is not well-typed if \<open>P, Q :: \<tau>\<^sub>1 \<Rightarrow> \<tau>\<^sub>2 \<Rightarrow> bool\<close>, you have to write \<^term>\<open>%x y. P x y & Q x y\<close> instead.
 \index{inductive predicates|)}
 \<close>
 




