src/HOL/Divides.thy
author haftmann
Sat, 19 May 2007 11:33:21 +0200
changeset 23017 00c0e4c42396
parent 22993 838c66e760b5
child 23162 b9853c187a1e
permissions -rw-r--r--
uniform module names for code generation
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
3366
2402c6ab1561 Moving div and mod from Arith to Divides
paulson
parents:
diff changeset
     1
(*  Title:      HOL/Divides.thy
2402c6ab1561 Moving div and mod from Arith to Divides
paulson
parents:
diff changeset
     2
    ID:         $Id$
2402c6ab1561 Moving div and mod from Arith to Divides
paulson
parents:
diff changeset
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
6865
5577ffe4c2f1 now div and mod are overloaded; dvd is polymorphic
paulson
parents: 3366
diff changeset
     4
    Copyright   1999  University of Cambridge
18154
0c05abaf6244 add header
huffman
parents: 17609
diff changeset
     5
*)
3366
2402c6ab1561 Moving div and mod from Arith to Divides
paulson
parents:
diff changeset
     6
18154
0c05abaf6244 add header
huffman
parents: 17609
diff changeset
     7
header {* The division operators div, mod and the divides relation "dvd" *}
3366
2402c6ab1561 Moving div and mod from Arith to Divides
paulson
parents:
diff changeset
     8
15131
c69542757a4d New theory header syntax.
nipkow
parents: 14640
diff changeset
     9
theory Divides
21408
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    10
imports Datatype Power
22993
haftmann
parents: 22916
diff changeset
    11
uses "~~/src/Provers/Arith/cancel_div_mod.ML"
15131
c69542757a4d New theory header syntax.
nipkow
parents: 14640
diff changeset
    12
begin
3366
2402c6ab1561 Moving div and mod from Arith to Divides
paulson
parents:
diff changeset
    13
8902
a705822f4e2a replaced {{ }} by { };
wenzelm
parents: 7029
diff changeset
    14
(*We use the same class for div and mod;
6865
5577ffe4c2f1 now div and mod are overloaded; dvd is polymorphic
paulson
parents: 3366
diff changeset
    15
  moreover, dvd is defined whenever multiplication is*)
22473
753123c89d72 explizit "type" superclass
haftmann
parents: 22261
diff changeset
    16
class div = type +
21408
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    17
  fixes div :: "'a \<Rightarrow> 'a \<Rightarrow> 'a"
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    18
  fixes mod :: "'a \<Rightarrow> 'a \<Rightarrow> 'a"
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    19
begin
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    20
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    21
notation
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    22
  div (infixl "\<^loc>div" 70)
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    23
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    24
notation
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    25
  mod (infixl "\<^loc>mod" 70)
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    26
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    27
end
6865
5577ffe4c2f1 now div and mod are overloaded; dvd is polymorphic
paulson
parents: 3366
diff changeset
    28
21408
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    29
notation
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    30
  div (infixl "div" 70)
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    31
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    32
notation
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    33
  mod (infixl "mod" 70)
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    34
22993
haftmann
parents: 22916
diff changeset
    35
instance nat :: Divides.div
haftmann
parents: 22916
diff changeset
    36
  div_def: "m div n == wfrec (pred_nat^+)
haftmann
parents: 22916
diff changeset
    37
                          (%f j. if j<n | n=0 then 0 else Suc (f (j-n))) m"
22261
9e185f78e7d4 Adapted to changes in Transitive_Closure theory.
berghofe
parents: 21911
diff changeset
    38
  mod_def: "m mod n == wfrec (pred_nat^+)
22993
haftmann
parents: 22916
diff changeset
    39
                          (%f j. if j<n | n=0 then j else f (j-n)) m" ..
21408
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    40
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    41
definition
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    42
  (*The definition of dvd is polymorphic!*)
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    43
  dvd  :: "'a::times \<Rightarrow> 'a \<Rightarrow> bool" (infixl "dvd" 50) where
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    44
  dvd_def: "m dvd n \<longleftrightarrow> (\<exists>k. n = m*k)"
6865
5577ffe4c2f1 now div and mod are overloaded; dvd is polymorphic
paulson
parents: 3366
diff changeset
    45
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
    46
definition
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
    47
  quorem :: "(nat*nat) * (nat*nat) => bool" where
21408
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    48
  (*This definition helps prove the harder properties of div and mod.
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    49
    It is copied from IntDiv.thy; should it be overloaded?*)
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
    50
  "quorem = (%((a,b), (q,r)).
21408
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    51
                    a = b*q + r &
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
    52
                    (if 0<b then 0\<le>r & r<b else b<r & r \<le>0))"
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    53
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    54
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    55
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    56
subsection{*Initial Lemmas*}
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    57
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
    58
lemmas wf_less_trans =
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    59
       def_wfrec [THEN trans, OF eq_reflection wf_pred_nat [THEN wf_trancl],
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    60
                  standard]
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    61
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
    62
lemma mod_eq: "(%m. m mod n) =
22261
9e185f78e7d4 Adapted to changes in Transitive_Closure theory.
berghofe
parents: 21911
diff changeset
    63
              wfrec (pred_nat^+) (%f j. if j<n | n=0 then j else f (j-n))"
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    64
by (simp add: mod_def)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    65
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
    66
lemma div_eq: "(%m. m div n) = wfrec (pred_nat^+)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    67
               (%f j. if j<n | n=0 then 0 else Suc (f (j-n)))"
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    68
by (simp add: div_def)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    69
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    70
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
    71
