src/HOL/GCD.thy
author nipkow
Wed Jul 15 20:34:58 2009 +0200 (2009-07-15)
changeset 32007 a2a3685f61c3
parent 31996 1d93369079c4
child 32045 efc5f4806cd5
permissions -rw-r--r--
Made "prime" executable
huffman@31706
     1
(*  Title:      GCD.thy
huffman@31706
     2
    Authors:    Christophe Tabacznyj, Lawrence C. Paulson, Amine Chaieb,
nipkow@31798
     3
                Thomas M. Rasmussen, Jeremy Avigad, Tobias Nipkow
huffman@31706
     4
huffman@31706
     5
huffman@31706
     6
This file deals with the functions gcd and lcm, and properties of
huffman@31706
     7
primes. Definitions and lemmas are proved uniformly for the natural
huffman@31706
     8
numbers and integers.
huffman@31706
     9
huffman@31706
    10
This file combines and revises a number of prior developments.
huffman@31706
    11
huffman@31706
    12
The original theories "GCD" and "Primes" were by Christophe Tabacznyj
huffman@31706
    13
and Lawrence C. Paulson, based on \cite{davenport92}. They introduced
huffman@31706
    14
gcd, lcm, and prime for the natural numbers.
huffman@31706
    15
huffman@31706
    16
The original theory "IntPrimes" was by Thomas M. Rasmussen, and
huffman@31706
    17
extended gcd, lcm, primes to the integers. Amine Chaieb provided
huffman@31706
    18
another extension of the notions to the integers, and added a number
huffman@31706
    19
of results to "Primes" and "GCD". IntPrimes also defined and developed
huffman@31706
    20
the congruence relations on the integers. The notion was extended to
huffman@31706
    21
the natural numbers by Chiaeb.
huffman@31706
    22
nipkow@31798
    23
Tobias Nipkow cleaned up a lot.
wenzelm@21256
    24
*)
wenzelm@21256
    25
huffman@31706
    26
huffman@31706
    27
header {* GCD *}
wenzelm@21256
    28
wenzelm@21256
    29
theory GCD
huffman@31706
    30
imports NatTransfer
huffman@31706
    31
begin
huffman@31706
    32
huffman@31706
    33
declare One_nat_def [simp del]
huffman@31706
    34
huffman@31706
    35
subsection {* gcd *}
huffman@31706
    36
nipkow@31992
    37
class gcd = zero + one + dvd +
huffman@31706
    38
huffman@31706
    39
fixes
huffman@31706
    40
  gcd :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" and
huffman@31706
    41
  lcm :: "'a \<Rightarrow> 'a \<Rightarrow> 'a"
huffman@31706
    42
wenzelm@21256
    43
begin
wenzelm@21256
    44
huffman@31706
    45
abbreviation
huffman@31706
    46
  coprime :: "'a \<Rightarrow> 'a \<Rightarrow> bool"
huffman@31706
    47
where
huffman@31706
    48
  "coprime x y == (gcd x y = 1)"
huffman@31706
    49
huffman@31706
    50
end
huffman@31706
    51
huffman@31706
    52
class prime = one +
huffman@31706
    53
huffman@31706
    54
fixes
huffman@31706
    55
  prime :: "'a \<Rightarrow> bool"
huffman@31706
    56
huffman@31706
    57
huffman@31706
    58
(* definitions for the natural numbers *)
huffman@31706
    59
huffman@31706
    60
instantiation nat :: gcd
huffman@31706
    61
huffman@31706
    62
begin
wenzelm@21256
    63
huffman@31706
    64
fun
huffman@31706
    65
  gcd_nat  :: "nat \<Rightarrow> nat \<Rightarrow> nat"
huffman@31706
    66
where
huffman@31706
    67
  "gcd_nat x y =
huffman@31706
    68
   (if y = 0 then x else gcd y (x mod y))"
huffman@31706
    69
huffman@31706
    70
definition
huffman@31706
    71
  lcm_nat :: "nat \<Rightarrow> nat \<Rightarrow> nat"
huffman@31706
    72
where
huffman@31706
    73
  "lcm_nat x y = x * y div (gcd x y)"
huffman@31706
    74
huffman@31706
    75
instance proof qed
huffman@31706
    76
huffman@31706
    77
end
huffman@31706
    78
huffman@31706
    79
huffman@31706
    80
instantiation nat :: prime
huffman@31706
    81
huffman@31706
    82
begin
wenzelm@21256
    83
wenzelm@21263
    84
definition
huffman@31706
    85
  prime_nat :: "nat \<Rightarrow> bool"
huffman@31706
    86
where
huffman@31709
    87
  [code del]: "prime_nat p = (1 < p \<and> (\<forall>m. m dvd p --> m = 1 \<or> m = p))"
huffman@31706
    88
huffman@31706
    89
instance proof qed
haftmann@23687
    90
huffman@31706
    91
end
huffman@31706
    92
haftmann@23687
    93
huffman@31706
    94
(* definitions for the integers *)
huffman@31706
    95
huffman@31706
    96
instantiation int :: gcd
haftmann@23687
    97
huffman@31706
    98
begin
wenzelm@21256
    99
huffman@31706
   100
definition
huffman@31706
   101
  gcd_int  :: "int \<Rightarrow> int \<Rightarrow> int"
huffman@31706
   102
where
huffman@31706
   103
  "gcd_int x y = int (gcd (nat (abs x)) (nat (abs y)))"
haftmann@23687
   104
huffman@31706
   105
definition
huffman@31706
   106
  lcm_int :: "int \<Rightarrow> int \<Rightarrow> int"
huffman@31706
   107
where
huffman@31706
   108
  "lcm_int x y = int (lcm (nat (abs x)) (nat (abs y)))"
haftmann@23687
   109
huffman@31706
   110
instance proof qed
huffman@31706
   111
huffman@31706
   112
end
haftmann@23687
   113
haftmann@23687
   114
huffman@31706
   115
instantiation int :: prime
huffman@31706
   116
huffman@31706
   117
begin
huffman@31706
   118
huffman@31706
   119
definition
huffman@31706
   120
  prime_int :: "int \<Rightarrow> bool"
huffman@31706
   121
where
huffman@31709
   122
  [code del]: "prime_int p = prime (nat p)"
huffman@31706
   123
huffman@31706
   124
instance proof qed
huffman@31706
   125
huffman@31706
   126
end
huffman@31706
   127
huffman@31706
   128
huffman@31706
   129
subsection {* Set up Transfer *}
huffman@31706
   130
huffman@31706
   131
huffman@31706
   132
lemma transfer_nat_int_gcd:
huffman@31706
   133
  "(x::int) >= 0 \<Longrightarrow> y >= 0 \<Longrightarrow> gcd (nat x) (nat y) = nat (gcd x y)"
huffman@31706
   134
  "(x::int) >= 0 \<Longrightarrow> y >= 0 \<Longrightarrow> lcm (nat x) (nat y) = nat (lcm x y)"
huffman@31706
   135
  "(x::int) >= 0 \<Longrightarrow> prime (nat x) = prime x"
huffman@31706
   136
  unfolding gcd_int_def lcm_int_def prime_int_def
huffman@31706
   137
  by auto
haftmann@23687
   138
huffman@31706
   139
lemma transfer_nat_int_gcd_closures:
huffman@31706
   140
  "x >= (0::int) \<Longrightarrow> y >= 0 \<Longrightarrow> gcd x y >= 0"
huffman@31706
   141
  "x >= (0::int) \<Longrightarrow> y >= 0 \<Longrightarrow> lcm x y >= 0"
huffman@31706
   142
  by (auto simp add: gcd_int_def lcm_int_def)
huffman@31706
   143
huffman@31706
   144
declare TransferMorphism_nat_int[transfer add return:
huffman@31706
   145
    transfer_nat_int_gcd transfer_nat_int_gcd_closures]
huffman@31706
   146
huffman@31706
   147
lemma transfer_int_nat_gcd:
huffman@31706
   148
  "gcd (int x) (int y) = int (gcd x y)"
huffman@31706
   149
  "lcm (int x) (int y) = int (lcm x y)"
huffman@31706
   150
  "prime (int x) = prime x"
huffman@31706
   151
  by (unfold gcd_int_def lcm_int_def prime_int_def, auto)
huffman@31706
   152
huffman@31706
   153
lemma transfer_int_nat_gcd_closures:
huffman@31706
   154
  "is_nat x \<Longrightarrow> is_nat y \<Longrightarrow> gcd x y >= 0"
huffman@31706
   155
  "is_nat x \<Longrightarrow> is_nat y \<Longrightarrow> lcm x y >= 0"
huffman@31706
   156
  by (auto simp add: gcd_int_def lcm_int_def)
huffman@31706
   157
huffman@31706
   158
declare TransferMorphism_int_nat[transfer add return:
huffman@31706
   159
    transfer_int_nat_gcd transfer_int_nat_gcd_closures]
huffman@31706
   160
huffman@31706
   161
huffman@31706
   162
subsection {* GCD *}
huffman@31706
   163
huffman@31706
   164
(* was gcd_induct *)
nipkow@31952
   165
lemma gcd_nat_induct:
haftmann@23687
   166
  fixes m n :: nat
haftmann@23687
   167
  assumes "\<And>m. P m 0"
haftmann@23687
   168
    and "\<And>m n. 0 < n \<Longrightarrow> P n (m mod n) \<Longrightarrow> P m n"
haftmann@23687
   169
  shows "P m n"
huffman@31706
   170
  apply (rule gcd_nat.induct)
huffman@31706
   171
  apply (case_tac "y = 0")
huffman@31706
   172
  using assms apply simp_all
huffman@31706
   173
done
huffman@31706
   174
huffman@31706
   175
(* specific to int *)
huffman@31706
   176
nipkow@31952
   177
lemma gcd_neg1_int [simp]: "gcd (-x::int) y = gcd x y"
huffman@31706
   178
  by (simp add: gcd_int_def)
huffman@31706
   179
nipkow@31952
   180
lemma gcd_neg2_int [simp]: "gcd (x::int) (-y) = gcd x y"
huffman@31706
   181
  by (simp add: gcd_int_def)
huffman@31706
   182
nipkow@31813
   183
lemma abs_gcd_int[simp]: "abs(gcd (x::int) y) = gcd x y"
nipkow@31813
   184
by(simp add: gcd_int_def)
nipkow@31813
   185
nipkow@31952
   186
lemma gcd_abs_int: "gcd (x::int) y = gcd (abs x) (abs y)"
nipkow@31813
   187
by (simp add: gcd_int_def)
nipkow@31813
   188
nipkow@31813
   189
lemma gcd_abs1_int[simp]: "gcd (abs x) (y::int) = gcd x y"
nipkow@31952
   190
by (metis abs_idempotent gcd_abs_int)
nipkow@31813
   191
nipkow@31813
   192
lemma gcd_abs2_int[simp]: "gcd x (abs y::int) = gcd x y"
nipkow@31952
   193
by (metis abs_idempotent gcd_abs_int)
huffman@31706
   194
nipkow@31952
   195
lemma gcd_cases_int:
huffman@31706
   196
  fixes x :: int and y
huffman@31706
   197
  assumes "x >= 0 \<Longrightarrow> y >= 0 \<Longrightarrow> P (gcd x y)"
huffman@31706
   198
      and "x >= 0 \<Longrightarrow> y <= 0 \<Longrightarrow> P (gcd x (-y))"
huffman@31706
   199
      and "x <= 0 \<Longrightarrow> y >= 0 \<Longrightarrow> P (gcd (-x) y)"
huffman@31706
   200
      and "x <= 0 \<Longrightarrow> y <= 0 \<Longrightarrow> P (gcd (-x) (-y))"
huffman@31706
   201
  shows "P (gcd x y)"
nipkow@31952
   202
by (insert prems, auto simp add: gcd_neg1_int gcd_neg2_int, arith)
wenzelm@21256
   203
nipkow@31952
   204
lemma gcd_ge_0_int [simp]: "gcd (x::int) y >= 0"
huffman@31706
   205
  by (simp add: gcd_int_def)
huffman@31706
   206
nipkow@31952
   207
lemma lcm_neg1_int: "lcm (-x::int) y = lcm x y"
huffman@31706
   208
  by (simp add: lcm_int_def)
huffman@31706
   209
nipkow@31952
   210
lemma lcm_neg2_int: "lcm (x::int) (-y) = lcm x y"
huffman@31706
   211
  by (simp add: lcm_int_def)
huffman@31706
   212
nipkow@31952
   213
lemma lcm_abs_int: "lcm (x::int) y = lcm (abs x) (abs y)"
huffman@31706
   214
  by (simp add: lcm_int_def)
wenzelm@21256
   215
nipkow@31814
   216
lemma abs_lcm_int [simp]: "abs (lcm i j::int) = lcm i j"
nipkow@31814
   217
by(simp add:lcm_int_def)
nipkow@31814
   218
nipkow@31814
   219
lemma lcm_abs1_int[simp]: "lcm (abs x) (y::int) = lcm x y"
nipkow@31814
   220
by (metis abs_idempotent lcm_int_def)
nipkow@31814
   221
nipkow@31814
   222
lemma lcm_abs2_int[simp]: "lcm x (abs y::int) = lcm x y"
nipkow@31814
   223
by (metis abs_idempotent lcm_int_def)
nipkow@31814
   224
nipkow@31952
   225
lemma lcm_cases_int:
huffman@31706
   226
  fixes x :: int and y
huffman@31706
   227
  assumes "x >= 0 \<Longrightarrow> y >= 0 \<Longrightarrow> P (lcm x y)"
huffman@31706
   228
      and "x >= 0 \<Longrightarrow> y <= 0 \<Longrightarrow> P (lcm x (-y))"
huffman@31706
   229
      and "x <= 0 \<Longrightarrow> y >= 0 \<Longrightarrow> P (lcm (-x) y)"
huffman@31706
   230
      and "x <= 0 \<Longrightarrow> y <= 0 \<Longrightarrow> P (lcm (-x) (-y))"
huffman@31706
   231
  shows "P (lcm x y)"
nipkow@31952
   232
by (insert prems, auto simp add: lcm_neg1_int lcm_neg2_int, arith)
huffman@31706
   233
nipkow@31952
   234
lemma lcm_ge_0_int [simp]: "lcm (x::int) y >= 0"
huffman@31706
   235
  by (simp add: lcm_int_def)
huffman@31706
   236
huffman@31706
   237
(* was gcd_0, etc. *)
nipkow@31952
   238
lemma gcd_0_nat [simp]: "gcd (x::nat) 0 = x"
haftmann@23687
   239
  by simp
haftmann@23687
   240
huffman@31706
   241
(* was igcd_0, etc. *)
nipkow@31952
   242
lemma gcd_0_int [simp]: "gcd (x::int) 0 = abs x"
huffman@31706
   243
  by (unfold gcd_int_def, auto)
huffman@31706
   244
nipkow@31952
   245
lemma gcd_0_left_nat [simp]: "gcd 0 (x::nat) = x"
haftmann@23687
   246
  by simp
haftmann@23687
   247
nipkow@31952
   248
lemma gcd_0_left_int [simp]: "gcd 0 (x::int) = abs x"
huffman@31706
   249
  by (unfold gcd_int_def, auto)
huffman@31706
   250
nipkow@31952
   251
lemma gcd_red_nat: "gcd (x::nat) y = gcd y (x mod y)"
huffman@31706
   252
  by (case_tac "y = 0", auto)
huffman@31706
   253
huffman@31706
   254
(* weaker, but useful for the simplifier *)
huffman@31706
   255
nipkow@31952
   256
lemma gcd_non_0_nat: "y ~= (0::nat) \<Longrightarrow> gcd (x::nat) y = gcd y (x mod y)"
huffman@31706
   257
  by simp
huffman@31706
   258
nipkow@31952
   259
lemma gcd_1_nat [simp]: "gcd (m::nat) 1 = 1"
wenzelm@21263
   260
  by simp
wenzelm@21256
   261
nipkow@31952
   262
lemma gcd_Suc_0 [simp]: "gcd (m::nat) (Suc 0) = Suc 0"
huffman@31706
   263
  by (simp add: One_nat_def)
huffman@31706
   264
