src/HOL/Int.thy
author haftmann
Thu, 02 Oct 2014 11:33:06 +0200
changeset 58512 dc4d76dfa8f0
parent 57514 bdc2c6b40bf2
child 58649 a62065b5e1e2
permissions -rw-r--r--
moved lemmas out of Int.thy which have nothing to do with int
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
41959
b460124855b8 tuned headers;
wenzelm
parents: 40819
diff changeset
     1
(*  Title:      HOL/Int.thy
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
     2
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
41959
b460124855b8 tuned headers;
wenzelm
parents: 40819
diff changeset
     3
    Author:     Tobias Nipkow, Florian Haftmann, TU Muenchen
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
     4
*)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
     5
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
     6
header {* The Integers as Equivalence Classes over Pairs of Natural Numbers *} 
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
     7
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
     8
theory Int
55404
5cb95b79a51f transformed 'option' and 'list' into new-style datatypes (but register them as old-style as well)
blanchet
parents: 55096
diff changeset
     9
imports Equiv_Relations Power Quotient Fun_Def
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
    10
begin
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
    11
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    12
subsection {* Definition of integers as a quotient type *}
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
    13
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    14
definition intrel :: "(nat \<times> nat) \<Rightarrow> (nat \<times> nat) \<Rightarrow> bool" where
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    15
  "intrel = (\<lambda>(x, y) (u, v). x + v = u + y)"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    16
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    17
lemma intrel_iff [simp]: "intrel (x, y) (u, v) \<longleftrightarrow> x + v = u + y"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    18
  by (simp add: intrel_def)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
    19
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    20
quotient_type int = "nat \<times> nat" / "intrel"
45694
4a8743618257 prefer typedef without extra definition and alternative name;
wenzelm
parents: 45607
diff changeset
    21
  morphisms Rep_Integ Abs_Integ
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    22
proof (rule equivpI)
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    23
  show "reflp intrel"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    24
    unfolding reflp_def by auto
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    25
  show "symp intrel"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    26
    unfolding symp_def by auto
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    27
  show "transp intrel"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    28
    unfolding transp_def by auto
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    29
qed
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
    30
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    31
lemma eq_Abs_Integ [case_names Abs_Integ, cases type: int]:
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    32
     "(!!x y. z = Abs_Integ (x, y) ==> P) ==> P"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    33
by (induct z) auto
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    34
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    35
subsection {* Integers form a commutative ring *}
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    36
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    37
instantiation int :: comm_ring_1
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
    38
begin
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
    39
51994
82cc2aeb7d13 stronger reflexivity prover
kuncar
parents: 51329
diff changeset
    40
lift_definition zero_int :: "int" is "(0, 0)" .
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
    41
51994
82cc2aeb7d13 stronger reflexivity prover
kuncar
parents: 51329
diff changeset
    42
lift_definition one_int :: "int" is "(1, 0)" .
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
    43
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    44
lift_definition plus_int :: "int \<Rightarrow> int \<Rightarrow> int"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    45
  is "\<lambda>(x, y) (u, v). (x + u, y + v)"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    46
  by clarsimp
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
    47
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    48
lift_definition uminus_int :: "int \<Rightarrow> int"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    49
  is "\<lambda>(x, y). (y, x)"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    50
  by clarsimp
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
    51
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    52
lift_definition minus_int :: "int \<Rightarrow> int \<Rightarrow> int"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    53
  is "\<lambda>(x, y) (u, v). (x + v, y + u)"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    54
  by clarsimp
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
    55
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    56
lift_definition times_int :: "int \<Rightarrow> int \<Rightarrow> int"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    57
  is "\<lambda>(x, y) (u, v). (x*u + y*v, x*v + y*u)"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    58
proof (clarsimp)
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    59
  fix s t u v w x y z :: nat
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    60
  assume "s + v = u + t" and "w + z = y + x"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    61
  hence "(s + v) * w + (u + t) * x + u * (w + z) + v * (y + x)
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    62
       = (u + t) * w + (s + v) * x + u * (y + x) + v * (w + z)"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    63
    by simp
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    64
  thus "(s * w + t * x) + (u * z + v * y) = (u * y + v * z) + (s * x + t * w)"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    65
    by (simp add: algebra_simps)
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    66
qed
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
    67
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    68
instance
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    69
  by default (transfer, clarsimp simp: algebra_simps)+
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
    70
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
    71
end
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
    72
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
    73
abbreviation int :: "nat \<Rightarrow> int" where
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
    74
  "int \<equiv> of_nat"
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
    75
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    76
lemma int_def: "int n = Abs_Integ (n, 0)"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    77
  by (induct n, simp add: zero_int.abs_eq,
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    78
    simp add: one_int.abs_eq plus_int.abs_eq)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
    79
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    80
lemma int_transfer [transfer_rule]:
56525
b5b6ad5dc2ae simplify and fix theories thanks to 356a5efdb278
kuncar
parents: 55945
diff changeset
    81
  "(rel_fun (op =) pcr_int) (\<lambda>n. (n, 0)) int"
b5b6ad5dc2ae simplify and fix theories thanks to 356a5efdb278
kuncar
parents: 55945
diff changeset
    82
  unfolding rel_fun_def int.pcr_cr_eq cr_int_def int_def by simp
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
    83
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    84
lemma int_diff_cases:
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    85
  obtains (diff) m n where "z = int m - int n"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    86
  by transfer clarsimp
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    87
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    88
subsection {* Integers are totally ordered *}
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
    89
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    90
instantiation int :: linorder
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    91
begin
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    92
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    93
lift_definition less_eq_int :: "int \<Rightarrow> int \<Rightarrow> bool"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    94
  is "\<lambda>(x, y) (u, v). x + v \<le> u + y"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    95
  by auto
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    96
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    97
lift_definition less_int :: "int \<Rightarrow> int \<Rightarrow> bool"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    98
  is "\<lambda>(x, y) (u, v). x + v < u + y"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
    99
  by auto
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   100
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   101
instance
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   102
  by default (transfer, force)+
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   103
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   104
end
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   105
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   106
instantiation int :: distrib_lattice
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   107
begin
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   108
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   109
definition
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   110
  "(inf \<Colon> int \<Rightarrow> int \<Rightarrow> int) = min"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   111
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   112
definition
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   113
  "(sup \<Colon> int \<Rightarrow> int \<Rightarrow> int) = max"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   114
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   115
instance
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   116
  by intro_classes
54863
82acc20ded73 prefer more canonical names for lemmas on min/max
haftmann
parents: 54489
diff changeset
   117
    (auto simp add: inf_int_def sup_int_def max_min_distrib2)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   118
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   119
end
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   120
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   121
subsection {* Ordering properties of arithmetic operations *}
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   122
35028
108662d50512 more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents: 34055
diff changeset
   123
instance int :: ordered_cancel_ab_semigroup_add
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   124
proof
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   125
  fix i j k :: int
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   126
  show "i \<le> j \<Longrightarrow> k + i \<le> k + j"
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   127
    by transfer clarsimp
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   128
qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   129
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   130
text{*Strict Monotonicity of Multiplication*}
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   131
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   132
text{*strict, in 1st argument; proof is by induction on k>0*}
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   133
lemma zmult_zless_mono2_lemma:
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   134
     "(i::int)<j ==> 0<k ==> int k * i < int k * j"
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   135
apply (induct k)
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   136
apply simp
49962
a8cc904a6820 Renamed {left,right}_distrib to distrib_{right,left}.
webertj
parents: 48891
diff changeset
   137
apply (simp add: distrib_right)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   138
apply (case_tac "k=0")
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   139
apply (simp_all add: add_strict_mono)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   140
done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   141
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   142
lemma zero_le_imp_eq_int: "(0::int) \<le> k ==> \<exists>n. k = int n"
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   143
apply transfer
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   144
apply clarsimp
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   145
apply (rule_tac x="a - b" in exI, simp)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   146
done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   147
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   148
lemma zero_less_imp_eq_int: "(0::int) < k ==> \<exists>n>0. k = int n"
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   149
apply transfer
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   150
apply clarsimp
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   151
apply (rule_tac x="a - b" in exI, simp)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   152
done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   153
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   154
lemma zmult_zless_mono2: "[| i<j;  (0::int) < k |] ==> k*i < k*j"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   155
apply (drule zero_less_imp_eq_int)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   156
apply (auto simp add: zmult_zless_mono2_lemma)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   157
done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   158
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   159
text{*The integers form an ordered integral domain*}
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   160
instantiation int :: linordered_idom
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   161
begin
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   162
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   163
definition
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   164
  zabs_def: "\<bar>i\<Colon>int\<bar> = (if i < 0 then - i else i)"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   165
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   166
definition
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   167
  zsgn_def: "sgn (i\<Colon>int) = (if i=0 then 0 else if 0<i then 1 else - 1)"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   168
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   169
instance proof
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   170
  fix i j k :: int
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   171
  show "i < j \<Longrightarrow> 0 < k \<Longrightarrow> k * i < k * j"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   172
    by (rule zmult_zless_mono2)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   173
  show "\<bar>i\<bar> = (if i < 0 then -i else i)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   174
    by (simp only: zabs_def)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   175
  show "sgn (i\<Colon>int) = (if i=0 then 0 else if 0<i then 1 else - 1)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   176
    by (simp only: zsgn_def)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   177
qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   178
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   179
end
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   180
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   181
lemma zless_imp_add1_zle: "w < z \<Longrightarrow> w + (1\<Colon>int) \<le> z"
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   182
  by transfer clarsimp
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   183
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   184
lemma zless_iff_Suc_zadd:
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   185
  "(w \<Colon> int) < z \<longleftrightarrow> (\<exists>n. z = w + int (Suc n))"
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   186
apply transfer
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   187
apply auto
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   188
apply (rename_tac a b c d)
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   189
apply (rule_tac x="c+b - Suc(a+d)" in exI)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   190
apply arith
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   191
done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   192
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   193
lemmas int_distrib =
49962
a8cc904a6820 Renamed {left,right}_distrib to distrib_{right,left}.
webertj
parents: 48891
diff changeset
   194
  distrib_right [of z1 z2 w]
a8cc904a6820 Renamed {left,right}_distrib to distrib_{right,left}.
webertj
parents: 48891
diff changeset
   195
  distrib_left [of w z1 z2]
45607
16b4f5774621 eliminated obsolete "standard";
wenzelm
parents: 45533
diff changeset
   196
  left_diff_distrib [of z1 z2 w]
16b4f5774621 eliminated obsolete "standard";
wenzelm
parents: 45533
diff changeset
   197
  right_diff_distrib [of w z1 z2]