(** Aribtrary definitions for division by zero.  Useful to simplify
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    72
    certain equations **)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    73
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    74
lemma DIVISION_BY_ZERO_DIV [simp]: "a div 0 = (0::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
    75
  by (rule div_eq [THEN wf_less_trans], simp)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    76
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    77
lemma DIVISION_BY_ZERO_MOD [simp]: "a mod 0 = (a::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
    78
  by (rule mod_eq [THEN wf_less_trans], simp)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    79
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    80
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    81
subsection{*Remainder*}
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    82
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    83
lemma mod_less [simp]: "m<n ==> m mod n = (m::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
    84
  by (rule mod_eq [THEN wf_less_trans]) simp
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    85
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    86
lemma mod_geq: "~ m < (n::nat) ==> m mod n = (m-n) mod n"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
    87
  apply (cases "n=0")
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
    88
   apply simp
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
    89
  apply (rule mod_eq [THEN wf_less_trans])
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
    90
  apply (simp add: cut_apply less_eq)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
    91
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    92
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    93
(*Avoids the ugly ~m<n above*)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    94
lemma le_mod_geq: "(n::nat) \<le> m ==> m mod n = (m-n) mod n"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
    95
  by (simp add: mod_geq linorder_not_less)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    96
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    97
lemma mod_if: "m mod (n::nat) = (if m<n then m else (m-n) mod n)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
    98
  by (simp add: mod_geq)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
    99
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   100
lemma mod_1 [simp]: "m mod Suc 0 = 0"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   101
  by (induct m) (simp_all add: mod_geq)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   102
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   103
lemma mod_self [simp]: "n mod n = (0::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   104
  by (cases "n = 0") (simp_all add: mod_geq)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   105
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   106
lemma mod_add_self2 [simp]: "(m+n) mod n = m mod (n::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   107
  apply (subgoal_tac "(n + m) mod n = (n+m-n) mod n")
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   108
   apply (simp add: add_commute)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   109
  apply (subst mod_geq [symmetric], simp_all)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   110
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   111
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   112
lemma mod_add_self1 [simp]: "(n+m) mod n = m mod (n::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   113
  by (simp add: add_commute mod_add_self2)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   114
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   115
lemma mod_mult_self1 [simp]: "(m + k*n) mod n = m mod (n::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   116
  by (induct k) (simp_all add: add_left_commute [of _ n])
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   117
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   118
lemma mod_mult_self2 [simp]: "(m + n*k) mod n = m mod (n::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   119
  by (simp add: mult_commute mod_mult_self1)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   120
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   121
lemma mod_mult_distrib: "(m mod n) * (k::nat) = (m*k) mod (n*k)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   122
  apply (cases "n = 0", simp)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   123
  apply (cases "k = 0", simp)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   124
  apply (induct m rule: nat_less_induct)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   125
  apply (subst mod_if, simp)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   126
  apply (simp add: mod_geq diff_mult_distrib)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   127
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   128
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   129
lemma mod_mult_distrib2: "(k::nat) * (m mod n) = (k*m) mod (k*n)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   130
  by (simp add: mult_commute [of k] mod_mult_distrib)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   131
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   132
lemma mod_mult_self_is_0 [simp]: "(m*n) mod n = (0::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   133
  apply (cases "n = 0", simp)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   134
  apply (induct m, simp)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   135
  apply (rename_tac k)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   136
  apply (cut_tac m = "k * n" and n = n in mod_add_self2)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   137
  apply (simp add: add_commute)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   138
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   139
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   140
lemma mod_mult_self1_is_0 [simp]: "(n*m) mod n = (0::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   141
  by (simp add: mult_commute mod_mult_self_is_0)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   142
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   143
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   144
subsection{*Quotient*}
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   145
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   146
lemma div_less [simp]: "m<n ==> m div n = (0::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   147
  by (rule div_eq [THEN wf_less_trans], simp)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   148
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   149
lemma div_geq: "[| 0<n;  ~m<n |] ==> m div n = Suc((m-n) div n)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   150
  apply (rule div_eq [THEN wf_less_trans])
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   151
  apply (simp add: cut_apply less_eq)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   152
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   153
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   154
(*Avoids the ugly ~m<n above*)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   155
lemma le_div_geq: "[| 0<n;  n\<le>m |] ==> m div n = Suc((m-n) div n)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   156
  by (simp add: div_geq linorder_not_less)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   157
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   158
lemma div_if: "0<n ==> m div n = (if m<n then 0 else Suc((m-n) div n))"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   159
  by (simp add: div_geq)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   160
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   161
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   162
(*Main Result about quotient and remainder.*)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   163
lemma mod_div_equality: "(m div n)*n + m mod n = (m::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   164
  apply (cases "n = 0", simp)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   165
  apply (induct m rule: nat_less_induct)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   166
  apply (subst mod_if)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   167
  apply (simp_all add: add_assoc div_geq add_diff_inverse)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   168
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   169
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   170
lemma mod_div_equality2: "n * (m div n) + m mod n = (m::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   171
  apply (cut_tac m = m and n = n in mod_div_equality)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   172
  apply (simp add: mult_commute)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   173
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   174
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   175
subsection{*Simproc for Cancelling Div and Mod*}
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   176
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   177
lemma div_mod_equality: "((m div n)*n + m mod n) + k = (m::nat) + k"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   178
  by (simp add: mod_div_equality)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   179
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   180
lemma div_mod_equality2: "(n*(m div n) + m mod n) + k = (m::nat) + k"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   181
  by (simp add: mod_div_equality2)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   182
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   183
ML
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   184
{*
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   185
structure CancelDivModData =
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   186
struct
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   187
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   188
val div_name = @{const_name Divides.div};
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   189
val mod_name = @{const_name Divides.mod};
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   190
val mk_binop = HOLogic.mk_binop;
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   191
val mk_sum = NatArithUtils.mk_sum;
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   192
val dest_sum = NatArithUtils.dest_sum;
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   193
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   194
(*logic*)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   195
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   196
val div_mod_eqs = map mk_meta_eq [@{thm div_mod_equality}, @{thm div_mod_equality2}]
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   197
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   198
val trans = trans
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   199
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   200
val prove_eq_sums =
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   201
  let val simps = @{thm add_0} :: @{thm add_0_right} :: @{thms add_ac}
17609
5156b731ebc8 Provers/cancel_sums.ML: Simplifier.inherit_bounds;
wenzelm
parents: 17508
diff changeset
   202
  in NatArithUtils.prove_conv all_tac (NatArithUtils.simp_all_tac simps) end;
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   203
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   204
end;
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   205
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   206
structure CancelDivMod = CancelDivModFun(CancelDivModData);
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   207
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   208
val cancel_div_mod_proc = NatArithUtils.prep_simproc
20044
92cc2f4c7335 simprocs: no theory argument -- use simpset context instead;
wenzelm
parents: 18702
diff changeset
   209
      ("cancel_div_mod", ["(m::nat) + n"], K CancelDivMod.proc);
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   210
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   211
Addsimprocs[cancel_div_mod_proc];
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   212
*}
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   213
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   214
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   215
(* a simple rearrangement of mod_div_equality: *)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   216
lemma mult_div_cancel: "(n::nat) * (m div n) = m - (m mod n)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   217
  by (cut_tac m = m and n = n in mod_div_equality2, arith)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   218
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   219
lemma mod_less_divisor [simp]: "0<n ==> m mod n < (n::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   220
  apply (induct m rule: nat_less_induct)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   221
  apply (rename_tac m)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   222
  apply (case_tac "m<n", simp)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   223
  txt{*case @{term "n \<le> m"}*}
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   224
  apply (simp add: mod_geq)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   225
  done
15439
71c0f98e31f1 made diff_less a simp rule
nipkow
parents: 15251
diff changeset
   226
71c0f98e31f1 made diff_less a simp rule
nipkow
parents: 15251
diff changeset
   227
