src/HOL/Int.thy
author haftmann
Fri Oct 20 07:46:10 2017 +0200 (2017-10-20)
changeset 66886 960509bfd47e
parent 66836 4eb431c3f974
child 66912 a99a7cbf0fb5
permissions -rw-r--r--
added lemmas and tuned proofs
wenzelm@41959
     1
(*  Title:      HOL/Int.thy
haftmann@25919
     2
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
wenzelm@41959
     3
    Author:     Tobias Nipkow, Florian Haftmann, TU Muenchen
haftmann@25919
     4
*)
haftmann@25919
     5
wenzelm@60758
     6
section \<open>The Integers as Equivalence Classes over Pairs of Natural Numbers\<close>
haftmann@25919
     7
haftmann@25919
     8
theory Int
wenzelm@63652
     9
  imports Equiv_Relations Power Quotient Fun_Def
haftmann@25919
    10
begin
haftmann@25919
    11
wenzelm@60758
    12
subsection \<open>Definition of integers as a quotient type\<close>
haftmann@25919
    13
wenzelm@63652
    14
definition intrel :: "(nat \<times> nat) \<Rightarrow> (nat \<times> nat) \<Rightarrow> bool"
wenzelm@63652
    15
  where "intrel = (\<lambda>(x, y) (u, v). x + v = u + y)"
huffman@48045
    16
huffman@48045
    17
lemma intrel_iff [simp]: "intrel (x, y) (u, v) \<longleftrightarrow> x + v = u + y"
huffman@48045
    18
  by (simp add: intrel_def)
haftmann@25919
    19
huffman@48045
    20
quotient_type int = "nat \<times> nat" / "intrel"
wenzelm@45694
    21
  morphisms Rep_Integ Abs_Integ
huffman@48045
    22
proof (rule equivpI)
wenzelm@63652
    23
  show "reflp intrel" by (auto simp: reflp_def)
wenzelm@63652
    24
  show "symp intrel" by (auto simp: symp_def)
wenzelm@63652
    25
  show "transp intrel" by (auto simp: transp_def)
huffman@48045
    26
qed
haftmann@25919
    27
huffman@48045
    28
lemma eq_Abs_Integ [case_names Abs_Integ, cases type: int]:
wenzelm@63652
    29
  "(\<And>x y. z = Abs_Integ (x, y) \<Longrightarrow> P) \<Longrightarrow> P"
wenzelm@63652
    30
  by (induct z) auto
wenzelm@63652
    31
huffman@48045
    32
wenzelm@60758
    33
subsection \<open>Integers form a commutative ring\<close>
huffman@48045
    34
huffman@48045
    35
instantiation int :: comm_ring_1
haftmann@25919
    36
begin
haftmann@25919
    37
kuncar@51994
    38
lift_definition zero_int :: "int" is "(0, 0)" .
haftmann@25919
    39
kuncar@51994
    40
lift_definition one_int :: "int" is "(1, 0)" .
haftmann@25919
    41
huffman@48045
    42
lift_definition plus_int :: "int \<Rightarrow> int \<Rightarrow> int"
huffman@48045
    43
  is "\<lambda>(x, y) (u, v). (x + u, y + v)"
huffman@48045
    44
  by clarsimp
haftmann@25919
    45
huffman@48045
    46
lift_definition uminus_int :: "int \<Rightarrow> int"
huffman@48045
    47
  is "\<lambda>(x, y). (y, x)"
huffman@48045
    48
  by clarsimp
haftmann@25919
    49
huffman@48045
    50
lift_definition minus_int :: "int \<Rightarrow> int \<Rightarrow> int"
huffman@48045
    51
  is "\<lambda>(x, y) (u, v). (x + v, y + u)"
huffman@48045
    52
  by clarsimp
haftmann@25919
    53
huffman@48045
    54
lift_definition times_int :: "int \<Rightarrow> int \<Rightarrow> int"
huffman@48045
    55
  is "\<lambda>(x, y) (u, v). (x*u + y*v, x*v + y*u)"
huffman@48045
    56
proof (clarsimp)
huffman@48045
    57
  fix s t u v w x y z :: nat
huffman@48045
    58
  assume "s + v = u + t" and "w + z = y + x"
wenzelm@63652
    59
  then have "(s + v) * w + (u + t) * x + u * (w + z) + v * (y + x) =
wenzelm@63652
    60
    (u + t) * w + (s + v) * x + u * (y + x) + v * (w + z)"
huffman@48045
    61
    by simp
wenzelm@63652
    62
  then show "(s * w + t * x) + (u * z + v * y) = (u * y + v * z) + (s * x + t * w)"
huffman@48045
    63
    by (simp add: algebra_simps)
huffman@48045
    64
qed
haftmann@25919
    65
huffman@48045
    66
instance
wenzelm@63652
    67
  by standard (transfer; clarsimp simp: algebra_simps)+
haftmann@25919
    68
haftmann@25919
    69
end
haftmann@25919
    70
wenzelm@63652
    71
abbreviation int :: "nat \<Rightarrow> int"
wenzelm@63652
    72
  where "int \<equiv> of_nat"
huffman@44709
    73
huffman@48045
    74
lemma int_def: "int n = Abs_Integ (n, 0)"
wenzelm@63652
    75
  by (induct n) (simp add: zero_int.abs_eq, simp add: one_int.abs_eq plus_int.abs_eq)
haftmann@25919
    76
wenzelm@63652
    77
lemma int_transfer [transfer_rule]: "(rel_fun (op =) pcr_int) (\<lambda>n. (n, 0)) int"
wenzelm@63652
    78
  by (simp add: rel_fun_def int.pcr_cr_eq cr_int_def int_def)
haftmann@25919
    79
wenzelm@63652
    80
lemma int_diff_cases: obtains (diff) m n where "z = int m - int n"
huffman@48045
    81
  by transfer clarsimp
huffman@48045
    82
wenzelm@63652
    83
wenzelm@60758
    84
subsection \<open>Integers are totally ordered\<close>
haftmann@25919
    85
huffman@48045
    86
instantiation int :: linorder
huffman@48045
    87
begin
huffman@48045
    88
huffman@48045
    89
lift_definition less_eq_int :: "int \<Rightarrow> int \<Rightarrow> bool"
huffman@48045
    90
  is "\<lambda>(x, y) (u, v). x + v \<le> u + y"
huffman@48045
    91
  by auto
huffman@48045
    92
huffman@48045
    93
lift_definition less_int :: "int \<Rightarrow> int \<Rightarrow> bool"
huffman@48045
    94
  is "\<lambda>(x, y) (u, v). x + v < u + y"
huffman@48045
    95
  by auto
huffman@48045
    96
huffman@48045
    97
instance
wenzelm@61169
    98
  by standard (transfer, force)+
huffman@48045
    99
huffman@48045
   100
end
haftmann@25919
   101
haftmann@25919
   102
instantiation int :: distrib_lattice
haftmann@25919
   103
begin
haftmann@25919
   104
wenzelm@63652
   105
definition "(inf :: int \<Rightarrow> int \<Rightarrow> int) = min"
haftmann@25919
   106
wenzelm@63652
   107
definition "(sup :: int \<Rightarrow> int \<Rightarrow> int) = max"
haftmann@25919
   108
haftmann@25919
   109
instance
wenzelm@63652
   110
  by standard (auto simp add: inf_int_def sup_int_def max_min_distrib2)
haftmann@25919
   111
haftmann@25919
   112
end
haftmann@25919
   113
wenzelm@63652
   114
wenzelm@60758
   115
subsection \<open>Ordering properties of arithmetic operations\<close>
huffman@48045
   116
haftmann@35028
   117
instance int :: ordered_cancel_ab_semigroup_add
haftmann@25919
   118
proof
haftmann@25919
   119
  fix i j k :: int
haftmann@25919
   120
  show "i \<le> j \<Longrightarrow> k + i \<le> k + j"
huffman@48045
   121
    by transfer clarsimp
haftmann@25919
   122
qed
haftmann@25919
   123
wenzelm@63652
   124
text \<open>Strict Monotonicity of Multiplication.\<close>
haftmann@25919
   125
wenzelm@63652
   126
text \<open>Strict, in 1st argument; proof is by induction on \<open>k > 0\<close>.\<close>
wenzelm@63652
   127
lemma zmult_zless_mono2_lemma: "i < j \<Longrightarrow> 0 < k \<Longrightarrow> int k * i < int k * j"
wenzelm@63652
   128
  for i j :: int
wenzelm@63652
   129
proof (induct k)
wenzelm@63652
   130
  case 0
wenzelm@63652
   131
  then show ?case by simp
wenzelm@63652
   132
next
wenzelm@63652
   133
  case (Suc k)
wenzelm@63652
   134
  then show ?case
wenzelm@63652
   135
    by (cases "k = 0") (simp_all add: distrib_right add_strict_mono)
wenzelm@63652
   136
qed
haftmann@25919
   137
wenzelm@63652
   138
lemma zero_le_imp_eq_int: "0 \<le> k \<Longrightarrow> \<exists>n. k = int n"
wenzelm@63652
   139
  for k :: int
wenzelm@63652
   140
  apply transfer
wenzelm@63652
   141
  apply clarsimp
wenzelm@63652
   142
  apply (rule_tac x="a - b" in exI)
wenzelm@63652
   143
  apply simp
wenzelm@63652
   144
  done
haftmann@25919
   145
wenzelm@63652
   146
lemma zero_less_imp_eq_int: "0 < k \<Longrightarrow> \<exists>n>0. k = int n"
wenzelm@63652
   147
  for k :: int
wenzelm@63652
   148
  apply transfer
wenzelm@63652
   149
  apply clarsimp
wenzelm@63652
   150
  apply (rule_tac x="a - b" in exI)
wenzelm@63652
   151
  apply simp
wenzelm@63652
   152
  done
haftmann@25919
   153
wenzelm@63652
   154
lemma zmult_zless_mono2: "i < j \<Longrightarrow> 0 < k \<Longrightarrow> k * i < k * j"
wenzelm@63652
   155
  for i j k :: int
wenzelm@63652
   156
  by (drule zero_less_imp_eq_int) (auto simp add: zmult_zless_mono2_lemma)
haftmann@25919
   157
wenzelm@63652
   158
wenzelm@63652
   159
text \<open>The integers form an ordered integral domain.\<close>
wenzelm@63652
   160
huffman@48045
   161
instantiation int :: linordered_idom
huffman@48045
   162
begin
huffman@48045
   163
wenzelm@63652
   164
definition zabs_def: "\<bar>i::int\<bar> = (if i < 0 then - i else i)"
huffman@48045
   165
wenzelm@63652
   166
definition zsgn_def: "sgn (i::int) = (if i = 0 then 0 else if 0 < i then 1 else - 1)"
huffman@48045
   167
wenzelm@63652
   168
instance
wenzelm@63652
   169
proof
haftmann@25919
   170
  fix i j k :: int
haftmann@25919
   171
  show "i < j \<Longrightarrow> 0 < k \<Longrightarrow> k * i < k * j"
haftmann@25919
   172
    by (rule zmult_zless_mono2)
haftmann@25919
   173
  show "\<bar>i\<bar> = (if i < 0 then -i else i)"
haftmann@25919
   174
    by (simp only: zabs_def)
wenzelm@61076
   175
  show "sgn (i::int) = (if i=0 then 0 else if 0<i then 1 else - 1)"
haftmann@25919
   176
    by (simp only: zsgn_def)
haftmann@25919
   177
qed
haftmann@25919
   178
huffman@48045
   179
end
huffman@48045
   180
wenzelm@63652
   181
lemma zless_imp_add1_zle: "w < z \<Longrightarrow> w + 1 \<le> z"
wenzelm@63652
   182
  for w z :: int
huffman@48045
   183
  by transfer clarsimp
haftmann@25919
   184
wenzelm@63652
   185
lemma zless_iff_Suc_zadd: "w < z \<longleftrightarrow> (\<exists>n. z = w + int (Suc n))"
wenzelm@63652
   186
  for w z :: int
wenzelm@63652
   187
  apply transfer
wenzelm@63652
   188
  apply auto
wenzelm@63652
   189
  apply (rename_tac a b c d)
wenzelm@63652
   190
  apply (rule_tac x="c+b - Suc(a+d)" in exI)
wenzelm@63652
   191
  apply arith
wenzelm@63652
   192
  done
haftmann@25919
   193
wenzelm@63652
   194
lemma zabs_less_one_iff [simp]: "\<bar>z\<bar> < 1 \<longleftrightarrow> z = 0" (is "?lhs \<longleftrightarrow> ?rhs")
wenzelm@63652
   195
  for z :: int
haftmann@62347
   196
proof
wenzelm@63652
   197
  assume ?rhs
wenzelm@63652
   198
  then show ?lhs by simp
haftmann@62347
   199
next
wenzelm@63652
   200
  assume ?lhs
wenzelm@63652
   201
  with zless_imp_add1_zle [of "\<bar>z\<bar>" 1] have "\<bar>z\<bar> + 1 \<le> 1" by simp
wenzelm@63652
   202
  then have "\<bar>z\<bar> \<le> 0" by simp
wenzelm@63652
   203
  then show ?rhs by simp
haftmann@62347
   204
qed
haftmann@62347
   205
haftmann@25919
   206
lemmas int_distrib =
webertj@49962
   207
  distrib_right [of z1 z2 w]
webertj@49962
   208
  distrib_left [of w z1 z2]
wenzelm@45607
   209
  left_diff_distrib [of z1 z2 w]
wenzelm@45607
   210
  right_diff_distrib [of w z1 z2]
wenzelm@45607
   211
  for z1 z2 w :: int
haftmann@25919
   212
haftmann@25919
   213
wenzelm@61799
   214
subsection \<open>Embedding of the Integers into any \<open>ring_1\<close>: \<open>of_int\<close>\<close>
haftmann@25919
   215
haftmann@25919
   216
context ring_1
haftmann@25919
   217
begin
haftmann@25919
   218
wenzelm@63652
   219
lift_definition of_int :: "int \<Rightarrow> 'a"
wenzelm@63652
   220
  is "\<lambda>(i, j). of_nat i - of_nat j"
huffman@48045
   221
  by (clarsimp simp add: diff_eq_eq eq_diff_eq diff_add_eq
wenzelm@63652
   222
      of_nat_add [symmetric] simp del: of_nat_add)
haftmann@25919
   223
haftmann@25919
   224
lemma of_int_0 [simp]: "of_int 0 = 0"
huffman@48066
   225
  by transfer simp
haftmann@25919
   226
haftmann@25919
   227
lemma of_int_1 [simp]: "of_int 1 = 1"
huffman@48066
   228
  by transfer simp
haftmann@25919
   229
wenzelm@63652
   230
lemma of_int_add [simp]: "of_int (w + z) = of_int w + of_int z"
huffman@48066
   231
  by transfer (clarsimp simp add: algebra_simps)
haftmann@25919
   232
wenzelm@63652
   233
lemma of_int_minus [simp]: "of_int (- z) = - (of_int z)"
huffman@48066
   234
  by (transfer fixing: uminus) clarsimp
haftmann@25919
   235
haftmann@25919
   236
lemma of_int_diff [simp]: "of_int (w - z) = of_int w - of_int z"
haftmann@54230
   237
  using of_int_add [of w "- z"] by simp
haftmann@25919
   238
haftmann@25919
   239
lemma of_int_mult [simp]: "of_int (w*z) = of_int w * of_int z"
wenzelm@63652
   240
  by (transfer fixing: times) (clarsimp simp add: algebra_simps)
haftmann@25919
   241
eberlm@61531
   242
lemma mult_of_int_commute: "of_int x * y = y * of_int x"
eberlm@61531
   243
  by (transfer fixing: times) (auto simp: algebra_simps mult_of_nat_commute)
eberlm@61531
   244
wenzelm@63652
   245
text \<open>Collapse nested embeddings.\<close>
huffman@44709
   246
lemma of_int_of_nat_eq [simp]: "of_int (int n) = of_nat n"
wenzelm@63652
   247
  by (induct n) auto
haftmann@25919
   248
huffman@47108
   249
lemma of_int_numeral [simp, code_post]: "of_int (numeral k) = numeral k"
huffman@47108
   250
  by (simp add: of_nat_numeral [symmetric] of_int_of_nat_eq [symmetric])
huffman@47108
   251
haftmann@54489
   252