16b4f5774621 eliminated obsolete "standard";
wenzelm
parents: 45533
diff changeset
   198
  for z1 z2 w :: int
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   199
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   200
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   201
subsection {* Embedding of the Integers into any @{text ring_1}: @{text of_int}*}
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   202
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   203
context ring_1
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   204
begin
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   205
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   206
lift_definition of_int :: "int \<Rightarrow> 'a" is "\<lambda>(i, j). of_nat i - of_nat j"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   207
  by (clarsimp simp add: diff_eq_eq eq_diff_eq diff_add_eq
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   208
    of_nat_add [symmetric] simp del: of_nat_add)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   209
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   210
lemma of_int_0 [simp]: "of_int 0 = 0"
48066
c6783c9b87bf transfer method now handles transfer rules for compound terms, e.g. locale-defined constants with hidden parameters
huffman
parents: 48045
diff changeset
   211
  by transfer simp
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   212
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   213
lemma of_int_1 [simp]: "of_int 1 = 1"
48066
c6783c9b87bf transfer method now handles transfer rules for compound terms, e.g. locale-defined constants with hidden parameters
huffman
parents: 48045
diff changeset
   214
  by transfer simp
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   215
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   216
lemma of_int_add [simp]: "of_int (w+z) = of_int w + of_int z"
48066
c6783c9b87bf transfer method now handles transfer rules for compound terms, e.g. locale-defined constants with hidden parameters
huffman
parents: 48045
diff changeset
   217
  by transfer (clarsimp simp add: algebra_simps)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   218
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   219
lemma of_int_minus [simp]: "of_int (-z) = - (of_int z)"
48066
c6783c9b87bf transfer method now handles transfer rules for compound terms, e.g. locale-defined constants with hidden parameters
huffman
parents: 48045
diff changeset
   220
  by (transfer fixing: uminus) clarsimp
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   221
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   222
lemma of_int_diff [simp]: "of_int (w - z) = of_int w - of_int z"
54230
b1d955791529 more simplification rules on unary and binary minus
haftmann
parents: 54223
diff changeset
   223
  using of_int_add [of w "- z"] by simp
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   224
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   225
lemma of_int_mult [simp]: "of_int (w*z) = of_int w * of_int z"
48066
c6783c9b87bf transfer method now handles transfer rules for compound terms, e.g. locale-defined constants with hidden parameters
huffman
parents: 48045
diff changeset
   226
  by (transfer fixing: times) (clarsimp simp add: algebra_simps of_nat_mult)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   227
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   228
text{*Collapse nested embeddings*}
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   229
lemma of_int_of_nat_eq [simp]: "of_int (int n) = of_nat n"
29667
53103fc8ffa3 Replaced group_ and ring_simps by algebra_simps;
nipkow
parents: 29046
diff changeset
   230
by (induct n) auto
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   231
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
   232
lemma of_int_numeral [simp, code_post]: "of_int (numeral k) = numeral k"
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
   233
  by (simp add: of_nat_numeral [symmetric] of_int_of_nat_eq [symmetric])
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
   234
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
   235
lemma of_int_neg_numeral [code_post]: "of_int (- numeral k) = - numeral k"
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
   236
  by simp
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
   237
31015
555f4033cd97 reorganization of power lemmas
haftmann
parents: 31010
diff changeset
   238
lemma of_int_power:
555f4033cd97 reorganization of power lemmas
haftmann
parents: 31010
diff changeset
   239
  "of_int (z ^ n) = of_int z ^ n"
555f4033cd97 reorganization of power lemmas
haftmann
parents: 31010
diff changeset
   240
  by (induct n) simp_all
555f4033cd97 reorganization of power lemmas
haftmann
parents: 31010
diff changeset
   241
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   242
end
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   243
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
   244
context ring_char_0
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   245
begin
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   246
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   247
lemma of_int_eq_iff [simp]:
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   248
   "of_int w = of_int z \<longleftrightarrow> w = z"
48066
c6783c9b87bf transfer method now handles transfer rules for compound terms, e.g. locale-defined constants with hidden parameters
huffman
parents: 48045
diff changeset
   249
  by transfer (clarsimp simp add: algebra_simps
c6783c9b87bf transfer method now handles transfer rules for compound terms, e.g. locale-defined constants with hidden parameters
huffman
parents: 48045
diff changeset
   250
    of_nat_add [symmetric] simp del: of_nat_add)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   251
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   252
text{*Special cases where either operand is zero*}
36424
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   253
lemma of_int_eq_0_iff [simp]:
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   254
  "of_int z = 0 \<longleftrightarrow> z = 0"
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   255
  using of_int_eq_iff [of z 0] by simp
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   256
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   257
lemma of_int_0_eq_iff [simp]:
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   258
  "0 = of_int z \<longleftrightarrow> z = 0"
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   259
  using of_int_eq_iff [of 0 z] by simp
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   260
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   261
end
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   262
36424
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   263
context linordered_idom
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   264
begin
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   265
35028
108662d50512 more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents: 34055
diff changeset
   266
text{*Every @{text linordered_idom} has characteristic zero.*}
36424
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   267
subclass ring_char_0 ..
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   268
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   269
lemma of_int_le_iff [simp]:
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   270
  "of_int w \<le> of_int z \<longleftrightarrow> w \<le> z"
48066
c6783c9b87bf transfer method now handles transfer rules for compound terms, e.g. locale-defined constants with hidden parameters
huffman
parents: 48045
diff changeset
   271
  by (transfer fixing: less_eq) (clarsimp simp add: algebra_simps
c6783c9b87bf transfer method now handles transfer rules for compound terms, e.g. locale-defined constants with hidden parameters
huffman
parents: 48045
diff changeset
   272
    of_nat_add [symmetric] simp del: of_nat_add)
36424
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   273
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   274
lemma of_int_less_iff [simp]:
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   275
  "of_int w < of_int z \<longleftrightarrow> w < z"
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   276
  by (simp add: less_le order_less_le)
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   277
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   278
lemma of_int_0_le_iff [simp]:
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   279
  "0 \<le> of_int z \<longleftrightarrow> 0 \<le> z"
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   280
  using of_int_le_iff [of 0 z] by simp
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   281
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   282
lemma of_int_le_0_iff [simp]:
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   283
  "of_int z \<le> 0 \<longleftrightarrow> z \<le> 0"
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   284
  using of_int_le_iff [of z 0] by simp
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   285
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   286
lemma of_int_0_less_iff [simp]:
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   287
  "0 < of_int z \<longleftrightarrow> 0 < z"
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   288
  using of_int_less_iff [of 0 z] by simp
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   289
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   290
lemma of_int_less_0_iff [simp]:
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   291
  "of_int z < 0 \<longleftrightarrow> z < 0"
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   292
  using of_int_less_iff [of z 0] by simp
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   293
f3f389fc7974 got rid of [simplified]
haftmann
parents: 36409
diff changeset
   294
end
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   295
56889
48a745e1bde7 avoid the Complex constructor, use the more natural Re/Im view; moved csqrt to Complex.
hoelzl
parents: 56525
diff changeset
   296
lemma of_nat_less_of_int_iff:
48a745e1bde7 avoid the Complex constructor, use the more natural Re/Im view; moved csqrt to Complex.
hoelzl
parents: 56525
diff changeset
   297
  "(of_nat n::'a::linordered_idom) < of_int x \<longleftrightarrow> int n < x"
48a745e1bde7 avoid the Complex constructor, use the more natural Re/Im view; moved csqrt to Complex.
hoelzl
parents: 56525
diff changeset
   298
  by (metis of_int_of_nat_eq of_int_less_iff)
48a745e1bde7 avoid the Complex constructor, use the more natural Re/Im view; moved csqrt to Complex.
hoelzl
parents: 56525
diff changeset
   299
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   300
lemma of_int_eq_id [simp]: "of_int = id"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   301
proof
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   302
  fix z show "of_int z = id z"
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   303
    by (cases z rule: int_diff_cases, simp)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   304
qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   305
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   306
51329
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51185
diff changeset
   307
instance int :: no_top
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51185
diff changeset
   308
  apply default
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51185
diff changeset
   309
  apply (rule_tac x="x + 1" in exI)
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51185
diff changeset
   310
  apply simp
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51185
diff changeset
   311
  done
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51185
diff changeset
   312
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51185
diff changeset
   313
instance int :: no_bot
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51185
diff changeset
   314
  apply default
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51185
diff changeset
   315
  apply (rule_tac x="x - 1" in exI)
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51185
diff changeset
   316
  apply simp
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51185
diff changeset
   317
  done
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51185
diff changeset
   318
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   319
subsection {* Magnitude of an Integer, as a Natural Number: @{text nat} *}
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   320
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   321
lift_definition nat :: "int \<Rightarrow> nat" is "\<lambda>(x, y). x - y"
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   322
  by auto
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   323
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   324
lemma nat_int [simp]: "nat (int n) = n"
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   325
  by transfer simp
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   326
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   327
lemma int_nat_eq [simp]: "int (nat z) = (if 0 \<le> z then z else 0)"
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   328
  by transfer clarsimp
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   329
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   330
corollary nat_0_le: "0 \<le> z ==> int (nat z) = z"
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   331
by simp
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   332
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   333
lemma nat_le_0 [simp]: "z \<le> 0 ==> nat z = 0"
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   334
  by transfer clarsimp
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   335
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   336
lemma nat_le_eq_zle: "0 < w | 0 \<le> z ==> (nat w \<le> nat z) = (w\<le>z)"
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   337
  by transfer (clarsimp, arith)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   338
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   339
text{*An alternative condition is @{term "0 \<le> w"} *}
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   340
corollary nat_mono_iff: "0 < z ==> (nat w < nat z) = (w < z)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   341
by (simp add: nat_le_eq_zle linorder_not_le [symmetric]) 
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   342
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   343
corollary nat_less_eq_zless: "0 \<le> w ==> (nat w < nat z) = (w<z)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   344
by (simp add: nat_le_eq_zle linorder_not_le [symmetric]) 
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   345
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   346
lemma zless_nat_conj [simp]: "(nat w < nat z) = (0 < z & w < z)"
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   347
  by transfer (clarsimp, arith)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   348
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   349
lemma nonneg_eq_int:
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   350
  fixes z :: int
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   351
  assumes "0 \<le> z" and "\<And>m. z = int m \<Longrightarrow> P"
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   352
  shows P
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   353
  using assms by (blast dest: nat_0_le sym)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   354
54223
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   355
lemma nat_eq_iff:
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   356
  "nat w = m \<longleftrightarrow> (if 0 \<le> w then w = int m else m = 0)"
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   357
  by transfer (clarsimp simp add: le_imp_diff_is_add)
54223
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   358
 
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   359
corollary nat_eq_iff2:
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   360
  "m = nat w \<longleftrightarrow> (if 0 \<le> w then w = int m else m = 0)"
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   361
  using nat_eq_iff [of w m] by auto
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   362
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   363
lemma nat_0 [simp]:
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   364
  "nat 0 = 0"
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   365
  by (simp add: nat_eq_iff)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   366
54223
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   367
lemma nat_1 [simp]:
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   368
  "nat 1 = Suc 0"
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   369
  by (simp add: nat_eq_iff)
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   370
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   371
lemma nat_numeral [simp]:
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   372
  "nat (numeral k) = numeral k"
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   373
  by (simp add: nat_eq_iff)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   374
54223
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   375
lemma nat_neg_numeral [simp]:
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
   376
  "nat (- numeral k) = 0"
54223
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   377
  by simp
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   378
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   379
lemma nat_2: "nat 2 = Suc (Suc 0)"
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   380
  by simp
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   381
 
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   382
lemma nat_less_iff: "0 \<le> w ==> (nat w < m) = (w < of_nat m)"
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   383
  by transfer (clarsimp, arith)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   384
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   385
lemma nat_le_iff: "nat x \<le> n \<longleftrightarrow> x \<le> int n"
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   386
  by transfer (clarsimp simp add: le_diff_conv)
44707
487ae6317f7b move lemmas nat_le_iff and nat_mono into Int.thy
huffman
parents: 44695
diff changeset
   387
487ae6317f7b move lemmas nat_le_iff and nat_mono into Int.thy
huffman
parents: 44695
diff changeset
   388
lemma nat_mono: "x \<le> y \<Longrightarrow> nat x \<le> nat y"
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   389
  by transfer auto
44707
487ae6317f7b move lemmas nat_le_iff and nat_mono into Int.thy
huffman
parents: 44695
diff changeset
   390
29700
22faf21db3df added some simp rules
nipkow
parents: 29668
diff changeset
   391
lemma nat_0_iff[simp]: "nat(i::int) = 0 \<longleftrightarrow> i\<le>0"
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   392
  by transfer clarsimp
