| author | wenzelm |
| Mon, 26 Jun 2023 13:01:58 +0200 | |
| changeset 78204 | 0aa5360fa88b |
| parent 67613 | ce654b0e6d69 |
| permissions | -rw-r--r-- |
(*<*) theory Plus imports Main begin (*>*) text\<open>\noindent Define the following addition function\<close> primrec add :: "nat \<Rightarrow> nat \<Rightarrow> nat" where "add m 0 = m" | "add m (Suc n) = add (Suc m) n" text\<open>\noindent and prove\<close> (*<*) lemma [simp]: "\<forall>m. add m n = m+n" apply(induct_tac n) by(auto) (*>*) lemma "add m n = m+n" (*<*) by(simp) end (*>*)