lemma mod_le_divisor[simp]: "0 < n \<Longrightarrow> m mod n \<le> (n::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   228
  apply (drule mod_less_divisor [where m = m])
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   229
  apply simp
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   230
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   231
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   232
lemma div_mult_self_is_m [simp]: "0<n ==> (m*n) div n = (m::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   233
  by (cut_tac m = "m*n" and n = n in mod_div_equality, auto)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   234
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   235
lemma div_mult_self1_is_m [simp]: "0<n ==> (n*m) div n = (m::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   236
  by (simp add: mult_commute div_mult_self_is_m)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   237
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   238
(*mod_mult_distrib2 above is the counterpart for remainder*)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   239
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   240
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   241
subsection{*Proving facts about Quotient and Remainder*}
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   242
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   243
lemma unique_quotient_lemma:
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   244
     "[| b*q' + r'  \<le> b*q + r;  x < b;  r < b |]
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   245
      ==> q' \<le> (q::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   246
  apply (rule leI)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   247
  apply (subst less_iff_Suc_add)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   248
  apply (auto simp add: add_mult_distrib2)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   249
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   250
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   251
lemma unique_quotient:
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   252
     "[| quorem ((a,b), (q,r));  quorem ((a,b), (q',r'));  0 < b |]
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   253
      ==> q = q'"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   254
  apply (simp add: split_ifs quorem_def)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   255
  apply (blast intro: order_antisym
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   256
    dest: order_eq_refl [THEN unique_quotient_lemma] sym)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   257
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   258
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   259
lemma unique_remainder:
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   260
     "[| quorem ((a,b), (q,r));  quorem ((a,b), (q',r'));  0 < b |]
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   261
      ==> r = r'"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   262
  apply (subgoal_tac "q = q'")
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   263
   prefer 2 apply (blast intro: unique_quotient)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   264
  apply (simp add: quorem_def)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   265
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   266
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   267
lemma quorem_div_mod: "0 < b ==> quorem ((a, b), (a div b, a mod b))"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   268
  unfolding quorem_def by simp
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   269
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   270
lemma quorem_div: "[| quorem((a,b),(q,r));  0 < b |] ==> a div b = q"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   271
  by (simp add: quorem_div_mod [THEN unique_quotient])
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   272
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   273
lemma quorem_mod: "[| quorem((a,b),(q,r));  0 < b |] ==> a mod b = r"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   274
  by (simp add: quorem_div_mod [THEN unique_remainder])
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   275
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   276
(** A dividend of zero **)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   277
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   278
lemma div_0 [simp]: "0 div m = (0::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   279
  by (cases "m = 0") simp_all
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   280
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   281
lemma mod_0 [simp]: "0 mod m = (0::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   282
  by (cases "m = 0") simp_all
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   283
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   284
(** proving (a*b) div c = a * (b div c) + a * (b mod c) **)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   285
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   286
lemma quorem_mult1_eq:
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   287
     "[| quorem((b,c),(q,r));  0 < c |]
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   288
      ==> quorem ((a*b, c), (a*q + a*r div c, a*r mod c))"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   289
  by (auto simp add: split_ifs mult_ac quorem_def add_mult_distrib2)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   290
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   291
lemma div_mult1_eq: "(a*b) div c = a*(b div c) + a*(b mod c) div (c::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   292
  apply (cases "c = 0", simp)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   293
  apply (blast intro: quorem_div_mod [THEN quorem_mult1_eq, THEN quorem_div])
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   294
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   295
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   296
lemma mod_mult1_eq: "(a*b) mod c = a*(b mod c) mod (c::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   297
  apply (cases "c = 0", simp)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   298
  apply (blast intro: quorem_div_mod [THEN quorem_mult1_eq, THEN quorem_mod])
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   299
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   300
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   301
lemma mod_mult1_eq': "(a*b) mod (c::nat) = ((a mod c) * b) mod c"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   302
  apply (rule trans)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   303
   apply (rule_tac s = "b*a mod c" in trans)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   304
    apply (rule_tac [2] mod_mult1_eq)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   305
   apply (simp_all add: mult_commute)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   306
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   307
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   308
lemma mod_mult_distrib_mod: "(a*b) mod (c::nat) = ((a mod c) * (b mod c)) mod c"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   309
  apply (rule mod_mult1_eq' [THEN trans])
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   310
  apply (rule mod_mult1_eq)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   311
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   312
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   313
(** proving (a+b) div c = a div c + b div c + ((a mod c + b mod c) div c) **)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   314
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   315
lemma quorem_add1_eq:
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   316
     "[| quorem((a,c),(aq,ar));  quorem((b,c),(bq,br));  0 < c |]
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   317
      ==> quorem ((a+b, c), (aq + bq + (ar+br) div c, (ar+br) mod c))"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   318
  by (auto simp add: split_ifs mult_ac quorem_def add_mult_distrib2)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   319
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   320
(*NOT suitable for rewriting: the RHS has an instance of the LHS*)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   321
lemma div_add1_eq:
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   322
     "(a+b) div (c::nat) = a div c + b div c + ((a mod c + b mod c) div c)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   323
  apply (cases "c = 0", simp)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   324
  apply (blast intro: quorem_add1_eq [THEN quorem_div] quorem_div_mod quorem_div_mod)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   325
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   326
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   327
lemma mod_add1_eq: "(a+b) mod (c::nat) = (a mod c + b mod c) mod c"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   328
  apply (cases "c = 0", simp)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   329
  apply (blast intro: quorem_div_mod quorem_div_mod quorem_add1_eq [THEN quorem_mod])
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   330
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   331
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   332
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   333
subsection{*Proving @{term "a div (b*c) = (a div b) div c"}*}
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   334
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   335
(** first, a lemma to bound the remainder **)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   336
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   337
lemma mod_lemma: "[| (0::nat) < c; r < b |] ==> b * (q mod c) + r < b * c"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   338
  apply (cut_tac m = q and n = c in mod_less_divisor)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   339
  apply (drule_tac [2] m = "q mod c" in less_imp_Suc_add, auto)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   340
  apply (erule_tac P = "%x. ?lhs < ?rhs x" in ssubst)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   341
  apply (simp add: add_mult_distrib2)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   342
  done
10559
d3fd54fc659b many new div and mod properties (borrowed from Integ/IntDiv)
paulson
parents: 10214
diff changeset
   343
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   344
lemma quorem_mult2_eq: "[| quorem ((a,b), (q,r));  0 < b;  0 < c |]
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   345
      ==> quorem ((a, b*c), (q div c, b*(q mod c) + r))"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   346
  by (auto simp add: mult_ac quorem_def add_mult_distrib2 [symmetric] mod_lemma)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   347
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   348
lemma div_mult2_eq: "a div (b*c) = (a div b) div (c::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   349
  apply (cases "b = 0", simp)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   350
  apply (cases "c = 0", simp)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   351
  apply (force simp add: quorem_div_mod [THEN quorem_mult2_eq, THEN quorem_div])
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   352
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   353
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   354
lemma mod_mult2_eq: "a mod (b*c) = b*(a div b mod c) + a mod (b::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   355
  apply (cases "b = 0", simp)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   356
  apply (cases "c = 0", simp)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   357
  apply (auto simp add: mult_commute quorem_div_mod [THEN quorem_mult2_eq, THEN quorem_mod])
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   358
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   359
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   360
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   361
subsection{*Cancellation of Common Factors in Division*}
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   362
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   363
lemma div_mult_mult_lemma:
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   364
    "[| (0::nat) < b;  0 < c |] ==> (c*a) div (c*b) = a div b"
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   365
  by (auto simp add: div_mult2_eq)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   366
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   367
lemma div_mult_mult1 [simp]: "(0::nat) < c ==> (c*a) div (c*b) = a div b"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   368
  apply (cases "b = 0")
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   369
  apply (auto simp add: linorder_neq_iff [of b] div_mult_mult_lemma)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   370
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   371
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   372
lemma div_mult_mult2 [simp]: "(0::nat) < c ==> (a*c) div (b*c) = a div b"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   373
  apply (drule div_mult_mult1)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   374
  apply (auto simp add: mult_commute)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   375
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   376
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   377
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   378
(*Distribution of Factors over Remainders:
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   379
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   380
Could prove these as in Integ/IntDiv.ML, but we already have
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   381
mod_mult_distrib and mod_mult_distrib2 above!
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   382
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   383
Goal "(c*a) mod (c*b) = (c::nat) * (a mod b)"
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   384
qed "mod_mult_mult1";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   385
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   386
Goal "(a*c) mod (b*c) = (a mod b) * (c::nat)";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   387
qed "mod_mult_mult2";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   388
 ***)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   389
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   390
subsection{*Further Facts about Quotient and Remainder*}
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   391
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   392
lemma div_1 [simp]: "m div Suc 0 = m"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   393
  by (induct m) (simp_all add: div_geq)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   394
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   395
lemma div_self [simp]: "0<n ==> n div n = (1::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   396
  by (simp add: div_geq)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   397
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   398
lemma div_add_self2: "0<n ==> (m+n) div n = Suc (m div n)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   399
  apply (subgoal_tac "(n + m) div n = Suc ((n+m-n) div n) ")
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   400
   apply (simp add: add_commute)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   401
  apply (subst div_geq [symmetric], simp_all)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   402
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   403
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   404
lemma div_add_self1: "0<n ==> (n+m) div n = Suc (m div n)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   405
  by (simp add: add_commute div_add_self2)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   406
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   407
lemma div_mult_self1 [simp]: "!!n::nat. 0<n ==> (m + k*n) div n = k + m div n"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   408
  apply (subst div_add1_eq)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   409
  apply (subst div_mult1_eq, simp)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   410
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   411
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   412
lemma div_mult_self2 [simp]: "0<n ==> (m + n*k) div n = k + m div (n::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   413
  by (simp add: mult_commute div_mult_self1)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   414
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   415
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   416
(* Monotonicity of div in first argument *)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   417
lemma div_le_mono [rule_format (no_asm)]:
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   418
    "\<forall>m::nat. m \<le> n --> (m div k) \<le> (n div k)"
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   419
apply (case_tac "k=0", simp)
15251
bb6f072c8d10 converted some induct_tac to induct
paulson
parents: 15140
diff changeset
   420
apply (induct "n" rule: nat_less_induct, clarify)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   421
apply (case_tac "n<k")
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   422
(* 1  case n<k *)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   423
apply simp
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   424
(* 2  case n >= k *)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   425
apply (case_tac "m<k")
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   426
(* 2.1  case m<k *)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   427
apply simp
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   428
(* 2.2  case m>=k *)
15439
71c0f98e31f1 made diff_less a simp rule
nipkow
parents: 15251
diff changeset
   429
apply (simp add: div_geq diff_le_mono)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   430
done
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   431
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   432
(* Antimonotonicity of div in second argument *)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   433
lemma div_le_mono2: "!!m::nat. [| 0<m; m\<le>n |] ==> (k div n) \<le> (k div m)"
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   434
apply (subgoal_tac "0<n")
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   435
 prefer 2 apply simp
15251
bb6f072c8d10 converted some induct_tac to induct
paulson
parents: 15140
diff changeset
   436
apply (induct_tac k rule: nat_less_induct)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   437
apply (rename_tac "k")
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   438
apply (case_tac "k<n", simp)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   439
apply (subgoal_tac "~ (k<m) ")
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   440
 prefer 2 apply simp
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   441
apply (simp add: div_geq)
15251
bb6f072c8d10 converted some induct_tac to induct
paulson
parents: 15140
diff changeset
   442
apply (subgoal_tac "(k-n) div n \<le> (k-m) div n")
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   443
 prefer 2
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   444
 apply (blast intro: div_le_mono diff_le_mono2)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   445
apply (rule le_trans, simp)
15439
71c0f98e31f1 made diff_less a simp rule
nipkow
parents: 15251
diff changeset
   446
apply (simp)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   447
done
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   448
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   449
lemma div_le_dividend [simp]: "m div n \<le> (m::nat)"
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   450
apply (case_tac "n=0", simp)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   451
apply (subgoal_tac "m div n \<le> m div 1", simp)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   452
apply (rule div_le_mono2)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   453
apply (simp_all (no_asm_simp))
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   454
done
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   455
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   456
(* Similar for "less than" *)
17085
5b57f995a179 more simprules now have names
paulson
parents: 17084
diff changeset
   457
lemma div_less_dividend [rule_format]:
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   458
     "!!n::nat. 1<n ==> 0 < m --> m div n < m"
15251
bb6f072c8d10 converted some induct_tac to induct
paulson
parents: 15140
diff changeset
   459
apply (induct_tac m rule: nat_less_induct)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   460
apply (rename_tac "m")
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   461
apply (case_tac "m<n", simp)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   462
apply (subgoal_tac "0<n")
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   463
 prefer 2 apply simp
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   464
apply (simp add: div_geq)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   465
apply (case_tac "n<m")
15251
bb6f072c8d10 converted some induct_tac to induct
paulson
parents: 15140
diff changeset
   466
 apply (subgoal_tac "(m-n) div n < (m-n) ")
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   467
  apply (rule impI less_trans_Suc)+
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   468
apply assumption
15439
71c0f98e31f1 made diff_less a simp rule
nipkow
parents: 15251
diff changeset
   469
  apply (simp_all)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   470
done
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   471
17085
5b57f995a179 more simprules now have names
paulson
parents: 17084
diff changeset
   472
declare div_less_dividend [simp]
5b57f995a179 more simprules now have names
paulson
parents: 17084
diff changeset
   473
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   474
text{*A fact for the mutilated chess board*}
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   475
lemma mod_Suc: "Suc(m) mod n = (if Suc(m mod n) = n then 0 else Suc(m mod n))"
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   476
apply (case_tac "n=0", simp)
15251
bb6f072c8d10 converted some induct_tac to induct
paulson
parents: 15140
diff changeset
   477
apply (induct "m" rule: nat_less_induct)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   478
apply (case_tac "Suc (na) <n")
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   479
(* case Suc(na) < n *)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   480
apply (frule lessI [THEN less_trans], simp add: less_not_refl3)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   481
(* case n \<le> Suc(na) *)
16796
140f1e0ea846 generlization of some "nat" theorems
paulson
parents: 16733
diff changeset
   482
apply (simp add: linorder_not_less le_Suc_eq mod_geq)
15439
71c0f98e31f1 made diff_less a simp rule
nipkow
parents: 15251
diff changeset
   483
apply (auto simp add: Suc_diff_le le_mod_geq)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   484
done
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   485
14437
92f6aa05b7bb some new results
paulson
parents: 14430
diff changeset
   486
lemma nat_mod_div_trivial [simp]: "m mod n div n = (0 :: nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   487
  by (cases "n = 0") auto
14437
92f6aa05b7bb some new results
paulson
parents: 14430
diff changeset
   488
92f6aa05b7bb some new results
paulson
parents: 14430
diff changeset
   489
lemma nat_mod_mod_trivial [simp]: "m mod n mod n = (m mod n :: nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   490
  by (cases "n = 0") auto
14437
92f6aa05b7bb some new results
paulson
parents: 14430
diff changeset
   491
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   492
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   493
subsection{*The Divides Relation*}
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   494
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   495
lemma dvdI [intro?]: "n = m * k ==> m dvd n"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   496
  unfolding dvd_def by blast
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   497
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   498
lemma dvdE [elim?]: "!!P. [|m dvd n;  !!k. n = m*k ==> P|] ==> P"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   499
  unfolding dvd_def by blast
13152
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
   500
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   501
lemma dvd_0_right [iff]: "m dvd (0::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   502
  unfolding dvd_def by (blast intro: mult_0_right [symmetric])
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   503
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   504
lemma dvd_0_left: "0 dvd m ==> m = (0::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   505
  by (force simp add: dvd_def)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   506
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   507
lemma dvd_0_left_iff [iff]: "(0 dvd (m::nat)) = (m = 0)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   508
  by (blast intro: dvd_0_left)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   509
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   510
lemma dvd_1_left [iff]: "Suc 0 dvd k"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   511
  unfolding dvd_def by simp
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   512
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   513
lemma dvd_1_iff_1 [simp]: "(m dvd Suc 0) = (m = Suc 0)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   514
  by (simp add: dvd_def)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   515
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   516
lemma dvd_refl [simp]: "m dvd (m::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   517
  unfolding dvd_def by (blast intro: mult_1_right [symmetric])
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   518
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   519
lemma dvd_trans [trans]: "[| m dvd n; n dvd p |] ==> m dvd (p::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   520
  unfolding dvd_def by (blast intro: mult_assoc)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   521
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   522
lemma dvd_anti_sym: "[| m dvd n; n dvd m |] ==> m = (n::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   523
  unfolding dvd_def
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   524
  by (force dest: mult_eq_self_implies_10 simp add: mult_assoc mult_eq_1_iff)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   525
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   526
lemma dvd_add: "[| k dvd m; k dvd n |] ==> k dvd (m+n :: nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   527
  unfolding dvd_def
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   528
  by (blast intro: add_mult_distrib2 [symmetric])
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   529
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   530
lemma dvd_diff: "[| k dvd m; k dvd n |] ==> k dvd (m-n :: nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   531
  unfolding dvd_def
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   532
  by (blast intro: diff_mult_distrib2 [symmetric])
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   533
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   534
lemma dvd_diffD: "[| k dvd m-n; k dvd n; n\<le>m |] ==> k dvd (m::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   535
  apply (erule linorder_not_less [THEN iffD2, THEN add_diff_inverse, THEN subst])
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   536
  apply (blast intro: dvd_add)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   537
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   538
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   539
lemma dvd_diffD1: "[| k dvd m-n; k dvd m; n\<le>m |] ==> k dvd (n::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   540
  by (drule_tac m = m in dvd_diff, auto)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   541
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   542
lemma dvd_mult: "k dvd n ==> k dvd (m*n :: nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   543
  unfolding dvd_def by (blast intro: mult_left_commute)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   544
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   545
lemma dvd_mult2: "k dvd m ==> k dvd (m*n :: nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   546
  apply (subst mult_commute)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   547
  apply (erule dvd_mult)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   548
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   549
17084
fb0a80aef0be classical rules must have names for ATP integration
paulson
parents: 16796
diff changeset
   550
lemma dvd_triv_right [iff]: "k dvd (m*k :: nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   551
  by (rule dvd_refl [THEN dvd_mult])
17084
fb0a80aef0be classical rules must have names for ATP integration
paulson
parents: 16796
diff changeset
   552
fb0a80aef0be classical rules must have names for ATP integration
paulson
parents: 16796
diff changeset
   553
lemma dvd_triv_left [iff]: "k dvd (k*m :: nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   554
  by (rule dvd_refl [THEN dvd_mult2])
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   555
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   556
lemma dvd_reduce: "(k dvd n + k) = (k dvd (n::nat))"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   557
  apply (rule iffI)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   558
   apply (erule_tac [2] dvd_add)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   559
   apply (rule_tac [2] dvd_refl)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   560
  apply (subgoal_tac "n = (n+k) -k")
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   561
   prefer 2 apply simp
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   562
  apply (erule ssubst)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   563
  apply (erule dvd_diff)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   564
  apply (rule dvd_refl)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   565
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   566
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   567
lemma dvd_mod: "!!n::nat. [| f dvd m; f dvd n |] ==> f dvd m mod n"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   568
  unfolding dvd_def
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   569
  apply (case_tac "n = 0", auto)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   570
  apply (blast intro: mod_mult_distrib2 [symmetric])
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   571
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   572
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   573
lemma dvd_mod_imp_dvd: "[| (k::nat) dvd m mod n;  k dvd n |] ==> k dvd m"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   574
  apply (subgoal_tac "k dvd (m div n) *n + m mod n")
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   575
   apply (simp add: mod_div_equality)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   576
  apply (simp only: dvd_add dvd_mult)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   577
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   578
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   579
lemma dvd_mod_iff: "k dvd n ==> ((k::nat) dvd m mod n) = (k dvd m)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   580
  by (blast intro: dvd_mod_imp_dvd dvd_mod)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   581
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   582
lemma dvd_mult_cancel: "!!k::nat. [| k*m dvd k*n; 0<k |] ==> m dvd n"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   583
  unfolding dvd_def
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   584
  apply (erule exE)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   585
  apply (simp add: mult_ac)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   586
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   587
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   588
lemma dvd_mult_cancel1: "0<m ==> (m*n dvd m) = (n = (1::nat))"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   589
  apply auto
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   590
   apply (subgoal_tac "m*n dvd m*1")
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   591
   apply (drule dvd_mult_cancel, auto)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   592
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   593
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   594
lemma dvd_mult_cancel2: "0<m ==> (n*m dvd m) = (n = (1::nat))"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   595
  apply (subst mult_commute)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   596
  apply (erule dvd_mult_cancel1)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   597
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   598
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   599
lemma mult_dvd_mono: "[| i dvd m; j dvd n|] ==> i*j dvd (m*n :: nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   600
  apply (unfold dvd_def, clarify)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   601
  apply (rule_tac x = "k*ka" in exI)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   602
  apply (simp add: mult_ac)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   603
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   604
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   605
lemma dvd_mult_left: "(i*j :: nat) dvd k ==> i dvd k"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   606
  by (simp add: dvd_def mult_assoc, blast)
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   607
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   608
lemma dvd_mult_right: "(i*j :: nat) dvd k ==> j dvd k"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   609
  apply (unfold dvd_def, clarify)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   610
  apply (rule_tac x = "i*k" in exI)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   611
  apply (simp add: mult_ac)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   612
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   613
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   614
lemma dvd_imp_le: "[| k dvd n; 0 < n |] ==> k \<le> (n::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   615
  apply (unfold dvd_def, clarify)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   616
  apply (simp_all (no_asm_use) add: zero_less_mult_iff)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   617
  apply (erule conjE)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   618
  apply (rule le_trans)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   619
   apply (rule_tac [2] le_refl [THEN mult_le_mono])
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   620
   apply (erule_tac [2] Suc_leI, simp)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   621
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   622
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   623
lemma dvd_eq_mod_eq_0: "!!k::nat. (k dvd n) = (n mod k = 0)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   624
  apply (unfold dvd_def)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   625
  apply (case_tac "k=0", simp, safe)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   626
   apply (simp add: mult_commute)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   627
  apply (rule_tac t = n and n1 = k in mod_div_equality [THEN subst])
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   628
  apply (subst mult_commute, simp)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   629
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   630
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   631
lemma dvd_mult_div_cancel: "n dvd m ==> n * (m div n) = (m::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   632
  apply (subgoal_tac "m mod n = 0")
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   633
   apply (simp add: mult_div_cancel)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   634
  apply (simp only: dvd_eq_mod_eq_0)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   635
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   636
21408
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
   637
lemma le_imp_power_dvd: "!!i::nat. m \<le> n ==> i^m dvd i^n"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   638
  apply (unfold dvd_def)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   639
  apply (erule linorder_not_less [THEN iffD2, THEN add_diff_inverse, THEN subst])
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   640
  apply (simp add: power_add)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   641
  done
21408
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
   642
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
   643
lemma nat_zero_less_power_iff [simp]: "(0 < x^n) = (x \<noteq> (0::nat) | n=0)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   644
  by (induct n) auto
21408
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
   645
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
   646
lemma power_le_dvd [rule_format]: "k^j dvd n --> i\<le>j --> k^i dvd (n::nat)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   647
  apply (induct j)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   648
   apply (simp_all add: le_Suc_eq)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   649
  apply (blast dest!: dvd_mult_right)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   650
  done
21408
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
   651
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
   652
lemma power_dvd_imp_le: "[|i^m dvd i^n;  (1::nat) < i|] ==> m \<le> n"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   653
  apply (rule power_le_imp_le_exp, assumption)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   654
  apply (erule dvd_imp_le, simp)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   655
  done
21408
fff1731da03b div is now a class
haftmann
parents: 21191
diff changeset
   656
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   657
lemma mod_eq_0_iff: "(m mod d = 0) = (\<exists>q::nat. m = d*q)"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   658
  by (auto simp add: dvd_eq_mod_eq_0 [symmetric] dvd_def)
17084
fb0a80aef0be classical rules must have names for ATP integration
paulson
parents: 16796
diff changeset
   659
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   660
lemmas mod_eq_0D [dest!] = mod_eq_0_iff [THEN iffD1]
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   661
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   662
(*Loses information, namely we also have r<d provided d is nonzero*)
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   663
lemma mod_eqD: "(m mod d = r) ==> \<exists>q::nat. m = r + q*d"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   664
  apply (cut_tac m = m in mod_div_equality)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   665
  apply (simp only: add_ac)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   666
  apply (blast intro: sym)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   667
  done
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   668
14131
a4fc8b1af5e7 declarations moved from PreList.thy
paulson
parents: 13882
diff changeset
   669
13152
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
   670
lemma split_div:
13189
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   671
 "P(n div k :: nat) =
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   672
 ((k = 0 \<longrightarrow> P 0) \<and> (k \<noteq> 0 \<longrightarrow> (!i. !j<k. n = k*i + j \<longrightarrow> P i)))"
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   673
 (is "?P = ?Q" is "_ = (_ \<and> (_ \<longrightarrow> ?R))")
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   674
proof
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   675
  assume P: ?P
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   676
  show ?Q
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   677
  proof (cases)
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   678
    assume "k = 0"
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   679
    with P show ?Q by(simp add:DIVISION_BY_ZERO_DIV)
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   680
  next
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   681
    assume not0: "k \<noteq> 0"
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   682
    thus ?Q
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   683
    proof (simp, intro allI impI)
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   684
      fix i j
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   685
      assume n: "n = k*i + j" and j: "j < k"
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   686
      show "P i"
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   687
      proof (cases)
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   688
        assume "i = 0"
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   689
        with n j P show "P i" by simp
13189
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   690
      next
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   691
        assume "i \<noteq> 0"
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   692
        with not0 n j P show "P i" by(simp add:add_ac)
13189
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   693
      qed
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   694
    qed
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   695
  qed
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   696
next
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   697
  assume Q: ?Q
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   698
  show ?P
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   699
  proof (cases)
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   700
    assume "k = 0"
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   701
    with Q show ?P by(simp add:DIVISION_BY_ZERO_DIV)
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   702
  next
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   703
    assume not0: "k \<noteq> 0"
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   704
    with Q have R: ?R by simp
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   705
    from not0 R[THEN spec,of "n div k",THEN spec, of "n mod k"]
13517
42efec18f5b2 Added div+mod cancelling simproc
nipkow
parents: 13189
diff changeset
   706
    show ?P by simp
13189
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   707
  qed
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   708
qed
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   709
13882
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   710
lemma split_div_lemma:
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   711
  "0 < n \<Longrightarrow> (n * q \<le> m \<and> m < n * (Suc q)) = (q = ((m::nat) div n))"
13882
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   712
  apply (rule iffI)
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   713
  apply (rule_tac a=m and r = "m - n * q" and r' = "m mod n" in unique_quotient)
16733
236dfafbeb63 linear arithmetic now takes "&" in assumptions apart.
nipkow
parents: 15439
diff changeset
   714
prefer 3; apply assumption
20432
07ec57376051 lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20380
diff changeset
   715
  apply (simp_all add: quorem_def) apply arith
13882
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   716
  apply (rule conjI)
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   717
  apply (rule_tac P="%x. n * (m div n) \<le> x" in
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   718
    subst [OF mod_div_equality [of _ n]])
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   719
  apply (simp only: add: mult_ac)
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   720
  apply (rule_tac P="%x. x < n + n * (m div n)" in
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   721
    subst [OF mod_div_equality [of _ n]])
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   722
  apply (simp only: add: mult_ac add_ac)
14208
144f45277d5a misc tidying
paulson
parents: 14131
diff changeset
   723
  apply (rule add_less_mono1, simp)
13882
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   724
  done
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   725
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   726
theorem split_div':
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   727
  "P ((m::nat) div n) = ((n = 0 \<and> P 0) \<or>
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   728
   (\<exists>q. (n * q \<le> m \<and> m < n * (Suc q)) \<and> P q))"
13882
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   729
  apply (case_tac "0 < n")
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   730
  apply (simp only: add: split_div_lemma)
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   731
  apply (simp_all add: DIVISION_BY_ZERO_DIV)
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   732
  done
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   733
13189
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   734
lemma split_mod:
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   735
 "P(n mod k :: nat) =
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   736
 ((k = 0 \<longrightarrow> P n) \<and> (k \<noteq> 0 \<longrightarrow> (!i. !j<k. n = k*i + j \<longrightarrow> P j)))"
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   737
 (is "?P = ?Q" is "_ = (_ \<and> (_ \<longrightarrow> ?R))")
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   738
proof
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   739
  assume P: ?P
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   740
  show ?Q
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   741
  proof (cases)
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   742
    assume "k = 0"
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   743
    with P show ?Q by(simp add:DIVISION_BY_ZERO_MOD)
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   744
  next
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   745
    assume not0: "k \<noteq> 0"
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   746
    thus ?Q
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   747
    proof (simp, intro allI impI)
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   748
      fix i j
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   749
      assume "n = k*i + j" "j < k"
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   750
      thus "P j" using not0 P by(simp add:add_ac mult_ac)
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   751
    qed
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   752
  qed
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   753
next
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   754
  assume Q: ?Q
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   755
  show ?P
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   756
  proof (cases)
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   757
    assume "k = 0"
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   758
    with Q show ?P by(simp add:DIVISION_BY_ZERO_MOD)
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   759
  next
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   760
    assume not0: "k \<noteq> 0"
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   761
    with Q have R: ?R by simp
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   762
    from not0 R[THEN spec,of "n div k",THEN spec, of "n mod k"]
13517
42efec18f5b2 Added div+mod cancelling simproc
nipkow
parents: 13189
diff changeset
   763
    show ?P by simp
13189
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   764
  qed
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   765
qed
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
   766
13882
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   767
theorem mod_div_equality': "(m::nat) mod n = m - (m div n) * n"
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   768
  apply (rule_tac P="%x. m mod n = x - (m div n) * n" in
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   769
    subst [OF mod_div_equality [of _ n]])
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   770
  apply arith
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   771
  done
2266550ab316 New theorems split_div' and mod_div_equality'.
berghofe
parents: 13517
diff changeset
   772
22800
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   773
lemma div_mod_equality':
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   774
  fixes m n :: nat
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   775
  shows "m div n * n = m - m mod n"
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   776
proof -
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   777
  have "m mod n \<le> m mod n" ..
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   778
  from div_mod_equality have 
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   779
    "m div n * n + m mod n - m mod n = m - m mod n" by simp
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   780
  with diff_add_assoc [OF `m mod n \<le> m mod n`, of "m div n * n"] have
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   781
    "m div n * n + (m mod n - m mod n) = m - m mod n"
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   782
    by simp
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   783
  then show ?thesis by simp
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   784
qed
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   785
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   786
14640
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   787
subsection {*An ``induction'' law for modulus arithmetic.*}
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   788
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   789
lemma mod_induct_0:
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   790
  assumes step: "\<forall>i<p. P i \<longrightarrow> P ((Suc i) mod p)"
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   791
  and base: "P i" and i: "i<p"
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   792
  shows "P 0"
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   793
proof (rule ccontr)
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   794
  assume contra: "\<not>(P 0)"
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   795
  from i have p: "0<p" by simp
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   796
  have "\<forall>k. 0<k \<longrightarrow> \<not> P (p-k)" (is "\<forall>k. ?A k")
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   797
  proof
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   798
    fix k
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   799
    show "?A k"
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   800
    proof (induct k)
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   801
      show "?A 0" by simp  -- "by contradiction"
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   802
    next
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   803
      fix n
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   804
      assume ih: "?A n"
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   805
      show "?A (Suc n)"
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   806
      proof (clarsimp)
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   807
        assume y: "P (p - Suc n)"
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   808
        have n: "Suc n < p"
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   809
        proof (rule ccontr)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   810
          assume "\<not>(Suc n < p)"
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   811
          hence "p - Suc n = 0"
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   812
            by simp
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   813
          with y contra show "False"
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   814
            by simp
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   815
        qed
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   816
        hence n2: "Suc (p - Suc n) = p-n" by arith
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   817
        from p have "p - Suc n < p" by arith
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   818
        with y step have z: "P ((Suc (p - Suc n)) mod p)"
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   819
          by blast
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   820
        show "False"
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   821
        proof (cases "n=0")
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   822
          case True
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   823
          with z n2 contra show ?thesis by simp
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   824
        next
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   825
          case False
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   826
          with p have "p-n < p" by arith
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   827
          with z n2 False ih show ?thesis by simp
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   828
        qed
14640
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   829
      qed
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   830
    qed
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   831
  qed
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   832
  moreover
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   833
  from i obtain k where "0<k \<and> i+k=p"
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   834
    by (blast dest: less_imp_add_positive)
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   835
  hence "0<k \<and> i=p-k" by auto
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   836
  moreover
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   837
  note base
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   838
  ultimately
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   839
  show "False" by blast
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   840
qed
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   841
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   842
lemma mod_induct:
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   843
  assumes step: "\<forall>i<p. P i \<longrightarrow> P ((Suc i) mod p)"
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   844
  and base: "P i" and i: "i<p" and j: "j<p"
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   845
  shows "P j"
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   846
proof -
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   847
  have "\<forall>j<p. P j"
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   848
  proof
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   849
    fix j
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   850
    show "j<p \<longrightarrow> P j" (is "?A j")
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   851
    proof (induct j)
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   852
      from step base i show "?A 0"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   853
        by (auto elim: mod_induct_0)
14640
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   854
    next
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   855
      fix k
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   856
      assume ih: "?A k"
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   857
      show "?A (Suc k)"
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   858
      proof
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   859
        assume suc: "Suc k < p"
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   860
        hence k: "k<p" by simp
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   861
        with ih have "P k" ..
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   862
        with step k have "P (Suc k mod p)"
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   863
          by blast
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   864
        moreover
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   865
        from suc have "Suc k mod p = Suc k"
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   866
          by simp
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   867
        ultimately
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   868
        show "P (Suc k)" by simp
14640
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   869
      qed
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   870
    qed
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   871
  qed
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   872
  with j show ?thesis by blast
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   873
qed
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   874
b31870c50c68 new lemmas
paulson
parents: 14437
diff changeset
   875
18202
46af82efd311 presburger method updated to deal better with mod and div, tweo lemmas added to Divides.thy
chaieb
parents: 18154
diff changeset
   876
lemma mod_add_left_eq: "((a::nat) + b) mod c = (a mod c + b) mod c"
46af82efd311 presburger method updated to deal better with mod and div, tweo lemmas added to Divides.thy
chaieb
parents: 18154
diff changeset
   877
  apply (rule trans [symmetric])
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   878
   apply (rule mod_add1_eq, simp)
18202
46af82efd311 presburger method updated to deal better with mod and div, tweo lemmas added to Divides.thy
chaieb
parents: 18154
diff changeset
   879
  apply (rule mod_add1_eq [symmetric])
46af82efd311 presburger method updated to deal better with mod and div, tweo lemmas added to Divides.thy
chaieb
parents: 18154
diff changeset
   880
  done
46af82efd311 presburger method updated to deal better with mod and div, tweo lemmas added to Divides.thy
chaieb
parents: 18154
diff changeset
   881
46af82efd311 presburger method updated to deal better with mod and div, tweo lemmas added to Divides.thy
chaieb
parents: 18154
diff changeset
   882
lemma mod_add_right_eq: "(a+b) mod (c::nat) = (a + (b mod c)) mod c"
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   883
  apply (rule trans [symmetric])
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   884
   apply (rule mod_add1_eq, simp)
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   885
  apply (rule mod_add1_eq [symmetric])
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   886
  done
18202
46af82efd311 presburger method updated to deal better with mod and div, tweo lemmas added to Divides.thy
chaieb
parents: 18154
diff changeset
   887
22800
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   888
lemma mod_div_decomp:
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   889
  fixes n k :: nat
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   890
  obtains m q where "m = n div k" and "q = n mod k"
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   891
    and "n = m * k + q"
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   892
proof -
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   893
  from mod_div_equality have "n = n div k * k + n mod k" by auto
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   894
  moreover have "n div k = n div k" ..
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   895
  moreover have "n mod k = n mod k" ..
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   896
  note that ultimately show thesis by blast
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   897
qed
eaf5e7ef35d9 added lemmatas
haftmann
parents: 22744
diff changeset
   898
20589
24ecf9bc1a0a explicit divmod algorithm for code generation
haftmann
parents: 20432
diff changeset
   899
22744
5cbe966d67a2 Isar definitions are now added explicitly to code theorem table
haftmann
parents: 22718
diff changeset
   900
subsection {* Code generation for div, mod and dvd on nat *}
20589
24ecf9bc1a0a explicit divmod algorithm for code generation
haftmann
parents: 20432
diff changeset
   901
22845
5f9138bcb3d7 changed code generator invocation syntax
haftmann
parents: 22800
diff changeset
   902
definition [code func del]:
20589
24ecf9bc1a0a explicit divmod algorithm for code generation
haftmann
parents: 20432
diff changeset
   903
  "divmod (m\<Colon>nat) n = (m div n, m mod n)"
24ecf9bc1a0a explicit divmod algorithm for code generation
haftmann
parents: 20432
diff changeset
   904
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   905
lemma divmod_zero [code]: "divmod m 0 = (0, m)"
20589
24ecf9bc1a0a explicit divmod algorithm for code generation
haftmann
parents: 20432
diff changeset
   906
  unfolding divmod_def by simp
24ecf9bc1a0a explicit divmod algorithm for code generation
haftmann
parents: 20432
diff changeset
   907
24ecf9bc1a0a explicit divmod algorithm for code generation
haftmann
parents: 20432
diff changeset
   908
lemma divmod_succ [code]:
24ecf9bc1a0a explicit divmod algorithm for code generation
haftmann
parents: 20432
diff changeset
   909
  "divmod m (Suc k) = (if m < Suc k then (0, m) else
24ecf9bc1a0a explicit divmod algorithm for code generation
haftmann
parents: 20432
diff changeset
   910
    let
24ecf9bc1a0a explicit divmod algorithm for code generation
haftmann
parents: 20432
diff changeset
   911
      (p, q) = divmod (m - Suc k) (Suc k)
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   912
    in (Suc p, q))"
