src/HOL/Divides.thy
 author nipkow Fri Nov 20 07:23:36 2009 +0100 (2009-11-20) changeset 33804 39b494e8c055 parent 33730 1755ca4ec022 child 34126 8a2c5d7aff51 permissions -rw-r--r--
 paulson@3366  1 (* Title: HOL/Divides.thy  paulson@3366  2  Author: Lawrence C Paulson, Cambridge University Computer Laboratory  paulson@6865  3  Copyright 1999 University of Cambridge  huffman@18154  4 *)  paulson@3366  5 haftmann@27651  6 header {* The division operators div and mod *}  paulson@3366  7 nipkow@15131  8 theory Divides  haftmann@33318  9 imports Nat_Numeral Nat_Transfer  haftmann@33340  10 uses "~~/src/Provers/Arith/cancel_div_mod.ML"  nipkow@15131  11 begin  paulson@3366  12 haftmann@25942  13 subsection {* Syntactic division operations *}  haftmann@25942  14 haftmann@27651  15 class div = dvd +  haftmann@27540  16  fixes div :: "'a \ 'a \ 'a" (infixl "div" 70)  haftmann@27651  17  and mod :: "'a \ 'a \ 'a" (infixl "mod" 70)  haftmann@27540  18 haftmann@27540  19 haftmann@27651  20 subsection {* Abstract division in commutative semirings. *}  haftmann@25942  21 haftmann@30930  22 class semiring_div = comm_semiring_1_cancel + no_zero_divisors + div +  haftmann@25942  23  assumes mod_div_equality: "a div b * b + a mod b = a"  haftmann@27651  24  and div_by_0 [simp]: "a div 0 = 0"  haftmann@27651  25  and div_0 [simp]: "0 div a = 0"  haftmann@27651  26  and div_mult_self1 [simp]: "b \ 0 \ (a + c * b) div b = c + a div b"  haftmann@30930  27  and div_mult_mult1 [simp]: "c \ 0 \ (c * a) div (c * b) = a div b"  haftmann@25942  28 begin  haftmann@25942  29 haftmann@26100  30 text {* @{const div} and @{const mod} *}  haftmann@26100  31 haftmann@26062  32 lemma mod_div_equality2: "b * (a div b) + a mod b = a"  haftmann@26062  33  unfolding mult_commute [of b]  haftmann@26062  34  by (rule mod_div_equality)  haftmann@26062  35 huffman@29403  36 lemma mod_div_equality': "a mod b + a div b * b = a"  huffman@29403  37  using mod_div_equality [of a b]  huffman@29403  38  by (simp only: add_ac)  huffman@29403  39 haftmann@26062  40 lemma div_mod_equality: "((a div b) * b + a mod b) + c = a + c"  haftmann@30934  41  by (simp add: mod_div_equality)  haftmann@26062  42 haftmann@26062  43 lemma div_mod_equality2: "(b * (a div b) + a mod b) + c = a + c"  haftmann@30934  44  by (simp add: mod_div_equality2)  haftmann@26062  45 haftmann@27651  46 lemma mod_by_0 [simp]: "a mod 0 = a"  haftmann@30934  47  using mod_div_equality [of a zero] by simp  haftmann@27651  48 haftmann@27651  49 lemma mod_0 [simp]: "0 mod a = 0"  haftmann@30934  50  using mod_div_equality [of zero a] div_0 by simp  haftmann@27651  51 haftmann@27651  52 lemma div_mult_self2 [simp]:  haftmann@27651  53  assumes "b \ 0"  haftmann@27651  54  shows "(a + b * c) div b = c + a div b"  haftmann@27651  55  using assms div_mult_self1 [of b a c] by (simp add: mult_commute)  haftmann@26100  56 haftmann@27651  57 lemma mod_mult_self1 [simp]: "(a + c * b) mod b = a mod b"  haftmann@27651  58 proof (cases "b = 0")  haftmann@27651  59  case True then show ?thesis by simp  haftmann@27651  60 next  haftmann@27651  61  case False  haftmann@27651  62  have "a + c * b = (a + c * b) div b * b + (a + c * b) mod b"  haftmann@27651  63  by (simp add: mod_div_equality)  haftmann@27651  64  also from False div_mult_self1 [of b a c] have  haftmann@27651  65  "\ = (c + a div b) * b + (a + c * b) mod b"  nipkow@29667  66  by (simp add: algebra_simps)  haftmann@27651  67  finally have "a = a div b * b + (a + c * b) mod b"  haftmann@27651  68  by (simp add: add_commute [of a] add_assoc left_distrib)  haftmann@27651  69  then have "a div b * b + (a + c * b) mod b = a div b * b + a mod b"  haftmann@27651  70  by (simp add: mod_div_equality)  haftmann@27651  71  then show ?thesis by simp  haftmann@27651  72 qed  haftmann@27651  73 haftmann@27651  74 lemma mod_mult_self2 [simp]: "(a + b * c) mod b = a mod b"  haftmann@30934  75  by (simp add: mult_commute [of b])  haftmann@27651  76 haftmann@27651  77 lemma div_mult_self1_is_id [simp]: "b \ 0 \ b * a div b = a"  haftmann@27651  78  using div_mult_self2 [of b 0 a] by simp  haftmann@27651  79 haftmann@27651  80 lemma div_mult_self2_is_id [simp]: "b \ 0 \ a * b div b = a"  haftmann@27651  81  using div_mult_self1 [of b 0 a] by simp  haftmann@27651  82 haftmann@27651  83 lemma mod_mult_self1_is_0 [simp]: "b * a mod b = 0"  haftmann@27651  84  using mod_mult_self2 [of 0 b a] by simp  haftmann@27651  85 haftmann@27651  86 lemma mod_mult_self2_is_0 [simp]: "a * b mod b = 0"  haftmann@27651  87  using mod_mult_self1 [of 0 a b] by simp  haftmann@26062  88 haftmann@27651  89 lemma div_by_1 [simp]: "a div 1 = a"  haftmann@27651  90  using div_mult_self2_is_id [of 1 a] zero_neq_one by simp  haftmann@27651  91 haftmann@27651  92 lemma mod_by_1 [simp]: "a mod 1 = 0"  haftmann@27651  93 proof -  haftmann@27651  94  from mod_div_equality [of a one] div_by_1 have "a + a mod 1 = a" by simp  haftmann@27651  95  then have "a + a mod 1 = a + 0" by simp  haftmann@27651  96  then show ?thesis by (rule add_left_imp_eq)  haftmann@27651  97 qed  haftmann@27651  98 haftmann@27651  99 lemma mod_self [simp]: "a mod a = 0"  haftmann@27651  100  using mod_mult_self2_is_0 [of 1] by simp  haftmann@27651  101 haftmann@27651  102 lemma div_self [simp]: "a \ 0 \ a div a = 1"  haftmann@27651  103  using div_mult_self2_is_id [of _ 1] by simp  haftmann@27651  104 haftmann@27676  105 lemma div_add_self1 [simp]:  haftmann@27651  106  assumes "b \ 0"  haftmann@27651  107  shows "(b + a) div b = a div b + 1"  haftmann@27651  108  using assms div_mult_self1 [of b a 1] by (simp add: add_commute)  haftmann@26062  109 haftmann@27676  110 lemma div_add_self2 [simp]:  haftmann@27651  111  assumes "b \ 0"  haftmann@27651  112  shows "(a + b) div b = a div b + 1"  haftmann@27651  113  using assms div_add_self1 [of b a] by (simp add: add_commute)  haftmann@27651  114 haftmann@27676  115 lemma mod_add_self1 [simp]:  haftmann@27651  116  "(b + a) mod b = a mod b"  haftmann@27651  117  using mod_mult_self1 [of a 1 b] by (simp add: add_commute)  haftmann@27651  118 haftmann@27676  119 lemma mod_add_self2 [simp]:  haftmann@27651  120  "(a + b) mod b = a mod b"  haftmann@27651  121  using mod_mult_self1 [of a 1 b] by simp  haftmann@27651  122 haftmann@27651  123 lemma mod_div_decomp:  haftmann@27651  124  fixes a b  haftmann@27651  125  obtains q r where "q = a div b" and "r = a mod b"  haftmann@27651  126  and "a = q * b + r"  haftmann@27651  127 proof -  haftmann@27651  128  from mod_div_equality have "a = a div b * b + a mod b" by simp  haftmann@27651  129  moreover have "a div b = a div b" ..  haftmann@27651  130  moreover have "a mod b = a mod b" ..  haftmann@27651  131  note that ultimately show thesis by blast  haftmann@27651  132 qed  haftmann@27651  133 haftmann@33364  134 lemma dvd_eq_mod_eq_0 [code, code_unfold, code_inline del]: "a dvd b \ b mod a = 0"  haftmann@25942  135 proof  haftmann@25942  136  assume "b mod a = 0"  haftmann@25942  137  with mod_div_equality [of b a] have "b div a * a = b" by simp  haftmann@25942  138  then have "b = a * (b div a)" unfolding mult_commute ..  haftmann@25942  139  then have "\c. b = a * c" ..  haftmann@25942  140  then show "a dvd b" unfolding dvd_def .  haftmann@25942  141 next  haftmann@25942  142  assume "a dvd b"  haftmann@25942  143  then have "\c. b = a * c" unfolding dvd_def .  haftmann@25942  144  then obtain c where "b = a * c" ..  haftmann@25942  145  then have "b mod a = a * c mod a" by simp  haftmann@25942  146  then have "b mod a = c * a mod a" by (simp add: mult_commute)  haftmann@27651  147  then show "b mod a = 0" by simp  haftmann@25942  148 qed  haftmann@25942  149 huffman@29403  150 lemma mod_div_trivial [simp]: "a mod b div b = 0"  huffman@29403  151 proof (cases "b = 0")  huffman@29403  152  assume "b = 0"  huffman@29403  153  thus ?thesis by simp  huffman@29403  154 next  huffman@29403  155  assume "b \ 0"  huffman@29403  156  hence "a div b + a mod b div b = (a mod b + a div b * b) div b"  huffman@29403  157  by (rule div_mult_self1 [symmetric])  huffman@29403  158  also have "\ = a div b"  huffman@29403  159  by (simp only: mod_div_equality')  huffman@29403  160  also have "\ = a div b + 0"  huffman@29403  161  by simp  huffman@29403  162  finally show ?thesis  huffman@29403  163  by (rule add_left_imp_eq)  huffman@29403  164 qed  huffman@29403  165 huffman@29403  166 lemma mod_mod_trivial [simp]: "a mod b mod b = a mod b"  huffman@29403  167 proof -  huffman@29403  168  have "a mod b mod b = (a mod b + a div b * b) mod b"  huffman@29403  169  by (simp only: mod_mult_self1)  huffman@29403  170  also have "\ = a mod b"  huffman@29403  171  by (simp only: mod_div_equality')  huffman@29403  172  finally show ?thesis .  huffman@29403  173 qed  huffman@29403  174 nipkow@29925  175 lemma dvd_imp_mod_0: "a dvd b \ b mod a = 0"  nipkow@29948  176 by (rule dvd_eq_mod_eq_0[THEN iffD1])  nipkow@29925  177 nipkow@29925  178 lemma dvd_div_mult_self: "a dvd b \ (b div a) * a = b"  nipkow@29925  179 by (subst (2) mod_div_equality [of b a, symmetric]) (simp add:dvd_imp_mod_0)  nipkow@29925  180 haftmann@33274  181 lemma dvd_mult_div_cancel: "a dvd b \ a * (b div a) = b"  haftmann@33274  182 by (drule dvd_div_mult_self) (simp add: mult_commute)  haftmann@33274  183 nipkow@30052  184 lemma dvd_div_mult: "a dvd b \ (b div a) * c = b * c div a"  nipkow@30052  185 apply (cases "a = 0")  nipkow@30052  186  apply simp  nipkow@30052  187 apply (auto simp: dvd_def mult_assoc)  nipkow@30052  188 done  nipkow@30052  189 nipkow@29925  190 lemma div_dvd_div[simp]:  nipkow@29925  191  "a dvd b \ a dvd c \ (b div a dvd c div a) = (b dvd c)"  nipkow@29925  192 apply (cases "a = 0")  nipkow@29925  193  apply simp  nipkow@29925  194 apply (unfold dvd_def)  nipkow@29925  195 apply auto  nipkow@29925  196  apply(blast intro:mult_assoc[symmetric])  nipkow@29925  197 apply(fastsimp simp add: mult_assoc)  nipkow@29925  198 done  nipkow@29925  199 huffman@30078  200 lemma dvd_mod_imp_dvd: "[| k dvd m mod n; k dvd n |] ==> k dvd m"  huffman@30078  201  apply (subgoal_tac "k dvd (m div n) *n + m mod n")  huffman@30078  202  apply (simp add: mod_div_equality)  huffman@30078  203  apply (simp only: dvd_add dvd_mult)  huffman@30078  204  done  huffman@30078  205 huffman@29403  206 text {* Addition respects modular equivalence. *}  huffman@29403  207 huffman@29403  208 lemma mod_add_left_eq: "(a + b) mod c = (a mod c + b) mod c"  huffman@29403  209 proof -  huffman@29403  210  have "(a + b) mod c = (a div c * c + a mod c + b) mod c"  huffman@29403  211  by (simp only: mod_div_equality)  huffman@29403  212  also have "\ = (a mod c + b + a div c * c) mod c"  huffman@29403  213  by (simp only: add_ac)  huffman@29403  214  also have "\ = (a mod c + b) mod c"  huffman@29403  215  by (rule mod_mult_self1)  huffman@29403  216  finally show ?thesis .  huffman@29403  217 qed  huffman@29403  218 huffman@29403  219 lemma mod_add_right_eq: "(a + b) mod c = (a + b mod c) mod c"  huffman@29403  220 proof -  huffman@29403  221  have "(a + b) mod c = (a + (b div c * c + b mod c)) mod c"  huffman@29403  222  by (simp only: mod_div_equality)  huffman@29403  223  also have "\ = (a + b mod c + b div c * c) mod c"  huffman@29403  224  by (simp only: add_ac)  huffman@29403  225  also have "\ = (a + b mod c) mod c"  huffman@29403  226  by (rule mod_mult_self1)  huffman@29403  227  finally show ?thesis .  huffman@29403  228 qed  huffman@29403  229 huffman@29403  230 lemma mod_add_eq: "(a + b) mod c = (a mod c + b mod c) mod c"  huffman@29403  231 by (rule trans [OF mod_add_left_eq mod_add_right_eq])  huffman@29403  232 huffman@29403  233 lemma mod_add_cong:  huffman@29403  234  assumes "a mod c = a' mod c"  huffman@29403  235  assumes "b mod c = b' mod c"  huffman@29403  236  shows "(a + b) mod c = (a' + b') mod c"  huffman@29403  237 proof -  huffman@29403  238  have "(a mod c + b mod c) mod c = (a' mod c + b' mod c) mod c"  huffman@29403  239  unfolding assms ..  huffman@29403  240  thus ?thesis  huffman@29403  241  by (simp only: mod_add_eq [symmetric])  huffman@29403  242 qed  huffman@29403  243 haftmann@30923  244 lemma div_add [simp]: "z dvd x \ z dvd y  nipkow@30837  245  \ (x + y) div z = x div z + y div z"  haftmann@30923  246 by (cases "z = 0", simp, unfold dvd_def, auto simp add: algebra_simps)  nipkow@30837  247 huffman@29403  248 text {* Multiplication respects modular equivalence. *}  huffman@29403  249 huffman@29403  250 lemma mod_mult_left_eq: "(a * b) mod c = ((a mod c) * b) mod c"  huffman@29403  251 proof -  huffman@29403  252  have "(a * b) mod c = ((a div c * c + a mod c) * b) mod c"  huffman@29403  253  by (simp only: mod_div_equality)  huffman@29403  254  also have "\ = (a mod c * b + a div c * b * c) mod c"  nipkow@29667  255  by (simp only: algebra_simps)  huffman@29403  256  also have "\ = (a mod c * b) mod c"  huffman@29403  257  by (rule mod_mult_self1)  huffman@29403  258  finally show ?thesis .  huffman@29403  259 qed  huffman@29403  260 huffman@29403  261 lemma mod_mult_right_eq: "(a * b) mod c = (a * (b mod c)) mod c"  huffman@29403  262 proof -  huffman@29403  263  have "(a * b) mod c = (a * (b div c * c + b mod c)) mod c"  huffman@29403  264  by (simp only: mod_div_equality)  huffman@29403  265  also have "\ = (a * (b mod c) + a * (b div c) * c) mod c"  nipkow@29667  266  by (simp only: algebra_simps)  huffman@29403  267  also have "\ = (a * (b mod c)) mod c"  huffman@29403  268  by (rule mod_mult_self1)  huffman@29403  269  finally show ?thesis .  huffman@29403  270 qed  huffman@29403  271 huffman@29403  272 lemma mod_mult_eq: "(a * b) mod c = ((a mod c) * (b mod c)) mod c"  huffman@29403  273 by (rule trans [OF mod_mult_left_eq mod_mult_right_eq])  huffman@29403  274 huffman@29403  275 lemma mod_mult_cong:  huffman@29403  276  assumes "a mod c = a' mod c"  huffman@29403  277  assumes "b mod c = b' mod c"  huffman@29403  278  shows "(a * b) mod c = (a' * b') mod c"  huffman@29403  279 proof -  huffman@29403  280  have "(a mod c * (b mod c)) mod c = (a' mod c * (b' mod c)) mod c"  huffman@29403  281  unfolding assms ..  huffman@29403  282  thus ?thesis  huffman@29403  283  by (simp only: mod_mult_eq [symmetric])  huffman@29403  284 qed  huffman@29403  285 huffman@29404  286 lemma mod_mod_cancel:  huffman@29404  287  assumes "c dvd b"  huffman@29404  288  shows "a mod b mod c = a mod c"  huffman@29404  289 proof -  huffman@29404  290  from c dvd b obtain k where "b = c * k"  huffman@29404  291  by (rule dvdE)  huffman@29404  292  have "a mod b mod c = a mod (c * k) mod c"  huffman@29404  293  by (simp only: b = c * k)  huffman@29404  294  also have "\ = (a mod (c * k) + a div (c * k) * k * c) mod c"  huffman@29404  295  by (simp only: mod_mult_self1)  huffman@29404  296  also have "\ = (a div (c * k) * (c * k) + a mod (c * k)) mod c"  huffman@29404  297  by (simp only: add_ac mult_ac)  huffman@29404  298  also have "\ = a mod c"  huffman@29404  299  by (simp only: mod_div_equality)  huffman@29404  300  finally show ?thesis .  huffman@29404  301 qed  huffman@29404  302 haftmann@30930  303 lemma div_mult_div_if_dvd:  haftmann@30930  304  "y dvd x \ z dvd w \ (x div y) * (w div z) = (x * w) div (y * z)"  haftmann@30930  305  apply (cases "y = 0", simp)  haftmann@30930  306  apply (cases "z = 0", simp)  haftmann@30930  307  apply (auto elim!: dvdE simp add: algebra_simps)  nipkow@30476  308  apply (subst mult_assoc [symmetric])  nipkow@30476  309  apply (simp add: no_zero_divisors)  haftmann@30930  310  done  haftmann@30930  311 haftmann@30930  312 lemma div_mult_mult2 [simp]:  haftmann@30930  313  "c \ 0 \ (a * c) div (b * c) = a div b"  haftmann@30930  314  by (drule div_mult_mult1) (simp add: mult_commute)  haftmann@30930  315 haftmann@30930  316 lemma div_mult_mult1_if [simp]:  haftmann@30930  317  "(c * a) div (c * b) = (if c = 0 then 0 else a div b)"  haftmann@30930  318  by simp_all  nipkow@30476  319 haftmann@30930  320 lemma mod_mult_mult1:  haftmann@30930  321  "(c * a) mod (c * b) = c * (a mod b)"  haftmann@30930  322 proof (cases "c = 0")  haftmann@30930  323  case True then show ?thesis by simp  haftmann@30930  324 next  haftmann@30930  325  case False  haftmann@30930  326  from mod_div_equality  haftmann@30930  327  have "((c * a) div (c * b)) * (c * b) + (c * a) mod (c * b) = c * a" .  haftmann@30930  328  with False have "c * ((a div b) * b + a mod b) + (c * a) mod (c * b)  haftmann@30930  329  = c * a + c * (a mod b)" by (simp add: algebra_simps)  haftmann@30930  330  with mod_div_equality show ?thesis by simp  haftmann@30930  331 qed  haftmann@30930  332   haftmann@30930  333 lemma mod_mult_mult2:  haftmann@30930  334  "(a * c) mod (b * c) = (a mod b) * c"  haftmann@30930  335  using mod_mult_mult1 [of c a b] by (simp add: mult_commute)  haftmann@30930  336 huffman@31662  337 lemma dvd_mod: "k dvd m \ k dvd n \ k dvd (m mod n)"  huffman@31662  338  unfolding dvd_def by (auto simp add: mod_mult_mult1)  huffman@31662  339 huffman@31662  340 lemma dvd_mod_iff: "k dvd n \ k dvd (m mod n) \ k dvd m"  huffman@31662  341 by (blast intro: dvd_mod_imp_dvd dvd_mod)  huffman@31662  342 haftmann@31009  343 lemma div_power:  huffman@31661  344  "y dvd x \ (x div y) ^ n = x ^ n div y ^ n"  nipkow@30476  345 apply (induct n)  nipkow@30476  346  apply simp  nipkow@30476  347 apply(simp add: div_mult_div_if_dvd dvd_power_same)  nipkow@30476  348 done  nipkow@30476  349 huffman@31661  350 end  huffman@31661  351 huffman@31661  352 class ring_div = semiring_div + idom  huffman@29405  353 begin  huffman@29405  354 huffman@29405  355 text {* Negation respects modular equivalence. *}  huffman@29405  356 huffman@29405  357 lemma mod_minus_eq: "(- a) mod b = (- (a mod b)) mod b"  huffman@29405  358 proof -  huffman@29405  359  have "(- a) mod b = (- (a div b * b + a mod b)) mod b"  huffman@29405  360  by (simp only: mod_div_equality)  huffman@29405  361  also have "\ = (- (a mod b) + - (a div b) * b) mod b"  huffman@29405  362  by (simp only: minus_add_distrib minus_mult_left add_ac)  huffman@29405  363  also have "\ = (- (a mod b)) mod b"  huffman@29405  364  by (rule mod_mult_self1)  huffman@29405  365  finally show ?thesis .  huffman@29405  366 qed  huffman@29405  367 huffman@29405  368 lemma mod_minus_cong:  huffman@29405  369  assumes "a mod b = a' mod b"  huffman@29405  370  shows "(- a) mod b = (- a') mod b"  huffman@29405  371 proof -  huffman@29405  372  have "(- (a mod b)) mod b = (- (a' mod b)) mod b"  huffman@29405  373  unfolding assms ..  huffman@29405  374  thus ?thesis  huffman@29405  375  by (simp only: mod_minus_eq [symmetric])  huffman@29405  376 qed  huffman@29405  377 huffman@29405  378 text {* Subtraction respects modular equivalence. *}  huffman@29405  379 huffman@29405  380 lemma mod_diff_left_eq: "(a - b) mod c = (a mod c - b) mod c"  huffman@29405  381  unfolding diff_minus  huffman@29405  382  by (intro mod_add_cong mod_minus_cong) simp_all  huffman@29405  383 huffman@29405  384 lemma mod_diff_right_eq: "(a - b) mod c = (a - b mod c) mod c"  huffman@29405  385  unfolding diff_minus  huffman@29405  386  by (intro mod_add_cong mod_minus_cong) simp_all  huffman@29405  387 huffman@29405  388 lemma mod_diff_eq: "(a - b) mod c = (a mod c - b mod c) mod c"  huffman@29405  389  unfolding diff_minus  huffman@29405  390  by (intro mod_add_cong mod_minus_cong) simp_all  huffman@29405  391 huffman@29405  392 lemma mod_diff_cong:  huffman@29405  393  assumes "a mod c = a' mod c"  huffman@29405  394  assumes "b mod c = b' mod c"  huffman@29405  395  shows "(a - b) mod c = (a' - b') mod c"  huffman@29405  396  unfolding diff_minus using assms  huffman@29405  397  by (intro mod_add_cong mod_minus_cong)  huffman@29405  398 nipkow@30180  399 lemma dvd_neg_div: "y dvd x \ -x div y = - (x div y)"  nipkow@30180  400 apply (case_tac "y = 0") apply simp  nipkow@30180  401 apply (auto simp add: dvd_def)  nipkow@30180  402 apply (subgoal_tac "-(y * k) = y * - k")  nipkow@30180  403  apply (erule ssubst)  nipkow@30180  404  apply (erule div_mult_self1_is_id)  nipkow@30180  405 apply simp  nipkow@30180  406 done  nipkow@30180  407 nipkow@30180  408 lemma dvd_div_neg: "y dvd x \ x div -y = - (x div y)"  nipkow@30180  409 apply (case_tac "y = 0") apply simp  nipkow@30180  410 apply (auto simp add: dvd_def)  nipkow@30180  411 apply (subgoal_tac "y * k = -y * -k")  nipkow@30180  412  apply (erule ssubst)  nipkow@30180  413  apply (rule div_mult_self1_is_id)  nipkow@30180  414  apply simp  nipkow@30180  415 apply simp  nipkow@30180  416 done  nipkow@30180  417 huffman@29405  418 end  huffman@29405  419 haftmann@25942  420 haftmann@26100  421 subsection {* Division on @{typ nat} *}  haftmann@26100  422 haftmann@26100  423 text {*  haftmann@26100  424  We define @{const div} and @{const mod} on @{typ nat} by means  haftmann@26100  425  of a characteristic relation with two input arguments  haftmann@26100  426  @{term "m\nat"}, @{term "n\nat"} and two output arguments  haftmann@26100  427  @{term "q\nat"}(uotient) and @{term "r\nat"}(emainder).  haftmann@26100  428 *}  haftmann@26100  429 haftmann@33340  430 definition divmod_nat_rel :: "nat \ nat \ nat \ nat \ bool" where  haftmann@33340  431  "divmod_nat_rel m n qr \  haftmann@30923  432  m = fst qr * n + snd qr \  haftmann@30923  433  (if n = 0 then fst qr = 0 else if n > 0 then 0 \ snd qr \ snd qr < n else n < snd qr \ snd qr \ 0)"  haftmann@26100  434 haftmann@33340  435 text {* @{const divmod_nat_rel} is total: *}  haftmann@26100  436 haftmann@33340  437 lemma divmod_nat_rel_ex:  haftmann@33340  438  obtains q r where "divmod_nat_rel m n (q, r)"  haftmann@26100  439 proof (cases "n = 0")  haftmann@30923  440  case True with that show thesis  haftmann@33340  441  by (auto simp add: divmod_nat_rel_def)  haftmann@26100  442 next  haftmann@26100  443  case False  haftmann@26100  444  have "\q r. m = q * n + r \ r < n"  haftmann@26100  445  proof (induct m)  haftmann@26100  446  case 0 with n \ 0  haftmann@26100  447  have "(0\nat) = 0 * n + 0 \ 0 < n" by simp  haftmann@26100  448  then show ?case by blast  haftmann@26100  449  next  haftmann@26100  450  case (Suc m) then obtain q' r'  haftmann@26100  451  where m: "m = q' * n + r'" and n: "r' < n" by auto  haftmann@26100  452  then show ?case proof (cases "Suc r' < n")  haftmann@26100  453  case True  haftmann@26100  454  from m n have "Suc m = q' * n + Suc r'" by simp  haftmann@26100  455  with True show ?thesis by blast  haftmann@26100  456  next  haftmann@26100  457  case False then have "n \ Suc r'" by auto  haftmann@26100  458  moreover from n have "Suc r' \ n" by auto  haftmann@26100  459  ultimately have "n = Suc r'" by auto  haftmann@26100  460  with m have "Suc m = Suc q' * n + 0" by simp  haftmann@26100  461  with n \ 0 show ?thesis by blast  haftmann@26100  462  qed  haftmann@26100  463  qed  haftmann@26100  464  with that show thesis  haftmann@33340  465  using n \ 0 by (auto simp add: divmod_nat_rel_def)  haftmann@26100  466 qed  haftmann@26100  467 haftmann@33340  468 text {* @{const divmod_nat_rel} is injective: *}  haftmann@26100  469 haftmann@33340  470 lemma divmod_nat_rel_unique:  haftmann@33340  471  assumes "divmod_nat_rel m n qr"  haftmann@33340  472  and "divmod_nat_rel m n qr'"  haftmann@30923  473  shows "qr = qr'"  haftmann@26100  474 proof (cases "n = 0")  haftmann@26100  475  case True with assms show ?thesis  haftmann@30923  476  by (cases qr, cases qr')  haftmann@33340  477  (simp add: divmod_nat_rel_def)  haftmann@26100  478 next  haftmann@26100  479  case False  haftmann@26100  480  have aux: "\q r q' r'. q' * n + r' = q * n + r \ r < n \ q' \ (q\nat)"  haftmann@26100  481  apply (rule leI)  haftmann@26100  482  apply (subst less_iff_Suc_add)  haftmann@26100  483  apply (auto simp add: add_mult_distrib)  haftmann@26100  484  done  haftmann@30923  485  from n \ 0 assms have "fst qr = fst qr'"  haftmann@33340  486  by (auto simp add: divmod_nat_rel_def intro: order_antisym dest: aux sym)  haftmann@30923  487  moreover from this assms have "snd qr = snd qr'"  haftmann@33340  488  by (simp add: divmod_nat_rel_def)  haftmann@30923  489  ultimately show ?thesis by (cases qr, cases qr') simp  haftmann@26100  490 qed  haftmann@26100  491 haftmann@26100  492 text {*  haftmann@26100  493  We instantiate divisibility on the natural numbers by  haftmann@33340  494  means of @{const divmod_nat_rel}:  haftmann@26100  495 *}  haftmann@25942  496 haftmann@25942  497 instantiation nat :: semiring_div  haftmann@25571  498 begin  haftmann@25571  499 haftmann@33340  500 definition divmod_nat :: "nat \ nat \ nat \ nat" where  haftmann@33340  501  [code del]: "divmod_nat m n = (THE qr. divmod_nat_rel m n qr)"  haftmann@30923  502 haftmann@33340  503 lemma divmod_nat_rel_divmod_nat:  haftmann@33340  504  "divmod_nat_rel m n (divmod_nat m n)"  haftmann@30923  505 proof -  haftmann@33340  506  from divmod_nat_rel_ex  haftmann@33340  507  obtain qr where rel: "divmod_nat_rel m n qr" .  haftmann@30923  508  then show ?thesis  haftmann@33340  509  by (auto simp add: divmod_nat_def intro: theI elim: divmod_nat_rel_unique)  haftmann@30923  510 qed  haftmann@30923  511 haftmann@33340  512 lemma divmod_nat_eq:  haftmann@33340  513  assumes "divmod_nat_rel m n qr"  haftmann@33340  514  shows "divmod_nat m n = qr"  haftmann@33340  515  using assms by (auto intro: divmod_nat_rel_unique divmod_nat_rel_divmod_nat)  haftmann@26100  516 haftmann@26100  517 definition div_nat where  haftmann@33340  518  "m div n = fst (divmod_nat m n)"  haftmann@26100  519 haftmann@26100  520 definition mod_nat where  haftmann@33340  521  "m mod n = snd (divmod_nat m n)"  haftmann@25571  522 haftmann@33340  523 lemma divmod_nat_div_mod:  haftmann@33340  524  "divmod_nat m n = (m div n, m mod n)"  haftmann@26100  525  unfolding div_nat_def mod_nat_def by simp  haftmann@26100  526 haftmann@26100  527 lemma div_eq:  haftmann@33340  528  assumes "divmod_nat_rel m n (q, r)"  haftmann@26100  529  shows "m div n = q"  haftmann@33340  530  using assms by (auto dest: divmod_nat_eq simp add: divmod_nat_div_mod)  haftmann@26100  531 haftmann@26100  532 lemma mod_eq:  haftmann@33340  533  assumes "divmod_nat_rel m n (q, r)"  haftmann@26100  534  shows "m mod n = r"  haftmann@33340  535  using assms by (auto dest: divmod_nat_eq simp add: divmod_nat_div_mod)  haftmann@25571  536 haftmann@33340  537 lemma divmod_nat_rel: "divmod_nat_rel m n (m div n, m mod n)"  haftmann@33340  538  by (simp add: div_nat_def mod_nat_def divmod_nat_rel_divmod_nat)  paulson@14267  539 haftmann@33340  540 lemma divmod_nat_zero:  haftmann@33340  541  "divmod_nat m 0 = (0, m)"  haftmann@26100  542 proof -  haftmann@33340  543  from divmod_nat_rel [of m 0] show ?thesis  haftmann@33340  544  unfolding divmod_nat_div_mod divmod_nat_rel_def by simp  haftmann@26100  545 qed  haftmann@25942  546 haftmann@33340  547 lemma divmod_nat_base:  haftmann@26100  548  assumes "m < n"  haftmann@33340  549  shows "divmod_nat m n = (0, m)"  haftmann@26100  550 proof -  haftmann@33340  551  from divmod_nat_rel [of m n] show ?thesis  haftmann@33340  552  unfolding divmod_nat_div_mod divmod_nat_rel_def  haftmann@26100  553  using assms by (cases "m div n = 0")  haftmann@26100  554  (auto simp add: gr0_conv_Suc [of "m div n"])  haftmann@26100  555 qed  haftmann@25942  556 haftmann@33340  557 lemma divmod_nat_step:  haftmann@26100  558  assumes "0 < n" and "n \ m"  haftmann@33340  559  shows "divmod_nat m n = (Suc ((m - n) div n), (m - n) mod n)"  haftmann@26100  560 proof -  haftmann@33340  561  from divmod_nat_rel have divmod_nat_m_n: "divmod_nat_rel m n (m div n, m mod n)" .  haftmann@26100  562  with assms have m_div_n: "m div n \ 1"  haftmann@33340  563  by (cases "m div n") (auto simp add: divmod_nat_rel_def)  haftmann@33340  564  from assms divmod_nat_m_n have "divmod_nat_rel (m - n) n (m div n - Suc 0, m mod n)"  haftmann@33340  565  by (cases "m div n") (auto simp add: divmod_nat_rel_def)  haftmann@33340  566  with divmod_nat_eq have "divmod_nat (m - n) n = (m div n - Suc 0, m mod n)" by simp  haftmann@33340  567  moreover from divmod_nat_div_mod have "divmod_nat (m - n) n = ((m - n) div n, (m - n) mod n)" .  haftmann@26100  568  ultimately have "m div n = Suc ((m - n) div n)"  haftmann@26100  569  and "m mod n = (m - n) mod n" using m_div_n by simp_all  haftmann@33340  570  then show ?thesis using divmod_nat_div_mod by simp  haftmann@26100  571 qed  haftmann@25942  572 wenzelm@26300  573 text {* The ''recursion'' equations for @{const div} and @{const mod} *}  haftmann@26100  574 haftmann@26100  575 lemma div_less [simp]:  haftmann@26100  576  fixes m n :: nat  haftmann@26100  577  assumes "m < n"  haftmann@26100  578  shows "m div n = 0"  haftmann@33340  579  using assms divmod_nat_base divmod_nat_div_mod by simp  haftmann@25942  580 haftmann@26100  581 lemma le_div_geq:  haftmann@26100  582  fixes m n :: nat  haftmann@26100  583  assumes "0 < n" and "n \ m"  haftmann@26100  584  shows "m div n = Suc ((m - n) div n)"  haftmann@33340  585  using assms divmod_nat_step divmod_nat_div_mod by simp  paulson@14267  586 haftmann@26100  587 lemma mod_less [simp]:  haftmann@26100  588  fixes m n :: nat  haftmann@26100  589  assumes "m < n"  haftmann@26100  590  shows "m mod n = m"  haftmann@33340  591  using assms divmod_nat_base divmod_nat_div_mod by simp  haftmann@26100  592 haftmann@26100  593 lemma le_mod_geq:  haftmann@26100  594  fixes m n :: nat  haftmann@26100  595  assumes "n \ m"  haftmann@26100  596  shows "m mod n = (m - n) mod n"  haftmann@33340  597  using assms divmod_nat_step divmod_nat_div_mod by (cases "n = 0") simp_all  paulson@14267  598 haftmann@30930  599 instance proof -  haftmann@30930  600  have [simp]: "\n::nat. n div 0 = 0"  haftmann@33340  601  by (simp add: div_nat_def divmod_nat_zero)  haftmann@30930  602  have [simp]: "\n::nat. 0 div n = 0"  haftmann@30930  603  proof -  haftmann@30930  604  fix n :: nat  haftmann@30930  605  show "0 div n = 0"  haftmann@30930  606  by (cases "n = 0") simp_all  haftmann@30930  607  qed  haftmann@30930  608  show "OFCLASS(nat, semiring_div_class)" proof  haftmann@30930  609  fix m n :: nat  haftmann@30930  610  show "m div n * n + m mod n = m"  haftmann@33340  611  using divmod_nat_rel [of m n] by (simp add: divmod_nat_rel_def)  haftmann@30930  612  next  haftmann@30930  613  fix m n q :: nat  haftmann@30930  614  assume "n \ 0"  haftmann@30930  615  then show "(q + m * n) div n = m + q div n"  haftmann@30930  616  by (induct m) (simp_all add: le_div_geq)  haftmann@30930  617  next  haftmann@30930  618  fix m n q :: nat  haftmann@30930  619  assume "m \ 0"  haftmann@30930  620  then show "(m * n) div (m * q) = n div q"  haftmann@30930  621  proof (cases "n \ 0 \ q \ 0")  haftmann@30930  622  case False then show ?thesis by auto  haftmann@30930  623  next  haftmann@30930  624  case True with m \ 0  haftmann@30930  625  have "m > 0" and "n > 0" and "q > 0" by auto  haftmann@33340  626  then have "\a b. divmod_nat_rel n q (a, b) \ divmod_nat_rel (m * n) (m * q) (a, m * b)"  haftmann@33340  627  by (auto simp add: divmod_nat_rel_def) (simp_all add: algebra_simps)  haftmann@33340  628  moreover from divmod_nat_rel have "divmod_nat_rel n q (n div q, n mod q)" .  haftmann@33340  629  ultimately have "divmod_nat_rel (m * n) (m * q) (n div q, m * (n mod q))" .  haftmann@30930  630  then show ?thesis by (simp add: div_eq)  haftmann@30930  631  qed  haftmann@30930  632  qed simp_all  haftmann@25942  633 qed  haftmann@26100  634 haftmann@25942  635 end  paulson@14267  636 haftmann@33361  637 lemma divmod_nat_if [code]: "divmod_nat m n = (if n = 0 \ m < n then (0, m) else  haftmann@33361  638  let (q, r) = divmod_nat (m - n) n in (Suc q, r))"  haftmann@33361  639 by (simp add: divmod_nat_zero divmod_nat_base divmod_nat_step)  haftmann@33361  640  (simp add: divmod_nat_div_mod)  haftmann@33361  641 haftmann@26100  642 text {* Simproc for cancelling @{const div} and @{const mod} *}  haftmann@25942  643 haftmann@30934  644 ML {*  haftmann@30934  645 local  haftmann@30934  646 haftmann@30934  647 structure CancelDivMod = CancelDivModFun(struct  haftmann@25942  648 haftmann@30934  649  val div_name = @{const_name div};  haftmann@30934  650  val mod_name = @{const_name mod};  haftmann@30934  651  val mk_binop = HOLogic.mk_binop;  haftmann@30934  652  val mk_sum = Nat_Arith.mk_sum;  haftmann@30934  653  val dest_sum = Nat_Arith.dest_sum;  haftmann@25942  654 haftmann@30934  655  val div_mod_eqs = map mk_meta_eq [@{thm div_mod_equality}, @{thm div_mod_equality2}];  paulson@14267  656 haftmann@30934  657  val trans = trans;  haftmann@25942  658 haftmann@30934  659  val prove_eq_sums = Arith_Data.prove_conv2 all_tac (Arith_Data.simp_all_tac  haftmann@30934  660  (@{thm monoid_add_class.add_0_left} :: @{thm monoid_add_class.add_0_right} :: @{thms add_ac}))  haftmann@25942  661 haftmann@30934  662 end)  haftmann@25942  663 haftmann@30934  664 in  haftmann@25942  665 wenzelm@32010  666 val cancel_div_mod_nat_proc = Simplifier.simproc @{theory}  haftmann@26100  667  "cancel_div_mod" ["(m::nat) + n"] (K CancelDivMod.proc);  haftmann@25942  668 haftmann@30934  669 val _ = Addsimprocs [cancel_div_mod_nat_proc];  haftmann@30934  670 haftmann@30934  671 end  haftmann@25942  672 *}  haftmann@25942  673 haftmann@26100  674 haftmann@26100  675 subsubsection {* Quotient *}  haftmann@26100  676 haftmann@26100  677 lemma div_geq: "0 < n \ \ m < n \ m div n = Suc ((m - n) div n)"  nipkow@29667  678 by (simp add: le_div_geq linorder_not_less)  haftmann@26100  679 haftmann@26100  680 lemma div_if: "0 < n \ m div n = (if m < n then 0 else Suc ((m - n) div n))"  nipkow@29667  681 by (simp add: div_geq)  haftmann@26100  682 haftmann@26100  683 lemma div_mult_self_is_m [simp]: "0 (m*n) div n = (m::nat)"  nipkow@29667  684 by simp  haftmann@26100  685 haftmann@26100  686 lemma div_mult_self1_is_m [simp]: "0 (n*m) div n = (m::nat)"  nipkow@29667  687 by simp  haftmann@26100  688 haftmann@25942  689 haftmann@25942  690 subsubsection {* Remainder *}  haftmann@25942  691 haftmann@26100  692 lemma mod_less_divisor [simp]:  haftmann@26100  693  fixes m n :: nat  haftmann@26100  694  assumes "n > 0"  haftmann@26100  695  shows "m mod n < (n::nat)"  haftmann@33340  696  using assms divmod_nat_rel [of m n] unfolding divmod_nat_rel_def by auto  paulson@14267  697 haftmann@26100  698 lemma mod_less_eq_dividend [simp]:  haftmann@26100  699  fixes m n :: nat  haftmann@26100  700  shows "m mod n \ m"  haftmann@26100  701 proof (rule add_leD2)  haftmann@26100  702  from mod_div_equality have "m div n * n + m mod n = m" .  haftmann@26100  703  then show "m div n * n + m mod n \ m" by auto  haftmann@26100  704 qed  haftmann@26100  705 haftmann@26100  706 lemma mod_geq: "\ m < (n\nat) \ m mod n = (m - n) mod n"  nipkow@29667  707 by (simp add: le_mod_geq linorder_not_less)  paulson@14267  708 haftmann@26100  709 lemma mod_if: "m mod (n\nat) = (if m < n then m else (m - n) mod n)"  nipkow@29667  710 by (simp add: le_mod_geq)  haftmann@26100  711 paulson@14267  712 lemma mod_1 [simp]: "m mod Suc 0 = 0"  nipkow@29667  713 by (induct m) (simp_all add: mod_geq)  paulson@14267  714 haftmann@26100  715 lemma mod_mult_distrib: "(m mod n) * (k\nat) = (m * k) mod (n * k)"  wenzelm@22718  716  apply (cases "n = 0", simp)  wenzelm@22718  717  apply (cases "k = 0", simp)  wenzelm@22718  718  apply (induct m rule: nat_less_induct)  wenzelm@22718  719  apply (subst mod_if, simp)  wenzelm@22718  720  apply (simp add: mod_geq diff_mult_distrib)  wenzelm@22718  721  done  paulson@14267  722 paulson@14267  723 lemma mod_mult_distrib2: "(k::nat) * (m mod n) = (k*m) mod (k*n)"  nipkow@29667  724 by (simp add: mult_commute [of k] mod_mult_distrib)  paulson@14267  725 paulson@14267  726 (* a simple rearrangement of mod_div_equality: *)  paulson@14267  727 lemma mult_div_cancel: "(n::nat) * (m div n) = m - (m mod n)"  nipkow@29667  728 by (cut_tac a = m and b = n in mod_div_equality2, arith)  paulson@14267  729 nipkow@15439  730 lemma mod_le_divisor[simp]: "0 < n \ m mod n \ (n::nat)"  wenzelm@22718  731  apply (drule mod_less_divisor [where m = m])  wenzelm@22718  732  apply simp  wenzelm@22718  733  done  paulson@14267  734 haftmann@26100  735 subsubsection {* Quotient and Remainder *}  paulson@14267  736 haftmann@33340  737 lemma divmod_nat_rel_mult1_eq:  haftmann@33340  738  "divmod_nat_rel b c (q, r) \ c > 0  haftmann@33340  739  \ divmod_nat_rel (a * b) c (a * q + a * r div c, a * r mod c)"  haftmann@33340  740 by (auto simp add: split_ifs divmod_nat_rel_def algebra_simps)  paulson@14267  741 haftmann@30923  742 lemma div_mult1_eq:  haftmann@30923  743  "(a * b) div c = a * (b div c) + a * (b mod c) div (c::nat)"  nipkow@25134  744 apply (cases "c = 0", simp)  haftmann@33340  745 apply (blast intro: divmod_nat_rel [THEN divmod_nat_rel_mult1_eq, THEN div_eq])  nipkow@25134  746 done  paulson@14267  747 haftmann@33340  748 lemma divmod_nat_rel_add1_eq:  haftmann@33340  749  "divmod_nat_rel a c (aq, ar) \ divmod_nat_rel b c (bq, br) \ c > 0  haftmann@33340  750  \ divmod_nat_rel (a + b) c (aq + bq + (ar + br) div c, (ar + br) mod c)"  haftmann@33340  751 by (auto simp add: split_ifs divmod_nat_rel_def algebra_simps)  paulson@14267  752 paulson@14267  753 (*NOT suitable for rewriting: the RHS has an instance of the LHS*)  paulson@14267  754 lemma div_add1_eq:  nipkow@25134  755  "(a+b) div (c::nat) = a div c + b div c + ((a mod c + b mod c) div c)"  nipkow@25134  756 apply (cases "c = 0", simp)  haftmann@33340  757 apply (blast intro: divmod_nat_rel_add1_eq [THEN div_eq] divmod_nat_rel)  nipkow@25134  758 done  paulson@14267  759 paulson@14267  760 lemma mod_lemma: "[| (0::nat) < c; r < b |] ==> b * (q mod c) + r < b * c"  wenzelm@22718  761  apply (cut_tac m = q and n = c in mod_less_divisor)  wenzelm@22718  762  apply (drule_tac [2] m = "q mod c" in less_imp_Suc_add, auto)  wenzelm@22718  763  apply (erule_tac P = "%x. ?lhs < ?rhs x" in ssubst)  wenzelm@22718  764  apply (simp add: add_mult_distrib2)  wenzelm@22718  765  done  paulson@10559  766 haftmann@33340  767 lemma divmod_nat_rel_mult2_eq:  haftmann@33340  768  "divmod_nat_rel a b (q, r) \ 0 < b \ 0 < c  haftmann@33340  769  \ divmod_nat_rel a (b * c) (q div c, b *(q mod c) + r)"  haftmann@33340  770 by (auto simp add: mult_ac divmod_nat_rel_def add_mult_distrib2 [symmetric] mod_lemma)  paulson@14267  771 paulson@14267  772 lemma div_mult2_eq: "a div (b*c) = (a div b) div (c::nat)"  wenzelm@22718  773  apply (cases "b = 0", simp)  wenzelm@22718  774  apply (cases "c = 0", simp)  haftmann@33340  775  apply (force simp add: divmod_nat_rel [THEN divmod_nat_rel_mult2_eq, THEN div_eq])  wenzelm@22718  776  done  paulson@14267  777 paulson@14267  778 lemma mod_mult2_eq: "a mod (b*c) = b*(a div b mod c) + a mod (b::nat)"  wenzelm@22718  779  apply (cases "b = 0", simp)  wenzelm@22718  780  apply (cases "c = 0", simp)  haftmann@33340  781  apply (auto simp add: mult_commute divmod_nat_rel [THEN divmod_nat_rel_mult2_eq, THEN mod_eq])  wenzelm@22718  782  done  paulson@14267  783 paulson@14267  784 haftmann@25942  785 subsubsection{*Further Facts about Quotient and Remainder*}  paulson@14267  786 paulson@14267  787 lemma div_1 [simp]: "m div Suc 0 = m"  nipkow@29667  788 by (induct m) (simp_all add: div_geq)  paulson@14267  789 paulson@14267  790 paulson@14267  791 (* Monotonicity of div in first argument *)  haftmann@30923  792 lemma div_le_mono [rule_format (no_asm)]:  wenzelm@22718  793  "\m::nat. m \ n --> (m div k) \ (n div k)"  paulson@14267  794 apply (case_tac "k=0", simp)  paulson@15251  795 apply (induct "n" rule: nat_less_induct, clarify)  paulson@14267  796 apply (case_tac "n= k *)  paulson@14267  800 apply (case_tac "m=k *)  nipkow@15439  804 apply (simp add: div_geq diff_le_mono)  paulson@14267  805 done  paulson@14267  806 paulson@14267  807 (* Antimonotonicity of div in second argument *)  paulson@14267  808 lemma div_le_mono2: "!!m::nat. [| 0n |] ==> (k div n) \ (k div m)"  paulson@14267  809 apply (subgoal_tac "0 (k-m) div n")  paulson@14267  818  prefer 2  paulson@14267  819  apply (blast intro: div_le_mono diff_le_mono2)  paulson@14267  820 apply (rule le_trans, simp)  nipkow@15439  821 apply (simp)  paulson@14267  822 done  paulson@14267  823 paulson@14267  824 lemma div_le_dividend [simp]: "m div n \ (m::nat)"  paulson@14267  825 apply (case_tac "n=0", simp)  paulson@14267  826 apply (subgoal_tac "m div n \ m div 1", simp)  paulson@14267  827 apply (rule div_le_mono2)  paulson@14267  828 apply (simp_all (no_asm_simp))  paulson@14267  829 done  paulson@14267  830 wenzelm@22718  831 (* Similar for "less than" *)  paulson@17085  832 lemma div_less_dividend [rule_format]:  paulson@14267  833  "!!n::nat. 1 0 < m --> m div n < m"  paulson@15251  834 apply (induct_tac m rule: nat_less_induct)  paulson@14267  835 apply (rename_tac "m")  paulson@14267  836 apply (case_tac "m Suc(na) *)  paulson@16796  857 apply (simp add: linorder_not_less le_Suc_eq mod_geq)  nipkow@15439  858 apply (auto simp add: Suc_diff_le le_mod_geq)  paulson@14267  859 done  paulson@14267  860 paulson@14267  861 lemma mod_eq_0_iff: "(m mod d = 0) = (\q::nat. m = d*q)"  nipkow@29667  862 by (auto simp add: dvd_eq_mod_eq_0 [symmetric] dvd_def)  paulson@17084  863 wenzelm@22718  864 lemmas mod_eq_0D [dest!] = mod_eq_0_iff [THEN iffD1]  paulson@14267  865 paulson@14267  866 (*Loses information, namely we also have r \q::nat. m = r + q*d"  haftmann@27651  868  apply (cut_tac a = m in mod_div_equality)  wenzelm@22718  869  apply (simp only: add_ac)  wenzelm@22718  870  apply (blast intro: sym)  wenzelm@22718  871  done  paulson@14267  872 nipkow@13152  873 lemma split_div:  nipkow@13189  874  "P(n div k :: nat) =  nipkow@13189  875  ((k = 0 \ P 0) \ (k \ 0 \ (!i. !j P i)))"  nipkow@13189  876  (is "?P = ?Q" is "_ = (_ \ (_ \ ?R))")  nipkow@13189  877 proof  nipkow@13189  878  assume P: ?P  nipkow@13189  879  show ?Q  nipkow@13189  880  proof (cases)  nipkow@13189  881  assume "k = 0"  haftmann@27651  882  with P show ?Q by simp  nipkow@13189  883  next  nipkow@13189  884  assume not0: "k \ 0"  nipkow@13189  885  thus ?Q  nipkow@13189  886  proof (simp, intro allI impI)  nipkow@13189  887  fix i j  nipkow@13189  888  assume n: "n = k*i + j" and j: "j < k"  nipkow@13189  889  show "P i"  nipkow@13189  890  proof (cases)  wenzelm@22718  891  assume "i = 0"  wenzelm@22718  892  with n j P show "P i" by simp  nipkow@13189  893  next  wenzelm@22718  894  assume "i \ 0"  wenzelm@22718  895  with not0 n j P show "P i" by(simp add:add_ac)  nipkow@13189  896  qed  nipkow@13189  897  qed  nipkow@13189  898  qed  nipkow@13189  899 next  nipkow@13189  900  assume Q: ?Q  nipkow@13189  901  show ?P  nipkow@13189  902  proof (cases)  nipkow@13189  903  assume "k = 0"  haftmann@27651  904  with Q show ?P by simp  nipkow@13189  905  next  nipkow@13189  906  assume not0: "k \ 0"  nipkow@13189  907  with Q have R: ?R by simp  nipkow@13189  908  from not0 R[THEN spec,of "n div k",THEN spec, of "n mod k"]  nipkow@13517  909  show ?P by simp  nipkow@13189  910  qed  nipkow@13189  911 qed  nipkow@13189  912 berghofe@13882  913 lemma split_div_lemma:  haftmann@26100  914  assumes "0 < n"  haftmann@26100  915  shows "n * q \ m \ m < n * Suc q \ q = ((m\nat) div n)" (is "?lhs \ ?rhs")  haftmann@26100  916 proof  haftmann@26100  917  assume ?rhs  haftmann@26100  918  with mult_div_cancel have nq: "n * q = m - (m mod n)" by simp  haftmann@26100  919  then have A: "n * q \ m" by simp  haftmann@26100  920  have "n - (m mod n) > 0" using mod_less_divisor assms by auto  haftmann@26100  921  then have "m < m + (n - (m mod n))" by simp  haftmann@26100  922  then have "m < n + (m - (m mod n))" by simp  haftmann@26100  923  with nq have "m < n + n * q" by simp  haftmann@26100  924  then have B: "m < n * Suc q" by simp  haftmann@26100  925  from A B show ?lhs ..  haftmann@26100  926 next  haftmann@26100  927  assume P: ?lhs  haftmann@33340  928  then have "divmod_nat_rel m n (q, m - n * q)"  haftmann@33340  929  unfolding divmod_nat_rel_def by (auto simp add: mult_ac)  haftmann@33340  930  with divmod_nat_rel_unique divmod_nat_rel [of m n]  haftmann@30923  931  have "(q, m - n * q) = (m div n, m mod n)" by auto  haftmann@30923  932  then show ?rhs by simp  haftmann@26100  933 qed  berghofe@13882  934 berghofe@13882  935 theorem split_div':  berghofe@13882  936  "P ((m::nat) div n) = ((n = 0 \ P 0) \  paulson@14267  937  (\q. (n * q \ m \ m < n * (Suc q)) \ P q))"  berghofe@13882  938  apply (case_tac "0 < n")  berghofe@13882  939  apply (simp only: add: split_div_lemma)  haftmann@27651  940  apply simp_all  berghofe@13882  941  done  berghofe@13882  942 nipkow@13189  943 lemma split_mod:  nipkow@13189  944  "P(n mod k :: nat) =  nipkow@13189  945  ((k = 0 \ P n) \ (k \ 0 \ (!i. !j P j)))"  nipkow@13189  946  (is "?P = ?Q" is "_ = (_ \ (_ \ ?R))")  nipkow@13189  947 proof  nipkow@13189  948  assume P: ?P  nipkow@13189  949  show ?Q  nipkow@13189  950  proof (cases)  nipkow@13189  951  assume "k = 0"  haftmann@27651  952  with P show ?Q by simp  nipkow@13189  953  next  nipkow@13189  954  assume not0: "k \ 0"  nipkow@13189  955  thus ?Q  nipkow@13189  956  proof (simp, intro allI impI)  nipkow@13189  957  fix i j  nipkow@13189  958  assume "n = k*i + j" "j < k"  nipkow@13189  959  thus "P j" using not0 P by(simp add:add_ac mult_ac)  nipkow@13189  960  qed  nipkow@13189  961  qed  nipkow@13189  962 next  nipkow@13189  963  assume Q: ?Q  nipkow@13189  964  show ?P  nipkow@13189  965  proof (cases)  nipkow@13189  966  assume "k = 0"  haftmann@27651  967  with Q show ?P by simp  nipkow@13189  968  next  nipkow@13189  969  assume not0: "k \ 0"  nipkow@13189  970  with Q have R: ?R by simp  nipkow@13189  971  from not0 R[THEN spec,of "n div k",THEN spec, of "n mod k"]  nipkow@13517  972  show ?P by simp  nipkow@13189  973  qed  nipkow@13189  974 qed  nipkow@13189  975 berghofe@13882  976 theorem mod_div_equality': "(m::nat) mod n = m - (m div n) * n"  berghofe@13882  977  apply (rule_tac P="%x. m mod n = x - (m div n) * n" in  berghofe@13882  978  subst [OF mod_div_equality [of _ n]])  berghofe@13882  979  apply arith  berghofe@13882  980  done  berghofe@13882  981 haftmann@22800  982 lemma div_mod_equality':  haftmann@22800  983  fixes m n :: nat  haftmann@22800  984  shows "m div n * n = m - m mod n"  haftmann@22800  985 proof -  haftmann@22800  986  have "m mod n \ m mod n" ..  haftmann@22800  987  from div_mod_equality have  haftmann@22800  988  "m div n * n + m mod n - m mod n = m - m mod n" by simp  haftmann@22800  989  with diff_add_assoc [OF m mod n \ m mod n, of "m div n * n"] have  haftmann@22800  990  "m div n * n + (m mod n - m mod n) = m - m mod n"  haftmann@22800  991  by simp  haftmann@22800  992  then show ?thesis by simp  haftmann@22800  993 qed  haftmann@22800  994 haftmann@22800  995 haftmann@25942  996 subsubsection {*An induction'' law for modulus arithmetic.*}  paulson@14640  997 paulson@14640  998 lemma mod_induct_0:  paulson@14640  999  assumes step: "\i P ((Suc i) mod p)"  paulson@14640  1000  and base: "P i" and i: "i(P 0)"  paulson@14640  1004  from i have p: "0k. 0 \ P (p-k)" (is "\k. ?A k")  paulson@14640  1006  proof  paulson@14640  1007  fix k  paulson@14640  1008  show "?A k"  paulson@14640  1009  proof (induct k)  paulson@14640  1010  show "?A 0" by simp -- "by contradiction"  paulson@14640  1011  next  paulson@14640  1012  fix n  paulson@14640  1013  assume ih: "?A n"  paulson@14640  1014  show "?A (Suc n)"  paulson@14640  1015  proof (clarsimp)  wenzelm@22718  1016  assume y: "P (p - Suc n)"  wenzelm@22718  1017  have n: "Suc n < p"  wenzelm@22718  1018  proof (rule ccontr)  wenzelm@22718  1019  assume "$$Suc n < p)"  wenzelm@22718  1020  hence "p - Suc n = 0"  wenzelm@22718  1021  by simp  wenzelm@22718  1022  with y contra show "False"  wenzelm@22718  1023  by simp  wenzelm@22718  1024  qed  wenzelm@22718  1025  hence n2: "Suc (p - Suc n) = p-n" by arith  wenzelm@22718  1026  from p have "p - Suc n < p" by arith  wenzelm@22718  1027  with y step have z: "P ((Suc (p - Suc n)) mod p)"  wenzelm@22718  1028  by blast  wenzelm@22718  1029  show "False"  wenzelm@22718  1030  proof (cases "n=0")  wenzelm@22718  1031  case True  wenzelm@22718  1032  with z n2 contra show ?thesis by simp  wenzelm@22718  1033  next  wenzelm@22718  1034  case False  wenzelm@22718  1035  with p have "p-n < p" by arith  wenzelm@22718  1036  with z n2 False ih show ?thesis by simp  wenzelm@22718  1037  qed  paulson@14640  1038  qed  paulson@14640  1039  qed  paulson@14640  1040  qed  paulson@14640  1041  moreover  paulson@14640  1042  from i obtain k where "0 i+k=p"  paulson@14640  1043  by (blast dest: less_imp_add_positive)  paulson@14640  1044  hence "0 i=p-k" by auto  paulson@14640  1045  moreover  paulson@14640  1046  note base  paulson@14640  1047  ultimately  paulson@14640  1048  show "False" by blast  paulson@14640  1049 qed  paulson@14640  1050 paulson@14640  1051 lemma mod_induct:  paulson@14640  1052  assumes step: "\i P ((Suc i) mod p)"  paulson@14640  1053  and base: "P i" and i: "ij P j" (is "?A j")  paulson@14640  1060  proof (induct j)  paulson@14640  1061  from step base i show "?A 0"  wenzelm@22718  1062  by (auto elim: mod_induct_0)  paulson@14640  1063  next  paulson@14640  1064  fix k  paulson@14640  1065  assume ih: "?A k"  paulson@14640  1066  show "?A (Suc k)"  paulson@14640  1067  proof  wenzelm@22718  1068  assume suc: "Suc k < p"  wenzelm@22718  1069  hence k: "knat) mod 2 \ m mod 2 = 1"  haftmann@33296  1097 proof -  haftmann@33296  1098  { fix n :: nat have "(n::nat) < 2 \ n = 0 \ n = 1" by (induct n) simp_all }  haftmann@33296  1099  moreover have "m mod 2 < 2" by simp  haftmann@33296  1100  ultimately have "m mod 2 = 0 \ m mod 2 = 1" .  haftmann@33296  1101  then show ?thesis by auto  haftmann@33296  1102 qed  haftmann@33296  1103 haftmann@33296  1104 text{*These lemmas collapse some needless occurrences of Suc:  haftmann@33296  1105  at least three Sucs, since two and fewer are rewritten back to Suc again!  haftmann@33296  1106  We already have some rules to simplify operands smaller than 3.*}  haftmann@33296  1107 haftmann@33296  1108 lemma div_Suc_eq_div_add3 [simp]: "m div (Suc (Suc (Suc n))) = m div (3+n)"  haftmann@33296  1109 by (simp add: Suc3_eq_add_3)  haftmann@33296  1110 haftmann@33296  1111 lemma mod_Suc_eq_mod_add3 [simp]: "m mod (Suc (Suc (Suc n))) = m mod (3+n)"  haftmann@33296  1112 by (simp add: Suc3_eq_add_3)  haftmann@33296  1113 haftmann@33296  1114 lemma Suc_div_eq_add3_div: "(Suc (Suc (Suc m))) div n = (3+m) div n"  haftmann@33296  1115 by (simp add: Suc3_eq_add_3)  haftmann@33296  1116 haftmann@33296  1117 lemma Suc_mod_eq_add3_mod: "(Suc (Suc (Suc m))) mod n = (3+m) mod n"  haftmann@33296  1118 by (simp add: Suc3_eq_add_3)  haftmann@33296  1119 haftmann@33296  1120 lemmas Suc_div_eq_add3_div_number_of =  haftmann@33296  1121  Suc_div_eq_add3_div [of _ "number_of v", standard]  haftmann@33296  1122 declare Suc_div_eq_add3_div_number_of [simp]  haftmann@33296  1123 haftmann@33296  1124 lemmas Suc_mod_eq_add3_mod_number_of =  haftmann@33296  1125  Suc_mod_eq_add3_mod [of _ "number_of v", standard]  haftmann@33296  1126 declare Suc_mod_eq_add3_mod_number_of [simp]  haftmann@33296  1127 haftmann@33361  1128 haftmann@33361  1129 lemma Suc_times_mod_eq: "1 Suc (k * m) mod k = 1"  haftmann@33361  1130 apply (induct "m")  haftmann@33361  1131 apply (simp_all add: mod_Suc)  haftmann@33361  1132 done  haftmann@33361  1133 haftmann@33361  1134 declare Suc_times_mod_eq [of "number_of w", standard, simp]  haftmann@33361  1135 haftmann@33361  1136 lemma [simp]: "n div k \ (Suc n) div k"  haftmann@33361  1137 by (simp add: div_le_mono)  haftmann@33361  1138 haftmann@33361  1139 lemma Suc_n_div_2_gt_zero [simp]: "(0::nat) < n ==> 0 < (n + 1) div 2"  haftmann@33361  1140 by (cases n) simp_all  haftmann@33361  1141 haftmann@33361  1142 lemma div_2_gt_zero [simp]: "(1::nat) < n ==> 0 < n div 2"  haftmann@33361  1143 using Suc_n_div_2_gt_zero [of "n - 1"] by simp  haftmann@33361  1144 haftmann@33361  1145  (* Potential use of algebra : Equality modulo n*)  haftmann@33361  1146 lemma mod_mult_self3 [simp]: "(k*n + m) mod n = m mod (n::nat)"  haftmann@33361  1147 by (simp add: mult_ac add_ac)  haftmann@33361  1148 haftmann@33361  1149 lemma mod_mult_self4 [simp]: "Suc (k*n + m) mod n = Suc m mod n"  haftmann@33361  1150 proof -  haftmann@33361  1151  have "Suc (k * n + m) mod n = (k * n + Suc m) mod n" by simp  haftmann@33361  1152  also have "... = Suc m mod n" by (rule mod_mult_self3)  haftmann@33361  1153  finally show ?thesis .  haftmann@33361  1154 qed  haftmann@33361  1155 haftmann@33361  1156 lemma mod_Suc_eq_Suc_mod: "Suc m mod n = Suc (m mod n) mod n"  haftmann@33361  1157 apply (subst mod_Suc [of m])  haftmann@33361  1158 apply (subst mod_Suc [of "m mod n"], simp)  haftmann@33361  1159 done  haftmann@33361  1160 haftmann@33361  1161 haftmann@33361  1162 subsection {* Division on @{typ int} *}  haftmann@33361  1163 haftmann@33361  1164 definition divmod_int_rel :: "int \ int \ int \ int \ bool" where  haftmann@33361  1165  --{*definition of quotient and remainder*}  haftmann@33361  1166  [code]: "divmod_int_rel a b = (\(q, r). a = b * q + r \  haftmann@33361  1167  (if 0 < b then 0 \ r \ r < b else b < r \ r \ 0))"  haftmann@33361  1168 haftmann@33361  1169 definition adjust :: "int \ int \ int \ int \ int" where  haftmann@33361  1170  --{*for the division algorithm*}  haftmann@33361  1171  [code]: "adjust b = (\(q, r). if 0 \ r - b then (2 * q + 1, r - b)  haftmann@33361  1172  else (2 * q, r))"  haftmann@33361  1173 haftmann@33361  1174 text{*algorithm for the case @{text "a\0, b>0"}*}  haftmann@33361  1175 function posDivAlg :: "int \ int \ int \ int" where  haftmann@33361  1176  "posDivAlg a b = (if a < b \ b \ 0 then (0, a)  haftmann@33361  1177  else adjust b (posDivAlg a (2 * b)))"  haftmann@33361  1178 by auto  haftmann@33361  1179 termination by (relation "measure (\(a, b). nat (a - b + 1))")  haftmann@33361  1180  (auto simp add: mult_2)  haftmann@33361  1181 haftmann@33361  1182 text{*algorithm for the case @{text "a<0, b>0"}*}  haftmann@33361  1183 function negDivAlg :: "int \ int \ int \ int" where  haftmann@33361  1184  "negDivAlg a b = (if 0 \a + b \ b \ 0 then (-1, a + b)  haftmann@33361  1185  else adjust b (negDivAlg a (2 * b)))"  haftmann@33361  1186 by auto  haftmann@33361  1187 termination by (relation "measure (\(a, b). nat (- a - b))")  haftmann@33361  1188  (auto simp add: mult_2)  haftmann@33361  1189 haftmann@33361  1190 text{*algorithm for the general case @{term "b\0"}*}  haftmann@33361  1191 definition negateSnd :: "int \ int \ int \ int" where  haftmann@33361  1192  [code_unfold]: "negateSnd = apsnd uminus"  haftmann@33361  1193 haftmann@33361  1194 definition divmod_int :: "int \ int \ int \ int" where  haftmann@33361  1195  --{*The full division algorithm considers all possible signs for a, b  haftmann@33361  1196  including the special case @{text "a=0, b<0"} because  haftmann@33361  1197  @{term negDivAlg} requires @{term "a<0"}.*}  haftmann@33361  1198  "divmod_int a b = (if 0 \ a then if 0 \ b then posDivAlg a b  haftmann@33361  1199  else if a = 0 then (0, 0)  haftmann@33361  1200  else negateSnd (negDivAlg (-a) (-b))  haftmann@33361  1201  else  haftmann@33361  1202  if 0 < b then negDivAlg a b  haftmann@33361  1203  else negateSnd (posDivAlg (-a) (-b)))"  haftmann@33361  1204 haftmann@33361  1205 instantiation int :: Divides.div  haftmann@33361  1206 begin  haftmann@33361  1207 haftmann@33361  1208 definition  haftmann@33361  1209  "a div b = fst (divmod_int a b)"  haftmann@33361  1210 haftmann@33361  1211 definition  haftmann@33361  1212  "a mod b = snd (divmod_int a b)"  haftmann@33361  1213 haftmann@33361  1214 instance ..  haftmann@33361  1215 paulson@3366  1216 end  haftmann@33361  1217 haftmann@33361  1218 lemma divmod_int_mod_div:  haftmann@33361  1219  "divmod_int p q = (p div q, p mod q)"  haftmann@33361  1220  by (auto simp add: div_int_def mod_int_def)  haftmann@33361  1221 haftmann@33361  1222 text{*  haftmann@33361  1223 Here is the division algorithm in ML:  haftmann@33361  1224 haftmann@33361  1225 \begin{verbatim}  haftmann@33361  1226  fun posDivAlg (a,b) =  haftmann@33361  1227  if ar-b then (2*q+1, r-b) else (2*q, r)  haftmann@33361  1230  end  haftmann@33361  1231 haftmann@33361  1232  fun negDivAlg (a,b) =  haftmann@33361  1233  if 0\a+b then (~1,a+b)  haftmann@33361  1234  else let val (q,r) = negDivAlg(a, 2*b)  haftmann@33361  1235  in if 0\r-b then (2*q+1, r-b) else (2*q, r)  haftmann@33361  1236  end;  haftmann@33361  1237 haftmann@33361  1238  fun negateSnd (q,r:int) = (q,~r);  haftmann@33361  1239 haftmann@33361  1240  fun divmod (a,b) = if 0\a then  haftmann@33361  1241  if b>0 then posDivAlg (a,b)  haftmann@33361  1242  else if a=0 then (0,0)  haftmann@33361  1243  else negateSnd (negDivAlg (~a,~b))  haftmann@33361  1244  else  haftmann@33361  1245  if 0 b*q + r; 0 \ r'; r' < b; r < b |]  haftmann@33361  1256  ==> q' \ (q::int)"  haftmann@33361  1257 apply (subgoal_tac "r' + b * (q'-q) \ r")  haftmann@33361  1258  prefer 2 apply (simp add: right_diff_distrib)  haftmann@33361  1259 apply (subgoal_tac "0 < b * (1 + q - q') ")  haftmann@33361  1260 apply (erule_tac [2] order_le_less_trans)  haftmann@33361  1261  prefer 2 apply (simp add: right_diff_distrib right_distrib)  haftmann@33361  1262 apply (subgoal_tac "b * q' < b * (1 + q) ")  haftmann@33361  1263  prefer 2 apply (simp add: right_diff_distrib right_distrib)  haftmann@33361  1264 apply (simp add: mult_less_cancel_left)  haftmann@33361  1265 done  haftmann@33361  1266 haftmann@33361  1267 lemma unique_quotient_lemma_neg:  haftmann@33361  1268  "[| b*q' + r' \ b*q + r; r \ 0; b < r; b < r' |]  haftmann@33361  1269  ==> q \ (q'::int)"  haftmann@33361  1270 by (rule_tac b = "-b" and r = "-r'" and r' = "-r" in unique_quotient_lemma,  haftmann@33361  1271  auto)  haftmann@33361  1272 haftmann@33361  1273 lemma unique_quotient:  haftmann@33361  1274  "[| divmod_int_rel a b (q, r); divmod_int_rel a b (q', r'); b \ 0 |]  haftmann@33361  1275  ==> q = q'"  haftmann@33361  1276 apply (simp add: divmod_int_rel_def linorder_neq_iff split: split_if_asm)  haftmann@33361  1277 apply (blast intro: order_antisym  haftmann@33361  1278  dest: order_eq_refl [THEN unique_quotient_lemma]  haftmann@33361  1279  order_eq_refl [THEN unique_quotient_lemma_neg] sym)+  haftmann@33361  1280 done  haftmann@33361  1281 haftmann@33361  1282 haftmann@33361  1283 lemma unique_remainder:  haftmann@33361  1284  "[| divmod_int_rel a b (q, r); divmod_int_rel a b (q', r'); b \ 0 |]  haftmann@33361  1285  ==> r = r'"  haftmann@33361  1286 apply (subgoal_tac "q = q'")  haftmann@33361  1287  apply (simp add: divmod_int_rel_def)  haftmann@33361  1288 apply (blast intro: unique_quotient)  haftmann@33361  1289 done  haftmann@33361  1290 haftmann@33361  1291 haftmann@33361  1292 subsubsection{*Correctness of @{term posDivAlg}, the Algorithm for Non-Negative Dividends*}  haftmann@33361  1293 haftmann@33361  1294 text{*And positive divisors*}  haftmann@33361  1295 haftmann@33361  1296 lemma adjust_eq [simp]:  haftmann@33361  1297  "adjust b (q,r) =  haftmann@33361  1298  (let diff = r-b in  haftmann@33361  1299  if 0 \ diff then (2*q + 1, diff)  haftmann@33361  1300  else (2*q, r))"  haftmann@33361  1301 by (simp add: Let_def adjust_def)  haftmann@33361  1302 haftmann@33361  1303 declare posDivAlg.simps [simp del]  haftmann@33361  1304 haftmann@33361  1305 text{*use with a simproc to avoid repeatedly proving the premise*}  haftmann@33361  1306 lemma posDivAlg_eqn:  haftmann@33361  1307  "0 < b ==>  haftmann@33361  1308  posDivAlg a b = (if a a" and "0 < b"  haftmann@33361  1314  shows "divmod_int_rel a b (posDivAlg a b)"  haftmann@33361  1315 using prems apply (induct a b rule: posDivAlg.induct)  haftmann@33361  1316 apply auto  haftmann@33361  1317 apply (simp add: divmod_int_rel_def)  haftmann@33361  1318 apply (subst posDivAlg_eqn, simp add: right_distrib)  haftmann@33361  1319 apply (case_tac "a < b")  haftmann@33361  1320 apply simp_all  haftmann@33361  1321 apply (erule splitE)  haftmann@33361  1322 apply (auto simp add: right_distrib Let_def mult_ac mult_2_right)  haftmann@33361  1323 done  haftmann@33361  1324 haftmann@33361  1325 haftmann@33361  1326 subsubsection{*Correctness of @{term negDivAlg}, the Algorithm for Negative Dividends*}  haftmann@33361  1327 haftmann@33361  1328 text{*And positive divisors*}  haftmann@33361  1329 haftmann@33361  1330 declare negDivAlg.simps [simp del]  haftmann@33361  1331 haftmann@33361  1332 text{*use with a simproc to avoid repeatedly proving the premise*}  haftmann@33361  1333 lemma negDivAlg_eqn:  haftmann@33361  1334  "0 < b ==>  haftmann@33361  1335  negDivAlg a b =  haftmann@33361  1336  (if 0\a+b then (-1,a+b) else adjust b (negDivAlg a (2*b)))"  haftmann@33361  1337 by (rule negDivAlg.simps [THEN trans], simp)  haftmann@33361  1338 haftmann@33361  1339 (*Correctness of negDivAlg: it computes quotients correctly  haftmann@33361  1340  It doesn't work if a=0 because the 0/b equals 0, not -1*)  haftmann@33361  1341 lemma negDivAlg_correct:  haftmann@33361  1342  assumes "a < 0" and "b > 0"  haftmann@33361  1343  shows "divmod_int_rel a b (negDivAlg a b)"  haftmann@33361  1344 using prems apply (induct a b rule: negDivAlg.induct)  haftmann@33361  1345 apply (auto simp add: linorder_not_le)  haftmann@33361  1346 apply (simp add: divmod_int_rel_def)  haftmann@33361  1347 apply (subst negDivAlg_eqn, assumption)  haftmann@33361  1348 apply (case_tac "a + b < (0\int)")  haftmann@33361  1349 apply simp_all  haftmann@33361  1350 apply (erule splitE)  haftmann@33361  1351 apply (auto simp add: right_distrib Let_def mult_ac mult_2_right)  haftmann@33361  1352 done  haftmann@33361  1353 haftmann@33361  1354 haftmann@33361  1355 subsubsection{*Existence Shown by Proving the Division Algorithm to be Correct*}  haftmann@33361  1356 haftmann@33361  1357 (*the case a=0*)  haftmann@33361  1358 lemma divmod_int_rel_0: "b \ 0 ==> divmod_int_rel 0 b (0, 0)"  haftmann@33361  1359 by (auto simp add: divmod_int_rel_def linorder_neq_iff)  haftmann@33361  1360 haftmann@33361  1361 lemma posDivAlg_0 [simp]: "posDivAlg 0 b = (0, 0)"  haftmann@33361  1362 by (subst posDivAlg.simps, auto)  haftmann@33361  1363 haftmann@33361  1364 lemma negDivAlg_minus1 [simp]: "negDivAlg -1 b = (-1, b - 1)"  haftmann@33361  1365 by (subst negDivAlg.simps, auto)  haftmann@33361  1366 haftmann@33361  1367 lemma negateSnd_eq [simp]: "negateSnd(q,r) = (q,-r)"  haftmann@33361  1368 by (simp add: negateSnd_def)  haftmann@33361  1369 haftmann@33361  1370 lemma divmod_int_rel_neg: "divmod_int_rel (-a) (-b) qr ==> divmod_int_rel a b (negateSnd qr)"  haftmann@33361  1371 by (auto simp add: split_ifs divmod_int_rel_def)  haftmann@33361  1372 haftmann@33361  1373 lemma divmod_int_correct: "b \ 0 ==> divmod_int_rel a b (divmod_int a b)"  haftmann@33361  1374 by (force simp add: linorder_neq_iff divmod_int_rel_0 divmod_int_def divmod_int_rel_neg  haftmann@33361  1375  posDivAlg_correct negDivAlg_correct)  haftmann@33361  1376 haftmann@33361  1377 text{*Arbitrary definitions for division by zero. Useful to simplify  haftmann@33361  1378  certain equations.*}  haftmann@33361  1379 haftmann@33361  1380 lemma DIVISION_BY_ZERO [simp]: "a div (0::int) = 0 & a mod (0::int) = a"  haftmann@33361  1381 by (simp add: div_int_def mod_int_def divmod_int_def posDivAlg.simps)  haftmann@33361  1382 haftmann@33361  1383 haftmann@33361  1384 text{*Basic laws about division and remainder*}  haftmann@33361  1385 haftmann@33361  1386 lemma zmod_zdiv_equality: "(a::int) = b * (a div b) + (a mod b)"  haftmann@33361  1387 apply (case_tac "b = 0", simp)  haftmann@33361  1388 apply (cut_tac a = a and b = b in divmod_int_correct)  haftmann@33361  1389 apply (auto simp add: divmod_int_rel_def div_int_def mod_int_def)  haftmann@33361  1390 done  haftmann@33361  1391 haftmann@33361  1392 lemma zdiv_zmod_equality: "(b * (a div b) + (a mod b)) + k = (a::int)+k"  haftmann@33361  1393 by(simp add: zmod_zdiv_equality[symmetric])  haftmann@33361  1394 haftmann@33361  1395 lemma zdiv_zmod_equality2: "((a div b) * b + (a mod b)) + k = (a::int)+k"  haftmann@33361  1396 by(simp add: mult_commute zmod_zdiv_equality[symmetric])  haftmann@33361  1397 haftmann@33361  1398 text {* Tool setup *}  haftmann@33361  1399 haftmann@33361  1400 ML {*  haftmann@33361  1401 local  haftmann@33361  1402 haftmann@33361  1403 structure CancelDivMod = CancelDivModFun(struct  haftmann@33361  1404 haftmann@33361  1405  val div_name = @{const_name div};  haftmann@33361  1406  val mod_name = @{const_name mod};  haftmann@33361  1407  val mk_binop = HOLogic.mk_binop;  haftmann@33361  1408  val mk_sum = Arith_Data.mk_sum HOLogic.intT;  haftmann@33361  1409  val dest_sum = Arith_Data.dest_sum;  haftmann@33361  1410 haftmann@33361  1411  val div_mod_eqs = map mk_meta_eq [@{thm zdiv_zmod_equality}, @{thm zdiv_zmod_equality2}];  haftmann@33361  1412 haftmann@33361  1413  val trans = trans;  haftmann@33361  1414 haftmann@33361  1415  val prove_eq_sums = Arith_Data.prove_conv2 all_tac (Arith_Data.simp_all_tac  haftmann@33361  1416  (@{thm diff_minus} :: @{thms add_0s} @ @{thms add_ac}))  haftmann@33361  1417 haftmann@33361  1418 end)  haftmann@33361  1419 haftmann@33361  1420 in  haftmann@33361  1421 haftmann@33361  1422 val cancel_div_mod_int_proc = Simplifier.simproc @{theory}  haftmann@33361  1423  "cancel_zdiv_zmod" ["(k::int) + l"] (K CancelDivMod.proc);  haftmann@33361  1424 haftmann@33361  1425 val _ = Addsimprocs [cancel_div_mod_int_proc];  haftmann@33361  1426 haftmann@33361  1427 end  haftmann@33361  1428 *}  haftmann@33361  1429 haftmann@33361  1430 lemma pos_mod_conj : "(0::int) < b ==> 0 \ a mod b & a mod b < b"  haftmann@33361  1431 apply (cut_tac a = a and b = b in divmod_int_correct)  haftmann@33361  1432 apply (auto simp add: divmod_int_rel_def mod_int_def)  haftmann@33361  1433 done  haftmann@33361  1434 haftmann@33361  1435 lemmas pos_mod_sign [simp] = pos_mod_conj [THEN conjunct1, standard]  haftmann@33361  1436  and pos_mod_bound [simp] = pos_mod_conj [THEN conjunct2, standard]  haftmann@33361  1437 haftmann@33361  1438 lemma neg_mod_conj : "b < (0::int) ==> a mod b \ 0 & b < a mod b"  haftmann@33361  1439 apply (cut_tac a = a and b = b in divmod_int_correct)  haftmann@33361  1440 apply (auto simp add: divmod_int_rel_def div_int_def mod_int_def)  haftmann@33361  1441 done  haftmann@33361  1442 haftmann@33361  1443 lemmas neg_mod_sign [simp] = neg_mod_conj [THEN conjunct1, standard]  haftmann@33361  1444  and neg_mod_bound [simp] = neg_mod_conj [THEN conjunct2, standard]  haftmann@33361  1445 haftmann@33361  1446 haftmann@33361  1447 haftmann@33361  1448 subsubsection{*General Properties of div and mod*}  haftmann@33361  1449 haftmann@33361  1450 lemma divmod_int_rel_div_mod: "b \ 0 ==> divmod_int_rel a b (a div b, a mod b)"  haftmann@33361  1451 apply (cut_tac a = a and b = b in zmod_zdiv_equality)  haftmann@33361  1452 apply (force simp add: divmod_int_rel_def linorder_neq_iff)  haftmann@33361  1453 done  haftmann@33361  1454 haftmann@33361  1455 lemma divmod_int_rel_div: "[| divmod_int_rel a b (q, r); b \ 0 |] ==> a div b = q"  haftmann@33361  1456 by (simp add: divmod_int_rel_div_mod [THEN unique_quotient])  haftmann@33361  1457 haftmann@33361  1458 lemma divmod_int_rel_mod: "[| divmod_int_rel a b (q, r); b \ 0 |] ==> a mod b = r"  haftmann@33361  1459 by (simp add: divmod_int_rel_div_mod [THEN unique_remainder])  haftmann@33361  1460 haftmann@33361  1461 lemma div_pos_pos_trivial: "[| (0::int) \ a; a < b |] ==> a div b = 0"  haftmann@33361  1462 apply (rule divmod_int_rel_div)  haftmann@33361  1463 apply (auto simp add: divmod_int_rel_def)  haftmann@33361  1464 done  haftmann@33361  1465 haftmann@33361  1466 lemma div_neg_neg_trivial: "[| a \ (0::int); b < a |] ==> a div b = 0"  haftmann@33361  1467 apply (rule divmod_int_rel_div)  haftmann@33361  1468 apply (auto simp add: divmod_int_rel_def)  haftmann@33361  1469 done  haftmann@33361  1470 haftmann@33361  1471 lemma div_pos_neg_trivial: "[| (0::int) < a; a+b \ 0 |] ==> a div b = -1"  haftmann@33361  1472 apply (rule divmod_int_rel_div)  haftmann@33361  1473 apply (auto simp add: divmod_int_rel_def)  haftmann@33361  1474 done  haftmann@33361  1475 haftmann@33361  1476 (*There is no div_neg_pos_trivial because 0 div b = 0 would supersede it*)  haftmann@33361  1477 haftmann@33361  1478 lemma mod_pos_pos_trivial: "[| (0::int) \ a; a < b |] ==> a mod b = a"  haftmann@33361  1479 apply (rule_tac q = 0 in divmod_int_rel_mod)  haftmann@33361  1480 apply (auto simp add: divmod_int_rel_def)  haftmann@33361  1481 done  haftmann@33361  1482 haftmann@33361  1483 lemma mod_neg_neg_trivial: "[| a \ (0::int); b < a |] ==> a mod b = a"  haftmann@33361  1484 apply (rule_tac q = 0 in divmod_int_rel_mod)  haftmann@33361  1485 apply (auto simp add: divmod_int_rel_def)  haftmann@33361  1486 done  haftmann@33361  1487 haftmann@33361  1488 lemma mod_pos_neg_trivial: "[| (0::int) < a; a+b \ 0 |] ==> a mod b = a+b"  haftmann@33361  1489 apply (rule_tac q = "-1" in divmod_int_rel_mod)  haftmann@33361  1490 apply (auto simp add: divmod_int_rel_def)  haftmann@33361  1491 done  haftmann@33361  1492 haftmann@33361  1493 text{*There is no @{text mod_neg_pos_trivial}.*}  haftmann@33361  1494 haftmann@33361  1495 haftmann@33361  1496 (*Simpler laws such as -a div b = -(a div b) FAIL, but see just below*)  haftmann@33361  1497 lemma zdiv_zminus_zminus [simp]: "(-a) div (-b) = a div (b::int)"  haftmann@33361  1498 apply (case_tac "b = 0", simp)  haftmann@33361  1499 apply (simp add: divmod_int_rel_div_mod [THEN divmod_int_rel_neg, simplified,  haftmann@33361  1500  THEN divmod_int_rel_div, THEN sym])  haftmann@33361  1501 haftmann@33361  1502 done  haftmann@33361  1503 haftmann@33361  1504 (*Simpler laws such as -a mod b = -(a mod b) FAIL, but see just below*)  haftmann@33361  1505 lemma zmod_zminus_zminus [simp]: "(-a) mod (-b) = - (a mod (b::int))"  haftmann@33361  1506 apply (case_tac "b = 0", simp)  haftmann@33361  1507 apply (subst divmod_int_rel_div_mod [THEN divmod_int_rel_neg, simplified, THEN divmod_int_rel_mod],  haftmann@33361  1508  auto)  haftmann@33361  1509 done  haftmann@33361  1510 haftmann@33361  1511 haftmann@33361  1512 subsubsection{*Laws for div and mod with Unary Minus*}  haftmann@33361  1513 haftmann@33361  1514 lemma zminus1_lemma:  haftmann@33361  1515  "divmod_int_rel a b (q, r)  haftmann@33361  1516  ==> divmod_int_rel (-a) b (if r=0 then -q else -q - 1,  haftmann@33361  1517  if r=0 then 0 else b-r)"  haftmann@33361  1518 by (force simp add: split_ifs divmod_int_rel_def linorder_neq_iff right_diff_distrib)  haftmann@33361  1519 haftmann@33361  1520 haftmann@33361  1521 lemma zdiv_zminus1_eq_if:  haftmann@33361  1522  "b \ (0::int)  haftmann@33361  1523  ==> (-a) div b =  haftmann@33361  1524  (if a mod b = 0 then - (a div b) else - (a div b) - 1)"  haftmann@33361  1525 by (blast intro: divmod_int_rel_div_mod [THEN zminus1_lemma, THEN divmod_int_rel_div])  haftmann@33361  1526 haftmann@33361  1527 lemma zmod_zminus1_eq_if:  haftmann@33361  1528  "(-a::int) mod b = (if a mod b = 0 then 0 else b - (a mod b))"  haftmann@33361  1529 apply (case_tac "b = 0", simp)  haftmann@33361  1530 apply (blast intro: divmod_int_rel_div_mod [THEN zminus1_lemma, THEN divmod_int_rel_mod])  haftmann@33361  1531 done  haftmann@33361  1532 haftmann@33361  1533 lemma zmod_zminus1_not_zero:  haftmann@33361  1534  fixes k l :: int  haftmann@33361  1535  shows "- k mod l \ 0 \ k mod l \ 0"  haftmann@33361  1536  unfolding zmod_zminus1_eq_if by auto  haftmann@33361  1537 haftmann@33361  1538 lemma zdiv_zminus2: "a div (-b) = (-a::int) div b"  haftmann@33361  1539 by (cut_tac a = "-a" in zdiv_zminus_zminus, auto)  haftmann@33361  1540 haftmann@33361  1541 lemma zmod_zminus2: "a mod (-b) = - ((-a::int) mod b)"  haftmann@33361  1542 by (cut_tac a = "-a" and b = b in zmod_zminus_zminus, auto)  haftmann@33361  1543 haftmann@33361  1544 lemma zdiv_zminus2_eq_if:  haftmann@33361  1545  "b \ (0::int)  haftmann@33361  1546  ==> a div (-b) =  haftmann@33361  1547  (if a mod b = 0 then - (a div b) else - (a div b) - 1)"  haftmann@33361  1548 by (simp add: zdiv_zminus1_eq_if zdiv_zminus2)  haftmann@33361  1549 haftmann@33361  1550 lemma zmod_zminus2_eq_if:  haftmann@33361  1551  "a mod (-b::int) = (if a mod b = 0 then 0 else (a mod b) - b)"  haftmann@33361  1552 by (simp add: zmod_zminus1_eq_if zmod_zminus2)  haftmann@33361  1553 haftmann@33361  1554 lemma zmod_zminus2_not_zero:  haftmann@33361  1555  fixes k l :: int  haftmann@33361  1556  shows "k mod - l \ 0 \ k mod l \ 0"  haftmann@33361  1557  unfolding zmod_zminus2_eq_if by auto  haftmann@33361  1558 haftmann@33361  1559 haftmann@33361  1560 subsubsection{*Division of a Number by Itself*}  haftmann@33361  1561 haftmann@33361  1562 lemma self_quotient_aux1: "[| (0::int) < a; a = r + a*q; r < a |] ==> 1 \ q"  haftmann@33361  1563 apply (subgoal_tac "0 < a*q")  haftmann@33361  1564  apply (simp add: zero_less_mult_iff, arith)  haftmann@33361  1565 done  haftmann@33361  1566 haftmann@33361  1567 lemma self_quotient_aux2: "[| (0::int) < a; a = r + a*q; 0 \ r |] ==> q \ 1"  haftmann@33361  1568 apply (subgoal_tac "0 \ a* (1-q) ")  haftmann@33361  1569  apply (simp add: zero_le_mult_iff)  haftmann@33361  1570 apply (simp add: right_diff_distrib)  haftmann@33361  1571 done  haftmann@33361  1572 haftmann@33361  1573 lemma self_quotient: "[| divmod_int_rel a a (q, r); a \ (0::int) |] ==> q = 1"  haftmann@33361  1574 apply (simp add: split_ifs divmod_int_rel_def linorder_neq_iff)  haftmann@33361  1575 apply (rule order_antisym, safe, simp_all)  haftmann@33361  1576 apply (rule_tac [3] a = "-a" and r = "-r" in self_quotient_aux1)  haftmann@33361  1577 apply (rule_tac a = "-a" and r = "-r" in self_quotient_aux2)  haftmann@33361  1578 apply (force intro: self_quotient_aux1 self_quotient_aux2 simp add: add_commute)+  haftmann@33361  1579 done  haftmann@33361  1580 haftmann@33361  1581 lemma self_remainder: "[| divmod_int_rel a a (q, r); a \ (0::int) |] ==> r = 0"  haftmann@33361  1582 apply (frule self_quotient, assumption)  haftmann@33361  1583 apply (simp add: divmod_int_rel_def)  haftmann@33361  1584 done  haftmann@33361  1585 haftmann@33361  1586 lemma zdiv_self [simp]: "a \ 0 ==> a div a = (1::int)"  haftmann@33361  1587 by (simp add: divmod_int_rel_div_mod [THEN self_quotient])  haftmann@33361  1588 haftmann@33361  1589 (*Here we have 0 mod 0 = 0, also assumed by Knuth (who puts m mod 0 = 0) *)  haftmann@33361  1590 lemma zmod_self [simp]: "a mod a = (0::int)"  haftmann@33361  1591 apply (case_tac "a = 0", simp)  haftmann@33361  1592 apply (simp add: divmod_int_rel_div_mod [THEN self_remainder])  haftmann@33361  1593 done  haftmann@33361  1594 haftmann@33361  1595 haftmann@33361  1596 subsubsection{*Computation of Division and Remainder*}  haftmann@33361  1597 haftmann@33361  1598 lemma zdiv_zero [simp]: "(0::int) div b = 0"  haftmann@33361  1599 by (simp add: div_int_def divmod_int_def)  haftmann@33361  1600 haftmann@33361  1601 lemma div_eq_minus1: "(0::int) < b ==> -1 div b = -1"  haftmann@33361  1602 by (simp add: div_int_def divmod_int_def)  haftmann@33361  1603 haftmann@33361  1604 lemma zmod_zero [simp]: "(0::int) mod b = 0"  haftmann@33361  1605 by (simp add: mod_int_def divmod_int_def)  haftmann@33361  1606 haftmann@33361  1607 lemma zmod_minus1: "(0::int) < b ==> -1 mod b = b - 1"  haftmann@33361  1608 by (simp add: mod_int_def divmod_int_def)  haftmann@33361  1609 haftmann@33361  1610 text{*a positive, b positive *}  haftmann@33361  1611 haftmann@33361  1612 lemma div_pos_pos: "[| 0 < a; 0 \ b |] ==> a div b = fst (posDivAlg a b)"  haftmann@33361  1613 by (simp add: div_int_def divmod_int_def)  haftmann@33361  1614 haftmann@33361  1615 lemma mod_pos_pos: "[| 0 < a; 0 \ b |] ==> a mod b = snd (posDivAlg a b)"  haftmann@33361  1616 by (simp add: mod_int_def divmod_int_def)  haftmann@33361  1617 haftmann@33361  1618 text{*a negative, b positive *}  haftmann@33361  1619 haftmann@33361  1620 lemma div_neg_pos: "[| a < 0; 0 < b |] ==> a div b = fst (negDivAlg a b)"  haftmann@33361  1621 by (simp add: div_int_def divmod_int_def)  haftmann@33361  1622 haftmann@33361  1623 lemma mod_neg_pos: "[| a < 0; 0 < b |] ==> a mod b = snd (negDivAlg a b)"  haftmann@33361  1624 by (simp add: mod_int_def divmod_int_def)  haftmann@33361  1625 haftmann@33361  1626 text{*a positive, b negative *}  haftmann@33361  1627 haftmann@33361  1628 lemma div_pos_neg:  haftmann@33361  1629  "[| 0 < a; b < 0 |] ==> a div b = fst (negateSnd (negDivAlg (-a) (-b)))"  haftmann@33361  1630 by (simp add: div_int_def divmod_int_def)  haftmann@33361  1631 haftmann@33361  1632 lemma mod_pos_neg:  haftmann@33361  1633  "[| 0 < a; b < 0 |] ==> a mod b = snd (negateSnd (negDivAlg (-a) (-b)))"  haftmann@33361  1634 by (simp add: mod_int_def divmod_int_def)  haftmann@33361  1635 haftmann@33361  1636 text{*a negative, b negative *}  haftmann@33361  1637 haftmann@33361  1638 lemma div_neg_neg:  haftmann@33361  1639  "[| a < 0; b \ 0 |] ==> a div b = fst (negateSnd (posDivAlg (-a) (-b)))"  haftmann@33361  1640 by (simp add: div_int_def divmod_int_def)  haftmann@33361  1641 haftmann@33361  1642 lemma mod_neg_neg:  haftmann@33361  1643  "[| a < 0; b \ 0 |] ==> a mod b = snd (negateSnd (posDivAlg (-a) (-b)))"  haftmann@33361  1644 by (simp add: mod_int_def divmod_int_def)  haftmann@33361  1645 haftmann@33361  1646 text {*Simplify expresions in which div and mod combine numerical constants*}  haftmann@33361  1647 haftmann@33361  1648 lemma divmod_int_relI:  haftmann@33361  1649  "\a == b * q + r; if 0 < b then 0 \ r \ r < b else b < r \ r \ 0\  haftmann@33361  1650  \ divmod_int_rel a b (q, r)"  haftmann@33361  1651  unfolding divmod_int_rel_def by simp  haftmann@33361  1652 haftmann@33361  1653 lemmas divmod_int_rel_div_eq = divmod_int_relI [THEN divmod_int_rel_div, THEN eq_reflection]  haftmann@33361  1654 lemmas divmod_int_rel_mod_eq = divmod_int_relI [THEN divmod_int_rel_mod, THEN eq_reflection]  haftmann@33361  1655 lemmas arithmetic_simps =  haftmann@33361  1656  arith_simps  haftmann@33361  1657  add_special  haftmann@33361  1658  OrderedGroup.add_0_left  haftmann@33361  1659  OrderedGroup.add_0_right  haftmann@33361  1660  mult_zero_left  haftmann@33361  1661  mult_zero_right  haftmann@33361  1662  mult_1_left  haftmann@33361  1663  mult_1_right  haftmann@33361  1664 haftmann@33361  1665 (* simprocs adapted from HOL/ex/Binary.thy *)  haftmann@33361  1666 ML {*  haftmann@33361  1667 local  haftmann@33361  1668  val mk_number = HOLogic.mk_number HOLogic.intT;  haftmann@33361  1669  fun mk_cert u k l = @{term "plus :: int \ int \ int"}   haftmann@33361  1670  (@{term "times :: int \ int \ int"}  u  mk_number k)   haftmann@33361  1671  mk_number l;  haftmann@33361  1672  fun prove ctxt prop = Goal.prove ctxt [] [] prop  haftmann@33361  1673  (K (ALLGOALS (full_simp_tac (HOL_basic_ss addsimps @{thms arithmetic_simps}))));  haftmann@33361  1674  fun binary_proc proc ss ct =  haftmann@33361  1675  (case Thm.term_of ct of  haftmann@33361  1676  _  t  u =>  haftmann@33361  1677  (case try (pairself ((snd o HOLogic.dest_number))) (t, u) of  haftmann@33361  1678  SOME args => proc (Simplifier.the_context ss) args  haftmann@33361  1679  | NONE => NONE)  haftmann@33361  1680  | _ => NONE);  haftmann@33361  1681 in  haftmann@33361  1682  fun divmod_proc rule = binary_proc (fn ctxt => fn ((m, t), (n, u)) =>  haftmann@33361  1683  if n = 0 then NONE  haftmann@33361  1684  else let val (k, l) = Integer.div_mod m n;  haftmann@33361  1685  in SOME (rule OF [prove ctxt (Logic.mk_equals (t, mk_cert u k l))]) end);  haftmann@33361  1686 end  haftmann@33361  1687 *}  haftmann@33361  1688 haftmann@33361  1689 simproc_setup binary_int_div ("number_of m div number_of n :: int") =  haftmann@33361  1690  {* K (divmod_proc (@{thm divmod_int_rel_div_eq})) *}  haftmann@33361  1691 haftmann@33361  1692 simproc_setup binary_int_mod ("number_of m mod number_of n :: int") =  haftmann@33361  1693  {* K (divmod_proc (@{thm divmod_int_rel_mod_eq})) *}  haftmann@33361  1694 haftmann@33361  1695 lemmas posDivAlg_eqn_number_of [simp] =  haftmann@33361  1696  posDivAlg_eqn [of "number_of v" "number_of w", standard]  haftmann@33361  1697 haftmann@33361  1698 lemmas negDivAlg_eqn_number_of [simp] =  haftmann@33361  1699  negDivAlg_eqn [of "number_of v" "number_of w", standard]  haftmann@33361  1700 haftmann@33361  1701 haftmann@33361  1702 text{*Special-case simplification *}  haftmann@33361  1703 haftmann@33361  1704 lemma zmod_minus1_right [simp]: "a mod (-1::int) = 0"  haftmann@33361  1705 apply (cut_tac a = a and b = "-1" in neg_mod_sign)  haftmann@33361  1706 apply (cut_tac [2] a = a and b = "-1" in neg_mod_bound)  haftmann@33361  1707 apply (auto simp del: neg_mod_sign neg_mod_bound)  haftmann@33361  1708 done  haftmann@33361  1709 haftmann@33361  1710 lemma zdiv_minus1_right [simp]: "a div (-1::int) = -a"  haftmann@33361  1711 by (cut_tac a = a and b = "-1" in zmod_zdiv_equality, auto)  haftmann@33361  1712 haftmann@33361  1713 (** The last remaining special cases for constant arithmetic:  haftmann@33361  1714  1 div z and 1 mod z **)  haftmann@33361  1715 haftmann@33361  1716 lemmas div_pos_pos_1_number_of [simp] =  haftmann@33361  1717  div_pos_pos [OF int_0_less_1, of "number_of w", standard]  haftmann@33361  1718 haftmann@33361  1719 lemmas div_pos_neg_1_number_of [simp] =  haftmann@33361  1720  div_pos_neg [OF int_0_less_1, of "number_of w", standard]  haftmann@33361  1721 haftmann@33361  1722 lemmas mod_pos_pos_1_number_of [simp] =  haftmann@33361  1723  mod_pos_pos [OF int_0_less_1, of "number_of w", standard]  haftmann@33361  1724 haftmann@33361  1725 lemmas mod_pos_neg_1_number_of [simp] =  haftmann@33361  1726  mod_pos_neg [OF int_0_less_1, of "number_of w", standard]  haftmann@33361  1727 haftmann@33361  1728 haftmann@33361  1729 lemmas posDivAlg_eqn_1_number_of [simp] =  haftmann@33361  1730  posDivAlg_eqn [of concl: 1 "number_of w", standard]  haftmann@33361  1731 haftmann@33361  1732 lemmas negDivAlg_eqn_1_number_of [simp] =  haftmann@33361  1733  negDivAlg_eqn [of concl: 1 "number_of w", standard]  haftmann@33361  1734 haftmann@33361  1735 haftmann@33361  1736 haftmann@33361  1737 subsubsection{*Monotonicity in the First Argument (Dividend)*}  haftmann@33361  1738 haftmann@33361  1739 lemma zdiv_mono1: "[| a \ a'; 0 < (b::int) |] ==> a div b \ a' div b"  haftmann@33361  1740 apply (cut_tac a = a and b = b in zmod_zdiv_equality)  haftmann@33361  1741 apply (cut_tac a = a' and b = b in zmod_zdiv_equality)  haftmann@33361  1742 apply (rule unique_quotient_lemma)  haftmann@33361  1743 apply (erule subst)  haftmann@33361  1744 apply (erule subst, simp_all)  haftmann@33361  1745 done  haftmann@33361  1746 haftmann@33361  1747 lemma zdiv_mono1_neg: "[| a \ a'; (b::int) < 0 |] ==> a' div b \ a div b"  haftmann@33361  1748 apply (cut_tac a = a and b = b in zmod_zdiv_equality)  haftmann@33361  1749 apply (cut_tac a = a' and b = b in zmod_zdiv_equality)  haftmann@33361  1750 apply (rule unique_quotient_lemma_neg)  haftmann@33361  1751 apply (erule subst)  haftmann@33361  1752 apply (erule subst, simp_all)  haftmann@33361  1753 done  haftmann@33361  1754 haftmann@33361  1755 haftmann@33361  1756 subsubsection{*Monotonicity in the Second Argument (Divisor)*}  haftmann@33361  1757 haftmann@33361  1758 lemma q_pos_lemma:  haftmann@33361  1759  "[| 0 \ b'*q' + r'; r' < b'; 0 < b' |] ==> 0 \ (q'::int)"  haftmann@33361  1760 apply (subgoal_tac "0 < b'* (q' + 1) ")  haftmann@33361  1761  apply (simp add: zero_less_mult_iff)  haftmann@33361  1762 apply (simp add: right_distrib)  haftmann@33361  1763 done  haftmann@33361  1764 haftmann@33361  1765 lemma zdiv_mono2_lemma:  haftmann@33361  1766  "[| b*q + r = b'*q' + r'; 0 \ b'*q' + r';  haftmann@33361  1767  r' < b'; 0 \ r; 0 < b'; b' \ b |]  haftmann@33361  1768  ==> q \ (q'::int)"  haftmann@33361  1769 apply (frule q_pos_lemma, assumption+)  haftmann@33361  1770 apply (subgoal_tac "b*q < b* (q' + 1) ")  haftmann@33361  1771  apply (simp add: mult_less_cancel_left)  haftmann@33361  1772 apply (subgoal_tac "b*q = r' - r + b'*q'")  haftmann@33361  1773  prefer 2 apply simp  haftmann@33361  1774 apply (simp (no_asm_simp) add: right_distrib)  haftmann@33361  1775 apply (subst add_commute, rule zadd_zless_mono, arith)  haftmann@33361  1776 apply (rule mult_right_mono, auto)  haftmann@33361  1777 done  haftmann@33361  1778 haftmann@33361  1779 lemma zdiv_mono2:  haftmann@33361  1780  "[| (0::int) \ a; 0 < b'; b' \ b |] ==> a div b \ a div b'"  haftmann@33361  1781 apply (subgoal_tac "b \ 0")  haftmann@33361  1782  prefer 2 apply arith  haftmann@33361  1783 apply (cut_tac a = a and b = b in zmod_zdiv_equality)  haftmann@33361  1784 apply (cut_tac a = a and b = b' in zmod_zdiv_equality)  haftmann@33361  1785 apply (rule zdiv_mono2_lemma)  haftmann@33361  1786 apply (erule subst)  haftmann@33361  1787 apply (erule subst, simp_all)  haftmann@33361  1788 done  haftmann@33361  1789 haftmann@33361  1790 lemma q_neg_lemma:  haftmann@33361  1791  "[| b'*q' + r' < 0; 0 \ r'; 0 < b' |] ==> q' \ (0::int)"  haftmann@33361  1792 apply (subgoal_tac "b'*q' < 0")  haftmann@33361  1793  apply (simp add: mult_less_0_iff, arith)  haftmann@33361  1794 done  haftmann@33361  1795 haftmann@33361  1796 lemma zdiv_mono2_neg_lemma:  haftmann@33361  1797  "[| b*q + r = b'*q' + r'; b'*q' + r' < 0;  haftmann@33361  1798  r < b; 0 \ r'; 0 < b'; b' \ b |]  haftmann@33361  1799  ==> q' \ (q::int)"  haftmann@33361  1800 apply (frule q_neg_lemma, assumption+)  haftmann@33361  1801 apply (subgoal_tac "b*q' < b* (q + 1) ")  haftmann@33361  1802  apply (simp add: mult_less_cancel_left)  haftmann@33361  1803 apply (simp add: right_distrib)  haftmann@33361  1804 apply (subgoal_tac "b*q' \ b'*q'")  haftmann@33361  1805  prefer 2 apply (simp add: mult_right_mono_neg, arith)  haftmann@33361  1806 done  haftmann@33361  1807 haftmann@33361  1808 lemma zdiv_mono2_neg:  haftmann@33361  1809  "[| a < (0::int); 0 < b'; b' \ b |] ==> a div b' \ a div b"  haftmann@33361  1810 apply (cut_tac a = a and b = b in zmod_zdiv_equality)  haftmann@33361  1811 apply (cut_tac a = a and b = b' in zmod_zdiv_equality)  haftmann@33361  1812 apply (rule zdiv_mono2_neg_lemma)  haftmann@33361  1813 apply (erule subst)  haftmann@33361  1814 apply (erule subst, simp_all)  haftmann@33361  1815 done  haftmann@33361  1816 haftmann@33361  1817 haftmann@33361  1818 subsubsection{*More Algebraic Laws for div and mod*}  haftmann@33361  1819 haftmann@33361  1820 text{*proving (a*b) div c = a * (b div c) + a * (b mod c) *}  haftmann@33361  1821 haftmann@33361  1822 lemma zmult1_lemma:  haftmann@33361  1823  "[| divmod_int_rel b c (q, r); c \ 0 |]  haftmann@33361  1824  ==> divmod_int_rel (a * b) c (a*q + a*r div c, a*r mod c)"  haftmann@33361  1825 by (auto simp add: split_ifs divmod_int_rel_def linorder_neq_iff right_distrib mult_ac)  haftmann@33361  1826 haftmann@33361  1827 lemma zdiv_zmult1_eq: "(a*b) div c = a*(b div c) + a*(b mod c) div (c::int)"  haftmann@33361  1828 apply (case_tac "c = 0", simp)  haftmann@33361  1829 apply (blast intro: divmod_int_rel_div_mod [THEN zmult1_lemma, THEN divmod_int_rel_div])  haftmann@33361  1830 done  haftmann@33361  1831 haftmann@33361  1832 lemma zmod_zmult1_eq: "(a*b) mod c = a*(b mod c) mod (c::int)"  haftmann@33361  1833 apply (case_tac "c = 0", simp)  haftmann@33361  1834 apply (blast intro: divmod_int_rel_div_mod [THEN zmult1_lemma, THEN divmod_int_rel_mod])  haftmann@33361  1835 done  haftmann@33361  1836 haftmann@33361  1837 lemma zmod_zdiv_trivial: "(a mod b) div b = (0::int)"  haftmann@33361  1838 apply (case_tac "b = 0", simp)  haftmann@33361  1839 apply (auto simp add: linorder_neq_iff div_pos_pos_trivial div_neg_neg_trivial)  haftmann@33361  1840 done  haftmann@33361  1841 haftmann@33361  1842 text{*proving (a+b) div c = a div c + b div c + ((a mod c + b mod c) div c) *}  haftmann@33361  1843 haftmann@33361  1844 lemma zadd1_lemma:  haftmann@33361  1845  "[| divmod_int_rel a c (aq, ar); divmod_int_rel b c (bq, br); c \ 0 |]  haftmann@33361  1846  ==> divmod_int_rel (a+b) c (aq + bq + (ar+br) div c, (ar+br) mod c)"  haftmann@33361  1847 by (force simp add: split_ifs divmod_int_rel_def linorder_neq_iff right_distrib)  haftmann@33361  1848 haftmann@33361  1849 (*NOT suitable for rewriting: the RHS has an instance of the LHS*)  haftmann@33361  1850 lemma zdiv_zadd1_eq:  haftmann@33361  1851  "(a+b) div (c::int) = a div c + b div c + ((a mod c + b mod c) div c)"  haftmann@33361  1852 apply (case_tac "c = 0", simp)  haftmann@33361  1853 apply (blast intro: zadd1_lemma [OF divmod_int_rel_div_mod divmod_int_rel_div_mod] divmod_int_rel_div)  haftmann@33361  1854 done  haftmann@33361  1855 haftmann@33361  1856 instance int :: ring_div  haftmann@33361  1857 proof  haftmann@33361  1858  fix a b c :: int  haftmann@33361  1859  assume not0: "b \ 0"  haftmann@33361  1860  show "(a + c * b) div b = c + a div b"  haftmann@33361  1861  unfolding zdiv_zadd1_eq [of a "c * b"] using not0  haftmann@33361  1862  by (simp add: zmod_zmult1_eq zmod_zdiv_trivial zdiv_zmult1_eq)  haftmann@33361  1863 next  haftmann@33361  1864  fix a b c :: int  haftmann@33361  1865  assume "a \ 0"  haftmann@33361  1866  then show "(a * b) div (a * c) = b div c"  haftmann@33361  1867  proof (cases "b \ 0 \ c \ 0")  haftmann@33361  1868  case False then show ?thesis by auto  haftmann@33361  1869  next  haftmann@33361  1870  case True then have "b \ 0" and "c \ 0" by auto  haftmann@33361  1871  with a \ 0  haftmann@33361  1872  have "\q r. divmod_int_rel b c (q, r) \ divmod_int_rel (a * b) (a * c) (q, a * r)"  haftmann@33361  1873  apply (auto simp add: divmod_int_rel_def)  haftmann@33361  1874  apply (auto simp add: algebra_simps)  haftmann@33361  1875  apply (auto simp add: zero_less_mult_iff zero_le_mult_iff mult_le_0_iff mult_commute [of a] mult_less_cancel_right)  haftmann@33361  1876  done  haftmann@33361  1877  moreover with c \ 0 divmod_int_rel_div_mod have "divmod_int_rel b c (b div c, b mod c)" by auto  haftmann@33361  1878  ultimately have "divmod_int_rel (a * b) (a * c) (b div c, a * (b mod c))" .  haftmann@33361  1879  moreover from a \ 0 c \ 0 have "a * c \ 0" by simp  haftmann@33361  1880  ultimately show ?thesis by (rule divmod_int_rel_div)  haftmann@33361  1881  qed  haftmann@33361  1882 qed auto  haftmann@33361  1883 haftmann@33361  1884 lemma posDivAlg_div_mod:  haftmann@33361  1885  assumes "k \ 0"  haftmann@33361  1886  and "l \ 0"  haftmann@33361  1887  shows "posDivAlg k l = (k div l, k mod l)"  haftmann@33361  1888 proof (cases "l = 0")  haftmann@33361  1889  case True then show ?thesis by (simp add: posDivAlg.simps)  haftmann@33361  1890 next  haftmann@33361  1891  case False with assms posDivAlg_correct  haftmann@33361  1892  have "divmod_int_rel k l (fst (posDivAlg k l), snd (posDivAlg k l))"  haftmann@33361  1893  by simp  haftmann@33361  1894  from divmod_int_rel_div [OF this l \ 0] divmod_int_rel_mod [OF this l \ 0]  haftmann@33361  1895  show ?thesis by simp  haftmann@33361  1896 qed  haftmann@33361  1897 haftmann@33361  1898 lemma negDivAlg_div_mod:  haftmann@33361  1899  assumes "k < 0"  haftmann@33361  1900  and "l > 0"  haftmann@33361  1901  shows "negDivAlg k l = (k div l, k mod l)"  haftmann@33361  1902 proof -  haftmann@33361  1903  from assms have "l \ 0" by simp  haftmann@33361  1904  from assms negDivAlg_correct  haftmann@33361  1905  have "divmod_int_rel k l (fst (negDivAlg k l), snd (negDivAlg k l))"  haftmann@33361  1906  by simp  haftmann@33361  1907  from divmod_int_rel_div [OF this l \ 0] divmod_int_rel_mod [OF this l \ 0]  haftmann@33361  1908  show ?thesis by simp  haftmann@33361  1909 qed  haftmann@33361  1910 haftmann@33361  1911 lemma zmod_eq_0_iff: "(m mod d = 0) = (EX q::int. m = d*q)"  haftmann@33361  1912 by (simp add: dvd_eq_mod_eq_0 [symmetric] dvd_def)  haftmann@33361  1913 haftmann@33361  1914 (* REVISIT: should this be generalized to all semiring_div types? *)  haftmann@33361  1915 lemmas zmod_eq_0D [dest!] = zmod_eq_0_iff [THEN iffD1]  haftmann@33361  1916 haftmann@33361  1917 haftmann@33361  1918 subsubsection{*Proving @{term "a div (b*c) = (a div b) div c"} *}  haftmann@33361  1919 haftmann@33361  1920 (*The condition c>0 seems necessary. Consider that 7 div ~6 = ~2 but  haftmann@33361  1921  7 div 2 div ~3 = 3 div ~3 = ~1. The subcase (a div b) mod c = 0 seems  haftmann@33361  1922  to cause particular problems.*)  haftmann@33361  1923 haftmann@33361  1924 text{*first, four lemmas to bound the remainder for the cases b<0 and b>0 *}  haftmann@33361  1925 haftmann@33361  1926 lemma zmult2_lemma_aux1: "[| (0::int) < c; b < r; r \ 0 |] ==> b*c < b*(q mod c) + r"  haftmann@33361  1927 apply (subgoal_tac "b * (c - q mod c) < r * 1")  haftmann@33361  1928  apply (simp add: algebra_simps)  haftmann@33361  1929 apply (rule order_le_less_trans)  haftmann@33361  1930  apply (erule_tac [2] mult_strict_right_mono)  haftmann@33361  1931  apply (rule mult_left_mono_neg)  haftmann@33361  1932  using add1_zle_eq[of "q mod c"]apply(simp add: algebra_simps pos_mod_bound)  haftmann@33361  1933  apply (simp)  haftmann@33361  1934 apply (simp)  haftmann@33361  1935 done  haftmann@33361  1936 haftmann@33361  1937 lemma zmult2_lemma_aux2:  haftmann@33361  1938  "[| (0::int) < c; b < r; r \ 0 |] ==> b * (q mod c) + r \ 0"  haftmann@33361  1939 apply (subgoal_tac "b * (q mod c) \ 0")  haftmann@33361  1940  apply arith  haftmann@33361  1941 apply (simp add: mult_le_0_iff)  haftmann@33361  1942 done  haftmann@33361  1943 haftmann@33361  1944 lemma zmult2_lemma_aux3: "[| (0::int) < c; 0 \ r; r < b |] ==> 0 \ b * (q mod c) + r"  haftmann@33361  1945 apply (subgoal_tac "0 \ b * (q mod c) ")  haftmann@33361  1946 apply arith  haftmann@33361  1947 apply (simp add: zero_le_mult_iff)  haftmann@33361  1948 done  haftmann@33361  1949 haftmann@33361  1950 lemma zmult2_lemma_aux4: "[| (0::int) < c; 0 \ r; r < b |] ==> b * (q mod c) + r < b * c"  haftmann@33361  1951 apply (subgoal_tac "r * 1 < b * (c - q mod c) ")  haftmann@33361  1952  apply (simp add: right_diff_distrib)  haftmann@33361  1953 apply (rule order_less_le_trans)  haftmann@33361  1954  apply (erule mult_strict_right_mono)  haftmann@33361  1955  apply (rule_tac [2] mult_left_mono)  haftmann@33361  1956  apply simp  haftmann@33361  1957  using add1_zle_eq[of "q mod c"] apply (simp add: algebra_simps pos_mod_bound)  haftmann@33361  1958 apply simp  haftmann@33361  1959 done  haftmann@33361  1960 haftmann@33361  1961 lemma zmult2_lemma: "[| divmod_int_rel a b (q, r); b \ 0; 0 < c |]  haftmann@33361  1962  ==> divmod_int_rel a (b * c) (q div c, b*(q mod c) + r)"  haftmann@33361  1963 by (auto simp add: mult_ac divmod_int_rel_def linorder_neq_iff  haftmann@33361  1964  zero_less_mult_iff right_distrib [symmetric]  haftmann@33361  1965  zmult2_lemma_aux1 zmult2_lemma_aux2 zmult2_lemma_aux3 zmult2_lemma_aux4)  haftmann@33361  1966 haftmann@33361  1967 lemma zdiv_zmult2_eq: "(0::int) < c ==> a div (b*c) = (a div b) div c"  haftmann@33361  1968 apply (case_tac "b = 0", simp)  haftmann@33361  1969 apply (force simp add: divmod_int_rel_div_mod [THEN zmult2_lemma, THEN divmod_int_rel_div])  haftmann@33361  1970 done  haftmann@33361  1971 haftmann@33361  1972 lemma zmod_zmult2_eq:  haftmann@33361  1973  "(0::int) < c ==> a mod (b*c) = b*(a div b mod c) + a mod b"  haftmann@33361  1974 apply (case_tac "b = 0", simp)  haftmann@33361  1975 apply (force simp add: divmod_int_rel_div_mod [THEN zmult2_lemma, THEN divmod_int_rel_mod])  haftmann@33361  1976 done  haftmann@33361  1977 haftmann@33361  1978 haftmann@33361  1979 subsubsection {*Splitting Rules for div and mod*}  haftmann@33361  1980 haftmann@33361  1981 text{*The proofs of the two lemmas below are essentially identical*}  haftmann@33361  1982 haftmann@33361  1983 lemma split_pos_lemma:  haftmann@33361  1984  "0  haftmann@33361  1985  P(n div k :: int)(n mod k) = (\i j. 0\j & j P i j)"  haftmann@33361  1986 apply (rule iffI, clarify)  haftmann@33361  1987  apply (erule_tac P="P ?x ?y" in rev_mp)  haftmann@33361  1988  apply (subst mod_add_eq)  haftmann@33361  1989  apply (subst zdiv_zadd1_eq)  haftmann@33361  1990  apply (simp add: div_pos_pos_trivial mod_pos_pos_trivial)  haftmann@33361  1991 txt{*converse direction*}  haftmann@33361  1992 apply (drule_tac x = "n div k" in spec)  haftmann@33361  1993 apply (drule_tac x = "n mod k" in spec, simp)  haftmann@33361  1994 done  haftmann@33361  1995 haftmann@33361  1996 lemma split_neg_lemma:  haftmann@33361  1997  "k<0 ==>  haftmann@33361  1998  P(n div k :: int)(n mod k) = (\i j. k0 & n = k*i + j --> P i j)"  haftmann@33361  1999 apply (rule iffI, clarify)  haftmann@33361  2000  apply (erule_tac P="P ?x ?y" in rev_mp)  haftmann@33361  2001  apply (subst mod_add_eq)  haftmann@33361  2002  apply (subst zdiv_zadd1_eq)  haftmann@33361  2003  apply (simp add: div_neg_neg_trivial mod_neg_neg_trivial)  haftmann@33361  2004 txt{*converse direction*}  haftmann@33361  2005 apply (drule_tac x = "n div k" in spec)  haftmann@33361  2006 apply (drule_tac x = "n mod k" in spec, simp)  haftmann@33361  2007 done  haftmann@33361  2008 haftmann@33361  2009 lemma split_zdiv:  haftmann@33361  2010  "P(n div k :: int) =  haftmann@33361  2011  ((k = 0 --> P 0) &  haftmann@33361  2012  (0 (\i j. 0\j & j P i)) &  haftmann@33361  2013  (k<0 --> (\i j. k0 & n = k*i + j --> P i)))"  haftmann@33361  2014 apply (case_tac "k=0", simp)  haftmann@33361  2015 apply (simp only: linorder_neq_iff)  haftmann@33361  2016 apply (erule disjE)  haftmann@33361  2017  apply (simp_all add: split_pos_lemma [of concl: "%x y. P x"]  haftmann@33361  2018  split_neg_lemma [of concl: "%x y. P x"])  haftmann@33361  2019 done  haftmann@33361  2020 haftmann@33361  2021 lemma split_zmod:  haftmann@33361  2022  "P(n mod k :: int) =  haftmann@33361  2023  ((k = 0 --> P n) &  haftmann@33361  2024  (0 (\i j. 0\j & j P j)) &  haftmann@33361  2025  (k<0 --> (\i j. k0 & n = k*i + j --> P j)))"  haftmann@33361  2026 apply (case_tac "k=0", simp)  haftmann@33361  2027 apply (simp only: linorder_neq_iff)  haftmann@33361  2028 apply (erule disjE)  haftmann@33361  2029  apply (simp_all add: split_pos_lemma [of concl: "%x y. P y"]  haftmann@33361  2030  split_neg_lemma [of concl: "%x y. P y"])  haftmann@33361  2031 done  haftmann@33361  2032 webertj@33730  2033 text {* Enable (lin)arith to deal with @{const div} and @{const mod}  webertj@33730  2034  when these are applied to some constant that is of the form  webertj@33730  2035  @{term "number_of k"}: *}  webertj@33728  2036 declare split_zdiv [of _ _ "number_of k", standard, arith_split]  webertj@33728  2037 declare split_zmod [of _ _ "number_of k", standard, arith_split]  haftmann@33361  2038 haftmann@33361  2039 haftmann@33361  2040 subsubsection{*Speeding up the Division Algorithm with Shifting*}  haftmann@33361  2041 haftmann@33361  2042 text{*computing div by shifting *}  haftmann@33361  2043 haftmann@33361  2044 lemma pos_zdiv_mult_2: "(0::int) \ a ==> (1 + 2*b) div (2*a) = b div a"  haftmann@33361  2045 proof cases  haftmann@33361  2046  assume "a=0"  haftmann@33361  2047  thus ?thesis by simp  haftmann@33361  2048 next  haftmann@33361  2049  assume "a\0" and le_a: "0\a"  haftmann@33361  2050  hence a_pos: "1 \ a" by arith  haftmann@33361  2051  hence one_less_a2: "1 < 2 * a" by arith  haftmann@33361  2052  hence le_2a: "2 * (1 + b mod a) \ 2 * a"  haftmann@33361  2053  unfolding mult_le_cancel_left  haftmann@33361  2054  by (simp add: add1_zle_eq add_commute [of 1])  haftmann@33361  2055  with a_pos have "0 \ b mod a" by simp  haftmann@33361  2056  hence le_addm: "0 \ 1 mod (2*a) + 2*(b mod a)"  haftmann@33361  2057  by (simp add: mod_pos_pos_trivial one_less_a2)  haftmann@33361  2058  with le_2a  haftmann@33361  2059  have "(1 mod (2*a) + 2*(b mod a)) div (2*a) = 0"  haftmann@33361  2060  by (simp add: div_pos_pos_trivial le_addm mod_pos_pos_trivial one_less_a2  haftmann@33361  2061  right_distrib)  haftmann@33361  2062  thus ?thesis  haftmann@33361  2063  by (subst zdiv_zadd1_eq,  haftmann@33361  2064  simp add: mod_mult_mult1 one_less_a2  haftmann@33361  2065  div_pos_pos_trivial)  haftmann@33361  2066 qed  haftmann@33361  2067 haftmann@33361  2068 lemma neg_zdiv_mult_2: "a \ (0::int) ==> (1 + 2*b) div (2*a) = (b+1) div a"  haftmann@33361  2069 apply (subgoal_tac " (1 + 2* (-b - 1)) div (2 * (-a)) = (-b - 1) div (-a) ")  haftmann@33361  2070 apply (rule_tac [2] pos_zdiv_mult_2)  haftmann@33361  2071 apply (auto simp add: right_diff_distrib)  haftmann@33361  2072 apply (subgoal_tac " (-1 - (2 * b)) = - (1 + (2 * b))")  haftmann@33361  2073 apply (simp only: zdiv_zminus_zminus diff_minus minus_add_distrib [symmetric])  haftmann@33361  2074 apply (simp_all add: algebra_simps)  haftmann@33361  2075 apply (simp only: ab_diff_minus minus_add_distrib [symmetric] number_of_Min zdiv_zminus_zminus)  haftmann@33361  2076 done  haftmann@33361  2077 haftmann@33361  2078 lemma zdiv_number_of_Bit0 [simp]:  haftmann@33361  2079  "number_of (Int.Bit0 v) div number_of (Int.Bit0 w) =  haftmann@33361  2080  number_of v div (number_of w :: int)"  haftmann@33361  2081 by (simp only: number_of_eq numeral_simps) (simp add: mult_2 [symmetric])  haftmann@33361  2082 haftmann@33361  2083 lemma zdiv_number_of_Bit1 [simp]:  haftmann@33361  2084  "number_of (Int.Bit1 v) div number_of (Int.Bit0 w) =  haftmann@33361  2085  (if (0::int) \ number_of w  haftmann@33361  2086  then number_of v div (number_of w)  haftmann@33361  2087  else (number_of v + (1::int)) div (number_of w))"  haftmann@33361  2088 apply (simp only: number_of_eq numeral_simps UNIV_I split: split_if)  haftmann@33361  2089 apply (simp add: pos_zdiv_mult_2 neg_zdiv_mult_2 add_ac mult_2 [symmetric])  haftmann@33361  2090 done  haftmann@33361  2091 haftmann@33361  2092 haftmann@33361  2093 subsubsection{*Computing mod by Shifting (proofs resemble those for div)*}  haftmann@33361  2094 haftmann@33361  2095 lemma pos_zmod_mult_2:  haftmann@33361  2096  fixes a b :: int  haftmann@33361  2097  assumes "0 \ a"  haftmann@33361  2098  shows "(1 + 2 * b) mod (2 * a) = 1 + 2 * (b mod a)"  haftmann@33361  2099 proof (cases "0 < a")  haftmann@33361  2100  case False with assms show ?thesis by simp  haftmann@33361  2101 next  haftmann@33361  2102  case True  haftmann@33361  2103  then have "b mod a < a" by (rule pos_mod_bound)  haftmann@33361  2104  then have "1 + b mod a \ a" by simp  haftmann@33361  2105  then have A: "2 * (1 + b mod a) \ 2 * a" by simp  haftmann@33361  2106  from 0 < a have "0 \ b mod a" by (rule pos_mod_sign)  haftmann@33361  2107  then have B: "0 \ 1 + 2 * (b mod a)" by simp  haftmann@33361  2108  have "((1\int) mod ((2\int) * a) + (2\int) * b mod ((2\int) * a)) mod ((2\int) * a) = (1\int) + (2\int) * (b mod a)"  haftmann@33361  2109  using 0 < a and A  haftmann@33361  2110  by (auto simp add: mod_mult_mult1 mod_pos_pos_trivial ring_distribs intro!: mod_pos_pos_trivial B)  haftmann@33361  2111  then show ?thesis by (subst mod_add_eq)  haftmann@33361  2112 qed  haftmann@33361  2113 haftmann@33361  2114 lemma neg_zmod_mult_2:  haftmann@33361  2115  fixes a b :: int  haftmann@33361  2116  assumes "a \ 0"  haftmann@33361  2117  shows "(1 + 2 * b) mod (2 * a) = 2 * ((b + 1) mod a) - 1"  haftmann@33361  2118 proof -  haftmann@33361  2119  from assms have "0 \ - a" by auto  haftmann@33361  2120  then have "(1 + 2 * (- b - 1)) mod (2 * (- a)) = 1 + 2 * ((- b - 1) mod (- a))"  haftmann@33361  2121  by (rule pos_zmod_mult_2)  haftmann@33361  2122  then show ?thesis by (simp add: zmod_zminus2 algebra_simps)  haftmann@33361  2123  (simp add: diff_minus add_ac)  haftmann@33361  2124 qed  haftmann@33361  2125 haftmann@33361  2126 lemma zmod_number_of_Bit0 [simp]:  haftmann@33361  2127  "number_of (Int.Bit0 v) mod number_of (Int.Bit0 w) =  haftmann@33361  2128  (2::int) * (number_of v mod number_of w)"  haftmann@33361  2129 apply (simp only: number_of_eq numeral_simps)  haftmann@33361  2130 apply (simp add: mod_mult_mult1 pos_zmod_mult_2  haftmann@33361  2131  neg_zmod_mult_2 add_ac mult_2 [symmetric])  haftmann@33361  2132 done  haftmann@33361  2133 haftmann@33361  2134 lemma zmod_number_of_Bit1 [simp]:  haftmann@33361  2135  "number_of (Int.Bit1 v) mod number_of (Int.Bit0 w) =  haftmann@33361  2136  (if (0::int) \ number_of w  haftmann@33361  2137  then 2 * (number_of v mod number_of w) + 1  haftmann@33361  2138  else 2 * ((number_of v + (1::int)) mod number_of w) - 1)"  haftmann@33361  2139 apply (simp only: number_of_eq numeral_simps)  haftmann@33361  2140 apply (simp add: mod_mult_mult1 pos_zmod_mult_2  haftmann@33361  2141  neg_zmod_mult_2 add_ac mult_2 [symmetric])  haftmann@33361  2142 done  haftmann@33361  2143 haftmann@33361  2144 haftmann@33361  2145 subsubsection{*Quotients of Signs*}  haftmann@33361  2146 haftmann@33361  2147 lemma div_neg_pos_less0: "[| a < (0::int); 0 < b |] ==> a div b < 0"  haftmann@33361  2148 apply (subgoal_tac "a div b \ -1", force)  haftmann@33361  2149 apply (rule order_trans)  haftmann@33361  2150 apply (rule_tac a' = "-1" in zdiv_mono1)  haftmann@33361  2151 apply (auto simp add: div_eq_minus1)  haftmann@33361  2152 done  haftmann@33361  2153 haftmann@33361  2154 lemma div_nonneg_neg_le0: "[| (0::int) \ a; b < 0 |] ==> a div b \ 0"  haftmann@33361  2155 by (drule zdiv_mono1_neg, auto)  haftmann@33361  2156 haftmann@33361  2157 lemma div_nonpos_pos_le0: "[| (a::int) \ 0; b > 0 |] ==> a div b \ 0"  haftmann@33361  2158 by (drule zdiv_mono1, auto)  haftmann@33361  2159 nipkow@33804  2160 text{* Now for some equivalences of the form @{text"a div b >=< 0 \ \"}  nipkow@33804  2161 conditional upon the sign of @{text a} or @{text b}. There are many more.  nipkow@33804  2162 They should all be simp rules unless that causes too much search. *}  nipkow@33804  2163 haftmann@33361  2164 lemma pos_imp_zdiv_nonneg_iff: "(0::int) < b ==> (0 \ a div b) = (0 \ a)"  haftmann@33361  2165 apply auto  haftmann@33361  2166 apply (drule_tac [2] zdiv_mono1)  haftmann@33361  2167 apply (auto simp add: linorder_neq_iff)  haftmann@33361  2168 apply (simp (no_asm_use) add: linorder_not_less [symmetric])  haftmann@33361  2169 apply (blast intro: div_neg_pos_less0)  haftmann@33361  2170 done  haftmann@33361  2171 haftmann@33361  2172 lemma neg_imp_zdiv_nonneg_iff:  nipkow@33804  2173  "b < (0::int) ==> (0 \ a div b) = (a \ (0::int))"  haftmann@33361  2174 apply (subst zdiv_zminus_zminus [symmetric])  haftmann@33361  2175 apply (subst pos_imp_zdiv_nonneg_iff, auto)  haftmann@33361  2176 done  haftmann@33361  2177 haftmann@33361  2178 (*But not (a div b \ 0 iff a\0); consider a=1, b=2 when a div b = 0.*)  haftmann@33361  2179 lemma pos_imp_zdiv_neg_iff: "(0::int) < b ==> (a div b < 0) = (a < 0)"  haftmann@33361  2180 by (simp add: linorder_not_le [symmetric] pos_imp_zdiv_nonneg_iff)  haftmann@33361  2181 haftmann@33361  2182 (*Again the law fails for \: consider a = -1, b = -2 when a div b = 0*)  haftmann@33361  2183 lemma neg_imp_zdiv_neg_iff: "b < (0::int) ==> (a div b < 0) = (0 < a)"  haftmann@33361  2184 by (simp add: linorder_not_le [symmetric] neg_imp_zdiv_nonneg_iff)  haftmann@33361  2185 nipkow@33804  2186 lemma nonneg1_imp_zdiv_pos_iff:  nipkow@33804  2187  "(0::int) <= a \ (a div b > 0) = (a >= b & b>0)"  nipkow@33804  2188 apply rule  nipkow@33804  2189  apply rule  nipkow@33804  2190  using div_pos_pos_trivial[of a b]apply arith  nipkow@33804  2191  apply(cases "b=0")apply simp  nipkow@33804  2192  using div_nonneg_neg_le0[of a b]apply arith  nipkow@33804  2193 using int_one_le_iff_zero_less[of "a div b"] zdiv_mono1[of b a b]apply simp  nipkow@33804  2194 done  nipkow@33804  2195 haftmann@33361  2196 haftmann@33361  2197 subsubsection {* The Divides Relation *}  haftmann@33361  2198 haftmann@33361  2199 lemmas zdvd_iff_zmod_eq_0_number_of [simp] =  haftmann@33361  2200  dvd_eq_mod_eq_0 [of "number_of x::int" "number_of y::int", standard]  haftmann@33361  2201 haftmann@33361  2202 lemma zdvd_zmod: "f dvd m ==> f dvd (n::int) ==> f dvd m mod n"  haftmann@33361  2203  by (rule dvd_mod) (* TODO: remove *)  haftmann@33361  2204 haftmann@33361  2205 lemma zdvd_zmod_imp_zdvd: "k dvd m mod n ==> k dvd n ==> k dvd (m::int)"  haftmann@33361  2206  by (rule dvd_mod_imp_dvd) (* TODO: remove *)  haftmann@33361  2207 haftmann@33361  2208 lemma zmult_div_cancel: "(n::int) * (m div n) = m - (m mod n)"  haftmann@33361  2209  using zmod_zdiv_equality[where a="m" and b="n"]  haftmann@33361  2210  by (simp add: algebra_simps)  haftmann@33361  2211 haftmann@33361  2212 lemma zpower_zmod: "((x::int) mod m)^y mod m = x^y mod m"  haftmann@33361  2213 apply (induct "y", auto)  haftmann@33361  2214 apply (rule zmod_zmult1_eq [THEN trans])  haftmann@33361  2215 apply (simp (no_asm_simp))  haftmann@33361  2216 apply (rule mod_mult_eq [symmetric])  haftmann@33361  2217 done  haftmann@33361  2218 haftmann@33361  2219 lemma zdiv_int: "int (a div b) = (int a) div (int b)"  haftmann@33361  2220 apply (subst split_div, auto)  haftmann@33361  2221 apply (subst split_zdiv, auto)  haftmann@33361  2222 apply (rule_tac a="int (b * i) + int j" and b="int b" and r="int j" and r'=ja in unique_quotient)  haftmann@33361  2223 apply (auto simp add: divmod_int_rel_def of_nat_mult)  haftmann@33361  2224 done  haftmann@33361  2225 haftmann@33361  2226 lemma zmod_int: "int (a mod b) = (int a) mod (int b)"  haftmann@33361  2227 apply (subst split_mod, auto)  haftmann@33361  2228 apply (subst split_zmod, auto)  haftmann@33361  2229 apply (rule_tac a="int (b * i) + int j" and b="int b" and q="int i" and q'=ia  haftmann@33361  2230  in unique_remainder)  haftmann@33361  2231 apply (auto simp add: divmod_int_rel_def of_nat_mult)  haftmann@33361  2232 done  haftmann@33361  2233 haftmann@33361  2234 lemma abs_div: "(y::int) dvd x \ abs (x div y) = abs x div abs y"  haftmann@33361  2235 by (unfold dvd_def, cases "y=0", auto simp add: abs_mult)  haftmann@33361  2236 haftmann@33361  2237 lemma zdvd_mult_div_cancel:"(n::int) dvd m \ n * (m div n) = m"  haftmann@33361  2238 apply (subgoal_tac "m mod n = 0")  haftmann@33361  2239  apply (simp add: zmult_div_cancel)  haftmann@33361  2240 apply (simp only: dvd_eq_mod_eq_0)  haftmann@33361  2241 done  haftmann@33361  2242 haftmann@33361  2243 text{*Suggested by Matthias Daum*}  haftmann@33361  2244 lemma int_power_div_base:  haftmann@33361  2245  "\0 < m; 0 < k\ \ k ^ m div k = (k::int) ^ (m - Suc 0)"  haftmann@33361  2246 apply (subgoal_tac "k ^ m = k ^ ((m - Suc 0) + Suc 0)")  haftmann@33361  2247  apply (erule ssubst)  haftmann@33361  2248  apply (simp only: power_add)  haftmann@33361  2249  apply simp_all  haftmann@33361  2250 done  haftmann@33361  2251 haftmann@33361  2252 text {* by Brian Huffman *}  haftmann@33361  2253 lemma zminus_zmod: "- ((x::int) mod m) mod m = - x mod m"  haftmann@33361  2254 by (rule mod_minus_eq [symmetric])  haftmann@33361  2255 haftmann@33361  2256 lemma zdiff_zmod_left: "(x mod m - y) mod m = (x - y) mod (m::int)"  haftmann@33361  2257 by (rule mod_diff_left_eq [symmetric])  haftmann@33361  2258 haftmann@33361  2259 lemma zdiff_zmod_right: "(x - y mod m) mod m = (x - y) mod (m::int)"  haftmann@33361  2260 by (rule mod_diff_right_eq [symmetric])  haftmann@33361  2261 haftmann@33361  2262 lemmas zmod_simps =  haftmann@33361  2263  mod_add_left_eq [symmetric]  haftmann@33361  2264  mod_add_right_eq [symmetric]  haftmann@33361  2265  zmod_zmult1_eq [symmetric]  haftmann@33361  2266  mod_mult_left_eq [symmetric]  haftmann@33361  2267  zpower_zmod  haftmann@33361  2268  zminus_zmod zdiff_zmod_left zdiff_zmod_right  haftmann@33361  2269 haftmann@33361  2270 text {* Distributive laws for function @{text nat}. *}  haftmann@33361  2271 haftmann@33361  2272 lemma nat_div_distrib: "0 \ x \ nat (x div y) = nat x div nat y"  haftmann@33361  2273 apply (rule linorder_cases [of y 0])  haftmann@33361  2274 apply (simp add: div_nonneg_neg_le0)  haftmann@33361  2275 apply simp  haftmann@33361  2276 apply (simp add: nat_eq_iff pos_imp_zdiv_nonneg_iff zdiv_int)  haftmann@33361  2277 done  haftmann@33361  2278 haftmann@33361  2279 (*Fails if y<0: the LHS collapses to (nat z) but the RHS doesn't*)  haftmann@33361  2280 lemma nat_mod_distrib:  haftmann@33361  2281  "\0 \ x; 0 \ y\ \ nat (x mod y) = nat x mod nat y"  haftmann@33361  2282 apply (case_tac "y = 0", simp)  haftmann@33361  2283 apply (simp add: nat_eq_iff zmod_int)  haftmann@33361  2284 done  haftmann@33361  2285 haftmann@33361  2286 text {* transfer setup *}  haftmann@33361  2287 haftmann@33361  2288 lemma transfer_nat_int_functions:  haftmann@33361  2289  "(x::int) >= 0 \ y >= 0 \ (nat x) div (nat y) = nat (x div y)"  haftmann@33361  2290  "(x::int) >= 0 \ y >= 0 \ (nat x) mod (nat y) = nat (x mod y)"  haftmann@33361  2291  by (auto simp add: nat_div_distrib nat_mod_distrib)  haftmann@33361  2292 haftmann@33361  2293 lemma transfer_nat_int_function_closures:  haftmann@33361  2294  "(x::int) >= 0 \ y >= 0 \ x div y >= 0"  haftmann@33361  2295  "(x::int) >= 0 \ y >= 0 \ x mod y >= 0"  haftmann@33361  2296  apply (cases "y = 0")  haftmann@33361  2297  apply (auto simp add: pos_imp_zdiv_nonneg_iff)  haftmann@33361  2298  apply (cases "y = 0")  haftmann@33361  2299  apply auto  haftmann@33361  2300 done  haftmann@33361  2301 haftmann@33361  2302 declare TransferMorphism_nat_int [transfer add return:  haftmann@33361  2303  transfer_nat_int_functions  haftmann@33361  2304  transfer_nat_int_function_closures  haftmann@33361  2305 ]  haftmann@33361  2306 haftmann@33361  2307 lemma transfer_int_nat_functions:  haftmann@33361  2308  "(int x) div (int y) = int (x div y)"  haftmann@33361  2309  "(int x) mod (int y) = int (x mod y)"  haftmann@33361  2310  by (auto simp add: zdiv_int zmod_int)  haftmann@33361  2311 haftmann@33361  2312 lemma transfer_int_nat_function_closures:  haftmann@33361  2313  "is_nat x \ is_nat y \ is_nat (x div y)"  haftmann@33361  2314  "is_nat x \ is_nat y \ is_nat (x mod y)"  haftmann@33361  2315  by (simp_all only: is_nat_def transfer_nat_int_function_closures)  haftmann@33361  2316 haftmann@33361  2317 declare TransferMorphism_int_nat [transfer add return:  haftmann@33361  2318  transfer_int_nat_functions  haftmann@33361  2319  transfer_int_nat_function_closures  haftmann@33361  2320 ]  haftmann@33361  2321 haftmann@33361  2322 text{*Suggested by Matthias Daum*}  haftmann@33361  2323 lemma int_div_less_self: "\0 < x; 1 < k\ \ x div k < (x::int)"  haftmann@33361  2324 apply (subgoal_tac "nat x div nat k < nat x")  haftmann@33361  2325  apply (simp (asm_lr) add: nat_div_distrib [symmetric])  haftmann@33361  2326 apply (rule Divides.div_less_dividend, simp_all)  haftmann@33361  2327 done  haftmann@33361  2328 haftmann@33361  2329 text {* code generator setup *}  haftmann@33361  2330 haftmann@33361  2331 context ring_1  haftmann@33361  2332 begin  haftmann@33361  2333 haftmann@33361  2334 lemma of_int_num [code]:  haftmann@33361  2335  "of_int k = (if k = 0 then 0 else if k < 0 then  haftmann@33361  2336  - of_int (- k) else let  haftmann@33361  2337  (l, m) = divmod_int k 2;  haftmann@33361  2338  l' = of_int l  haftmann@33361  2339  in if m = 0 then l' + l' else l' + l' + 1)"  haftmann@33361  2340 proof -  haftmann@33361  2341  have aux1: "k mod (2\int) \ (0\int) \  haftmann@33361  2342  of_int k = of_int (k div 2 * 2 + 1)"  haftmann@33361  2343  proof -  haftmann@33361  2344  have "k mod 2 < 2" by (auto intro: pos_mod_bound)  haftmann@33361  2345  moreover have "0 \ k mod 2" by (auto intro: pos_mod_sign)  haftmann@33361  2346  moreover assume "k mod 2 \ 0"  haftmann@33361  2347  ultimately have "k mod 2 = 1" by arith  haftmann@33361  2348  moreover have "of_int k = of_int (k div 2 * 2 + k mod 2)" by simp  haftmann@33361  2349  ultimately show ?thesis by auto  haftmann@33361  2350  qed  haftmann@33361  2351  have aux2: "\x. of_int 2 * x = x + x"  haftmann@33361  2352  proof -  haftmann@33361  2353  fix x  haftmann@33361  2354  have int2: "(2::int) = 1 + 1" by arith  haftmann@33361  2355  show "of_int 2 * x = x + x"  haftmann@33361  2356  unfolding int2 of_int_add left_distrib by simp  haftmann@33361  2357  qed  haftmann@33361  2358  have aux3: "\x. x * of_int 2 = x + x"  haftmann@33361  2359  proof -  haftmann@33361  2360  fix x  haftmann@33361  2361  have int2: "(2::int) = 1 + 1" by arith  haftmann@33361  2362  show "x * of_int 2 = x + x"  haftmann@33361  2363  unfolding int2 of_int_add right_distrib by simp  haftmann@33361  2364  qed  haftmann@33361  2365  from aux1 show ?thesis by (auto simp add: divmod_int_mod_div Let_def aux2 aux3)  haftmann@33361  2366 qed  haftmann@33361  2367 haftmann@33361  2368 end  haftmann@33361  2369 haftmann@33361  2370 lemma zmod_eq_dvd_iff: "(x::int) mod n = y mod n \ n dvd x - y"  haftmann@33361  2371 proof  haftmann@33361  2372  assume H: "x mod n = y mod n"  haftmann@33361  2373  hence "x mod n - y mod n = 0" by simp  haftmann@33361  2374  hence "(x mod n - y mod n) mod n = 0" by simp  haftmann@33361  2375  hence "(x - y) mod n = 0" by (simp add: mod_diff_eq[symmetric])  haftmann@33361  2376  thus "n dvd x - y" by (simp add: dvd_eq_mod_eq_0)  haftmann@33361  2377 next  haftmann@33361  2378  assume H: "n dvd x - y"  haftmann@33361  2379  then obtain k where k: "x-y = n*k" unfolding dvd_def by blast  haftmann@33361  2380  hence "x = n*k + y" by simp  haftmann@33361  2381  hence "x mod n = (n*k + y) mod n" by simp  haftmann@33361  2382  thus "x mod n = y mod n" by (simp add: mod_add_left_eq)  haftmann@33361  2383 qed  haftmann@33361  2384 haftmann@33361  2385 lemma nat_mod_eq_lemma: assumes xyn: "(x::nat) mod n = y mod n" and xy:"y \ x"  haftmann@33361  2386  shows "\q. x = y + n * q"  haftmann@33361  2387 proof-  haftmann@33361  2388  from xy have th: "int x - int y = int (x - y)" by simp  haftmann@33361  2389  from xyn have "int x mod int n = int y mod int n"  haftmann@33361  2390  by (simp add: zmod_int[symmetric])  haftmann@33361  2391  hence "int n dvd int x - int y" by (simp only: zmod_eq_dvd_iff[symmetric])  haftmann@33361  2392  hence "n dvd x - y" by (simp add: th zdvd_int)  haftmann@33361  2393  then show ?thesis using xy unfolding dvd_def apply clarsimp apply (rule_tac x="k" in exI) by arith  haftmann@33361  2394 qed  haftmann@33361  2395 haftmann@33361  2396 lemma nat_mod_eq_iff: "(x::nat) mod n = y mod n \ (\q1 q2. x + n * q1 = y + n * q2)"  haftmann@33361  2397  (is "?lhs = ?rhs")  haftmann@33361  2398 proof  haftmann@33361  2399  assume H: "x mod n = y mod n"  haftmann@33361  2400  {assume xy: "x \ y"  haftmann@33361  2401  from H have th: "y mod n = x mod n" by simp  haftmann@33361  2402  from nat_mod_eq_lemma[OF th xy] have ?rhs  haftmann@33361  2403  apply clarify apply (rule_tac x="q" in exI) by (rule exI[where x="0"], simp)}  haftmann@33361  2404  moreover  haftmann@33361  2405  {assume xy: "y \ x"  haftmann@33361  2406  from nat_mod_eq_lemma[OF H xy] have ?rhs  haftmann@33361  2407  apply clarify apply (rule_tac x="0" in exI) by (rule_tac x="q" in exI, simp)}  haftmann@33361  2408  ultimately show ?rhs using linear[of x y] by blast  haftmann@33361  2409 next  haftmann@33361  2410  assume ?rhs then obtain q1 q2 where q12: "x + n * q1 = y + n * q2" by blast  haftmann@33361  2411  hence "(x + n * q1) mod n = (y + n * q2) mod n" by simp  haftmann@33361  2412  thus ?lhs by simp  haftmann@33361  2413 qed  haftmann@33361  2414 haftmann@33361  2415 lemma div_nat_number_of [simp]:  haftmann@33361  2416  "(number_of v :: nat) div number_of v' =  haftmann@33361  2417  (if neg (number_of v :: int) then 0  haftmann@33361  2418  else nat (number_of v div number_of v'))"  haftmann@33361  2419  unfolding nat_number_of_def number_of_is_id neg_def  haftmann@33361  2420  by (simp add: nat_div_distrib)  haftmann@33361  2421 haftmann@33361  2422 lemma one_div_nat_number_of [simp]:  haftmann@33361  2423  "Suc 0 div number_of v' = nat (1 div number_of v')"  haftmann@33361  2424 by (simp del: nat_numeral_1_eq_1 add: numeral_1_eq_Suc_0 [symmetric])  haftmann@33361  2425 haftmann@33361  2426 lemma mod_nat_number_of [simp]:  haftmann@33361  2427  "(number_of v :: nat) mod number_of v' =  haftmann@33361  2428  (if neg (number_of v :: int) then 0  haftmann@33361  2429  else if neg (number_of v' :: int) then number_of v  haftmann@33361  2430  else nat (number_of v mod number_of v'))"  haftmann@33361  2431  unfolding nat_number_of_def number_of_is_id neg_def  haftmann@33361  2432  by (simp add: nat_mod_distrib)  haftmann@33361  2433 haftmann@33361  2434 lemma one_mod_nat_number_of [simp]:  haftmann@33361  2435  "Suc 0 mod number_of v' =  haftmann@33361  2436  (if neg (number_of v' :: int) then Suc 0  haftmann@33361  2437  else nat (1 mod number_of v'))"  haftmann@33361  2438 by (simp del: nat_numeral_1_eq_1 add: numeral_1_eq_Suc_0 [symmetric])  haftmann@33361  2439 haftmann@33361  2440 lemmas dvd_eq_mod_eq_0_number_of =  haftmann@33361  2441  dvd_eq_mod_eq_0 [of "number_of x" "number_of y", standard]  haftmann@33361  2442 haftmann@33361  2443 declare dvd_eq_mod_eq_0_number_of [simp]  haftmann@33361  2444 haftmann@33361  2445 haftmann@33361  2446 subsubsection {* Code generation *}  haftmann@33361  2447 haftmann@33361  2448 definition pdivmod :: "int \ int \ int \ int" where  haftmann@33361  2449  "pdivmod k l = (\k\ div \l\, \k\ mod \l$$"  haftmann@33361  2450 haftmann@33361  2451 lemma pdivmod_posDivAlg [code]:  haftmann@33361  2452  "pdivmod k l = (if l = 0 then (0, \k\) else posDivAlg \k\ \l\)"  haftmann@33361  2453 by (subst posDivAlg_div_mod) (simp_all add: pdivmod_def)  haftmann@33361  2454 haftmann@33361  2455 lemma divmod_int_pdivmod: "divmod_int k l = (if k = 0 then (0, 0) else if l = 0 then (0, k) else  haftmann@33361  2456  apsnd ((op *) (sgn l)) (if 0 < l \ 0 \ k \ l < 0 \ k < 0  haftmann@33361  2457  then pdivmod k l  haftmann@33361  2458  else (let (r, s) = pdivmod k l in  haftmann@33361  2459  if s = 0 then (- r, 0) else (- r - 1, \l\ - s))))"  haftmann@33361  2460 proof -  haftmann@33361  2461  have aux: "\q::int. - k = l * q \ k = l * - q" by auto  haftmann@33361  2462  show ?thesis  haftmann@33361  2463  by (simp add: divmod_int_mod_div pdivmod_def)  haftmann@33361  2464  (auto simp add: aux not_less not_le zdiv_zminus1_eq_if  haftmann@33361  2465  zmod_zminus1_eq_if zdiv_zminus2_eq_if zmod_zminus2_eq_if)  haftmann@33361  2466 qed  haftmann@33361  2467 haftmann@33361  2468 lemma divmod_int_code [code]: "divmod_int k l = (if k = 0 then (0, 0) else if l = 0 then (0, k) else  haftmann@33361  2469  apsnd ((op *) (sgn l)) (if sgn k = sgn l  haftmann@33361  2470  then pdivmod k l  haftmann@33361  2471  else (let (r, s) = pdivmod k l in  haftmann@33361  2472  if s = 0 then (- r, 0) else (- r - 1, \l\ - s))))"  haftmann@33361  2473 proof -  haftmann@33361  2474  have "k \ 0 \ l \ 0 \ 0 < l \ 0 \ k \ l < 0 \ k < 0 \ sgn k = sgn l"  haftmann@33361  2475  by (auto simp add: not_less sgn_if)  haftmann@33361  2476  then show ?thesis by (simp add: divmod_int_pdivmod)  haftmann@33361  2477 qed  haftmann@33361  2478 haftmann@33364  2479 code_modulename SML  haftmann@33364  2480  Divides Arith  haftmann@33364  2481 haftmann@33364  2482 code_modulename OCaml  haftmann@33364  2483  Divides Arith  haftmann@33364  2484 haftmann@33364  2485 code_modulename Haskell  haftmann@33364  2486  Divides Arith  haftmann@33364  2487 haftmann@33361  2488 end `