nipkow@31952
   265
lemma gcd_1_int [simp]: "gcd (m::int) 1 = 1"
huffman@31706
   266
  by (simp add: gcd_int_def)
huffman@30082
   267
nipkow@31952
   268
lemma gcd_idem_nat: "gcd (x::nat) x = x"
nipkow@31798
   269
by simp
huffman@31706
   270
nipkow@31952
   271
lemma gcd_idem_int: "gcd (x::int) x = abs x"
nipkow@31813
   272
by (auto simp add: gcd_int_def)
huffman@31706
   273
huffman@31706
   274
declare gcd_nat.simps [simp del]
wenzelm@21256
   275
wenzelm@21256
   276
text {*
haftmann@27556
   277
  \medskip @{term "gcd m n"} divides @{text m} and @{text n}.  The
wenzelm@21256
   278
  conjunctions don't seem provable separately.
wenzelm@21256
   279
*}
wenzelm@21256
   280
nipkow@31952
   281
lemma gcd_dvd1_nat [iff]: "(gcd (m::nat)) n dvd m"
nipkow@31952
   282
  and gcd_dvd2_nat [iff]: "(gcd m n) dvd n"
nipkow@31952
   283
  apply (induct m n rule: gcd_nat_induct)
nipkow@31952
   284
  apply (simp_all add: gcd_non_0_nat)
wenzelm@21256
   285
  apply (blast dest: dvd_mod_imp_dvd)
huffman@31706
   286
done
huffman@31706
   287
nipkow@31952
   288
lemma gcd_dvd1_int [iff]: "gcd (x::int) y dvd x"
nipkow@31952
   289
by (metis gcd_int_def int_dvd_iff gcd_dvd1_nat)
wenzelm@21256
   290
nipkow@31952
   291
lemma gcd_dvd2_int [iff]: "gcd (x::int) y dvd y"
nipkow@31952
   292
by (metis gcd_int_def int_dvd_iff gcd_dvd2_nat)
huffman@31706
   293
nipkow@31730
   294
lemma dvd_gcd_D1_nat: "k dvd gcd m n \<Longrightarrow> (k::nat) dvd m"
nipkow@31952
   295
by(metis gcd_dvd1_nat dvd_trans)
nipkow@31730
   296
nipkow@31730
   297
lemma dvd_gcd_D2_nat: "k dvd gcd m n \<Longrightarrow> (k::nat) dvd n"
nipkow@31952
   298
by(metis gcd_dvd2_nat dvd_trans)
nipkow@31730
   299
nipkow@31730
   300
lemma dvd_gcd_D1_int: "i dvd gcd m n \<Longrightarrow> (i::int) dvd m"
nipkow@31952
   301
by(metis gcd_dvd1_int dvd_trans)
nipkow@31730
   302
nipkow@31730
   303
lemma dvd_gcd_D2_int: "i dvd gcd m n \<Longrightarrow> (i::int) dvd n"
nipkow@31952
   304
by(metis gcd_dvd2_int dvd_trans)
nipkow@31730
   305
nipkow@31952
   306
lemma gcd_le1_nat [simp]: "a \<noteq> 0 \<Longrightarrow> gcd (a::nat) b \<le> a"
huffman@31706
   307
  by (rule dvd_imp_le, auto)
huffman@31706
   308
nipkow@31952
   309
lemma gcd_le2_nat [simp]: "b \<noteq> 0 \<Longrightarrow> gcd (a::nat) b \<le> b"
huffman@31706
   310
  by (rule dvd_imp_le, auto)
huffman@31706
   311
nipkow@31952
   312
lemma gcd_le1_int [simp]: "a > 0 \<Longrightarrow> gcd (a::int) b \<le> a"
huffman@31706
   313
  by (rule zdvd_imp_le, auto)
wenzelm@21256
   314
nipkow@31952
   315
lemma gcd_le2_int [simp]: "b > 0 \<Longrightarrow> gcd (a::int) b \<le> b"
huffman@31706
   316
  by (rule zdvd_imp_le, auto)
huffman@31706
   317
nipkow@31952
   318
lemma gcd_greatest_nat: "(k::nat) dvd m \<Longrightarrow> k dvd n \<Longrightarrow> k dvd gcd m n"
nipkow@31952
   319
by (induct m n rule: gcd_nat_induct) (simp_all add: gcd_non_0_nat dvd_mod)
huffman@31706
   320
nipkow@31952
   321
lemma gcd_greatest_int:
nipkow@31813
   322
  "(k::int) dvd m \<Longrightarrow> k dvd n \<Longrightarrow> k dvd gcd m n"
nipkow@31952
   323
  apply (subst gcd_abs_int)
huffman@31706
   324
  apply (subst abs_dvd_iff [symmetric])
nipkow@31952
   325
  apply (rule gcd_greatest_nat [transferred])
nipkow@31813
   326
  apply auto
huffman@31706
   327
done
wenzelm@21256
   328
nipkow@31952
   329
lemma gcd_greatest_iff_nat [iff]: "(k dvd gcd (m::nat) n) =
huffman@31706
   330
    (k dvd m & k dvd n)"
nipkow@31952
   331
  by (blast intro!: gcd_greatest_nat intro: dvd_trans)
huffman@31706
   332
nipkow@31952
   333
lemma gcd_greatest_iff_int: "((k::int) dvd gcd m n) = (k dvd m & k dvd n)"
nipkow@31952
   334
  by (blast intro!: gcd_greatest_int intro: dvd_trans)
wenzelm@21256
   335
nipkow@31952
   336
lemma gcd_zero_nat [simp]: "(gcd (m::nat) n = 0) = (m = 0 & n = 0)"
nipkow@31952
   337
  by (simp only: dvd_0_left_iff [symmetric] gcd_greatest_iff_nat)
wenzelm@21256
   338
nipkow@31952
   339
lemma gcd_zero_int [simp]: "(gcd (m::int) n = 0) = (m = 0 & n = 0)"
huffman@31706
   340
  by (auto simp add: gcd_int_def)
wenzelm@21256
   341
nipkow@31952
   342
lemma gcd_pos_nat [simp]: "(gcd (m::nat) n > 0) = (m ~= 0 | n ~= 0)"
nipkow@31952
   343
  by (insert gcd_zero_nat [of m n], arith)
wenzelm@21256
   344
nipkow@31952
   345
lemma gcd_pos_int [simp]: "(gcd (m::int) n > 0) = (m ~= 0 | n ~= 0)"
nipkow@31952
   346
  by (insert gcd_zero_int [of m n], insert gcd_ge_0_int [of m n], arith)
huffman@31706
   347
nipkow@31952
   348
lemma gcd_commute_nat: "gcd (m::nat) n = gcd n m"
huffman@31706
   349
  by (rule dvd_anti_sym, auto)
haftmann@23687
   350
nipkow@31952
   351
lemma gcd_commute_int: "gcd (m::int) n = gcd n m"
nipkow@31952
   352
  by (auto simp add: gcd_int_def gcd_commute_nat)
huffman@31706
   353
nipkow@31952
   354
lemma gcd_assoc_nat: "gcd (gcd (k::nat) m) n = gcd k (gcd m n)"
huffman@31706
   355
  apply (rule dvd_anti_sym)
huffman@31706
   356
  apply (blast intro: dvd_trans)+
huffman@31706
   357
done
wenzelm@21256
   358
nipkow@31952
   359
lemma gcd_assoc_int: "gcd (gcd (k::int) m) n = gcd k (gcd m n)"
nipkow@31952
   360
  by (auto simp add: gcd_int_def gcd_assoc_nat)
huffman@31706
   361
nipkow@31952
   362
lemmas gcd_left_commute_nat =
nipkow@31952
   363
  mk_left_commute[of gcd, OF gcd_assoc_nat gcd_commute_nat]
huffman@31706
   364
nipkow@31952
   365
lemmas gcd_left_commute_int =
nipkow@31952
   366
  mk_left_commute[of gcd, OF gcd_assoc_int gcd_commute_int]
huffman@31706
   367
nipkow@31952
   368
lemmas gcd_ac_nat = gcd_assoc_nat gcd_commute_nat gcd_left_commute_nat
huffman@31706
   369
  -- {* gcd is an AC-operator *}
wenzelm@21256
   370
nipkow@31952
   371
lemmas gcd_ac_int = gcd_assoc_int gcd_commute_int gcd_left_commute_int
huffman@31706
   372
nipkow@31952
   373
lemma gcd_unique_nat: "(d::nat) dvd a \<and> d dvd b \<and>
huffman@31706
   374
    (\<forall>e. e dvd a \<and> e dvd b \<longrightarrow> e dvd d) \<longleftrightarrow> d = gcd a b"
huffman@31706
   375
  apply auto
huffman@31706
   376
  apply (rule dvd_anti_sym)
nipkow@31952
   377
  apply (erule (1) gcd_greatest_nat)
huffman@31706
   378
  apply auto
huffman@31706
   379
done
wenzelm@21256
   380
nipkow@31952
   381
lemma gcd_unique_int: "d >= 0 & (d::int) dvd a \<and> d dvd b \<and>
huffman@31706
   382
    (\<forall>e. e dvd a \<and> e dvd b \<longrightarrow> e dvd d) \<longleftrightarrow> d = gcd a b"
huffman@31706
   383
  apply (case_tac "d = 0")
huffman@31706
   384
  apply force
huffman@31706
   385
  apply (rule iffI)
huffman@31706
   386
  apply (rule zdvd_anti_sym)
huffman@31706
   387
  apply arith
nipkow@31952
   388
  apply (subst gcd_pos_int)
huffman@31706
   389
  apply clarsimp
huffman@31706
   390
  apply (drule_tac x = "d + 1" in spec)
huffman@31706
   391
  apply (frule zdvd_imp_le)
nipkow@31952
   392
  apply (auto intro: gcd_greatest_int)
huffman@31706
   393
done
huffman@30082
   394
nipkow@31798
   395
lemma gcd_proj1_if_dvd_nat [simp]: "(x::nat) dvd y \<Longrightarrow> gcd x y = x"
nipkow@31952
   396
by (metis dvd.eq_iff gcd_unique_nat)
nipkow@31798
   397
nipkow@31798
   398
lemma gcd_proj2_if_dvd_nat [simp]: "(y::nat) dvd x \<Longrightarrow> gcd x y = y"
nipkow@31952
   399
by (metis dvd.eq_iff gcd_unique_nat)
nipkow@31798
   400
nipkow@31798
   401
lemma gcd_proj1_if_dvd_int[simp]: "x dvd y \<Longrightarrow> gcd (x::int) y = abs x"
nipkow@31952
   402
by (metis abs_dvd_iff abs_eq_0 gcd_0_left_int gcd_abs_int gcd_unique_int)
nipkow@31798
   403
nipkow@31798
   404
lemma gcd_proj2_if_dvd_int[simp]: "y dvd x \<Longrightarrow> gcd (x::int) y = abs y"
nipkow@31952
   405
by (metis gcd_proj1_if_dvd_int gcd_commute_int)
nipkow@31798
   406
nipkow@31798
   407
wenzelm@21256
   408
text {*
wenzelm@21256
   409
  \medskip Multiplication laws
wenzelm@21256
   410
*}
wenzelm@21256
   411
nipkow@31952
   412
lemma gcd_mult_distrib_nat: "(k::nat) * gcd m n = gcd (k * m) (k * n)"
wenzelm@21256
   413
    -- {* \cite[page 27]{davenport92} *}
nipkow@31952
   414
  apply (induct m n rule: gcd_nat_induct)
huffman@31706
   415
  apply simp
wenzelm@21256
   416
  apply (case_tac "k = 0")
nipkow@31952
   417
  apply (simp_all add: mod_geq gcd_non_0_nat mod_mult_distrib2)
huffman@31706
   418
done
wenzelm@21256
   419
nipkow@31952
   420
lemma gcd_mult_distrib_int: "abs (k::int) * gcd m n = gcd (k * m) (k * n)"
nipkow@31952
   421
  apply (subst (1 2) gcd_abs_int)
nipkow@31813
   422
  apply (subst (1 2) abs_mult)
nipkow@31952
   423
  apply (rule gcd_mult_distrib_nat [transferred])
huffman@31706
   424
  apply auto
huffman@31706
   425
done
wenzelm@21256
   426
nipkow@31952
   427
lemma coprime_dvd_mult_nat: "coprime (k::nat) n \<Longrightarrow> k dvd m * n \<Longrightarrow> k dvd m"
nipkow@31952
   428
  apply (insert gcd_mult_distrib_nat [of m k n])
wenzelm@21256
   429
  apply simp
wenzelm@21256
   430
  apply (erule_tac t = m in ssubst)
wenzelm@21256
   431
  apply simp
wenzelm@21256
   432
  done
wenzelm@21256
   433
nipkow@31952
   434
lemma coprime_dvd_mult_int:
nipkow@31813
   435
  "coprime (k::int) n \<Longrightarrow> k dvd m * n \<Longrightarrow> k dvd m"
nipkow@31813
   436
apply (subst abs_dvd_iff [symmetric])
nipkow@31813
   437
apply (subst dvd_abs_iff [symmetric])
nipkow@31952
   438
apply (subst (asm) gcd_abs_int)
nipkow@31952
   439
apply (rule coprime_dvd_mult_nat [transferred])
nipkow@31813
   440
    prefer 4 apply assumption
nipkow@31813
   441
   apply auto
nipkow@31813
   442
apply (subst abs_mult [symmetric], auto)
huffman@31706
   443
done
huffman@31706
   444
nipkow@31952
   445
lemma coprime_dvd_mult_iff_nat: "coprime (k::nat) n \<Longrightarrow>
huffman@31706
   446
    (k dvd m * n) = (k dvd m)"
nipkow@31952
   447
  by (auto intro: coprime_dvd_mult_nat)
huffman@31706
   448
nipkow@31952
   449
lemma coprime_dvd_mult_iff_int: "coprime (k::int) n \<Longrightarrow>
huffman@31706
   450
    (k dvd m * n) = (k dvd m)"
nipkow@31952
   451
  by (auto intro: coprime_dvd_mult_int)
huffman@31706
   452
nipkow@31952
   453
lemma gcd_mult_cancel_nat: "coprime k n \<Longrightarrow> gcd ((k::nat) * m) n = gcd m n"
wenzelm@21256
   454
  apply (rule dvd_anti_sym)
nipkow@31952
   455
  apply (rule gcd_greatest_nat)
nipkow@31952
   456
  apply (rule_tac n = k in coprime_dvd_mult_nat)
nipkow@31952
   457
  apply (simp add: gcd_assoc_nat)
nipkow@31952
   458
  apply (simp add: gcd_commute_nat)
huffman@31706
   459
  apply (simp_all add: mult_commute)
huffman@31706
   460
done
wenzelm@21256
   461
nipkow@31952
   462
lemma gcd_mult_cancel_int:
nipkow@31813
   463
  "coprime (k::int) n \<Longrightarrow> gcd (k * m) n = gcd m n"
nipkow@31952
   464
apply (subst (1 2) gcd_abs_int)
nipkow@31813
   465
apply (subst abs_mult)
nipkow@31952
   466
apply (rule gcd_mult_cancel_nat [transferred], auto)
huffman@31706
   467
done
wenzelm@21256
   468
wenzelm@21256
   469
text {* \medskip Addition laws *}
wenzelm@21256
   470
nipkow@31952
   471
lemma gcd_add1_nat [simp]: "gcd ((m::nat) + n) n = gcd m n"
huffman@31706
   472
  apply (case_tac "n = 0")
nipkow@31952
   473
  apply (simp_all add: gcd_non_0_nat)
huffman@31706
   474
done
huffman@31706
   475
nipkow@31952
   476
lemma gcd_add2_nat [simp]: "gcd (m::nat) (m + n) = gcd m n"
nipkow@31952
   477
  apply (subst (1 2) gcd_commute_nat)
huffman@31706
   478
  apply (subst add_commute)
huffman@31706
   479
  apply simp
huffman@31706
   480
done
huffman@31706
   481
huffman@31706
   482
(* to do: add the other variations? *)
huffman@31706
   483
nipkow@31952
   484