20589
24ecf9bc1a0a explicit divmod algorithm for code generation
haftmann
parents: 20432
diff changeset
   913
  unfolding divmod_def Let_def split_def
24ecf9bc1a0a explicit divmod algorithm for code generation
haftmann
parents: 20432
diff changeset
   914
  by (auto intro: div_geq mod_geq)
24ecf9bc1a0a explicit divmod algorithm for code generation
haftmann
parents: 20432
diff changeset
   915
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   916
lemma div_divmod [code]: "m div n = fst (divmod m n)"
20589
24ecf9bc1a0a explicit divmod algorithm for code generation
haftmann
parents: 20432
diff changeset
   917
  unfolding divmod_def by simp
24ecf9bc1a0a explicit divmod algorithm for code generation
haftmann
parents: 20432
diff changeset
   918
22718
936f7580937d tuned proofs;
wenzelm
parents: 22473
diff changeset
   919
lemma mod_divmod [code]: "m mod n = snd (divmod m n)"
20589
24ecf9bc1a0a explicit divmod algorithm for code generation
haftmann
parents: 20432
diff changeset
   920
  unfolding divmod_def by simp
24ecf9bc1a0a explicit divmod algorithm for code generation
haftmann
parents: 20432
diff changeset
   921
22744
5cbe966d67a2 Isar definitions are now added explicitly to code theorem table
haftmann
parents: 22718
diff changeset
   922
definition
5cbe966d67a2 Isar definitions are now added explicitly to code theorem table
haftmann
parents: 22718
diff changeset
   923
  dvd_nat :: "nat \<Rightarrow> nat \<Rightarrow> bool"
5cbe966d67a2 Isar definitions are now added explicitly to code theorem table
haftmann
parents: 22718
diff changeset
   924
where
5cbe966d67a2 Isar definitions are now added explicitly to code theorem table
haftmann
parents: 22718
diff changeset
   925
  "dvd_nat m n \<longleftrightarrow> n mod m = (0 \<Colon> nat)"
5cbe966d67a2 Isar definitions are now added explicitly to code theorem table
haftmann
parents: 22718
diff changeset
   926
5cbe966d67a2 Isar definitions are now added explicitly to code theorem table
haftmann
parents: 22718
diff changeset
   927
lemma [code inline]:
5cbe966d67a2 Isar definitions are now added explicitly to code theorem table
haftmann
parents: 22718
diff changeset
   928
  "op dvd = dvd_nat"
5cbe966d67a2 Isar definitions are now added explicitly to code theorem table
haftmann
parents: 22718
diff changeset
   929
  by (auto simp add: dvd_nat_def dvd_eq_mod_eq_0 expand_fun_eq)
5cbe966d67a2 Isar definitions are now added explicitly to code theorem table
haftmann
parents: 22718
diff changeset
   930