29700
22faf21db3df added some simp rules
nipkow
parents: 29668
diff changeset
   393
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   394
lemma int_eq_iff: "(of_nat m = z) = (m = nat z & 0 \<le> z)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   395
by (auto simp add: nat_eq_iff2)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   396
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   397
lemma zero_less_nat_eq [simp]: "(0 < nat z) = (0 < z)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   398
by (insert zless_nat_conj [of 0], auto)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   399
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   400
lemma nat_add_distrib:
54223
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   401
  "0 \<le> z \<Longrightarrow> 0 \<le> z' \<Longrightarrow> nat (z + z') = nat z + nat z'"
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   402
  by transfer clarsimp
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   403
54223
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   404
lemma nat_diff_distrib':
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   405
  "0 \<le> x \<Longrightarrow> 0 \<le> y \<Longrightarrow> nat (x - y) = nat x - nat y"
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   406
  by transfer clarsimp
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   407
 
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   408
lemma nat_diff_distrib:
54223
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   409
  "0 \<le> z' \<Longrightarrow> z' \<le> z \<Longrightarrow> nat (z - z') = nat z - nat z'"
85705ba18add restructed
haftmann
parents: 54147
diff changeset
   410
  by (rule nat_diff_distrib') auto
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   411
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   412
lemma nat_zminus_int [simp]: "nat (- int n) = 0"
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   413
  by transfer simp
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   414
53065
de1816a7293e added lemma
haftmann
parents: 52435
diff changeset
   415
lemma le_nat_iff:
de1816a7293e added lemma
haftmann
parents: 52435
diff changeset
   416
  "k \<ge> 0 \<Longrightarrow> n \<le> nat k \<longleftrightarrow> int n \<le> k"
de1816a7293e added lemma
haftmann
parents: 52435
diff changeset
   417
  by transfer auto
de1816a7293e added lemma
haftmann
parents: 52435
diff changeset
   418
  
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   419
lemma zless_nat_eq_int_zless: "(m < nat z) = (int m < z)"
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   420
  by transfer (clarsimp simp add: less_diff_conv)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   421
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   422
context ring_1
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   423
begin
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   424
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   425
lemma of_nat_nat: "0 \<le> z \<Longrightarrow> of_nat (nat z) = of_int z"
48066
c6783c9b87bf transfer method now handles transfer rules for compound terms, e.g. locale-defined constants with hidden parameters
huffman
parents: 48045
diff changeset
   426
  by transfer (clarsimp simp add: of_nat_diff)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   427
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   428
end
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   429
54249
ce00f2fef556 streamlined setup of linear arithmetic
haftmann
parents: 54230
diff changeset
   430
lemma diff_nat_numeral [simp]: 
ce00f2fef556 streamlined setup of linear arithmetic
haftmann
parents: 54230
diff changeset
   431
  "(numeral v :: nat) - numeral v' = nat (numeral v - numeral v')"
ce00f2fef556 streamlined setup of linear arithmetic
haftmann
parents: 54230
diff changeset
   432
  by (simp only: nat_diff_distrib' zero_le_numeral nat_numeral)
ce00f2fef556 streamlined setup of linear arithmetic
haftmann
parents: 54230
diff changeset
   433
ce00f2fef556 streamlined setup of linear arithmetic
haftmann
parents: 54230
diff changeset
   434
29779
2786b348c376 declare "nat o abs" as default measure for int
krauss
parents: 29700
diff changeset
   435
text {* For termination proofs: *}
2786b348c376 declare "nat o abs" as default measure for int
krauss
parents: 29700
diff changeset
   436
lemma measure_function_int[measure_function]: "is_measure (nat o abs)" ..
2786b348c376 declare "nat o abs" as default measure for int
krauss
parents: 29700
diff changeset
   437
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   438
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   439
subsection{*Lemmas about the Function @{term of_nat} and Orderings*}
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   440
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   441
lemma negative_zless_0: "- (int (Suc n)) < (0 \<Colon> int)"
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   442
by (simp add: order_less_le del: of_nat_Suc)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   443
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   444
lemma negative_zless [iff]: "- (int (Suc n)) < int m"
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   445
by (rule negative_zless_0 [THEN order_less_le_trans], simp)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   446
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   447
lemma negative_zle_0: "- int n \<le> 0"
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   448
by (simp add: minus_le_iff)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   449
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   450
lemma negative_zle [iff]: "- int n \<le> int m"
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   451
by (rule order_trans [OF negative_zle_0 of_nat_0_le_iff])
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   452
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   453
lemma not_zle_0_negative [simp]: "~ (0 \<le> - (int (Suc n)))"
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   454
by (subst le_minus_iff, simp del: of_nat_Suc)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   455
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   456
lemma int_zle_neg: "(int n \<le> - int m) = (n = 0 & m = 0)"
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   457
  by transfer simp
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   458
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   459
lemma not_int_zless_negative [simp]: "~ (int n < - int m)"
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   460
by (simp add: linorder_not_less)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   461
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   462
lemma negative_eq_positive [simp]: "(- int n = of_nat m) = (n = 0 & m = 0)"
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   463
by (force simp add: order_eq_iff [of "- of_nat n"] int_zle_neg)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   464
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   465
lemma zle_iff_zadd: "w \<le> z \<longleftrightarrow> (\<exists>n. z = w + int n)"
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   466
proof -
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   467
  have "(w \<le> z) = (0 \<le> z - w)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   468
    by (simp only: le_diff_eq add_0_left)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   469
  also have "\<dots> = (\<exists>n. z - w = of_nat n)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   470
    by (auto elim: zero_le_imp_eq_int)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   471
  also have "\<dots> = (\<exists>n. z = w + of_nat n)"
29667
53103fc8ffa3 Replaced group_ and ring_simps by algebra_simps;
nipkow
parents: 29046
diff changeset
   472
    by (simp only: algebra_simps)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   473
  finally show ?thesis .
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   474
qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   475
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   476
lemma zadd_int_left: "int m + (int n + z) = int (m + n) + z"
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   477
by simp
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   478
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   479
lemma int_Suc0_eq_1: "int (Suc 0) = 1"
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   480
by simp
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   481
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   482
text{*This version is proved for all ordered rings, not just integers!
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   483
      It is proved here because attribute @{text arith_split} is not available
35050
9f841f20dca6 renamed OrderedGroup to Groups; split theory Ring_and_Field into Rings Fields
haftmann
parents: 35032
diff changeset
   484
      in theory @{text Rings}.
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   485
      But is it really better than just rewriting with @{text abs_if}?*}
54147
97a8ff4e4ac9 killed most "no_atp", to make Sledgehammer more complete
blanchet
parents: 53652
diff changeset
   486
lemma abs_split [arith_split, no_atp]:
35028
108662d50512 more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents: 34055
diff changeset
   487
     "P(abs(a::'a::linordered_idom)) = ((0 \<le> a --> P a) & (a < 0 --> P(-a)))"
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   488
by (force dest: order_less_le_trans simp add: abs_if linorder_not_less)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   489
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   490
lemma negD: "x < 0 \<Longrightarrow> \<exists>n. x = - (int (Suc n))"
48045
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   491
apply transfer
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   492
apply clarsimp
fbf77fdf9ae4 convert Int.thy to use lifting and transfer
huffman
parents: 48044
diff changeset
   493
apply (rule_tac x="b - Suc a" in exI, arith)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   494
done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   495
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   496
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   497
subsection {* Cases and induction *}
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   498
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   499
text{*Now we replace the case analysis rule by a more conventional one:
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   500
whether an integer is negative or not.*}
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   501
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   502
theorem int_cases [case_names nonneg neg, cases type: int]:
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   503
  "[|!! n. z = int n ==> P;  !! n. z =  - (int (Suc n)) ==> P |] ==> P"
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   504
apply (cases "z < 0")
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   505
apply (blast dest!: negD)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   506
apply (simp add: linorder_not_less del: of_nat_Suc)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   507
apply auto
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   508
apply (blast dest: nat_0_le [THEN sym])
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   509
done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   510
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   511
theorem int_of_nat_induct [case_names nonneg neg, induct type: int]:
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   512
     "[|!! n. P (int n);  !!n. P (- (int (Suc n))) |] ==> P z"
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   513
  by (cases z) auto
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   514
47207
9368aa814518 move lemmas from Nat_Numeral to Int.thy and Num.thy
huffman
parents: 47192
diff changeset
   515
lemma nonneg_int_cases:
9368aa814518 move lemmas from Nat_Numeral to Int.thy and Num.thy
huffman
parents: 47192
diff changeset
   516
  assumes "0 \<le> k" obtains n where "k = int n"
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
   517
  using assms by (rule nonneg_eq_int)
47207
9368aa814518 move lemmas from Nat_Numeral to Int.thy and Num.thy
huffman
parents: 47192
diff changeset
   518
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
   519
lemma Let_numeral [simp]: "Let (numeral v) f = f (numeral v)"
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
   520
  -- {* Unfold all @{text let}s involving constants *}
57514
bdc2c6b40bf2 prefer ac_simps collections over separate name bindings for add and mult
haftmann
parents: 57512
diff changeset
   521
  by (fact Let_numeral) -- {* FIXME drop *}
37767
a2b7a20d6ea3 dropped superfluous [code del]s
haftmann
parents: 36811
diff changeset
   522
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
   523
lemma Let_neg_numeral [simp]: "Let (- numeral v) f = f (- numeral v)"
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   524
  -- {* Unfold all @{text let}s involving constants *}
57514
bdc2c6b40bf2 prefer ac_simps collections over separate name bindings for add and mult
haftmann
parents: 57512
diff changeset
   525
  by (fact Let_neg_numeral) -- {* FIXME drop *}
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   526
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
   527
text {* Unfold @{text min} and @{text max} on numerals. *}
28958
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   528
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
   529
lemmas max_number_of [simp] =
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
   530
  max_def [of "numeral u" "numeral v"]
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
   531
  max_def [of "numeral u" "- numeral v"]
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
   532
  max_def [of "- numeral u" "numeral v"]
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
   533
  max_def [of "- numeral u" "- numeral v"] for u v
28958
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   534
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
   535
lemmas min_number_of [simp] =
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
   536
  min_def [of "numeral u" "numeral v"]
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
   537
  min_def [of "numeral u" "- numeral v"]
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
   538
  min_def [of "- numeral u" "numeral v"]
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
   539
  min_def [of "- numeral u" "- numeral v"] for u v
26075
815f3ccc0b45 added lemma lists {normalize,succ,pred,minus,add,mult}_bin_simps
huffman
parents: 26072
diff changeset
   540
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   541
28958
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   542
subsubsection {* Binary comparisons *}
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   543
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   544
text {* Preliminaries *}
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   545
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   546
lemma even_less_0_iff:
35028
108662d50512 more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents: 34055
diff changeset
   547
  "a + a < 0 \<longleftrightarrow> a < (0::'a::linordered_idom)"
28958
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   548
proof -
49962
a8cc904a6820 Renamed {left,right}_distrib to distrib_{right,left}.
webertj
parents: 48891
diff changeset
   549
  have "a + a < 0 \<longleftrightarrow> (1+1)*a < 0" by (simp add: distrib_right del: one_add_one)
28958
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   550
  also have "(1+1)*a < 0 \<longleftrightarrow> a < 0"
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   551
    by (simp add: mult_less_0_iff zero_less_two 
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   552
                  order_less_not_sym [OF zero_less_two])
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   553
  finally show ?thesis .
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   554
qed
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   555
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   556
lemma le_imp_0_less: 
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   557
  assumes le: "0 \<le> z"
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   558
  shows "(0::int) < 1 + z"
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   559
proof -
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   560
  have "0 \<le> z" by fact
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
   561
  also have "... < z + 1" by (rule less_add_one)
57514
bdc2c6b40bf2 prefer ac_simps collections over separate name bindings for add and mult
haftmann
parents: 57512
diff changeset
   562
  also have "... = 1 + z" by (simp add: ac_simps)
28958
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   563
  finally show "0 < 1 + z" .
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   564
qed
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   565
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   566
lemma odd_less_0_iff:
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   567
  "(1 + z + z < 0) = (z < (0::int))"
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   568
proof (cases z)
28958
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   569
  case (nonneg n)
57512
cc97b347b301 reduced name variants for assoc and commute on plus and mult
haftmann
parents: 56889
diff changeset
   570
  thus ?thesis by (simp add: linorder_not_less add.assoc add_increasing
28958
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   571
                             le_imp_0_less [THEN order_less_imp_le])  
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   572
next
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   573
  case (neg n)
30079
293b896b9c25 make proofs work whether or not One_nat_def is a simp rule; replace 1 with Suc 0 in the rhs of some simp rules
huffman
parents: 30000
diff changeset
   574
  thus ?thesis by (simp del: of_nat_Suc of_nat_add of_nat_1
293b896b9c25 make proofs work whether or not One_nat_def is a simp rule; replace 1 with Suc 0 in the rhs of some simp rules
huffman
parents: 30000
diff changeset
   575
    add: algebra_simps of_nat_1 [where 'a=int, symmetric] of_nat_add [symmetric])
28958
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   576
qed
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   577
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   578
subsubsection {* Comparisons, for Ordered Rings *}
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   579
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   580
lemmas double_eq_0_iff = double_zero
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   581
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   582
lemma odd_nonzero:
33296
a3924d1069e5 moved theory Divides after theory Nat_Numeral; tuned some proof texts
haftmann
parents: 33056
diff changeset
   583
  "1 + z + z \<noteq> (0::int)"
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   584
proof (cases z)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   585
  case (nonneg n)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   586
  have le: "0 \<le> z+z" by (simp add: nonneg add_increasing) 
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   587
  thus ?thesis using  le_imp_0_less [OF le]
57512
cc97b347b301 reduced name variants for assoc and commute on plus and mult
haftmann
parents: 56889
diff changeset
   588
    by (auto simp add: add.assoc) 
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   589
next
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   590
  case (neg n)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   591
  show ?thesis
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   592
  proof
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   593
    assume eq: "1 + z + z = 0"
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   594
    have "(0::int) < 1 + (int n + int n)"
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   595
      by (simp add: le_imp_0_less add_increasing) 
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   596
    also have "... = - (1 + z + z)" 
57512
cc97b347b301 reduced name variants for assoc and commute on plus and mult
haftmann
parents: 56889
diff changeset
   597
      by (simp add: neg add.assoc [symmetric]) 
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   598
    also have "... = 0" by (simp add: eq) 
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   599
    finally have "0<0" ..
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   600
    thus False by blast
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   601
  qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   602
qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   603
30652
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
   604
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   605
subsection {* The Set of Integers *}
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   606
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   607
context ring_1
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   608
begin
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   609
30652
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
   610
definition Ints  :: "'a set" where
37767
a2b7a20d6ea3 dropped superfluous [code del]s
haftmann
parents: 36811
diff changeset
   611
  "Ints = range of_int"
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   612
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   613
notation (xsymbols)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   614
  Ints  ("\<int>")
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   615
35634
6fdfe37b84d6 add more simp rules for Ints
huffman
parents: 35216
diff changeset
   616
lemma Ints_of_int [simp]: "of_int z \<in> \<int>"
6fdfe37b84d6 add more simp rules for Ints
huffman
parents: 35216
diff changeset
   617
  by (simp add: Ints_def)
6fdfe37b84d6 add more simp rules for Ints
huffman
parents: 35216
diff changeset
   618
6fdfe37b84d6 add more simp rules for Ints
huffman
parents: 35216
diff changeset
   619
lemma Ints_of_nat [simp]: "of_nat n \<in> \<int>"
45533
af3690f6bd79 simplify some proofs
huffman
parents: 45532
diff changeset
   620
  using Ints_of_int [of "of_nat n"] by simp
35634
6fdfe37b84d6 add more simp rules for Ints
huffman
parents: 35216
diff changeset
   621
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   622
lemma Ints_0 [simp]: "0 \<in> \<int>"
45533
af3690f6bd79 simplify some proofs
huffman
parents: 45532
diff changeset
   623
  using Ints_of_int [of "0"] by simp
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   624
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   625
lemma Ints_1 [simp]: "1 \<in> \<int>"
45533
af3690f6bd79 simplify some proofs
huffman
parents: 45532
diff changeset
   626
  using Ints_of_int [of "1"] by simp
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   627
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   628
lemma Ints_add [simp]: "a \<in> \<int> \<Longrightarrow> b \<in> \<int> \<Longrightarrow> a + b \<in> \<int>"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   629
apply (auto simp add: Ints_def)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   630
apply (rule range_eqI)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   631
apply (rule of_int_add [symmetric])
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   632
done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   633
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   634
lemma Ints_minus [simp]: "a \<in> \<int> \<Longrightarrow> -a \<in> \<int>"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   635
apply (auto simp add: Ints_def)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   636
apply (rule range_eqI)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   637
apply (rule of_int_minus [symmetric])
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   638
done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   639
35634
6fdfe37b84d6 add more simp rules for Ints
huffman
parents: 35216
diff changeset
   640
lemma Ints_diff [simp]: "a \<in> \<int> \<Longrightarrow> b \<in> \<int> \<Longrightarrow> a - b \<in> \<int>"
6fdfe37b84d6 add more simp rules for Ints
huffman
parents: 35216
diff changeset
   641
apply (auto simp add: Ints_def)
6fdfe37b84d6 add more simp rules for Ints
huffman
parents: 35216
diff changeset
   642
apply (rule range_eqI)
6fdfe37b84d6 add more simp rules for Ints
huffman
parents: 35216
diff changeset
   643
apply (rule of_int_diff [symmetric])
6fdfe37b84d6 add more simp rules for Ints
huffman
parents: 35216
diff changeset
   644
done
6fdfe37b84d6 add more simp rules for Ints
huffman
parents: 35216
diff changeset
   645
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   646
lemma Ints_mult [simp]: "a \<in> \<int> \<Longrightarrow> b \<in> \<int> \<Longrightarrow> a * b \<in> \<int>"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   647
apply (auto simp add: Ints_def)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   648
apply (rule range_eqI)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   649
apply (rule of_int_mult [symmetric])
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   650
done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   651
35634
6fdfe37b84d6 add more simp rules for Ints
huffman
parents: 35216
diff changeset
   652
lemma Ints_power [simp]: "a \<in> \<int> \<Longrightarrow> a ^ n \<in> \<int>"
6fdfe37b84d6 add more simp rules for Ints
huffman
parents: 35216
diff changeset
   653
by (induct n) simp_all
6fdfe37b84d6 add more simp rules for Ints
huffman
parents: 35216
diff changeset
   654
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   655
lemma Ints_cases [cases set: Ints]:
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   656
  assumes "q \<in> \<int>"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   657
  obtains (of_int) z where "q = of_int z"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   658
  unfolding Ints_def
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   659
proof -
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   660
  from `q \<in> \<int>` have "q \<in> range of_int" unfolding Ints_def .
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   661
  then obtain z where "q = of_int z" ..
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   662
  then show thesis ..
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   663
qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   664
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   665
lemma Ints_induct [case_names of_int, induct set: Ints]:
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   666
  "q \<in> \<int> \<Longrightarrow> (\<And>z. P (of_int z)) \<Longrightarrow> P q"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   667
  by (rule Ints_cases) auto
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   668
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   669
end
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   670
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   671
text {* The premise involving @{term Ints} prevents @{term "a = 1/2"}. *}
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   672
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   673
lemma Ints_double_eq_0_iff:
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   674
  assumes in_Ints: "a \<in> Ints"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   675
  shows "(a + a = 0) = (a = (0::'a::ring_char_0))"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   676
proof -
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   677
  from in_Ints have "a \<in> range of_int" unfolding Ints_def [symmetric] .
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   678
  then obtain z where a: "a = of_int z" ..
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   679
  show ?thesis
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   680
  proof
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   681
    assume "a = 0"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   682
    thus "a + a = 0" by simp
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   683
  next
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   684
    assume eq: "a + a = 0"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   685
    hence "of_int (z + z) = (of_int 0 :: 'a)" by (simp add: a)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   686
    hence "z + z = 0" by (simp only: of_int_eq_iff)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   687
    hence "z = 0" by (simp only: double_eq_0_iff)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   688
    thus "a = 0" by (simp add: a)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   689
  qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   690
qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   691
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   692
lemma Ints_odd_nonzero:
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   693
  assumes in_Ints: "a \<in> Ints"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   694
  shows "1 + a + a \<noteq> (0::'a::ring_char_0)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   695
proof -
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   696
  from in_Ints have "a \<in> range of_int" unfolding Ints_def [symmetric] .
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   697
  then obtain z where a: "a = of_int z" ..
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   698
  show ?thesis
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   699
  proof
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   700
    assume eq: "1 + a + a = 0"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   701
    hence "of_int (1 + z + z) = (of_int 0 :: 'a)" by (simp add: a)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   702
    hence "1 + z + z = 0" by (simp only: of_int_eq_iff)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   703
    with odd_nonzero show False by blast
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   704
  qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   705
qed 
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   706
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
   707
lemma Nats_numeral [simp]: "numeral w \<in> Nats"
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
   708
  using of_nat_in_Nats [of "numeral w"] by simp
35634
6fdfe37b84d6 add more simp rules for Ints
huffman
parents: 35216
diff changeset
   709
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   710
lemma Ints_odd_less_0: 
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   711
  assumes in_Ints: "a \<in> Ints"
35028
108662d50512 more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents: 34055
diff changeset
   712
  shows "(1 + a + a < 0) = (a < (0::'a::linordered_idom))"
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   713
proof -
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   714
  from in_Ints have "a \<in> range of_int" unfolding Ints_def [symmetric] .
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   715
  then obtain z where a: "a = of_int z" ..
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   716
  hence "((1::'a) + a + a < 0) = (of_int (1 + z + z) < (of_int 0 :: 'a))"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   717
    by (simp add: a)
45532
74b17a0881b3 Int.thy: remove duplicate lemmas double_less_0_iff and odd_less_0, use {even,odd}_less_0_iff instead
huffman
parents: 45219
diff changeset
   718
  also have "... = (z < 0)" by (simp only: of_int_less_iff odd_less_0_iff)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   719
  also have "... = (a < 0)" by (simp add: a)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   720
  finally show ?thesis .
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   721
qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   722
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   723
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   724
subsection {* @{term setsum} and @{term setprod} *}
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   725
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   726
lemma of_nat_setsum: "of_nat (setsum f A) = (\<Sum>x\<in>A. of_nat(f x))"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   727
  apply (cases "finite A")
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   728
  apply (erule finite_induct, auto)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   729
  done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   730
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   731
lemma of_int_setsum: "of_int (setsum f A) = (\<Sum>x\<in>A. of_int(f x))"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   732
  apply (cases "finite A")
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   733
  apply (erule finite_induct, auto)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   734
  done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   735
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   736
lemma of_nat_setprod: "of_nat (setprod f A) = (\<Prod>x\<in>A. of_nat(f x))"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   737
  apply (cases "finite A")
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   738
  apply (erule finite_induct, auto simp add: of_nat_mult)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   739
  done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   740
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   741
lemma of_int_setprod: "of_int (setprod f A) = (\<Prod>x\<in>A. of_int(f x))"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   742
  apply (cases "finite A")
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   743
  apply (erule finite_induct, auto)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   744
  done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   745
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   746
lemmas int_setsum = of_nat_setsum [where 'a=int]
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   747
lemmas int_setprod = of_nat_setprod [where 'a=int]
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   748
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   749
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   750
text {* Legacy theorems *}
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   751
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   752
lemmas zle_int = of_nat_le_iff [where 'a=int]
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   753
lemmas int_int_eq = of_nat_eq_iff [where 'a=int]
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
   754
lemmas numeral_1_eq_1 = numeral_One
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   755
30802
f9e9e800d27e simplify theorem references
huffman
parents: 30796
diff changeset
   756
subsection {* Setting up simplification procedures *}
f9e9e800d27e simplify theorem references
huffman
parents: 30796
diff changeset
   757
54249
ce00f2fef556 streamlined setup of linear arithmetic
haftmann
parents: 54230
diff changeset
   758
lemmas of_int_simps =
ce00f2fef556 streamlined setup of linear arithmetic
haftmann
parents: 54230
diff changeset
   759
  of_int_0 of_int_1 of_int_add of_int_mult
ce00f2fef556 streamlined setup of linear arithmetic
haftmann
parents: 54230
diff changeset
   760
30802
f9e9e800d27e simplify theorem references
huffman
parents: 30796
diff changeset
   761
lemmas int_arith_rules =
54249
ce00f2fef556 streamlined setup of linear arithmetic
haftmann
parents: 54230
diff changeset
   762
  numeral_One more_arith_simps of_nat_simps of_int_simps
30802
f9e9e800d27e simplify theorem references
huffman
parents: 30796
diff changeset
   763
48891
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48066
diff changeset
   764
ML_file "Tools/int_arith.ML"
30496
7cdcc9dd95cb vague cleanup in arith proof tools setup: deleted dead code, more proper structures, clearer arrangement
haftmann
parents: 30273
diff changeset
   765
declaration {* K Int_Arith.setup *}
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   766
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
   767
simproc_setup fast_arith ("(m::'a::linordered_idom) < n" |
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
   768
  "(m::'a::linordered_idom) <= n" |
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
   769
  "(m::'a::linordered_idom) = n") =
43595
7ae4a23b5be6 modernized some simproc setup;
wenzelm
parents: 43531
diff changeset
   770
  {* fn _ => fn ss => fn ct => Lin_Arith.simproc ss (term_of ct) *}
7ae4a23b5be6 modernized some simproc setup;
wenzelm
parents: 43531
diff changeset
   771
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   772
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   773
subsection{*More Inequality Reasoning*}
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   774
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   775
lemma zless_add1_eq: "(w < z + (1::int)) = (w<z | w=z)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   776
by arith
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   777
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   778
lemma add1_zle_eq: "(w + (1::int) \<le> z) = (w<z)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   779
by arith
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   780
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   781
lemma zle_diff1_eq [simp]: "(w \<le> z - (1::int)) = (w<z)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   782
by arith
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   783
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   784
lemma zle_add1_eq_le [simp]: "(w < z + (1::int)) = (w\<le>z)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   785
by arith
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   786
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   787
lemma int_one_le_iff_zero_less: "((1::int) \<le> z) = (0 < z)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   788
by arith
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   789
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   790
28958
74c60b78969c cleaned up subsection headings;
huffman
parents: 28952
diff changeset
   791
subsection{*The functions @{term nat} and @{term int}*}
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   792
48044
fea6f3060b65 remove unnecessary simp rules involving Abs_Integ
huffman
parents: 47255
diff changeset
   793
text{*Simplify the term @{term "w + - z"}*}
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   794
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   795
lemma one_less_nat_eq [simp]: "(Suc 0 < nat z) = (1 < z)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   796
apply (insert zless_nat_conj [of 1 z])
47207
9368aa814518 move lemmas from Nat_Numeral to Int.thy and Num.thy
huffman
parents: 47192
diff changeset
   797
apply auto
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   798
done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   799
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   800
text{*This simplifies expressions of the form @{term "int n = z"} where
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   801
      z is an integer literal.*}
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
   802
lemmas int_eq_iff_numeral [simp] = int_eq_iff [of _ "numeral v"] for v
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   803
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   804
lemma split_nat [arith_split]:
44709
79f10d9e63c1 introduce abbreviation 'int' earlier in Int.thy
huffman
parents: 44707
diff changeset
   805
  "P(nat(i::int)) = ((\<forall>n. i = int n \<longrightarrow> P n) & (i < 0 \<longrightarrow> P 0))"
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   806
  (is "?P = (?L & ?R)")
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   807
proof (cases "i < 0")
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   808
  case True thus ?thesis by auto
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   809
next
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   810
  case False
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   811
  have "?P = ?L"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   812
  proof
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   813
    assume ?P thus ?L using False by clarsimp
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   814
  next
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   815
    assume ?L thus ?P using False by simp
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   816
  qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   817
  with False show ?thesis by simp
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   818
qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   819
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   820
context ring_1
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   821
begin
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   822
33056
791a4655cae3 renamed "nitpick_const_xxx" attributes to "nitpick_xxx" and "nitpick_ind_intros" to "nitpick_intros"
blanchet
parents: 32437
diff changeset
   823
lemma of_int_of_nat [nitpick_simp]:
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   824
  "of_int k = (if k < 0 then - of_nat (nat (- k)) else of_nat (nat k))"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   825
proof (cases "k < 0")
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   826
  case True then have "0 \<le> - k" by simp
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   827
  then have "of_nat (nat (- k)) = of_int (- k)" by (rule of_nat_nat)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   828
  with True show ?thesis by simp
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   829
next
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   830
  case False then show ?thesis by (simp add: not_less of_nat_nat)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   831
qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   832
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   833
end
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   834
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   835
lemma nat_mult_distrib:
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   836
  fixes z z' :: int
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   837
  assumes "0 \<le> z"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   838
  shows "nat (z * z') = nat z * nat z'"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   839
proof (cases "0 \<le> z'")
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   840
  case False with assms have "z * z' \<le> 0"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   841
    by (simp add: not_le mult_le_0_iff)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   842
  then have "nat (z * z') = 0" by simp
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   843
  moreover from False have "nat z' = 0" by simp
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   844
  ultimately show ?thesis by simp
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   845
next
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   846
  case True with assms have ge_0: "z * z' \<ge> 0" by (simp add: zero_le_mult_iff)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   847
  show ?thesis
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   848
    by (rule injD [of "of_nat :: nat \<Rightarrow> int", OF inj_of_nat])
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   849
      (simp only: of_nat_mult of_nat_nat [OF True]
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   850
         of_nat_nat [OF assms] of_nat_nat [OF ge_0], simp)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   851
qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   852
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   853
lemma nat_mult_distrib_neg: "z \<le> (0::int) ==> nat(z*z') = nat(-z) * nat(-z')"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   854
apply (rule trans)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   855
apply (rule_tac [2] nat_mult_distrib, auto)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   856
done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   857
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   858
lemma nat_abs_mult_distrib: "nat (abs (w * z)) = nat (abs w) * nat (abs z)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   859
apply (cases "z=0 | w=0")
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   860
apply (auto simp add: abs_if nat_mult_distrib [symmetric] 
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   861
                      nat_mult_distrib_neg [symmetric] mult_less_0_iff)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   862
done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   863
47207
9368aa814518 move lemmas from Nat_Numeral to Int.thy and Num.thy
huffman
parents: 47192
diff changeset
   864
lemma Suc_nat_eq_nat_zadd1: "(0::int) <= z ==> Suc (nat z) = nat (1 + z)"
9368aa814518 move lemmas from Nat_Numeral to Int.thy and Num.thy
huffman
parents: 47192
diff changeset
   865
apply (rule sym)
9368aa814518 move lemmas from Nat_Numeral to Int.thy and Num.thy
huffman
parents: 47192
diff changeset
   866
apply (simp add: nat_eq_iff)
9368aa814518 move lemmas from Nat_Numeral to Int.thy and Num.thy
huffman
parents: 47192
diff changeset
   867
done
9368aa814518 move lemmas from Nat_Numeral to Int.thy and Num.thy
huffman
parents: 47192
diff changeset
   868
9368aa814518 move lemmas from Nat_Numeral to Int.thy and Num.thy
huffman
parents: 47192
diff changeset
   869
lemma diff_nat_eq_if:
9368aa814518 move lemmas from Nat_Numeral to Int.thy and Num.thy
huffman
parents: 47192
diff changeset
   870
     "nat z - nat z' =  
9368aa814518 move lemmas from Nat_Numeral to Int.thy and Num.thy
huffman
parents: 47192
diff changeset
   871
        (if z' < 0 then nat z   
9368aa814518 move lemmas from Nat_Numeral to Int.thy and Num.thy
huffman
parents: 47192
diff changeset
   872
         else let d = z-z' in     
9368aa814518 move lemmas from Nat_Numeral to Int.thy and Num.thy
huffman
parents: 47192
diff changeset
   873
              if d < 0 then 0 else nat d)"
9368aa814518 move lemmas from Nat_Numeral to Int.thy and Num.thy
huffman
parents: 47192
diff changeset
   874
by (simp add: Let_def nat_diff_distrib [symmetric])
9368aa814518 move lemmas from Nat_Numeral to Int.thy and Num.thy
huffman
parents: 47192
diff changeset
   875
9368aa814518 move lemmas from Nat_Numeral to Int.thy and Num.thy
huffman
parents: 47192
diff changeset
   876
lemma nat_numeral_diff_1 [simp]:
9368aa814518 move lemmas from Nat_Numeral to Int.thy and Num.thy
huffman
parents: 47192
diff changeset
   877
  "numeral v - (1::nat) = nat (numeral v - 1)"
9368aa814518 move lemmas from Nat_Numeral to Int.thy and Num.thy
huffman
parents: 47192
diff changeset
   878
  using diff_nat_numeral [of v Num.One] by simp
9368aa814518 move lemmas from Nat_Numeral to Int.thy and Num.thy
huffman
parents: 47192
diff changeset
   879
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   880
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   881
subsection "Induction principles for int"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   882
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   883
text{*Well-founded segments of the integers*}
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   884
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   885
definition
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   886
  int_ge_less_than  ::  "int => (int * int) set"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   887
where
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   888
  "int_ge_less_than d = {(z',z). d \<le> z' & z' < z}"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   889
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   890
theorem wf_int_ge_less_than: "wf (int_ge_less_than d)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   891
proof -
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   892
  have "int_ge_less_than d \<subseteq> measure (%z. nat (z-d))"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   893
    by (auto simp add: int_ge_less_than_def)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   894
  thus ?thesis 
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   895
    by (rule wf_subset [OF wf_measure]) 
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   896
qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   897
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   898
text{*This variant looks odd, but is typical of the relations suggested
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   899
by RankFinder.*}
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   900
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   901
definition
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   902
  int_ge_less_than2 ::  "int => (int * int) set"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   903
where
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   904
  "int_ge_less_than2 d = {(z',z). d \<le> z & z' < z}"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   905
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   906
theorem wf_int_ge_less_than2: "wf (int_ge_less_than2 d)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   907
proof -
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   908
  have "int_ge_less_than2 d \<subseteq> measure (%z. nat (1+z-d))" 
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   909
    by (auto simp add: int_ge_less_than2_def)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   910
  thus ?thesis 
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   911
    by (rule wf_subset [OF wf_measure]) 
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   912
qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   913
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   914
(* `set:int': dummy construction *)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   915
theorem int_ge_induct [case_names base step, induct set: int]:
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   916
  fixes i :: int
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   917
  assumes ge: "k \<le> i" and
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   918
    base: "P k" and
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   919
    step: "\<And>i. k \<le> i \<Longrightarrow> P i \<Longrightarrow> P (i + 1)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   920
  shows "P i"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   921
proof -
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   922
  { fix n
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   923
    have "\<And>i::int. n = nat (i - k) \<Longrightarrow> k \<le> i \<Longrightarrow> P i"
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   924
    proof (induct n)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   925
      case 0
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   926
      hence "i = k" by arith
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   927
      thus "P i" using base by simp
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   928
    next
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   929
      case (Suc n)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   930
      then have "n = nat((i - 1) - k)" by arith
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   931
      moreover
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   932
      have ki1: "k \<le> i - 1" using Suc.prems by arith
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   933
      ultimately
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   934
      have "P (i - 1)" by (rule Suc.hyps)
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   935
      from step [OF ki1 this] show ?case by simp
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   936
    qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   937
  }
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   938
  with ge show ?thesis by fast
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   939
qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   940
25928
042e877d9841 tuned code setup
haftmann
parents: 25919
diff changeset
   941
(* `set:int': dummy construction *)
042e877d9841 tuned code setup
haftmann
parents: 25919
diff changeset
   942
theorem int_gr_induct [case_names base step, induct set: int]:
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   943
  assumes gr: "k < (i::int)" and
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   944
        base: "P(k+1)" and
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   945
        step: "\<And>i. \<lbrakk>k < i; P i\<rbrakk> \<Longrightarrow> P(i+1)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   946
  shows "P i"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   947
apply(rule int_ge_induct[of "k + 1"])
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   948
  using gr apply arith
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   949
 apply(rule base)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   950
apply (rule step, simp+)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   951
done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   952
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   953
theorem int_le_induct [consumes 1, case_names base step]:
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   954
  assumes le: "i \<le> (k::int)" and
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   955
        base: "P(k)" and
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   956
        step: "\<And>i. \<lbrakk>i \<le> k; P i\<rbrakk> \<Longrightarrow> P(i - 1)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   957
  shows "P i"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   958
proof -
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   959
  { fix n
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   960
    have "\<And>i::int. n = nat(k-i) \<Longrightarrow> i \<le> k \<Longrightarrow> P i"
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   961
    proof (induct n)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   962
      case 0
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   963
      hence "i = k" by arith
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   964
      thus "P i" using base by simp
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   965
    next
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   966
      case (Suc n)
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   967
      hence "n = nat (k - (i + 1))" by arith
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   968
      moreover
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   969
      have ki1: "i + 1 \<le> k" using Suc.prems by arith
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   970
      ultimately
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   971
      have "P (i + 1)" by(rule Suc.hyps)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   972
      from step[OF ki1 this] show ?case by simp
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   973
    qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   974
  }
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   975
  with le show ?thesis by fast
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   976
qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   977
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   978
theorem int_less_induct [consumes 1, case_names base step]:
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   979
  assumes less: "(i::int) < k" and
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   980
        base: "P(k - 1)" and
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   981
        step: "\<And>i. \<lbrakk>i < k; P i\<rbrakk> \<Longrightarrow> P(i - 1)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   982
  shows "P i"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   983
apply(rule int_le_induct[of _ "k - 1"])
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   984
  using less apply arith
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   985
 apply(rule base)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   986
apply (rule step, simp+)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   987
done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
   988
36811
4ab4aa5bee1c renamed former Int.int_induct to Int.int_of_nat_induct, former Presburger.int_induct to Int.int_induct: is more conservative and more natural than the intermediate solution
haftmann
parents: 36801
diff changeset
   989
theorem int_induct [case_names base step1 step2]:
36801
3560de0fe851 moved int induction lemma to theory Int as int_bidirectional_induct
haftmann
parents: 36749
diff changeset
   990
  fixes k :: int
3560de0fe851 moved int induction lemma to theory Int as int_bidirectional_induct
haftmann
parents: 36749
diff changeset
   991
  assumes base: "P k"
3560de0fe851 moved int induction lemma to theory Int as int_bidirectional_induct
haftmann
parents: 36749
diff changeset
   992
    and step1: "\<And>i. k \<le> i \<Longrightarrow> P i \<Longrightarrow> P (i + 1)"
3560de0fe851 moved int induction lemma to theory Int as int_bidirectional_induct
haftmann
parents: 36749
diff changeset
   993
    and step2: "\<And>i. k \<ge> i \<Longrightarrow> P i \<Longrightarrow> P (i - 1)"
3560de0fe851 moved int induction lemma to theory Int as int_bidirectional_induct
haftmann
parents: 36749
diff changeset
   994
  shows "P i"
3560de0fe851 moved int induction lemma to theory Int as int_bidirectional_induct
haftmann
parents: 36749
diff changeset
   995
proof -
3560de0fe851 moved int induction lemma to theory Int as int_bidirectional_induct
haftmann
parents: 36749
diff changeset
   996
  have "i \<le> k \<or> i \<ge> k" by arith
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   997
  then show ?thesis
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   998
  proof
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
   999
    assume "i \<ge> k"
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
  1000
    then show ?thesis using base
36801
3560de0fe851 moved int induction lemma to theory Int as int_bidirectional_induct
haftmann
parents: 36749
diff changeset
  1001
      by (rule int_ge_induct) (fact step1)
3560de0fe851 moved int induction lemma to theory Int as int_bidirectional_induct
haftmann
parents: 36749
diff changeset
  1002
  next
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
  1003
    assume "i \<le> k"
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
  1004
    then show ?thesis using base
36801
3560de0fe851 moved int induction lemma to theory Int as int_bidirectional_induct
haftmann
parents: 36749
diff changeset
  1005
      by (rule int_le_induct) (fact step2)
3560de0fe851 moved int induction lemma to theory Int as int_bidirectional_induct
haftmann
parents: 36749
diff changeset
  1006
  qed
3560de0fe851 moved int induction lemma to theory Int as int_bidirectional_induct
haftmann
parents: 36749
diff changeset
  1007
qed
3560de0fe851 moved int induction lemma to theory Int as int_bidirectional_induct
haftmann
parents: 36749
diff changeset
  1008
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1009
subsection{*Intermediate value theorems*}
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1010
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1011
lemma int_val_lemma:
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1012
     "(\<forall>i<n::nat. abs(f(i+1) - f i) \<le> 1) -->  
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1013
      f 0 \<le> k --> k \<le> f n --> (\<exists>i \<le> n. f i = (k::int))"
30079
293b896b9c25 make proofs work whether or not One_nat_def is a simp rule; replace 1 with Suc 0 in the rhs of some simp rules
huffman
parents: 30000
diff changeset
  1014
unfolding One_nat_def
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
  1015
apply (induct n)
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
  1016
apply simp
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1017
apply (intro strip)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1018
apply (erule impE, simp)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1019
apply (erule_tac x = n in allE, simp)
30079
293b896b9c25 make proofs work whether or not One_nat_def is a simp rule; replace 1 with Suc 0 in the rhs of some simp rules
huffman
parents: 30000
diff changeset
  1020
apply (case_tac "k = f (Suc n)")
27106
ff27dc6e7d05 removed some dubious code lemmas
haftmann
parents: 26975
diff changeset
  1021
apply force
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1022
apply (erule impE)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1023
 apply (simp add: abs_if split add: split_if_asm)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1024
apply (blast intro: le_SucI)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1025
done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1026
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1027
lemmas nat0_intermed_int_val = int_val_lemma [rule_format (no_asm)]
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1028
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1029
lemma nat_intermed_int_val:
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1030
     "[| \<forall>i. m \<le> i & i < n --> abs(f(i + 1::nat) - f i) \<le> 1; m < n;  
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1031
         f m \<le> k; k \<le> f n |] ==> ? i. m \<le> i & i \<le> n & f i = (k::int)"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1032
apply (cut_tac n = "n-m" and f = "%i. f (i+m) " and k = k 
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1033
       in int_val_lemma)
30079
293b896b9c25 make proofs work whether or not One_nat_def is a simp rule; replace 1 with Suc 0 in the rhs of some simp rules
huffman
parents: 30000
diff changeset
  1034
unfolding One_nat_def
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1035
apply simp
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1036
apply (erule exE)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1037
apply (rule_tac x = "i+m" in exI, arith)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1038
done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1039
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1040
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1041
subsection{*Products and 1, by T. M. Rasmussen*}
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1042
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1043
lemma zabs_less_one_iff [simp]: "(\<bar>z\<bar> < 1) = (z = (0::int))"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1044
by arith
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1045
34055
fdf294ee08b2 streamlined proofs
paulson
parents: 33657
diff changeset
  1046
lemma abs_zmult_eq_1:
fdf294ee08b2 streamlined proofs
paulson
parents: 33657
diff changeset
  1047
  assumes mn: "\<bar>m * n\<bar> = 1"
fdf294ee08b2 streamlined proofs
paulson
parents: 33657
diff changeset
  1048
  shows "\<bar>m\<bar> = (1::int)"
fdf294ee08b2 streamlined proofs
paulson
parents: 33657
diff changeset
  1049
proof -
fdf294ee08b2 streamlined proofs
paulson
parents: 33657
diff changeset
  1050
  have 0: "m \<noteq> 0 & n \<noteq> 0" using mn
fdf294ee08b2 streamlined proofs
paulson
parents: 33657
diff changeset
  1051
    by auto
fdf294ee08b2 streamlined proofs
paulson
parents: 33657
diff changeset
  1052
  have "~ (2 \<le> \<bar>m\<bar>)"
fdf294ee08b2 streamlined proofs
paulson
parents: 33657
diff changeset
  1053
  proof
fdf294ee08b2 streamlined proofs
paulson
parents: 33657
diff changeset
  1054
    assume "2 \<le> \<bar>m\<bar>"
fdf294ee08b2 streamlined proofs
paulson
parents: 33657
diff changeset
  1055
    hence "2*\<bar>n\<bar> \<le> \<bar>m\<bar>*\<bar>n\<bar>"
fdf294ee08b2 streamlined proofs
paulson
parents: 33657
diff changeset
  1056
      by (simp add: mult_mono 0) 
fdf294ee08b2 streamlined proofs
paulson
parents: 33657
diff changeset
  1057
    also have "... = \<bar>m*n\<bar>" 
fdf294ee08b2 streamlined proofs
paulson
parents: 33657
diff changeset
  1058
      by (simp add: abs_mult)
fdf294ee08b2 streamlined proofs
paulson
parents: 33657
diff changeset
  1059
    also have "... = 1"
fdf294ee08b2 streamlined proofs
paulson
parents: 33657
diff changeset
  1060
      by (simp add: mn)
fdf294ee08b2 streamlined proofs
paulson
parents: 33657
diff changeset
  1061
    finally have "2*\<bar>n\<bar> \<le> 1" .
fdf294ee08b2 streamlined proofs
paulson
parents: 33657
diff changeset
  1062
    thus "False" using 0
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1063
      by arith
34055
fdf294ee08b2 streamlined proofs
paulson
parents: 33657
diff changeset
  1064
  qed
fdf294ee08b2 streamlined proofs
paulson
parents: 33657
diff changeset
  1065
  thus ?thesis using 0
fdf294ee08b2 streamlined proofs
paulson
parents: 33657
diff changeset
  1066
    by auto
fdf294ee08b2 streamlined proofs
paulson
parents: 33657
diff changeset
  1067
qed
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1068
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1069
lemma pos_zmult_eq_1_iff_lemma: "(m * n = 1) ==> m = (1::int) | m = -1"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1070
by (insert abs_zmult_eq_1 [of m n], arith)
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1071
35815
10e723e54076 tuned proofs (to avoid linarith error message caused by bootstrapping of HOL)
boehmes
parents: 35634
diff changeset
  1072
lemma pos_zmult_eq_1_iff:
10e723e54076 tuned proofs (to avoid linarith error message caused by bootstrapping of HOL)
boehmes
parents: 35634
diff changeset
  1073
  assumes "0 < (m::int)" shows "(m * n = 1) = (m = 1 & n = 1)"
10e723e54076 tuned proofs (to avoid linarith error message caused by bootstrapping of HOL)
boehmes
parents: 35634
diff changeset
  1074
proof -
10e723e54076 tuned proofs (to avoid linarith error message caused by bootstrapping of HOL)
boehmes
parents: 35634
diff changeset
  1075
  from assms have "m * n = 1 ==> m = 1" by (auto dest: pos_zmult_eq_1_iff_lemma)
10e723e54076 tuned proofs (to avoid linarith error message caused by bootstrapping of HOL)
boehmes
parents: 35634
diff changeset
  1076
  thus ?thesis by (auto dest: pos_zmult_eq_1_iff_lemma)
10e723e54076 tuned proofs (to avoid linarith error message caused by bootstrapping of HOL)
boehmes
parents: 35634
diff changeset
  1077
qed
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1078
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1079
lemma zmult_eq_1_iff: "(m*n = (1::int)) = ((m = 1 & n = 1) | (m = -1 & n = -1))"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1080
apply (rule iffI) 
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1081
 apply (frule pos_zmult_eq_1_iff_lemma)
57512
cc97b347b301 reduced name variants for assoc and commute on plus and mult
haftmann
parents: 56889
diff changeset
  1082
 apply (simp add: mult.commute [of m]) 
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1083
 apply (frule pos_zmult_eq_1_iff_lemma, auto) 
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1084
done
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1085
33296
a3924d1069e5 moved theory Divides after theory Nat_Numeral; tuned some proof texts
haftmann
parents: 33056
diff changeset
  1086
lemma infinite_UNIV_int: "\<not> finite (UNIV::int set)"
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1087
proof
33296
a3924d1069e5 moved theory Divides after theory Nat_Numeral; tuned some proof texts
haftmann
parents: 33056
diff changeset
  1088
  assume "finite (UNIV::int set)"
a3924d1069e5 moved theory Divides after theory Nat_Numeral; tuned some proof texts
haftmann
parents: 33056
diff changeset
  1089
  moreover have "inj (\<lambda>i\<Colon>int. 2 * i)"
a3924d1069e5 moved theory Divides after theory Nat_Numeral; tuned some proof texts
haftmann
parents: 33056
diff changeset
  1090
    by (rule injI) simp
a3924d1069e5 moved theory Divides after theory Nat_Numeral; tuned some proof texts
haftmann
parents: 33056
diff changeset
  1091
  ultimately have "surj (\<lambda>i\<Colon>int. 2 * i)"
a3924d1069e5 moved theory Divides after theory Nat_Numeral; tuned some proof texts
haftmann
parents: 33056
diff changeset
  1092
    by (rule finite_UNIV_inj_surj)
a3924d1069e5 moved theory Divides after theory Nat_Numeral; tuned some proof texts
haftmann
parents: 33056
diff changeset
  1093
  then obtain i :: int where "1 = 2 * i" by (rule surjE)
a3924d1069e5 moved theory Divides after theory Nat_Numeral; tuned some proof texts
haftmann
parents: 33056
diff changeset
  1094
  then show False by (simp add: pos_zmult_eq_1_iff)
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1095
qed
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1096
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
diff changeset
  1097
30652
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1098
subsection {* Further theorems on numerals *}
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1099
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1100
subsubsection{*Special Simplification for Constants*}
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1101
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1102
text{*These distributive laws move literals inside sums and differences.*}
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1103
49962
a8cc904a6820 Renamed {left,right}_distrib to distrib_{right,left}.
webertj
parents: 48891
diff changeset
  1104
lemmas distrib_right_numeral [simp] = distrib_right [of _ _ "numeral v"] for v
a8cc904a6820 Renamed {left,right}_distrib to distrib_{right,left}.
webertj
parents: 48891
diff changeset
  1105
lemmas distrib_left_numeral [simp] = distrib_left [of "numeral v"] for v
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1106
lemmas left_diff_distrib_numeral [simp] = left_diff_distrib [of _ _ "numeral v"] for v
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1107
lemmas right_diff_distrib_numeral [simp] = right_diff_distrib [of "numeral v"] for v
30652
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1108
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1109
text{*These are actually for fields, like real: but where else to put them?*}
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1110
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1111
lemmas zero_less_divide_iff_numeral [simp, no_atp] = zero_less_divide_iff [of "numeral w"] for w
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1112
lemmas divide_less_0_iff_numeral [simp, no_atp] = divide_less_0_iff [of "numeral w"] for w
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1113
lemmas zero_le_divide_iff_numeral [simp, no_atp] = zero_le_divide_iff [of "numeral w"] for w
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1114
lemmas divide_le_0_iff_numeral [simp, no_atp] = divide_le_0_iff [of "numeral w"] for w
30652
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1115
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1116
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1117
text {*Replaces @{text "inverse #nn"} by @{text "1/#nn"}.  It looks
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1118
  strange, but then other simprocs simplify the quotient.*}
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1119
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1120
lemmas inverse_eq_divide_numeral [simp] =
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1121
  inverse_eq_divide [of "numeral w"] for w
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1122
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1123
lemmas inverse_eq_divide_neg_numeral [simp] =
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1124
  inverse_eq_divide [of "- numeral w"] for w
30652
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1125
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1126
text {*These laws simplify inequalities, moving unary minus from a term
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1127
into the literal.*}
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1128
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1129
lemmas equation_minus_iff_numeral [no_atp] =
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1130
  equation_minus_iff [of "numeral v"] for v
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1131
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1132
lemmas minus_equation_iff_numeral [no_atp] =
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1133
  minus_equation_iff [of _ "numeral v"] for v
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1134
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1135
lemmas le_minus_iff_numeral [no_atp] =
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1136
  le_minus_iff [of "numeral v"] for v
30652
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1137
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1138
lemmas minus_le_iff_numeral [no_atp] =
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1139
  minus_le_iff [of _ "numeral v"] for v
30652
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1140
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1141
lemmas less_minus_iff_numeral [no_atp] =
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1142
  less_minus_iff [of "numeral v"] for v
30652
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1143
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1144
lemmas minus_less_iff_numeral [no_atp] =
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1145
  minus_less_iff [of _ "numeral v"] for v
30652
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1146
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1147
-- {* FIXME maybe simproc *}
30652
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1148
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1149
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1150
text {*Cancellation of constant factors in comparisons (@{text "<"} and @{text "\<le>"}) *}
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1151
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1152
lemmas mult_less_cancel_left_numeral [simp, no_atp] = mult_less_cancel_left [of "numeral v"] for v
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1153
lemmas mult_less_cancel_right_numeral [simp, no_atp] = mult_less_cancel_right [of _ "numeral v"] for v
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1154
lemmas mult_le_cancel_left_numeral [simp, no_atp] = mult_le_cancel_left [of "numeral v"] for v
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1155
lemmas mult_le_cancel_right_numeral [simp, no_atp] = mult_le_cancel_right [of _ "numeral v"] for v
30652
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1156
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1157
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1158
text {*Multiplying out constant divisors in comparisons (@{text "<"}, @{text "\<le>"} and @{text "="}) *}
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1159
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1160
lemmas le_divide_eq_numeral1 [simp] =
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1161
  pos_le_divide_eq [of "numeral w", OF zero_less_numeral]
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1162
  neg_le_divide_eq [of "- numeral w", OF neg_numeral_less_zero] for w
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1163
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1164
lemmas divide_le_eq_numeral1 [simp] =
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1165
  pos_divide_le_eq [of "numeral w", OF zero_less_numeral]
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1166
  neg_divide_le_eq [of "- numeral w", OF neg_numeral_less_zero] for w
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1167
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1168
lemmas less_divide_eq_numeral1 [simp] =
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1169
  pos_less_divide_eq [of "numeral w", OF zero_less_numeral]
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1170
  neg_less_divide_eq [of "- numeral w", OF neg_numeral_less_zero] for w
30652
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1171
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1172
lemmas divide_less_eq_numeral1 [simp] =
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1173
  pos_divide_less_eq [of "numeral w", OF zero_less_numeral]
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1174
  neg_divide_less_eq [of "- numeral w", OF neg_numeral_less_zero] for w
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1175
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1176
lemmas eq_divide_eq_numeral1 [simp] =
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1177
  eq_divide_eq [of _ _ "numeral w"]
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1178
  eq_divide_eq [of _ _ "- numeral w"] for w
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1179
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1180
lemmas divide_eq_eq_numeral1 [simp] =
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1181
  divide_eq_eq [of _ "numeral w"]
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1182
  divide_eq_eq [of _ "- numeral w"] for w
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1183
30652
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1184
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1185
subsubsection{*Optional Simplification Rules Involving Constants*}
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1186
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1187
text{*Simplify quotients that are compared with a literal constant.*}
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1188
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1189
lemmas le_divide_eq_numeral =
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1190
  le_divide_eq [of "numeral w"]
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1191
  le_divide_eq [of "- numeral w"] for w
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1192
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1193
lemmas divide_le_eq_numeral =
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1194
  divide_le_eq [of _ _ "numeral w"]
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1195
  divide_le_eq [of _ _ "- numeral w"] for w
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1196
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1197
lemmas less_divide_eq_numeral =
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1198
  less_divide_eq [of "numeral w"]
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1199
  less_divide_eq [of "- numeral w"] for w
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1200
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1201
lemmas divide_less_eq_numeral =
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1202
  divide_less_eq [of _ _ "numeral w"]
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1203
  divide_less_eq [of _ _ "- numeral w"] for w
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1204
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1205
lemmas eq_divide_eq_numeral =
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1206
  eq_divide_eq [of "numeral w"]
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1207
  eq_divide_eq [of "- numeral w"] for w
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1208
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1209
lemmas divide_eq_eq_numeral =
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1210
  divide_eq_eq [of _ _ "numeral w"]
54489
03ff4d1e6784 eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents: 54249
diff changeset
  1211
  divide_eq_eq [of _ _ "- numeral w"] for w
30652
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1212
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1213
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1214
text{*Not good as automatic simprules because they cause case splits.*}
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1215
lemmas divide_const_simps =
47108
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1216
  le_divide_eq_numeral divide_le_eq_numeral less_divide_eq_numeral
2a1953f0d20d merged fork with new numeral representation (see NEWS)
huffman
parents: 46756
diff changeset
  1217
  divide_less_eq_numeral eq_divide_eq_numeral divide_eq_eq_numeral
30652
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1218
  le_divide_eq_1 divide_le_eq_1 less_divide_eq_1 divide_less_eq_1
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1219
752329615264 distributed contents of theory Arith_Tools to theories Int, IntDiv and NatBin accordingly
haftmann
parents: 30496
diff changeset
  1220
33320
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1221
subsection {* The divides relation *}
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1222
33657
a4179bf442d1 renamed lemmas "anti_sym" -> "antisym"
nipkow
parents: 33523
diff changeset
  1223
lemma zdvd_antisym_nonneg:
a4179bf442d1 renamed lemmas "anti_sym" -> "antisym"
nipkow
parents: 33523
diff changeset
  1224
    "0 <= m ==> 0 <= n ==> m dvd n ==> n dvd m ==> m = (n::int)"
33320
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1225
  apply (simp add: dvd_def, auto)
57512
cc97b347b301 reduced name variants for assoc and commute on plus and mult
haftmann
parents: 56889
diff changeset
  1226
  apply (auto simp add: mult.assoc zero_le_mult_iff zmult_eq_1_iff)
33320
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1227
  done
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1228
33657
a4179bf442d1 renamed lemmas "anti_sym" -> "antisym"
nipkow
parents: 33523
diff changeset
  1229
lemma zdvd_antisym_abs: assumes "(a::int) dvd b" and "b dvd a" 
33320
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1230
  shows "\<bar>a\<bar> = \<bar>b\<bar>"
33657
a4179bf442d1 renamed lemmas "anti_sym" -> "antisym"
nipkow
parents: 33523
diff changeset
  1231
proof cases
a4179bf442d1 renamed lemmas "anti_sym" -> "antisym"
nipkow
parents: 33523
diff changeset
  1232
  assume "a = 0" with assms show ?thesis by simp
a4179bf442d1 renamed lemmas "anti_sym" -> "antisym"
nipkow
parents: 33523
diff changeset
  1233
next
a4179bf442d1 renamed lemmas "anti_sym" -> "antisym"
nipkow
parents: 33523
diff changeset
  1234
  assume "a \<noteq> 0"
33320
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1235
  from `a dvd b` obtain k where k:"b = a*k" unfolding dvd_def by blast 
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1236
  from `b dvd a` obtain k' where k':"a = b*k'" unfolding dvd_def by blast 
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1237
  from k k' have "a = a*k*k'" by simp
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1238
  with mult_cancel_left1[where c="a" and b="k*k'"]
57512
cc97b347b301 reduced name variants for assoc and commute on plus and mult
haftmann
parents: 56889
diff changeset
  1239
  have kk':"k*k' = 1" using `a\<noteq>0` by (simp add: mult.assoc)
33320
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1240
  hence "k = 1 \<and> k' = 1 \<or> k = -1 \<and> k' = -1" by (simp add: zmult_eq_1_iff)
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1241
  thus ?thesis using k k' by auto
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1242
qed
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1243
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1244
lemma zdvd_zdiffD: "k dvd m - n ==> k dvd n ==> k dvd (m::int)"
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1245
  apply (subgoal_tac "m = n + (m - n)")
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1246
   apply (erule ssubst)
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1247
   apply (blast intro: dvd_add, simp)
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1248
  done
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1249
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1250
lemma zdvd_reduce: "(k dvd n + k * m) = (k dvd (n::int))"
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1251
apply (rule iffI)
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1252
 apply (erule_tac [2] dvd_add)
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1253
 apply (subgoal_tac "n = (n + k * m) - k * m")
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1254
  apply (erule ssubst)
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1255
  apply (erule dvd_diff)
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1256
  apply(simp_all)
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1257
done
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1258
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1259
lemma dvd_imp_le_int:
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1260
  fixes d i :: int
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1261
  assumes "i \<noteq> 0" and "d dvd i"
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1262
  shows "\<bar>d\<bar> \<le> \<bar>i\<bar>"
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1263
proof -
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1264
  from `d dvd i` obtain k where "i = d * k" ..
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1265
  with `i \<noteq> 0` have "k \<noteq> 0" by auto
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1266
  then have "1 \<le> \<bar>k\<bar>" and "0 \<le> \<bar>d\<bar>" by auto
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1267
  then have "\<bar>d\<bar> * 1 \<le> \<bar>d\<bar> * \<bar>k\<bar>" by (rule mult_left_mono)
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1268
  with `i = d * k` show ?thesis by (simp add: abs_mult)
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1269
qed
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1270
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1271
lemma zdvd_not_zless:
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1272
  fixes m n :: int
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1273
  assumes "0 < m" and "m < n"
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1274
  shows "\<not> n dvd m"
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1275
proof
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1276
  from assms have "0 < n" by auto
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1277
  assume "n dvd m" then obtain k where k: "m = n * k" ..
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1278
  with `0 < m` have "0 < n * k" by auto
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1279
  with `0 < n` have "0 < k" by (simp add: zero_less_mult_iff)
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1280
  with k `0 < n` `m < n` have "n * k < n * 1" by simp
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1281
  with `0 < n` `0 < k` show False unfolding mult_less_cancel_left by auto
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1282
qed
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1283
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1284
lemma zdvd_mult_cancel: assumes d:"k * m dvd k * n" and kz:"k \<noteq> (0::int)"
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1285
  shows "m dvd n"
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1286
proof-
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1287
  from d obtain h where h: "k*n = k*m * h" unfolding dvd_def by blast
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1288
  {assume "n \<noteq> m*h" hence "k* n \<noteq> k* (m*h)" using kz by simp
57512
cc97b347b301 reduced name variants for assoc and commute on plus and mult
haftmann
parents: 56889
diff changeset
  1289
    with h have False by (simp add: mult.assoc)}
33320
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1290
  hence "n = m * h" by blast
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1291
  thus ?thesis by simp
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1292
qed
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1293
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1294
theorem zdvd_int: "(x dvd y) = (int x dvd int y)"
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1295
proof -
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1296
  have "\<And>k. int y = int x * k \<Longrightarrow> x dvd y"
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1297
  proof -
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1298
    fix k
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1299
    assume A: "int y = int x * k"
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
  1300
    then show "x dvd y"
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
  1301
    proof (cases k)
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
  1302
      case (nonneg n)
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
  1303
      with A have "y = x * n" by (simp add: of_nat_mult [symmetric])
33320
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1304
      then show ?thesis ..
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1305
    next
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
  1306
      case (neg n)
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
  1307
      with A have "int y = int x * (- int (Suc n))" by simp
33320
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1308
      also have "\<dots> = - (int x * int (Suc n))" by (simp only: mult_minus_right)
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1309
      also have "\<dots> = - int (x * Suc n)" by (simp only: of_nat_mult [symmetric])
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1310
      finally have "- int (x * Suc n) = int y" ..
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1311
      then show ?thesis by (simp only: negative_eq_positive) auto
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1312
    qed
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1313
  qed
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1314
  then show ?thesis by (auto elim!: dvdE simp only: dvd_triv_left of_nat_mult)
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1315
qed
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1316
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
  1317
lemma zdvd1_eq[simp]: "(x::int) dvd 1 = (\<bar>x\<bar> = 1)"
33320
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1318
proof
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1319
  assume d: "x dvd 1" hence "int (nat \<bar>x\<bar>) dvd int (nat 1)" by simp
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1320
  hence "nat \<bar>x\<bar> dvd 1" by (simp add: zdvd_int)
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1321
  hence "nat \<bar>x\<bar> = 1"  by simp
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
  1322
  thus "\<bar>x\<bar> = 1" by (cases "x < 0") auto
33320
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1323
next
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1324
  assume "\<bar>x\<bar>=1"
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1325
  then have "x = 1 \<or> x = -1" by auto
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1326
  then show "x dvd 1" by (auto intro: dvdI)
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1327
qed
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1328
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1329
lemma zdvd_mult_cancel1: 
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1330
  assumes mp:"m \<noteq>(0::int)" shows "(m * n dvd m) = (\<bar>n\<bar> = 1)"
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1331
proof
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1332
  assume n1: "\<bar>n\<bar> = 1" thus "m * n dvd m" 
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
  1333
    by (cases "n >0") (auto simp add: minus_equation_iff)
33320
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1334
next
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1335
  assume H: "m * n dvd m" hence H2: "m * n dvd m * 1" by simp
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1336
  from zdvd_mult_cancel[OF H2 mp] show "\<bar>n\<bar> = 1" by (simp only: zdvd1_eq)
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1337
qed
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1338
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1339
lemma int_dvd_iff: "(int m dvd z) = (m dvd nat (abs z))"
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1340
  unfolding zdvd_int by (cases "z \<ge> 0") simp_all
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1341
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1342
lemma dvd_int_iff: "(z dvd int m) = (nat (abs z) dvd m)"
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1343
  unfolding zdvd_int by (cases "z \<ge> 0") simp_all
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1344
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1345
lemma nat_dvd_iff: "(nat z dvd m) = (if 0 \<le> z then (z dvd int m) else m = 0)"
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1346
  by (auto simp add: dvd_int_iff)
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1347
33341
5a989586d102 moved some dvd [int] facts to Int
haftmann
parents: 33320
diff changeset
  1348
lemma eq_nat_nat_iff:
5a989586d102 moved some dvd [int] facts to Int
haftmann
parents: 33320
diff changeset
  1349
  "0 \<le> z \<Longrightarrow> 0 \<le> z' \<Longrightarrow> nat z = nat z' \<longleftrightarrow> z = z'"
5a989586d102 moved some dvd [int] facts to Int
haftmann
parents: 33320
diff changeset
  1350
  by (auto elim!: nonneg_eq_int)
5a989586d102 moved some dvd [int] facts to Int
haftmann
parents: 33320
diff changeset
  1351
5a989586d102 moved some dvd [int] facts to Int
haftmann
parents: 33320
diff changeset
  1352
lemma nat_power_eq:
5a989586d102 moved some dvd [int] facts to Int
haftmann
parents: 33320
diff changeset
  1353
  "0 \<le> z \<Longrightarrow> nat (z ^ n) = nat z ^ n"
5a989586d102 moved some dvd [int] facts to Int
haftmann
parents: 33320
diff changeset
  1354
  by (induct n) (simp_all add: nat_mult_distrib)
5a989586d102 moved some dvd [int] facts to Int
haftmann
parents: 33320
diff changeset
  1355
33320
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1356
lemma zdvd_imp_le: "[| z dvd n; 0 < n |] ==> z \<le> (n::int)"
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
  1357
  apply (cases n)
33320
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1358
  apply (auto simp add: dvd_int_iff)
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
  1359
  apply (cases z)
33320
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1360
  apply (auto simp add: dvd_imp_le)
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1361
  done
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1362
36749
a8dc19a352e6 moved lemma zdvd_period to theory Int
haftmann
parents: 36719
diff changeset
  1363
lemma zdvd_period:
a8dc19a352e6 moved lemma zdvd_period to theory Int
haftmann
parents: 36719
diff changeset
  1364
  fixes a d :: int
a8dc19a352e6 moved lemma zdvd_period to theory Int
haftmann
parents: 36719
diff changeset
  1365
  assumes "a dvd d"
a8dc19a352e6 moved lemma zdvd_period to theory Int
haftmann
parents: 36719
diff changeset
  1366
  shows "a dvd (x + t) \<longleftrightarrow> a dvd ((x + c * d) + t)"
a8dc19a352e6 moved lemma zdvd_period to theory Int
haftmann
parents: 36719
diff changeset
  1367
proof -
a8dc19a352e6 moved lemma zdvd_period to theory Int
haftmann
parents: 36719
diff changeset
  1368
  from assms obtain k where "d = a * k" by (rule dvdE)
42676
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
  1369
  show ?thesis
8724f20bf69c proper case_names for int_cases, int_of_nat_induct;
wenzelm
parents: 42411
diff changeset
  1370
  proof
36749
a8dc19a352e6 moved lemma zdvd_period to theory Int
haftmann
parents: 36719
diff changeset
  1371
    assume "a dvd (x + t)"
a8dc19a352e6 moved lemma zdvd_period to theory Int
haftmann
parents: 36719
diff changeset
  1372
    then obtain l where "x + t = a * l" by (rule dvdE)
a8dc19a352e6 moved lemma zdvd_period to theory Int
haftmann
parents: 36719
diff changeset
  1373
    then have "x = a * l - t" by simp
a8dc19a352e6 moved lemma zdvd_period to theory Int
haftmann
parents: 36719
diff changeset
  1374
    with `d = a * k` show "a dvd x + c * d + t" by simp
a8dc19a352e6 moved lemma zdvd_period to theory Int
haftmann
parents: 36719
diff changeset
  1375
  next
a8dc19a352e6 moved lemma zdvd_period to theory Int
haftmann
parents: 36719
diff changeset
  1376
    assume "a dvd x + c * d + t"
a8dc19a352e6 moved lemma zdvd_period to theory Int
haftmann
parents: 36719
diff changeset
  1377
    then obtain l where "x + c * d + t = a * l" by (rule dvdE)
a8dc19a352e6 moved lemma zdvd_period to theory Int
haftmann
parents: 36719
diff changeset
  1378
    then have "x = a * l - c * d - t" by simp
a8dc19a352e6 moved lemma zdvd_period to theory Int
haftmann
parents: 36719
diff changeset
  1379
    with `d = a * k` show "a dvd (x + t)" by simp
a8dc19a352e6 moved lemma zdvd_period to theory Int
haftmann
parents: 36719
diff changeset
  1380
  qed
a8dc19a352e6 moved lemma zdvd_period to theory Int
haftmann
parents: 36719
diff changeset
  1381
qed
a8dc19a352e6 moved lemma zdvd_period to theory Int
haftmann
parents: 36719
diff changeset
  1382
33320
73998ef6ea91 moved some dvd [int] facts to Int
haftmann
parents: 33296
diff changeset
  1383
46756
faf62905cd53 adding finiteness of intervals on integer sets; adding another finiteness theorem for multisets
bulwahn
parents: 46027
diff changeset
  1384
subsection {* Finiteness of intervals *}
faf62905cd53 adding finiteness of intervals on integer sets; adding another finiteness theorem for multisets
bulwahn
parents: 46027
diff changeset
  1385
faf62905cd53 adding finiteness of intervals on integer sets; adding another finiteness theorem for multisets
bulwahn
parents: