author | paulson |
Wed, 11 Jan 2006 10:59:55 +0100 | |
changeset 18648 | 22f96cd085d5 |
parent 17702 | ea88ddeafabe |
child 18702 | 7dc7dcd63224 |
permissions | -rw-r--r-- |
923 | 1 |
(* Title: HOL/Nat.thy |
2 |
ID: $Id$ |
|
9436
62bb04ab4b01
rearranged setup of arithmetic procedures, avoiding global reference values;
wenzelm
parents:
7702
diff
changeset
|
3 |
Author: Tobias Nipkow and Lawrence C Paulson |
923 | 4 |
|
9436
62bb04ab4b01
rearranged setup of arithmetic procedures, avoiding global reference values;
wenzelm
parents:
7702
diff
changeset
|
5 |
Type "nat" is a linear order, and a datatype; arithmetic operators + - |
62bb04ab4b01
rearranged setup of arithmetic procedures, avoiding global reference values;
wenzelm
parents:
7702
diff
changeset
|
6 |
and * (for div, mod and dvd, see theory Divides). |
923 | 7 |
*) |
8 |
||
13449 | 9 |
header {* Natural numbers *} |
10 |
||
15131 | 11 |
theory Nat |
15140 | 12 |
imports Wellfounded_Recursion Ring_and_Field |
15131 | 13 |
begin |
13449 | 14 |
|
15 |
subsection {* Type @{text ind} *} |
|
16 |
||
17 |
typedecl ind |
|
18 |
||
19 |
consts |
|
20 |
Zero_Rep :: ind |
|
21 |
Suc_Rep :: "ind => ind" |
|
22 |
||
23 |
axioms |
|
24 |
-- {* the axiom of infinity in 2 parts *} |
|
25 |
inj_Suc_Rep: "inj Suc_Rep" |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
26 |
Suc_Rep_not_Zero_Rep: "Suc_Rep x \<noteq> Zero_Rep" |
17702 | 27 |
finalconsts |
28 |
Zero_Rep |
|
29 |
Suc_Rep |
|
13449 | 30 |
|
31 |
subsection {* Type nat *} |
|
32 |
||
33 |
text {* Type definition *} |
|
34 |
||
35 |
consts |
|
36 |
Nat :: "ind set" |
|
37 |
||
38 |
inductive Nat |
|
39 |
intros |
|
40 |
Zero_RepI: "Zero_Rep : Nat" |
|
41 |
Suc_RepI: "i : Nat ==> Suc_Rep i : Nat" |
|
42 |
||
43 |
global |
|
44 |
||
45 |
typedef (open Nat) |
|
14208 | 46 |
nat = Nat by (rule exI, rule Nat.Zero_RepI) |
13449 | 47 |
|
14691 | 48 |
instance nat :: "{ord, zero, one}" .. |
13449 | 49 |
|
50 |
||
51 |
text {* Abstract constants and syntax *} |
|
52 |
||
53 |
consts |
|
54 |
Suc :: "nat => nat" |
|
55 |
pred_nat :: "(nat * nat) set" |
|
56 |
||
57 |
local |
|
58 |
||
59 |
defs |
|
60 |
Zero_nat_def: "0 == Abs_Nat Zero_Rep" |
|
18648 | 61 |
Suc_def: "Suc == (%n. Abs_Nat (Suc_Rep (Rep_Nat n)))" |
62 |
One_nat_def: "1 == Suc 0" |
|
13449 | 63 |
|
64 |
-- {* nat operations *} |
|
65 |
pred_nat_def: "pred_nat == {(m, n). n = Suc m}" |
|
66 |
||
67 |
less_def: "m < n == (m, n) : trancl pred_nat" |
|
68 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
69 |
le_def: "m \<le> (n::nat) == ~ (n < m)" |
13449 | 70 |
|
18648 | 71 |
declare One_nat_def [simp] |
72 |
||
13449 | 73 |
|
74 |
text {* Induction *} |
|
923 | 75 |
|
13449 | 76 |
theorem nat_induct: "P 0 ==> (!!n. P n ==> P (Suc n)) ==> P n" |
77 |
apply (unfold Zero_nat_def Suc_def) |
|
78 |
apply (rule Rep_Nat_inverse [THEN subst]) -- {* types force good instantiation *} |
|
79 |
apply (erule Rep_Nat [THEN Nat.induct]) |
|
17589 | 80 |
apply (iprover elim: Abs_Nat_inverse [THEN subst]) |
13449 | 81 |
done |
82 |
||
83 |
text {* Distinctness of constructors *} |
|
84 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
85 |
lemma Suc_not_Zero [iff]: "Suc m \<noteq> 0" |
15413 | 86 |
by (simp add: Zero_nat_def Suc_def Abs_Nat_inject Rep_Nat Suc_RepI Zero_RepI |
87 |
Suc_Rep_not_Zero_Rep) |
|
13449 | 88 |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
89 |
lemma Zero_not_Suc [iff]: "0 \<noteq> Suc m" |
13449 | 90 |
by (rule not_sym, rule Suc_not_Zero not_sym) |
91 |
||
92 |
lemma Suc_neq_Zero: "Suc m = 0 ==> R" |
|
93 |
by (rule notE, rule Suc_not_Zero) |
|
94 |
||
95 |
lemma Zero_neq_Suc: "0 = Suc m ==> R" |
|
96 |
by (rule Suc_neq_Zero, erule sym) |
|
97 |
||
98 |
text {* Injectiveness of @{term Suc} *} |
|
99 |
||
16733
236dfafbeb63
linear arithmetic now takes "&" in assumptions apart.
nipkow
parents:
16635
diff
changeset
|
100 |
lemma inj_Suc[simp]: "inj_on Suc N" |
15413 | 101 |
by (simp add: Suc_def inj_on_def Abs_Nat_inject Rep_Nat Suc_RepI |
102 |
inj_Suc_Rep [THEN inj_eq] Rep_Nat_inject) |
|
13449 | 103 |
|
104 |
lemma Suc_inject: "Suc x = Suc y ==> x = y" |
|
105 |
by (rule inj_Suc [THEN injD]) |
|
106 |
||
107 |
lemma Suc_Suc_eq [iff]: "(Suc m = Suc n) = (m = n)" |
|
15413 | 108 |
by (rule inj_Suc [THEN inj_eq]) |
13449 | 109 |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
110 |
lemma nat_not_singleton: "(\<forall>x. x = (0::nat)) = False" |
13449 | 111 |
by auto |
112 |
||
113 |
text {* @{typ nat} is a datatype *} |
|
9436
62bb04ab4b01
rearranged setup of arithmetic procedures, avoiding global reference values;
wenzelm
parents:
7702
diff
changeset
|
114 |
|
5188
633ec5f6c155
Declaration of type 'nat' as a datatype (this allows usage of
berghofe
parents:
4640
diff
changeset
|
115 |
rep_datatype nat |
13449 | 116 |
distinct Suc_not_Zero Zero_not_Suc |
117 |
inject Suc_Suc_eq |
|
118 |
induction nat_induct |
|
119 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
120 |
lemma n_not_Suc_n: "n \<noteq> Suc n" |
13449 | 121 |
by (induct n) simp_all |
122 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
123 |
lemma Suc_n_not_n: "Suc t \<noteq> t" |
13449 | 124 |
by (rule not_sym, rule n_not_Suc_n) |
125 |
||
126 |
text {* A special form of induction for reasoning |
|
127 |
about @{term "m < n"} and @{term "m - n"} *} |
|
128 |
||
129 |
theorem diff_induct: "(!!x. P x 0) ==> (!!y. P 0 (Suc y)) ==> |
|
130 |
(!!x y. P x y ==> P (Suc x) (Suc y)) ==> P m n" |
|
14208 | 131 |
apply (rule_tac x = m in spec) |
15251 | 132 |
apply (induct n) |
13449 | 133 |
prefer 2 |
134 |
apply (rule allI) |
|
17589 | 135 |
apply (induct_tac x, iprover+) |
13449 | 136 |
done |
137 |
||
138 |
subsection {* Basic properties of "less than" *} |
|
139 |
||
140 |
lemma wf_pred_nat: "wf pred_nat" |
|
14208 | 141 |
apply (unfold wf_def pred_nat_def, clarify) |
142 |
apply (induct_tac x, blast+) |
|
13449 | 143 |
done |
144 |
||
145 |
lemma wf_less: "wf {(x, y::nat). x < y}" |
|
146 |
apply (unfold less_def) |
|
14208 | 147 |
apply (rule wf_pred_nat [THEN wf_trancl, THEN wf_subset], blast) |
13449 | 148 |
done |
149 |
||
150 |
lemma less_eq: "((m, n) : pred_nat^+) = (m < n)" |
|
151 |
apply (unfold less_def) |
|
152 |
apply (rule refl) |
|
153 |
done |
|
154 |
||
155 |
subsubsection {* Introduction properties *} |
|
156 |
||
157 |
lemma less_trans: "i < j ==> j < k ==> i < (k::nat)" |
|
158 |
apply (unfold less_def) |
|
14208 | 159 |
apply (rule trans_trancl [THEN transD], assumption+) |
13449 | 160 |
done |
161 |
||
162 |
lemma lessI [iff]: "n < Suc n" |
|
163 |
apply (unfold less_def pred_nat_def) |
|
164 |
apply (simp add: r_into_trancl) |
|
165 |
done |
|
166 |
||
167 |
lemma less_SucI: "i < j ==> i < Suc j" |
|
14208 | 168 |
apply (rule less_trans, assumption) |
13449 | 169 |
apply (rule lessI) |
170 |
done |
|
171 |
||
172 |
lemma zero_less_Suc [iff]: "0 < Suc n" |
|
173 |
apply (induct n) |
|
174 |
apply (rule lessI) |
|
175 |
apply (erule less_trans) |
|
176 |
apply (rule lessI) |
|
177 |
done |
|
178 |
||
179 |
subsubsection {* Elimination properties *} |
|
180 |
||
181 |
lemma less_not_sym: "n < m ==> ~ m < (n::nat)" |
|
182 |
apply (unfold less_def) |
|
183 |
apply (blast intro: wf_pred_nat wf_trancl [THEN wf_asym]) |
|
184 |
done |
|
185 |
||
186 |
lemma less_asym: |
|
187 |
assumes h1: "(n::nat) < m" and h2: "~ P ==> m < n" shows P |
|
188 |
apply (rule contrapos_np) |
|
189 |
apply (rule less_not_sym) |
|
190 |
apply (rule h1) |
|
191 |
apply (erule h2) |
|
192 |
done |
|
193 |
||
194 |
lemma less_not_refl: "~ n < (n::nat)" |
|
195 |
apply (unfold less_def) |
|
196 |
apply (rule wf_pred_nat [THEN wf_trancl, THEN wf_not_refl]) |
|
197 |
done |
|
198 |
||
199 |
lemma less_irrefl [elim!]: "(n::nat) < n ==> R" |
|
200 |
by (rule notE, rule less_not_refl) |
|
201 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
202 |
lemma less_not_refl2: "n < m ==> m \<noteq> (n::nat)" by blast |
13449 | 203 |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
204 |
lemma less_not_refl3: "(s::nat) < t ==> s \<noteq> t" |
13449 | 205 |
by (rule not_sym, rule less_not_refl2) |
206 |
||
207 |
lemma lessE: |
|
208 |
assumes major: "i < k" |
|
209 |
and p1: "k = Suc i ==> P" and p2: "!!j. i < j ==> k = Suc j ==> P" |
|
210 |
shows P |
|
14208 | 211 |
apply (rule major [unfolded less_def pred_nat_def, THEN tranclE], simp_all) |
13449 | 212 |
apply (erule p1) |
213 |
apply (rule p2) |
|
14208 | 214 |
apply (simp add: less_def pred_nat_def, assumption) |
13449 | 215 |
done |
216 |
||
217 |
lemma not_less0 [iff]: "~ n < (0::nat)" |
|
218 |
by (blast elim: lessE) |
|
219 |
||
220 |
lemma less_zeroE: "(n::nat) < 0 ==> R" |
|
221 |
by (rule notE, rule not_less0) |
|
222 |
||
223 |
lemma less_SucE: assumes major: "m < Suc n" |
|
224 |
and less: "m < n ==> P" and eq: "m = n ==> P" shows P |
|
225 |
apply (rule major [THEN lessE]) |
|
14208 | 226 |
apply (rule eq, blast) |
227 |
apply (rule less, blast) |
|
13449 | 228 |
done |
229 |
||
230 |
lemma less_Suc_eq: "(m < Suc n) = (m < n | m = n)" |
|
231 |
by (blast elim!: less_SucE intro: less_trans) |
|
232 |
||
233 |
lemma less_one [iff]: "(n < (1::nat)) = (n = 0)" |
|
234 |
by (simp add: less_Suc_eq) |
|
235 |
||
236 |
lemma less_Suc0 [iff]: "(n < Suc 0) = (n = 0)" |
|
237 |
by (simp add: less_Suc_eq) |
|
238 |
||
239 |
lemma Suc_mono: "m < n ==> Suc m < Suc n" |
|
240 |
by (induct n) (fast elim: less_trans lessE)+ |
|
241 |
||
242 |
text {* "Less than" is a linear ordering *} |
|
243 |
lemma less_linear: "m < n | m = n | n < (m::nat)" |
|
15251 | 244 |
apply (induct m) |
245 |
apply (induct n) |
|
13449 | 246 |
apply (rule refl [THEN disjI1, THEN disjI2]) |
247 |
apply (rule zero_less_Suc [THEN disjI1]) |
|
248 |
apply (blast intro: Suc_mono less_SucI elim: lessE) |
|
249 |
done |
|
250 |
||
14302 | 251 |
text {* "Less than" is antisymmetric, sort of *} |
252 |
lemma less_antisym: "\<lbrakk> \<not> n < m; n < Suc m \<rbrakk> \<Longrightarrow> m = n" |
|
253 |
apply(simp only:less_Suc_eq) |
|
254 |
apply blast |
|
255 |
done |
|
256 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
257 |
lemma nat_neq_iff: "((m::nat) \<noteq> n) = (m < n | n < m)" |
13449 | 258 |
using less_linear by blast |
259 |
||
260 |
lemma nat_less_cases: assumes major: "(m::nat) < n ==> P n m" |
|
261 |
and eqCase: "m = n ==> P n m" and lessCase: "n<m ==> P n m" |
|
262 |
shows "P n m" |
|
263 |
apply (rule less_linear [THEN disjE]) |
|
264 |
apply (erule_tac [2] disjE) |
|
265 |
apply (erule lessCase) |
|
266 |
apply (erule sym [THEN eqCase]) |
|
267 |
apply (erule major) |
|
268 |
done |
|
269 |
||
270 |
||
271 |
subsubsection {* Inductive (?) properties *} |
|
272 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
273 |
lemma Suc_lessI: "m < n ==> Suc m \<noteq> n ==> Suc m < n" |
13449 | 274 |
apply (simp add: nat_neq_iff) |
275 |
apply (blast elim!: less_irrefl less_SucE elim: less_asym) |
|
276 |
done |
|
277 |
||
278 |
lemma Suc_lessD: "Suc m < n ==> m < n" |
|
279 |
apply (induct n) |
|
280 |
apply (fast intro!: lessI [THEN less_SucI] elim: less_trans lessE)+ |
|
281 |
done |
|
282 |
||
283 |
lemma Suc_lessE: assumes major: "Suc i < k" |
|
284 |
and minor: "!!j. i < j ==> k = Suc j ==> P" shows P |
|
285 |
apply (rule major [THEN lessE]) |
|
286 |
apply (erule lessI [THEN minor]) |
|
14208 | 287 |
apply (erule Suc_lessD [THEN minor], assumption) |
13449 | 288 |
done |
289 |
||
290 |
lemma Suc_less_SucD: "Suc m < Suc n ==> m < n" |
|
291 |
by (blast elim: lessE dest: Suc_lessD) |
|
4104 | 292 |
|
16635 | 293 |
lemma Suc_less_eq [iff, code]: "(Suc m < Suc n) = (m < n)" |
13449 | 294 |
apply (rule iffI) |
295 |
apply (erule Suc_less_SucD) |
|
296 |
apply (erule Suc_mono) |
|
297 |
done |
|
298 |
||
299 |
lemma less_trans_Suc: |
|
300 |
assumes le: "i < j" shows "j < k ==> Suc i < k" |
|
14208 | 301 |
apply (induct k, simp_all) |
13449 | 302 |
apply (insert le) |
303 |
apply (simp add: less_Suc_eq) |
|
304 |
apply (blast dest: Suc_lessD) |
|
305 |
done |
|
306 |
||
16635 | 307 |
lemma [code]: "((n::nat) < 0) = False" by simp |
308 |
lemma [code]: "(0 < Suc n) = True" by simp |
|
309 |
||
13449 | 310 |
text {* Can be used with @{text less_Suc_eq} to get @{term "n = m | n < m"} *} |
311 |
lemma not_less_eq: "(~ m < n) = (n < Suc m)" |
|
14208 | 312 |
by (rule_tac m = m and n = n in diff_induct, simp_all) |
13449 | 313 |
|
314 |
text {* Complete induction, aka course-of-values induction *} |
|
315 |
lemma nat_less_induct: |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
316 |
assumes prem: "!!n. \<forall>m::nat. m < n --> P m ==> P n" shows "P n" |
13449 | 317 |
apply (rule_tac a=n in wf_induct) |
318 |
apply (rule wf_pred_nat [THEN wf_trancl]) |
|
319 |
apply (rule prem) |
|
14208 | 320 |
apply (unfold less_def, assumption) |
13449 | 321 |
done |
322 |
||
14131 | 323 |
lemmas less_induct = nat_less_induct [rule_format, case_names less] |
324 |
||
325 |
subsection {* Properties of "less than or equal" *} |
|
13449 | 326 |
|
327 |
text {* Was @{text le_eq_less_Suc}, but this orientation is more useful *} |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
328 |
lemma less_Suc_eq_le: "(m < Suc n) = (m \<le> n)" |
13449 | 329 |
by (unfold le_def, rule not_less_eq [symmetric]) |
330 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
331 |
lemma le_imp_less_Suc: "m \<le> n ==> m < Suc n" |
13449 | 332 |
by (rule less_Suc_eq_le [THEN iffD2]) |
333 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
334 |
lemma le0 [iff]: "(0::nat) \<le> n" |
13449 | 335 |
by (unfold le_def, rule not_less0) |
336 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
337 |
lemma Suc_n_not_le_n: "~ Suc n \<le> n" |
13449 | 338 |
by (simp add: le_def) |
339 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
340 |
lemma le_0_eq [iff]: "((i::nat) \<le> 0) = (i = 0)" |
13449 | 341 |
by (induct i) (simp_all add: le_def) |
342 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
343 |
lemma le_Suc_eq: "(m \<le> Suc n) = (m \<le> n | m = Suc n)" |
13449 | 344 |
by (simp del: less_Suc_eq_le add: less_Suc_eq_le [symmetric] less_Suc_eq) |
345 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
346 |
lemma le_SucE: "m \<le> Suc n ==> (m \<le> n ==> R) ==> (m = Suc n ==> R) ==> R" |
17589 | 347 |
by (drule le_Suc_eq [THEN iffD1], iprover+) |
13449 | 348 |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
349 |
lemma Suc_leI: "m < n ==> Suc(m) \<le> n" |
13449 | 350 |
apply (simp add: le_def less_Suc_eq) |
351 |
apply (blast elim!: less_irrefl less_asym) |
|
352 |
done -- {* formerly called lessD *} |
|
353 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
354 |
lemma Suc_leD: "Suc(m) \<le> n ==> m \<le> n" |
13449 | 355 |
by (simp add: le_def less_Suc_eq) |
356 |
||
357 |
text {* Stronger version of @{text Suc_leD} *} |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
358 |
lemma Suc_le_lessD: "Suc m \<le> n ==> m < n" |
13449 | 359 |
apply (simp add: le_def less_Suc_eq) |
360 |
using less_linear |
|
361 |
apply blast |
|
362 |
done |
|
363 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
364 |
lemma Suc_le_eq: "(Suc m \<le> n) = (m < n)" |
13449 | 365 |
by (blast intro: Suc_leI Suc_le_lessD) |
366 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
367 |
lemma le_SucI: "m \<le> n ==> m \<le> Suc n" |
13449 | 368 |
by (unfold le_def) (blast dest: Suc_lessD) |
369 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
370 |
lemma less_imp_le: "m < n ==> m \<le> (n::nat)" |
13449 | 371 |
by (unfold le_def) (blast elim: less_asym) |
372 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
373 |
text {* For instance, @{text "(Suc m < Suc n) = (Suc m \<le> n) = (m < n)"} *} |
13449 | 374 |
lemmas le_simps = less_imp_le less_Suc_eq_le Suc_le_eq |
375 |
||
376 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
377 |
text {* Equivalence of @{term "m \<le> n"} and @{term "m < n | m = n"} *} |
13449 | 378 |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
379 |
lemma le_imp_less_or_eq: "m \<le> n ==> m < n | m = (n::nat)" |
13449 | 380 |
apply (unfold le_def) |
381 |
using less_linear |
|
382 |
apply (blast elim: less_irrefl less_asym) |
|
383 |
done |
|
384 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
385 |
lemma less_or_eq_imp_le: "m < n | m = n ==> m \<le> (n::nat)" |
13449 | 386 |
apply (unfold le_def) |
387 |
using less_linear |
|
388 |
apply (blast elim!: less_irrefl elim: less_asym) |
|
389 |
done |
|
390 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
391 |
lemma le_eq_less_or_eq: "(m \<le> (n::nat)) = (m < n | m=n)" |
17589 | 392 |
by (iprover intro: less_or_eq_imp_le le_imp_less_or_eq) |
13449 | 393 |
|
394 |
text {* Useful with @{text Blast}. *} |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
395 |
lemma eq_imp_le: "(m::nat) = n ==> m \<le> n" |
13449 | 396 |
by (rule less_or_eq_imp_le, rule disjI2) |
397 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
398 |
lemma le_refl: "n \<le> (n::nat)" |
13449 | 399 |
by (simp add: le_eq_less_or_eq) |
400 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
401 |
lemma le_less_trans: "[| i \<le> j; j < k |] ==> i < (k::nat)" |
13449 | 402 |
by (blast dest!: le_imp_less_or_eq intro: less_trans) |
403 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
404 |
lemma less_le_trans: "[| i < j; j \<le> k |] ==> i < (k::nat)" |
13449 | 405 |
by (blast dest!: le_imp_less_or_eq intro: less_trans) |
406 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
407 |
lemma le_trans: "[| i \<le> j; j \<le> k |] ==> i \<le> (k::nat)" |
13449 | 408 |
by (blast dest!: le_imp_less_or_eq intro: less_or_eq_imp_le less_trans) |
409 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
410 |
lemma le_anti_sym: "[| m \<le> n; n \<le> m |] ==> m = (n::nat)" |
13449 | 411 |
by (blast dest!: le_imp_less_or_eq elim!: less_irrefl elim: less_asym) |
412 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
413 |
lemma Suc_le_mono [iff]: "(Suc n \<le> Suc m) = (n \<le> m)" |
13449 | 414 |
by (simp add: le_simps) |
415 |
||
416 |
text {* Axiom @{text order_less_le} of class @{text order}: *} |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
417 |
lemma nat_less_le: "((m::nat) < n) = (m \<le> n & m \<noteq> n)" |
13449 | 418 |
by (simp add: le_def nat_neq_iff) (blast elim!: less_asym) |
419 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
420 |
lemma le_neq_implies_less: "(m::nat) \<le> n ==> m \<noteq> n ==> m < n" |
13449 | 421 |
by (rule iffD2, rule nat_less_le, rule conjI) |
422 |
||
423 |
text {* Axiom @{text linorder_linear} of class @{text linorder}: *} |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
424 |
lemma nat_le_linear: "(m::nat) \<le> n | n \<le> m" |
13449 | 425 |
apply (simp add: le_eq_less_or_eq) |
426 |
using less_linear |
|
427 |
apply blast |
|
428 |
done |
|
429 |
||
14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
430 |
text {* Type {@typ nat} is a wellfounded linear order *} |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
431 |
|
14691 | 432 |
instance nat :: "{order, linorder, wellorder}" |
433 |
by intro_classes |
|
434 |
(assumption | |
|
435 |
rule le_refl le_trans le_anti_sym nat_less_le nat_le_linear wf_less)+ |
|
14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
436 |
|
15921 | 437 |
lemmas linorder_neqE_nat = linorder_neqE[where 'a = nat] |
438 |
||
13449 | 439 |
lemma not_less_less_Suc_eq: "~ n < m ==> (n < Suc m) = (n = m)" |
440 |
by (blast elim!: less_SucE) |
|
441 |
||
442 |
text {* |
|
443 |
Rewrite @{term "n < Suc m"} to @{term "n = m"} |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
444 |
if @{term "~ n < m"} or @{term "m \<le> n"} hold. |
13449 | 445 |
Not suitable as default simprules because they often lead to looping |
446 |
*} |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
447 |
lemma le_less_Suc_eq: "m \<le> n ==> (n < Suc m) = (n = m)" |
13449 | 448 |
by (rule not_less_less_Suc_eq, rule leD) |
449 |
||
450 |
lemmas not_less_simps = not_less_less_Suc_eq le_less_Suc_eq |
|
451 |
||
452 |
||
453 |
text {* |
|
454 |
Re-orientation of the equations @{text "0 = x"} and @{text "1 = x"}. |
|
455 |
No longer added as simprules (they loop) |
|
456 |
but via @{text reorient_simproc} in Bin |
|
457 |
*} |
|
458 |
||
459 |
text {* Polymorphic, not just for @{typ nat} *} |
|
460 |
lemma zero_reorient: "(0 = x) = (x = 0)" |
|
461 |
by auto |
|
462 |
||
463 |
lemma one_reorient: "(1 = x) = (x = 1)" |
|
464 |
by auto |
|
465 |
||
466 |
subsection {* Arithmetic operators *} |
|
1660 | 467 |
|
12338
de0f4a63baa5
renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents:
11451
diff
changeset
|
468 |
axclass power < type |
10435 | 469 |
|
3370
5c5fdce3a4e4
Overloading of "^" requires new type class "power", with types "nat" and
paulson
parents:
2608
diff
changeset
|
470 |
consts |
13449 | 471 |
power :: "('a::power) => nat => 'a" (infixr "^" 80) |
3370
5c5fdce3a4e4
Overloading of "^" requires new type class "power", with types "nat" and
paulson
parents:
2608
diff
changeset
|
472 |
|
9436
62bb04ab4b01
rearranged setup of arithmetic procedures, avoiding global reference values;
wenzelm
parents:
7702
diff
changeset
|
473 |
|
13449 | 474 |
text {* arithmetic operators @{text "+ -"} and @{text "*"} *} |
475 |
||
14691 | 476 |
instance nat :: "{plus, minus, times, power}" .. |
9436
62bb04ab4b01
rearranged setup of arithmetic procedures, avoiding global reference values;
wenzelm
parents:
7702
diff
changeset
|
477 |
|
13449 | 478 |
text {* size of a datatype value; overloaded *} |
479 |
consts size :: "'a => nat" |
|
9436
62bb04ab4b01
rearranged setup of arithmetic procedures, avoiding global reference values;
wenzelm
parents:
7702
diff
changeset
|
480 |
|
13449 | 481 |
primrec |
482 |
add_0: "0 + n = n" |
|
483 |
add_Suc: "Suc m + n = Suc (m + n)" |
|
484 |
||
485 |
primrec |
|
486 |
diff_0: "m - 0 = m" |
|
487 |
diff_Suc: "m - Suc n = (case m - n of 0 => 0 | Suc k => k)" |
|
9436
62bb04ab4b01
rearranged setup of arithmetic procedures, avoiding global reference values;
wenzelm
parents:
7702
diff
changeset
|
488 |
|
62bb04ab4b01
rearranged setup of arithmetic procedures, avoiding global reference values;
wenzelm
parents:
7702
diff
changeset
|
489 |
primrec |
13449 | 490 |
mult_0: "0 * n = 0" |
491 |
mult_Suc: "Suc m * n = n + (m * n)" |
|
492 |
||
14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
493 |
text {* These two rules ease the use of primitive recursion. |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
494 |
NOTE USE OF @{text "=="} *} |
13449 | 495 |
lemma def_nat_rec_0: "(!!n. f n == nat_rec c h n) ==> f 0 = c" |
496 |
by simp |
|
497 |
||
498 |
lemma def_nat_rec_Suc: "(!!n. f n == nat_rec c h n) ==> f (Suc n) = h n (f n)" |
|
499 |
by simp |
|
500 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
501 |
lemma not0_implies_Suc: "n \<noteq> 0 ==> \<exists>m. n = Suc m" |
13449 | 502 |
by (case_tac n) simp_all |
503 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
504 |
lemma gr_implies_not0: "!!n::nat. m<n ==> n \<noteq> 0" |
13449 | 505 |
by (case_tac n) simp_all |
506 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
507 |
lemma neq0_conv [iff]: "!!n::nat. (n \<noteq> 0) = (0 < n)" |
13449 | 508 |
by (case_tac n) simp_all |
509 |
||
510 |
text {* This theorem is useful with @{text blast} *} |
|
511 |
lemma gr0I: "((n::nat) = 0 ==> False) ==> 0 < n" |
|
17589 | 512 |
by (rule iffD1, rule neq0_conv, iprover) |
13449 | 513 |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
514 |
lemma gr0_conv_Suc: "(0 < n) = (\<exists>m. n = Suc m)" |
13449 | 515 |
by (fast intro: not0_implies_Suc) |
516 |
||
517 |
lemma not_gr0 [iff]: "!!n::nat. (~ (0 < n)) = (n = 0)" |
|
518 |
apply (rule iffI) |
|
14208 | 519 |
apply (rule ccontr, simp_all) |
13449 | 520 |
done |
521 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
522 |
lemma Suc_le_D: "(Suc n \<le> m') ==> (? m. m' = Suc m)" |
13449 | 523 |
by (induct m') simp_all |
524 |
||
525 |
text {* Useful in certain inductive arguments *} |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
526 |
lemma less_Suc_eq_0_disj: "(m < Suc n) = (m = 0 | (\<exists>j. m = Suc j & j < n))" |
13449 | 527 |
by (case_tac m) simp_all |
528 |
||
14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
529 |
lemma nat_induct2: "[|P 0; P (Suc 0); !!k. P k ==> P (Suc (Suc k))|] ==> P n" |
13449 | 530 |
apply (rule nat_less_induct) |
531 |
apply (case_tac n) |
|
532 |
apply (case_tac [2] nat) |
|
533 |
apply (blast intro: less_trans)+ |
|
534 |
done |
|
535 |
||
15341
254f6f00b60e
converted to Isar script, simplifying some results
paulson
parents:
15281
diff
changeset
|
536 |
subsection {* @{text LEAST} theorems for type @{typ nat}*} |
13449 | 537 |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
538 |
lemma Least_Suc: |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
539 |
"[| P n; ~ P 0 |] ==> (LEAST n. P n) = Suc (LEAST m. P(Suc m))" |
14208 | 540 |
apply (case_tac "n", auto) |
13449 | 541 |
apply (frule LeastI) |
542 |
apply (drule_tac P = "%x. P (Suc x) " in LeastI) |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
543 |
apply (subgoal_tac " (LEAST x. P x) \<le> Suc (LEAST x. P (Suc x))") |
13449 | 544 |
apply (erule_tac [2] Least_le) |
14208 | 545 |
apply (case_tac "LEAST x. P x", auto) |
13449 | 546 |
apply (drule_tac P = "%x. P (Suc x) " in Least_le) |
547 |
apply (blast intro: order_antisym) |
|
548 |
done |
|
549 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
550 |
lemma Least_Suc2: |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
551 |
"[|P n; Q m; ~P 0; !k. P (Suc k) = Q k|] ==> Least P = Suc (Least Q)" |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
552 |
by (erule (1) Least_Suc [THEN ssubst], simp) |
13449 | 553 |
|
554 |
||
14265
95b42e69436c
HOL: installation of Ring_and_Field as the basis for Naturals and Reals
paulson
parents:
14208
diff
changeset
|
555 |
|
13449 | 556 |
subsection {* @{term min} and @{term max} *} |
557 |
||
558 |
lemma min_0L [simp]: "min 0 n = (0::nat)" |
|
559 |
by (rule min_leastL) simp |
|
560 |
||
561 |
lemma min_0R [simp]: "min n 0 = (0::nat)" |
|
562 |
by (rule min_leastR) simp |
|
563 |
||
564 |
lemma min_Suc_Suc [simp]: "min (Suc m) (Suc n) = Suc (min m n)" |
|
565 |
by (simp add: min_of_mono) |
|
566 |
||
567 |
lemma max_0L [simp]: "max 0 n = (n::nat)" |
|
568 |
by (rule max_leastL) simp |
|
569 |
||
570 |
lemma max_0R [simp]: "max n 0 = (n::nat)" |
|
571 |
by (rule max_leastR) simp |
|
572 |
||
573 |
lemma max_Suc_Suc [simp]: "max (Suc m) (Suc n) = Suc(max m n)" |
|
574 |
by (simp add: max_of_mono) |
|
575 |
||
576 |
||
577 |
subsection {* Basic rewrite rules for the arithmetic operators *} |
|
578 |
||
579 |
text {* Difference *} |
|
580 |
||
14193
30e41f63712e
Improved efficiency of code generated for + and -
berghofe
parents:
14131
diff
changeset
|
581 |
lemma diff_0_eq_0 [simp, code]: "0 - n = (0::nat)" |
15251 | 582 |
by (induct n) simp_all |
13449 | 583 |
|
14193
30e41f63712e
Improved efficiency of code generated for + and -
berghofe
parents:
14131
diff
changeset
|
584 |
lemma diff_Suc_Suc [simp, code]: "Suc(m) - Suc(n) = m - n" |
15251 | 585 |
by (induct n) simp_all |
13449 | 586 |
|
587 |
||
588 |
text {* |
|
589 |
Could be (and is, below) generalized in various ways |
|
590 |
However, none of the generalizations are currently in the simpset, |
|
591 |
and I dread to think what happens if I put them in |
|
592 |
*} |
|
593 |
lemma Suc_pred [simp]: "0 < n ==> Suc (n - Suc 0) = n" |
|
594 |
by (simp split add: nat.split) |
|
595 |
||
14193
30e41f63712e
Improved efficiency of code generated for + and -
berghofe
parents:
14131
diff
changeset
|
596 |
declare diff_Suc [simp del, code del] |
13449 | 597 |
|
598 |
||
599 |
subsection {* Addition *} |
|
600 |
||
601 |
lemma add_0_right [simp]: "m + 0 = (m::nat)" |
|
602 |
by (induct m) simp_all |
|
603 |
||
604 |
lemma add_Suc_right [simp]: "m + Suc n = Suc (m + n)" |
|
605 |
by (induct m) simp_all |
|
606 |
||
14193
30e41f63712e
Improved efficiency of code generated for + and -
berghofe
parents:
14131
diff
changeset
|
607 |
lemma [code]: "Suc m + n = m + Suc n" by simp |
30e41f63712e
Improved efficiency of code generated for + and -
berghofe
parents:
14131
diff
changeset
|
608 |
|
13449 | 609 |
|
610 |
text {* Associative law for addition *} |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
611 |
lemma nat_add_assoc: "(m + n) + k = m + ((n + k)::nat)" |
13449 | 612 |
by (induct m) simp_all |
613 |
||
614 |
text {* Commutative law for addition *} |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
615 |
lemma nat_add_commute: "m + n = n + (m::nat)" |
13449 | 616 |
by (induct m) simp_all |
617 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
618 |
lemma nat_add_left_commute: "x + (y + z) = y + ((x + z)::nat)" |
13449 | 619 |
apply (rule mk_left_commute [of "op +"]) |
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
620 |
apply (rule nat_add_assoc) |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
621 |
apply (rule nat_add_commute) |
13449 | 622 |
done |
623 |
||
14331 | 624 |
lemma nat_add_left_cancel [simp]: "(k + m = k + n) = (m = (n::nat))" |
13449 | 625 |
by (induct k) simp_all |
626 |
||
14331 | 627 |
lemma nat_add_right_cancel [simp]: "(m + k = n + k) = (m=(n::nat))" |
13449 | 628 |
by (induct k) simp_all |
629 |
||
14331 | 630 |
lemma nat_add_left_cancel_le [simp]: "(k + m \<le> k + n) = (m\<le>(n::nat))" |
13449 | 631 |
by (induct k) simp_all |
632 |
||
14331 | 633 |
lemma nat_add_left_cancel_less [simp]: "(k + m < k + n) = (m<(n::nat))" |
13449 | 634 |
by (induct k) simp_all |
635 |
||
636 |
text {* Reasoning about @{text "m + 0 = 0"}, etc. *} |
|
637 |
||
638 |
lemma add_is_0 [iff]: "!!m::nat. (m + n = 0) = (m = 0 & n = 0)" |
|
639 |
by (case_tac m) simp_all |
|
640 |
||
641 |
lemma add_is_1: "(m+n= Suc 0) = (m= Suc 0 & n=0 | m=0 & n= Suc 0)" |
|
642 |
by (case_tac m) simp_all |
|
643 |
||
644 |
lemma one_is_add: "(Suc 0 = m + n) = (m = Suc 0 & n = 0 | m = 0 & n = Suc 0)" |
|
645 |
by (rule trans, rule eq_commute, rule add_is_1) |
|
646 |
||
647 |
lemma add_gr_0 [iff]: "!!m::nat. (0 < m + n) = (0 < m | 0 < n)" |
|
648 |
by (simp del: neq0_conv add: neq0_conv [symmetric]) |
|
649 |
||
650 |
lemma add_eq_self_zero: "!!m::nat. m + n = m ==> n = 0" |
|
651 |
apply (drule add_0_right [THEN ssubst]) |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
652 |
apply (simp add: nat_add_assoc del: add_0_right) |
13449 | 653 |
done |
654 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
655 |
|
16733
236dfafbeb63
linear arithmetic now takes "&" in assumptions apart.
nipkow
parents:
16635
diff
changeset
|
656 |
lemma inj_on_add_nat[simp]: "inj_on (%n::nat. n+k) N" |
236dfafbeb63
linear arithmetic now takes "&" in assumptions apart.
nipkow
parents:
16635
diff
changeset
|
657 |
apply(induct k) |
236dfafbeb63
linear arithmetic now takes "&" in assumptions apart.
nipkow
parents:
16635
diff
changeset
|
658 |
apply simp |
236dfafbeb63
linear arithmetic now takes "&" in assumptions apart.
nipkow
parents:
16635
diff
changeset
|
659 |
apply(drule comp_inj_on[OF _ inj_Suc]) |
236dfafbeb63
linear arithmetic now takes "&" in assumptions apart.
nipkow
parents:
16635
diff
changeset
|
660 |
apply (simp add:o_def) |
236dfafbeb63
linear arithmetic now takes "&" in assumptions apart.
nipkow
parents:
16635
diff
changeset
|
661 |
done |
236dfafbeb63
linear arithmetic now takes "&" in assumptions apart.
nipkow
parents:
16635
diff
changeset
|
662 |
|
236dfafbeb63
linear arithmetic now takes "&" in assumptions apart.
nipkow
parents:
16635
diff
changeset
|
663 |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
664 |
subsection {* Multiplication *} |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
665 |
|
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
666 |
text {* right annihilation in product *} |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
667 |
lemma mult_0_right [simp]: "(m::nat) * 0 = 0" |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
668 |
by (induct m) simp_all |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
669 |
|
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
670 |
text {* right successor law for multiplication *} |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
671 |
lemma mult_Suc_right [simp]: "m * Suc n = m + (m * n)" |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
672 |
by (induct m) (simp_all add: nat_add_left_commute) |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
673 |
|
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
674 |
text {* Commutative law for multiplication *} |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
675 |
lemma nat_mult_commute: "m * n = n * (m::nat)" |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
676 |
by (induct m) simp_all |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
677 |
|
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
678 |
text {* addition distributes over multiplication *} |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
679 |
lemma add_mult_distrib: "(m + n) * k = (m * k) + ((n * k)::nat)" |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
680 |
by (induct m) (simp_all add: nat_add_assoc nat_add_left_commute) |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
681 |
|
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
682 |
lemma add_mult_distrib2: "k * (m + n) = (k * m) + ((k * n)::nat)" |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
683 |
by (induct m) (simp_all add: nat_add_assoc) |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
684 |
|
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
685 |
text {* Associative law for multiplication *} |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
686 |
lemma nat_mult_assoc: "(m * n) * k = m * ((n * k)::nat)" |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
687 |
by (induct m) (simp_all add: add_mult_distrib) |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
688 |
|
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
689 |
|
14740 | 690 |
text{*The naturals form a @{text comm_semiring_1_cancel}*} |
14738 | 691 |
instance nat :: comm_semiring_1_cancel |
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
692 |
proof |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
693 |
fix i j k :: nat |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
694 |
show "(i + j) + k = i + (j + k)" by (rule nat_add_assoc) |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
695 |
show "i + j = j + i" by (rule nat_add_commute) |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
696 |
show "0 + i = i" by simp |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
697 |
show "(i * j) * k = i * (j * k)" by (rule nat_mult_assoc) |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
698 |
show "i * j = j * i" by (rule nat_mult_commute) |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
699 |
show "1 * i = i" by simp |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
700 |
show "(i + j) * k = i * k + j * k" by (simp add: add_mult_distrib) |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
701 |
show "0 \<noteq> (1::nat)" by simp |
14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
702 |
assume "k+i = k+j" thus "i=j" by simp |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
703 |
qed |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
704 |
|
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
705 |
lemma mult_is_0 [simp]: "((m::nat) * n = 0) = (m=0 | n=0)" |
15251 | 706 |
apply (induct m) |
14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
707 |
apply (induct_tac [2] n, simp_all) |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
708 |
done |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
709 |
|
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
710 |
subsection {* Monotonicity of Addition *} |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
711 |
|
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
712 |
text {* strict, in 1st argument *} |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
713 |
lemma add_less_mono1: "i < j ==> i + k < j + (k::nat)" |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
714 |
by (induct k) simp_all |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
715 |
|
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
716 |
text {* strict, in both arguments *} |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
717 |
lemma add_less_mono: "[|i < j; k < l|] ==> i + k < j + (l::nat)" |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
718 |
apply (rule add_less_mono1 [THEN less_trans], assumption+) |
15251 | 719 |
apply (induct j, simp_all) |
14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
720 |
done |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
721 |
|
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
722 |
text {* Deleted @{text less_natE}; use @{text "less_imp_Suc_add RS exE"} *} |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
723 |
lemma less_imp_Suc_add: "m < n ==> (\<exists>k. n = Suc (m + k))" |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
724 |
apply (induct n) |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
725 |
apply (simp_all add: order_le_less) |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
726 |
apply (blast elim!: less_SucE |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
727 |
intro!: add_0_right [symmetric] add_Suc_right [symmetric]) |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
728 |
done |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
729 |
|
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
730 |
text {* strict, in 1st argument; proof is by induction on @{text "k > 0"} *} |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
731 |
lemma mult_less_mono2: "(i::nat) < j ==> 0 < k ==> k * i < k * j" |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
732 |
apply (erule_tac m1 = 0 in less_imp_Suc_add [THEN exE], simp) |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
733 |
apply (induct_tac x) |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
734 |
apply (simp_all add: add_less_mono) |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
735 |
done |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
736 |
|
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
737 |
|
14740 | 738 |
text{*The naturals form an ordered @{text comm_semiring_1_cancel}*} |
14738 | 739 |
instance nat :: ordered_semidom |
14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
740 |
proof |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
741 |
fix i j k :: nat |
14348
744c868ee0b7
Defining the type class "ringpower" and deleting superseded theorems for
paulson
parents:
14341
diff
changeset
|
742 |
show "0 < (1::nat)" by simp |
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
743 |
show "i \<le> j ==> k + i \<le> k + j" by simp |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
744 |
show "i < j ==> 0 < k ==> k * i < k * j" by (simp add: mult_less_mono2) |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
745 |
qed |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
746 |
|
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
747 |
lemma nat_mult_1: "(1::nat) * n = n" |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
748 |
by simp |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
749 |
|
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
750 |
lemma nat_mult_1_right: "n * (1::nat) = n" |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
751 |
by simp |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
752 |
|
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
753 |
|
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
754 |
subsection {* Additional theorems about "less than" *} |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
755 |
|
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
756 |
text {* A [clumsy] way of lifting @{text "<"} |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
757 |
monotonicity to @{text "\<le>"} monotonicity *} |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
758 |
lemma less_mono_imp_le_mono: |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
759 |
assumes lt_mono: "!!i j::nat. i < j ==> f i < f j" |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
760 |
and le: "i \<le> j" shows "f i \<le> ((f j)::nat)" using le |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
761 |
apply (simp add: order_le_less) |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
762 |
apply (blast intro!: lt_mono) |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
763 |
done |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
764 |
|
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
765 |
text {* non-strict, in 1st argument *} |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
766 |
lemma add_le_mono1: "i \<le> j ==> i + k \<le> j + (k::nat)" |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
767 |
by (rule add_right_mono) |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
768 |
|
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
769 |
text {* non-strict, in both arguments *} |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
770 |
lemma add_le_mono: "[| i \<le> j; k \<le> l |] ==> i + k \<le> j + (l::nat)" |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
771 |
by (rule add_mono) |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
772 |
|
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
773 |
lemma le_add2: "n \<le> ((m + n)::nat)" |
14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
774 |
by (insert add_right_mono [of 0 m n], simp) |
13449 | 775 |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
776 |
lemma le_add1: "n \<le> ((n + m)::nat)" |
14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
777 |
by (simp add: add_commute, rule le_add2) |
13449 | 778 |
|
779 |
lemma less_add_Suc1: "i < Suc (i + m)" |
|
780 |
by (rule le_less_trans, rule le_add1, rule lessI) |
|
781 |
||
782 |
lemma less_add_Suc2: "i < Suc (m + i)" |
|
783 |
by (rule le_less_trans, rule le_add2, rule lessI) |
|
784 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
785 |
lemma less_iff_Suc_add: "(m < n) = (\<exists>k. n = Suc (m + k))" |
17589 | 786 |
by (iprover intro!: less_add_Suc1 less_imp_Suc_add) |
13449 | 787 |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
788 |
lemma trans_le_add1: "(i::nat) \<le> j ==> i \<le> j + m" |
13449 | 789 |
by (rule le_trans, assumption, rule le_add1) |
790 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
791 |
lemma trans_le_add2: "(i::nat) \<le> j ==> i \<le> m + j" |
13449 | 792 |
by (rule le_trans, assumption, rule le_add2) |
793 |
||
794 |
lemma trans_less_add1: "(i::nat) < j ==> i < j + m" |
|
795 |
by (rule less_le_trans, assumption, rule le_add1) |
|
796 |
||
797 |
lemma trans_less_add2: "(i::nat) < j ==> i < m + j" |
|
798 |
by (rule less_le_trans, assumption, rule le_add2) |
|
799 |
||
800 |
lemma add_lessD1: "i + j < (k::nat) ==> i < k" |
|
14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
801 |
apply (rule le_less_trans [of _ "i+j"]) |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
802 |
apply (simp_all add: le_add1) |
13449 | 803 |
done |
804 |
||
805 |
lemma not_add_less1 [iff]: "~ (i + j < (i::nat))" |
|
806 |
apply (rule notI) |
|
807 |
apply (erule add_lessD1 [THEN less_irrefl]) |
|
808 |
done |
|
809 |
||
810 |
lemma not_add_less2 [iff]: "~ (j + i < (i::nat))" |
|
811 |
by (simp add: add_commute not_add_less1) |
|
812 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
813 |
lemma add_leD1: "m + k \<le> n ==> m \<le> (n::nat)" |
14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
814 |
apply (rule order_trans [of _ "m+k"]) |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
815 |
apply (simp_all add: le_add1) |
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
816 |
done |
13449 | 817 |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
818 |
lemma add_leD2: "m + k \<le> n ==> k \<le> (n::nat)" |
13449 | 819 |
apply (simp add: add_commute) |
820 |
apply (erule add_leD1) |
|
821 |
done |
|
822 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
823 |
lemma add_leE: "(m::nat) + k \<le> n ==> (m \<le> n ==> k \<le> n ==> R) ==> R" |
13449 | 824 |
by (blast dest: add_leD1 add_leD2) |
825 |
||
826 |
text {* needs @{text "!!k"} for @{text add_ac} to work *} |
|
827 |
lemma less_add_eq_less: "!!k::nat. k < l ==> m + l = k + n ==> m < n" |
|
828 |
by (force simp del: add_Suc_right |
|
829 |
simp add: less_iff_Suc_add add_Suc_right [symmetric] add_ac) |
|
830 |
||
831 |
||
832 |
||
833 |
subsection {* Difference *} |
|
834 |
||
835 |
lemma diff_self_eq_0 [simp]: "(m::nat) - m = 0" |
|
836 |
by (induct m) simp_all |
|
837 |
||
838 |
text {* Addition is the inverse of subtraction: |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
839 |
if @{term "n \<le> m"} then @{term "n + (m - n) = m"}. *} |
13449 | 840 |
lemma add_diff_inverse: "~ m < n ==> n + (m - n) = (m::nat)" |
841 |
by (induct m n rule: diff_induct) simp_all |
|
842 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
843 |
lemma le_add_diff_inverse [simp]: "n \<le> m ==> n + (m - n) = (m::nat)" |
16796 | 844 |
by (simp add: add_diff_inverse linorder_not_less) |
13449 | 845 |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
846 |
lemma le_add_diff_inverse2 [simp]: "n \<le> m ==> (m - n) + n = (m::nat)" |
13449 | 847 |
by (simp add: le_add_diff_inverse add_commute) |
848 |
||
849 |
||
850 |
subsection {* More results about difference *} |
|
851 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
852 |
lemma Suc_diff_le: "n \<le> m ==> Suc m - n = Suc (m - n)" |
13449 | 853 |
by (induct m n rule: diff_induct) simp_all |
854 |
||
855 |
lemma diff_less_Suc: "m - n < Suc m" |
|
856 |
apply (induct m n rule: diff_induct) |
|
857 |
apply (erule_tac [3] less_SucE) |
|
858 |
apply (simp_all add: less_Suc_eq) |
|
859 |
done |
|
860 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
861 |
lemma diff_le_self [simp]: "m - n \<le> (m::nat)" |
13449 | 862 |
by (induct m n rule: diff_induct) (simp_all add: le_SucI) |
863 |
||
864 |
lemma less_imp_diff_less: "(j::nat) < k ==> j - n < k" |
|
865 |
by (rule le_less_trans, rule diff_le_self) |
|
866 |
||
867 |
lemma diff_diff_left: "(i::nat) - j - k = i - (j + k)" |
|
868 |
by (induct i j rule: diff_induct) simp_all |
|
869 |
||
870 |
lemma Suc_diff_diff [simp]: "(Suc m - n) - Suc k = m - n - k" |
|
871 |
by (simp add: diff_diff_left) |
|
872 |
||
873 |
lemma diff_Suc_less [simp]: "0<n ==> n - Suc i < n" |
|
14208 | 874 |
apply (case_tac "n", safe) |
13449 | 875 |
apply (simp add: le_simps) |
876 |
done |
|
877 |
||
878 |
text {* This and the next few suggested by Florian Kammueller *} |
|
879 |
lemma diff_commute: "(i::nat) - j - k = i - k - j" |
|
880 |
by (simp add: diff_diff_left add_commute) |
|
881 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
882 |
lemma diff_add_assoc: "k \<le> (j::nat) ==> (i + j) - k = i + (j - k)" |
13449 | 883 |
by (induct j k rule: diff_induct) simp_all |
884 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
885 |
lemma diff_add_assoc2: "k \<le> (j::nat) ==> (j + i) - k = (j - k) + i" |
13449 | 886 |
by (simp add: add_commute diff_add_assoc) |
887 |
||
888 |
lemma diff_add_inverse: "(n + m) - n = (m::nat)" |
|
889 |
by (induct n) simp_all |
|
890 |
||
891 |
lemma diff_add_inverse2: "(m + n) - n = (m::nat)" |
|
892 |
by (simp add: diff_add_assoc) |
|
893 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
894 |
lemma le_imp_diff_is_add: "i \<le> (j::nat) ==> (j - i = k) = (j = k + i)" |
13449 | 895 |
apply safe |
896 |
apply (simp_all add: diff_add_inverse2) |
|
897 |
done |
|
898 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
899 |
lemma diff_is_0_eq [simp]: "((m::nat) - n = 0) = (m \<le> n)" |
13449 | 900 |
by (induct m n rule: diff_induct) simp_all |
901 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
902 |
lemma diff_is_0_eq' [simp]: "m \<le> n ==> (m::nat) - n = 0" |
13449 | 903 |
by (rule iffD2, rule diff_is_0_eq) |
904 |
||
905 |
lemma zero_less_diff [simp]: "(0 < n - (m::nat)) = (m < n)" |
|
906 |
by (induct m n rule: diff_induct) simp_all |
|
907 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
908 |
lemma less_imp_add_positive: "i < j ==> \<exists>k::nat. 0 < k & i + k = j" |
13449 | 909 |
apply (rule_tac x = "j - i" in exI) |
910 |
apply (simp (no_asm_simp) add: add_diff_inverse less_not_sym) |
|
911 |
done |
|
9436
62bb04ab4b01
rearranged setup of arithmetic procedures, avoiding global reference values;
wenzelm
parents:
7702
diff
changeset
|
912 |
|
13449 | 913 |
lemma zero_induct_lemma: "P k ==> (!!n. P (Suc n) ==> P n) ==> P (k - i)" |
914 |
apply (induct k i rule: diff_induct) |
|
915 |
apply (simp_all (no_asm)) |
|
17589 | 916 |
apply iprover |
13449 | 917 |
done |
918 |
||
919 |
lemma zero_induct: "P k ==> (!!n. P (Suc n) ==> P n) ==> P 0" |
|
920 |
apply (rule diff_self_eq_0 [THEN subst]) |
|
17589 | 921 |
apply (rule zero_induct_lemma, iprover+) |
13449 | 922 |
done |
923 |
||
924 |
lemma diff_cancel: "(k + m) - (k + n) = m - (n::nat)" |
|
925 |
by (induct k) simp_all |
|
926 |
||
927 |
lemma diff_cancel2: "(m + k) - (n + k) = m - (n::nat)" |
|
928 |
by (simp add: diff_cancel add_commute) |
|
929 |
||
930 |
lemma diff_add_0: "n - (n + m) = (0::nat)" |
|
931 |
by (induct n) simp_all |
|
932 |
||
933 |
||
934 |
text {* Difference distributes over multiplication *} |
|
935 |
||
936 |
lemma diff_mult_distrib: "((m::nat) - n) * k = (m * k) - (n * k)" |
|
937 |
by (induct m n rule: diff_induct) (simp_all add: diff_cancel) |
|
938 |
||
939 |
lemma diff_mult_distrib2: "k * ((m::nat) - n) = (k * m) - (k * n)" |
|
940 |
by (simp add: diff_mult_distrib mult_commute [of k]) |
|
941 |
-- {* NOT added as rewrites, since sometimes they are used from right-to-left *} |
|
942 |
||
943 |
lemmas nat_distrib = |
|
944 |
add_mult_distrib add_mult_distrib2 diff_mult_distrib diff_mult_distrib2 |
|
945 |
||
946 |
||
947 |
subsection {* Monotonicity of Multiplication *} |
|
948 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
949 |
lemma mult_le_mono1: "i \<le> (j::nat) ==> i * k \<le> j * k" |
14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
950 |
by (simp add: mult_right_mono) |
13449 | 951 |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
952 |
lemma mult_le_mono2: "i \<le> (j::nat) ==> k * i \<le> k * j" |
14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
953 |
by (simp add: mult_left_mono) |
13449 | 954 |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
955 |
text {* @{text "\<le>"} monotonicity, BOTH arguments *} |
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
956 |
lemma mult_le_mono: "i \<le> (j::nat) ==> k \<le> l ==> i * k \<le> j * l" |
14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
957 |
by (simp add: mult_mono) |
13449 | 958 |
|
959 |
lemma mult_less_mono1: "(i::nat) < j ==> 0 < k ==> i * k < j * k" |
|
14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
960 |
by (simp add: mult_strict_right_mono) |
13449 | 961 |
|
14266 | 962 |
text{*Differs from the standard @{text zero_less_mult_iff} in that |
963 |
there are no negative numbers.*} |
|
964 |
lemma nat_0_less_mult_iff [simp]: "(0 < (m::nat) * n) = (0 < m & 0 < n)" |
|
13449 | 965 |
apply (induct m) |
14208 | 966 |
apply (case_tac [2] n, simp_all) |
13449 | 967 |
done |
968 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
969 |
lemma one_le_mult_iff [simp]: "(Suc 0 \<le> m * n) = (1 \<le> m & 1 \<le> n)" |
13449 | 970 |
apply (induct m) |
14208 | 971 |
apply (case_tac [2] n, simp_all) |
13449 | 972 |
done |
973 |
||
974 |
lemma mult_eq_1_iff [simp]: "(m * n = Suc 0) = (m = 1 & n = 1)" |
|
15251 | 975 |
apply (induct m, simp) |
976 |
apply (induct n, simp, fastsimp) |
|
13449 | 977 |
done |
978 |
||
979 |
lemma one_eq_mult_iff [simp]: "(Suc 0 = m * n) = (m = 1 & n = 1)" |
|
980 |
apply (rule trans) |
|
14208 | 981 |
apply (rule_tac [2] mult_eq_1_iff, fastsimp) |
13449 | 982 |
done |
983 |
||
14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
984 |
lemma mult_less_cancel2 [simp]: "((m::nat) * k < n * k) = (0 < k & m < n)" |
13449 | 985 |
apply (safe intro!: mult_less_mono1) |
14208 | 986 |
apply (case_tac k, auto) |
13449 | 987 |
apply (simp del: le_0_eq add: linorder_not_le [symmetric]) |
988 |
apply (blast intro: mult_le_mono1) |
|
989 |
done |
|
990 |
||
991 |
lemma mult_less_cancel1 [simp]: "(k * (m::nat) < k * n) = (0 < k & m < n)" |
|
14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
992 |
by (simp add: mult_commute [of k]) |
13449 | 993 |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
994 |
lemma mult_le_cancel1 [simp]: "(k * (m::nat) \<le> k * n) = (0 < k --> m \<le> n)" |
14208 | 995 |
by (simp add: linorder_not_less [symmetric], auto) |
13449 | 996 |
|
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
997 |
lemma mult_le_cancel2 [simp]: "((m::nat) * k \<le> n * k) = (0 < k --> m \<le> n)" |
14208 | 998 |
by (simp add: linorder_not_less [symmetric], auto) |
13449 | 999 |
|
14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
1000 |
lemma mult_cancel2 [simp]: "(m * k = n * k) = (m = n | (k = (0::nat)))" |
14208 | 1001 |
apply (cut_tac less_linear, safe, auto) |
13449 | 1002 |
apply (drule mult_less_mono1, assumption, simp)+ |
1003 |
done |
|
1004 |
||
1005 |
lemma mult_cancel1 [simp]: "(k * m = k * n) = (m = n | (k = (0::nat)))" |
|
14341
a09441bd4f1e
Ring_and_Field now requires axiom add_left_imp_eq for semirings.
paulson
parents:
14331
diff
changeset
|
1006 |
by (simp add: mult_commute [of k]) |
13449 | 1007 |
|
1008 |
lemma Suc_mult_less_cancel1: "(Suc k * m < Suc k * n) = (m < n)" |
|
1009 |
by (subst mult_less_cancel1) simp |
|
1010 |
||
14267
b963e9cee2a0
More refinements to Ring_and_Field and numerics. Conversion of Divides_lemmas
paulson
parents:
14266
diff
changeset
|
1011 |
lemma Suc_mult_le_cancel1: "(Suc k * m \<le> Suc k * n) = (m \<le> n)" |
13449 | 1012 |
by (subst mult_le_cancel1) simp |
1013 |
||
1014 |
lemma Suc_mult_cancel1: "(Suc k * m = Suc k * n) = (m = n)" |
|
1015 |
by (subst mult_cancel1) simp |
|
1016 |
||
1017 |
text {* Lemma for @{text gcd} *} |
|
1018 |
lemma mult_eq_self_implies_10: "(m::nat) = m * n ==> n = 1 | m = 0" |
|
1019 |
apply (drule sym) |
|
1020 |
apply (rule disjCI) |
|
1021 |
apply (rule nat_less_cases, erule_tac [2] _) |
|
1022 |
apply (fastsimp elim!: less_SucE) |
|
1023 |
apply (fastsimp dest: mult_less_mono2) |
|
1024 |
done |
|
9436
62bb04ab4b01
rearranged setup of arithmetic procedures, avoiding global reference values;
wenzelm
parents:
7702
diff
changeset
|
1025 |
|
15539 | 1026 |
|
923 | 1027 |
end |