Up to index of Isabelle/HOL/Extraction
theory Euclid(* Title: HOL/Extraction/Euclid.thy ID: $Id: Euclid.thy,v 1.1 2007/11/13 09:58:46 berghofe Exp $ Author: Markus Wenzel, TU Muenchen Freek Wiedijk, Radboud University Nijmegen Stefan Berghofer, TU Muenchen *) header {* Euclid's theorem *} theory Euclid imports "~~/src/HOL/NumberTheory/Factorization" Efficient_Nat Util begin text {* A constructive version of the proof of Euclid's theorem by Markus Wenzel and Freek Wiedijk \cite{Wenzel-Wiedijk-JAR2002}. *} lemma prime_eq: "prime p = (1 < p ∧ (∀m. m dvd p --> 1 < m --> m = p))" apply (simp add: prime_def) apply (rule iffI) apply blast apply (erule conjE) apply (rule conjI) apply assumption apply (rule allI impI)+ apply (erule allE) apply (erule impE) apply assumption apply (case_tac "m=0") apply simp apply (case_tac "m=Suc 0") apply simp apply simp done lemma prime_eq': "prime p = (1 < p ∧ (∀m k. p = m * k --> 1 < m --> m = p))" by (simp add: prime_eq dvd_def all_simps [symmetric] del: all_simps) lemma factor_greater_one1: "n = m * k ==> m < n ==> k < n ==> Suc 0 < m" by (induct m) auto lemma factor_greater_one2: "n = m * k ==> m < n ==> k < n ==> Suc 0 < k" by (induct k) auto lemma not_prime_ex_mk: assumes n: "Suc 0 < n" shows "(∃m k. Suc 0 < m ∧ Suc 0 < k ∧ m < n ∧ k < n ∧ n = m * k) ∨ prime n" proof - { fix k from nat_eq_dec have "(∃m<n. n = m * k) ∨ ¬ (∃m<n. n = m * k)" by (rule search) } hence "(∃k<n. ∃m<n. n = m * k) ∨ ¬ (∃k<n. ∃m<n. n = m * k)" by (rule search) thus ?thesis proof assume "∃k<n. ∃m<n. n = m * k" then obtain k m where k: "k<n" and m: "m<n" and nmk: "n = m * k" by iprover from nmk m k have "Suc 0 < m" by (rule factor_greater_one1) moreover from nmk m k have "Suc 0 < k" by (rule factor_greater_one2) ultimately show ?thesis using k m nmk by iprover next assume "¬ (∃k<n. ∃m<n. n = m * k)" hence A: "∀k<n. ∀m<n. n ≠ m * k" by iprover have "∀m k. n = m * k --> Suc 0 < m --> m = n" proof (intro allI impI) fix m k assume nmk: "n = m * k" assume m: "Suc 0 < m" from n m nmk have k: "0 < k" by (cases k) auto moreover from n have n: "0 < n" by simp moreover note m moreover from nmk have "m * k = n" by simp ultimately have kn: "k < n" by (rule prod_mn_less_k) show "m = n" proof (cases "k = Suc 0") case True with nmk show ?thesis by (simp only: mult_Suc_right) next case False from m have "0 < m" by simp moreover note n moreover from False n nmk k have "Suc 0 < k" by auto moreover from nmk have "k * m = n" by (simp only: mult_ac) ultimately have mn: "m < n" by (rule prod_mn_less_k) with kn A nmk show ?thesis by iprover qed qed with n have "prime n" by (simp only: prime_eq' One_nat_def simp_thms) thus ?thesis .. qed qed text {* Unfortunately, the proof in the @{text Factorization} theory using @{text metis} is non-constructive. *} lemma split_primel': "primel xs ==> primel ys ==> ∃l. primel l ∧ prod l = prod xs * prod ys" apply (rule exI) apply safe apply (rule_tac [2] prod_append) apply (simp add: primel_append) done lemma factor_exists: "Suc 0 < n ==> (∃l. primel l ∧ prod l = n)" proof (induct n rule: nat_wf_ind) case (1 n) from `Suc 0 < n` have "(∃m k. Suc 0 < m ∧ Suc 0 < k ∧ m < n ∧ k < n ∧ n = m * k) ∨ prime n" by (rule not_prime_ex_mk) then show ?case proof assume "∃m k. Suc 0 < m ∧ Suc 0 < k ∧ m < n ∧ k < n ∧ n = m * k" then obtain m k where m: "Suc 0 < m" and k: "Suc 0 < k" and mn: "m < n" and kn: "k < n" and nmk: "n = m * k" by iprover from mn and m have "∃l. primel l ∧ prod l = m" by (rule 1) then obtain l1 where primel_l1: "primel l1" and prod_l1_m: "prod l1 = m" by iprover from kn and k have "∃l. primel l ∧ prod l = k" by (rule 1) then obtain l2 where primel_l2: "primel l2" and prod_l2_k: "prod l2 = k" by iprover from primel_l1 primel_l2 have "∃l. primel l ∧ prod l = prod l1 * prod l2" by (rule split_primel') with prod_l1_m prod_l2_k nmk show ?thesis by simp next assume "prime n" hence "primel [n] ∧ prod [n] = n" by (rule prime_primel) thus ?thesis .. qed qed lemma dvd_prod [iff]: "n dvd prod (n # ns)" by simp consts fact :: "nat => nat" ("(_!)" [1000] 999) primrec "0! = 1" "(Suc n)! = n! * Suc n" lemma fact_greater_0 [iff]: "0 < n!" by (induct n) simp_all lemma dvd_factorial: "0 < m ==> m ≤ n ==> m dvd n!" proof (induct n) case 0 then show ?case by simp next case (Suc n) from `m ≤ Suc n` show ?case proof (rule le_SucE) assume "m ≤ n" with `0 < m` have "m dvd n!" by (rule Suc) then have "m dvd (n! * Suc n)" by (rule dvd_mult2) then show ?thesis by simp next assume "m = Suc n" then have "m dvd (n! * Suc n)" by (auto intro: dvdI simp: mult_ac) then show ?thesis by simp qed qed lemma prime_factor_exists: assumes N: "(1::nat) < n" shows "∃p. prime p ∧ p dvd n" proof - from N obtain l where primel_l: "primel l" and prod_l: "n = prod l" using factor_exists by simp iprover from prems have "l ≠ []" by (auto simp add: primel_nempty_g_one) then obtain x xs where l: "l = x # xs" by (cases l) simp from primel_l l have "prime x" by (simp add: primel_hd_tl) moreover from primel_l l prod_l have "x dvd n" by (simp only: dvd_prod) ultimately show ?thesis by iprover qed text {* Euclid's theorem: there are infinitely many primes. *} lemma Euclid: "∃p. prime p ∧ n < p" proof - let ?k = "n! + 1" have "1 < n! + 1" by simp then obtain p where prime: "prime p" and dvd: "p dvd ?k" using prime_factor_exists by iprover have "n < p" proof - have "¬ p ≤ n" proof assume pn: "p ≤ n" from `prime p` have "0 < p" by (rule prime_g_zero) then have "p dvd n!" using pn by (rule dvd_factorial) with dvd have "p dvd ?k - n!" by (rule dvd_diff) then have "p dvd 1" by simp with prime show False using prime_nd_one by auto qed then show ?thesis by simp qed with prime show ?thesis by iprover qed extract Euclid text {* The program extracted from the proof of Euclid's theorem looks as follows. @{thm [display] Euclid_def} The program corresponding to the proof of the factorization theorem is @{thm [display] factor_exists_def} *} consts_code arbitrary ("(error \"arbitrary\")") code_module Prime contains Euclid ML "Prime.factor_exists 1007" ML "Prime.factor_exists 567" ML "Prime.factor_exists 345" ML "Prime.factor_exists 999" ML "Prime.factor_exists 876" ML "Prime.Euclid 0" ML "Prime.Euclid it" ML "Prime.Euclid it" ML "Prime.Euclid it" end
lemma prime_eq:
prime p = (1 < p ∧ (∀m. m dvd p --> 1 < m --> m = p))
lemma prime_eq':
prime p = (1 < p ∧ (∀m k. p = m * k --> 1 < m --> m = p))
lemma factor_greater_one1:
[| n = m * k; m < n; k < n |] ==> Suc 0 < m
lemma factor_greater_one2:
[| n = m * k; m < n; k < n |] ==> Suc 0 < k
lemma not_prime_ex_mk:
Suc 0 < n
==> (∃m k. Suc 0 < m ∧ Suc 0 < k ∧ m < n ∧ k < n ∧ n = m * k) ∨ prime n
lemma split_primel':
[| primel xs; primel ys |] ==> ∃l. primel l ∧ prod l = prod xs * prod ys
lemma factor_exists:
Suc 0 < n ==> ∃l. primel l ∧ prod l = n
lemma dvd_prod:
n dvd prod (n # ns)
lemma fact_greater_0:
0 < n!
lemma dvd_factorial:
[| 0 < m; m ≤ n |] ==> m dvd n!
lemma prime_factor_exists:
1 < n ==> ∃p. prime p ∧ p dvd n
lemma Euclid:
∃p. prime p ∧ n < p