lemma gcd_diff1_nat: "(m::nat) >= n \<Longrightarrow> gcd (m - n) n = gcd m n"
nipkow@31952
   485
  by (subst gcd_add1_nat [symmetric], auto)
huffman@31706
   486
nipkow@31952
   487
lemma gcd_diff2_nat: "(n::nat) >= m \<Longrightarrow> gcd (n - m) n = gcd m n"
nipkow@31952
   488
  apply (subst gcd_commute_nat)
nipkow@31952
   489
  apply (subst gcd_diff1_nat [symmetric])
huffman@31706
   490
  apply auto
nipkow@31952
   491
  apply (subst gcd_commute_nat)
nipkow@31952
   492
  apply (subst gcd_diff1_nat)
huffman@31706
   493
  apply assumption
nipkow@31952
   494
  apply (rule gcd_commute_nat)
huffman@31706
   495
done
huffman@31706
   496
nipkow@31952
   497
lemma gcd_non_0_int: "(y::int) > 0 \<Longrightarrow> gcd x y = gcd y (x mod y)"
huffman@31706
   498
  apply (frule_tac b = y and a = x in pos_mod_sign)
huffman@31706
   499
  apply (simp del: pos_mod_sign add: gcd_int_def abs_if nat_mod_distrib)
nipkow@31952
   500
  apply (auto simp add: gcd_non_0_nat nat_mod_distrib [symmetric]
huffman@31706
   501
    zmod_zminus1_eq_if)
huffman@31706
   502
  apply (frule_tac a = x in pos_mod_bound)
nipkow@31952
   503
  apply (subst (1 2) gcd_commute_nat)
nipkow@31952
   504
  apply (simp del: pos_mod_bound add: nat_diff_distrib gcd_diff2_nat
huffman@31706
   505
    nat_le_eq_zle)
huffman@31706
   506
done
wenzelm@21256
   507
nipkow@31952
   508
lemma gcd_red_int: "gcd (x::int) y = gcd y (x mod y)"
huffman@31706
   509
  apply (case_tac "y = 0")
huffman@31706
   510
  apply force
huffman@31706
   511
  apply (case_tac "y > 0")
nipkow@31952
   512
  apply (subst gcd_non_0_int, auto)
nipkow@31952
   513
  apply (insert gcd_non_0_int [of "-y" "-x"])
nipkow@31952
   514
  apply (auto simp add: gcd_neg1_int gcd_neg2_int)
huffman@31706
   515
done
huffman@31706
   516
nipkow@31952
   517
lemma gcd_add1_int [simp]: "gcd ((m::int) + n) n = gcd m n"
nipkow@31952
   518
by (metis gcd_red_int mod_add_self1 zadd_commute)
huffman@31706
   519
nipkow@31952
   520
lemma gcd_add2_int [simp]: "gcd m ((m::int) + n) = gcd m n"
nipkow@31952
   521
by (metis gcd_add1_int gcd_commute_int zadd_commute)
wenzelm@21256
   522
nipkow@31952
   523
lemma gcd_add_mult_nat: "gcd (m::nat) (k * m + n) = gcd m n"
nipkow@31952
   524
by (metis mod_mult_self3 gcd_commute_nat gcd_red_nat)
wenzelm@21256
   525
nipkow@31952
   526
lemma gcd_add_mult_int: "gcd (m::int) (k * m + n) = gcd m n"
nipkow@31952
   527
by (metis gcd_commute_int gcd_red_int mod_mult_self1 zadd_commute)
nipkow@31798
   528
wenzelm@21256
   529
huffman@31706
   530
(* to do: differences, and all variations of addition rules
huffman@31706
   531
    as simplification rules for nat and int *)
huffman@31706
   532
nipkow@31798
   533
(* FIXME remove iff *)
nipkow@31952
   534
lemma gcd_dvd_prod_nat [iff]: "gcd (m::nat) n dvd k * n"
haftmann@23687
   535
  using mult_dvd_mono [of 1] by auto
chaieb@22027
   536
huffman@31706
   537
(* to do: add the three variations of these, and for ints? *)
huffman@31706
   538
nipkow@31992
   539
lemma finite_divisors_nat[simp]:
nipkow@31992
   540
  assumes "(m::nat) ~= 0" shows "finite{d. d dvd m}"
nipkow@31734
   541
proof-
nipkow@31734
   542
  have "finite{d. d <= m}" by(blast intro: bounded_nat_set_is_finite)
nipkow@31734
   543
  from finite_subset[OF _ this] show ?thesis using assms
nipkow@31734
   544
    by(bestsimp intro!:dvd_imp_le)
nipkow@31734
   545
qed
nipkow@31734
   546
nipkow@31995
   547
lemma finite_divisors_int[simp]:
nipkow@31734
   548
  assumes "(i::int) ~= 0" shows "finite{d. d dvd i}"
nipkow@31734
   549
proof-
nipkow@31734
   550
  have "{d. abs d <= abs i} = {- abs i .. abs i}" by(auto simp:abs_if)
nipkow@31734
   551
  hence "finite{d. abs d <= abs i}" by simp
nipkow@31734
   552
  from finite_subset[OF _ this] show ?thesis using assms
nipkow@31734
   553
    by(bestsimp intro!:dvd_imp_le_int)
nipkow@31734
   554
qed
nipkow@31734
   555
nipkow@31995
   556
lemma Max_divisors_self_nat[simp]: "n\<noteq>0 \<Longrightarrow> Max{d::nat. d dvd n} = n"
nipkow@31995
   557
apply(rule antisym)
nipkow@31995
   558
 apply (fastsimp intro: Max_le_iff[THEN iffD2] simp: dvd_imp_le)
nipkow@31995
   559
apply simp
nipkow@31995
   560
done
nipkow@31995
   561
nipkow@31995
   562
lemma Max_divisors_self_int[simp]: "n\<noteq>0 \<Longrightarrow> Max{d::int. d dvd n} = abs n"
nipkow@31995
   563
apply(rule antisym)
nipkow@31995
   564
 apply(rule Max_le_iff[THEN iffD2])
nipkow@31995
   565
   apply simp
nipkow@31995
   566
  apply fastsimp
nipkow@31995
   567
 apply (metis Collect_def abs_ge_self dvd_imp_le_int mem_def zle_trans)
nipkow@31995
   568
apply simp
nipkow@31995
   569
done
nipkow@31995
   570
nipkow@31734
   571
lemma gcd_is_Max_divisors_nat:
nipkow@31734
   572
  "m ~= 0 \<Longrightarrow> n ~= 0 \<Longrightarrow> gcd (m::nat) n = (Max {d. d dvd m & d dvd n})"
nipkow@31734
   573
apply(rule Max_eqI[THEN sym])
nipkow@31995
   574
  apply (metis finite_Collect_conjI finite_divisors_nat)
nipkow@31734
   575
 apply simp
nipkow@31952
   576
 apply(metis Suc_diff_1 Suc_neq_Zero dvd_imp_le gcd_greatest_iff_nat gcd_pos_nat)
nipkow@31734
   577
apply simp
nipkow@31734
   578
done
nipkow@31734
   579
nipkow@31734
   580
lemma gcd_is_Max_divisors_int:
nipkow@31734
   581
  "m ~= 0 ==> n ~= 0 ==> gcd (m::int) n = (Max {d. d dvd m & d dvd n})"
nipkow@31734
   582
apply(rule Max_eqI[THEN sym])
nipkow@31995
   583
  apply (metis finite_Collect_conjI finite_divisors_int)
nipkow@31734
   584
 apply simp
nipkow@31952
   585
 apply (metis gcd_greatest_iff_int gcd_pos_int zdvd_imp_le)
nipkow@31734
   586
apply simp
nipkow@31734
   587
done
nipkow@31734
   588
chaieb@22027
   589
huffman@31706
   590
subsection {* Coprimality *}
huffman@31706
   591
nipkow@31952
   592
lemma div_gcd_coprime_nat:
huffman@31706
   593
  assumes nz: "(a::nat) \<noteq> 0 \<or> b \<noteq> 0"
huffman@31706
   594
  shows "coprime (a div gcd a b) (b div gcd a b)"
wenzelm@22367
   595
proof -
haftmann@27556
   596
  let ?g = "gcd a b"
chaieb@22027
   597
  let ?a' = "a div ?g"
chaieb@22027
   598
  let ?b' = "b div ?g"
haftmann@27556
   599
  let ?g' = "gcd ?a' ?b'"
chaieb@22027
   600
  have dvdg: "?g dvd a" "?g dvd b" by simp_all
chaieb@22027
   601
  have dvdg': "?g' dvd ?a'" "?g' dvd ?b'" by simp_all
wenzelm@22367
   602
  from dvdg dvdg' obtain ka kb ka' kb' where
wenzelm@22367
   603
      kab: "a = ?g * ka" "b = ?g * kb" "?a' = ?g' * ka'" "?b' = ?g' * kb'"
chaieb@22027
   604
    unfolding dvd_def by blast
huffman@31706
   605
  then have "?g * ?a' = (?g * ?g') * ka'" "?g * ?b' = (?g * ?g') * kb'"
huffman@31706
   606
    by simp_all
wenzelm@22367
   607
  then have dvdgg':"?g * ?g' dvd a" "?g* ?g' dvd b"
wenzelm@22367
   608
    by (auto simp add: dvd_mult_div_cancel [OF dvdg(1)]
wenzelm@22367
   609
      dvd_mult_div_cancel [OF dvdg(2)] dvd_def)
nipkow@31952
   610
  have "?g \<noteq> 0" using nz by (simp add: gcd_zero_nat)
huffman@31706
   611
  then have gp: "?g > 0" by arith
