1) all theorems in Orderings can now be given as a parameter
2) new function Theory.defs_of
3) new functions Defs.overloading_info and Defs.is_overloaded
(*<*)
theory Plus imports Main begin
(*>*)
text{*\noindent Define the following addition function *}
consts plus :: "nat \<Rightarrow> nat \<Rightarrow> nat"
primrec
"plus m 0 = m"
"plus m (Suc n) = plus (Suc m) n"
text{*\noindent and prove*}
(*<*)
lemma [simp]: "!m. plus m n = m+n"
apply(induct_tac n)
by(auto)
(*>*)
lemma "plus m n = m+n"
(*<*)
by(simp)
end
(*>*)