author | ballarin |
Tue, 19 Jun 2018 21:02:32 +0200 | |
changeset 68469 | aad109fde9ec |
parent 67160 | f37bf261bdf6 |
permissions | -rw-r--r-- |
65363 | 1 |
(* Title: HOL/Word/Misc_Numeric.thy |
2 |
Author: Jeremy Dawson, NICTA |
|
3 |
*) |
|
24333 | 4 |
|
61799 | 5 |
section \<open>Useful Numerical Lemmas\<close> |
24333 | 6 |
|
37655 | 7 |
theory Misc_Numeric |
65363 | 8 |
imports Main |
25592 | 9 |
begin |
24333 | 10 |
|
67160 | 11 |
lemma one_mod_exp_eq_one [simp]: |
12 |
"1 mod (2 * 2 ^ n) = (1::int)" |
|
13 |
using power_gt1 [of 2 n] by (auto intro: mod_pos_pos_trivial) |
|
14 |
||
65363 | 15 |
lemma mod_2_neq_1_eq_eq_0: "k mod 2 \<noteq> 1 \<longleftrightarrow> k mod 2 = 0" |
16 |
for k :: int |
|
54869 | 17 |
by (fact not_mod_2_eq_1_eq_0) |
54847
d6cf9a5b9be9
prefer plain bool over dedicated type for binary digits
haftmann
parents:
54221
diff
changeset
|
18 |
|
65363 | 19 |
lemma z1pmod2: "(2 * b + 1) mod 2 = (1::int)" |
20 |
for b :: int |
|
54871 | 21 |
by arith |
22 |
||
65363 | 23 |
lemma diff_le_eq': "a - b \<le> c \<longleftrightarrow> a \<le> b + c" |
24 |
for a b c :: int |
|
54869 | 25 |
by arith |
24333 | 26 |
|
65363 | 27 |
lemma emep1: "even n \<Longrightarrow> even d \<Longrightarrow> 0 \<le> d \<Longrightarrow> (n + 1) mod d = (n mod d) + 1" |
28 |
for n d :: int |
|
58740 | 29 |
by (auto simp add: pos_zmod_mult_2 add.commute dvd_def) |
54871 | 30 |
|
65363 | 31 |
lemma int_mod_ge: "a < n \<Longrightarrow> 0 < n \<Longrightarrow> a \<le> a mod n" |
32 |
for a n :: int |
|
54871 | 33 |
by (metis dual_order.trans le_cases mod_pos_pos_trivial pos_mod_conj) |
24333 | 34 |
|
65363 | 35 |
lemma int_mod_ge': "b < 0 \<Longrightarrow> 0 < n \<Longrightarrow> b + n \<le> b mod n" |
36 |
for b n :: int |
|
54871 | 37 |
by (metis add_less_same_cancel2 int_mod_ge mod_add_self2) |
24333 | 38 |
|
65363 | 39 |
lemma int_mod_le': "0 \<le> b - n \<Longrightarrow> b mod n \<le> b - n" |
40 |
for b n :: int |
|
54871 | 41 |
by (metis minus_mod_self2 zmod_le_nonneg_dividend) |
24333 | 42 |
|
65363 | 43 |
lemma zless2: "0 < (2 :: int)" |
54869 | 44 |
by (fact zero_less_numeral) |
24465 | 45 |
|
65363 | 46 |
lemma zless2p: "0 < (2 ^ n :: int)" |
53062
3af1a6020014
some vague grouping of related theorems, with slight tuning of headings and sorting out of dubious lemmas into separate theory
haftmann
parents:
51301
diff
changeset
|
47 |
by arith |
24333 | 48 |
|
65363 | 49 |
lemma zle2p: "0 \<le> (2 ^ n :: int)" |
53062
3af1a6020014
some vague grouping of related theorems, with slight tuning of headings and sorting out of dubious lemmas into separate theory
haftmann
parents:
51301
diff
changeset
|
50 |
by arith |
24465 | 51 |
|
65363 | 52 |
lemma m1mod2k: "- 1 mod 2 ^ n = (2 ^ n - 1 :: int)" |
53062
3af1a6020014
some vague grouping of related theorems, with slight tuning of headings and sorting out of dubious lemmas into separate theory
haftmann
parents:
51301
diff
changeset
|
53 |
using zless2p by (rule zmod_minus1) |
24333 | 54 |
|
65363 | 55 |
lemma p1mod22k': "(1 + 2 * b) mod (2 * 2 ^ n) = 1 + 2 * (b mod 2 ^ n)" |
56 |
for b :: int |
|
57 |
using zle2p by (rule pos_zmod_mult_2) |
|
24465 | 58 |
|
65363 | 59 |
lemma p1mod22k: "(2 * b + 1) mod (2 * 2 ^ n) = 2 * (b mod 2 ^ n) + 1" |
60 |
for b :: int |
|
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
54872
diff
changeset
|
61 |
by (simp add: p1mod22k' add.commute) |
24333 | 62 |
|
65363 | 63 |
lemma int_mod_lem: "0 < n \<Longrightarrow> 0 \<le> b \<and> b < n \<longleftrightarrow> b mod n = b" |
64 |
for b n :: int |
|
24333 | 65 |
apply safe |
54871 | 66 |
apply (erule (1) mod_pos_pos_trivial) |
67 |
apply (erule_tac [!] subst) |
|
68 |
apply auto |
|
24333 | 69 |
done |
70 |
||
53062
3af1a6020014
some vague grouping of related theorems, with slight tuning of headings and sorting out of dubious lemmas into separate theory
haftmann
parents:
51301
diff
changeset
|
71 |
end |