nipkow@31952
   612
  from gcd_greatest_nat [OF dvdgg'] have "?g * ?g' dvd ?g" .
wenzelm@22367
   613
  with dvd_mult_cancel1 [OF gp] show "?g' = 1" by simp
chaieb@22027
   614
qed
chaieb@22027
   615
nipkow@31952
   616
lemma div_gcd_coprime_int:
huffman@31706
   617
  assumes nz: "(a::int) \<noteq> 0 \<or> b \<noteq> 0"
huffman@31706
   618
  shows "coprime (a div gcd a b) (b div gcd a b)"
nipkow@31952
   619
apply (subst (1 2 3) gcd_abs_int)
nipkow@31813
   620
apply (subst (1 2) abs_div)
nipkow@31813
   621
  apply simp
nipkow@31813
   622
 apply simp
nipkow@31813
   623
apply(subst (1 2) abs_gcd_int)
nipkow@31952
   624
apply (rule div_gcd_coprime_nat [transferred])
nipkow@31952
   625
using nz apply (auto simp add: gcd_abs_int [symmetric])
huffman@31706
   626
done
huffman@31706
   627
nipkow@31952
   628
lemma coprime_nat: "coprime (a::nat) b \<longleftrightarrow> (\<forall>d. d dvd a \<and> d dvd b \<longleftrightarrow> d = 1)"
nipkow@31952
   629
  using gcd_unique_nat[of 1 a b, simplified] by auto
huffman@31706
   630
nipkow@31952
   631
lemma coprime_Suc_0_nat:
huffman@31706
   632
    "coprime (a::nat) b \<longleftrightarrow> (\<forall>d. d dvd a \<and> d dvd b \<longleftrightarrow> d = Suc 0)"
nipkow@31952
   633
  using coprime_nat by (simp add: One_nat_def)
huffman@31706
   634
nipkow@31952
   635
lemma coprime_int: "coprime (a::int) b \<longleftrightarrow>
huffman@31706
   636
    (\<forall>d. d >= 0 \<and> d dvd a \<and> d dvd b \<longleftrightarrow> d = 1)"
nipkow@31952
   637
  using gcd_unique_int [of 1 a b]
huffman@31706
   638
  apply clarsimp
huffman@31706
   639
  apply (erule subst)
huffman@31706
   640
  apply (rule iffI)
huffman@31706
   641
  apply force
huffman@31706
   642
  apply (drule_tac x = "abs e" in exI)
huffman@31706
   643
  apply (case_tac "e >= 0")
huffman@31706
   644
  apply force
huffman@31706
   645
  apply force
huffman@31706
   646
done
huffman@31706
   647
nipkow@31952
   648
lemma gcd_coprime_nat:
huffman@31706
   649
  assumes z: "gcd (a::nat) b \<noteq> 0" and a: "a = a' * gcd a b" and
huffman@31706
   650
    b: "b = b' * gcd a b"
huffman@31706
   651
  shows    "coprime a' b'"
huffman@31706
   652
huffman@31706
   653
  apply (subgoal_tac "a' = a div gcd a b")
huffman@31706
   654
  apply (erule ssubst)
huffman@31706
   655
  apply (subgoal_tac "b' = b div gcd a b")
huffman@31706
   656
  apply (erule ssubst)
nipkow@31952
   657
  apply (rule div_gcd_coprime_nat)
huffman@31706
   658
  using prems
huffman@31706
   659
  apply force
huffman@31706
   660
  apply (subst (1) b)
huffman@31706
   661
  using z apply force
huffman@31706
   662
  apply (subst (1) a)
huffman@31706
   663
  using z apply force
huffman@31706
   664
done
huffman@31706
   665
nipkow@31952
   666
lemma gcd_coprime_int:
huffman@31706
   667
  assumes z: "gcd (a::int) b \<noteq> 0" and a: "a = a' * gcd a b" and
huffman@31706
   668
    b: "b = b' * gcd a b"
huffman@31706
   669
  shows    "coprime a' b'"
huffman@31706
   670
huffman@31706
   671
  apply (subgoal_tac "a' = a div gcd a b")
huffman@31706
   672
  apply (erule ssubst)
huffman@31706
   673
  apply (subgoal_tac "b' = b div gcd a b")
huffman@31706
   674
  apply (erule ssubst)
nipkow@31952
   675
  apply (rule div_gcd_coprime_int)
huffman@31706
   676
  using prems
huffman@31706
   677
  apply force
huffman@31706
   678
  apply (subst (1) b)
huffman@31706
   679
  using z apply force
huffman@31706
   680
  apply (subst (1) a)
huffman@31706
   681
  using z apply force
huffman@31706
   682
done
huffman@31706
   683
nipkow@31952
   684
lemma coprime_mult_nat: assumes da: "coprime (d::nat) a" and db: "coprime d b"
huffman@31706
   685
    shows "coprime d (a * b)"
nipkow@31952
   686
  apply (subst gcd_commute_nat)
nipkow@31952
   687
  using da apply (subst gcd_mult_cancel_nat)
nipkow@31952
   688
  apply (subst gcd_commute_nat, assumption)
nipkow@31952
   689
  apply (subst gcd_commute_nat, rule db)
huffman@31706
   690
done
huffman@31706
   691
nipkow@31952
   692
lemma coprime_mult_int: assumes da: "coprime (d::int) a" and db: "coprime d b"
huffman@31706
   693
    shows "coprime d (a * b)"
nipkow@31952
   694
  apply (subst gcd_commute_int)
nipkow@31952
   695
  using da apply (subst gcd_mult_cancel_int)
nipkow@31952
   696
  apply (subst gcd_commute_int, assumption)
nipkow@31952
   697
  apply (subst gcd_commute_int, rule db)
huffman@31706
   698
done
huffman@31706
   699
nipkow@31952
   700
lemma coprime_lmult_nat:
huffman@31706
   701
  assumes dab: "coprime (d::nat) (a * b)" shows "coprime d a"
huffman@31706
   702
proof -
huffman@31706
   703
  have "gcd d a dvd gcd d (a * b)"
nipkow@31952
   704
    by (rule gcd_greatest_nat, auto)
huffman@31706
   705
  with dab show ?thesis
huffman@31706
   706
    by auto
huffman@31706
   707
qed
huffman@31706
   708
nipkow@31952
   709
lemma coprime_lmult_int:
nipkow@31798
   710
  assumes "coprime (d::int) (a * b)" shows "coprime d a"
huffman@31706
   711
proof -
huffman@31706
   712
  have "gcd d a dvd gcd d (a * b)"
nipkow@31952
   713
    by (rule gcd_greatest_int, auto)
nipkow@31798
   714
  with assms show ?thesis
huffman@31706
   715
    by auto
huffman@31706
   716
qed
huffman@31706
   717
nipkow@31952
   718
lemma coprime_rmult_nat:
nipkow@31798
   719
  assumes "coprime (d::nat) (a * b)" shows "coprime d b"
huffman@31706
   720
proof -
huffman@31706
   721
  have "gcd d b dvd gcd d (a * b)"
nipkow@31952
   722
    by (rule gcd_greatest_nat, auto intro: dvd_mult)
nipkow@31798
   723
  with assms show ?thesis
huffman@31706
   724
    by auto
huffman@31706
   725
qed
huffman@31706
   726
nipkow@31952
   727
lemma coprime_rmult_int:
huffman@31706
   728
  assumes dab: "coprime (d::int) (a * b)" shows "coprime d b"
huffman@31706
   729
proof -
huffman@31706
   730
  have "gcd d b dvd gcd d (a * b)"
nipkow@31952
   731
    by (rule gcd_greatest_int, auto intro: dvd_mult)
huffman@31706
   732
  with dab show ?thesis
huffman@31706
   733
    by auto
huffman@31706
   734
qed
huffman@31706
   735
nipkow@31952
   736
lemma coprime_mul_eq_nat: "coprime (d::nat) (a * b) \<longleftrightarrow>
huffman@31706
   737
    coprime d a \<and>  coprime d b"
nipkow@31952
   738
  using coprime_rmult_nat[of d a b] coprime_lmult_nat[of d a b]
nipkow@31952
   739
    coprime_mult_nat[of d a b]
huffman@31706
   740
  by blast
huffman@31706
   741
nipkow@31952
   742
lemma coprime_mul_eq_int: "coprime (d::int) (a * b) \<longleftrightarrow>
huffman@31706
   743
    coprime d a \<and>  coprime d b"
nipkow@31952
   744
  using coprime_rmult_int[of d a b] coprime_lmult_int[of d a b]
nipkow@31952
   745
    coprime_mult_int[of d a b]
huffman@31706
   746
  by blast
huffman@31706
   747
nipkow@31952
   748
lemma gcd_coprime_exists_nat:
huffman@31706
   749
    assumes nz: "gcd (a::nat) b \<noteq> 0"
huffman@31706
   750
    shows "\<exists>a' b'. a = a' * gcd a b \<and> b = b' * gcd a b \<and> coprime a' b'"
huffman@31706
   751
  apply (rule_tac x = "a div gcd a b" in exI)
huffman@31706
   752
  apply (rule_tac x = "b div gcd a b" in exI)
nipkow@31952
   753
  using nz apply (auto simp add: div_gcd_coprime_nat dvd_div_mult)
huffman@31706
   754
done
huffman@31706
   755
nipkow@31952
   756
lemma gcd_coprime_exists_int:
huffman@31706
   757
    assumes nz: "gcd (a::int) b \<noteq> 0"
huffman@31706
   758
    shows "\<exists>a' b'. a = a' * gcd a b \<and> b = b' * gcd a b \<and> coprime a' b'"
huffman@31706
   759
  apply (rule_tac x = "a div gcd a b" in exI)
huffman@31706
   760
  apply (rule_tac x = "b div gcd a b" in exI)
nipkow@31952
   761
  using nz apply (auto simp add: div_gcd_coprime_int dvd_div_mult_self)
huffman@31706
   762
done
huffman@31706
   763
nipkow@31952
   764
lemma coprime_exp_nat: "coprime (d::nat) a \<Longrightarrow> coprime d (a^n)"
nipkow@31952
   765
  by (induct n, simp_all add: coprime_mult_nat)
huffman@31706
   766
nipkow@31952
   767
lemma coprime_exp_int: "coprime (d::int) a \<Longrightarrow> coprime d (a^n)"
nipkow@31952
   768
  by (induct n, simp_all add: coprime_mult_int)
huffman@31706
   769
nipkow@31952
   770
lemma coprime_exp2_nat [intro]: "coprime (a::nat) b \<Longrightarrow> coprime (a^n) (b^m)"
nipkow@31952
   771
  apply (rule coprime_exp_nat)
nipkow@31952
   772
  apply (subst gcd_commute_nat)
nipkow@31952
   773
  apply (rule coprime_exp_nat)
nipkow@31952
   774
  apply (subst gcd_commute_nat, assumption)
huffman@31706
   775
done
huffman@31706
   776
nipkow@31952
   777
lemma coprime_exp2_int [intro]: "coprime (a::int) b \<Longrightarrow> coprime (a^n) (b^m)"
nipkow@31952
   778
  apply (rule coprime_exp_int)
nipkow@31952
   779
  apply (subst gcd_commute_int)
nipkow@31952
   780
  apply (rule coprime_exp_int)
nipkow@31952
   781
  apply (subst gcd_commute_int, assumption)
huffman@31706
   782
done
huffman@31706
   783
nipkow@31952
   784
lemma gcd_exp_nat: "gcd ((a::nat)^n) (b^n) = (gcd a b)^n"
huffman@31706
   785
proof (cases)
huffman@31706
   786
  assume "a = 0 & b = 0"
huffman@31706
   787
  thus ?thesis by simp
huffman@31706
   788
  next assume "~(a = 0 & b = 0)"
huffman@31706
   789
  hence "coprime ((a div gcd a b)^n) ((b div gcd a b)^n)"
nipkow@31952
   790
    by (auto simp:div_gcd_coprime_nat)
huffman@31706
   791
  hence "gcd ((a div gcd a b)^n * (gcd a b)^n)
huffman@31706
   792
      ((b div gcd a b)^n * (gcd a b)^n) = (gcd a b)^n"
huffman@31706
   793
    apply (subst (1 2) mult_commute)
nipkow@31952
   794
    apply (subst gcd_mult_distrib_nat [symmetric])
huffman@31706
   795
    apply simp
huffman@31706
   796
    done
huffman@31706
   797
  also have "(a div gcd a b)^n * (gcd a b)^n = a^n"
huffman@31706
   798
    apply (subst div_power)
huffman@31706
   799
    apply auto
huffman@31706
   800
    apply (rule dvd_div_mult_self)
huffman@31706
   801
    apply (rule dvd_power_same)
huffman@31706
   802
    apply auto
huffman@31706
   803
    done
huffman@31706
   804
  also have "(b div gcd a b)^n * (gcd a b)^n = b^n"
huffman@31706
   805
    apply (subst div_power)
huffman@31706
   806
    apply auto
huffman@31706
   807
    apply (rule dvd_div_mult_self)
huffman@31706
   808
    apply (rule dvd_power_same)
huffman@31706
   809
    apply auto
huffman@31706
   810
    done
huffman@31706
   811
  finally show ?thesis .
huffman@31706
   812
qed
huffman@31706
   813
nipkow@31952
   814
lemma gcd_exp_int: "gcd ((a::int)^n) (b^n) = (gcd a b)^n"
nipkow@31952
   815
  apply (subst (1 2) gcd_abs_int)
huffman@31706
   816
  apply (subst (1 2) power_abs)
nipkow@31952
   817
  apply (rule gcd_exp_nat [where n = n, transferred])
huffman@31706
   818
  apply auto
huffman@31706
   819
done
huffman@31706
   820
nipkow@31952
   821
lemma coprime_divprod_nat: "(d::nat) dvd a * b  \<Longrightarrow> coprime d a \<Longrightarrow> d dvd b"
nipkow@31952
   822
  using coprime_dvd_mult_iff_nat[of d a b]
huffman@31706
   823
  by (auto simp add: mult_commute)
huffman@31706
   824
nipkow@31952
   825
lemma coprime_divprod_int: "(d::int) dvd a * b  \<Longrightarrow> coprime d a \<Longrightarrow> d dvd b"
nipkow@31952
   826
  using coprime_dvd_mult_iff_int[of d a b]
huffman@31706
   827
  by (auto simp add: mult_commute)
huffman@31706
   828
nipkow@31952
   829
lemma division_decomp_nat: assumes dc: "(a::nat) dvd b * c"
huffman@31706
   830
  shows "\<exists>b' c'. a = b' * c' \<and> b' dvd b \<and> c' dvd c"
huffman@31706
   831
proof-
huffman@31706
   832
  let ?g = "gcd a b"
huffman@31706
   833
  {assume "?g = 0" with dc have ?thesis by auto}
huffman@31706
   834
  moreover
huffman@31706
   835
  {assume z: "?g \<noteq> 0"
nipkow@31952
   836
    from gcd_coprime_exists_nat[OF z]
huffman@31706
   837
    obtain a' b' where ab': "a = a' * ?g" "b = b' * ?g" "coprime a' b'"
huffman@31706
   838
      by blast
huffman@31706
   839
    have thb: "?g dvd b" by auto
huffman@31706
   840
    from ab'(1) have "a' dvd a"  unfolding dvd_def by blast
huffman@31706
   841
    with dc have th0: "a' dvd b*c" using dvd_trans[of a' a "b*c"] by simp
huffman@31706
   842
    from dc ab'(1,2) have "a'*?g dvd (b'*?g) *c" by auto
huffman@31706
   843
    hence "?g*a' dvd ?g * (b' * c)" by (simp add: mult_assoc)
huffman@31706
   844
    with z have th_1: "a' dvd b' * c" by auto
nipkow@31952
   845
    from coprime_dvd_mult_nat[OF ab'(3)] th_1
huffman@31706
   846
    have thc: "a' dvd c" by (subst (asm) mult_commute, blast)
huffman@31706
   847
    from ab' have "a = ?g*a'" by algebra
huffman@31706
   848
    with thb thc have ?thesis by blast }
huffman@31706
   849
  ultimately show ?thesis by blast
huffman@31706
   850
qed
huffman@31706
   851
nipkow@31952
   852
lemma division_decomp_int: assumes dc: "(a::int) dvd b * c"
huffman@31706
   853
  shows "\<exists>b' c'. a = b' * c' \<and> b' dvd b \<and> c' dvd c"
huffman@31706
   854
proof-
huffman@31706
   855
  let ?g = "gcd a b"
huffman@31706
   856
  {assume "?g = 0" with dc have ?thesis by auto}
huffman@31706
   857
  moreover
huffman@31706
   858
  {assume z: "?g \<noteq> 0"
nipkow@31952
   859
    from gcd_coprime_exists_int[OF z]
huffman@31706
   860
    obtain a' b' where ab': "a = a' * ?g" "b = b' * ?g" "coprime a' b'"
huffman@31706
   861
      by blast
huffman@31706
   862
    have thb: "?g dvd b" by auto
huffman@31706
   863
    from ab'(1) have "a' dvd a"  unfolding dvd_def by blast
huffman@31706
   864
    with dc have th0: "a' dvd b*c"
huffman@31706
   865
      using dvd_trans[of a' a "b*c"] by simp
huffman@31706
   866
    from dc ab'(1,2) have "a'*?g dvd (b'*?g) *c" by auto
huffman@31706
   867
    hence "?g*a' dvd ?g * (b' * c)" by (simp add: mult_assoc)
huffman@31706
   868
    with z have th_1: "a' dvd b' * c" by auto
nipkow@31952
   869
    from coprime_dvd_mult_int[OF ab'(3)] th_1
huffman@31706
   870
    have thc: "a' dvd c" by (subst (asm) mult_commute, blast)
huffman@31706
   871
    from ab' have "a = ?g*a'" by algebra
huffman@31706
   872
    with thb thc have ?thesis by blast }
huffman@31706
   873
  ultimately show ?thesis by blast
chaieb@27669
   874
qed
chaieb@27669
   875
nipkow@31952
   876
lemma pow_divides_pow_nat:
huffman@31706
   877
  assumes ab: "(a::nat) ^ n dvd b ^n" and n:"n \<noteq> 0"
huffman@31706
   878
  shows "a dvd b"
huffman@31706
   879
proof-
huffman@31706
   880
  let ?g = "gcd a b"
huffman@31706
   881
  from n obtain m where m: "n = Suc m" by (cases n, simp_all)
huffman@31706
   882
  {assume "?g = 0" with ab n have ?thesis by auto }
huffman@31706
   883
  moreover
huffman@31706
   884
  {assume z: "?g \<noteq> 0"
huffman@31706
   885
    hence zn: "?g ^ n \<noteq> 0" using n by (simp add: neq0_conv)
nipkow@31952
   886
    from gcd_coprime_exists_nat[OF z]
huffman@31706
   887
    obtain a' b' where ab': "a = a' * ?g" "b = b' * ?g" "coprime a' b'"
huffman@31706
   888
      by blast
huffman@31706
   889
    from ab have "(a' * ?g) ^ n dvd (b' * ?g)^n"
huffman@31706
   890
      by (simp add: ab'(1,2)[symmetric])
huffman@31706
   891
    hence "?g^n*a'^n dvd ?g^n *b'^n"
huffman@31706
   892
      by (simp only: power_mult_distrib mult_commute)
huffman@31706
   893
    with zn z n have th0:"a'^n dvd b'^n" by auto
huffman@31706
   894
    have "a' dvd a'^n" by (simp add: m)
huffman@31706
   895
    with th0 have "a' dvd b'^n" using dvd_trans[of a' "a'^n" "b'^n"] by simp
huffman@31706
   896
    hence th1: "a' dvd b'^m * b'" by (simp add: m mult_commute)
nipkow@31952
   897
    from coprime_dvd_mult_nat[OF coprime_exp_nat [OF ab'(3), of m]] th1
huffman@31706
   898
    have "a' dvd b'" by (subst (asm) mult_commute, blast)
huffman@31706
   899
    hence "a'*?g dvd b'*?g" by simp
huffman@31706
   900
    with ab'(1,2)  have ?thesis by simp }
huffman@31706
   901
  ultimately show ?thesis by blast
huffman@31706
   902
qed
huffman@31706
   903
nipkow@31952
   904
lemma pow_divides_pow_int:
huffman@31706
   905
  assumes ab: "(a::int) ^ n dvd b ^n" and n:"n \<noteq> 0"
huffman@31706
   906
  shows "a dvd b"
chaieb@27669
   907
proof-
huffman@31706
   908
  let ?g = "gcd a b"
huffman@31706
   909
  from n obtain m where m: "n = Suc m" by (cases n, simp_all)
huffman@31706
   910
  {assume "?g = 0" with ab n have ?thesis by auto }
huffman@31706
   911
  moreover
huffman@31706
   912
  {assume z: "?g \<noteq> 0"
huffman@31706
   913
    hence zn: "?g ^ n \<noteq> 0" using n by (simp add: neq0_conv)
nipkow@31952
   914
    from gcd_coprime_exists_int[OF z]
huffman@31706
   915
    obtain a' b' where ab': "a = a' * ?g" "b = b' * ?g" "coprime a' b'"
huffman@31706
   916
      by blast
huffman@31706
   917
    from ab have "(a' * ?g) ^ n dvd (b' * ?g)^n"
huffman@31706
   918
      by (simp add: ab'(1,2)[symmetric])
huffman@31706
   919
    hence "?g^n*a'^n dvd ?g^n *b'^n"
huffman@31706
   920
      by (simp only: power_mult_distrib mult_commute)
huffman@31706
   921
    with zn z n have th0:"a'^n dvd b'^n" by auto
huffman@31706
   922
    have "a' dvd a'^n" by (simp add: m)
huffman@31706
   923
    with th0 have "a' dvd b'^n"
huffman@31706
   924
      using dvd_trans[of a' "a'^n" "b'^n"] by simp
huffman@31706
   925
    hence th1: "a' dvd b'^m * b'" by (simp add: m mult_commute)
nipkow@31952
   926
    from coprime_dvd_mult_int[OF coprime_exp_int [OF ab'(3), of m]] th1
huffman@31706
   927
    have "a' dvd b'" by (subst (asm) mult_commute, blast)
huffman@31706
   928
    hence "a'*?g dvd b'*?g" by simp
huffman@31706
   929
    with ab'(1,2)  have ?thesis by simp }
huffman@31706
   930
  ultimately show ?thesis by blast
huffman@31706
   931
qed
huffman@31706
   932
nipkow@31798
   933
(* FIXME move to Divides(?) *)
nipkow@31952
   934
lemma pow_divides_eq_nat [simp]: "n ~= 0 \<Longrightarrow> ((a::nat)^n dvd b^n) = (a dvd b)"
nipkow@31952
   935
  by (auto intro: pow_divides_pow_nat dvd_power_same)
huffman@31706
   936
nipkow@31952
   937
lemma pow_divides_eq_int [simp]: "n ~= 0 \<Longrightarrow> ((a::int)^n dvd b^n) = (a dvd b)"
nipkow@31952
   938
  by (auto intro: pow_divides_pow_int dvd_power_same)
huffman@31706
   939
nipkow@31952
   940
lemma divides_mult_nat:
huffman@31706
   941
  assumes mr: "(m::nat) dvd r" and nr: "n dvd r" and mn:"coprime m n"
huffman@31706
   942
  shows "m * n dvd r"
huffman@31706
   943
proof-
huffman@31706
   944
  from mr nr obtain m' n' where m': "r = m*m'" and n': "r = n*n'"
huffman@31706
   945
    unfolding dvd_def by blast
huffman@31706
   946
  from mr n' have "m dvd n'*n" by (simp add: mult_commute)
nipkow@31952
   947
  hence "m dvd n'" using coprime_dvd_mult_iff_nat[OF mn] by simp
huffman@31706
   948
  then obtain k where k: "n' = m*k" unfolding dvd_def by blast
huffman@31706
   949
  from n' k show ?thesis unfolding dvd_def by auto
huffman@31706
   950
qed
huffman@31706
   951
nipkow@31952
   952
lemma divides_mult_int:
huffman@31706
   953
  assumes mr: "(m::int) dvd r" and nr: "n dvd r" and mn:"coprime m n"
huffman@31706
   954
  shows "m * n dvd r"
huffman@31706
   955
proof-
huffman@31706
   956
  from mr nr obtain m' n' where m': "r = m*m'" and n': "r = n*n'"
huffman@31706
   957
    unfolding dvd_def by blast
huffman@31706
   958
  from mr n' have "m dvd n'*n" by (simp add: mult_commute)
nipkow@31952
   959
  hence "m dvd n'" using coprime_dvd_mult_iff_int[OF mn] by simp
huffman@31706
   960
  then obtain k where k: "n' = m*k" unfolding dvd_def by blast
huffman@31706
   961
  from n' k show ?thesis unfolding dvd_def by auto
chaieb@27669
   962
qed
chaieb@27669
   963
nipkow@31952
   964
lemma coprime_plus_one_nat [simp]: "coprime ((n::nat) + 1) n"
huffman@31706
   965
  apply (subgoal_tac "gcd (n + 1) n dvd (n + 1 - n)")
huffman@31706
   966
  apply force
nipkow@31952
   967
  apply (rule dvd_diff_nat)
huffman@31706
   968
  apply auto
huffman@31706
   969
done
huffman@31706
   970
nipkow@31952
   971
lemma coprime_Suc_nat [simp]: "coprime (Suc n) n"
nipkow@31952
   972
  using coprime_plus_one_nat by (simp add: One_nat_def)
huffman@31706
   973
nipkow@31952
   974
lemma coprime_plus_one_int [simp]: "coprime ((n::int) + 1) n"
huffman@31706
   975
  apply (subgoal_tac "gcd (n + 1) n dvd (n + 1 - n)")
huffman@31706
   976
  apply force
huffman@31706
   977
  apply (rule dvd_diff)
huffman@31706
   978
  apply auto
huffman@31706
   979
done
huffman@31706
   980
nipkow@31952
   981
lemma coprime_minus_one_nat: "(n::nat) \<noteq> 0 \<Longrightarrow> coprime (n - 1) n"
nipkow@31952
   982
  using coprime_plus_one_nat [of "n - 1"]
nipkow@31952
   983
    gcd_commute_nat [of "n - 1" n] by auto
huffman@31706
   984
nipkow@31952
   985
lemma coprime_minus_one_int: "coprime ((n::int) - 1) n"
nipkow@31952
   986
  using coprime_plus_one_int [of "n - 1"]
nipkow@31952
   987
    gcd_commute_int [of "n - 1" n] by auto
huffman@31706
   988
nipkow@31952
   989
lemma setprod_coprime_nat [rule_format]:
huffman@31706
   990
    "(ALL i: A. coprime (f i) (x::nat)) --> coprime (PROD i:A. f i) x"
huffman@31706
   991
  apply (case_tac "finite A")
huffman@31706
   992
  apply (induct set: finite)
nipkow@31952
   993
  apply (auto simp add: gcd_mult_cancel_nat)
huffman@31706
   994
done
huffman@31706
   995
nipkow@31952
   996
lemma setprod_coprime_int [rule_format]:
huffman@31706
   997
    "(ALL i: A. coprime (f i) (x::int)) --> coprime (PROD i:A. f i) x"
huffman@31706
   998
  apply (case_tac "finite A")
huffman@31706
   999
  apply (induct set: finite)
nipkow@31952
  1000
  apply (auto simp add: gcd_mult_cancel_int)
huffman@31706
  1001
done
huffman@31706
  1002
nipkow@31952
  1003
lemma prime_odd_nat: "prime (p::nat) \<Longrightarrow> p > 2 \<Longrightarrow> odd p"
huffman@31706
  1004
  unfolding prime_nat_def
huffman@31706
  1005
  apply (subst even_mult_two_ex)
huffman@31706
  1006
  apply clarify
huffman@31706
  1007
  apply (drule_tac x = 2 in spec)
huffman@31706
  1008
  apply auto
huffman@31706
  1009
done
huffman@31706
  1010
nipkow@31952
  1011
lemma prime_odd_int: "prime (p::int) \<Longrightarrow> p > 2 \<Longrightarrow> odd p"
huffman@31706
  1012
  unfolding prime_int_def
nipkow@31952
  1013
  apply (frule prime_odd_nat)
huffman@31706
  1014
  apply (auto simp add: even_nat_def)
huffman@31706
  1015
done
huffman@31706
  1016
nipkow@31952
  1017
lemma coprime_common_divisor_nat: "coprime (a::nat) b \<Longrightarrow> x dvd a \<Longrightarrow>
huffman@31706
  1018
    x dvd b \<Longrightarrow> x = 1"
huffman@31706
  1019
  apply (subgoal_tac "x dvd gcd a b")
huffman@31706
  1020
  apply simp
nipkow@31952
  1021
  apply (erule (1) gcd_greatest_nat)
huffman@31706
  1022
done
huffman@31706
  1023
nipkow@31952
  1024
lemma coprime_common_divisor_int: "coprime (a::int) b \<Longrightarrow> x dvd a \<Longrightarrow>
huffman@31706
  1025
    x dvd b \<Longrightarrow> abs x = 1"
huffman@31706
  1026
  apply (subgoal_tac "x dvd gcd a b")
huffman@31706
  1027
  apply simp
nipkow@31952
  1028
  apply (erule (1) gcd_greatest_int)
huffman@31706
  1029
done
huffman@31706
  1030
nipkow@31952
  1031
lemma coprime_divisors_nat: "(d::int) dvd a \<Longrightarrow> e dvd b \<Longrightarrow> coprime a b \<Longrightarrow>
huffman@31706
  1032
    coprime d e"
huffman@31706
  1033
  apply (auto simp add: dvd_def)
nipkow@31952
  1034
  apply (frule coprime_lmult_int)
nipkow@31952
  1035
  apply (subst gcd_commute_int)
nipkow@31952
  1036
  apply (subst (asm) (2) gcd_commute_int)
nipkow@31952
  1037
  apply (erule coprime_lmult_int)
huffman@31706
  1038
done
huffman@31706
  1039
nipkow@31952
  1040
lemma invertible_coprime_nat: "(x::nat) * y mod m = 1 \<Longrightarrow> coprime x m"
nipkow@31952
  1041
apply (metis coprime_lmult_nat gcd_1_nat gcd_commute_nat gcd_red_nat)
huffman@31706
  1042
done
huffman@31706
  1043
nipkow@31952
  1044
lemma invertible_coprime_int: "(x::int) * y mod m = 1 \<Longrightarrow> coprime x m"
nipkow@31952
  1045
apply (metis coprime_lmult_int gcd_1_int gcd_commute_int gcd_red_int)
huffman@31706
  1046
done
huffman@31706
  1047
huffman@31706
  1048
huffman@31706
  1049
subsection {* Bezout's theorem *}
huffman@31706
  1050
huffman@31706
  1051
(* Function bezw returns a pair of witnesses to Bezout's theorem --
huffman@31706
  1052
   see the theorems that follow the definition. *)
huffman@31706
  1053
fun
huffman@31706
  1054
  bezw  :: "nat \<Rightarrow> nat \<Rightarrow> int * int"
huffman@31706
  1055
where
huffman@31706
  1056
  "bezw x y =
huffman@31706
  1057
  (if y = 0 then (1, 0) else
huffman@31706
  1058
      (snd (bezw y (x mod y)),
huffman@31706
  1059
       fst (bezw y (x mod y)) - snd (bezw y (x mod y)) * int(x div y)))"
huffman@31706
  1060
huffman@31706
  1061
lemma bezw_0 [simp]: "bezw x 0 = (1, 0)" by simp
huffman@31706
  1062
huffman@31706
  1063
lemma bezw_non_0: "y > 0 \<Longrightarrow> bezw x y = (snd (bezw y (x mod y)),
huffman@31706
  1064
       fst (bezw y (x mod y)) - snd (bezw y (x mod y)) * int(x div y))"
huffman@31706
  1065
  by simp
huffman@31706
  1066
huffman@31706
  1067
declare bezw.simps [simp del]
huffman@31706
  1068
huffman@31706
  1069
lemma bezw_aux [rule_format]:
huffman@31706
  1070
    "fst (bezw x y) * int x + snd (bezw x y) * int y = int (gcd x y)"
nipkow@31952
  1071
proof (induct x y rule: gcd_nat_induct)
huffman@31706
  1072
  fix m :: nat
huffman@31706
  1073
  show "fst (bezw m 0) * int m + snd (bezw m 0) * int 0 = int (gcd m 0)"
huffman@31706
  1074
    by auto
huffman@31706
  1075
  next fix m :: nat and n
huffman@31706
  1076
    assume ngt0: "n > 0" and
huffman@31706
  1077
      ih: "fst (bezw n (m mod n)) * int n +
huffman@31706
  1078
        snd (bezw n (m mod n)) * int (m mod n) =
huffman@31706
  1079
        int (gcd n (m mod n))"
huffman@31706
  1080
    thus "fst (bezw m n) * int m + snd (bezw m n) * int n = int (gcd m n)"
nipkow@31952
  1081
      apply (simp add: bezw_non_0 gcd_non_0_nat)
huffman@31706
  1082
      apply (erule subst)
huffman@31706
  1083
      apply (simp add: ring_simps)
huffman@31706
  1084
      apply (subst mod_div_equality [of m n, symmetric])
huffman@31706
  1085
      (* applying simp here undoes the last substitution!
huffman@31706
  1086
         what is procedure cancel_div_mod? *)
huffman@31706
  1087
      apply (simp only: ring_simps zadd_int [symmetric]
huffman@31706
  1088
        zmult_int [symmetric])
huffman@31706
  1089
      done
huffman@31706
  1090
qed
huffman@31706
  1091
nipkow@31952
  1092
lemma bezout_int:
huffman@31706
  1093
  fixes x y
huffman@31706
  1094
  shows "EX u v. u * (x::int) + v * y = gcd x y"
huffman@31706
  1095
proof -
huffman@31706
  1096
  have bezout_aux: "!!x y. x \<ge> (0::int) \<Longrightarrow> y \<ge> 0 \<Longrightarrow>
huffman@31706
  1097
      EX u v. u * x + v * y = gcd x y"
huffman@31706
  1098
    apply (rule_tac x = "fst (bezw (nat x) (nat y))" in exI)
huffman@31706
  1099
    apply (rule_tac x = "snd (bezw (nat x) (nat y))" in exI)
huffman@31706
  1100
    apply (unfold gcd_int_def)
huffman@31706
  1101
    apply simp
huffman@31706
  1102
    apply (subst bezw_aux [symmetric])
huffman@31706
  1103
    apply auto
huffman@31706
  1104
    done
huffman@31706
  1105
  have "(x \<ge> 0 \<and> y \<ge> 0) | (x \<ge> 0 \<and> y \<le> 0) | (x \<le> 0 \<and> y \<ge> 0) |
huffman@31706
  1106
      (x \<le> 0 \<and> y \<le> 0)"
huffman@31706
  1107
    by auto
huffman@31706
  1108
  moreover have "x \<ge> 0 \<Longrightarrow> y \<ge> 0 \<Longrightarrow> ?thesis"
huffman@31706
  1109
    by (erule (1) bezout_aux)
huffman@31706
  1110
  moreover have "x >= 0 \<Longrightarrow> y <= 0 \<Longrightarrow> ?thesis"
huffman@31706
  1111
    apply (insert bezout_aux [of x "-y"])
huffman@31706
  1112
    apply auto
huffman@31706
  1113
    apply (rule_tac x = u in exI)
huffman@31706
  1114
    apply (rule_tac x = "-v" in exI)
nipkow@31952
  1115
    apply (subst gcd_neg2_int [symmetric])
huffman@31706
  1116
    apply auto
huffman@31706
  1117
    done
huffman@31706
  1118
  moreover have "x <= 0 \<Longrightarrow> y >= 0 \<Longrightarrow> ?thesis"
huffman@31706
  1119
    apply (insert bezout_aux [of "-x" y])
huffman@31706
  1120
    apply auto
huffman@31706
  1121
    apply (rule_tac x = "-u" in exI)
huffman@31706
  1122
    apply (rule_tac x = v in exI)
nipkow@31952
  1123
    apply (subst gcd_neg1_int [symmetric])
huffman@31706
  1124
    apply auto
huffman@31706
  1125
    done
huffman@31706
  1126
  moreover have "x <= 0 \<Longrightarrow> y <= 0 \<Longrightarrow> ?thesis"
huffman@31706
  1127
    apply (insert bezout_aux [of "-x" "-y"])
huffman@31706
  1128
    apply auto
huffman@31706
  1129
    apply (rule_tac x = "-u" in exI)
huffman@31706
  1130
    apply (rule_tac x = "-v" in exI)
nipkow@31952
  1131
    apply (subst gcd_neg1_int [symmetric])
nipkow@31952
  1132
    apply (subst gcd_neg2_int [symmetric])
huffman@31706
  1133
    apply auto
huffman@31706
  1134
    done
huffman@31706
  1135
  ultimately show ?thesis by blast
huffman@31706
  1136
qed
huffman@31706
  1137
huffman@31706
  1138
text {* versions of Bezout for nat, by Amine Chaieb *}
huffman@31706
  1139
huffman@31706
  1140
lemma ind_euclid:
huffman@31706
  1141
  assumes c: " \<forall>a b. P (a::nat) b \<longleftrightarrow> P b a" and z: "\<forall>a. P a 0"
huffman@31706
  1142
  and add: "\<forall>a b. P a b \<longrightarrow> P a (a + b)"
chaieb@27669
  1143
  shows "P a b"
chaieb@27669
  1144
proof(induct n\<equiv>"a+b" arbitrary: a b rule: nat_less_induct)
chaieb@27669
  1145
  fix n a b
chaieb@27669
  1146
  assume H: "\<forall>m < n. \<forall>a b. m = a + b \<longrightarrow> P a b" "n = a + b"
chaieb@27669
  1147
  have "a = b \<or> a < b \<or> b < a" by arith
chaieb@27669
  1148
  moreover {assume eq: "a= b"
huffman@31706
  1149
    from add[rule_format, OF z[rule_format, of a]] have "P a b" using eq
huffman@31706
  1150
    by simp}
chaieb@27669
  1151
  moreover
chaieb@27669
  1152
  {assume lt: "a < b"
chaieb@27669
  1153
    hence "a + b - a < n \<or> a = 0"  using H(2) by arith
chaieb@27669
  1154
    moreover
chaieb@27669
  1155
    {assume "a =0" with z c have "P a b" by blast }
chaieb@27669
  1156
    moreover
chaieb@27669
  1157
    {assume ab: "a + b - a < n"
chaieb@27669
  1158
      have th0: "a + b - a = a + (b - a)" using lt by arith
chaieb@27669
  1159
      from add[rule_format, OF H(1)[rule_format, OF ab th0]]
chaieb@27669
  1160
      have "P a b" by (simp add: th0[symmetric])}
chaieb@27669
  1161
    ultimately have "P a b" by blast}
chaieb@27669
  1162
  moreover
chaieb@27669
  1163
  {assume lt: "a > b"
chaieb@27669
  1164
    hence "b + a - b < n \<or> b = 0"  using H(2) by arith
chaieb@27669
  1165
    moreover
chaieb@27669
  1166
    {assume "b =0" with z c have "P a b" by blast }
chaieb@27669
  1167
    moreover
chaieb@27669
  1168
    {assume ab: "b + a - b < n"
chaieb@27669
  1169
      have th0: "b + a - b = b + (a - b)" using lt by arith
chaieb@27669
  1170
      from add[rule_format, OF H(1)[rule_format, OF ab th0]]
chaieb@27669
  1171
      have "P b a" by (simp add: th0[symmetric])
chaieb@27669
  1172
      hence "P a b" using c by blast }
chaieb@27669
  1173
    ultimately have "P a b" by blast}
chaieb@27669
  1174
ultimately  show "P a b" by blast
chaieb@27669
  1175
qed
chaieb@27669
  1176
nipkow@31952
  1177
lemma bezout_lemma_nat:
huffman@31706
  1178
  assumes ex: "\<exists>(d::nat) x y. d dvd a \<and> d dvd b \<and>
huffman@31706
  1179
    (a * x = b * y + d \<or> b * x = a * y + d)"
huffman@31706
  1180
  shows "\<exists>d x y. d dvd a \<and> d dvd a + b \<and>
huffman@31706
  1181
    (a * x = (a + b) * y + d \<or> (a + b) * x = a * y + d)"
huffman@31706
  1182
  using ex
huffman@31706
  1183
  apply clarsimp
huffman@31706
  1184
  apply (rule_tac x="d" in exI, simp add: dvd_add)
huffman@31706
  1185
  apply (case_tac "a * x = b * y + d" , simp_all)
huffman@31706
  1186
  apply (rule_tac x="x + y" in exI)
huffman@31706
  1187
  apply (rule_tac x="y" in exI)
huffman@31706
  1188
  apply algebra
huffman@31706
  1189
  apply (rule_tac x="x" in exI)
huffman@31706
  1190
  apply (rule_tac x="x + y" in exI)
huffman@31706
  1191
  apply algebra
chaieb@27669
  1192
done
chaieb@27669
  1193
nipkow@31952
  1194
lemma bezout_add_nat: "\<exists>(d::nat) x y. d dvd a \<and> d dvd b \<and>
huffman@31706
  1195
    (a * x = b * y + d \<or> b * x = a * y + d)"
huffman@31706
  1196
  apply(induct a b rule: ind_euclid)
huffman@31706
  1197
  apply blast
huffman@31706
  1198
  apply clarify
huffman@31706
  1199
  apply (rule_tac x="a" in exI, simp add: dvd_add)
huffman@31706
  1200
  apply clarsimp
huffman@31706
  1201
  apply (rule_tac x="d" in exI)
huffman@31706
  1202
  apply (case_tac "a * x = b * y + d", simp_all add: dvd_add)
huffman@31706
  1203
  apply (rule_tac x="x+y" in exI)
huffman@31706
  1204
  apply (rule_tac x="y" in exI)
huffman@31706
  1205
  apply algebra
huffman@31706
  1206
  apply (rule_tac x="x" in exI)
huffman@31706
  1207
  apply (rule_tac x="x+y" in exI)
huffman@31706
  1208
  apply algebra
chaieb@27669
  1209
done
chaieb@27669
  1210
nipkow@31952
  1211
lemma bezout1_nat: "\<exists>(d::nat) x y. d dvd a \<and> d dvd b \<and>
huffman@31706
  1212
    (a * x - b * y = d \<or> b * x - a * y = d)"
nipkow@31952
  1213
  using bezout_add_nat[of a b]
huffman@31706
  1214
  apply clarsimp
huffman@31706
  1215
  apply (rule_tac x="d" in exI, simp)
huffman@31706
  1216
  apply (rule_tac x="x" in exI)
huffman@31706
  1217
  apply (rule_tac x="y" in exI)
huffman@31706
  1218
  apply auto
chaieb@27669
  1219
done
chaieb@27669
  1220
nipkow@31952
  1221
lemma bezout_add_strong_nat: assumes nz: "a \<noteq> (0::nat)"
chaieb@27669
  1222
  shows "\<exists>d x y. d dvd a \<and> d dvd b \<and> a * x = b * y + d"
chaieb@27669
  1223
proof-
huffman@31706
  1224
 from nz have ap: "a > 0" by simp
nipkow@31952
  1225
 from bezout_add_nat[of a b]
huffman@31706
  1226
 have "(\<exists>d x y. d dvd a \<and> d dvd b \<and> a * x = b * y + d) \<or>
huffman@31706
  1227
   (\<exists>d x y. d dvd a \<and> d dvd b \<and> b * x = a * y + d)" by blast
chaieb@27669
  1228
 moreover
huffman@31706
  1229
    {fix d x y assume H: "d dvd a" "d dvd b" "a * x = b * y + d"
huffman@31706
  1230
     from H have ?thesis by blast }
chaieb@27669
  1231
 moreover
chaieb@27669
  1232
 {fix d x y assume H: "d dvd a" "d dvd b" "b * x = a * y + d"
chaieb@27669
  1233
   {assume b0: "b = 0" with H  have ?thesis by simp}
huffman@31706
  1234
   moreover
chaieb@27669
  1235
   {assume b: "b \<noteq> 0" hence bp: "b > 0" by simp
huffman@31706
  1236
     from b dvd_imp_le [OF H(2)] have "d < b \<or> d = b"
huffman@31706
  1237
       by auto
chaieb@27669
  1238
     moreover
chaieb@27669
  1239
     {assume db: "d=b"
chaieb@27669
  1240
       from prems have ?thesis apply simp
chaieb@27669
  1241
	 apply (rule exI[where x = b], simp)
chaieb@27669
  1242
	 apply (rule exI[where x = b])
chaieb@27669
  1243
	by (rule exI[where x = "a - 1"], simp add: diff_mult_distrib2)}
chaieb@27669
  1244
    moreover
huffman@31706
  1245
    {assume db: "d < b"
chaieb@27669
  1246
	{assume "x=0" hence ?thesis  using prems by simp }
chaieb@27669
  1247
	moreover
chaieb@27669
  1248
	{assume x0: "x \<noteq> 0" hence xp: "x > 0" by simp
chaieb@27669
  1249
	  from db have "d \<le> b - 1" by simp
chaieb@27669
  1250
	  hence "d*b \<le> b*(b - 1)" by simp
chaieb@27669
  1251
	  with xp mult_mono[of "1" "x" "d*b" "b*(b - 1)"]
chaieb@27669
  1252
	  have dble: "d*b \<le> x*b*(b - 1)" using bp by simp
huffman@31706
  1253
	  from H (3) have "d + (b - 1) * (b*x) = d + (b - 1) * (a*y + d)"
huffman@31706
  1254
            by simp
huffman@31706
  1255
	  hence "d + (b - 1) * a * y + (b - 1) * d = d + (b - 1) * b * x"
huffman@31706
  1256
	    by (simp only: mult_assoc right_distrib)
huffman@31706
  1257
	  hence "a * ((b - 1) * y) + d * (b - 1 + 1) = d + x*b*(b - 1)"
huffman@31706
  1258
            by algebra
chaieb@27669
  1259
	  hence "a * ((b - 1) * y) = d + x*b*(b - 1) - d*b" using bp by simp
huffman@31706
  1260
	  hence "a * ((b - 1) * y) = d + (x*b*(b - 1) - d*b)"
chaieb@27669
  1261
	    by (simp only: diff_add_assoc[OF dble, of d, symmetric])
chaieb@27669
  1262
	  hence "a * ((b - 1) * y) = b*(x*(b - 1) - d) + d"
chaieb@27669
  1263
	    by (simp only: diff_mult_distrib2 add_commute mult_ac)
chaieb@27669
  1264
	  hence ?thesis using H(1,2)
chaieb@27669
  1265
	    apply -
chaieb@27669
  1266
	    apply (rule exI[where x=d], simp)
chaieb@27669
  1267
	    apply (rule exI[where x="(b - 1) * y"])
chaieb@27669
  1268
	    by (rule exI[where x="x*(b - 1) - d"], simp)}
chaieb@27669
  1269
	ultimately have ?thesis by blast}
chaieb@27669
  1270
    ultimately have ?thesis by blast}
chaieb@27669
  1271
  ultimately have ?thesis by blast}
chaieb@27669
  1272
 ultimately show ?thesis by blast
chaieb@27669
  1273
qed
chaieb@27669
  1274
nipkow@31952
  1275
lemma bezout_nat: assumes a: "(a::nat) \<noteq> 0"
chaieb@27669
  1276
  shows "\<exists>x y. a * x = b * y + gcd a b"
chaieb@27669
  1277
proof-
chaieb@27669
  1278
  let ?g = "gcd a b"
nipkow@31952
  1279
  from bezout_add_strong_nat[OF a, of b]
chaieb@27669
  1280
  obtain d x y where d: "d dvd a" "d dvd b" "a * x = b * y + d" by blast
chaieb@27669
  1281
  from d(1,2) have "d dvd ?g" by simp
chaieb@27669
  1282
  then obtain k where k: "?g = d*k" unfolding dvd_def by blast
huffman@31706
  1283
  from d(3) have "a * x * k = (b * y + d) *k " by auto
chaieb@27669
  1284
  hence "a * (x * k) = b * (y*k) + ?g" by (algebra add: k)
chaieb@27669
  1285
  thus ?thesis by blast
chaieb@27669
  1286
qed
chaieb@27669
  1287
huffman@31706
  1288
huffman@31706
  1289
subsection {* LCM *}
huffman@31706
  1290
nipkow@31952
  1291
lemma lcm_altdef_int: "lcm (a::int) b = (abs a) * (abs b) div gcd a b"
huffman@31706
  1292
  by (simp add: lcm_int_def lcm_nat_def zdiv_int
huffman@31706
  1293
    zmult_int [symmetric] gcd_int_def)
huffman@31706
  1294
nipkow@31952
  1295
lemma prod_gcd_lcm_nat: "(m::nat) * n = gcd m n * lcm m n"
huffman@31706
  1296
  unfolding lcm_nat_def
nipkow@31952
  1297
  by (simp add: dvd_mult_div_cancel [OF gcd_dvd_prod_nat])
huffman@31706
  1298
nipkow@31952
  1299
lemma prod_gcd_lcm_int: "abs(m::int) * abs n = gcd m n * lcm m n"
huffman@31706
  1300
  unfolding lcm_int_def gcd_int_def
huffman@31706
  1301
  apply (subst int_mult [symmetric])
nipkow@31952
  1302
  apply (subst prod_gcd_lcm_nat [symmetric])
huffman@31706
  1303
  apply (subst nat_abs_mult_distrib [symmetric])
huffman@31706
  1304
  apply (simp, simp add: abs_mult)
huffman@31706
  1305
done
huffman@31706
  1306
nipkow@31952
  1307
lemma lcm_0_nat [simp]: "lcm (m::nat) 0 = 0"
huffman@31706
  1308
  unfolding lcm_nat_def by simp
huffman@31706
  1309
nipkow@31952
  1310
lemma lcm_0_int [simp]: "lcm (m::int) 0 = 0"
huffman@31706
  1311
  unfolding lcm_int_def by simp
huffman@31706
  1312
nipkow@31952
  1313
lemma lcm_0_left_nat [simp]: "lcm (0::nat) n = 0"
huffman@31706
  1314
  unfolding lcm_nat_def by simp
chaieb@27669
  1315
nipkow@31952
  1316
lemma lcm_0_left_int [simp]: "lcm (0::int) n = 0"
huffman@31706
  1317
  unfolding lcm_int_def by simp
huffman@31706
  1318
nipkow@31952
  1319
lemma lcm_commute_nat: "lcm (m::nat) n = lcm n m"
nipkow@31952
  1320
  unfolding lcm_nat_def by (simp add: gcd_commute_nat ring_simps)
huffman@31706
  1321
nipkow@31952
  1322
lemma lcm_commute_int: "lcm (m::int) n = lcm n m"
nipkow@31952
  1323
  unfolding lcm_int_def by (subst lcm_commute_nat, rule refl)
huffman@31706
  1324
huffman@31706
  1325
nipkow@31952
  1326
lemma lcm_pos_nat:
nipkow@31798
  1327
  "(m::nat) > 0 \<Longrightarrow> n>0 \<Longrightarrow> lcm m n > 0"
nipkow@31952
  1328
by (metis gr0I mult_is_0 prod_gcd_lcm_nat)
chaieb@27669
  1329
nipkow@31952
  1330
lemma lcm_pos_int:
nipkow@31798
  1331
  "(m::int) ~= 0 \<Longrightarrow> n ~= 0 \<Longrightarrow> lcm m n > 0"
nipkow@31952
  1332
  apply (subst lcm_abs_int)
nipkow@31952
  1333
  apply (rule lcm_pos_nat [transferred])
nipkow@31798
  1334
  apply auto
huffman@31706
  1335
done
haftmann@23687
  1336
nipkow@31952
  1337
lemma dvd_pos_nat:
haftmann@23687
  1338
  fixes n m :: nat
haftmann@23687
  1339
  assumes "n > 0" and "m dvd n"
haftmann@23687
  1340
  shows "m > 0"
haftmann@23687
  1341
using assms by (cases m) auto
haftmann@23687
  1342
nipkow@31952
  1343
lemma lcm_least_nat:
huffman@31706
  1344
  assumes "(m::nat) dvd k" and "n dvd k"
haftmann@27556
  1345
  shows "lcm m n dvd k"
haftmann@23687
  1346
proof (cases k)
haftmann@23687
  1347
  case 0 then show ?thesis by auto
haftmann@23687
  1348
next
haftmann@23687
  1349
  case (Suc _) then have pos_k: "k > 0" by auto
nipkow@31952
  1350
  from assms dvd_pos_nat [OF this] have pos_mn: "m > 0" "n > 0" by auto
nipkow@31952
  1351
  with gcd_zero_nat [of m n] have pos_gcd: "gcd m n > 0" by simp
haftmann@23687
  1352
  from assms obtain p where k_m: "k = m * p" using dvd_def by blast
haftmann@23687
  1353
  from assms obtain q where k_n: "k = n * q" using dvd_def by blast
haftmann@23687
  1354
  from pos_k k_m have pos_p: "p > 0" by auto
haftmann@23687
  1355
  from pos_k k_n have pos_q: "q > 0" by auto
haftmann@27556
  1356
  have "k * k * gcd q p = k * gcd (k * q) (k * p)"
nipkow@31952
  1357
    by (simp add: mult_ac gcd_mult_distrib_nat)
haftmann@27556
  1358
  also have "\<dots> = k * gcd (m * p * q) (n * q * p)"
haftmann@23687
  1359
    by (simp add: k_m [symmetric] k_n [symmetric])
haftmann@27556
  1360
  also have "\<dots> = k * p * q * gcd m n"
nipkow@31952
  1361
    by (simp add: mult_ac gcd_mult_distrib_nat)
haftmann@27556
  1362
  finally have "(m * p) * (n * q) * gcd q p = k * p * q * gcd m n"
haftmann@23687
  1363
    by (simp only: k_m [symmetric] k_n [symmetric])
haftmann@27556
  1364
  then have "p * q * m * n * gcd q p = p * q * k * gcd m n"
haftmann@23687
  1365
    by (simp add: mult_ac)
haftmann@27556
  1366
  with pos_p pos_q have "m * n * gcd q p = k * gcd m n"
haftmann@23687
  1367
    by simp
nipkow@31952
  1368
  with prod_gcd_lcm_nat [of m n]
haftmann@27556
  1369
  have "lcm m n * gcd q p * gcd m n = k * gcd m n"
haftmann@23687
  1370
    by (simp add: mult_ac)
huffman@31706
  1371
  with pos_gcd have "lcm m n * gcd q p = k" by auto
haftmann@23687
  1372
  then show ?thesis using dvd_def by auto
haftmann@23687
  1373
qed
haftmann@23687
  1374
nipkow@31952
  1375
lemma lcm_least_int:
nipkow@31798
  1376
  "(m::int) dvd k \<Longrightarrow> n dvd k \<Longrightarrow> lcm m n dvd k"
nipkow@31952
  1377
apply (subst lcm_abs_int)
nipkow@31798
  1378
apply (rule dvd_trans)
nipkow@31952
  1379
apply (rule lcm_least_nat [transferred, of _ "abs k" _])
nipkow@31798
  1380
apply auto
huffman@31706
  1381
done
huffman@31706
  1382
nipkow@31952
  1383
lemma lcm_dvd1_nat: "(m::nat) dvd lcm m n"
haftmann@23687
  1384
proof (cases m)
haftmann@23687
  1385
  case 0 then show ?thesis by simp
haftmann@23687
  1386
next
haftmann@23687
  1387
  case (Suc _)
haftmann@23687
  1388
  then have mpos: "m > 0" by simp
haftmann@23687
  1389
  show ?thesis
haftmann@23687
  1390
  proof (cases n)
haftmann@23687
  1391
    case 0 then show ?thesis by simp
haftmann@23687
  1392
  next
haftmann@23687
  1393
    case (Suc _)
haftmann@23687
  1394
    then have npos: "n > 0" by simp
haftmann@27556
  1395
    have "gcd m n dvd n" by simp
haftmann@27556
  1396
    then obtain k where "n = gcd m n * k" using dvd_def by auto
huffman@31706
  1397
    then have "m * n div gcd m n = m * (gcd m n * k) div gcd m n"
huffman@31706
  1398
      by (simp add: mult_ac)
nipkow@31952
  1399
    also have "\<dots> = m * k" using mpos npos gcd_zero_nat by simp
huffman@31706
  1400
    finally show ?thesis by (simp add: lcm_nat_def)
haftmann@23687
  1401
  qed
haftmann@23687
  1402
qed
haftmann@23687
  1403
nipkow@31952
  1404
lemma lcm_dvd1_int: "(m::int) dvd lcm m n"
nipkow@31952
  1405
  apply (subst lcm_abs_int)
huffman@31706
  1406
  apply (rule dvd_trans)
huffman@31706
  1407
  prefer 2
nipkow@31952
  1408
  apply (rule lcm_dvd1_nat [transferred])
huffman@31706
  1409
  apply auto
huffman@31706
  1410
done
huffman@31706
  1411
nipkow@31952
  1412
lemma lcm_dvd2_nat: "(n::nat) dvd lcm m n"
nipkow@31952
  1413
  by (subst lcm_commute_nat, rule lcm_dvd1_nat)
huffman@31706
  1414
nipkow@31952
  1415
lemma lcm_dvd2_int: "(n::int) dvd lcm m n"
nipkow@31952
  1416
  by (subst lcm_commute_int, rule lcm_dvd1_int)
huffman@31706
  1417
nipkow@31730
  1418
lemma dvd_lcm_I1_nat[simp]: "(k::nat) dvd m \<Longrightarrow> k dvd lcm m n"
nipkow@31952
  1419
by(metis lcm_dvd1_nat dvd_trans)
nipkow@31729
  1420
nipkow@31730
  1421
lemma dvd_lcm_I2_nat[simp]: "(k::nat) dvd n \<Longrightarrow> k dvd lcm m n"
nipkow@31952
  1422
by(metis lcm_dvd2_nat dvd_trans)
nipkow@31729
  1423
nipkow@31730
  1424
lemma dvd_lcm_I1_int[simp]: "(i::int) dvd m \<Longrightarrow> i dvd lcm m n"
nipkow@31952
  1425
by(metis lcm_dvd1_int dvd_trans)
nipkow@31729
  1426
nipkow@31730
  1427
lemma dvd_lcm_I2_int[simp]: "(i::int) dvd n \<Longrightarrow> i dvd lcm m n"
nipkow@31952
  1428
by(metis lcm_dvd2_int dvd_trans)
nipkow@31729
  1429
nipkow@31952
  1430
lemma lcm_unique_nat: "(a::nat) dvd d \<and> b dvd d \<and>
huffman@31706
  1431
    (\<forall>e. a dvd e \<and> b dvd e \<longrightarrow> d dvd e) \<longleftrightarrow> d = lcm a b"
nipkow@31952
  1432
  by (auto intro: dvd_anti_sym lcm_least_nat lcm_dvd1_nat lcm_dvd2_nat)
chaieb@27568
  1433
nipkow@31952
  1434
lemma lcm_unique_int: "d >= 0 \<and> (a::int) dvd d \<and> b dvd d \<and>
huffman@31706
  1435
    (\<forall>e. a dvd e \<and> b dvd e \<longrightarrow> d dvd e) \<longleftrightarrow> d = lcm a b"
nipkow@31952
  1436
  by (auto intro: dvd_anti_sym [transferred] lcm_least_int)
huffman@31706
  1437
nipkow@31798
  1438
lemma lcm_proj2_if_dvd_nat [simp]: "(x::nat) dvd y \<Longrightarrow> lcm x y = y"
huffman@31706
  1439
  apply (rule sym)
nipkow@31952
  1440
  apply (subst lcm_unique_nat [symmetric])
huffman@31706
  1441
  apply auto
huffman@31706
  1442
done
huffman@31706
  1443
nipkow@31798
  1444
lemma lcm_proj2_if_dvd_int [simp]: "(x::int) dvd y \<Longrightarrow> lcm x y = abs y"
huffman@31706
  1445
  apply (rule sym)
nipkow@31952
  1446
  apply (subst lcm_unique_int [symmetric])
huffman@31706
  1447
  apply auto
huffman@31706
  1448
done
huffman@31706
  1449
nipkow@31798
  1450
lemma lcm_proj1_if_dvd_nat [simp]: "(x::nat) dvd y \<Longrightarrow> lcm y x = y"
nipkow@31952
  1451
by (subst lcm_commute_nat, erule lcm_proj2_if_dvd_nat)
huffman@31706
  1452
nipkow@31798
  1453
lemma lcm_proj1_if_dvd_int [simp]: "(x::int) dvd y \<Longrightarrow> lcm y x = abs y"
nipkow@31952
  1454
by (subst lcm_commute_int, erule lcm_proj2_if_dvd_int)
huffman@31706
  1455
nipkow@31992
  1456
lemma lcm_proj1_iff_nat[simp]: "lcm m n = (m::nat) \<longleftrightarrow> n dvd m"
nipkow@31992
  1457
by (metis lcm_proj1_if_dvd_nat lcm_unique_nat)
nipkow@31992
  1458
nipkow@31992
  1459
lemma lcm_proj2_iff_nat[simp]: "lcm m n = (n::nat) \<longleftrightarrow> m dvd n"
nipkow@31992
  1460
by (metis lcm_proj2_if_dvd_nat lcm_unique_nat)
nipkow@31992
  1461
nipkow@31992
  1462
lemma lcm_proj1_iff_int[simp]: "lcm m n = abs(m::int) \<longleftrightarrow> n dvd m"
nipkow@31992
  1463
by (metis dvd_abs_iff lcm_proj1_if_dvd_int lcm_unique_int)
nipkow@31992
  1464
nipkow@31992
  1465
lemma lcm_proj2_iff_int[simp]: "lcm m n = abs(n::int) \<longleftrightarrow> m dvd n"
nipkow@31992
  1466
by (metis dvd_abs_iff lcm_proj2_if_dvd_int lcm_unique_int)
chaieb@27568
  1467
nipkow@31766
  1468
lemma lcm_assoc_nat: "lcm (lcm n m) (p::nat) = lcm n (lcm m p)"
nipkow@31992
  1469
by(rule lcm_unique_nat[THEN iffD1])(metis dvd.order_trans lcm_unique_nat)
nipkow@31766
  1470
nipkow@31766
  1471
lemma lcm_assoc_int: "lcm (lcm n m) (p::int) = lcm n (lcm m p)"
nipkow@31992
  1472
by(rule lcm_unique_int[THEN iffD1])(metis dvd_trans lcm_unique_int)
nipkow@31766
  1473
nipkow@31992
  1474
lemmas lcm_left_commute_nat = mk_left_commute[of lcm, OF lcm_assoc_nat lcm_commute_nat]
nipkow@31992
  1475
lemmas lcm_left_commute_int = mk_left_commute[of lcm, OF lcm_assoc_int lcm_commute_int]
nipkow@31766
  1476
nipkow@31952
  1477
lemmas lcm_ac_nat = lcm_assoc_nat lcm_commute_nat lcm_left_commute_nat
nipkow@31952
  1478
lemmas lcm_ac_int = lcm_assoc_int lcm_commute_int lcm_left_commute_int
nipkow@31766
  1479
nipkow@31992
  1480
lemma fun_left_comm_idem_gcd_nat: "fun_left_comm_idem (gcd :: nat\<Rightarrow>nat\<Rightarrow>nat)"
nipkow@31992
  1481
proof qed (auto simp add: gcd_ac_nat)
nipkow@31992
  1482
nipkow@31992
  1483
lemma fun_left_comm_idem_gcd_int: "fun_left_comm_idem (gcd :: int\<Rightarrow>int\<Rightarrow>int)"
nipkow@31992
  1484
proof qed (auto simp add: gcd_ac_int)
nipkow@31992
  1485
nipkow@31992
  1486
lemma fun_left_comm_idem_lcm_nat: "fun_left_comm_idem (lcm :: nat\<Rightarrow>nat\<Rightarrow>nat)"
nipkow@31992
  1487
proof qed (auto simp add: lcm_ac_nat)
nipkow@31992
  1488
nipkow@31992
  1489
lemma fun_left_comm_idem_lcm_int: "fun_left_comm_idem (lcm :: int\<Rightarrow>int\<Rightarrow>int)"
nipkow@31992
  1490
proof qed (auto simp add: lcm_ac_int)
nipkow@31992
  1491
haftmann@23687
  1492
nipkow@31995
  1493
(* FIXME introduce selimattice_bot/top and derive the following lemmas in there: *)
nipkow@31995
  1494
nipkow@31995
  1495
lemma lcm_0_iff_nat[simp]: "lcm (m::nat) n = 0 \<longleftrightarrow> m=0 \<or> n=0"
nipkow@31995
  1496
by (metis lcm_0_left_nat lcm_0_nat mult_is_0 prod_gcd_lcm_nat)
nipkow@31995
  1497
nipkow@31995
  1498
lemma lcm_0_iff_int[simp]: "lcm (m::int) n = 0 \<longleftrightarrow> m=0 \<or> n=0"
nipkow@31995
  1499
by (metis lcm_0_int lcm_0_left_int lcm_pos_int zless_le)
nipkow@31995
  1500
nipkow@31995
  1501
lemma lcm_1_iff_nat[simp]: "lcm (m::nat) n = 1 \<longleftrightarrow> m=1 \<and> n=1"
nipkow@31995
  1502
by (metis gcd_1_nat lcm_unique_nat nat_mult_1 prod_gcd_lcm_nat)
nipkow@31995
  1503
nipkow@31995
  1504
lemma lcm_1_iff_int[simp]: "lcm (m::int) n = 1 \<longleftrightarrow> (m=1 \<or> m = -1) \<and> (n=1 \<or> n = -1)"
berghofe@31996
  1505
by (auto simp add: abs_mult_self trans [OF lcm_unique_int eq_commute, symmetric] zmult_eq_1_iff)
nipkow@31995
  1506
nipkow@31995
  1507
huffman@31706
  1508
subsection {* Primes *}
wenzelm@22367
  1509
nipkow@31992
  1510
(* FIXME Is there a better way to handle these, rather than making them elim rules? *)
chaieb@22027
  1511
nipkow@31952
  1512
lemma prime_ge_0_nat [elim]: "prime (p::nat) \<Longrightarrow> p >= 0"
huffman@31706
  1513
  by (unfold prime_nat_def, auto)
chaieb@22027
  1514
nipkow@31952
  1515
lemma prime_gt_0_nat [elim]: "prime (p::nat) \<Longrightarrow> p > 0"
huffman@31706
  1516
  by (unfold prime_nat_def, auto)
wenzelm@22367
  1517
nipkow@31952
  1518
lemma prime_ge_1_nat [elim]: "prime (p::nat) \<Longrightarrow> p >= 1"
huffman@31706
  1519
  by (unfold prime_nat_def, auto)
chaieb@22027
  1520
nipkow@31952
  1521
lemma prime_gt_1_nat [elim]: "prime (p::nat) \<Longrightarrow> p > 1"
huffman@31706
  1522
  by (unfold prime_nat_def, auto)
wenzelm@22367
  1523
nipkow@31952
  1524
lemma prime_ge_Suc_0_nat [elim]: "prime (p::nat) \<Longrightarrow> p >= Suc 0"
huffman@31706
  1525
  by (unfold prime_nat_def, auto)
wenzelm@22367
  1526
nipkow@31952
  1527
lemma prime_gt_Suc_0_nat [elim]: "prime (p::nat) \<Longrightarrow> p > Suc 0"
huffman@31706
  1528
  by (unfold prime_nat_def, auto)
huffman@31706
  1529
nipkow@31952
  1530
lemma prime_ge_2_nat [elim]: "prime (p::nat) \<Longrightarrow> p >= 2"
huffman@31706
  1531
  by (unfold prime_nat_def, auto)
huffman@31706
  1532
nipkow@31952
  1533
lemma prime_ge_0_int [elim]: "prime (p::int) \<Longrightarrow> p >= 0"
nipkow@31992
  1534
  by (unfold prime_int_def prime_nat_def) auto
wenzelm@22367
  1535
nipkow@31952
  1536
lemma prime_gt_0_int [elim]: "prime (p::int) \<Longrightarrow> p > 0"
huffman@31706
  1537
  by (unfold prime_int_def prime_nat_def, auto)
huffman@31706
  1538
nipkow@31952
  1539
lemma prime_ge_1_int [elim]: "prime (p::int) \<Longrightarrow> p >= 1"
huffman@31706
  1540
  by (unfold prime_int_def prime_nat_def, auto)
chaieb@22027
  1541
nipkow@31952
  1542
lemma prime_gt_1_int [elim]: "prime (p::int) \<Longrightarrow> p > 1"
huffman@31706
  1543
  by (unfold prime_int_def prime_nat_def, auto)
huffman@31706
  1544
nipkow@31952
  1545
lemma prime_ge_2_int [elim]: "prime (p::int) \<Longrightarrow> p >= 2"
huffman@31706
  1546
  by (unfold prime_int_def prime_nat_def, auto)
wenzelm@22367
  1547
huffman@31706
  1548
huffman@31706
  1549
lemma prime_int_altdef: "prime (p::int) = (1 < p \<and> (\<forall>m \<ge> 0. m dvd p \<longrightarrow>
huffman@31706
  1550
    m = 1 \<or> m = p))"
huffman@31706
  1551
  using prime_nat_def [transferred]
huffman@31706
  1552
    apply (case_tac "p >= 0")
nipkow@31952
  1553
    by (blast, auto simp add: prime_ge_0_int)
huffman@31706
  1554
nipkow@31952
  1555
lemma prime_imp_coprime_nat: "prime (p::nat) \<Longrightarrow> \<not> p dvd n \<Longrightarrow> coprime p n"
huffman@31706
  1556
  apply (unfold prime_nat_def)
nipkow@31952
  1557
  apply (metis gcd_dvd1_nat gcd_dvd2_nat)
huffman@31706
  1558
  done
huffman@31706
  1559
nipkow@31952
  1560
lemma prime_imp_coprime_int: "prime (p::int) \<Longrightarrow> \<not> p dvd n \<Longrightarrow> coprime p n"
huffman@31706
  1561
  apply (unfold prime_int_altdef)
nipkow@31952
  1562
  apply (metis gcd_dvd1_int gcd_dvd2_int gcd_ge_0_int)
chaieb@27568
  1563
  done
chaieb@27568
  1564
nipkow@31952
  1565
lemma prime_dvd_mult_nat: "prime (p::nat) \<Longrightarrow> p dvd m * n \<Longrightarrow> p dvd m \<or> p dvd n"
nipkow@31952
  1566
  by (blast intro: coprime_dvd_mult_nat prime_imp_coprime_nat)
huffman@31706
  1567
nipkow@31952
  1568
lemma prime_dvd_mult_int: "prime (p::int) \<Longrightarrow> p dvd m * n \<Longrightarrow> p dvd m \<or> p dvd n"
nipkow@31952
  1569
  by (blast intro: coprime_dvd_mult_int prime_imp_coprime_int)
huffman@31706
  1570
nipkow@31952
  1571
lemma prime_dvd_mult_eq_nat [simp]: "prime (p::nat) \<Longrightarrow>
huffman@31706
  1572
    p dvd m * n = (p dvd m \<or> p dvd n)"
nipkow@31952
  1573
  by (rule iffI, rule prime_dvd_mult_nat, auto)
chaieb@27568
  1574
nipkow@31952
  1575
lemma prime_dvd_mult_eq_int [simp]: "prime (p::int) \<Longrightarrow>
huffman@31706
  1576
    p dvd m * n = (p dvd m \<or> p dvd n)"
nipkow@31952
  1577
  by (rule iffI, rule prime_dvd_mult_int, auto)
chaieb@27568
  1578
nipkow@31952
  1579
lemma not_prime_eq_prod_nat: "(n::nat) > 1 \<Longrightarrow> ~ prime n \<Longrightarrow>
huffman@31706
  1580
    EX m k. n = m * k & 1 < m & m < n & 1 < k & k < n"
huffman@31706
  1581
  unfolding prime_nat_def dvd_def apply auto
nipkow@31992
  1582
  by(metis mult_commute linorder_neq_iff linorder_not_le mult_1 n_less_n_mult_m one_le_mult_iff less_imp_le_nat)
chaieb@27568
  1583
nipkow@31952
  1584
lemma not_prime_eq_prod_int: "(n::int) > 1 \<Longrightarrow> ~ prime n \<Longrightarrow>
huffman@31706
  1585
    EX m k. n = m * k & 1 < m & m < n & 1 < k & k < n"
huffman@31706
  1586
  unfolding prime_int_altdef dvd_def
huffman@31706
  1587
  apply auto
nipkow@31992
  1588
  by(metis div_mult_self1_is_id div_mult_self2_is_id int_div_less_self int_one_le_iff_zero_less zero_less_mult_pos zless_le)
chaieb@27568
  1589
nipkow@31952
  1590
lemma prime_dvd_power_nat [rule_format]: "prime (p::nat) -->
huffman@31706
  1591
    n > 0 --> (p dvd x^n --> p dvd x)"
huffman@31706
  1592
  by (induct n rule: nat_induct, auto)
chaieb@27568
  1593
nipkow@31952
  1594
lemma prime_dvd_power_int [rule_format]: "prime (p::int) -->
huffman@31706
  1595
    n > 0 --> (p dvd x^n --> p dvd x)"
huffman@31706
  1596
  apply (induct n rule: nat_induct, auto)
nipkow@31952
  1597
  apply (frule prime_ge_0_int)
huffman@31706
  1598
  apply auto
huffman@31706
  1599
done
huffman@31706
  1600
nipkow@32007
  1601
subsubsection{* Make prime naively executable *}
nipkow@32007
  1602
nipkow@32007
  1603
lemma zero_not_prime_nat [simp]: "~prime (0::nat)"
nipkow@32007
  1604
  by (simp add: prime_nat_def)
nipkow@32007
  1605
nipkow@32007
  1606
lemma zero_not_prime_int [simp]: "~prime (0::int)"
nipkow@32007
  1607
  by (simp add: prime_int_def)
nipkow@32007
  1608
nipkow@32007
  1609
lemma one_not_prime_nat [simp]: "~prime (1::nat)"
nipkow@32007
  1610
  by (simp add: prime_nat_def)
nipkow@32007
  1611
nipkow@32007
  1612
lemma Suc_0_not_prime_nat [simp]: "~prime (Suc 0)"
nipkow@32007
  1613
  by (simp add: prime_nat_def One_nat_def)
nipkow@32007
  1614
nipkow@32007
  1615
lemma one_not_prime_int [simp]: "~prime (1::int)"
nipkow@32007
  1616
  by (simp add: prime_int_def)
nipkow@32007
  1617
nipkow@32007
  1618
lemma prime_nat_code[code]:
nipkow@32007
  1619
 "prime(p::nat) = (p > 1 & (ALL n : {1<..<p}. ~(n dvd p)))"
nipkow@32007
  1620
apply(simp add: Ball_def)
nipkow@32007
  1621
apply (metis less_not_refl prime_nat_def dvd_triv_right not_prime_eq_prod_nat)
nipkow@32007
  1622
done
nipkow@32007
  1623
nipkow@32007
  1624
lemma prime_nat_simp:
nipkow@32007
  1625
 "prime(p::nat) = (p > 1 & (list_all (%n. ~ n dvd p) [2..<p]))"
nipkow@32007
  1626
apply(simp only:prime_nat_code list_ball_code greaterThanLessThan_upt)
nipkow@32007
  1627
apply(simp add:nat_number One_nat_def)
nipkow@32007
  1628
done
nipkow@32007
  1629
nipkow@32007
  1630
lemmas prime_nat_simp_number_of[simp] = prime_nat_simp[of "number_of m", standard]
nipkow@32007
  1631
nipkow@32007
  1632
lemma prime_int_code[code]:
nipkow@32007
  1633
  "prime(p::int) = (p > 1 & (ALL n : {1<..<p}. ~(n dvd p)))" (is "?L = ?R")
nipkow@32007
  1634
proof
nipkow@32007
  1635
  assume "?L" thus "?R"
nipkow@32007
  1636
    by (clarsimp simp: prime_gt_1_int) (metis int_one_le_iff_zero_less prime_int_altdef zless_le)
nipkow@32007
  1637
next
nipkow@32007
  1638
    assume "?R" thus "?L" by (clarsimp simp:Ball_def) (metis dvdI not_prime_eq_prod_int)
nipkow@32007
  1639
qed
nipkow@32007
  1640
nipkow@32007
  1641
lemma prime_int_simp:
nipkow@32007
  1642
  "prime(p::int) = (p > 1 & (list_all (%n. ~ n dvd p) [2..p - 1]))"
nipkow@32007
  1643
apply(simp only:prime_int_code list_ball_code greaterThanLessThan_upto)
nipkow@32007
  1644
apply simp
nipkow@32007
  1645
done
nipkow@32007
  1646
nipkow@32007
  1647
lemmas prime_int_simp_number_of[simp] = prime_int_simp[of "number_of m", standard]
nipkow@32007
  1648
nipkow@32007
  1649
declare successor_int_def[simp]
nipkow@32007
  1650
nipkow@32007
  1651
lemma two_is_prime_nat [simp]: "prime (2::nat)"
nipkow@32007
  1652
by simp
nipkow@32007
  1653
nipkow@32007
  1654
lemma two_is_prime_int [simp]: "prime (2::int)"
nipkow@32007
  1655
by simp
nipkow@32007
  1656
nipkow@32007
  1657
nipkow@32007
  1658
lemma prime_imp_power_coprime_nat: "prime (p::nat) \<Longrightarrow> ~ p dvd a \<Longrightarrow> coprime a (p^m)"
nipkow@31952
  1659
  apply (rule coprime_exp_nat)
nipkow@31952
  1660
  apply (subst gcd_commute_nat)
nipkow@31952
  1661
  apply (erule (1) prime_imp_coprime_nat)
huffman@31706
  1662
done
chaieb@27568
  1663
nipkow@32007
  1664
lemma prime_imp_power_coprime_int: "prime (p::int) \<Longrightarrow> ~ p dvd a \<Longrightarrow> coprime a (p^m)"
nipkow@31952
  1665
  apply (rule coprime_exp_int)
nipkow@31952
  1666
  apply (subst gcd_commute_int)
nipkow@31952
  1667
  apply (erule (1) prime_imp_coprime_int)
huffman@31706
  1668
done
chaieb@27568
  1669
nipkow@31952
  1670
lemma primes_coprime_nat: "prime (p::nat) \<Longrightarrow> prime q \<Longrightarrow> p \<noteq> q \<Longrightarrow> coprime p q"
nipkow@31952
  1671
  apply (rule prime_imp_coprime_nat, assumption)
huffman@31706
  1672
  apply (unfold prime_nat_def, auto)
huffman@31706
  1673
done
chaieb@27568
  1674
nipkow@31952
  1675
lemma primes_coprime_int: "prime (p::int) \<Longrightarrow> prime q \<Longrightarrow> p \<noteq> q \<Longrightarrow> coprime p q"
nipkow@31952
  1676
  apply (rule prime_imp_coprime_int, assumption)
huffman@31706
  1677
  apply (unfold prime_int_altdef, clarify)
huffman@31706
  1678
  apply (drule_tac x = q in spec)
huffman@31706
  1679
  apply (drule_tac x = p in spec)
huffman@31706
  1680
  apply auto
huffman@31706
  1681
done
chaieb@27568
  1682
nipkow@32007
  1683
lemma primes_imp_powers_coprime_nat: "prime (p::nat) \<Longrightarrow> prime q \<Longrightarrow> p ~= q \<Longrightarrow> coprime (p^m) (q^n)"
nipkow@31952
  1684
  by (rule coprime_exp2_nat, rule primes_coprime_nat)
chaieb@27568
  1685
nipkow@32007
  1686
lemma primes_imp_powers_coprime_int: "prime (p::int) \<Longrightarrow> prime q \<Longrightarrow> p ~= q \<Longrightarrow> coprime (p^m) (q^n)"
nipkow@31952
  1687
  by (rule coprime_exp2_int, rule primes_coprime_int)
chaieb@27568
  1688
nipkow@31952
  1689
lemma prime_factor_nat: "n \<noteq> (1::nat) \<Longrightarrow> \<exists> p. prime p \<and> p dvd n"
huffman@31706
  1690
  apply (induct n rule: nat_less_induct)
huffman@31706
  1691
  apply (case_tac "n = 0")
nipkow@31952
  1692
  using two_is_prime_nat apply blast
huffman@31706
  1693
  apply (case_tac "prime n")
huffman@31706
  1694
  apply blast
huffman@31706
  1695
  apply (subgoal_tac "n > 1")
nipkow@31952
  1696
  apply (frule (1) not_prime_eq_prod_nat)
huffman@31706
  1697
  apply (auto intro: dvd_mult dvd_mult2)
huffman@31706
  1698
done
chaieb@23244
  1699
huffman@31706
  1700
(* An Isar version:
huffman@31706
  1701
nipkow@31952
  1702
lemma prime_factor_b_nat:
huffman@31706
  1703
  fixes n :: nat
huffman@31706
  1704
  assumes "n \<noteq> 1"
huffman@31706
  1705
  shows "\<exists>p. prime p \<and> p dvd n"
nipkow@23983
  1706
huffman@31706
  1707
using `n ~= 1`
nipkow@31952
  1708
proof (induct n rule: less_induct_nat)
huffman@31706
  1709
  fix n :: nat
huffman@31706
  1710
  assume "n ~= 1" and
huffman@31706
  1711
    ih: "\<forall>m<n. m \<noteq> 1 \<longrightarrow> (\<exists>p. prime p \<and> p dvd m)"
huffman@31706
  1712
  thus "\<exists>p. prime p \<and> p dvd n"
huffman@31706
  1713
  proof -
huffman@31706
  1714
  {
huffman@31706
  1715
    assume "n = 0"
nipkow@31952
  1716
    moreover note two_is_prime_nat
huffman@31706
  1717
    ultimately have ?thesis
nipkow@31952
  1718
      by (auto simp del: two_is_prime_nat)
huffman@31706
  1719
  }
huffman@31706
  1720
  moreover
huffman@31706
  1721
  {
huffman@31706
  1722
    assume "prime n"
huffman@31706
  1723
    hence ?thesis by auto
huffman@31706
  1724
  }
huffman@31706
  1725
  moreover
huffman@31706
  1726
  {
huffman@31706
  1727
    assume "n ~= 0" and "~ prime n"
huffman@31706
  1728
    with `n ~= 1` have "n > 1" by auto
nipkow@31952
  1729
    with `~ prime n` and not_prime_eq_prod_nat obtain m k where
huffman@31706
  1730
      "n = m * k" and "1 < m" and "m < n" by blast
huffman@31706
  1731
    with ih obtain p where "prime p" and "p dvd m" by blast
huffman@31706
  1732
    with `n = m * k` have ?thesis by auto
huffman@31706
  1733
  }
huffman@31706
  1734
  ultimately show ?thesis by blast
huffman@31706
  1735
  qed
nipkow@23983
  1736
qed
nipkow@23983
  1737
huffman@31706
  1738
*)
huffman@31706
  1739
huffman@31706
  1740
text {* One property of coprimality is easier to prove via prime factors. *}
huffman@31706
  1741
nipkow@31952
  1742
lemma prime_divprod_pow_nat:
huffman@31706
  1743
  assumes p: "prime (p::nat)" and ab: "coprime a b" and pab: "p^n dvd a * b"
huffman@31706
  1744
  shows "p^n dvd a \<or> p^n dvd b"
huffman@31706
  1745
proof-
huffman@31706
  1746
  {assume "n = 0 \<or> a = 1 \<or> b = 1" with pab have ?thesis
huffman@31706
  1747
      apply (cases "n=0", simp_all)
huffman@31706
  1748
      apply (cases "a=1", simp_all) done}
huffman@31706
  1749
  moreover
huffman@31706
  1750
  {assume n: "n \<noteq> 0" and a: "a\<noteq>1" and b: "b\<noteq>1"
huffman@31706
  1751
    then obtain m where m: "n = Suc m" by (cases n, auto)
huffman@31706
  1752
    from n have "p dvd p^n" by (intro dvd_power, auto)
huffman@31706
  1753
    also note pab
huffman@31706
  1754
    finally have pab': "p dvd a * b".
nipkow@31952
  1755
    from prime_dvd_mult_nat[OF p pab']
huffman@31706
  1756
    have "p dvd a \<or> p dvd b" .
huffman@31706
  1757
    moreover
huffman@31706
  1758
    {assume pa: "p dvd a"
huffman@31706
  1759
      have pnba: "p^n dvd b*a" using pab by (simp add: mult_commute)
nipkow@31952
  1760
      from coprime_common_divisor_nat [OF ab, OF pa] p have "\<not> p dvd b" by auto
huffman@31706
  1761
      with p have "coprime b p"
nipkow@31952
  1762
        by (subst gcd_commute_nat, intro prime_imp_coprime_nat)
huffman@31706
  1763
      hence pnb: "coprime (p^n) b"
nipkow@31952
  1764
        by (subst gcd_commute_nat, rule coprime_exp_nat)
nipkow@31952
  1765
      from coprime_divprod_nat[OF pnba pnb] have ?thesis by blast }
huffman@31706
  1766
    moreover
huffman@31706
  1767
    {assume pb: "p dvd b"
huffman@31706
  1768
      have pnba: "p^n dvd b*a" using pab by (simp add: mult_commute)
nipkow@31952
  1769
      from coprime_common_divisor_nat [OF ab, of p] pb p have "\<not> p dvd a"
huffman@31706
  1770
        by auto
huffman@31706
  1771
      with p have "coprime a p"
nipkow@31952
  1772
        by (subst gcd_commute_nat, intro prime_imp_coprime_nat)
huffman@31706
  1773
      hence pna: "coprime (p^n) a"
nipkow@31952
  1774
        by (subst gcd_commute_nat, rule coprime_exp_nat)
nipkow@31952
  1775
      from coprime_divprod_nat[OF pab pna] have ?thesis by blast }
huffman@31706
  1776
    ultimately have ?thesis by blast}
huffman@31706
  1777
  ultimately show ?thesis by blast
nipkow@23983
  1778
qed
nipkow@23983
  1779
wenzelm@21256
  1780
end