21191
c00161fbf990 code generator module naming improved
haftmann
parents: 20640
diff changeset
   931
code_modulename SML
23017
00c0e4c42396 uniform module names for code generation
haftmann
parents: 22993
diff changeset
   932
  Divides Nat
20640
05e6042394b9 name shifts
haftmann
parents: 20589
diff changeset
   933
21911
e29bcab0c81c added OCaml code generation (without dictionaries)
haftmann
parents: 21408
diff changeset
   934
code_modulename OCaml
23017
00c0e4c42396 uniform module names for code generation
haftmann
parents: 22993
diff changeset
   935
  Divides Nat
00c0e4c42396 uniform module names for code generation
haftmann
parents: 22993
diff changeset
   936
00c0e4c42396 uniform module names for code generation
haftmann
parents: 22993
diff changeset
   937
code_modulename Haskell
00c0e4c42396 uniform module names for code generation
haftmann
parents: 22993
diff changeset
   938
  Divides Nat
21911
e29bcab0c81c added OCaml code generation (without dictionaries)
haftmann
parents: 21408
diff changeset
   939
22744
5cbe966d67a2 Isar definitions are now added explicitly to code theorem table
haftmann
parents: 22718
diff changeset
   940
hide (open) const divmod dvd_nat
20589
24ecf9bc1a0a explicit divmod algorithm for code generation
haftmann
parents: 20432
diff changeset
   941