lemma of_int_neg_numeral [code_post]: "of_int (- numeral k) = - numeral k"
haftmann@54489
   253
  by simp
huffman@47108
   254
wenzelm@63652
   255
lemma of_int_power [simp]: "of_int (z ^ n) = of_int z ^ n"
haftmann@31015
   256
  by (induct n) simp_all
haftmann@31015
   257
haftmann@66816
   258
lemma of_int_of_bool [simp]:
haftmann@66816
   259
  "of_int (of_bool P) = of_bool P"
haftmann@66816
   260
  by auto
haftmann@66816
   261
haftmann@25919
   262
end
haftmann@25919
   263
huffman@47108
   264
context ring_char_0
haftmann@25919
   265
begin
haftmann@25919
   266
wenzelm@63652
   267
lemma of_int_eq_iff [simp]: "of_int w = of_int z \<longleftrightarrow> w = z"
wenzelm@63652
   268
  by transfer (clarsimp simp add: algebra_simps of_nat_add [symmetric] simp del: of_nat_add)
haftmann@25919
   269
wenzelm@63652
   270
text \<open>Special cases where either operand is zero.\<close>
wenzelm@63652
   271
lemma of_int_eq_0_iff [simp]: "of_int z = 0 \<longleftrightarrow> z = 0"
haftmann@36424
   272
  using of_int_eq_iff [of z 0] by simp
haftmann@36424
   273
wenzelm@63652
   274
lemma of_int_0_eq_iff [simp]: "0 = of_int z \<longleftrightarrow> z = 0"
haftmann@36424
   275
  using of_int_eq_iff [of 0 z] by simp
haftmann@25919
   276
wenzelm@63652
   277
lemma of_int_eq_1_iff [iff]: "of_int z = 1 \<longleftrightarrow> z = 1"
lp15@61234
   278
  using of_int_eq_iff [of z 1] by simp
lp15@61234
   279
haftmann@25919
   280
end
haftmann@25919
   281
haftmann@36424
   282
context linordered_idom
haftmann@36424
   283
begin
haftmann@36424
   284
wenzelm@63652
   285
text \<open>Every \<open>linordered_idom\<close> has characteristic zero.\<close>
haftmann@36424
   286
subclass ring_char_0 ..
haftmann@36424
   287
wenzelm@63652
   288
lemma of_int_le_iff [simp]: "of_int w \<le> of_int z \<longleftrightarrow> w \<le> z"
wenzelm@63652
   289
  by (transfer fixing: less_eq)
wenzelm@63652
   290
    (clarsimp simp add: algebra_simps of_nat_add [symmetric] simp del: of_nat_add)
haftmann@36424
   291
wenzelm@63652
   292
lemma of_int_less_iff [simp]: "of_int w < of_int z \<longleftrightarrow> w < z"
haftmann@36424
   293
  by (simp add: less_le order_less_le)
haftmann@36424
   294
wenzelm@63652
   295
lemma of_int_0_le_iff [simp]: "0 \<le> of_int z \<longleftrightarrow> 0 \<le> z"
haftmann@36424
   296
  using of_int_le_iff [of 0 z] by simp
haftmann@36424
   297
wenzelm@63652
   298
lemma of_int_le_0_iff [simp]: "of_int z \<le> 0 \<longleftrightarrow> z \<le> 0"
haftmann@36424
   299
  using of_int_le_iff [of z 0] by simp
haftmann@36424
   300
wenzelm@63652
   301
lemma of_int_0_less_iff [simp]: "0 < of_int z \<longleftrightarrow> 0 < z"
haftmann@36424
   302
  using of_int_less_iff [of 0 z] by simp
haftmann@36424
   303
wenzelm@63652
   304
lemma of_int_less_0_iff [simp]: "of_int z < 0 \<longleftrightarrow> z < 0"
haftmann@36424
   305
  using of_int_less_iff [of z 0] by simp
haftmann@36424
   306
wenzelm@63652
   307
lemma of_int_1_le_iff [simp]: "1 \<le> of_int z \<longleftrightarrow> 1 \<le> z"
lp15@61234
   308
  using of_int_le_iff [of 1 z] by simp
lp15@61234
   309
wenzelm@63652
   310
lemma of_int_le_1_iff [simp]: "of_int z \<le> 1 \<longleftrightarrow> z \<le> 1"
lp15@61234
   311
  using of_int_le_iff [of z 1] by simp
lp15@61234
   312
wenzelm@63652
   313
lemma of_int_1_less_iff [simp]: "1 < of_int z \<longleftrightarrow> 1 < z"
lp15@61234
   314
  using of_int_less_iff [of 1 z] by simp
lp15@61234
   315
wenzelm@63652
   316
lemma of_int_less_1_iff [simp]: "of_int z < 1 \<longleftrightarrow> z < 1"
lp15@61234
   317
  using of_int_less_iff [of z 1] by simp
lp15@61234
   318
eberlm@62128
   319
lemma of_int_pos: "z > 0 \<Longrightarrow> of_int z > 0"
eberlm@62128
   320
  by simp
eberlm@62128
   321
eberlm@62128
   322
lemma of_int_nonneg: "z \<ge> 0 \<Longrightarrow> of_int z \<ge> 0"
eberlm@62128
   323
  by simp
eberlm@62128
   324
wenzelm@63652
   325
lemma of_int_abs [simp]: "of_int \<bar>x\<bar> = \<bar>of_int x\<bar>"
haftmann@62347
   326
  by (auto simp add: abs_if)
haftmann@62347
   327
haftmann@62347
   328
lemma of_int_lessD:
haftmann@62347
   329
  assumes "\<bar>of_int n\<bar> < x"
haftmann@62347
   330
  shows "n = 0 \<or> x > 1"
haftmann@62347
   331
proof (cases "n = 0")
wenzelm@63652
   332
  case True
wenzelm@63652
   333
  then show ?thesis by simp
haftmann@62347
   334
next
haftmann@62347
   335
  case False
haftmann@62347
   336
  then have "\<bar>n\<bar> \<noteq> 0" by simp
haftmann@62347
   337
  then have "\<bar>n\<bar> > 0" by simp
haftmann@62347
   338
  then have "\<bar>n\<bar> \<ge> 1"
haftmann@62347
   339
    using zless_imp_add1_zle [of 0 "\<bar>n\<bar>"] by simp
haftmann@62347
   340
  then have "\<bar>of_int n\<bar> \<ge> 1"
haftmann@62347
   341
    unfolding of_int_1_le_iff [of "\<bar>n\<bar>", symmetric] by simp
haftmann@62347
   342
  then have "1 < x" using assms by (rule le_less_trans)
haftmann@62347
   343
  then show ?thesis ..
haftmann@62347
   344
qed
haftmann@62347
   345
haftmann@62347
   346
lemma of_int_leD:
haftmann@62347
   347
  assumes "\<bar>of_int n\<bar> \<le> x"
haftmann@62347
   348
  shows "n = 0 \<or> 1 \<le> x"
haftmann@62347
   349
proof (cases "n = 0")
wenzelm@63652
   350
  case True
wenzelm@63652
   351
  then show ?thesis by simp
haftmann@62347
   352
next
haftmann@62347
   353
  case False
haftmann@62347
   354
  then have "\<bar>n\<bar> \<noteq> 0" by simp
haftmann@62347
   355
  then have "\<bar>n\<bar> > 0" by simp
haftmann@62347
   356
  then have "\<bar>n\<bar> \<ge> 1"
haftmann@62347
   357
    using zless_imp_add1_zle [of 0 "\<bar>n\<bar>"] by simp
haftmann@62347
   358
  then have "\<bar>of_int n\<bar> \<ge> 1"
haftmann@62347
   359
    unfolding of_int_1_le_iff [of "\<bar>n\<bar>", symmetric] by simp
haftmann@62347
   360
  then have "1 \<le> x" using assms by (rule order_trans)
haftmann@62347
   361
  then show ?thesis ..
haftmann@62347
   362
qed
haftmann@62347
   363
haftmann@36424
   364
end
haftmann@25919
   365
lp15@61234
   366
text \<open>Comparisons involving @{term of_int}.\<close>
lp15@61234
   367
wenzelm@63652
   368
lemma of_int_eq_numeral_iff [iff]: "of_int z = (numeral n :: 'a::ring_char_0) \<longleftrightarrow> z = numeral n"
lp15@61234
   369
  using of_int_eq_iff by fastforce
lp15@61234
   370
lp15@61649
   371
lemma of_int_le_numeral_iff [simp]:
wenzelm@63652
   372
  "of_int z \<le> (numeral n :: 'a::linordered_idom) \<longleftrightarrow> z \<le> numeral n"
lp15@61234
   373
  using of_int_le_iff [of z "numeral n"] by simp
lp15@61234
   374
lp15@61649
   375
lemma of_int_numeral_le_iff [simp]:
wenzelm@63652
   376
  "(numeral n :: 'a::linordered_idom) \<le> of_int z \<longleftrightarrow> numeral n \<le> z"
lp15@61234
   377
  using of_int_le_iff [of "numeral n"] by simp
lp15@61234
   378
lp15@61649
   379
lemma of_int_less_numeral_iff [simp]:
wenzelm@63652
   380
  "of_int z < (numeral n :: 'a::linordered_idom) \<longleftrightarrow> z < numeral n"
lp15@61234
   381
  using of_int_less_iff [of z "numeral n"] by simp
lp15@61234
   382
lp15@61649
   383
lemma of_int_numeral_less_iff [simp]:
wenzelm@63652
   384
  "(numeral n :: 'a::linordered_idom) < of_int z \<longleftrightarrow> numeral n < z"
lp15@61234
   385
  using of_int_less_iff [of "numeral n" z] by simp
lp15@61234
   386
wenzelm@63652
   387
lemma of_nat_less_of_int_iff: "(of_nat n::'a::linordered_idom) < of_int x \<longleftrightarrow> int n < x"
hoelzl@56889
   388
  by (metis of_int_of_nat_eq of_int_less_iff)
hoelzl@56889
   389
haftmann@25919
   390
lemma of_int_eq_id [simp]: "of_int = id"
haftmann@25919
   391
proof
wenzelm@63652
   392
  show "of_int z = id z" for z
wenzelm@63652
   393
    by (cases z rule: int_diff_cases) simp
haftmann@25919
   394
qed
haftmann@25919
   395
hoelzl@51329
   396
instance int :: no_top
wenzelm@61169
   397
  apply standard
hoelzl@51329
   398
  apply (rule_tac x="x + 1" in exI)
hoelzl@51329
   399
  apply simp
hoelzl@51329
   400
  done
hoelzl@51329
   401
hoelzl@51329
   402
instance int :: no_bot
wenzelm@61169
   403
  apply standard
hoelzl@51329
   404
  apply (rule_tac x="x - 1" in exI)
hoelzl@51329
   405
  apply simp
hoelzl@51329
   406
  done
hoelzl@51329
   407
wenzelm@63652
   408
wenzelm@61799
   409
subsection \<open>Magnitude of an Integer, as a Natural Number: \<open>nat\<close>\<close>
haftmann@25919
   410
huffman@48045
   411
lift_definition nat :: "int \<Rightarrow> nat" is "\<lambda>(x, y). x - y"
huffman@48045
   412
  by auto
haftmann@25919
   413
huffman@44709
   414
lemma nat_int [simp]: "nat (int n) = n"
huffman@48045
   415
  by transfer simp
haftmann@25919
   416
huffman@44709
   417
lemma int_nat_eq [simp]: "int (nat z) = (if 0 \<le> z then z else 0)"
huffman@48045
   418
  by transfer clarsimp
haftmann@25919
   419
wenzelm@63652
   420
lemma nat_0_le: "0 \<le> z \<Longrightarrow> int (nat z) = z"
wenzelm@63652
   421
  by simp
haftmann@25919
   422
wenzelm@63652
   423
lemma nat_le_0 [simp]: "z \<le> 0 \<Longrightarrow> nat z = 0"
huffman@48045
   424
  by transfer clarsimp
haftmann@25919
   425
wenzelm@63652
   426
lemma nat_le_eq_zle: "0 < w \<or> 0 \<le> z \<Longrightarrow> nat w \<le> nat z \<longleftrightarrow> w \<le> z"
huffman@48045
   427
  by transfer (clarsimp, arith)
haftmann@25919
   428
wenzelm@63652
   429
text \<open>An alternative condition is @{term "0 \<le> w"}.\<close>
wenzelm@63652
   430
lemma nat_mono_iff: "0 < z \<Longrightarrow> nat w < nat z \<longleftrightarrow> w < z"
wenzelm@63652
   431
  by (simp add: nat_le_eq_zle linorder_not_le [symmetric])
haftmann@25919
   432
wenzelm@63652
   433
lemma nat_less_eq_zless: "0 \<le> w \<Longrightarrow> nat w < nat z \<longleftrightarrow> w < z"
wenzelm@63652
   434
  by (simp add: nat_le_eq_zle linorder_not_le [symmetric])
haftmann@25919
   435
wenzelm@63652
   436
lemma zless_nat_conj [simp]: "nat w < nat z \<longleftrightarrow> 0 < z \<and> w < z"
huffman@48045
   437
  by transfer (clarsimp, arith)
haftmann@25919
   438
haftmann@64714
   439
lemma nonneg_int_cases:
haftmann@64714
   440
  assumes "0 \<le> k"
haftmann@64714
   441
  obtains n where "k = int n"
haftmann@64714
   442
proof -
haftmann@64714
   443
  from assms have "k = int (nat k)"
haftmann@64714
   444
    by simp
haftmann@64714
   445
  then show thesis
haftmann@64714
   446
    by (rule that)
haftmann@64714
   447
qed
haftmann@64714
   448
haftmann@64714
   449
lemma pos_int_cases:
haftmann@64714
   450
  assumes "0 < k"
haftmann@64714
   451
  obtains n where "k = int n" and "n > 0"
haftmann@64714
   452
proof -
haftmann@64714
   453
  from assms have "0 \<le> k"
haftmann@64714
   454
    by simp
haftmann@64714
   455
  then obtain n where "k = int n"
haftmann@64714
   456
    by (rule nonneg_int_cases)
haftmann@64714
   457
  moreover have "n > 0"
haftmann@64714
   458
    using \<open>k = int n\<close> assms by simp
haftmann@64714
   459
  ultimately show thesis
haftmann@64714
   460
    by (rule that)
haftmann@64714
   461
qed
haftmann@64714
   462
haftmann@64714
   463
lemma nonpos_int_cases:
haftmann@64714
   464
  assumes "k \<le> 0"
haftmann@64714
   465
  obtains n where "k = - int n"
haftmann@64714
   466
proof -
haftmann@64714
   467
  from assms have "- k \<ge> 0"
haftmann@64714
   468
    by simp
haftmann@64714
   469
  then obtain n where "- k = int n"
haftmann@64714
   470
    by (rule nonneg_int_cases)
haftmann@64714
   471
  then have "k = - int n"
haftmann@64714
   472
    by simp
haftmann@64714
   473
  then show thesis
haftmann@64714
   474
    by (rule that)
haftmann@64714
   475
qed
haftmann@64714
   476
haftmann@64714
   477
lemma neg_int_cases:
haftmann@64714
   478
  assumes "k < 0"
haftmann@64714
   479
  obtains n where "k = - int n" and "n > 0"
haftmann@64714
   480
proof -
haftmann@64714
   481
  from assms have "- k > 0"
haftmann@64714
   482
    by simp
haftmann@64714
   483
  then obtain n where "- k = int n" and "- k > 0"
haftmann@64714
   484
    by (blast elim: pos_int_cases)
haftmann@64714
   485
  then have "k = - int n" and "n > 0"
haftmann@64714
   486
    by simp_all
haftmann@64714
   487
  then show thesis
haftmann@64714
   488
    by (rule that)
haftmann@64714
   489
qed
haftmann@25919
   490
wenzelm@63652
   491
lemma nat_eq_iff: "nat w = m \<longleftrightarrow> (if 0 \<le> w then w = int m else m = 0)"
huffman@48045
   492
  by transfer (clarsimp simp add: le_imp_diff_is_add)
lp15@60162
   493
wenzelm@63652
   494
lemma nat_eq_iff2: "m = nat w \<longleftrightarrow> (if 0 \<le> w then w = int m else m = 0)"
haftmann@54223
   495
  using nat_eq_iff [of w m] by auto
haftmann@54223
   496
