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