24ecf9bc1a0a explicit divmod algorithm for code generation
haftmann
parents: 20432
diff changeset
   942
subsection {* Legacy bindings *}
24ecf9bc1a0a explicit divmod algorithm for code generation
haftmann
parents: 20432
diff changeset
   943
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   944
ML
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   945
{*
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   946
val div_def = thm "div_def"
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   947
val mod_def = thm "mod_def"
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   948
val dvd_def = thm "dvd_def"
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   949
val quorem_def = thm "quorem_def"
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   950
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   951
val wf_less_trans = thm "wf_less_trans";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   952
val mod_eq = thm "mod_eq";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   953
val div_eq = thm "div_eq";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   954
val DIVISION_BY_ZERO_DIV = thm "DIVISION_BY_ZERO_DIV";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   955
val DIVISION_BY_ZERO_MOD = thm "DIVISION_BY_ZERO_MOD";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   956
val mod_less = thm "mod_less";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   957
val mod_geq = thm "mod_geq";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   958
val le_mod_geq = thm "le_mod_geq";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   959
val mod_if = thm "mod_if";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   960
val mod_1 = thm "mod_1";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   961
val mod_self = thm "mod_self";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   962
val mod_add_self2 = thm "mod_add_self2";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   963
val mod_add_self1 = thm "mod_add_self1";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   964
val mod_mult_self1 = thm "mod_mult_self1";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   965
val mod_mult_self2 = thm "mod_mult_self2";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   966
val mod_mult_distrib = thm "mod_mult_distrib";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   967
val mod_mult_distrib2 = thm "mod_mult_distrib2";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   968
val mod_mult_self_is_0 = thm "mod_mult_self_is_0";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   969
val mod_mult_self1_is_0 = thm "mod_mult_self1_is_0";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   970
val div_less = thm "div_less";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   971
val div_geq = thm "div_geq";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   972
val le_div_geq = thm "le_div_geq";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   973
val div_if = thm "div_if";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   974
val mod_div_equality = thm "mod_div_equality";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   975
val mod_div_equality2 = thm "mod_div_equality2";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   976
val div_mod_equality = thm "div_mod_equality";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   977
val div_mod_equality2 = thm "div_mod_equality2";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   978
val mult_div_cancel = thm "mult_div_cancel";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   979
val mod_less_divisor = thm "mod_less_divisor";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   980
val div_mult_self_is_m = thm "div_mult_self_is_m";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   981
val div_mult_self1_is_m = thm "div_mult_self1_is_m";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   982
val unique_quotient_lemma = thm "unique_quotient_lemma";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   983
val unique_quotient = thm "unique_quotient";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   984
val unique_remainder = thm "unique_remainder";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   985
val div_0 = thm "div_0";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   986
val mod_0 = thm "mod_0";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   987
val div_mult1_eq = thm "div_mult1_eq";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   988
val mod_mult1_eq = thm "mod_mult1_eq";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   989
val mod_mult1_eq' = thm "mod_mult1_eq'";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   990
val mod_mult_distrib_mod = thm "mod_mult_distrib_mod";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   991
val div_add1_eq = thm "div_add1_eq";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   992
val mod_add1_eq = thm "mod_add1_eq";
18202
46af82efd311 presburger method updated to deal better with mod and div, tweo lemmas added to Divides.thy
chaieb
parents: 18154
diff changeset
   993
val mod_add_left_eq = thm "mod_add_left_eq";
46af82efd311 presburger method updated to deal better with mod and div, tweo lemmas added to Divides.thy
chaieb
parents: 18154
diff changeset
   994
 val mod_add_right_eq = thm "mod_add_right_eq";
14267
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   995
val mod_lemma = thm "mod_lemma";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   996
val div_mult2_eq = thm "div_mult2_eq";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   997
val mod_mult2_eq = thm "mod_mult2_eq";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   998
val div_mult_mult_lemma = thm "div_mult_mult_lemma";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
   999
val div_mult_mult1 = thm "div_mult_mult1";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1000
val div_mult_mult2 = thm "div_mult_mult2";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1001
val div_1 = thm "div_1";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1002
val div_self = thm "div_self";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1003
val div_add_self2 = thm "div_add_self2";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1004
val div_add_self1 = thm "div_add_self1";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1005
val div_mult_self1 = thm "div_mult_self1";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1006
val div_mult_self2 = thm "div_mult_self2";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1007
val div_le_mono = thm "div_le_mono";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1008
val div_le_mono2 = thm "div_le_mono2";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1009
val div_le_dividend = thm "div_le_dividend";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1010
val div_less_dividend = thm "div_less_dividend";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1011
val mod_Suc = thm "mod_Suc";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1012
val dvdI = thm "dvdI";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1013
val dvdE = thm "dvdE";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1014
val dvd_0_right = thm "dvd_0_right";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1015
val dvd_0_left = thm "dvd_0_left";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1016
val dvd_0_left_iff = thm "dvd_0_left_iff";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1017
val dvd_1_left = thm "dvd_1_left";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1018
val dvd_1_iff_1 = thm "dvd_1_iff_1";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1019
val dvd_refl = thm "dvd_refl";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1020
val dvd_trans = thm "dvd_trans";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1021
val dvd_anti_sym = thm "dvd_anti_sym";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1022
val dvd_add = thm "dvd_add";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1023
val dvd_diff = thm "dvd_diff";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1024
val dvd_diffD = thm "dvd_diffD";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1025
val dvd_diffD1 = thm "dvd_diffD1";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1026
val dvd_mult = thm "dvd_mult";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1027
val dvd_mult2 = thm "dvd_mult2";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1028
val dvd_reduce = thm "dvd_reduce";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1029
val dvd_mod = thm "dvd_mod";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1030
val dvd_mod_imp_dvd = thm "dvd_mod_imp_dvd";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1031
val dvd_mod_iff = thm "dvd_mod_iff";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1032
val dvd_mult_cancel = thm "dvd_mult_cancel";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1033
val dvd_mult_cancel1 = thm "dvd_mult_cancel1";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1034
val dvd_mult_cancel2 = thm "dvd_mult_cancel2";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1035
val mult_dvd_mono = thm "mult_dvd_mono";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1036
val dvd_mult_left = thm "dvd_mult_left";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1037
val dvd_mult_right = thm "dvd_mult_right";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1038
val dvd_imp_le = thm "dvd_imp_le";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1039
val dvd_eq_mod_eq_0 = thm "dvd_eq_mod_eq_0";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1040
val dvd_mult_div_cancel = thm "dvd_mult_div_cancel";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1041
val mod_eq_0_iff = thm "mod_eq_0_iff";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1042
val mod_eqD = thm "mod_eqD";
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1043
*}
b963e9cee2a0 More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents: 14208
diff changeset
  1044