wenzelm@63652
   497
lemma nat_0 [simp]: "nat 0 = 0"
haftmann@54223
   498
  by (simp add: nat_eq_iff)
haftmann@25919
   499
wenzelm@63652
   500
lemma nat_1 [simp]: "nat 1 = Suc 0"
haftmann@54223
   501
  by (simp add: nat_eq_iff)
haftmann@54223
   502
wenzelm@63652
   503
lemma nat_numeral [simp]: "nat (numeral k) = numeral k"
haftmann@54223
   504
  by (simp add: nat_eq_iff)
haftmann@25919
   505
wenzelm@63652
   506
lemma nat_neg_numeral [simp]: "nat (- numeral k) = 0"
haftmann@54223
   507
  by simp
haftmann@54223
   508
haftmann@54223
   509
lemma nat_2: "nat 2 = Suc (Suc 0)"
haftmann@54223
   510
  by simp
lp15@60162
   511
wenzelm@63652
   512
lemma nat_less_iff: "0 \<le> w \<Longrightarrow> nat w < m \<longleftrightarrow> w < of_nat m"
huffman@48045
   513
  by transfer (clarsimp, arith)
haftmann@25919
   514
huffman@44709
   515
lemma nat_le_iff: "nat x \<le> n \<longleftrightarrow> x \<le> int n"
huffman@48045
   516
  by transfer (clarsimp simp add: le_diff_conv)
huffman@44707
   517
huffman@44707
   518
lemma nat_mono: "x \<le> y \<Longrightarrow> nat x \<le> nat y"
huffman@48045
   519
  by transfer auto
huffman@44707
   520
wenzelm@63652
   521
lemma nat_0_iff[simp]: "nat i = 0 \<longleftrightarrow> i \<le> 0"
wenzelm@63652
   522
  for i :: int
huffman@48045
   523
  by transfer clarsimp
nipkow@29700
   524
wenzelm@63652
   525
lemma int_eq_iff: "of_nat m = z \<longleftrightarrow> m = nat z \<and> 0 \<le> z"
wenzelm@63652
   526
  by (auto simp add: nat_eq_iff2)
haftmann@25919
   527
wenzelm@63652
   528
lemma zero_less_nat_eq [simp]: "0 < nat z \<longleftrightarrow> 0 < z"
wenzelm@63652
   529
  using zless_nat_conj [of 0] by auto
haftmann@25919
   530
wenzelm@63652
   531
lemma nat_add_distrib: "0 \<le> z \<Longrightarrow> 0 \<le> z' \<Longrightarrow> nat (z + z') = nat z + nat z'"
huffman@48045
   532
  by transfer clarsimp
haftmann@25919
   533
wenzelm@63652
   534
lemma nat_diff_distrib': "0 \<le> x \<Longrightarrow> 0 \<le> y \<Longrightarrow> nat (x - y) = nat x - nat y"
haftmann@54223
   535
  by transfer clarsimp
lp15@60162
   536
wenzelm@63652
   537
lemma nat_diff_distrib: "0 \<le> z' \<Longrightarrow> z' \<le> z \<Longrightarrow> nat (z - z') = nat z - nat z'"
haftmann@54223
   538
  by (rule nat_diff_distrib') auto
haftmann@25919
   539
huffman@44709
   540
lemma nat_zminus_int [simp]: "nat (- int n) = 0"
huffman@48045
   541
  by transfer simp
haftmann@25919
   542
wenzelm@63652
   543
lemma le_nat_iff: "k \<ge> 0 \<Longrightarrow> n \<le> nat k \<longleftrightarrow> int n \<le> k"
haftmann@53065
   544
  by transfer auto
lp15@60162
   545
wenzelm@63652
   546
lemma zless_nat_eq_int_zless: "m < nat z \<longleftrightarrow> int m < z"
huffman@48045
   547
  by transfer (clarsimp simp add: less_diff_conv)
haftmann@25919
   548
wenzelm@63652
   549
lemma (in ring_1) of_nat_nat [simp]: "0 \<le> z \<Longrightarrow> of_nat (nat z) = of_int z"
huffman@48066
   550
  by transfer (clarsimp simp add: of_nat_diff)
haftmann@25919
   551
wenzelm@63652
   552
lemma diff_nat_numeral [simp]: "(numeral v :: nat) - numeral v' = nat (numeral v - numeral v')"
haftmann@54249
   553
  by (simp only: nat_diff_distrib' zero_le_numeral nat_numeral)
haftmann@54249
   554
haftmann@66886
   555
lemma nat_abs_triangle_ineq:
haftmann@66886
   556
  "nat \<bar>k + l\<bar> \<le> nat \<bar>k\<bar> + nat \<bar>l\<bar>"
haftmann@66886
   557
  by (simp add: nat_add_distrib [symmetric] nat_le_eq_zle abs_triangle_ineq)
haftmann@66886
   558
haftmann@66816
   559
lemma nat_of_bool [simp]:
haftmann@66816
   560
  "nat (of_bool P) = of_bool P"
haftmann@66816
   561
  by auto
haftmann@66816
   562
haftmann@66836
   563
lemma split_nat [arith_split]: "P (nat i) \<longleftrightarrow> ((\<forall>n. i = int n \<longrightarrow> P n) \<and> (i < 0 \<longrightarrow> P 0))"
haftmann@66836
   564
  (is "?P = (?L \<and> ?R)")
haftmann@66836
   565
  for i :: int
haftmann@66836
   566
proof (cases "i < 0")
haftmann@66836
   567
  case True
haftmann@66836
   568
  then show ?thesis
haftmann@66836
   569
    by auto
haftmann@66836
   570
next
haftmann@66836
   571
  case False
haftmann@66836
   572
  have "?P = ?L"
haftmann@66836
   573
  proof
haftmann@66836
   574
    assume ?P
haftmann@66836
   575
    then show ?L using False by auto
haftmann@66836
   576
  next
haftmann@66836
   577
    assume ?L
haftmann@66836
   578
    moreover from False have "int (nat i) = i"
haftmann@66836
   579
      by (simp add: not_less)
haftmann@66836
   580
    ultimately show ?P
haftmann@66836
   581
      by simp
haftmann@66836
   582
  qed
haftmann@66836
   583
  with False show ?thesis by simp
haftmann@66836
   584
qed
haftmann@66836
   585
haftmann@66836
   586
lemma all_nat: "(\<forall>x. P x) \<longleftrightarrow> (\<forall>x\<ge>0. P (nat x))"
haftmann@66836
   587
  by (auto split: split_nat)
haftmann@66836
   588
haftmann@66836
   589
lemma ex_nat: "(\<exists>x. P x) \<longleftrightarrow> (\<exists>x. 0 \<le> x \<and> P (nat x))"
haftmann@66836
   590
proof
haftmann@66836
   591
  assume "\<exists>x. P x"
haftmann@66836
   592
  then obtain x where "P x" ..
haftmann@66836
   593
  then have "int x \<ge> 0 \<and> P (nat (int x))" by simp
haftmann@66836
   594
  then show "\<exists>x\<ge>0. P (nat x)" ..
haftmann@66836
   595
next
haftmann@66836
   596
  assume "\<exists>x\<ge>0. P (nat x)"
haftmann@66836
   597
  then show "\<exists>x. P x" by auto
haftmann@66836
   598
qed
haftmann@66836
   599
haftmann@54249
   600
wenzelm@60758
   601
text \<open>For termination proofs:\<close>
wenzelm@63652
   602
lemma measure_function_int[measure_function]: "is_measure (nat \<circ> abs)" ..
krauss@29779
   603
haftmann@25919
   604
wenzelm@63652
   605
subsection \<open>Lemmas about the Function @{term of_nat} and Orderings\<close>
haftmann@25919
   606
wenzelm@61076
   607
lemma negative_zless_0: "- (int (Suc n)) < (0 :: int)"
wenzelm@63652
   608
  by (simp add: order_less_le del: of_nat_Suc)
haftmann@25919
   609
huffman@44709
   610
lemma negative_zless [iff]: "- (int (Suc n)) < int m"
wenzelm@63652
   611
  by (rule negative_zless_0 [THEN order_less_le_trans], simp)
haftmann@25919
   612
huffman@44709
   613
lemma negative_zle_0: "- int n \<le> 0"
wenzelm@63652
   614
  by (simp add: minus_le_iff)
haftmann@25919
   615
huffman@44709
   616
lemma negative_zle [iff]: "- int n \<le> int m"
wenzelm@63652
   617
  by (rule order_trans [OF negative_zle_0 of_nat_0_le_iff])
haftmann@25919
   618
wenzelm@63652
   619
lemma not_zle_0_negative [simp]: "\<not> 0 \<le> - int (Suc n)"
wenzelm@63652
   620
  by (subst le_minus_iff) (simp del: of_nat_Suc)
haftmann@25919
   621
wenzelm@63652
   622
lemma int_zle_neg: "int n \<le> - int m \<longleftrightarrow> n = 0 \<and> m = 0"
huffman@48045
   623
  by transfer simp
haftmann@25919
   624
wenzelm@63652
   625
lemma not_int_zless_negative [simp]: "\<not> int n < - int m"
wenzelm@63652
   626
  by (simp add: linorder_not_less)
haftmann@25919
   627
wenzelm@63652
   628
lemma negative_eq_positive [simp]: "- int n = of_nat m \<longleftrightarrow> n = 0 \<and> m = 0"
wenzelm@63652
   629
  by (force simp add: order_eq_iff [of "- of_nat n"] int_zle_neg)
haftmann@25919
   630
wenzelm@63652
   631
lemma zle_iff_zadd: "w \<le> z \<longleftrightarrow> (\<exists>n. z = w + int n)"
wenzelm@63652
   632
  (is "?lhs \<longleftrightarrow> ?rhs")
haftmann@62348
   633
proof
wenzelm@63652
   634
  assume ?rhs
wenzelm@63652
   635
  then show ?lhs by auto
haftmann@62348
   636
next
wenzelm@63652
   637
  assume ?lhs
haftmann@62348
   638
  then have "0 \<le> z - w" by simp
haftmann@62348
   639
  then obtain n where "z - w = int n"
haftmann@62348
   640
    using zero_le_imp_eq_int [of "z - w"] by blast
wenzelm@63652
   641
  then have "z = w + int n" by simp
wenzelm@63652
   642
  then show ?rhs ..
haftmann@25919
   643
qed
haftmann@25919
   644
huffman@44709
   645
lemma zadd_int_left: "int m + (int n + z) = int (m + n) + z"
wenzelm@63652
   646
  by simp
haftmann@25919
   647
wenzelm@63652
   648
text \<open>
wenzelm@63652
   649
  This version is proved for all ordered rings, not just integers!
wenzelm@63652
   650
  It is proved here because attribute \<open>arith_split\<close> is not available
wenzelm@63652
   651
  in theory \<open>Rings\<close>.
wenzelm@63652
   652
  But is it really better than just rewriting with \<open>abs_if\<close>?
wenzelm@63652
   653
\<close>
wenzelm@63652
   654
lemma abs_split [arith_split, no_atp]: "P \<bar>a\<bar> \<longleftrightarrow> (0 \<le> a \<longrightarrow> P a) \<and> (a < 0 \<longrightarrow> P (- a))"
wenzelm@63652
   655
  for a :: "'a::linordered_idom"
wenzelm@63652
   656
  by (force dest: order_less_le_trans simp add: abs_if linorder_not_less)
haftmann@25919
   657
huffman@44709
   658
lemma negD: "x < 0 \<Longrightarrow> \<exists>n. x = - (int (Suc n))"
wenzelm@63652
   659
  apply transfer
wenzelm@63652
   660
  apply clarsimp
wenzelm@63652
   661
  apply (rule_tac x="b - Suc a" in exI)
wenzelm@63652
   662
  apply arith
wenzelm@63652
   663
  done
wenzelm@63652
   664
haftmann@25919
   665
wenzelm@60758
   666
subsection \<open>Cases and induction\<close>
haftmann@25919
   667
wenzelm@63652
   668
text \<open>
wenzelm@63652
   669
  Now we replace the case analysis rule by a more conventional one:
wenzelm@63652
   670
  whether an integer is negative or not.
wenzelm@63652
   671
\<close>
haftmann@25919
   672
wenzelm@63652
   673
text \<open>This version is symmetric in the two subgoals.\<close>
wenzelm@63652
   674
lemma int_cases2 [case_names nonneg nonpos, cases type: int]:
wenzelm@63652
   675
  "(\<And>n. z = int n \<Longrightarrow> P) \<Longrightarrow> (\<And>n. z = - (int n) \<Longrightarrow> P) \<Longrightarrow> P"
wenzelm@63652
   676
  by (cases "z < 0") (auto simp add: linorder_not_less dest!: negD nat_0_le [THEN sym])
lp15@59613
   677
wenzelm@63652
   678
text \<open>This is the default, with a negative case.\<close>
wenzelm@63652
   679
lemma int_cases [case_names nonneg neg, cases type: int]:
wenzelm@63652
   680
  "(\<And>n. z = int n \<Longrightarrow> P) \<Longrightarrow> (\<And>n. z = - (int (Suc n)) \<Longrightarrow> P) \<Longrightarrow> P"
wenzelm@63652
   681
  apply (cases "z < 0")
wenzelm@63652
   682
   apply (blast dest!: negD)
wenzelm@63652
   683
  apply (simp add: linorder_not_less del: of_nat_Suc)
wenzelm@63652
   684
  apply auto
wenzelm@63652
   685
  apply (blast dest: nat_0_le [THEN sym])
wenzelm@63652
   686
  done
haftmann@25919
   687
haftmann@60868
   688
lemma int_cases3 [case_names zero pos neg]:
haftmann@60868
   689
  fixes k :: int
haftmann@60868
   690
  assumes "k = 0 \<Longrightarrow> P" and "\<And>n. k = int n \<Longrightarrow> n > 0 \<Longrightarrow> P"
paulson@61204
   691
    and "\<And>n. k = - int n \<Longrightarrow> n > 0 \<Longrightarrow> P"
haftmann@60868
   692
  shows "P"
haftmann@60868
   693
proof (cases k "0::int" rule: linorder_cases)
wenzelm@63652
   694
  case equal
wenzelm@63652
   695
  with assms(1) show P by simp
haftmann@60868
   696
next
haftmann@60868
   697
  case greater
wenzelm@63539
   698
  then have *: "nat k > 0" by simp
wenzelm@63539
   699
  moreover from * have "k = int (nat k)" by auto
haftmann@60868
   700
  ultimately show P using assms(2) by blast
haftmann@60868
   701
next
haftmann@60868
   702
  case less
wenzelm@63539
   703
  then have *: "nat (- k) > 0" by simp
wenzelm@63539
   704
  moreover from * have "k = - int (nat (- k))" by auto
haftmann@60868
   705
  ultimately show P using assms(3) by blast
haftmann@60868
   706
qed
haftmann@60868
   707
wenzelm@63652
   708
lemma int_of_nat_induct [case_names nonneg neg, induct type: int]:
wenzelm@63652
   709
  "(\<And>n. P (int n)) \<Longrightarrow> (\<And>n. P (- (int (Suc n)))) \<Longrightarrow> P z"
wenzelm@42676
   710
  by (cases z) auto
haftmann@25919
   711
huffman@47108
   712
lemma Let_numeral [simp]: "Let (numeral v) f = f (numeral v)"
wenzelm@61799
   713
  \<comment> \<open>Unfold all \<open>let\<close>s involving constants\<close>
wenzelm@61799
   714
  by (fact Let_numeral) \<comment> \<open>FIXME drop\<close>
haftmann@37767
   715
haftmann@54489
   716
lemma Let_neg_numeral [simp]: "Let (- numeral v) f = f (- numeral v)"
wenzelm@61799
   717
  \<comment> \<open>Unfold all \<open>let\<close>s involving constants\<close>
wenzelm@61799
   718
  by (fact Let_neg_numeral) \<comment> \<open>FIXME drop\<close>
haftmann@25919
   719
haftmann@66816
   720
lemma sgn_mult_dvd_iff [simp]:
haftmann@66816
   721
  "sgn r * l dvd k \<longleftrightarrow> l dvd k \<and> (r = 0 \<longrightarrow> k = 0)" for k l r :: int
haftmann@66816
   722
  by (cases r rule: int_cases3) auto
haftmann@66816
   723
haftmann@66816
   724
lemma mult_sgn_dvd_iff [simp]:
haftmann@66816
   725
  "l * sgn r dvd k \<longleftrightarrow> l dvd k \<and> (r = 0 \<longrightarrow> k = 0)" for k l r :: int
haftmann@66816
   726
  using sgn_mult_dvd_iff [of r l k] by (simp add: ac_simps)
haftmann@66816
   727
haftmann@66816
   728
lemma dvd_sgn_mult_iff [simp]:
haftmann@66816
   729
  "l dvd sgn r * k \<longleftrightarrow> l dvd k \<or> r = 0" for k l r :: int
haftmann@66816
   730
  by (cases r rule: int_cases3) simp_all
haftmann@66816
   731
haftmann@66816
   732
lemma dvd_mult_sgn_iff [simp]:
haftmann@66816
   733
  "l dvd k * sgn r \<longleftrightarrow> l dvd k \<or> r = 0" for k l r :: int
haftmann@66816
   734
  using dvd_sgn_mult_iff [of l r k] by (simp add: ac_simps)
haftmann@66816
   735
haftmann@66816
   736
lemma int_sgnE:
haftmann@66816
   737
  fixes k :: int
haftmann@66816
   738
  obtains n and l where "k = sgn l * int n"
haftmann@66816
   739
proof -
haftmann@66816
   740
  have "k = sgn k * int (nat \<bar>k\<bar>)"
haftmann@66816
   741
    by (simp add: sgn_mult_abs)
haftmann@66816
   742
  then show ?thesis ..
haftmann@66816
   743
qed
haftmann@66816
   744
wenzelm@61799
   745
text \<open>Unfold \<open>min\<close> and \<open>max\<close> on numerals.\<close>
huffman@28958
   746
huffman@47108
   747
lemmas max_number_of [simp] =
huffman@47108
   748
  max_def [of "numeral u" "numeral v"]
haftmann@54489
   749
  max_def [of "numeral u" "- numeral v"]
haftmann@54489
   750
  max_def [of "- numeral u" "numeral v"]
haftmann@54489
   751
  max_def [of "- numeral u" "- numeral v"] for u v
huffman@28958
   752
huffman@47108
   753
lemmas min_number_of [simp] =
huffman@47108
   754
  min_def [of "numeral u" "numeral v"]
haftmann@54489
   755
  min_def [of "numeral u" "- numeral v"]
haftmann@54489
   756
  min_def [of "- numeral u" "numeral v"]
haftmann@54489
   757
  min_def [of "- numeral u" "- numeral v"] for u v
huffman@26075
   758
haftmann@25919
   759
wenzelm@60758
   760
subsubsection \<open>Binary comparisons\<close>
huffman@28958
   761
wenzelm@60758
   762
text \<open>Preliminaries\<close>
huffman@28958
   763
lp15@60162
   764
lemma le_imp_0_less:
wenzelm@63652
   765
  fixes z :: int
huffman@28958
   766
  assumes le: "0 \<le> z"
wenzelm@63652
   767
  shows "0 < 1 + z"
huffman@28958
   768
proof -
huffman@28958
   769
  have "0 \<le> z" by fact
wenzelm@63652
   770
  also have "\<dots> < z + 1" by (rule less_add_one)
wenzelm@63652
   771
  also have "\<dots> = 1 + z" by (simp add: ac_simps)
huffman@28958
   772
  finally show "0 < 1 + z" .
huffman@28958
   773
qed
huffman@28958
   774
wenzelm@63652
   775
lemma odd_less_0_iff: "1 + z + z < 0 \<longleftrightarrow> z < 0"
wenzelm@63652
   776
  for z :: int
wenzelm@42676
   777
proof (cases z)
huffman@28958
   778
  case (nonneg n)
wenzelm@63652
   779
  then show ?thesis
wenzelm@63652
   780
    by (simp add: linorder_not_less add.assoc add_increasing le_imp_0_less [THEN order_less_imp_le])
huffman@28958
   781
next
huffman@28958
   782
  case (neg n)
wenzelm@63652
   783
  then show ?thesis
wenzelm@63652
   784
    by (simp del: of_nat_Suc of_nat_add of_nat_1
wenzelm@63652
   785
        add: algebra_simps of_nat_1 [where 'a=int, symmetric] of_nat_add [symmetric])
huffman@28958
   786
qed
huffman@28958
   787
wenzelm@63652
   788
wenzelm@60758
   789
subsubsection \<open>Comparisons, for Ordered Rings\<close>
haftmann@25919
   790
haftmann@25919
   791
lemmas double_eq_0_iff = double_zero
haftmann@25919
   792
wenzelm@63652
   793
lemma odd_nonzero: "1 + z + z \<noteq> 0"
wenzelm@63652
   794
  for z :: int
wenzelm@42676
   795
proof (cases z)
haftmann@25919
   796
  case (nonneg n)
wenzelm@63652
   797
  have le: "0 \<le> z + z"
wenzelm@63652
   798
    by (simp add: nonneg add_increasing)
wenzelm@63652
   799
  then show ?thesis
wenzelm@63652
   800
    using  le_imp_0_less [OF le] by (auto simp: add.assoc)
haftmann@25919
   801
next
haftmann@25919
   802
  case (neg n)
haftmann@25919
   803
  show ?thesis
haftmann@25919
   804
  proof
haftmann@25919
   805
    assume eq: "1 + z + z = 0"
wenzelm@63652
   806
    have "0 < 1 + (int n + int n)"
lp15@60162
   807
      by (simp add: le_imp_0_less add_increasing)
wenzelm@63652
   808
    also have "\<dots> = - (1 + z + z)"
lp15@60162
   809
      by (simp add: neg add.assoc [symmetric])
wenzelm@63652
   810
    also have "\<dots> = 0" by (simp add: eq)
haftmann@25919
   811
    finally have "0<0" ..
wenzelm@63652
   812
    then show False by blast
haftmann@25919
   813
  qed
haftmann@25919
   814
qed
haftmann@25919
   815
haftmann@30652
   816
wenzelm@60758
   817
subsection \<open>The Set of Integers\<close>
haftmann@25919
   818
haftmann@25919
   819
context ring_1
haftmann@25919
   820
begin
haftmann@25919
   821
wenzelm@61070
   822
definition Ints :: "'a set"  ("\<int>")
wenzelm@61070
   823
  where "\<int> = range of_int"
haftmann@25919
   824
huffman@35634
   825
lemma Ints_of_int [simp]: "of_int z \<in> \<int>"
huffman@35634
   826
  by (simp add: Ints_def)
huffman@35634
   827
huffman@35634
   828
lemma Ints_of_nat [simp]: "of_nat n \<in> \<int>"
huffman@45533
   829
  using Ints_of_int [of "of_nat n"] by simp
huffman@35634
   830
haftmann@25919
   831
lemma Ints_0 [simp]: "0 \<in> \<int>"
huffman@45533
   832
  using Ints_of_int [of "0"] by simp
haftmann@25919
   833
haftmann@25919
   834
lemma Ints_1 [simp]: "1 \<in> \<int>"
huffman@45533
   835
  using Ints_of_int [of "1"] by simp
haftmann@25919
   836
eberlm@61552
   837
lemma Ints_numeral [simp]: "numeral n \<in> \<int>"
eberlm@61552
   838
  by (subst of_nat_numeral [symmetric], rule Ints_of_nat)
eberlm@61552
   839
haftmann@25919
   840
lemma Ints_add [simp]: "a \<in> \<int> \<Longrightarrow> b \<in> \<int> \<Longrightarrow> a + b \<in> \<int>"
wenzelm@63652
   841
  apply (auto simp add: Ints_def)
wenzelm@63652
   842
  apply (rule range_eqI)
wenzelm@63652
   843
  apply (rule of_int_add [symmetric])
wenzelm@63652
   844
  done
haftmann@25919
   845
haftmann@25919
   846
lemma Ints_minus [simp]: "a \<in> \<int> \<Longrightarrow> -a \<in> \<int>"
wenzelm@63652
   847
  apply (auto simp add: Ints_def)
wenzelm@63652
   848
  apply (rule range_eqI)
wenzelm@63652
   849
  apply (rule of_int_minus [symmetric])
wenzelm@63652
   850
  done
haftmann@25919
   851
huffman@35634
   852
lemma Ints_diff [simp]: "a \<in> \<int> \<Longrightarrow> b \<in> \<int> \<Longrightarrow> a - b \<in> \<int>"
wenzelm@63652
   853
  apply (auto simp add: Ints_def)
wenzelm@63652
   854
  apply (rule range_eqI)
wenzelm@63652
   855
  apply (rule of_int_diff [symmetric])
wenzelm@63652
   856
  done
huffman@35634
   857
haftmann@25919
   858
lemma Ints_mult [simp]: "a \<in> \<int> \<Longrightarrow> b \<in> \<int> \<Longrightarrow> a * b \<in> \<int>"
wenzelm@63652
   859
  apply (auto simp add: Ints_def)
wenzelm@63652
   860
  apply (rule range_eqI)
wenzelm@63652
   861
  apply (rule of_int_mult [symmetric])
wenzelm@63652
   862
  done
haftmann@25919
   863
huffman@35634
   864
lemma Ints_power [simp]: "a \<in> \<int> \<Longrightarrow> a ^ n \<in> \<int>"
wenzelm@63652
   865
  by (induct n) simp_all
huffman@35634
   866
haftmann@25919
   867
lemma Ints_cases [cases set: Ints]:
haftmann@25919
   868
  assumes "q \<in> \<int>"
haftmann@25919
   869
  obtains (of_int) z where "q = of_int z"
haftmann@25919
   870
  unfolding Ints_def
haftmann@25919
   871
proof -
wenzelm@60758
   872
  from \<open>q \<in> \<int>\<close> have "q \<in> range of_int" unfolding Ints_def .
haftmann@25919
   873
  then obtain z where "q = of_int z" ..
haftmann@25919
   874
  then show thesis ..
haftmann@25919
   875
qed
haftmann@25919
   876
haftmann@25919
   877
lemma Ints_induct [case_names of_int, induct set: Ints]:
haftmann@25919
   878
  "q \<in> \<int> \<Longrightarrow> (\<And>z. P (of_int z)) \<Longrightarrow> P q"
haftmann@25919
   879
  by (rule Ints_cases) auto
haftmann@25919
   880
eberlm@61524
   881
lemma Nats_subset_Ints: "\<nat> \<subseteq> \<int>"
eberlm@61524
   882
  unfolding Nats_def Ints_def
eberlm@61524
   883
  by (rule subsetI, elim imageE, hypsubst, subst of_int_of_nat_eq[symmetric], rule imageI) simp_all
eberlm@61524
   884
eberlm@61524
   885
lemma Nats_altdef1: "\<nat> = {of_int n |n. n \<ge> 0}"
eberlm@61524
   886
proof (intro subsetI equalityI)
wenzelm@63652
   887
  fix x :: 'a
wenzelm@63652
   888
  assume "x \<in> {of_int n |n. n \<ge> 0}"
wenzelm@63652
   889
  then obtain n where "x = of_int n" "n \<ge> 0"
wenzelm@63652
   890
    by (auto elim!: Ints_cases)
wenzelm@63652
   891
  then have "x = of_nat (nat n)"
wenzelm@63652
   892
    by (subst of_nat_nat) simp_all
wenzelm@63652
   893
  then show "x \<in> \<nat>"
wenzelm@63652
   894
    by simp
eberlm@61524
   895
next
wenzelm@63652
   896
  fix x :: 'a
wenzelm@63652
   897
  assume "x \<in> \<nat>"
wenzelm@63652
   898
  then obtain n where "x = of_nat n"
wenzelm@63652
   899
    by (auto elim!: Nats_cases)
wenzelm@63652
   900
  then have "x = of_int (int n)" by simp
eberlm@61524
   901
  also have "int n \<ge> 0" by simp
wenzelm@63652
   902
  then have "of_int (int n) \<in> {of_int n |n. n \<ge> 0}" by blast
eberlm@61524
   903
  finally show "x \<in> {of_int n |n. n \<ge> 0}" .
eberlm@61524
   904
qed
eberlm@61524
   905
haftmann@25919
   906
end
haftmann@25919
   907
lp15@64758
   908
lemma (in linordered_idom) Ints_abs [simp]:
lp15@64758
   909
  shows "a \<in> \<int> \<Longrightarrow> abs a \<in> \<int>"
lp15@64758
   910
  by (auto simp: abs_if)
lp15@64758
   911
eberlm@61524
   912
lemma (in linordered_idom) Nats_altdef2: "\<nat> = {n \<in> \<int>. n \<ge> 0}"
eberlm@61524
   913
proof (intro subsetI equalityI)
wenzelm@63652
   914
  fix x :: 'a
wenzelm@63652
   915
  assume "x \<in> {n \<in> \<int>. n \<ge> 0}"
wenzelm@63652
   916
  then obtain n where "x = of_int n" "n \<ge> 0"
wenzelm@63652
   917
    by (auto elim!: Ints_cases)
wenzelm@63652
   918
  then have "x = of_nat (nat n)"
wenzelm@63652
   919
    by (subst of_nat_nat) simp_all
wenzelm@63652
   920
  then show "x \<in> \<nat>"
wenzelm@63652
   921
    by simp
eberlm@61524
   922
qed (auto elim!: Nats_cases)
eberlm@61524
   923
haftmann@64849
   924
lemma (in idom_divide) of_int_divide_in_Ints: 
haftmann@64849
   925
  "of_int a div of_int b \<in> \<int>" if "b dvd a"
haftmann@64849
   926
proof -
haftmann@64849
   927
  from that obtain c where "a = b * c" ..
haftmann@64849
   928
  then show ?thesis
haftmann@64849
   929
    by (cases "of_int b = 0") simp_all
haftmann@64849
   930
qed
eberlm@61524
   931
wenzelm@60758
   932
text \<open>The premise involving @{term Ints} prevents @{term "a = 1/2"}.\<close>
haftmann@25919
   933
haftmann@25919
   934
lemma Ints_double_eq_0_iff:
wenzelm@63652
   935
  fixes a :: "'a::ring_char_0"
wenzelm@61070
   936
  assumes in_Ints: "a \<in> \<int>"
wenzelm@63652
   937
  shows "a + a = 0 \<longleftrightarrow> a = 0"
wenzelm@63652
   938
    (is "?lhs \<longleftrightarrow> ?rhs")
haftmann@25919
   939
proof -
wenzelm@63652
   940
  from in_Ints have "a \<in> range of_int"
wenzelm@63652
   941
    unfolding Ints_def [symmetric] .
haftmann@25919
   942
  then obtain z where a: "a = of_int z" ..
haftmann@25919
   943
  show ?thesis
haftmann@25919
   944
  proof
wenzelm@63652
   945
    assume ?rhs
wenzelm@63652
   946
    then show ?lhs by simp
haftmann@25919
   947
  next
wenzelm@63652
   948
    assume ?lhs
wenzelm@63652
   949
    with a have "of_int (z + z) = (of_int 0 :: 'a)" by simp
wenzelm@63652
   950
    then have "z + z = 0" by (simp only: of_int_eq_iff)
wenzelm@63652
   951
    then have "z = 0" by (simp only: double_eq_0_iff)
wenzelm@63652
   952
    with a show ?rhs by simp
haftmann@25919
   953
  qed
haftmann@25919
   954
qed
haftmann@25919
   955
haftmann@25919
   956
lemma Ints_odd_nonzero:
wenzelm@63652
   957
  fixes a :: "'a::ring_char_0"
wenzelm@61070
   958
  assumes in_Ints: "a \<in> \<int>"
wenzelm@63652
   959
  shows "1 + a + a \<noteq> 0"
haftmann@25919
   960
proof -
wenzelm@63652
   961
  from in_Ints have "a \<in> range of_int"
wenzelm@63652
   962
    unfolding Ints_def [symmetric] .
haftmann@25919
   963
  then obtain z where a: "a = of_int z" ..
haftmann@25919
   964
  show ?thesis
haftmann@25919
   965
  proof
wenzelm@63652
   966
    assume "1 + a + a = 0"
wenzelm@63652
   967
    with a have "of_int (1 + z + z) = (of_int 0 :: 'a)" by simp
wenzelm@63652
   968
    then have "1 + z + z = 0" by (simp only: of_int_eq_iff)
haftmann@25919
   969
    with odd_nonzero show False by blast
haftmann@25919
   970
  qed
lp15@60162
   971
qed
haftmann@25919
   972
wenzelm@61070
   973
lemma Nats_numeral [simp]: "numeral w \<in> \<nat>"
huffman@47108
   974
  using of_nat_in_Nats [of "numeral w"] by simp
huffman@35634
   975
lp15@60162
   976
lemma Ints_odd_less_0:
wenzelm@63652
   977
  fixes a :: "'a::linordered_idom"
wenzelm@61070
   978
  assumes in_Ints: "a \<in> \<int>"
wenzelm@63652
   979
  shows "1 + a + a < 0 \<longleftrightarrow> a < 0"
haftmann@25919
   980
proof -
wenzelm@63652
   981
  from in_Ints have "a \<in> range of_int"
wenzelm@63652
   982
    unfolding Ints_def [symmetric] .
haftmann@25919
   983
  then obtain z where a: "a = of_int z" ..
wenzelm@63652
   984
  with a have "1 + a + a < 0 \<longleftrightarrow> of_int (1 + z + z) < (of_int 0 :: 'a)"
wenzelm@63652
   985
    by simp
wenzelm@63652
   986
  also have "\<dots> \<longleftrightarrow> z < 0"
wenzelm@63652
   987
    by (simp only: of_int_less_iff odd_less_0_iff)
wenzelm@63652
   988
  also have "\<dots> \<longleftrightarrow> a < 0"
haftmann@25919
   989
    by (simp add: a)
haftmann@25919
   990
  finally show ?thesis .
haftmann@25919
   991
qed
haftmann@25919
   992
haftmann@25919
   993
nipkow@64272
   994
subsection \<open>@{term sum} and @{term prod}\<close>
haftmann@25919
   995
nipkow@64267
   996
lemma of_nat_sum [simp]: "of_nat (sum f A) = (\<Sum>x\<in>A. of_nat(f x))"
wenzelm@63652
   997
  by (induct A rule: infinite_finite_induct) auto
haftmann@25919
   998
nipkow@64267
   999
lemma of_int_sum [simp]: "of_int (sum f A) = (\<Sum>x\<in>A. of_int(f x))"
wenzelm@63652
  1000
  by (induct A rule: infinite_finite_induct) auto
haftmann@25919
  1001
nipkow@64272
  1002
lemma of_nat_prod [simp]: "of_nat (prod f A) = (\<Prod>x\<in>A. of_nat(f x))"
wenzelm@63652
  1003
  by (induct A rule: infinite_finite_induct) auto
haftmann@25919
  1004
nipkow@64272
  1005
lemma of_int_prod [simp]: "of_int (prod f A) = (\<Prod>x\<in>A. of_int(f x))"
wenzelm@63652
  1006
  by (induct A rule: infinite_finite_induct) auto
haftmann@25919
  1007
haftmann@25919
  1008
wenzelm@60758
  1009
text \<open>Legacy theorems\<close>
haftmann@25919
  1010
haftmann@64714
  1011
lemmas int_sum = of_nat_sum [where 'a=int]
haftmann@64714
  1012
lemmas int_prod = of_nat_prod [where 'a=int]
haftmann@25919
  1013
lemmas zle_int = of_nat_le_iff [where 'a=int]
haftmann@25919
  1014
lemmas int_int_eq = of_nat_eq_iff [where 'a=int]
haftmann@64714
  1015
lemmas nonneg_eq_int = nonneg_int_cases
haftmann@25919
  1016
wenzelm@63652
  1017
wenzelm@60758
  1018
subsection \<open>Setting up simplification procedures\<close>
huffman@30802
  1019
haftmann@54249
  1020
lemmas of_int_simps =
haftmann@54249
  1021
  of_int_0 of_int_1 of_int_add of_int_mult
haftmann@54249
  1022
wenzelm@48891
  1023
ML_file "Tools/int_arith.ML"
wenzelm@60758
  1024
declaration \<open>K Int_Arith.setup\<close>
haftmann@25919
  1025
wenzelm@63652
  1026
simproc_setup fast_arith
wenzelm@63652
  1027
  ("(m::'a::linordered_idom) < n" |
wenzelm@63652
  1028
    "(m::'a::linordered_idom) \<le> n" |
wenzelm@63652
  1029
    "(m::'a::linordered_idom) = n") =
wenzelm@61144
  1030
  \<open>K Lin_Arith.simproc\<close>
wenzelm@43595
  1031
haftmann@25919
  1032
wenzelm@60758
  1033
subsection\<open>More Inequality Reasoning\<close>
haftmann@25919
  1034
wenzelm@63652
  1035
lemma zless_add1_eq: "w < z + 1 \<longleftrightarrow> w < z \<or> w = z"
wenzelm@63652
  1036
  for w z :: int
wenzelm@63652
  1037
  by arith
haftmann@25919
  1038
wenzelm@63652
  1039
lemma add1_zle_eq: "w + 1 \<le> z \<longleftrightarrow> w < z"
wenzelm@63652
  1040
  for w z :: int
wenzelm@63652
  1041
  by arith
haftmann@25919
  1042
wenzelm@63652
  1043
lemma zle_diff1_eq [simp]: "w \<le> z - 1 \<longleftrightarrow> w < z"
wenzelm@63652
  1044
  for w z :: int
wenzelm@63652
  1045
  by arith
haftmann@25919
  1046
wenzelm@63652
  1047
lemma zle_add1_eq_le [simp]: "w < z + 1 \<longleftrightarrow> w \<le> z"
wenzelm@63652
  1048
  for w z :: int
wenzelm@63652
  1049
  by arith
haftmann@25919
  1050
wenzelm@63652
  1051
lemma int_one_le_iff_zero_less: "1 \<le> z \<longleftrightarrow> 0 < z"
wenzelm@63652
  1052
  for z :: int
wenzelm@63652
  1053
  by arith
haftmann@25919
  1054
lp15@64758
  1055
lemma Ints_nonzero_abs_ge1:
lp15@64758
  1056
  fixes x:: "'a :: linordered_idom"
lp15@64758
  1057
    assumes "x \<in> Ints" "x \<noteq> 0"
lp15@64758
  1058
    shows "1 \<le> abs x"
lp15@64758
  1059
proof (rule Ints_cases [OF \<open>x \<in> Ints\<close>])
lp15@64758
  1060
  fix z::int
lp15@64758
  1061
  assume "x = of_int z"
lp15@64758
  1062
    with \<open>x \<noteq> 0\<close> 
lp15@64758
  1063
  show "1 \<le> \<bar>x\<bar>"
lp15@64758
  1064
    apply (auto simp add: abs_if)
lp15@64758
  1065
    by (metis diff_0 of_int_1 of_int_le_iff of_int_minus zle_diff1_eq)
lp15@64758
  1066
qed
lp15@64758
  1067
  
lp15@64758
  1068
lemma Ints_nonzero_abs_less1:
lp15@64758
  1069
  fixes x:: "'a :: linordered_idom"
lp15@64758
  1070
  shows "\<lbrakk>x \<in> Ints; abs x < 1\<rbrakk> \<Longrightarrow> x = 0"
lp15@64758
  1071
    using Ints_nonzero_abs_ge1 [of x] by auto
lp15@64758
  1072
    
haftmann@25919
  1073
wenzelm@63652
  1074
subsection \<open>The functions @{term nat} and @{term int}\<close>
haftmann@25919
  1075
wenzelm@63652
  1076
text \<open>Simplify the term @{term "w + - z"}.\<close>
haftmann@25919
  1077
wenzelm@63652
  1078
lemma one_less_nat_eq [simp]: "Suc 0 < nat z \<longleftrightarrow> 1 < z"
lp15@60162
  1079
  using zless_nat_conj [of 1 z] by auto
haftmann@25919
  1080
wenzelm@63652
  1081
text \<open>
wenzelm@63652
  1082
  This simplifies expressions of the form @{term "int n = z"} where
wenzelm@63652
  1083
  \<open>z\<close> is an integer literal.
wenzelm@63652
  1084
\<close>
huffman@47108
  1085
lemmas int_eq_iff_numeral [simp] = int_eq_iff [of _ "numeral v"] for v
haftmann@25919
  1086
hoelzl@59000
  1087
lemma nat_abs_int_diff: "nat \<bar>int a - int b\<bar> = (if a \<le> b then b - a else a - b)"
hoelzl@59000
  1088
  by auto
hoelzl@59000
  1089
hoelzl@59000
  1090
lemma nat_int_add: "nat (int a + int b) = a + b"
hoelzl@59000
  1091
  by auto
hoelzl@59000
  1092
haftmann@25919
  1093
context ring_1
haftmann@25919
  1094
begin
haftmann@25919
  1095
blanchet@33056
  1096
lemma of_int_of_nat [nitpick_simp]:
haftmann@25919
  1097
  "of_int k = (if k < 0 then - of_nat (nat (- k)) else of_nat (nat k))"
haftmann@25919
  1098
proof (cases "k < 0")
wenzelm@63652
  1099
  case True
wenzelm@63652
  1100
  then have "0 \<le> - k" by simp
haftmann@25919
  1101
  then have "of_nat (nat (- k)) = of_int (- k)" by (rule of_nat_nat)
haftmann@25919
  1102
  with True show ?thesis by simp
haftmann@25919
  1103
next
wenzelm@63652
  1104
  case False
wenzelm@63652
  1105
  then show ?thesis by (simp add: not_less)
haftmann@25919
  1106
qed
haftmann@25919
  1107
haftmann@25919
  1108
end
haftmann@25919
  1109
haftmann@64014
  1110
lemma transfer_rule_of_int:
haftmann@64014
  1111
  fixes R :: "'a::ring_1 \<Rightarrow> 'b::ring_1 \<Rightarrow> bool"
haftmann@64014
  1112
  assumes [transfer_rule]: "R 0 0" "R 1 1"
haftmann@64014
  1113
    "rel_fun R (rel_fun R R) plus plus"
haftmann@64014
  1114
    "rel_fun R R uminus uminus"
haftmann@64014
  1115
  shows "rel_fun HOL.eq R of_int of_int"
haftmann@64014
  1116
proof -
haftmann@64014
  1117
  note transfer_rule_of_nat [transfer_rule]
haftmann@64014
  1118
  have [transfer_rule]: "rel_fun HOL.eq R of_nat of_nat"
haftmann@64014
  1119
    by transfer_prover
haftmann@64014
  1120
  show ?thesis
haftmann@64014
  1121
    by (unfold of_int_of_nat [abs_def]) transfer_prover
haftmann@64014
  1122
qed
haftmann@64014
  1123
haftmann@25919
  1124
lemma nat_mult_distrib:
haftmann@25919
  1125
  fixes z z' :: int
haftmann@25919
  1126
  assumes "0 \<le> z"
haftmann@25919
  1127
  shows "nat (z * z') = nat z * nat z'"
haftmann@25919
  1128
proof (cases "0 \<le> z'")
wenzelm@63652
  1129
  case False
wenzelm@63652
  1130
  with assms have "z * z' \<le> 0"
haftmann@25919
  1131
    by (simp add: not_le mult_le_0_iff)
haftmann@25919
  1132
  then have "nat (z * z') = 0" by simp
haftmann@25919
  1133
  moreover from False have "nat z' = 0" by simp
haftmann@25919
  1134
  ultimately show ?thesis by simp
haftmann@25919
  1135
next
wenzelm@63652
  1136
  case True
wenzelm@63652
  1137
  with assms have ge_0: "z * z' \<ge> 0" by (simp add: zero_le_mult_iff)
haftmann@25919
  1138
  show ?thesis
haftmann@25919
  1139
    by (rule injD [of "of_nat :: nat \<Rightarrow> int", OF inj_of_nat])
haftmann@25919
  1140
      (simp only: of_nat_mult of_nat_nat [OF True]
haftmann@25919
  1141
         of_nat_nat [OF assms] of_nat_nat [OF ge_0], simp)
haftmann@25919
  1142
qed
haftmann@25919
  1143
wenzelm@63652
  1144
lemma nat_mult_distrib_neg: "z \<le> 0 \<Longrightarrow> nat (z * z') = nat (- z) * nat (- z')"
wenzelm@63652
  1145
  for z z' :: int
wenzelm@63652
  1146
  apply (rule trans)
wenzelm@63652
  1147
   apply (rule_tac [2] nat_mult_distrib)
wenzelm@63652
  1148
   apply auto
wenzelm@63652
  1149
  done
haftmann@25919
  1150
wenzelm@61944
  1151
lemma nat_abs_mult_distrib: "nat \<bar>w * z\<bar> = nat \<bar>w\<bar> * nat \<bar>z\<bar>"
wenzelm@63652
  1152
  by (cases "z = 0 \<or> w = 0")
wenzelm@63652
  1153
    (auto simp add: abs_if nat_mult_distrib [symmetric]
wenzelm@63652
  1154
      nat_mult_distrib_neg [symmetric] mult_less_0_iff)
haftmann@25919
  1155
wenzelm@63652
  1156
lemma int_in_range_abs [simp]: "int n \<in> range abs"
haftmann@60570
  1157
proof (rule range_eqI)
wenzelm@63652
  1158
  show "int n = \<bar>int n\<bar>" by simp
haftmann@60570
  1159
qed
haftmann@60570
  1160
wenzelm@63652
  1161
lemma range_abs_Nats [simp]: "range abs = (\<nat> :: int set)"
haftmann@60570
  1162
proof -
haftmann@60570
  1163
  have "\<bar>k\<bar> \<in> \<nat>" for k :: int
haftmann@60570
  1164
    by (cases k) simp_all
haftmann@60570
  1165
  moreover have "k \<in> range abs" if "k \<in> \<nat>" for k :: int
haftmann@60570
  1166
    using that by induct simp
haftmann@60570
  1167
  ultimately show ?thesis by blast
paulson@61204
  1168
qed
haftmann@60570
  1169
wenzelm@63652
  1170
lemma Suc_nat_eq_nat_zadd1: "0 \<le> z \<Longrightarrow> Suc (nat z) = nat (1 + z)"
wenzelm@63652
  1171
  for z :: int
wenzelm@63652
  1172
  by (rule sym) (simp add: nat_eq_iff)
huffman@47207
  1173
huffman@47207
  1174
lemma diff_nat_eq_if:
wenzelm@63652
  1175
  "nat z - nat z' =
wenzelm@63652
  1176
    (if z' < 0 then nat z
wenzelm@63652
  1177
     else
wenzelm@63652
  1178
      let d = z - z'
wenzelm@63652
  1179
      in if d < 0 then 0 else nat d)"
wenzelm@63652
  1180
  by (simp add: Let_def nat_diff_distrib [symmetric])
huffman@47207
  1181
wenzelm@63652
  1182
lemma nat_numeral_diff_1 [simp]: "numeral v - (1::nat) = nat (numeral v - 1)"
huffman@47207
  1183
  using diff_nat_numeral [of v Num.One] by simp
huffman@47207
  1184
haftmann@25919
  1185
wenzelm@63652
  1186
subsection \<open>Induction principles for int\<close>
haftmann@25919
  1187
wenzelm@63652
  1188
text \<open>Well-founded segments of the integers.\<close>
haftmann@25919
  1189
wenzelm@63652
  1190
definition int_ge_less_than :: "int \<Rightarrow> (int \<times> int) set"
wenzelm@63652
  1191
  where "int_ge_less_than d = {(z', z). d \<le> z' \<and> z' < z}"
haftmann@25919
  1192
wenzelm@63652
  1193
lemma wf_int_ge_less_than: "wf (int_ge_less_than d)"
haftmann@25919
  1194
proof -
wenzelm@63652
  1195
  have "int_ge_less_than d \<subseteq> measure (\<lambda>z. nat (z - d))"
haftmann@25919
  1196
    by (auto simp add: int_ge_less_than_def)
wenzelm@63652
  1197
  then show ?thesis
lp15@60162
  1198
    by (rule wf_subset [OF wf_measure])
haftmann@25919
  1199
qed
haftmann@25919
  1200
wenzelm@63652
  1201
text \<open>
wenzelm@63652
  1202
  This variant looks odd, but is typical of the relations suggested
wenzelm@63652
  1203
  by RankFinder.\<close>
haftmann@25919
  1204
wenzelm@63652
  1205
definition int_ge_less_than2 :: "int \<Rightarrow> (int \<times> int) set"
wenzelm@63652
  1206
  where "int_ge_less_than2 d = {(z',z). d \<le> z \<and> z' < z}"
haftmann@25919
  1207
wenzelm@63652
  1208
lemma wf_int_ge_less_than2: "wf (int_ge_less_than2 d)"
haftmann@25919
  1209
proof -
wenzelm@63652
  1210
  have "int_ge_less_than2 d \<subseteq> measure (\<lambda>z. nat (1 + z - d))"
haftmann@25919
  1211
    by (auto simp add: int_ge_less_than2_def)
wenzelm@63652
  1212
  then show ?thesis
lp15@60162
  1213
    by (rule wf_subset [OF wf_measure])
haftmann@25919
  1214
qed
haftmann@25919
  1215
haftmann@25919
  1216
(* `set:int': dummy construction *)
haftmann@25919
  1217
theorem int_ge_induct [case_names base step, induct set: int]:
haftmann@25919
  1218
  fixes i :: int
wenzelm@63652
  1219
  assumes ge: "k \<le> i"
wenzelm@63652
  1220
    and base: "P k"
wenzelm@63652
  1221
    and step: "\<And>i. k \<le> i \<Longrightarrow> P i \<Longrightarrow> P (i + 1)"
haftmann@25919
  1222
  shows "P i"
haftmann@25919
  1223
proof -
wenzelm@63652
  1224
  have "\<And>i::int. n = nat (i - k) \<Longrightarrow> k \<le> i \<Longrightarrow> P i" for n
wenzelm@63652
  1225
  proof (induct n)
wenzelm@63652
  1226
    case 0
wenzelm@63652
  1227
    then have "i = k" by arith
wenzelm@63652
  1228
    with base show "P i" by simp
wenzelm@63652
  1229
  next
wenzelm@63652
  1230
    case (Suc n)
wenzelm@63652
  1231
    then have "n = nat ((i - 1) - k)" by arith
wenzelm@63652
  1232
    moreover have k: "k \<le> i - 1" using Suc.prems by arith
wenzelm@63652
  1233
    ultimately have "P (i - 1)" by (rule Suc.hyps)
wenzelm@63652
  1234
    from step [OF k this] show ?case by simp
wenzelm@63652
  1235
  qed
haftmann@25919
  1236
  with ge show ?thesis by fast
haftmann@25919
  1237
qed
haftmann@25919
  1238
haftmann@25928
  1239
(* `set:int': dummy construction *)
haftmann@25928
  1240
theorem int_gr_induct [case_names base step, induct set: int]:
wenzelm@63652
  1241
  fixes i k :: int
wenzelm@63652
  1242
  assumes gr: "k < i"
wenzelm@63652
  1243
    and base: "P (k + 1)"
wenzelm@63652
  1244
    and step: "\<And>i. k < i \<Longrightarrow> P i \<Longrightarrow> P (i + 1)"
haftmann@25919
  1245
  shows "P i"
wenzelm@63652
  1246
  apply (rule int_ge_induct[of "k + 1"])
haftmann@25919
  1247
  using gr apply arith
wenzelm@63652
  1248
   apply (rule base)
wenzelm@63652
  1249
  apply (rule step)
wenzelm@63652
  1250
   apply simp_all
wenzelm@63652
  1251
  done
haftmann@25919
  1252
wenzelm@42676
  1253
theorem int_le_induct [consumes 1, case_names base step]:
wenzelm@63652
  1254
  fixes i k :: int
wenzelm@63652
  1255
  assumes le: "i \<le> k"
wenzelm@63652
  1256
    and base: "P k"
wenzelm@63652
  1257
    and step: "\<And>i. i \<le> k \<Longrightarrow> P i \<Longrightarrow> P (i - 1)"
haftmann@25919
  1258
  shows "P i"
haftmann@25919
  1259
proof -
wenzelm@63652
  1260
  have "\<And>i::int. n = nat(k-i) \<Longrightarrow> i \<le> k \<Longrightarrow> P i" for n
wenzelm@63652
  1261
  proof (induct n)
wenzelm@63652
  1262
    case 0
wenzelm@63652
  1263
    then have "i = k" by arith
wenzelm@63652
  1264
    with base show "P i" by simp
wenzelm@63652
  1265
  next
wenzelm@63652
  1266
    case (Suc n)
wenzelm@63652
  1267
    then have "n = nat (k - (i + 1))" by arith
wenzelm@63652
  1268
    moreover have k: "i + 1 \<le> k" using Suc.prems by arith
wenzelm@63652
  1269
    ultimately have "P (i + 1)" by (rule Suc.hyps)
wenzelm@63652
  1270
    from step[OF k this] show ?case by simp
wenzelm@63652
  1271
  qed
haftmann@25919
  1272
  with le show ?thesis by fast
haftmann@25919
  1273
qed
haftmann@25919
  1274
wenzelm@42676
  1275
theorem int_less_induct [consumes 1, case_names base step]:
wenzelm@63652
  1276
  fixes i k :: int
wenzelm@63652
  1277
  assumes less: "i < k"
wenzelm@63652
  1278
    and base: "P (k - 1)"
wenzelm@63652
  1279
    and step: "\<And>i. i < k \<Longrightarrow> P i \<Longrightarrow> P (i - 1)"
haftmann@25919
  1280
  shows "P i"
wenzelm@63652
  1281
  apply (rule int_le_induct[of _ "k - 1"])
haftmann@25919
  1282
  using less apply arith
wenzelm@63652
  1283
   apply (rule base)
wenzelm@63652
  1284
  apply (rule step)
wenzelm@63652
  1285
   apply simp_all
wenzelm@63652
  1286
  done
haftmann@25919
  1287
haftmann@36811
  1288
theorem int_induct [case_names base step1 step2]:
haftmann@36801
  1289
  fixes k :: int
haftmann@36801
  1290
  assumes base: "P k"
haftmann@36801
  1291
    and step1: "\<And>i. k \<le> i \<Longrightarrow> P i \<Longrightarrow> P (i + 1)"
haftmann@36801
  1292
    and step2: "\<And>i. k \<ge> i \<Longrightarrow> P i \<Longrightarrow> P (i - 1)"
haftmann@36801
  1293
  shows "P i"
haftmann@36801
  1294
proof -
haftmann@36801
  1295
  have "i \<le> k \<or> i \<ge> k" by arith
wenzelm@42676
  1296
  then show ?thesis
wenzelm@42676
  1297
  proof
wenzelm@42676
  1298
    assume "i \<ge> k"
wenzelm@63652
  1299
    then show ?thesis
wenzelm@63652
  1300
      using base by (rule int_ge_induct) (fact step1)
haftmann@36801
  1301
  next
wenzelm@42676
  1302
    assume "i \<le> k"
wenzelm@63652
  1303
    then show ?thesis
wenzelm@63652
  1304
      using base by (rule int_le_induct) (fact step2)
haftmann@36801
  1305
  qed
haftmann@36801
  1306
qed
haftmann@36801
  1307
wenzelm@63652
  1308
wenzelm@63652
  1309
subsection \<open>Intermediate value theorems\<close>
haftmann@25919
  1310
wenzelm@63652
  1311
lemma int_val_lemma: "(\<forall>i<n. \<bar>f (i + 1) - f i\<bar> \<le> 1) \<longrightarrow> f 0 \<le> k \<longrightarrow> k \<le> f n \<longrightarrow> (\<exists>i \<le> n. f i = k)"
wenzelm@63652
  1312
  for n :: nat and k :: int
wenzelm@63652
  1313
  unfolding One_nat_def
wenzelm@63652
  1314
  apply (induct n)
wenzelm@63652
  1315
   apply simp
wenzelm@63652
  1316
  apply (intro strip)
wenzelm@63652
  1317
  apply (erule impE)
wenzelm@63652
  1318
   apply simp
wenzelm@63652
  1319
  apply (erule_tac x = n in allE)
wenzelm@63652
  1320
  apply simp
wenzelm@63652
  1321
  apply (case_tac "k = f (Suc n)")
wenzelm@63652
  1322
   apply force
wenzelm@63652
  1323
  apply (erule impE)
wenzelm@63652
  1324
   apply (simp add: abs_if split: if_split_asm)
wenzelm@63652
  1325
  apply (blast intro: le_SucI)
wenzelm@63652
  1326
  done
haftmann@25919
  1327
haftmann@25919
  1328
lemmas nat0_intermed_int_val = int_val_lemma [rule_format (no_asm)]
haftmann@25919
  1329
haftmann@25919
  1330
lemma nat_intermed_int_val:
wenzelm@63652
  1331
  "\<forall>i. m \<le> i \<and> i < n \<longrightarrow> \<bar>f (i + 1) - f i\<bar> \<le> 1 \<Longrightarrow> m < n \<Longrightarrow>
wenzelm@63652
  1332
    f m \<le> k \<Longrightarrow> k \<le> f n \<Longrightarrow> \<exists>i. m \<le> i \<and> i \<le> n \<and> f i = k"
wenzelm@63652
  1333
    for f :: "nat \<Rightarrow> int" and k :: int
wenzelm@63652
  1334
  apply (cut_tac n = "n-m" and f = "\<lambda>i. f (i + m)" and k = k in int_val_lemma)
wenzelm@63652
  1335
  unfolding One_nat_def
wenzelm@63652
  1336
  apply simp
wenzelm@63652
  1337
  apply (erule exE)
wenzelm@63652
  1338
  apply (rule_tac x = "i+m" in exI)
wenzelm@63652
  1339
  apply arith
wenzelm@63652
  1340
  done
haftmann@25919
  1341
haftmann@25919
  1342
wenzelm@63652
  1343
subsection \<open>Products and 1, by T. M. Rasmussen\<close>
haftmann@25919
  1344
paulson@34055
  1345
lemma abs_zmult_eq_1:
wenzelm@63652
  1346
  fixes m n :: int
paulson@34055
  1347
  assumes mn: "\<bar>m * n\<bar> = 1"
wenzelm@63652
  1348
  shows "\<bar>m\<bar> = 1"
paulson@34055
  1349
proof -
wenzelm@63652
  1350
  from mn have 0: "m \<noteq> 0" "n \<noteq> 0" by auto
wenzelm@63652
  1351
  have "\<not> 2 \<le> \<bar>m\<bar>"
paulson@34055
  1352
  proof
paulson@34055
  1353
    assume "2 \<le> \<bar>m\<bar>"
wenzelm@63652
  1354
    then have "2 * \<bar>n\<bar> \<le> \<bar>m\<bar> * \<bar>n\<bar>" by (simp add: mult_mono 0)
wenzelm@63652
  1355
    also have "\<dots> = \<bar>m * n\<bar>" by (simp add: abs_mult)
wenzelm@63652
  1356
    also from mn have "\<dots> = 1" by simp
wenzelm@63652
  1357
    finally have "2 * \<bar>n\<bar> \<le> 1" .
wenzelm@63652
  1358
    with 0 show "False" by arith
paulson@34055
  1359
  qed
wenzelm@63652
  1360
  with 0 show ?thesis by auto
paulson@34055
  1361
qed
haftmann@25919
  1362
wenzelm@63652
  1363
lemma pos_zmult_eq_1_iff_lemma: "m * n = 1 \<Longrightarrow> m = 1 \<or> m = - 1"
wenzelm@63652
  1364
  for m n :: int
wenzelm@63652
  1365
  using abs_zmult_eq_1 [of m n] by arith
haftmann@25919
  1366
boehmes@35815
  1367
lemma pos_zmult_eq_1_iff:
wenzelm@63652
  1368
  fixes m n :: int
wenzelm@63652
  1369
  assumes "0 < m"
wenzelm@63652
  1370
  shows "m * n = 1 \<longleftrightarrow> m = 1 \<and> n = 1"
boehmes@35815
  1371
proof -
wenzelm@63652
  1372
  from assms have "m * n = 1 \<Longrightarrow> m = 1"
wenzelm@63652
  1373
    by (auto dest: pos_zmult_eq_1_iff_lemma)
wenzelm@63652
  1374
  then show ?thesis
wenzelm@63652
  1375
    by (auto dest: pos_zmult_eq_1_iff_lemma)
boehmes@35815
  1376
qed
haftmann@25919
  1377
wenzelm@63652
  1378
lemma zmult_eq_1_iff: "m * n = 1 \<longleftrightarrow> (m = 1 \<and> n = 1) \<or> (m = - 1 \<and> n = - 1)"
wenzelm@63652
  1379
  for m n :: int
wenzelm@63652
  1380
  apply (rule iffI)
wenzelm@63652
  1381
   apply (frule pos_zmult_eq_1_iff_lemma)
wenzelm@63652
  1382
   apply (simp add: mult.commute [of m])
wenzelm@63652
  1383
   apply (frule pos_zmult_eq_1_iff_lemma)
wenzelm@63652
  1384
   apply auto
wenzelm@63652
  1385
  done
haftmann@25919
  1386
haftmann@33296
  1387
lemma infinite_UNIV_int: "\<not> finite (UNIV::int set)"
haftmann@25919
  1388
proof
haftmann@33296
  1389
  assume "finite (UNIV::int set)"
wenzelm@61076
  1390
  moreover have "inj (\<lambda>i::int. 2 * i)"
haftmann@33296
  1391
    by (rule injI) simp
wenzelm@61076
  1392
  ultimately have "surj (\<lambda>i::int. 2 * i)"
haftmann@33296
  1393
    by (rule finite_UNIV_inj_surj)
haftmann@33296
  1394
  then obtain i :: int where "1 = 2 * i" by (rule surjE)
haftmann@33296
  1395
  then show False by (simp add: pos_zmult_eq_1_iff)
haftmann@25919
  1396
qed
haftmann@25919
  1397
haftmann@25919
  1398
wenzelm@60758
  1399
subsection \<open>Further theorems on numerals\<close>
haftmann@30652
  1400
wenzelm@63652
  1401
subsubsection \<open>Special Simplification for Constants\<close>
haftmann@30652
  1402
wenzelm@63652
  1403
text \<open>These distributive laws move literals inside sums and differences.\<close>
haftmann@30652
  1404
webertj@49962
  1405
lemmas distrib_right_numeral [simp] = distrib_right [of _ _ "numeral v"] for v
webertj@49962
  1406
lemmas distrib_left_numeral [simp] = distrib_left [of "numeral v"] for v
huffman@47108
  1407
lemmas left_diff_distrib_numeral [simp] = left_diff_distrib [of _ _ "numeral v"] for v
huffman@47108
  1408
lemmas right_diff_distrib_numeral [simp] = right_diff_distrib [of "numeral v"] for v
haftmann@30652
  1409
wenzelm@63652
  1410
text \<open>These are actually for fields, like real: but where else to put them?\<close>
haftmann@30652
  1411
huffman@47108
  1412
lemmas zero_less_divide_iff_numeral [simp, no_atp] = zero_less_divide_iff [of "numeral w"] for w
huffman@47108
  1413
lemmas divide_less_0_iff_numeral [simp, no_atp] = divide_less_0_iff [of "numeral w"] for w
huffman@47108
  1414
lemmas zero_le_divide_iff_numeral [simp, no_atp] = zero_le_divide_iff [of "numeral w"] for w
huffman@47108
  1415
lemmas divide_le_0_iff_numeral [simp, no_atp] = divide_le_0_iff [of "numeral w"] for w
haftmann@30652
  1416
haftmann@30652
  1417
wenzelm@61799
  1418
text \<open>Replaces \<open>inverse #nn\<close> by \<open>1/#nn\<close>.  It looks
wenzelm@60758
  1419
  strange, but then other simprocs simplify the quotient.\<close>
haftmann@30652
  1420
huffman@47108
  1421
lemmas inverse_eq_divide_numeral [simp] =
huffman@47108
  1422
  inverse_eq_divide [of "numeral w"] for w
huffman@47108
  1423
huffman@47108
  1424
lemmas inverse_eq_divide_neg_numeral [simp] =
haftmann@54489
  1425
  inverse_eq_divide [of "- numeral w"] for w
haftmann@30652
  1426
wenzelm@60758
  1427
text \<open>These laws simplify inequalities, moving unary minus from a term
wenzelm@63652
  1428
  into the literal.\<close>
haftmann@30652
  1429
haftmann@54489
  1430
lemmas equation_minus_iff_numeral [no_atp] =
haftmann@54489
  1431
  equation_minus_iff [of "numeral v"] for v
huffman@47108
  1432
haftmann@54489
  1433
lemmas minus_equation_iff_numeral [no_atp] =
haftmann@54489
  1434
  minus_equation_iff [of _ "numeral v"] for v
huffman@47108
  1435
haftmann@54489
  1436
lemmas le_minus_iff_numeral [no_atp] =
haftmann@54489
  1437
  le_minus_iff [of "numeral v"] for v
haftmann@30652
  1438
haftmann@54489
  1439
lemmas minus_le_iff_numeral [no_atp] =
haftmann@54489
  1440
  minus_le_iff [of _ "numeral v"] for v
haftmann@30652
  1441
haftmann@54489
  1442
lemmas less_minus_iff_numeral [no_atp] =
haftmann@54489
  1443
  less_minus_iff [of "numeral v"] for v
haftmann@30652
  1444
haftmann@54489
  1445
lemmas minus_less_iff_numeral [no_atp] =
haftmann@54489
  1446
  minus_less_iff [of _ "numeral v"] for v
haftmann@30652
  1447
wenzelm@63652
  1448
(* FIXME maybe simproc *)
haftmann@30652
  1449
haftmann@30652
  1450
wenzelm@61799
  1451
text \<open>Cancellation of constant factors in comparisons (\<open><\<close> and \<open>\<le>\<close>)\<close>
haftmann@30652
  1452
huffman@47108
  1453
lemmas mult_less_cancel_left_numeral [simp, no_atp] = mult_less_cancel_left [of "numeral v"] for v
huffman@47108
  1454
lemmas mult_less_cancel_right_numeral [simp, no_atp] = mult_less_cancel_right [of _ "numeral v"] for v
huffman@47108
  1455
lemmas mult_le_cancel_left_numeral [simp, no_atp] = mult_le_cancel_left [of "numeral v"] for v
huffman@47108
  1456
lemmas mult_le_cancel_right_numeral [simp, no_atp] = mult_le_cancel_right [of _ "numeral v"] for v
haftmann@30652
  1457
haftmann@30652
  1458
wenzelm@61799
  1459
text \<open>Multiplying out constant divisors in comparisons (\<open><\<close>, \<open>\<le>\<close> and \<open>=\<close>)\<close>
haftmann@30652
  1460
lp15@61738
  1461
named_theorems divide_const_simps "simplification rules to simplify comparisons involving constant divisors"
lp15@61738
  1462
lp15@61738
  1463
lemmas le_divide_eq_numeral1 [simp,divide_const_simps] =
huffman@47108
  1464
  pos_le_divide_eq [of "numeral w", OF zero_less_numeral]
haftmann@54489
  1465
  neg_le_divide_eq [of "- numeral w", OF neg_numeral_less_zero] for w
huffman@47108
  1466
lp15@61738
  1467
lemmas divide_le_eq_numeral1 [simp,divide_const_simps] =
huffman@47108
  1468
  pos_divide_le_eq [of "numeral w", OF zero_less_numeral]
haftmann@54489
  1469
  neg_divide_le_eq [of "- numeral w", OF neg_numeral_less_zero] for w
huffman@47108
  1470
lp15@61738
  1471
lemmas less_divide_eq_numeral1 [simp,divide_const_simps] =
huffman@47108
  1472
  pos_less_divide_eq [of "numeral w", OF zero_less_numeral]
haftmann@54489
  1473
  neg_less_divide_eq [of "- numeral w", OF neg_numeral_less_zero] for w
haftmann@30652
  1474
lp15@61738
  1475
lemmas divide_less_eq_numeral1 [simp,divide_const_simps] =
huffman@47108
  1476
  pos_divide_less_eq [of "numeral w", OF zero_less_numeral]
haftmann@54489
  1477
  neg_divide_less_eq [of "- numeral w", OF neg_numeral_less_zero] for w
huffman@47108
  1478
lp15@61738
  1479
lemmas eq_divide_eq_numeral1 [simp,divide_const_simps] =
huffman@47108
  1480
  eq_divide_eq [of _ _ "numeral w"]
haftmann@54489
  1481
  eq_divide_eq [of _ _ "- numeral w"] for w
huffman@47108
  1482
lp15@61738
  1483
lemmas divide_eq_eq_numeral1 [simp,divide_const_simps] =
huffman@47108
  1484
  divide_eq_eq [of _ "numeral w"]
haftmann@54489
  1485
  divide_eq_eq [of _ "- numeral w"] for w
haftmann@54489
  1486
haftmann@30652
  1487
wenzelm@63652
  1488
subsubsection \<open>Optional Simplification Rules Involving Constants\<close>
haftmann@30652
  1489
wenzelm@63652
  1490
text \<open>Simplify quotients that are compared with a literal constant.\<close>
haftmann@30652
  1491
lp15@61738
  1492
lemmas le_divide_eq_numeral [divide_const_simps] =
huffman@47108
  1493
  le_divide_eq [of "numeral w"]
haftmann@54489
  1494
  le_divide_eq [of "- numeral w"] for w
huffman@47108
  1495
lp15@61738
  1496
lemmas divide_le_eq_numeral [divide_const_simps] =
huffman@47108
  1497
  divide_le_eq [of _ _ "numeral w"]
haftmann@54489
  1498
  divide_le_eq [of _ _ "- numeral w"] for w
huffman@47108
  1499
lp15@61738
  1500
lemmas less_divide_eq_numeral [divide_const_simps] =
huffman@47108
  1501
  less_divide_eq [of "numeral w"]
haftmann@54489
  1502
  less_divide_eq [of "- numeral w"] for w
huffman@47108
  1503
lp15@61738
  1504
lemmas divide_less_eq_numeral [divide_const_simps] =
huffman@47108
  1505
  divide_less_eq [of _ _ "numeral w"]
haftmann@54489
  1506
  divide_less_eq [of _ _ "- numeral w"] for w
huffman@47108
  1507
lp15@61738
  1508
lemmas eq_divide_eq_numeral [divide_const_simps] =
huffman@47108
  1509
  eq_divide_eq [of "numeral w"]
haftmann@54489
  1510
  eq_divide_eq [of "- numeral w"] for w
huffman@47108
  1511
lp15@61738
  1512
lemmas divide_eq_eq_numeral [divide_const_simps] =
huffman@47108
  1513
  divide_eq_eq [of _ _ "numeral w"]
haftmann@54489
  1514
  divide_eq_eq [of _ _ "- numeral w"] for w
haftmann@30652
  1515
haftmann@30652
  1516
wenzelm@63652
  1517
text \<open>Not good as automatic simprules because they cause case splits.\<close>
wenzelm@63652
  1518
lemmas [divide_const_simps] =
wenzelm@63652
  1519
  le_divide_eq_1 divide_le_eq_1 less_divide_eq_1 divide_less_eq_1
haftmann@30652
  1520
haftmann@30652
  1521
wenzelm@60758
  1522
subsection \<open>The divides relation\<close>
haftmann@33320
  1523
wenzelm@63652
  1524
lemma zdvd_antisym_nonneg: "0 \<le> m \<Longrightarrow> 0 \<le> n \<Longrightarrow> m dvd n \<Longrightarrow> n dvd m \<Longrightarrow> m = n"
wenzelm@63652
  1525
  for m n :: int
wenzelm@63652
  1526
  by (auto simp add: dvd_def mult.assoc zero_le_mult_iff zmult_eq_1_iff)
haftmann@33320
  1527
wenzelm@63652
  1528
lemma zdvd_antisym_abs:
wenzelm@63652
  1529
  fixes a b :: int
wenzelm@63652
  1530
  assumes "a dvd b" and "b dvd a"
haftmann@33320
  1531
  shows "\<bar>a\<bar> = \<bar>b\<bar>"
wenzelm@63652
  1532
proof (cases "a = 0")
wenzelm@63652
  1533
  case True
wenzelm@63652
  1534
  with assms show ?thesis by simp
nipkow@33657
  1535
next
wenzelm@63652
  1536
  case False
wenzelm@63652
  1537
  from \<open>a dvd b\<close> obtain k where k: "b = a * k"
wenzelm@63652
  1538
    unfolding dvd_def by blast
wenzelm@63652
  1539
  from \<open>b dvd a\<close> obtain k' where k': "a = b * k'"
wenzelm@63652
  1540
    unfolding dvd_def by blast
wenzelm@63652
  1541
  from k k' have "a = a * k * k'" by simp
wenzelm@63652
  1542
  with mult_cancel_left1[where c="a" and b="k*k'"] have kk': "k * k' = 1"
wenzelm@63652
  1543
    using \<open>a \<noteq> 0\<close> by (simp add: mult.assoc)
wenzelm@63652
  1544
  then have "k = 1 \<and> k' = 1 \<or> k = -1 \<and> k' = -1"
wenzelm@63652
  1545
    by (simp add: zmult_eq_1_iff)
wenzelm@63652
  1546
  with k k' show ?thesis by auto
haftmann@33320
  1547
qed
haftmann@33320
  1548
wenzelm@63652
  1549
lemma zdvd_zdiffD: "k dvd m - n \<Longrightarrow> k dvd n \<Longrightarrow> k dvd m"
wenzelm@63652
  1550
  for k m n :: int
lp15@60162
  1551
  using dvd_add_right_iff [of k "- n" m] by simp
haftmann@33320
  1552
wenzelm@63652
  1553
lemma zdvd_reduce: "k dvd n + k * m \<longleftrightarrow> k dvd n"
wenzelm@63652
  1554
  for k m n :: int
haftmann@58649
  1555
  using dvd_add_times_triv_right_iff [of k n m] by (simp add: ac_simps)
haftmann@33320
  1556
haftmann@33320
  1557
lemma dvd_imp_le_int:
haftmann@33320
  1558
  fixes d i :: int
haftmann@33320
  1559
  assumes "i \<noteq> 0" and "d dvd i"
haftmann@33320
  1560
  shows "\<bar>d\<bar> \<le> \<bar>i\<bar>"
haftmann@33320
  1561
proof -
wenzelm@60758
  1562
  from \<open>d dvd i\<close> obtain k where "i = d * k" ..
wenzelm@60758
  1563
  with \<open>i \<noteq> 0\<close> have "k \<noteq> 0" by auto
haftmann@33320
  1564
  then have "1 \<le> \<bar>k\<bar>" and "0 \<le> \<bar>d\<bar>" by auto
haftmann@33320
  1565
  then have "\<bar>d\<bar> * 1 \<le> \<bar>d\<bar> * \<bar>k\<bar>" by (rule mult_left_mono)
wenzelm@60758
  1566
  with \<open>i = d * k\<close> show ?thesis by (simp add: abs_mult)
haftmann@33320
  1567
qed
haftmann@33320
  1568
haftmann@33320
  1569
lemma zdvd_not_zless:
haftmann@33320
  1570
  fixes m n :: int
haftmann@33320
  1571
  assumes "0 < m" and "m < n"
haftmann@33320
  1572
  shows "\<not> n dvd m"
haftmann@33320
  1573
proof
haftmann@33320
  1574
  from assms have "0 < n" by auto
haftmann@33320
  1575
  assume "n dvd m" then obtain k where k: "m = n * k" ..
wenzelm@60758
  1576
  with \<open>0 < m\<close> have "0 < n * k" by auto
wenzelm@60758
  1577
  with \<open>0 < n\<close> have "0 < k" by (simp add: zero_less_mult_iff)
wenzelm@60758
  1578
  with k \<open>0 < n\<close> \<open>m < n\<close> have "n * k < n * 1" by simp
wenzelm@60758
  1579
  with \<open>0 < n\<close> \<open>0 < k\<close> show False unfolding mult_less_cancel_left by auto
haftmann@33320
  1580
qed
haftmann@33320
  1581
wenzelm@63652
  1582
lemma zdvd_mult_cancel:
wenzelm@63652
  1583
  fixes k m n :: int
wenzelm@63652
  1584
  assumes d: "k * m dvd k * n"
wenzelm@63652
  1585
    and "k \<noteq> 0"
haftmann@33320
  1586
  shows "m dvd n"
wenzelm@63652
  1587
proof -
wenzelm@63652
  1588
  from d obtain h where h: "k * n = k * m * h"
wenzelm@63652
  1589
    unfolding dvd_def by blast
wenzelm@63652
  1590
  have "n = m * h"
wenzelm@63652
  1591
  proof (rule ccontr)
wenzelm@63652
  1592
    assume "\<not> ?thesis"
wenzelm@63652
  1593
    with \<open>k \<noteq> 0\<close> have "k * n \<noteq> k * (m * h)" by simp
wenzelm@63652
  1594
    with h show False
wenzelm@63652
  1595
      by (simp add: mult.assoc)
wenzelm@63652
  1596
  qed
wenzelm@63652
  1597
  then show ?thesis by simp
haftmann@33320
  1598
qed
haftmann@33320
  1599
wenzelm@63652
  1600
theorem zdvd_int: "x dvd y \<longleftrightarrow> int x dvd int y"
haftmann@33320
  1601
proof -
wenzelm@63652
  1602
  have "x dvd y" if "int y = int x * k" for k
wenzelm@63652
  1603
  proof (cases k)
wenzelm@63652
  1604
    case (nonneg n)
wenzelm@63652
  1605
    with that have "y = x * n"
wenzelm@63652
  1606
      by (simp del: of_nat_mult add: of_nat_mult [symmetric])
wenzelm@63652
  1607
    then show ?thesis ..
wenzelm@63652
  1608
  next
wenzelm@63652
  1609
    case (neg n)
wenzelm@63652
  1610
    with that have "int y = int x * (- int (Suc n))"
wenzelm@63652
  1611
      by simp
wenzelm@63652
  1612
    also have "\<dots> = - (int x * int (Suc n))"
wenzelm@63652
  1613
      by (simp only: mult_minus_right)
wenzelm@63652
  1614
    also have "\<dots> = - int (x * Suc n)"
wenzelm@63652
  1615
      by (simp only: of_nat_mult [symmetric])
wenzelm@63652
  1616
    finally have "- int (x * Suc n) = int y" ..
wenzelm@63652
  1617
    then show ?thesis
wenzelm@63652
  1618
      by (simp only: negative_eq_positive) auto
haftmann@33320
  1619
  qed
wenzelm@63652
  1620
  then show ?thesis
wenzelm@63652
  1621
    by (auto elim!: dvdE simp only: dvd_triv_left of_nat_mult)
haftmann@33320
  1622
qed
haftmann@33320
  1623
wenzelm@63652
  1624
lemma zdvd1_eq[simp]: "x dvd 1 \<longleftrightarrow> \<bar>x\<bar> = 1"
wenzelm@63652
  1625
  (is "?lhs \<longleftrightarrow> ?rhs")
wenzelm@63652
  1626
  for x :: int
haftmann@33320
  1627
proof
wenzelm@63652
  1628
  assume ?lhs
wenzelm@63652
  1629
  then have "int (nat \<bar>x\<bar>) dvd int (nat 1)" by simp
wenzelm@63652
  1630
  then have "nat \<bar>x\<bar> dvd 1" by (simp add: zdvd_int)
wenzelm@63652
  1631
  then have "nat \<bar>x\<bar> = 1" by simp
wenzelm@63652
  1632
  then show ?rhs by (cases "x < 0") auto
haftmann@33320
  1633
next
wenzelm@63652
  1634
  assume ?rhs
wenzelm@63652
  1635
  then have "x = 1 \<or> x = - 1" by auto
wenzelm@63652
  1636
  then show ?lhs by (auto intro: dvdI)
haftmann@33320
  1637
qed
haftmann@33320
  1638
lp15@60162
  1639
lemma zdvd_mult_cancel1:
wenzelm@63652
  1640
  fixes m :: int
wenzelm@63652
  1641
  assumes mp: "m \<noteq> 0"
wenzelm@63652
  1642
  shows "m * n dvd m \<longleftrightarrow> \<bar>n\<bar> = 1"
wenzelm@63652
  1643
    (is "?lhs \<longleftrightarrow> ?rhs")
haftmann@33320
  1644
proof
wenzelm@63652
  1645
  assume ?rhs
wenzelm@63652
  1646
  then show ?lhs
wenzelm@63652
  1647
    by (cases "n > 0") (auto simp add: minus_equation_iff)
haftmann@33320
  1648
next
wenzelm@63652
  1649
  assume ?lhs
wenzelm@63652
  1650
  then have "m * n dvd m * 1" by simp
wenzelm@63652
  1651
  from zdvd_mult_cancel[OF this mp] show ?rhs
wenzelm@63652
  1652
    by (simp only: zdvd1_eq)
haftmann@33320
  1653
qed
haftmann@33320
  1654
wenzelm@63652
  1655
lemma int_dvd_iff: "int m dvd z \<longleftrightarrow> m dvd nat \<bar>z\<bar>"
wenzelm@63652
  1656
  by (cases "z \<ge> 0") (simp_all add: zdvd_int)
haftmann@33320
  1657
wenzelm@63652
  1658
lemma dvd_int_iff: "z dvd int m \<longleftrightarrow> nat \<bar>z\<bar> dvd m"
wenzelm@63652
  1659
  by (cases "z \<ge> 0") (simp_all add: zdvd_int)
haftmann@58650
  1660
wenzelm@63652
  1661
lemma dvd_int_unfold_dvd_nat: "k dvd l \<longleftrightarrow> nat \<bar>k\<bar> dvd nat \<bar>l\<bar>"
wenzelm@63652
  1662
  by (simp add: dvd_int_iff [symmetric])
wenzelm@63652
  1663
wenzelm@63652
  1664
lemma nat_dvd_iff: "nat z dvd m \<longleftrightarrow> (if 0 \<le> z then z dvd int m else m = 0)"
haftmann@33320
  1665
  by (auto simp add: dvd_int_iff)
haftmann@33320
  1666
wenzelm@63652
  1667
lemma eq_nat_nat_iff: "0 \<le> z \<Longrightarrow> 0 \<le> z' \<Longrightarrow> nat z = nat z' \<longleftrightarrow> z = z'"
haftmann@33341
  1668
  by (auto elim!: nonneg_eq_int)
haftmann@33341
  1669
wenzelm@63652
  1670
lemma nat_power_eq: "0 \<le> z \<Longrightarrow> nat (z ^ n) = nat z ^ n"
haftmann@33341
  1671
  by (induct n) (simp_all add: nat_mult_distrib)
haftmann@33341
  1672
wenzelm@63652
  1673
lemma zdvd_imp_le: "z dvd n \<Longrightarrow> 0 < n \<Longrightarrow> z \<le> n"
wenzelm@63652
  1674
  for n z :: int
wenzelm@42676
  1675
  apply (cases n)
wenzelm@63652
  1676
   apply (auto simp add: dvd_int_iff)
wenzelm@42676
  1677
  apply (cases z)
wenzelm@63652
  1678
   apply (auto simp add: dvd_imp_le)
haftmann@33320
  1679
  done
haftmann@33320
  1680
haftmann@36749
  1681
lemma zdvd_period:
haftmann@36749
  1682
  fixes a d :: int
haftmann@36749
  1683
  assumes "a dvd d"
haftmann@36749
  1684
  shows "a dvd (x + t) \<longleftrightarrow> a dvd ((x + c * d) + t)"
wenzelm@63652
  1685
    (is "?lhs \<longleftrightarrow> ?rhs")
haftmann@36749
  1686
proof -
haftmann@66816
  1687
  from assms have "a dvd (x + t) \<longleftrightarrow> a dvd ((x + t) + c * d)"
haftmann@66816
  1688
    by (simp add: dvd_add_left_iff)
haftmann@66816
  1689
  then show ?thesis
haftmann@66816
  1690
    by (simp add: ac_simps)
haftmann@36749
  1691
qed
haftmann@36749
  1692
haftmann@33320
  1693
wenzelm@60758
  1694
subsection \<open>Finiteness of intervals\<close>
bulwahn@46756
  1695
wenzelm@63652
  1696
lemma finite_interval_int1 [iff]: "finite {i :: int. a \<le> i \<and> i \<le> b}"
wenzelm@63652
  1697
proof (cases "a \<le> b")
bulwahn@46756
  1698
  case True
wenzelm@63652
  1699
  then show ?thesis
bulwahn@46756
  1700
  proof (induct b rule: int_ge_induct)
bulwahn@46756
  1701
    case base
wenzelm@63652
  1702
    have "{i. a \<le> i \<and> i \<le> a} = {a}" by auto
wenzelm@63652
  1703
    then show ?case by simp
bulwahn@46756
  1704
  next
bulwahn@46756
  1705
    case (step b)
wenzelm@63652
  1706
    then have "{i. a \<le> i \<and> i \<le> b + 1} = {i. a \<le> i \<and> i \<le> b} \<union> {b + 1}" by auto
wenzelm@63652
  1707
    with step show ?case by simp
bulwahn@46756
  1708
  qed
bulwahn@46756
  1709
next
wenzelm@63652
  1710
  case False
wenzelm@63652
  1711
  then show ?thesis
bulwahn@46756
  1712
    by (metis (lifting, no_types) Collect_empty_eq finite.emptyI order_trans)
bulwahn@46756
  1713
qed
bulwahn@46756
  1714
wenzelm@63652
  1715
lemma finite_interval_int2 [iff]: "finite {i :: int. a \<le> i \<and> i < b}"
wenzelm@63652
  1716
  by (rule rev_finite_subset[OF finite_interval_int1[of "a" "b"]]) auto
bulwahn@46756
  1717
wenzelm@63652
  1718
lemma finite_interval_int3 [iff]: "finite {i :: int. a < i \<and> i \<le> b}"
wenzelm@63652
  1719
  by (rule rev_finite_subset[OF finite_interval_int1[of "a" "b"]]) auto
bulwahn@46756
  1720
wenzelm@63652
  1721
lemma finite_interval_int4 [iff]: "finite {i :: int. a < i \<and> i < b}"
wenzelm@63652
  1722
  by (rule rev_finite_subset[OF finite_interval_int1[of "a" "b"]]) auto
bulwahn@46756
  1723
bulwahn@46756
  1724
wenzelm@60758
  1725
subsection \<open>Configuration of the code generator\<close>
haftmann@25919
  1726
wenzelm@60758
  1727
text \<open>Constructors\<close>
huffman@47108
  1728
wenzelm@63652
  1729
definition Pos :: "num \<Rightarrow> int"
wenzelm@63652
  1730
  where [simp, code_abbrev]: "Pos = numeral"
huffman@47108
  1731
wenzelm@63652
  1732
definition Neg :: "num \<Rightarrow> int"
wenzelm@63652
  1733
  where [simp, code_abbrev]: "Neg n = - (Pos n)"
huffman@47108
  1734
huffman@47108
  1735
code_datatype "0::int" Pos Neg
huffman@47108
  1736
huffman@47108
  1737
wenzelm@63652
  1738
text \<open>Auxiliary operations.\<close>
huffman@47108
  1739
wenzelm@63652
  1740
definition dup :: "int \<Rightarrow> int"
wenzelm@63652
  1741
  where [simp]: "dup k = k + k"
haftmann@26507
  1742
huffman@47108
  1743
lemma dup_code [code]:
huffman@47108
  1744
  "dup 0 = 0"
huffman@47108
  1745
  "dup (Pos n) = Pos (Num.Bit0 n)"
huffman@47108
  1746
  "dup (Neg n) = Neg (Num.Bit0 n)"
huffman@47108
  1747
  by (simp_all add: numeral_Bit0)
huffman@47108
  1748
wenzelm@63652
  1749
definition sub :: "num \<Rightarrow> num \<Rightarrow> int"
wenzelm@63652
  1750
  where [simp]: "sub m n = numeral m - numeral n"
haftmann@26507
  1751
huffman@47108
  1752
lemma sub_code [code]:
huffman@47108
  1753
  "sub Num.One Num.One = 0"
huffman@47108
  1754
  "sub (Num.Bit0 m) Num.One = Pos (Num.BitM m)"
huffman@47108
  1755
  "sub (Num.Bit1 m) Num.One = Pos (Num.Bit0 m)"
huffman@47108
  1756
  "sub Num.One (Num.Bit0 n) = Neg (Num.BitM n)"
huffman@47108
  1757
  "sub Num.One (Num.Bit1 n) = Neg (Num.Bit0 n)"
huffman@47108
  1758
  "sub (Num.Bit0 m) (Num.Bit0 n) = dup (sub m n)"
huffman@47108
  1759
  "sub (Num.Bit1 m) (Num.Bit1 n) = dup (sub m n)"
huffman@47108
  1760
  "sub (Num.Bit1 m) (Num.Bit0 n) = dup (sub m n) + 1"
huffman@47108
  1761
  "sub (Num.Bit0 m) (Num.Bit1 n) = dup (sub m n) - 1"
boehmes@66035
  1762
  by (simp_all only: sub_def dup_def numeral.simps Pos_def Neg_def numeral_BitM)
huffman@47108
  1763
wenzelm@63652
  1764
text \<open>Implementations.\<close>
huffman@47108
  1765
haftmann@64996
  1766
lemma one_int_code [code]: "1 = Pos Num.One"
huffman@47108
  1767
  by simp
huffman@47108
  1768
huffman@47108
  1769
lemma plus_int_code [code]:
wenzelm@63652
  1770
  "k + 0 = k"
wenzelm@63652
  1771
  "0 + l = l"
huffman@47108
  1772
  "Pos m + Pos n = Pos (m + n)"
huffman@47108
  1773
  "Pos m + Neg n = sub m n"
huffman@47108
  1774
  "Neg m + Pos n = sub n m"
huffman@47108
  1775
  "Neg m + Neg n = Neg (m + n)"
wenzelm@63652
  1776
  for k l :: int
huffman@47108
  1777
  by simp_all
haftmann@26507
  1778
huffman@47108
  1779
lemma uminus_int_code [code]:
huffman@47108
  1780
  "uminus 0 = (0::int)"
huffman@47108
  1781
  "uminus (Pos m) = Neg m"
huffman@47108
  1782
  "uminus (Neg m) = Pos m"
huffman@47108
  1783
  by simp_all
huffman@47108
  1784
huffman@47108
  1785
lemma minus_int_code [code]:
wenzelm@63652
  1786
  "k - 0 = k"
wenzelm@63652
  1787
  "0 - l = uminus l"
huffman@47108
  1788
  "Pos m - Pos n = sub m n"
huffman@47108
  1789
  "Pos m - Neg n = Pos (m + n)"
huffman@47108
  1790
  "Neg m - Pos n = Neg (m + n)"
huffman@47108
  1791
  "Neg m - Neg n = sub n m"
wenzelm@63652
  1792
  for k l :: int
huffman@47108
  1793
  by simp_all
huffman@47108
  1794
huffman@47108
  1795
lemma times_int_code [code]:
wenzelm@63652
  1796
  "k * 0 = 0"
wenzelm@63652
  1797
  "0 * l = 0"
huffman@47108
  1798
  "Pos m * Pos n = Pos (m * n)"
huffman@47108
  1799
  "Pos m * Neg n = Neg (m * n)"
huffman@47108
  1800
  "Neg m * Pos n = Neg (m * n)"
huffman@47108
  1801
  "Neg m * Neg n = Pos (m * n)"
wenzelm@63652
  1802
  for k l :: int
huffman@47108
  1803
  by simp_all
haftmann@26507
  1804
haftmann@38857
  1805
instantiation int :: equal
haftmann@26507
  1806
begin
haftmann@26507
  1807
wenzelm@63652
  1808
definition "HOL.equal k l \<longleftrightarrow> k = (l::int)"
haftmann@38857
  1809
wenzelm@61169
  1810
instance
wenzelm@61169
  1811
  by standard (rule equal_int_def)
haftmann@26507
  1812
haftmann@26507
  1813
end
haftmann@26507
  1814
huffman@47108
  1815
lemma equal_int_code [code]:
huffman@47108
  1816
  "HOL.equal 0 (0::int) \<longleftrightarrow> True"
huffman@47108
  1817
  "HOL.equal 0 (Pos l) \<longleftrightarrow> False"
huffman@47108
  1818
  "HOL.equal 0 (Neg l) \<longleftrightarrow> False"
huffman@47108
  1819
  "HOL.equal (Pos k) 0 \<longleftrightarrow> False"
huffman@47108
  1820
  "HOL.equal (Pos k) (Pos l) \<longleftrightarrow> HOL.equal k l"
huffman@47108
  1821
  "HOL.equal (Pos k) (Neg l) \<longleftrightarrow> False"
huffman@47108
  1822
  "HOL.equal (Neg k) 0 \<longleftrightarrow> False"
huffman@47108
  1823
  "HOL.equal (Neg k) (Pos l) \<longleftrightarrow> False"
huffman@47108
  1824
  "HOL.equal (Neg k) (Neg l) \<longleftrightarrow> HOL.equal k l"
huffman@47108
  1825
  by (auto simp add: equal)
haftmann@26507
  1826
wenzelm@63652
  1827
lemma equal_int_refl [code nbe]: "HOL.equal k k \<longleftrightarrow> True"
wenzelm@63652
  1828
  for k :: int
huffman@47108
  1829
  by (fact equal_refl)
haftmann@26507
  1830
haftmann@28562
  1831
lemma less_eq_int_code [code]:
huffman@47108
  1832
  "0 \<le> (0::int) \<longleftrightarrow> True"
huffman@47108
  1833
  "0 \<le> Pos l \<longleftrightarrow> True"
huffman@47108
  1834
  "0 \<le> Neg l \<longleftrightarrow> False"
huffman@47108
  1835
  "Pos k \<le> 0 \<longleftrightarrow> False"
huffman@47108
  1836
  "Pos k \<le> Pos l \<longleftrightarrow> k \<le> l"
huffman@47108
  1837
  "Pos k \<le> Neg l \<longleftrightarrow> False"
huffman@47108
  1838
  "Neg k \<le> 0 \<longleftrightarrow> True"
huffman@47108
  1839
  "Neg k \<le> Pos l \<longleftrightarrow> True"
huffman@47108
  1840
  "Neg k \<le> Neg l \<longleftrightarrow> l \<le> k"
huffman@28958
  1841
  by simp_all
haftmann@26507
  1842
haftmann@28562
  1843
lemma less_int_code [code]:
huffman@47108
  1844
  "0 < (0::int) \<longleftrightarrow> False"
huffman@47108
  1845
  "0 < Pos l \<longleftrightarrow> True"
huffman@47108
  1846
  "0 < Neg l \<longleftrightarrow> False"
huffman@47108
  1847
  "Pos k < 0 \<longleftrightarrow> False"
huffman@47108
  1848
  "Pos k < Pos l \<longleftrightarrow> k < l"
huffman@47108
  1849
  "Pos k < Neg l \<longleftrightarrow> False"
huffman@47108
  1850
  "Neg k < 0 \<longleftrightarrow> True"
huffman@47108
  1851
  "Neg k < Pos l \<longleftrightarrow> True"
huffman@47108
  1852
  "Neg k < Neg l \<longleftrightarrow> l < k"
huffman@28958
  1853
  by simp_all
haftmann@25919
  1854
huffman@47108
  1855
lemma nat_code [code]:
huffman@47108
  1856
  "nat (Int.Neg k) = 0"
huffman@47108
  1857
  "nat 0 = 0"
huffman@47108
  1858
  "nat (Int.Pos k) = nat_of_num k"
haftmann@54489
  1859
  by (simp_all add: nat_of_num_numeral)
haftmann@25928
  1860
huffman@47108
  1861
lemma (in ring_1) of_int_code [code]:
haftmann@54489
  1862
  "of_int (Int.Neg k) = - numeral k"
huffman@47108
  1863
  "of_int 0 = 0"
huffman@47108
  1864
  "of_int (Int.Pos k) = numeral k"
huffman@47108
  1865
  by simp_all
haftmann@25919
  1866
huffman@47108
  1867
wenzelm@63652
  1868
text \<open>Serializer setup.\<close>
haftmann@25919
  1869
haftmann@52435
  1870
code_identifier
haftmann@52435
  1871
  code_module Int \<rightharpoonup> (SML) Arith and (OCaml) Arith and (Haskell) Arith
haftmann@25919
  1872
haftmann@25919
  1873
quickcheck_params [default_type = int]
haftmann@25919
  1874
huffman@47108
  1875
hide_const (open) Pos Neg sub dup
haftmann@25919
  1876
haftmann@25919
  1877
wenzelm@61799
  1878
text \<open>De-register \<open>int\<close> as a quotient type:\<close>
huffman@48045
  1879
kuncar@53652
  1880
lifting_update int.lifting
kuncar@53652
  1881
lifting_forget int.lifting
huffman@48045
  1882
haftmann@25919
  1883
end