13189
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
  1045
(*
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
  1046
lemma split_div:
13152
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1047
assumes m: "m \<noteq> 0"
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1048
shows "P(n div m :: nat) = (!i. !j<m. n = m*i + j \<longrightarrow> P i)"
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1049
       (is "?P = ?Q")
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1050
proof
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1051
  assume P: ?P
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1052
  show ?Q
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1053
  proof (intro allI impI)
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1054
    fix i j
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1055
    assume n: "n = m*i + j" and j: "j < m"
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1056
    show "P i"
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1057
    proof (cases)
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1058
      assume "i = 0"
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1059
      with n j P show "P i" by simp
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1060
    next
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1061
      assume "i \<noteq> 0"
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1062
      with n j P show "P i" by (simp add:add_ac div_mult_self1)
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1063
    qed
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1064
  qed
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1065
next
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1066
  assume Q: ?Q
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1067
  from m Q[THEN spec,of "n div m",THEN spec, of "n mod m"]
13517
42efec18f5b2 Added div+mod cancelling simproc
nipkow
parents: 13189
diff changeset
  1068
  show ?P by simp
13152
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1069
qed
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1070
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1071
lemma split_mod:
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1072
assumes m: "m \<noteq> 0"
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1073
shows "P(n mod m :: nat) = (!i. !j<m. n = m*i + j \<longrightarrow> P j)"
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1074
       (is "?P = ?Q")
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1075
proof
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1076
  assume P: ?P
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1077
  show ?Q
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1078
  proof (intro allI impI)
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1079
    fix i j
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1080
    assume "n = m*i + j" "j < m"
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1081
    thus "P j" using m P by(simp add:add_ac mult_ac)
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1082
  qed
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1083
next
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1084
  assume Q: ?Q
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1085
  from m Q[THEN spec,of "n div m",THEN spec, of "n mod m"]
13517
42efec18f5b2 Added div+mod cancelling simproc
nipkow
parents: 13189
diff changeset
  1086
  show ?P by simp
13152
2a54f99b44b3 Divides.ML -> Divides_lemmas.ML
nipkow
parents: 12338
diff changeset
  1087
qed
13189
81ed5c6de890 Now arith can deal with div/mod arbitrary nat numerals.
nipkow
parents: 13152
diff changeset
  1088
*)
3366
2402c6ab1561 Moving div and mod from Arith to Divides
paulson
parents:
diff changeset
  1089
end