author | haftmann |
Sat, 02 Dec 2023 20:49:48 +0000 | |
changeset 79116 | b90bf6636260 |
parent 79072 | a91050cd5c93 |
child 79117 | 7476818dfd5d |
permissions | -rw-r--r-- |
71042
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
1 |
(* Author: Florian Haftmann, TUM |
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
2 |
*) |
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
3 |
|
71956 | 4 |
section \<open>Bit operations in suitable algebraic structures\<close> |
71042
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
5 |
|
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
6 |
theory Bit_Operations |
74101 | 7 |
imports Presburger Groups_List |
8 |
begin |
|
9 |
||
10 |
subsection \<open>Abstract bit structures\<close> |
|
11 |
||
12 |
class semiring_bits = semiring_parity + |
|
13 |
assumes bits_induct [case_names stable rec]: |
|
14 |
\<open>(\<And>a. a div 2 = a \<Longrightarrow> P a) |
|
15 |
\<Longrightarrow> (\<And>a b. P a \<Longrightarrow> (of_bool b + 2 * a) div 2 = a \<Longrightarrow> P (of_bool b + 2 * a)) |
|
16 |
\<Longrightarrow> P a\<close> |
|
17 |
assumes bits_div_0 [simp]: \<open>0 div a = 0\<close> |
|
18 |
and bits_div_by_1 [simp]: \<open>a div 1 = a\<close> |
|
19 |
and bits_mod_div_trivial [simp]: \<open>a mod b div b = 0\<close> |
|
20 |
and even_succ_div_2 [simp]: \<open>even a \<Longrightarrow> (1 + a) div 2 = a div 2\<close> |
|
21 |
and even_mask_div_iff: \<open>even ((2 ^ m - 1) div 2 ^ n) \<longleftrightarrow> 2 ^ n = 0 \<or> m \<le> n\<close> |
|
22 |
and exp_div_exp_eq: \<open>2 ^ m div 2 ^ n = of_bool (2 ^ m \<noteq> 0 \<and> m \<ge> n) * 2 ^ (m - n)\<close> |
|
23 |
and div_exp_eq: \<open>a div 2 ^ m div 2 ^ n = a div 2 ^ (m + n)\<close> |
|
24 |
and mod_exp_eq: \<open>a mod 2 ^ m mod 2 ^ n = a mod 2 ^ min m n\<close> |
|
25 |
and mult_exp_mod_exp_eq: \<open>m \<le> n \<Longrightarrow> (a * 2 ^ m) mod (2 ^ n) = (a mod 2 ^ (n - m)) * 2 ^ m\<close> |
|
26 |
and div_exp_mod_exp_eq: \<open>a div 2 ^ n mod 2 ^ m = a mod (2 ^ (n + m)) div 2 ^ n\<close> |
|
27 |
and even_mult_exp_div_exp_iff: \<open>even (a * 2 ^ m div 2 ^ n) \<longleftrightarrow> m > n \<or> 2 ^ n = 0 \<or> (m \<le> n \<and> even (a div 2 ^ (n - m)))\<close> |
|
28 |
fixes bit :: \<open>'a \<Rightarrow> nat \<Rightarrow> bool\<close> |
|
29 |
assumes bit_iff_odd: \<open>bit a n \<longleftrightarrow> odd (a div 2 ^ n)\<close> |
|
30 |
begin |
|
31 |
||
32 |
text \<open> |
|
33 |
Having \<^const>\<open>bit\<close> as definitional class operation |
|
34 |
takes into account that specific instances can be implemented |
|
35 |
differently wrt. code generation. |
|
36 |
\<close> |
|
37 |
||
38 |
lemma bits_div_by_0 [simp]: |
|
39 |
\<open>a div 0 = 0\<close> |
|
40 |
by (metis add_cancel_right_right bits_mod_div_trivial mod_mult_div_eq mult_not_zero) |
|
41 |
||
42 |
lemma bits_1_div_2 [simp]: |
|
43 |
\<open>1 div 2 = 0\<close> |
|
44 |
using even_succ_div_2 [of 0] by simp |
|
45 |
||
46 |
lemma bits_1_div_exp [simp]: |
|
47 |
\<open>1 div 2 ^ n = of_bool (n = 0)\<close> |
|
48 |
using div_exp_eq [of 1 1] by (cases n) simp_all |
|
49 |
||
50 |
lemma even_succ_div_exp [simp]: |
|
51 |
\<open>(1 + a) div 2 ^ n = a div 2 ^ n\<close> if \<open>even a\<close> and \<open>n > 0\<close> |
|
52 |
proof (cases n) |
|
53 |
case 0 |
|
54 |
with that show ?thesis |
|
55 |
by simp |
|
56 |
next |
|
57 |
case (Suc n) |
|
58 |
with \<open>even a\<close> have \<open>(1 + a) div 2 ^ Suc n = a div 2 ^ Suc n\<close> |
|
59 |
proof (induction n) |
|
60 |
case 0 |
|
61 |
then show ?case |
|
62 |
by simp |
|
63 |
next |
|
64 |
case (Suc n) |
|
65 |
then show ?case |
|
66 |
using div_exp_eq [of _ 1 \<open>Suc n\<close>, symmetric] |
|
67 |
by simp |
|
68 |
qed |
|
69 |
with Suc show ?thesis |
|
70 |
by simp |
|
71 |
qed |
|
72 |
||
73 |
lemma even_succ_mod_exp [simp]: |
|
74 |
\<open>(1 + a) mod 2 ^ n = 1 + (a mod 2 ^ n)\<close> if \<open>even a\<close> and \<open>n > 0\<close> |
|
79017 | 75 |
using div_mult_mod_eq [of \<open>1 + a\<close> \<open>2 ^ n\<close>] div_mult_mod_eq [of a \<open>2 ^ n\<close>] that |
76 |
by simp (metis (full_types) add.left_commute add_left_imp_eq) |
|
74101 | 77 |
|
78 |
lemma bits_mod_by_1 [simp]: |
|
79 |
\<open>a mod 1 = 0\<close> |
|
80 |
using div_mult_mod_eq [of a 1] by simp |
|
81 |
||
82 |
lemma bits_mod_0 [simp]: |
|
83 |
\<open>0 mod a = 0\<close> |
|
84 |
using div_mult_mod_eq [of 0 a] by simp |
|
85 |
||
86 |
lemma bits_one_mod_two_eq_one [simp]: |
|
87 |
\<open>1 mod 2 = 1\<close> |
|
88 |
by (simp add: mod2_eq_if) |
|
89 |
||
75085 | 90 |
lemma bit_0: |
74101 | 91 |
\<open>bit a 0 \<longleftrightarrow> odd a\<close> |
92 |
by (simp add: bit_iff_odd) |
|
93 |
||
94 |
lemma bit_Suc: |
|
95 |
\<open>bit a (Suc n) \<longleftrightarrow> bit (a div 2) n\<close> |
|
96 |
using div_exp_eq [of a 1 n] by (simp add: bit_iff_odd) |
|
97 |
||
98 |
lemma bit_rec: |
|
99 |
\<open>bit a n \<longleftrightarrow> (if n = 0 then odd a else bit (a div 2) (n - 1))\<close> |
|
75085 | 100 |
by (cases n) (simp_all add: bit_Suc bit_0) |
74101 | 101 |
|
102 |
lemma bit_0_eq [simp]: |
|
79071 | 103 |
\<open>bit 0 = \<bottom>\<close> |
74101 | 104 |
by (simp add: fun_eq_iff bit_iff_odd) |
105 |
||
106 |
context |
|
107 |
fixes a |
|
108 |
assumes stable: \<open>a div 2 = a\<close> |
|
109 |
begin |
|
110 |
||
111 |
lemma bits_stable_imp_add_self: |
|
112 |
\<open>a + a mod 2 = 0\<close> |
|
113 |
proof - |
|
114 |
have \<open>a div 2 * 2 + a mod 2 = a\<close> |
|
115 |
by (fact div_mult_mod_eq) |
|
116 |
then have \<open>a * 2 + a mod 2 = a\<close> |
|
117 |
by (simp add: stable) |
|
118 |
then show ?thesis |
|
119 |
by (simp add: mult_2_right ac_simps) |
|
120 |
qed |
|
121 |
||
122 |
lemma stable_imp_bit_iff_odd: |
|
123 |
\<open>bit a n \<longleftrightarrow> odd a\<close> |
|
75085 | 124 |
by (induction n) (simp_all add: stable bit_Suc bit_0) |
74101 | 125 |
|
126 |
end |
|
127 |
||
128 |
lemma bit_iff_idd_imp_stable: |
|
129 |
\<open>a div 2 = a\<close> if \<open>\<And>n. bit a n \<longleftrightarrow> odd a\<close> |
|
130 |
using that proof (induction a rule: bits_induct) |
|
131 |
case (stable a) |
|
132 |
then show ?case |
|
133 |
by simp |
|
134 |
next |
|
135 |
case (rec a b) |
|
136 |
from rec.prems [of 1] have [simp]: \<open>b = odd a\<close> |
|
75085 | 137 |
by (simp add: rec.hyps bit_Suc bit_0) |
74101 | 138 |
from rec.hyps have hyp: \<open>(of_bool (odd a) + 2 * a) div 2 = a\<close> |
139 |
by simp |
|
140 |
have \<open>bit a n \<longleftrightarrow> odd a\<close> for n |
|
141 |
using rec.prems [of \<open>Suc n\<close>] by (simp add: hyp bit_Suc) |
|
142 |
then have \<open>a div 2 = a\<close> |
|
143 |
by (rule rec.IH) |
|
144 |
then have \<open>of_bool (odd a) + 2 * a = 2 * (a div 2) + of_bool (odd a)\<close> |
|
145 |
by (simp add: ac_simps) |
|
146 |
also have \<open>\<dots> = a\<close> |
|
147 |
using mult_div_mod_eq [of 2 a] |
|
148 |
by (simp add: of_bool_odd_eq_mod_2) |
|
149 |
finally show ?case |
|
150 |
using \<open>a div 2 = a\<close> by (simp add: hyp) |
|
151 |
qed |
|
152 |
||
153 |
lemma exp_eq_0_imp_not_bit: |
|
154 |
\<open>\<not> bit a n\<close> if \<open>2 ^ n = 0\<close> |
|
155 |
using that by (simp add: bit_iff_odd) |
|
156 |
||
79017 | 157 |
definition possible_bit :: \<open>'a itself \<Rightarrow> nat \<Rightarrow> bool\<close> |
158 |
where \<open>possible_bit TYPE('a) n \<longleftrightarrow> 2 ^ n \<noteq> 0\<close> |
|
79018
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
159 |
\<comment> \<open>This auxiliary avoids non-termination with extensionality.\<close> |
79017 | 160 |
|
161 |
lemma possible_bit_0 [simp]: |
|
162 |
\<open>possible_bit TYPE('a) 0\<close> |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
163 |
by (simp add: possible_bit_def) |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
164 |
|
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
165 |
lemma fold_possible_bit: |
79017 | 166 |
\<open>2 ^ n = 0 \<longleftrightarrow> \<not> possible_bit TYPE('a) n\<close> |
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
167 |
by (simp add: possible_bit_def) |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
168 |
|
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
169 |
lemma bit_imp_possible_bit: |
79017 | 170 |
\<open>possible_bit TYPE('a) n\<close> if \<open>bit a n\<close> |
171 |
using that by (auto simp add: possible_bit_def exp_eq_0_imp_not_bit) |
|
172 |
||
173 |
lemma impossible_bit: |
|
174 |
\<open>\<not> bit a n\<close> if \<open>\<not> possible_bit TYPE('a) n\<close> |
|
175 |
using that by (blast dest: bit_imp_possible_bit) |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
176 |
|
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
177 |
lemma possible_bit_less_imp: |
79017 | 178 |
\<open>possible_bit TYPE('a) j\<close> if \<open>possible_bit TYPE('a) i\<close> \<open>j \<le> i\<close> |
179 |
using power_add [of 2 j \<open>i - j\<close>] that mult_not_zero [of \<open>2 ^ j\<close> \<open>2 ^ (i - j)\<close>] |
|
180 |
by (simp add: possible_bit_def) |
|
181 |
||
182 |
lemma possible_bit_min [simp]: |
|
183 |
\<open>possible_bit TYPE('a) (min i j) \<longleftrightarrow> possible_bit TYPE('a) i \<or> possible_bit TYPE('a) j\<close> |
|
184 |
by (auto simp add: min_def elim: possible_bit_less_imp) |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
185 |
|
74101 | 186 |
lemma bit_eqI: |
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
187 |
\<open>a = b\<close> if \<open>\<And>n. possible_bit TYPE('a) n \<Longrightarrow> bit a n \<longleftrightarrow> bit b n\<close> |
74101 | 188 |
proof - |
189 |
have \<open>bit a n \<longleftrightarrow> bit b n\<close> for n |
|
190 |
proof (cases \<open>2 ^ n = 0\<close>) |
|
191 |
case True |
|
192 |
then show ?thesis |
|
193 |
by (simp add: exp_eq_0_imp_not_bit) |
|
194 |
next |
|
195 |
case False |
|
196 |
then show ?thesis |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
197 |
by (rule that[unfolded possible_bit_def]) |
74101 | 198 |
qed |
199 |
then show ?thesis proof (induction a arbitrary: b rule: bits_induct) |
|
200 |
case (stable a) |
|
201 |
from stable(2) [of 0] have **: \<open>even b \<longleftrightarrow> even a\<close> |
|
75085 | 202 |
by (simp add: bit_0) |
74101 | 203 |
have \<open>b div 2 = b\<close> |
204 |
proof (rule bit_iff_idd_imp_stable) |
|
205 |
fix n |
|
206 |
from stable have *: \<open>bit b n \<longleftrightarrow> bit a n\<close> |
|
207 |
by simp |
|
208 |
also have \<open>bit a n \<longleftrightarrow> odd a\<close> |
|
209 |
using stable by (simp add: stable_imp_bit_iff_odd) |
|
210 |
finally show \<open>bit b n \<longleftrightarrow> odd b\<close> |
|
211 |
by (simp add: **) |
|
212 |
qed |
|
213 |
from ** have \<open>a mod 2 = b mod 2\<close> |
|
214 |
by (simp add: mod2_eq_if) |
|
215 |
then have \<open>a mod 2 + (a + b) = b mod 2 + (a + b)\<close> |
|
216 |
by simp |
|
217 |
then have \<open>a + a mod 2 + b = b + b mod 2 + a\<close> |
|
218 |
by (simp add: ac_simps) |
|
219 |
with \<open>a div 2 = a\<close> \<open>b div 2 = b\<close> show ?case |
|
220 |
by (simp add: bits_stable_imp_add_self) |
|
221 |
next |
|
222 |
case (rec a p) |
|
223 |
from rec.prems [of 0] have [simp]: \<open>p = odd b\<close> |
|
75085 | 224 |
by (simp add: bit_0) |
74101 | 225 |
from rec.hyps have \<open>bit a n \<longleftrightarrow> bit (b div 2) n\<close> for n |
226 |
using rec.prems [of \<open>Suc n\<close>] by (simp add: bit_Suc) |
|
227 |
then have \<open>a = b div 2\<close> |
|
228 |
by (rule rec.IH) |
|
229 |
then have \<open>2 * a = 2 * (b div 2)\<close> |
|
230 |
by simp |
|
231 |
then have \<open>b mod 2 + 2 * a = b mod 2 + 2 * (b div 2)\<close> |
|
232 |
by simp |
|
233 |
also have \<open>\<dots> = b\<close> |
|
234 |
by (fact mod_mult_div_eq) |
|
235 |
finally show ?case |
|
236 |
by (auto simp add: mod2_eq_if) |
|
237 |
qed |
|
238 |
qed |
|
239 |
||
240 |
lemma bit_eq_iff: |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
241 |
\<open>a = b \<longleftrightarrow> (\<forall>n. possible_bit TYPE('a) n \<longrightarrow> bit a n \<longleftrightarrow> bit b n)\<close> |
74101 | 242 |
by (auto intro: bit_eqI) |
243 |
||
244 |
named_theorems bit_simps \<open>Simplification rules for \<^const>\<open>bit\<close>\<close> |
|
245 |
||
246 |
lemma bit_exp_iff [bit_simps]: |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
247 |
\<open>bit (2 ^ m) n \<longleftrightarrow> possible_bit TYPE('a) n \<and> m = n\<close> |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
248 |
by (auto simp add: bit_iff_odd exp_div_exp_eq possible_bit_def) |
74101 | 249 |
|
250 |
lemma bit_1_iff [bit_simps]: |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
251 |
\<open>bit 1 n \<longleftrightarrow> n = 0\<close> |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
252 |
using bit_exp_iff [of 0 n] |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
253 |
by auto |
74101 | 254 |
|
255 |
lemma bit_2_iff [bit_simps]: |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
256 |
\<open>bit 2 n \<longleftrightarrow> possible_bit TYPE('a) 1 \<and> n = 1\<close> |
74101 | 257 |
using bit_exp_iff [of 1 n] by auto |
258 |
||
259 |
lemma even_bit_succ_iff: |
|
260 |
\<open>bit (1 + a) n \<longleftrightarrow> bit a n \<or> n = 0\<close> if \<open>even a\<close> |
|
261 |
using that by (cases \<open>n = 0\<close>) (simp_all add: bit_iff_odd) |
|
262 |
||
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
263 |
lemma bit_double_iff [bit_simps]: |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
264 |
\<open>bit (2 * a) n \<longleftrightarrow> bit a (n - 1) \<and> n \<noteq> 0 \<and> possible_bit TYPE('a) n\<close> |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
265 |
using even_mult_exp_div_exp_iff [of a 1 n] |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
266 |
by (cases n, auto simp add: bit_iff_odd ac_simps possible_bit_def) |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
267 |
|
74101 | 268 |
lemma odd_bit_iff_bit_pred: |
269 |
\<open>bit a n \<longleftrightarrow> bit (a - 1) n \<or> n = 0\<close> if \<open>odd a\<close> |
|
270 |
proof - |
|
271 |
from \<open>odd a\<close> obtain b where \<open>a = 2 * b + 1\<close> .. |
|
272 |
moreover have \<open>bit (2 * b) n \<or> n = 0 \<longleftrightarrow> bit (1 + 2 * b) n\<close> |
|
273 |
using even_bit_succ_iff by simp |
|
274 |
ultimately show ?thesis by (simp add: ac_simps) |
|
275 |
qed |
|
276 |
||
277 |
lemma bit_eq_rec: |
|
278 |
\<open>a = b \<longleftrightarrow> (even a \<longleftrightarrow> even b) \<and> a div 2 = b div 2\<close> (is \<open>?P = ?Q\<close>) |
|
279 |
proof |
|
280 |
assume ?P |
|
281 |
then show ?Q |
|
282 |
by simp |
|
283 |
next |
|
284 |
assume ?Q |
|
285 |
then have \<open>even a \<longleftrightarrow> even b\<close> and \<open>a div 2 = b div 2\<close> |
|
286 |
by simp_all |
|
287 |
show ?P |
|
288 |
proof (rule bit_eqI) |
|
289 |
fix n |
|
290 |
show \<open>bit a n \<longleftrightarrow> bit b n\<close> |
|
291 |
proof (cases n) |
|
292 |
case 0 |
|
293 |
with \<open>even a \<longleftrightarrow> even b\<close> show ?thesis |
|
75085 | 294 |
by (simp add: bit_0) |
74101 | 295 |
next |
296 |
case (Suc n) |
|
297 |
moreover from \<open>a div 2 = b div 2\<close> have \<open>bit (a div 2) n = bit (b div 2) n\<close> |
|
298 |
by simp |
|
299 |
ultimately show ?thesis |
|
300 |
by (simp add: bit_Suc) |
|
301 |
qed |
|
302 |
qed |
|
303 |
qed |
|
304 |
||
305 |
lemma bit_mod_2_iff [simp]: |
|
306 |
\<open>bit (a mod 2) n \<longleftrightarrow> n = 0 \<and> odd a\<close> |
|
307 |
by (cases a rule: parity_cases) (simp_all add: bit_iff_odd) |
|
308 |
||
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
309 |
lemma bit_mask_sub_iff: |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
310 |
\<open>bit (2 ^ m - 1) n \<longleftrightarrow> possible_bit TYPE('a) n \<and> n < m\<close> |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
311 |
by (simp add: bit_iff_odd even_mask_div_iff not_le possible_bit_def) |
74101 | 312 |
|
313 |
lemma exp_add_not_zero_imp: |
|
314 |
\<open>2 ^ m \<noteq> 0\<close> and \<open>2 ^ n \<noteq> 0\<close> if \<open>2 ^ (m + n) \<noteq> 0\<close> |
|
315 |
proof - |
|
316 |
have \<open>\<not> (2 ^ m = 0 \<or> 2 ^ n = 0)\<close> |
|
317 |
proof (rule notI) |
|
318 |
assume \<open>2 ^ m = 0 \<or> 2 ^ n = 0\<close> |
|
319 |
then have \<open>2 ^ (m + n) = 0\<close> |
|
320 |
by (rule disjE) (simp_all add: power_add) |
|
321 |
with that show False .. |
|
322 |
qed |
|
323 |
then show \<open>2 ^ m \<noteq> 0\<close> and \<open>2 ^ n \<noteq> 0\<close> |
|
324 |
by simp_all |
|
325 |
qed |
|
326 |
||
327 |
lemma bit_disjunctive_add_iff: |
|
328 |
\<open>bit (a + b) n \<longleftrightarrow> bit a n \<or> bit b n\<close> |
|
329 |
if \<open>\<And>n. \<not> bit a n \<or> \<not> bit b n\<close> |
|
330 |
proof (cases \<open>2 ^ n = 0\<close>) |
|
331 |
case True |
|
332 |
then show ?thesis |
|
333 |
by (simp add: exp_eq_0_imp_not_bit) |
|
334 |
next |
|
335 |
case False |
|
336 |
with that show ?thesis proof (induction n arbitrary: a b) |
|
337 |
case 0 |
|
338 |
from "0.prems"(1) [of 0] show ?case |
|
75085 | 339 |
by (auto simp add: bit_0) |
74101 | 340 |
next |
341 |
case (Suc n) |
|
342 |
from Suc.prems(1) [of 0] have even: \<open>even a \<or> even b\<close> |
|
75085 | 343 |
by (auto simp add: bit_0) |
74101 | 344 |
have bit: \<open>\<not> bit (a div 2) n \<or> \<not> bit (b div 2) n\<close> for n |
345 |
using Suc.prems(1) [of \<open>Suc n\<close>] by (simp add: bit_Suc) |
|
346 |
from Suc.prems(2) have \<open>2 * 2 ^ n \<noteq> 0\<close> \<open>2 ^ n \<noteq> 0\<close> |
|
347 |
by (auto simp add: mult_2) |
|
348 |
have \<open>a + b = (a div 2 * 2 + a mod 2) + (b div 2 * 2 + b mod 2)\<close> |
|
349 |
using div_mult_mod_eq [of a 2] div_mult_mod_eq [of b 2] by simp |
|
350 |
also have \<open>\<dots> = of_bool (odd a \<or> odd b) + 2 * (a div 2 + b div 2)\<close> |
|
351 |
using even by (auto simp add: algebra_simps mod2_eq_if) |
|
352 |
finally have \<open>bit ((a + b) div 2) n \<longleftrightarrow> bit (a div 2 + b div 2) n\<close> |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
353 |
using \<open>2 * 2 ^ n \<noteq> 0\<close> by simp (simp_all flip: bit_Suc add: bit_double_iff possible_bit_def) |
74101 | 354 |
also have \<open>\<dots> \<longleftrightarrow> bit (a div 2) n \<or> bit (b div 2) n\<close> |
355 |
using bit \<open>2 ^ n \<noteq> 0\<close> by (rule Suc.IH) |
|
356 |
finally show ?case |
|
357 |
by (simp add: bit_Suc) |
|
358 |
qed |
|
359 |
qed |
|
360 |
||
361 |
lemma |
|
362 |
exp_add_not_zero_imp_left: \<open>2 ^ m \<noteq> 0\<close> |
|
363 |
and exp_add_not_zero_imp_right: \<open>2 ^ n \<noteq> 0\<close> |
|
364 |
if \<open>2 ^ (m + n) \<noteq> 0\<close> |
|
365 |
proof - |
|
366 |
have \<open>\<not> (2 ^ m = 0 \<or> 2 ^ n = 0)\<close> |
|
367 |
proof (rule notI) |
|
368 |
assume \<open>2 ^ m = 0 \<or> 2 ^ n = 0\<close> |
|
369 |
then have \<open>2 ^ (m + n) = 0\<close> |
|
370 |
by (rule disjE) (simp_all add: power_add) |
|
371 |
with that show False .. |
|
372 |
qed |
|
373 |
then show \<open>2 ^ m \<noteq> 0\<close> and \<open>2 ^ n \<noteq> 0\<close> |
|
374 |
by simp_all |
|
375 |
qed |
|
376 |
||
377 |
lemma exp_not_zero_imp_exp_diff_not_zero: |
|
378 |
\<open>2 ^ (n - m) \<noteq> 0\<close> if \<open>2 ^ n \<noteq> 0\<close> |
|
379 |
proof (cases \<open>m \<le> n\<close>) |
|
380 |
case True |
|
381 |
moreover define q where \<open>q = n - m\<close> |
|
382 |
ultimately have \<open>n = m + q\<close> |
|
383 |
by simp |
|
384 |
with that show ?thesis |
|
385 |
by (simp add: exp_add_not_zero_imp_right) |
|
386 |
next |
|
387 |
case False |
|
388 |
with that show ?thesis |
|
389 |
by simp |
|
390 |
qed |
|
391 |
||
79017 | 392 |
lemma bit_of_bool_iff [bit_simps]: |
393 |
\<open>bit (of_bool b) n \<longleftrightarrow> b \<and> n = 0\<close> |
|
394 |
by (simp add: bit_1_iff) |
|
395 |
||
74101 | 396 |
end |
397 |
||
398 |
lemma nat_bit_induct [case_names zero even odd]: |
|
79017 | 399 |
\<open>P n\<close> if zero: \<open>P 0\<close> |
400 |
and even: \<open>\<And>n. P n \<Longrightarrow> n > 0 \<Longrightarrow> P (2 * n)\<close> |
|
401 |
and odd: \<open>\<And>n. P n \<Longrightarrow> P (Suc (2 * n))\<close> |
|
74101 | 402 |
proof (induction n rule: less_induct) |
403 |
case (less n) |
|
79017 | 404 |
show \<open>P n\<close> |
405 |
proof (cases \<open>n = 0\<close>) |
|
74101 | 406 |
case True with zero show ?thesis by simp |
407 |
next |
|
408 |
case False |
|
79017 | 409 |
with less have hyp: \<open>P (n div 2)\<close> by simp |
74101 | 410 |
show ?thesis |
79017 | 411 |
proof (cases \<open>even n\<close>) |
74101 | 412 |
case True |
79017 | 413 |
then have \<open>n \<noteq> 1\<close> |
74101 | 414 |
by auto |
79017 | 415 |
with \<open>n \<noteq> 0\<close> have \<open>n div 2 > 0\<close> |
74101 | 416 |
by simp |
79017 | 417 |
with \<open>even n\<close> hyp even [of \<open>n div 2\<close>] show ?thesis |
74101 | 418 |
by simp |
419 |
next |
|
420 |
case False |
|
79017 | 421 |
with hyp odd [of \<open>n div 2\<close>] show ?thesis |
74101 | 422 |
by simp |
423 |
qed |
|
424 |
qed |
|
425 |
qed |
|
426 |
||
427 |
instantiation nat :: semiring_bits |
|
428 |
begin |
|
429 |
||
430 |
definition bit_nat :: \<open>nat \<Rightarrow> nat \<Rightarrow> bool\<close> |
|
431 |
where \<open>bit_nat m n \<longleftrightarrow> odd (m div 2 ^ n)\<close> |
|
432 |
||
433 |
instance |
|
434 |
proof |
|
435 |
show \<open>P n\<close> if stable: \<open>\<And>n. n div 2 = n \<Longrightarrow> P n\<close> |
|
436 |
and rec: \<open>\<And>n b. P n \<Longrightarrow> (of_bool b + 2 * n) div 2 = n \<Longrightarrow> P (of_bool b + 2 * n)\<close> |
|
437 |
for P and n :: nat |
|
438 |
proof (induction n rule: nat_bit_induct) |
|
439 |
case zero |
|
440 |
from stable [of 0] show ?case |
|
441 |
by simp |
|
442 |
next |
|
443 |
case (even n) |
|
444 |
with rec [of n False] show ?case |
|
445 |
by simp |
|
446 |
next |
|
447 |
case (odd n) |
|
448 |
with rec [of n True] show ?case |
|
449 |
by simp |
|
450 |
qed |
|
451 |
show \<open>q mod 2 ^ m mod 2 ^ n = q mod 2 ^ min m n\<close> |
|
452 |
for q m n :: nat |
|
453 |
apply (auto simp add: less_iff_Suc_add power_add mod_mod_cancel split: split_min_lin) |
|
454 |
apply (metis div_mult2_eq mod_div_trivial mod_eq_self_iff_div_eq_0 mod_mult_self2_is_0 power_commutes) |
|
455 |
done |
|
456 |
show \<open>(q * 2 ^ m) mod (2 ^ n) = (q mod 2 ^ (n - m)) * 2 ^ m\<close> if \<open>m \<le> n\<close> |
|
457 |
for q m n :: nat |
|
458 |
using that |
|
459 |
apply (auto simp add: mod_mod_cancel div_mult2_eq power_add mod_mult2_eq le_iff_add split: split_min_lin) |
|
460 |
done |
|
461 |
show \<open>even ((2 ^ m - (1::nat)) div 2 ^ n) \<longleftrightarrow> 2 ^ n = (0::nat) \<or> m \<le> n\<close> |
|
462 |
for m n :: nat |
|
463 |
using even_mask_div_iff' [where ?'a = nat, of m n] by simp |
|
464 |
show \<open>even (q * 2 ^ m div 2 ^ n) \<longleftrightarrow> n < m \<or> (2::nat) ^ n = 0 \<or> m \<le> n \<and> even (q div 2 ^ (n - m))\<close> |
|
465 |
for m n q r :: nat |
|
466 |
apply (auto simp add: not_less power_add ac_simps dest!: le_Suc_ex) |
|
467 |
apply (metis (full_types) dvd_mult dvd_mult_imp_div dvd_power_iff_le not_less not_less_eq order_refl power_Suc) |
|
468 |
done |
|
469 |
qed (auto simp add: div_mult2_eq mod_mult2_eq power_add power_diff bit_nat_def) |
|
470 |
||
471 |
end |
|
472 |
||
79017 | 473 |
lemma possible_bit_nat [simp]: |
474 |
\<open>possible_bit TYPE(nat) n\<close> |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
475 |
by (simp add: possible_bit_def) |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
476 |
|
79069 | 477 |
lemma bit_Suc_0_iff [bit_simps]: |
478 |
\<open>bit (Suc 0) n \<longleftrightarrow> n = 0\<close> |
|
479 |
using bit_1_iff [of n, where ?'a = nat] by simp |
|
480 |
||
74497 | 481 |
lemma not_bit_Suc_0_Suc [simp]: |
482 |
\<open>\<not> bit (Suc 0) (Suc n)\<close> |
|
483 |
by (simp add: bit_Suc) |
|
484 |
||
485 |
lemma not_bit_Suc_0_numeral [simp]: |
|
486 |
\<open>\<not> bit (Suc 0) (numeral n)\<close> |
|
487 |
by (simp add: numeral_eq_Suc) |
|
488 |
||
74101 | 489 |
context semiring_bits |
490 |
begin |
|
491 |
||
492 |
lemma bit_of_nat_iff [bit_simps]: |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
493 |
\<open>bit (of_nat m) n \<longleftrightarrow> possible_bit TYPE('a) n \<and> bit m n\<close> |
74101 | 494 |
proof (cases \<open>(2::'a) ^ n = 0\<close>) |
495 |
case True |
|
496 |
then show ?thesis |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
497 |
by (simp add: exp_eq_0_imp_not_bit possible_bit_def) |
74101 | 498 |
next |
499 |
case False |
|
500 |
then have \<open>bit (of_nat m) n \<longleftrightarrow> bit m n\<close> |
|
501 |
proof (induction m arbitrary: n rule: nat_bit_induct) |
|
502 |
case zero |
|
503 |
then show ?case |
|
504 |
by simp |
|
505 |
next |
|
506 |
case (even m) |
|
507 |
then show ?case |
|
508 |
by (cases n) |
|
75085 | 509 |
(auto simp add: bit_double_iff Bit_Operations.bit_double_iff possible_bit_def bit_0 dest: mult_not_zero) |
74101 | 510 |
next |
511 |
case (odd m) |
|
512 |
then show ?case |
|
513 |
by (cases n) |
|
75085 | 514 |
(auto simp add: bit_double_iff even_bit_succ_iff possible_bit_def |
515 |
Bit_Operations.bit_Suc Bit_Operations.bit_0 dest: mult_not_zero) |
|
74101 | 516 |
qed |
517 |
with False show ?thesis |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
518 |
by (simp add: possible_bit_def) |
74101 | 519 |
qed |
520 |
||
521 |
end |
|
522 |
||
79017 | 523 |
lemma int_bit_induct [case_names zero minus even odd]: |
524 |
\<open>P k\<close> if zero_int: \<open>P 0\<close> |
|
525 |
and minus_int: \<open>P (- 1)\<close> |
|
526 |
and even_int: \<open>\<And>k. P k \<Longrightarrow> k \<noteq> 0 \<Longrightarrow> P (k * 2)\<close> |
|
527 |
and odd_int: \<open>\<And>k. P k \<Longrightarrow> k \<noteq> - 1 \<Longrightarrow> P (1 + (k * 2))\<close> for k :: int |
|
528 |
proof (cases \<open>k \<ge> 0\<close>) |
|
529 |
case True |
|
530 |
define n where \<open>n = nat k\<close> |
|
531 |
with True have \<open>k = int n\<close> |
|
532 |
by simp |
|
533 |
then show \<open>P k\<close> |
|
534 |
proof (induction n arbitrary: k rule: nat_bit_induct) |
|
535 |
case zero |
|
536 |
then show ?case |
|
537 |
by (simp add: zero_int) |
|
538 |
next |
|
539 |
case (even n) |
|
540 |
have \<open>P (int n * 2)\<close> |
|
541 |
by (rule even_int) (use even in simp_all) |
|
542 |
with even show ?case |
|
543 |
by (simp add: ac_simps) |
|
544 |
next |
|
545 |
case (odd n) |
|
546 |
have \<open>P (1 + (int n * 2))\<close> |
|
547 |
by (rule odd_int) (use odd in simp_all) |
|
548 |
with odd show ?case |
|
549 |
by (simp add: ac_simps) |
|
550 |
qed |
|
551 |
next |
|
552 |
case False |
|
553 |
define n where \<open>n = nat (- k - 1)\<close> |
|
554 |
with False have \<open>k = - int n - 1\<close> |
|
555 |
by simp |
|
556 |
then show \<open>P k\<close> |
|
557 |
proof (induction n arbitrary: k rule: nat_bit_induct) |
|
558 |
case zero |
|
559 |
then show ?case |
|
560 |
by (simp add: minus_int) |
|
561 |
next |
|
562 |
case (even n) |
|
563 |
have \<open>P (1 + (- int (Suc n) * 2))\<close> |
|
564 |
by (rule odd_int) (use even in \<open>simp_all add: algebra_simps\<close>) |
|
565 |
also have \<open>\<dots> = - int (2 * n) - 1\<close> |
|
566 |
by (simp add: algebra_simps) |
|
567 |
finally show ?case |
|
568 |
using even.prems by simp |
|
569 |
next |
|
570 |
case (odd n) |
|
571 |
have \<open>P (- int (Suc n) * 2)\<close> |
|
572 |
by (rule even_int) (use odd in \<open>simp_all add: algebra_simps\<close>) |
|
573 |
also have \<open>\<dots> = - int (Suc (2 * n)) - 1\<close> |
|
574 |
by (simp add: algebra_simps) |
|
575 |
finally show ?case |
|
576 |
using odd.prems by simp |
|
577 |
qed |
|
578 |
qed |
|
579 |
||
74101 | 580 |
instantiation int :: semiring_bits |
581 |
begin |
|
582 |
||
583 |
definition bit_int :: \<open>int \<Rightarrow> nat \<Rightarrow> bool\<close> |
|
584 |
where \<open>bit_int k n \<longleftrightarrow> odd (k div 2 ^ n)\<close> |
|
585 |
||
586 |
instance |
|
587 |
proof |
|
588 |
show \<open>P k\<close> if stable: \<open>\<And>k. k div 2 = k \<Longrightarrow> P k\<close> |
|
589 |
and rec: \<open>\<And>k b. P k \<Longrightarrow> (of_bool b + 2 * k) div 2 = k \<Longrightarrow> P (of_bool b + 2 * k)\<close> |
|
590 |
for P and k :: int |
|
591 |
proof (induction k rule: int_bit_induct) |
|
592 |
case zero |
|
593 |
from stable [of 0] show ?case |
|
594 |
by simp |
|
595 |
next |
|
596 |
case minus |
|
597 |
from stable [of \<open>- 1\<close>] show ?case |
|
598 |
by simp |
|
599 |
next |
|
600 |
case (even k) |
|
601 |
with rec [of k False] show ?case |
|
602 |
by (simp add: ac_simps) |
|
603 |
next |
|
604 |
case (odd k) |
|
605 |
with rec [of k True] show ?case |
|
606 |
by (simp add: ac_simps) |
|
607 |
qed |
|
608 |
show \<open>(2::int) ^ m div 2 ^ n = of_bool ((2::int) ^ m \<noteq> 0 \<and> n \<le> m) * 2 ^ (m - n)\<close> |
|
609 |
for m n :: nat |
|
610 |
proof (cases \<open>m < n\<close>) |
|
611 |
case True |
|
612 |
then have \<open>n = m + (n - m)\<close> |
|
613 |
by simp |
|
614 |
then have \<open>(2::int) ^ m div 2 ^ n = (2::int) ^ m div 2 ^ (m + (n - m))\<close> |
|
615 |
by simp |
|
616 |
also have \<open>\<dots> = (2::int) ^ m div (2 ^ m * 2 ^ (n - m))\<close> |
|
617 |
by (simp add: power_add) |
|
618 |
also have \<open>\<dots> = (2::int) ^ m div 2 ^ m div 2 ^ (n - m)\<close> |
|
619 |
by (simp add: zdiv_zmult2_eq) |
|
620 |
finally show ?thesis using \<open>m < n\<close> by simp |
|
621 |
next |
|
622 |
case False |
|
623 |
then show ?thesis |
|
624 |
by (simp add: power_diff) |
|
625 |
qed |
|
626 |
show \<open>k mod 2 ^ m mod 2 ^ n = k mod 2 ^ min m n\<close> |
|
627 |
for m n :: nat and k :: int |
|
628 |
using mod_exp_eq [of \<open>nat k\<close> m n] |
|
629 |
apply (auto simp add: mod_mod_cancel zdiv_zmult2_eq power_add zmod_zmult2_eq le_iff_add split: split_min_lin) |
|
630 |
apply (auto simp add: less_iff_Suc_add mod_mod_cancel power_add) |
|
631 |
apply (simp only: flip: mult.left_commute [of \<open>2 ^ m\<close>]) |
|
632 |
apply (subst zmod_zmult2_eq) apply simp_all |
|
633 |
done |
|
634 |
show \<open>(k * 2 ^ m) mod (2 ^ n) = (k mod 2 ^ (n - m)) * 2 ^ m\<close> |
|
635 |
if \<open>m \<le> n\<close> for m n :: nat and k :: int |
|
636 |
using that |
|
637 |
apply (auto simp add: power_add zmod_zmult2_eq le_iff_add split: split_min_lin) |
|
638 |
done |
|
639 |
show \<open>even ((2 ^ m - (1::int)) div 2 ^ n) \<longleftrightarrow> 2 ^ n = (0::int) \<or> m \<le> n\<close> |
|
640 |
for m n :: nat |
|
641 |
using even_mask_div_iff' [where ?'a = int, of m n] by simp |
|
642 |
show \<open>even (k * 2 ^ m div 2 ^ n) \<longleftrightarrow> n < m \<or> (2::int) ^ n = 0 \<or> m \<le> n \<and> even (k div 2 ^ (n - m))\<close> |
|
643 |
for m n :: nat and k l :: int |
|
644 |
apply (auto simp add: not_less power_add ac_simps dest!: le_Suc_ex) |
|
645 |
apply (metis Suc_leI dvd_mult dvd_mult_imp_div dvd_power_le dvd_refl power.simps(2)) |
|
646 |
done |
|
647 |
qed (auto simp add: zdiv_zmult2_eq zmod_zmult2_eq power_add power_diff not_le bit_int_def) |
|
648 |
||
649 |
end |
|
650 |
||
79017 | 651 |
lemma possible_bit_int [simp]: |
652 |
\<open>possible_bit TYPE(int) n\<close> |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
653 |
by (simp add: possible_bit_def) |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
654 |
|
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
655 |
lemma bit_nat_iff [bit_simps]: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
656 |
\<open>bit (nat k) n \<longleftrightarrow> k \<ge> 0 \<and> bit k n\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
657 |
proof (cases \<open>k \<ge> 0\<close>) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
658 |
case True |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
659 |
moreover define m where \<open>m = nat k\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
660 |
ultimately have \<open>k = int m\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
661 |
by simp |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
662 |
then show ?thesis |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
663 |
by (simp add: bit_simps) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
664 |
next |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
665 |
case False |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
666 |
then show ?thesis |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
667 |
by simp |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
668 |
qed |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
669 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
670 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
671 |
subsection \<open>Bit operations\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
672 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
673 |
class semiring_bit_operations = semiring_bits + |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
674 |
fixes "and" :: \<open>'a \<Rightarrow> 'a \<Rightarrow> 'a\<close> (infixr \<open>AND\<close> 64) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
675 |
and or :: \<open>'a \<Rightarrow> 'a \<Rightarrow> 'a\<close> (infixr \<open>OR\<close> 59) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
676 |
and xor :: \<open>'a \<Rightarrow> 'a \<Rightarrow> 'a\<close> (infixr \<open>XOR\<close> 59) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
677 |
and mask :: \<open>nat \<Rightarrow> 'a\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
678 |
and set_bit :: \<open>nat \<Rightarrow> 'a \<Rightarrow> 'a\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
679 |
and unset_bit :: \<open>nat \<Rightarrow> 'a \<Rightarrow> 'a\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
680 |
and flip_bit :: \<open>nat \<Rightarrow> 'a \<Rightarrow> 'a\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
681 |
and push_bit :: \<open>nat \<Rightarrow> 'a \<Rightarrow> 'a\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
682 |
and drop_bit :: \<open>nat \<Rightarrow> 'a \<Rightarrow> 'a\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
683 |
and take_bit :: \<open>nat \<Rightarrow> 'a \<Rightarrow> 'a\<close> |
79008
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
684 |
assumes and_rec: \<open>a AND b = of_bool (odd a \<and> odd b) + 2 * ((a div 2) AND (b div 2))\<close> |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
685 |
and or_rec: \<open>a OR b = of_bool (odd a \<or> odd b) + 2 * ((a div 2) OR (b div 2))\<close> |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
686 |
and xor_rec: \<open>a XOR b = of_bool (odd a \<noteq> odd b) + 2 * ((a div 2) XOR (b div 2))\<close> |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
687 |
and mask_eq_exp_minus_1: \<open>mask n = 2 ^ n - 1\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
688 |
and set_bit_eq_or: \<open>set_bit n a = a OR push_bit n 1\<close> |
79031
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
689 |
and unset_bit_0 [simp]: \<open>unset_bit 0 a = 2 * (a div 2)\<close> |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
690 |
and unset_bit_Suc: \<open>unset_bit (Suc n) a = a mod 2 + 2 * unset_bit n (a div 2)\<close> |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
691 |
and flip_bit_eq_xor: \<open>flip_bit n a = a XOR push_bit n 1\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
692 |
and push_bit_eq_mult: \<open>push_bit n a = a * 2 ^ n\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
693 |
and drop_bit_eq_div: \<open>drop_bit n a = a div 2 ^ n\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
694 |
and take_bit_eq_mod: \<open>take_bit n a = a mod 2 ^ n\<close> |
71042
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
695 |
begin |
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
696 |
|
74101 | 697 |
text \<open> |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
698 |
We want the bitwise operations to bind slightly weaker |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
699 |
than \<open>+\<close> and \<open>-\<close>. |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
700 |
|
74101 | 701 |
Logically, \<^const>\<open>push_bit\<close>, |
702 |
\<^const>\<open>drop_bit\<close> and \<^const>\<open>take_bit\<close> are just aliases; having them |
|
703 |
as separate operations makes proofs easier, otherwise proof automation |
|
704 |
would fiddle with concrete expressions \<^term>\<open>2 ^ n\<close> in a way obfuscating the basic |
|
705 |
algebraic relationships between those operations. |
|
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
706 |
|
79068 | 707 |
For the sake of code generation operations |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
708 |
are specified as definitional class operations, |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
709 |
taking into account that specific instances of these can be implemented |
74101 | 710 |
differently wrt. code generation. |
711 |
\<close> |
|
712 |
||
79008
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
713 |
lemma bit_and_iff [bit_simps]: |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
714 |
\<open>bit (a AND b) n \<longleftrightarrow> bit a n \<and> bit b n\<close> |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
715 |
proof (induction n arbitrary: a b) |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
716 |
case 0 |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
717 |
show ?case |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
718 |
by (simp add: bit_0 and_rec [of a b] even_bit_succ_iff) |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
719 |
next |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
720 |
case (Suc n) |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
721 |
from Suc [of \<open>a div 2\<close> \<open>b div 2\<close>] |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
722 |
show ?case |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
723 |
by (simp add: and_rec [of a b] bit_Suc) |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
724 |
(auto simp flip: bit_Suc simp add: bit_double_iff dest: bit_imp_possible_bit) |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
725 |
qed |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
726 |
|
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
727 |
lemma bit_or_iff [bit_simps]: |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
728 |
\<open>bit (a OR b) n \<longleftrightarrow> bit a n \<or> bit b n\<close> |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
729 |
proof (induction n arbitrary: a b) |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
730 |
case 0 |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
731 |
show ?case |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
732 |
by (simp add: bit_0 or_rec [of a b] even_bit_succ_iff) |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
733 |
next |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
734 |
case (Suc n) |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
735 |
from Suc [of \<open>a div 2\<close> \<open>b div 2\<close>] |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
736 |
show ?case |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
737 |
by (simp add: or_rec [of a b] bit_Suc) |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
738 |
(auto simp flip: bit_Suc simp add: bit_double_iff dest: bit_imp_possible_bit) |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
739 |
qed |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
740 |
|
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
741 |
lemma bit_xor_iff [bit_simps]: |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
742 |
\<open>bit (a XOR b) n \<longleftrightarrow> bit a n \<noteq> bit b n\<close> |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
743 |
proof (induction n arbitrary: a b) |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
744 |
case 0 |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
745 |
show ?case |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
746 |
by (simp add: bit_0 xor_rec [of a b] even_bit_succ_iff) |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
747 |
next |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
748 |
case (Suc n) |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
749 |
from Suc [of \<open>a div 2\<close> \<open>b div 2\<close>] |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
750 |
show ?case |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
751 |
by (simp add: xor_rec [of a b] bit_Suc) |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
752 |
(auto simp flip: bit_Suc simp add: bit_double_iff dest: bit_imp_possible_bit) |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
753 |
qed |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
754 |
|
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
755 |
sublocale "and": semilattice \<open>(AND)\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
756 |
by standard (auto simp add: bit_eq_iff bit_and_iff) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
757 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
758 |
sublocale or: semilattice_neutr \<open>(OR)\<close> 0 |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
759 |
by standard (auto simp add: bit_eq_iff bit_or_iff) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
760 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
761 |
sublocale xor: comm_monoid \<open>(XOR)\<close> 0 |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
762 |
by standard (auto simp add: bit_eq_iff bit_xor_iff) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
763 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
764 |
lemma even_and_iff: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
765 |
\<open>even (a AND b) \<longleftrightarrow> even a \<or> even b\<close> |
75085 | 766 |
using bit_and_iff [of a b 0] by (auto simp add: bit_0) |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
767 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
768 |
lemma even_or_iff: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
769 |
\<open>even (a OR b) \<longleftrightarrow> even a \<and> even b\<close> |
75085 | 770 |
using bit_or_iff [of a b 0] by (auto simp add: bit_0) |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
771 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
772 |
lemma even_xor_iff: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
773 |
\<open>even (a XOR b) \<longleftrightarrow> (even a \<longleftrightarrow> even b)\<close> |
75085 | 774 |
using bit_xor_iff [of a b 0] by (auto simp add: bit_0) |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
775 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
776 |
lemma zero_and_eq [simp]: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
777 |
\<open>0 AND a = 0\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
778 |
by (simp add: bit_eq_iff bit_and_iff) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
779 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
780 |
lemma and_zero_eq [simp]: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
781 |
\<open>a AND 0 = 0\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
782 |
by (simp add: bit_eq_iff bit_and_iff) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
783 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
784 |
lemma one_and_eq: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
785 |
\<open>1 AND a = a mod 2\<close> |
75085 | 786 |
by (simp add: bit_eq_iff bit_and_iff) (auto simp add: bit_1_iff bit_0) |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
787 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
788 |
lemma and_one_eq: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
789 |
\<open>a AND 1 = a mod 2\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
790 |
using one_and_eq [of a] by (simp add: ac_simps) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
791 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
792 |
lemma one_or_eq: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
793 |
\<open>1 OR a = a + of_bool (even a)\<close> |
75085 | 794 |
by (simp add: bit_eq_iff bit_or_iff add.commute [of _ 1] even_bit_succ_iff) |
795 |
(auto simp add: bit_1_iff bit_0) |
|
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
796 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
797 |
lemma or_one_eq: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
798 |
\<open>a OR 1 = a + of_bool (even a)\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
799 |
using one_or_eq [of a] by (simp add: ac_simps) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
800 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
801 |
lemma one_xor_eq: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
802 |
\<open>1 XOR a = a + of_bool (even a) - of_bool (odd a)\<close> |
75085 | 803 |
by (simp add: bit_eq_iff bit_xor_iff add.commute [of _ 1] even_bit_succ_iff) |
804 |
(auto simp add: bit_1_iff odd_bit_iff_bit_pred bit_0 elim: oddE) |
|
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
805 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
806 |
lemma xor_one_eq: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
807 |
\<open>a XOR 1 = a + of_bool (even a) - of_bool (odd a)\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
808 |
using one_xor_eq [of a] by (simp add: ac_simps) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
809 |
|
74163 | 810 |
lemma xor_self_eq [simp]: |
811 |
\<open>a XOR a = 0\<close> |
|
812 |
by (rule bit_eqI) (simp add: bit_simps) |
|
813 |
||
74101 | 814 |
lemma bit_iff_odd_drop_bit: |
815 |
\<open>bit a n \<longleftrightarrow> odd (drop_bit n a)\<close> |
|
816 |
by (simp add: bit_iff_odd drop_bit_eq_div) |
|
817 |
||
818 |
lemma even_drop_bit_iff_not_bit: |
|
819 |
\<open>even (drop_bit n a) \<longleftrightarrow> \<not> bit a n\<close> |
|
820 |
by (simp add: bit_iff_odd_drop_bit) |
|
821 |
||
822 |
lemma div_push_bit_of_1_eq_drop_bit: |
|
823 |
\<open>a div push_bit n 1 = drop_bit n a\<close> |
|
824 |
by (simp add: push_bit_eq_mult drop_bit_eq_div) |
|
825 |
||
826 |
lemma bits_ident: |
|
79017 | 827 |
\<open>push_bit n (drop_bit n a) + take_bit n a = a\<close> |
74101 | 828 |
using div_mult_mod_eq by (simp add: push_bit_eq_mult take_bit_eq_mod drop_bit_eq_div) |
829 |
||
830 |
lemma push_bit_push_bit [simp]: |
|
79017 | 831 |
\<open>push_bit m (push_bit n a) = push_bit (m + n) a\<close> |
74101 | 832 |
by (simp add: push_bit_eq_mult power_add ac_simps) |
833 |
||
834 |
lemma push_bit_0_id [simp]: |
|
79017 | 835 |
\<open>push_bit 0 = id\<close> |
74101 | 836 |
by (simp add: fun_eq_iff push_bit_eq_mult) |
837 |
||
838 |
lemma push_bit_of_0 [simp]: |
|
79017 | 839 |
\<open>push_bit n 0 = 0\<close> |
74101 | 840 |
by (simp add: push_bit_eq_mult) |
841 |
||
74592 | 842 |
lemma push_bit_of_1 [simp]: |
79017 | 843 |
\<open>push_bit n 1 = 2 ^ n\<close> |
74101 | 844 |
by (simp add: push_bit_eq_mult) |
845 |
||
846 |
lemma push_bit_Suc [simp]: |
|
79017 | 847 |
\<open>push_bit (Suc n) a = push_bit n (a * 2)\<close> |
74101 | 848 |
by (simp add: push_bit_eq_mult ac_simps) |
849 |
||
850 |
lemma push_bit_double: |
|
79017 | 851 |
\<open>push_bit n (a * 2) = push_bit n a * 2\<close> |
74101 | 852 |
by (simp add: push_bit_eq_mult ac_simps) |
853 |
||
854 |
lemma push_bit_add: |
|
79017 | 855 |
\<open>push_bit n (a + b) = push_bit n a + push_bit n b\<close> |
74101 | 856 |
by (simp add: push_bit_eq_mult algebra_simps) |
857 |
||
858 |
lemma push_bit_numeral [simp]: |
|
859 |
\<open>push_bit (numeral l) (numeral k) = push_bit (pred_numeral l) (numeral (Num.Bit0 k))\<close> |
|
860 |
by (simp add: numeral_eq_Suc mult_2_right) (simp add: numeral_Bit0) |
|
861 |
||
862 |
lemma take_bit_0 [simp]: |
|
863 |
"take_bit 0 a = 0" |
|
864 |
by (simp add: take_bit_eq_mod) |
|
865 |
||
866 |
lemma take_bit_Suc: |
|
867 |
\<open>take_bit (Suc n) a = take_bit n (a div 2) * 2 + a mod 2\<close> |
|
868 |
proof - |
|
869 |
have \<open>take_bit (Suc n) (a div 2 * 2 + of_bool (odd a)) = take_bit n (a div 2) * 2 + of_bool (odd a)\<close> |
|
870 |
using even_succ_mod_exp [of \<open>2 * (a div 2)\<close> \<open>Suc n\<close>] |
|
871 |
mult_exp_mod_exp_eq [of 1 \<open>Suc n\<close> \<open>a div 2\<close>] |
|
872 |
by (auto simp add: take_bit_eq_mod ac_simps) |
|
873 |
then show ?thesis |
|
874 |
using div_mult_mod_eq [of a 2] by (simp add: mod_2_eq_odd) |
|
875 |
qed |
|
876 |
||
877 |
lemma take_bit_rec: |
|
878 |
\<open>take_bit n a = (if n = 0 then 0 else take_bit (n - 1) (a div 2) * 2 + a mod 2)\<close> |
|
879 |
by (cases n) (simp_all add: take_bit_Suc) |
|
880 |
||
881 |
lemma take_bit_Suc_0 [simp]: |
|
882 |
\<open>take_bit (Suc 0) a = a mod 2\<close> |
|
883 |
by (simp add: take_bit_eq_mod) |
|
884 |
||
885 |
lemma take_bit_of_0 [simp]: |
|
79017 | 886 |
\<open>take_bit n 0 = 0\<close> |
74101 | 887 |
by (simp add: take_bit_eq_mod) |
888 |
||
889 |
lemma take_bit_of_1 [simp]: |
|
79017 | 890 |
\<open>take_bit n 1 = of_bool (n > 0)\<close> |
74101 | 891 |
by (cases n) (simp_all add: take_bit_Suc) |
892 |
||
893 |
lemma drop_bit_of_0 [simp]: |
|
79017 | 894 |
\<open>drop_bit n 0 = 0\<close> |
74101 | 895 |
by (simp add: drop_bit_eq_div) |
896 |
||
897 |
lemma drop_bit_of_1 [simp]: |
|
79017 | 898 |
\<open>drop_bit n 1 = of_bool (n = 0)\<close> |
74101 | 899 |
by (simp add: drop_bit_eq_div) |
900 |
||
901 |
lemma drop_bit_0 [simp]: |
|
79017 | 902 |
\<open>drop_bit 0 = id\<close> |
74101 | 903 |
by (simp add: fun_eq_iff drop_bit_eq_div) |
904 |
||
905 |
lemma drop_bit_Suc: |
|
79017 | 906 |
\<open>drop_bit (Suc n) a = drop_bit n (a div 2)\<close> |
74101 | 907 |
using div_exp_eq [of a 1] by (simp add: drop_bit_eq_div) |
908 |
||
909 |
lemma drop_bit_rec: |
|
79017 | 910 |
\<open>drop_bit n a = (if n = 0 then a else drop_bit (n - 1) (a div 2))\<close> |
74101 | 911 |
by (cases n) (simp_all add: drop_bit_Suc) |
912 |
||
913 |
lemma drop_bit_half: |
|
79017 | 914 |
\<open>drop_bit n (a div 2) = drop_bit n a div 2\<close> |
74101 | 915 |
by (induction n arbitrary: a) (simp_all add: drop_bit_Suc) |
916 |
||
917 |
lemma drop_bit_of_bool [simp]: |
|
79017 | 918 |
\<open>drop_bit n (of_bool b) = of_bool (n = 0 \<and> b)\<close> |
74101 | 919 |
by (cases n) simp_all |
920 |
||
921 |
lemma even_take_bit_eq [simp]: |
|
922 |
\<open>even (take_bit n a) \<longleftrightarrow> n = 0 \<or> even a\<close> |
|
923 |
by (simp add: take_bit_rec [of n a]) |
|
924 |
||
925 |
lemma take_bit_take_bit [simp]: |
|
79017 | 926 |
\<open>take_bit m (take_bit n a) = take_bit (min m n) a\<close> |
74101 | 927 |
by (simp add: take_bit_eq_mod mod_exp_eq ac_simps) |
928 |
||
929 |
lemma drop_bit_drop_bit [simp]: |
|
79017 | 930 |
\<open>drop_bit m (drop_bit n a) = drop_bit (m + n) a\<close> |
74101 | 931 |
by (simp add: drop_bit_eq_div power_add div_exp_eq ac_simps) |
932 |
||
933 |
lemma push_bit_take_bit: |
|
79017 | 934 |
\<open>push_bit m (take_bit n a) = take_bit (m + n) (push_bit m a)\<close> |
74101 | 935 |
apply (simp add: push_bit_eq_mult take_bit_eq_mod power_add ac_simps) |
936 |
using mult_exp_mod_exp_eq [of m \<open>m + n\<close> a] apply (simp add: ac_simps power_add) |
|
937 |
done |
|
938 |
||
939 |
lemma take_bit_push_bit: |
|
79017 | 940 |
\<open>take_bit m (push_bit n a) = push_bit n (take_bit (m - n) a)\<close> |
941 |
proof (cases \<open>m \<le> n\<close>) |
|
74101 | 942 |
case True |
943 |
then show ?thesis |
|
944 |
apply (simp add:) |
|
945 |
apply (simp_all add: push_bit_eq_mult take_bit_eq_mod) |
|
946 |
apply (auto dest!: le_Suc_ex simp add: power_add ac_simps) |
|
947 |
using mult_exp_mod_exp_eq [of m m \<open>a * 2 ^ n\<close> for n] |
|
948 |
apply (simp add: ac_simps) |
|
949 |
done |
|
950 |
next |
|
951 |
case False |
|
952 |
then show ?thesis |
|
79017 | 953 |
using push_bit_take_bit [of n \<open>m - n\<close> a] |
74101 | 954 |
by simp |
955 |
qed |
|
956 |
||
957 |
lemma take_bit_drop_bit: |
|
79017 | 958 |
\<open>take_bit m (drop_bit n a) = drop_bit n (take_bit (m + n) a)\<close> |
74101 | 959 |
by (simp add: drop_bit_eq_div take_bit_eq_mod ac_simps div_exp_mod_exp_eq) |
960 |
||
961 |
lemma drop_bit_take_bit: |
|
79017 | 962 |
\<open>drop_bit m (take_bit n a) = take_bit (n - m) (drop_bit m a)\<close> |
74101 | 963 |
proof (cases "m \<le> n") |
964 |
case True |
|
965 |
then show ?thesis |
|
966 |
using take_bit_drop_bit [of "n - m" m a] by simp |
|
967 |
next |
|
968 |
case False |
|
969 |
then obtain q where \<open>m = n + q\<close> |
|
970 |
by (auto simp add: not_le dest: less_imp_Suc_add) |
|
971 |
then have \<open>drop_bit m (take_bit n a) = 0\<close> |
|
972 |
using div_exp_eq [of \<open>a mod 2 ^ n\<close> n q] |
|
973 |
by (simp add: take_bit_eq_mod drop_bit_eq_div) |
|
974 |
with False show ?thesis |
|
975 |
by simp |
|
976 |
qed |
|
977 |
||
978 |
lemma even_push_bit_iff [simp]: |
|
979 |
\<open>even (push_bit n a) \<longleftrightarrow> n \<noteq> 0 \<or> even a\<close> |
|
980 |
by (simp add: push_bit_eq_mult) auto |
|
981 |
||
982 |
lemma bit_push_bit_iff [bit_simps]: |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
983 |
\<open>bit (push_bit m a) n \<longleftrightarrow> m \<le> n \<and> possible_bit TYPE('a) n \<and> bit a (n - m)\<close> |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
984 |
by (auto simp add: bit_iff_odd push_bit_eq_mult even_mult_exp_div_exp_iff possible_bit_def) |
74101 | 985 |
|
986 |
lemma bit_drop_bit_eq [bit_simps]: |
|
987 |
\<open>bit (drop_bit n a) = bit a \<circ> (+) n\<close> |
|
988 |
by (simp add: bit_iff_odd fun_eq_iff ac_simps flip: drop_bit_eq_div) |
|
989 |
||
990 |
lemma bit_take_bit_iff [bit_simps]: |
|
991 |
\<open>bit (take_bit m a) n \<longleftrightarrow> n < m \<and> bit a n\<close> |
|
992 |
by (simp add: bit_iff_odd drop_bit_take_bit not_le flip: drop_bit_eq_div) |
|
993 |
||
994 |
lemma stable_imp_drop_bit_eq: |
|
995 |
\<open>drop_bit n a = a\<close> |
|
996 |
if \<open>a div 2 = a\<close> |
|
997 |
by (induction n) (simp_all add: that drop_bit_Suc) |
|
998 |
||
999 |
lemma stable_imp_take_bit_eq: |
|
1000 |
\<open>take_bit n a = (if even a then 0 else 2 ^ n - 1)\<close> |
|
1001 |
if \<open>a div 2 = a\<close> |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1002 |
proof (rule bit_eqI[unfolded possible_bit_def]) |
74101 | 1003 |
fix m |
1004 |
assume \<open>2 ^ m \<noteq> 0\<close> |
|
1005 |
with that show \<open>bit (take_bit n a) m \<longleftrightarrow> bit (if even a then 0 else 2 ^ n - 1) m\<close> |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1006 |
by (simp add: bit_take_bit_iff bit_mask_sub_iff possible_bit_def stable_imp_bit_iff_odd) |
74101 | 1007 |
qed |
1008 |
||
1009 |
lemma exp_dvdE: |
|
1010 |
assumes \<open>2 ^ n dvd a\<close> |
|
1011 |
obtains b where \<open>a = push_bit n b\<close> |
|
1012 |
proof - |
|
1013 |
from assms obtain b where \<open>a = 2 ^ n * b\<close> .. |
|
1014 |
then have \<open>a = push_bit n b\<close> |
|
1015 |
by (simp add: push_bit_eq_mult ac_simps) |
|
1016 |
with that show thesis . |
|
1017 |
qed |
|
1018 |
||
1019 |
lemma take_bit_eq_0_iff: |
|
1020 |
\<open>take_bit n a = 0 \<longleftrightarrow> 2 ^ n dvd a\<close> (is \<open>?P \<longleftrightarrow> ?Q\<close>) |
|
1021 |
proof |
|
1022 |
assume ?P |
|
1023 |
then show ?Q |
|
1024 |
by (simp add: take_bit_eq_mod mod_0_imp_dvd) |
|
1025 |
next |
|
1026 |
assume ?Q |
|
1027 |
then obtain b where \<open>a = push_bit n b\<close> |
|
1028 |
by (rule exp_dvdE) |
|
1029 |
then show ?P |
|
1030 |
by (simp add: take_bit_push_bit) |
|
1031 |
qed |
|
1032 |
||
1033 |
lemma take_bit_tightened: |
|
79068 | 1034 |
\<open>take_bit m a = take_bit m b\<close> if \<open>take_bit n a = take_bit n b\<close> and \<open>m \<le> n\<close> |
74101 | 1035 |
proof - |
1036 |
from that have \<open>take_bit m (take_bit n a) = take_bit m (take_bit n b)\<close> |
|
1037 |
by simp |
|
1038 |
then have \<open>take_bit (min m n) a = take_bit (min m n) b\<close> |
|
1039 |
by simp |
|
1040 |
with that show ?thesis |
|
1041 |
by (simp add: min_def) |
|
1042 |
qed |
|
1043 |
||
1044 |
lemma take_bit_eq_self_iff_drop_bit_eq_0: |
|
1045 |
\<open>take_bit n a = a \<longleftrightarrow> drop_bit n a = 0\<close> (is \<open>?P \<longleftrightarrow> ?Q\<close>) |
|
1046 |
proof |
|
1047 |
assume ?P |
|
1048 |
show ?Q |
|
1049 |
proof (rule bit_eqI) |
|
1050 |
fix m |
|
1051 |
from \<open>?P\<close> have \<open>a = take_bit n a\<close> .. |
|
1052 |
also have \<open>\<not> bit (take_bit n a) (n + m)\<close> |
|
1053 |
unfolding bit_simps |
|
79068 | 1054 |
by (simp add: bit_simps) |
74101 | 1055 |
finally show \<open>bit (drop_bit n a) m \<longleftrightarrow> bit 0 m\<close> |
1056 |
by (simp add: bit_simps) |
|
1057 |
qed |
|
1058 |
next |
|
1059 |
assume ?Q |
|
1060 |
show ?P |
|
1061 |
proof (rule bit_eqI) |
|
1062 |
fix m |
|
1063 |
from \<open>?Q\<close> have \<open>\<not> bit (drop_bit n a) (m - n)\<close> |
|
1064 |
by simp |
|
1065 |
then have \<open> \<not> bit a (n + (m - n))\<close> |
|
1066 |
by (simp add: bit_simps) |
|
1067 |
then show \<open>bit (take_bit n a) m \<longleftrightarrow> bit a m\<close> |
|
1068 |
by (cases \<open>m < n\<close>) (auto simp add: bit_simps) |
|
1069 |
qed |
|
1070 |
qed |
|
1071 |
||
1072 |
lemma drop_bit_exp_eq: |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1073 |
\<open>drop_bit m (2 ^ n) = of_bool (m \<le> n \<and> possible_bit TYPE('a) n) * 2 ^ (n - m)\<close> |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1074 |
by (auto simp add: bit_eq_iff bit_simps) |
74101 | 1075 |
|
71409 | 1076 |
lemma take_bit_and [simp]: |
1077 |
\<open>take_bit n (a AND b) = take_bit n a AND take_bit n b\<close> |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1078 |
by (auto simp add: bit_eq_iff bit_simps) |
71409 | 1079 |
|
1080 |
lemma take_bit_or [simp]: |
|
1081 |
\<open>take_bit n (a OR b) = take_bit n a OR take_bit n b\<close> |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1082 |
by (auto simp add: bit_eq_iff bit_simps) |
71409 | 1083 |
|
1084 |
lemma take_bit_xor [simp]: |
|
1085 |
\<open>take_bit n (a XOR b) = take_bit n a XOR take_bit n b\<close> |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1086 |
by (auto simp add: bit_eq_iff bit_simps) |
71409 | 1087 |
|
72239 | 1088 |
lemma push_bit_and [simp]: |
1089 |
\<open>push_bit n (a AND b) = push_bit n a AND push_bit n b\<close> |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1090 |
by (auto simp add: bit_eq_iff bit_simps) |
72239 | 1091 |
|
1092 |
lemma push_bit_or [simp]: |
|
1093 |
\<open>push_bit n (a OR b) = push_bit n a OR push_bit n b\<close> |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1094 |
by (auto simp add: bit_eq_iff bit_simps) |
72239 | 1095 |
|
1096 |
lemma push_bit_xor [simp]: |
|
1097 |
\<open>push_bit n (a XOR b) = push_bit n a XOR push_bit n b\<close> |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1098 |
by (auto simp add: bit_eq_iff bit_simps) |
72239 | 1099 |
|
1100 |
lemma drop_bit_and [simp]: |
|
1101 |
\<open>drop_bit n (a AND b) = drop_bit n a AND drop_bit n b\<close> |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1102 |
by (auto simp add: bit_eq_iff bit_simps) |
72239 | 1103 |
|
1104 |
lemma drop_bit_or [simp]: |
|
1105 |
\<open>drop_bit n (a OR b) = drop_bit n a OR drop_bit n b\<close> |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1106 |
by (auto simp add: bit_eq_iff bit_simps) |
72239 | 1107 |
|
1108 |
lemma drop_bit_xor [simp]: |
|
1109 |
\<open>drop_bit n (a XOR b) = drop_bit n a XOR drop_bit n b\<close> |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1110 |
by (auto simp add: bit_eq_iff bit_simps) |
72239 | 1111 |
|
72611
c7bc3e70a8c7
official collection for bit projection simplifications
haftmann
parents:
72512
diff
changeset
|
1112 |
lemma bit_mask_iff [bit_simps]: |
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1113 |
\<open>bit (mask m) n \<longleftrightarrow> possible_bit TYPE('a) n \<and> n < m\<close> |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1114 |
by (simp add: mask_eq_exp_minus_1 bit_mask_sub_iff) |
71823 | 1115 |
|
1116 |
lemma even_mask_iff: |
|
1117 |
\<open>even (mask n) \<longleftrightarrow> n = 0\<close> |
|
75085 | 1118 |
using bit_mask_iff [of n 0] by (auto simp add: bit_0) |
71823 | 1119 |
|
72082 | 1120 |
lemma mask_0 [simp]: |
71823 | 1121 |
\<open>mask 0 = 0\<close> |
1122 |
by (simp add: mask_eq_exp_minus_1) |
|
1123 |
||
72082 | 1124 |
lemma mask_Suc_0 [simp]: |
1125 |
\<open>mask (Suc 0) = 1\<close> |
|
1126 |
by (simp add: mask_eq_exp_minus_1 add_implies_diff sym) |
|
1127 |
||
1128 |
lemma mask_Suc_exp: |
|
71823 | 1129 |
\<open>mask (Suc n) = 2 ^ n OR mask n\<close> |
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1130 |
by (auto simp add: bit_eq_iff bit_simps) |
71823 | 1131 |
|
1132 |
lemma mask_Suc_double: |
|
72082 | 1133 |
\<open>mask (Suc n) = 1 OR 2 * mask n\<close> |
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1134 |
by (auto simp add: bit_eq_iff bit_simps elim: possible_bit_less_imp) |
71823 | 1135 |
|
72082 | 1136 |
lemma mask_numeral: |
1137 |
\<open>mask (numeral n) = 1 + 2 * mask (pred_numeral n)\<close> |
|
1138 |
by (simp add: numeral_eq_Suc mask_Suc_double one_or_eq ac_simps) |
|
1139 |
||
74592 | 1140 |
lemma take_bit_of_mask [simp]: |
72830 | 1141 |
\<open>take_bit m (mask n) = mask (min m n)\<close> |
1142 |
by (rule bit_eqI) (simp add: bit_simps) |
|
1143 |
||
71965
d45f5d4c41bd
more class operations for the sake of efficient generated code
haftmann
parents:
71956
diff
changeset
|
1144 |
lemma take_bit_eq_mask: |
71823 | 1145 |
\<open>take_bit n a = a AND mask n\<close> |
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1146 |
by (auto simp add: bit_eq_iff bit_simps) |
71823 | 1147 |
|
72281
beeadb35e357
more thorough treatment of division, particularly signed division on int and word
haftmann
parents:
72262
diff
changeset
|
1148 |
lemma or_eq_0_iff: |
beeadb35e357
more thorough treatment of division, particularly signed division on int and word
haftmann
parents:
72262
diff
changeset
|
1149 |
\<open>a OR b = 0 \<longleftrightarrow> a = 0 \<and> b = 0\<close> |
72792 | 1150 |
by (auto simp add: bit_eq_iff bit_or_iff) |
72281
beeadb35e357
more thorough treatment of division, particularly signed division on int and word
haftmann
parents:
72262
diff
changeset
|
1151 |
|
72239 | 1152 |
lemma disjunctive_add: |
1153 |
\<open>a + b = a OR b\<close> if \<open>\<And>n. \<not> bit a n \<or> \<not> bit b n\<close> |
|
1154 |
by (rule bit_eqI) (use that in \<open>simp add: bit_disjunctive_add_iff bit_or_iff\<close>) |
|
1155 |
||
72508 | 1156 |
lemma bit_iff_and_drop_bit_eq_1: |
1157 |
\<open>bit a n \<longleftrightarrow> drop_bit n a AND 1 = 1\<close> |
|
1158 |
by (simp add: bit_iff_odd_drop_bit and_one_eq odd_iff_mod_2_eq_one) |
|
1159 |
||
1160 |
lemma bit_iff_and_push_bit_not_eq_0: |
|
1161 |
\<open>bit a n \<longleftrightarrow> a AND push_bit n 1 \<noteq> 0\<close> |
|
1162 |
apply (cases \<open>2 ^ n = 0\<close>) |
|
74592 | 1163 |
apply (simp_all add: bit_eq_iff bit_and_iff bit_push_bit_iff exp_eq_0_imp_not_bit) |
72508 | 1164 |
apply (simp_all add: bit_exp_iff) |
1165 |
done |
|
1166 |
||
73682
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1167 |
lemma bit_set_bit_iff [bit_simps]: |
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1168 |
\<open>bit (set_bit m a) n \<longleftrightarrow> bit a n \<or> (m = n \<and> possible_bit TYPE('a) n)\<close> |
79017 | 1169 |
by (auto simp add: set_bit_eq_or bit_or_iff bit_exp_iff) |
73682
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1170 |
|
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1171 |
lemma even_set_bit_iff: |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1172 |
\<open>even (set_bit m a) \<longleftrightarrow> even a \<and> m \<noteq> 0\<close> |
75085 | 1173 |
using bit_set_bit_iff [of m a 0] by (auto simp add: bit_0) |
73682
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1174 |
|
79031
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1175 |
lemma bit_unset_bit_iff [bit_simps]: |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1176 |
\<open>bit (unset_bit m a) n \<longleftrightarrow> bit a n \<and> m \<noteq> n\<close> |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1177 |
proof (induction m arbitrary: a n) |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1178 |
case 0 |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1179 |
then show ?case |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1180 |
by (auto simp add: bit_simps simp flip: bit_Suc dest: bit_imp_possible_bit) |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1181 |
next |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1182 |
case (Suc m) |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1183 |
show ?case |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1184 |
proof (cases n) |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1185 |
case 0 |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1186 |
then show ?thesis |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1187 |
by (cases m) (simp_all add: bit_0 unset_bit_Suc) |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1188 |
next |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1189 |
case (Suc n) |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1190 |
with Suc.IH [of \<open>a div 2\<close> n] show ?thesis |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1191 |
by (auto simp add: unset_bit_Suc mod_2_eq_odd bit_simps even_bit_succ_iff simp flip: bit_Suc dest: bit_imp_possible_bit) |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1192 |
qed |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1193 |
qed |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1194 |
|
73682
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1195 |
lemma even_unset_bit_iff: |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1196 |
\<open>even (unset_bit m a) \<longleftrightarrow> even a \<or> m = 0\<close> |
75085 | 1197 |
using bit_unset_bit_iff [of m a 0] by (auto simp add: bit_0) |
73682
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1198 |
|
73789 | 1199 |
lemma and_exp_eq_0_iff_not_bit: |
1200 |
\<open>a AND 2 ^ n = 0 \<longleftrightarrow> \<not> bit a n\<close> (is \<open>?P \<longleftrightarrow> ?Q\<close>) |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1201 |
using bit_imp_possible_bit[of a n] |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1202 |
by (auto simp add: bit_eq_iff bit_simps) |
73789 | 1203 |
|
73682
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1204 |
lemma bit_flip_bit_iff [bit_simps]: |
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1205 |
\<open>bit (flip_bit m a) n \<longleftrightarrow> (m = n \<longleftrightarrow> \<not> bit a n) \<and> possible_bit TYPE('a) n\<close> |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1206 |
by (auto simp add: bit_eq_iff bit_simps flip_bit_eq_xor bit_imp_possible_bit) |
73682
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1207 |
|
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1208 |
lemma even_flip_bit_iff: |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1209 |
\<open>even (flip_bit m a) \<longleftrightarrow> \<not> (even a \<longleftrightarrow> m = 0)\<close> |
75085 | 1210 |
using bit_flip_bit_iff [of m a 0] by (auto simp: possible_bit_def bit_0) |
73682
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1211 |
|
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1212 |
lemma set_bit_0 [simp]: |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1213 |
\<open>set_bit 0 a = 1 + 2 * (a div 2)\<close> |
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1214 |
by (auto simp add: bit_eq_iff bit_simps even_bit_succ_iff simp flip: bit_Suc) |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1215 |
|
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1216 |
lemma bit_sum_mult_2_cases: |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1217 |
assumes a: "\<forall>j. \<not> bit a (Suc j)" |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1218 |
shows "bit (a + 2 * b) n = (if n = 0 then odd a else bit (2 * b) n)" |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1219 |
proof - |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1220 |
have a_eq: "bit a i \<longleftrightarrow> i = 0 \<and> odd a" for i |
75085 | 1221 |
by (cases i) (simp_all add: a bit_0) |
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1222 |
show ?thesis |
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1223 |
by (simp add: disjunctive_add[simplified disj_imp] a_eq bit_simps) |
73682
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1224 |
qed |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1225 |
|
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1226 |
lemma set_bit_Suc: |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1227 |
\<open>set_bit (Suc n) a = a mod 2 + 2 * set_bit n (a div 2)\<close> |
75085 | 1228 |
by (auto simp add: bit_eq_iff bit_sum_mult_2_cases bit_simps bit_0 simp flip: bit_Suc |
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1229 |
elim: possible_bit_less_imp) |
73682
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1230 |
|
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1231 |
lemma flip_bit_0 [simp]: |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1232 |
\<open>flip_bit 0 a = of_bool (even a) + 2 * (a div 2)\<close> |
75085 | 1233 |
by (auto simp add: bit_eq_iff bit_simps even_bit_succ_iff bit_0 simp flip: bit_Suc) |
73682
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1234 |
|
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1235 |
lemma flip_bit_Suc: |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1236 |
\<open>flip_bit (Suc n) a = a mod 2 + 2 * flip_bit n (a div 2)\<close> |
75085 | 1237 |
by (auto simp add: bit_eq_iff bit_sum_mult_2_cases bit_simps bit_0 simp flip: bit_Suc |
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1238 |
elim: possible_bit_less_imp) |
73682
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1239 |
|
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1240 |
lemma flip_bit_eq_if: |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1241 |
\<open>flip_bit n a = (if bit a n then unset_bit else set_bit) n a\<close> |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1242 |
by (rule bit_eqI) (auto simp add: bit_set_bit_iff bit_unset_bit_iff bit_flip_bit_iff) |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1243 |
|
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1244 |
lemma take_bit_set_bit_eq: |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1245 |
\<open>take_bit n (set_bit m a) = (if n \<le> m then take_bit n a else set_bit m (take_bit n a))\<close> |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1246 |
by (rule bit_eqI) (auto simp add: bit_take_bit_iff bit_set_bit_iff) |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1247 |
|
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1248 |
lemma take_bit_unset_bit_eq: |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1249 |
\<open>take_bit n (unset_bit m a) = (if n \<le> m then take_bit n a else unset_bit m (take_bit n a))\<close> |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1250 |
by (rule bit_eqI) (auto simp add: bit_take_bit_iff bit_unset_bit_iff) |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1251 |
|
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1252 |
lemma take_bit_flip_bit_eq: |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1253 |
\<open>take_bit n (flip_bit m a) = (if n \<le> m then take_bit n a else flip_bit m (take_bit n a))\<close> |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1254 |
by (rule bit_eqI) (auto simp add: bit_take_bit_iff bit_flip_bit_iff) |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1255 |
|
75085 | 1256 |
lemma bit_1_0 [simp]: |
1257 |
\<open>bit 1 0\<close> |
|
1258 |
by (simp add: bit_0) |
|
1259 |
||
74497 | 1260 |
lemma not_bit_1_Suc [simp]: |
1261 |
\<open>\<not> bit 1 (Suc n)\<close> |
|
1262 |
by (simp add: bit_Suc) |
|
1263 |
||
1264 |
lemma push_bit_Suc_numeral [simp]: |
|
1265 |
\<open>push_bit (Suc n) (numeral k) = push_bit n (numeral (Num.Bit0 k))\<close> |
|
1266 |
by (simp add: numeral_eq_Suc mult_2_right) (simp add: numeral_Bit0) |
|
1267 |
||
74592 | 1268 |
lemma mask_eq_0_iff [simp]: |
1269 |
\<open>mask n = 0 \<longleftrightarrow> n = 0\<close> |
|
1270 |
by (cases n) (simp_all add: mask_Suc_double or_eq_0_iff) |
|
1271 |
||
79017 | 1272 |
lemma bit_horner_sum_bit_iff [bit_simps]: |
1273 |
\<open>bit (horner_sum of_bool 2 bs) n \<longleftrightarrow> possible_bit TYPE('a) n \<and> n < length bs \<and> bs ! n\<close> |
|
1274 |
proof (induction bs arbitrary: n) |
|
1275 |
case Nil |
|
1276 |
then show ?case |
|
1277 |
by simp |
|
1278 |
next |
|
1279 |
case (Cons b bs) |
|
1280 |
show ?case |
|
1281 |
proof (cases n) |
|
1282 |
case 0 |
|
1283 |
then show ?thesis |
|
1284 |
by (simp add: bit_0) |
|
1285 |
next |
|
1286 |
case (Suc m) |
|
1287 |
with bit_rec [of _ n] Cons.prems Cons.IH [of m] |
|
1288 |
show ?thesis |
|
1289 |
by (simp add: bit_simps) |
|
1290 |
(auto simp add: possible_bit_less_imp bit_simps simp flip: bit_Suc) |
|
1291 |
qed |
|
1292 |
qed |
|
1293 |
||
1294 |
lemma horner_sum_bit_eq_take_bit: |
|
1295 |
\<open>horner_sum of_bool 2 (map (bit a) [0..<n]) = take_bit n a\<close> |
|
1296 |
by (rule bit_eqI) (auto simp add: bit_simps) |
|
1297 |
||
1298 |
lemma take_bit_horner_sum_bit_eq: |
|
1299 |
\<open>take_bit n (horner_sum of_bool 2 bs) = horner_sum of_bool 2 (take n bs)\<close> |
|
1300 |
by (auto simp add: bit_eq_iff bit_take_bit_iff bit_horner_sum_bit_iff) |
|
1301 |
||
1302 |
lemma take_bit_sum: |
|
1303 |
\<open>take_bit n a = (\<Sum>k = 0..<n. push_bit k (of_bool (bit a k)))\<close> |
|
1304 |
by (simp flip: horner_sum_bit_eq_take_bit add: horner_sum_eq_sum push_bit_eq_mult) |
|
1305 |
||
79071 | 1306 |
lemma set_bit_eq: |
1307 |
\<open>set_bit n a = a + of_bool (\<not> bit a n) * 2 ^ n\<close> |
|
1308 |
proof - |
|
1309 |
have \<open>set_bit n a = a OR of_bool (\<not> bit a n) * 2 ^ n\<close> |
|
1310 |
by (rule bit_eqI) (auto simp add: bit_simps) |
|
1311 |
then show ?thesis |
|
1312 |
by (subst disjunctive_add) (auto simp add: bit_simps) |
|
1313 |
qed |
|
1314 |
||
71042
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
1315 |
end |
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
1316 |
|
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
1317 |
class ring_bit_operations = semiring_bit_operations + ring_parity + |
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
1318 |
fixes not :: \<open>'a \<Rightarrow> 'a\<close> (\<open>NOT\<close>) |
79072
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1319 |
assumes not_eq_complement: \<open>NOT a = - a - 1\<close> |
71042
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
1320 |
begin |
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
1321 |
|
71409 | 1322 |
text \<open> |
1323 |
For the sake of code generation \<^const>\<open>not\<close> is specified as |
|
1324 |
definitional class operation. Note that \<^const>\<open>not\<close> has no |
|
1325 |
sensible definition for unlimited but only positive bit strings |
|
1326 |
(type \<^typ>\<open>nat\<close>). |
|
1327 |
\<close> |
|
1328 |
||
71186 | 1329 |
lemma bits_minus_1_mod_2_eq [simp]: |
1330 |
\<open>(- 1) mod 2 = 1\<close> |
|
1331 |
by (simp add: mod_2_eq_odd) |
|
1332 |
||
71409 | 1333 |
lemma minus_eq_not_plus_1: |
1334 |
\<open>- a = NOT a + 1\<close> |
|
1335 |
using not_eq_complement [of a] by simp |
|
1336 |
||
79072
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1337 |
lemma minus_eq_not_minus_1: |
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1338 |
\<open>- a = NOT (a - 1)\<close> |
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1339 |
using not_eq_complement [of \<open>a - 1\<close>] by simp (simp add: algebra_simps) |
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1340 |
|
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1341 |
lemma not_rec: |
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1342 |
\<open>NOT a = of_bool (even a) + 2 * NOT (a div 2)\<close> |
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1343 |
by (simp add: not_eq_complement algebra_simps mod_2_eq_odd flip: minus_mod_eq_mult_div) |
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1344 |
|
71418 | 1345 |
lemma even_not_iff [simp]: |
79018
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1346 |
\<open>even (NOT a) \<longleftrightarrow> odd a\<close> |
79072
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1347 |
by (simp add: not_eq_complement) |
79018
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1348 |
|
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1349 |
lemma bit_not_iff [bit_simps]: |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1350 |
\<open>bit (NOT a) n \<longleftrightarrow> possible_bit TYPE('a) n \<and> \<not> bit a n\<close> |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1351 |
proof (cases \<open>possible_bit TYPE('a) n\<close>) |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1352 |
case False |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1353 |
then show ?thesis |
79068 | 1354 |
by (auto dest: bit_imp_possible_bit) |
79018
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1355 |
next |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1356 |
case True |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1357 |
moreover have \<open>bit (NOT a) n \<longleftrightarrow> \<not> bit a n\<close> |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1358 |
using \<open>possible_bit TYPE('a) n\<close> proof (induction n arbitrary: a) |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1359 |
case 0 |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1360 |
then show ?case |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1361 |
by (simp add: bit_0) |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1362 |
next |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1363 |
case (Suc n) |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1364 |
from Suc.prems Suc.IH [of \<open>a div 2\<close>] |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1365 |
show ?case |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1366 |
by (simp add: impossible_bit possible_bit_less_imp not_rec [of a] even_bit_succ_iff bit_double_iff flip: bit_Suc) |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1367 |
qed |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1368 |
ultimately show ?thesis |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1369 |
by simp |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1370 |
qed |
71418 | 1371 |
|
72611
c7bc3e70a8c7
official collection for bit projection simplifications
haftmann
parents:
72512
diff
changeset
|
1372 |
lemma bit_not_exp_iff [bit_simps]: |
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1373 |
\<open>bit (NOT (2 ^ m)) n \<longleftrightarrow> possible_bit TYPE('a) n \<and> n \<noteq> m\<close> |
71409 | 1374 |
by (auto simp add: bit_not_iff bit_exp_iff) |
1375 |
||
79018
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1376 |
lemma bit_minus_iff [bit_simps]: |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1377 |
\<open>bit (- a) n \<longleftrightarrow> possible_bit TYPE('a) n \<and> \<not> bit (a - 1) n\<close> |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1378 |
by (simp add: minus_eq_not_minus_1 bit_not_iff) |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1379 |
|
71186 | 1380 |
lemma bit_minus_1_iff [simp]: |
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1381 |
\<open>bit (- 1) n \<longleftrightarrow> possible_bit TYPE('a) n\<close> |
71409 | 1382 |
by (simp add: bit_minus_iff) |
1383 |
||
72611
c7bc3e70a8c7
official collection for bit projection simplifications
haftmann
parents:
72512
diff
changeset
|
1384 |
lemma bit_minus_exp_iff [bit_simps]: |
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1385 |
\<open>bit (- (2 ^ m)) n \<longleftrightarrow> possible_bit TYPE('a) n \<and> n \<ge> m\<close> |
72611
c7bc3e70a8c7
official collection for bit projection simplifications
haftmann
parents:
72512
diff
changeset
|
1386 |
by (auto simp add: bit_simps simp flip: mask_eq_exp_minus_1) |
71409 | 1387 |
|
1388 |
lemma bit_minus_2_iff [simp]: |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1389 |
\<open>bit (- 2) n \<longleftrightarrow> possible_bit TYPE('a) n \<and> n > 0\<close> |
71409 | 1390 |
by (simp add: bit_minus_iff bit_1_iff) |
71186 | 1391 |
|
79018
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1392 |
lemma bit_not_iff_eq: |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1393 |
\<open>bit (NOT a) n \<longleftrightarrow> 2 ^ n \<noteq> 0 \<and> \<not> bit a n\<close> |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1394 |
by (simp add: bit_simps possible_bit_def) |
7449ff77029e
base abstract specification of NOT on recursive equation rather than bit projection
haftmann
parents:
79017
diff
changeset
|
1395 |
|
74495 | 1396 |
lemma not_one_eq [simp]: |
73969
ca2a35c0fe6e
operations for symbolic computation of bit operations
haftmann
parents:
73871
diff
changeset
|
1397 |
\<open>NOT 1 = - 2\<close> |
71418 | 1398 |
by (simp add: bit_eq_iff bit_not_iff) (simp add: bit_1_iff) |
1399 |
||
1400 |
sublocale "and": semilattice_neutr \<open>(AND)\<close> \<open>- 1\<close> |
|
72239 | 1401 |
by standard (rule bit_eqI, simp add: bit_and_iff) |
71418 | 1402 |
|
74123
7c5842b06114
clarified abstract and concrete boolean algebras
haftmann
parents:
74108
diff
changeset
|
1403 |
sublocale bit: abstract_boolean_algebra \<open>(AND)\<close> \<open>(OR)\<close> NOT 0 \<open>- 1\<close> |
7c5842b06114
clarified abstract and concrete boolean algebras
haftmann
parents:
74108
diff
changeset
|
1404 |
by standard (auto simp add: bit_and_iff bit_or_iff bit_not_iff intro: bit_eqI) |
7c5842b06114
clarified abstract and concrete boolean algebras
haftmann
parents:
74108
diff
changeset
|
1405 |
|
7c5842b06114
clarified abstract and concrete boolean algebras
haftmann
parents:
74108
diff
changeset
|
1406 |
sublocale bit: abstract_boolean_algebra_sym_diff \<open>(AND)\<close> \<open>(OR)\<close> NOT 0 \<open>- 1\<close> \<open>(XOR)\<close> |
7c5842b06114
clarified abstract and concrete boolean algebras
haftmann
parents:
74108
diff
changeset
|
1407 |
apply standard |
7c5842b06114
clarified abstract and concrete boolean algebras
haftmann
parents:
74108
diff
changeset
|
1408 |
apply (rule bit_eqI) |
7c5842b06114
clarified abstract and concrete boolean algebras
haftmann
parents:
74108
diff
changeset
|
1409 |
apply (auto simp add: bit_simps) |
7c5842b06114
clarified abstract and concrete boolean algebras
haftmann
parents:
74108
diff
changeset
|
1410 |
done |
71042
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
1411 |
|
71802 | 1412 |
lemma and_eq_not_not_or: |
1413 |
\<open>a AND b = NOT (NOT a OR NOT b)\<close> |
|
1414 |
by simp |
|
1415 |
||
1416 |
lemma or_eq_not_not_and: |
|
1417 |
\<open>a OR b = NOT (NOT a AND NOT b)\<close> |
|
1418 |
by simp |
|
1419 |
||
72009 | 1420 |
lemma not_add_distrib: |
1421 |
\<open>NOT (a + b) = NOT a - b\<close> |
|
1422 |
by (simp add: not_eq_complement algebra_simps) |
|
1423 |
||
1424 |
lemma not_diff_distrib: |
|
1425 |
\<open>NOT (a - b) = NOT a + b\<close> |
|
1426 |
using not_add_distrib [of a \<open>- b\<close>] by simp |
|
1427 |
||
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1428 |
lemma and_eq_minus_1_iff: |
72281
beeadb35e357
more thorough treatment of division, particularly signed division on int and word
haftmann
parents:
72262
diff
changeset
|
1429 |
\<open>a AND b = - 1 \<longleftrightarrow> a = - 1 \<and> b = - 1\<close> |
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1430 |
by (auto simp: bit_eq_iff bit_simps) |
72281
beeadb35e357
more thorough treatment of division, particularly signed division on int and word
haftmann
parents:
72262
diff
changeset
|
1431 |
|
72239 | 1432 |
lemma disjunctive_diff: |
1433 |
\<open>a - b = a AND NOT b\<close> if \<open>\<And>n. bit b n \<Longrightarrow> bit a n\<close> |
|
1434 |
proof - |
|
1435 |
have \<open>NOT a + b = NOT a OR b\<close> |
|
1436 |
by (rule disjunctive_add) (auto simp add: bit_not_iff dest: that) |
|
1437 |
then have \<open>NOT (NOT a + b) = NOT (NOT a OR b)\<close> |
|
1438 |
by simp |
|
1439 |
then show ?thesis |
|
1440 |
by (simp add: not_add_distrib) |
|
1441 |
qed |
|
1442 |
||
71412 | 1443 |
lemma push_bit_minus: |
1444 |
\<open>push_bit n (- a) = - push_bit n a\<close> |
|
1445 |
by (simp add: push_bit_eq_mult) |
|
1446 |
||
71409 | 1447 |
lemma take_bit_not_take_bit: |
1448 |
\<open>take_bit n (NOT (take_bit n a)) = take_bit n (NOT a)\<close> |
|
1449 |
by (auto simp add: bit_eq_iff bit_take_bit_iff bit_not_iff) |
|
71042
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
1450 |
|
71418 | 1451 |
lemma take_bit_not_iff: |
73969
ca2a35c0fe6e
operations for symbolic computation of bit operations
haftmann
parents:
73871
diff
changeset
|
1452 |
\<open>take_bit n (NOT a) = take_bit n (NOT b) \<longleftrightarrow> take_bit n a = take_bit n b\<close> |
72239 | 1453 |
apply (simp add: bit_eq_iff) |
1454 |
apply (simp add: bit_not_iff bit_take_bit_iff bit_exp_iff) |
|
1455 |
apply (use exp_eq_0_imp_not_bit in blast) |
|
71418 | 1456 |
done |
1457 |
||
72262 | 1458 |
lemma take_bit_not_eq_mask_diff: |
1459 |
\<open>take_bit n (NOT a) = mask n - take_bit n a\<close> |
|
1460 |
proof - |
|
1461 |
have \<open>take_bit n (NOT a) = take_bit n (NOT (take_bit n a))\<close> |
|
1462 |
by (simp add: take_bit_not_take_bit) |
|
1463 |
also have \<open>\<dots> = mask n AND NOT (take_bit n a)\<close> |
|
1464 |
by (simp add: take_bit_eq_mask ac_simps) |
|
1465 |
also have \<open>\<dots> = mask n - take_bit n a\<close> |
|
1466 |
by (subst disjunctive_diff) |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
1467 |
(auto simp add: bit_take_bit_iff bit_mask_iff bit_imp_possible_bit) |
72262 | 1468 |
finally show ?thesis |
1469 |
by simp |
|
1470 |
qed |
|
1471 |
||
72079 | 1472 |
lemma mask_eq_take_bit_minus_one: |
1473 |
\<open>mask n = take_bit n (- 1)\<close> |
|
1474 |
by (simp add: bit_eq_iff bit_mask_iff bit_take_bit_iff conj_commute) |
|
1475 |
||
74592 | 1476 |
lemma take_bit_minus_one_eq_mask [simp]: |
71922 | 1477 |
\<open>take_bit n (- 1) = mask n\<close> |
72079 | 1478 |
by (simp add: mask_eq_take_bit_minus_one) |
71922 | 1479 |
|
72010 | 1480 |
lemma minus_exp_eq_not_mask: |
1481 |
\<open>- (2 ^ n) = NOT (mask n)\<close> |
|
1482 |
by (rule bit_eqI) (simp add: bit_minus_iff bit_not_iff flip: mask_eq_exp_minus_1) |
|
1483 |
||
74592 | 1484 |
lemma push_bit_minus_one_eq_not_mask [simp]: |
71922 | 1485 |
\<open>push_bit n (- 1) = NOT (mask n)\<close> |
72010 | 1486 |
by (simp add: push_bit_eq_mult minus_exp_eq_not_mask) |
1487 |
||
1488 |
lemma take_bit_not_mask_eq_0: |
|
1489 |
\<open>take_bit m (NOT (mask n)) = 0\<close> if \<open>n \<ge> m\<close> |
|
1490 |
by (rule bit_eqI) (use that in \<open>simp add: bit_take_bit_iff bit_not_iff bit_mask_iff\<close>) |
|
71922 | 1491 |
|
73682
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1492 |
lemma unset_bit_eq_and_not: |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1493 |
\<open>unset_bit n a = a AND NOT (push_bit n 1)\<close> |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1494 |
by (rule bit_eqI) (auto simp add: bit_simps) |
71426 | 1495 |
|
74497 | 1496 |
lemma push_bit_Suc_minus_numeral [simp]: |
1497 |
\<open>push_bit (Suc n) (- numeral k) = push_bit n (- numeral (Num.Bit0 k))\<close> |
|
1498 |
apply (simp only: numeral_Bit0) |
|
1499 |
apply simp |
|
1500 |
apply (simp only: numeral_mult mult_2_right numeral_add) |
|
1501 |
done |
|
1502 |
||
1503 |
lemma push_bit_minus_numeral [simp]: |
|
1504 |
\<open>push_bit (numeral l) (- numeral k) = push_bit (pred_numeral l) (- numeral (Num.Bit0 k))\<close> |
|
1505 |
by (simp only: numeral_eq_Suc push_bit_Suc_minus_numeral) |
|
1506 |
||
74592 | 1507 |
lemma take_bit_Suc_minus_1_eq: |
74498 | 1508 |
\<open>take_bit (Suc n) (- 1) = 2 ^ Suc n - 1\<close> |
74592 | 1509 |
by (simp add: mask_eq_exp_minus_1) |
1510 |
||
1511 |
lemma take_bit_numeral_minus_1_eq: |
|
74498 | 1512 |
\<open>take_bit (numeral k) (- 1) = 2 ^ numeral k - 1\<close> |
74592 | 1513 |
by (simp add: mask_eq_exp_minus_1) |
1514 |
||
1515 |
lemma push_bit_mask_eq: |
|
1516 |
\<open>push_bit m (mask n) = mask (n + m) AND NOT (mask m)\<close> |
|
1517 |
apply (rule bit_eqI) |
|
1518 |
apply (auto simp add: bit_simps not_less possible_bit_def) |
|
1519 |
apply (drule sym [of 0]) |
|
1520 |
apply (simp only:) |
|
1521 |
using exp_not_zero_imp_exp_diff_not_zero apply (blast dest: exp_not_zero_imp_exp_diff_not_zero) |
|
1522 |
done |
|
1523 |
||
1524 |
lemma slice_eq_mask: |
|
1525 |
\<open>push_bit n (take_bit m (drop_bit n a)) = a AND mask (m + n) AND NOT (mask n)\<close> |
|
1526 |
by (rule bit_eqI) (auto simp add: bit_simps) |
|
1527 |
||
1528 |
lemma push_bit_numeral_minus_1 [simp]: |
|
1529 |
\<open>push_bit (numeral n) (- 1) = - (2 ^ numeral n)\<close> |
|
1530 |
by (simp add: push_bit_eq_mult) |
|
74498 | 1531 |
|
79071 | 1532 |
lemma unset_bit_eq: |
1533 |
\<open>unset_bit n a = a - of_bool (bit a n) * 2 ^ n\<close> |
|
1534 |
proof - |
|
1535 |
have \<open>unset_bit n a = a AND NOT (of_bool (bit a n) * 2 ^ n)\<close> |
|
1536 |
by (rule bit_eqI) (auto simp add: bit_simps) |
|
1537 |
then show ?thesis |
|
1538 |
by (subst disjunctive_diff) (auto simp add: bit_simps simp flip: push_bit_eq_mult) |
|
1539 |
qed |
|
1540 |
||
71042
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
1541 |
end |
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
1542 |
|
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
1543 |
|
79070 | 1544 |
subsection \<open>Common algebraic structure\<close> |
1545 |
||
1546 |
class linordered_euclidean_semiring_bit_operations = |
|
1547 |
linordered_euclidean_semiring + semiring_bit_operations |
|
1548 |
begin |
|
1549 |
||
1550 |
lemma possible_bit [simp]: |
|
1551 |
\<open>possible_bit TYPE('a) n\<close> |
|
1552 |
by (simp add: possible_bit_def) |
|
1553 |
||
1554 |
lemma take_bit_of_exp [simp]: |
|
1555 |
\<open>take_bit m (2 ^ n) = of_bool (n < m) * 2 ^ n\<close> |
|
1556 |
by (simp add: take_bit_eq_mod exp_mod_exp) |
|
1557 |
||
1558 |
lemma take_bit_of_2 [simp]: |
|
1559 |
\<open>take_bit n 2 = of_bool (2 \<le> n) * 2\<close> |
|
1560 |
using take_bit_of_exp [of n 1] by simp |
|
1561 |
||
1562 |
lemma push_bit_eq_0_iff [simp]: |
|
1563 |
\<open>push_bit n a = 0 \<longleftrightarrow> a = 0\<close> |
|
1564 |
by (simp add: push_bit_eq_mult) |
|
1565 |
||
1566 |
lemma take_bit_add: |
|
1567 |
\<open>take_bit n (take_bit n a + take_bit n b) = take_bit n (a + b)\<close> |
|
1568 |
by (simp add: take_bit_eq_mod mod_simps) |
|
1569 |
||
1570 |
lemma take_bit_of_1_eq_0_iff [simp]: |
|
1571 |
\<open>take_bit n 1 = 0 \<longleftrightarrow> n = 0\<close> |
|
1572 |
by (simp add: take_bit_eq_mod) |
|
1573 |
||
1574 |
lemma drop_bit_Suc_bit0 [simp]: |
|
1575 |
\<open>drop_bit (Suc n) (numeral (Num.Bit0 k)) = drop_bit n (numeral k)\<close> |
|
1576 |
by (simp add: drop_bit_Suc numeral_Bit0_div_2) |
|
1577 |
||
1578 |
lemma drop_bit_Suc_bit1 [simp]: |
|
1579 |
\<open>drop_bit (Suc n) (numeral (Num.Bit1 k)) = drop_bit n (numeral k)\<close> |
|
1580 |
by (simp add: drop_bit_Suc numeral_Bit1_div_2) |
|
1581 |
||
1582 |
lemma drop_bit_numeral_bit0 [simp]: |
|
1583 |
\<open>drop_bit (numeral l) (numeral (Num.Bit0 k)) = drop_bit (pred_numeral l) (numeral k)\<close> |
|
1584 |
by (simp add: drop_bit_rec numeral_Bit0_div_2) |
|
1585 |
||
1586 |
lemma drop_bit_numeral_bit1 [simp]: |
|
1587 |
\<open>drop_bit (numeral l) (numeral (Num.Bit1 k)) = drop_bit (pred_numeral l) (numeral k)\<close> |
|
1588 |
by (simp add: drop_bit_rec numeral_Bit1_div_2) |
|
1589 |
||
1590 |
lemma take_bit_Suc_1 [simp]: |
|
1591 |
\<open>take_bit (Suc n) 1 = 1\<close> |
|
1592 |
by (simp add: take_bit_Suc) |
|
1593 |
||
1594 |
lemma take_bit_Suc_bit0: |
|
1595 |
\<open>take_bit (Suc n) (numeral (Num.Bit0 k)) = take_bit n (numeral k) * 2\<close> |
|
1596 |
by (simp add: take_bit_Suc numeral_Bit0_div_2) |
|
1597 |
||
1598 |
lemma take_bit_Suc_bit1: |
|
1599 |
\<open>take_bit (Suc n) (numeral (Num.Bit1 k)) = take_bit n (numeral k) * 2 + 1\<close> |
|
1600 |
by (simp add: take_bit_Suc numeral_Bit1_div_2 mod_2_eq_odd) |
|
1601 |
||
1602 |
lemma take_bit_numeral_1 [simp]: |
|
1603 |
\<open>take_bit (numeral l) 1 = 1\<close> |
|
1604 |
by (simp add: take_bit_rec [of \<open>numeral l\<close> 1]) |
|
1605 |
||
1606 |
lemma take_bit_numeral_bit0: |
|
1607 |
\<open>take_bit (numeral l) (numeral (Num.Bit0 k)) = take_bit (pred_numeral l) (numeral k) * 2\<close> |
|
1608 |
by (simp add: take_bit_rec numeral_Bit0_div_2) |
|
1609 |
||
1610 |
lemma take_bit_numeral_bit1: |
|
1611 |
\<open>take_bit (numeral l) (numeral (Num.Bit1 k)) = take_bit (pred_numeral l) (numeral k) * 2 + 1\<close> |
|
1612 |
by (simp add: take_bit_rec numeral_Bit1_div_2 mod_2_eq_odd) |
|
1613 |
||
1614 |
lemma bit_of_nat_iff_bit [bit_simps]: |
|
1615 |
\<open>bit (of_nat m) n \<longleftrightarrow> bit m n\<close> |
|
1616 |
proof - |
|
1617 |
have \<open>even (m div 2 ^ n) \<longleftrightarrow> even (of_nat (m div 2 ^ n))\<close> |
|
1618 |
by simp |
|
1619 |
also have \<open>of_nat (m div 2 ^ n) = of_nat m div of_nat (2 ^ n)\<close> |
|
1620 |
by (simp add: of_nat_div) |
|
1621 |
finally show ?thesis |
|
1622 |
by (simp add: bit_iff_odd semiring_bits_class.bit_iff_odd) |
|
1623 |
qed |
|
1624 |
||
1625 |
lemma drop_bit_mask_eq: |
|
1626 |
\<open>drop_bit m (mask n) = mask (n - m)\<close> |
|
1627 |
by (rule bit_eqI) (auto simp add: bit_simps possible_bit_def) |
|
1628 |
||
79071 | 1629 |
lemma bit_push_bit_iff': |
1630 |
\<open>bit (push_bit m a) n \<longleftrightarrow> m \<le> n \<and> bit a (n - m)\<close> |
|
1631 |
by (simp add: bit_simps) |
|
1632 |
||
1633 |
lemma mask_half: |
|
1634 |
\<open>mask n div 2 = mask (n - 1)\<close> |
|
1635 |
by (cases n) (simp_all add: mask_Suc_double one_or_eq) |
|
1636 |
||
1637 |
lemma take_bit_Suc_from_most: |
|
1638 |
\<open>take_bit (Suc n) a = 2 ^ n * of_bool (bit a n) + take_bit n a\<close> |
|
1639 |
using mod_mult2_eq' [of a \<open>2 ^ n\<close> 2] |
|
1640 |
by (simp only: take_bit_eq_mod power_Suc2) |
|
1641 |
(simp_all add: bit_iff_odd odd_iff_mod_2_eq_one) |
|
1642 |
||
1643 |
lemma take_bit_nonnegative [simp]: |
|
1644 |
\<open>0 \<le> take_bit n a\<close> |
|
1645 |
using horner_sum_nonnegative by (simp flip: horner_sum_bit_eq_take_bit) |
|
1646 |
||
1647 |
lemma not_take_bit_negative [simp]: |
|
1648 |
\<open>\<not> take_bit n a < 0\<close> |
|
1649 |
by (simp add: not_less) |
|
1650 |
||
1651 |
lemma bit_imp_take_bit_positive: |
|
1652 |
\<open>0 < take_bit m a\<close> if \<open>n < m\<close> and \<open>bit a n\<close> |
|
1653 |
proof (rule ccontr) |
|
1654 |
assume \<open>\<not> 0 < take_bit m a\<close> |
|
1655 |
then have \<open>take_bit m a = 0\<close> |
|
1656 |
by (auto simp add: not_less intro: order_antisym) |
|
1657 |
then have \<open>bit (take_bit m a) n = bit 0 n\<close> |
|
1658 |
by simp |
|
1659 |
with that show False |
|
1660 |
by (simp add: bit_take_bit_iff) |
|
1661 |
qed |
|
1662 |
||
1663 |
lemma take_bit_mult: |
|
1664 |
\<open>take_bit n (take_bit n a * take_bit n b) = take_bit n (a * b)\<close> |
|
1665 |
by (simp add: take_bit_eq_mod mod_mult_eq) |
|
1666 |
||
1667 |
lemma drop_bit_push_bit: |
|
1668 |
\<open>drop_bit m (push_bit n a) = drop_bit (m - n) (push_bit (n - m) a)\<close> |
|
1669 |
by (cases \<open>m \<le> n\<close>) |
|
1670 |
(auto simp add: mult.left_commute [of _ \<open>2 ^ n\<close>] mult.commute [of _ \<open>2 ^ n\<close>] mult.assoc |
|
1671 |
mult.commute [of a] drop_bit_eq_div push_bit_eq_mult not_le power_add Orderings.not_le dest!: le_Suc_ex less_imp_Suc_add) |
|
1672 |
||
79070 | 1673 |
end |
1674 |
||
1675 |
||
71956 | 1676 |
subsection \<open>Instance \<^typ>\<open>int\<close>\<close> |
71042
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
1677 |
|
79030
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1678 |
locale fold2_bit_int = |
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1679 |
fixes f :: \<open>bool \<Rightarrow> bool \<Rightarrow> bool\<close> |
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1680 |
begin |
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1681 |
|
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1682 |
context |
71042
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
1683 |
begin |
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
1684 |
|
79030
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1685 |
function F :: \<open>int \<Rightarrow> int \<Rightarrow> int\<close> |
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1686 |
where \<open>F k l = (if k \<in> {0, - 1} \<and> l \<in> {0, - 1} |
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1687 |
then - of_bool (f (odd k) (odd l)) |
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1688 |
else of_bool (f (odd k) (odd l)) + 2 * (F (k div 2) (l div 2)))\<close> |
71804
6fd70ed18199
simplified construction of binary bit operations
haftmann
parents:
71802
diff
changeset
|
1689 |
by auto |
6fd70ed18199
simplified construction of binary bit operations
haftmann
parents:
71802
diff
changeset
|
1690 |
|
79030
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1691 |
private termination proof (relation \<open>measure (\<lambda>(k, l). nat (\<bar>k\<bar> + \<bar>l\<bar>))\<close>) |
79017 | 1692 |
have less_eq: \<open>\<bar>k div 2\<bar> \<le> \<bar>k\<bar>\<close> for k :: int |
1693 |
by (cases k) (simp_all add: divide_int_def nat_add_distrib) |
|
1694 |
then have less: \<open>\<bar>k div 2\<bar> < \<bar>k\<bar>\<close> if \<open>k \<notin> {0, - 1}\<close> for k :: int |
|
1695 |
using that by (auto simp add: less_le [of k]) |
|
74101 | 1696 |
show \<open>wf (measure (\<lambda>(k, l). nat (\<bar>k\<bar> + \<bar>l\<bar>)))\<close> |
1697 |
by simp |
|
1698 |
show \<open>((k div 2, l div 2), k, l) \<in> measure (\<lambda>(k, l). nat (\<bar>k\<bar> + \<bar>l\<bar>))\<close> |
|
1699 |
if \<open>\<not> (k \<in> {0, - 1} \<and> l \<in> {0, - 1})\<close> for k l |
|
1700 |
proof - |
|
1701 |
from that have *: \<open>k \<notin> {0, - 1} \<or> l \<notin> {0, - 1}\<close> |
|
1702 |
by simp |
|
1703 |
then have \<open>0 < \<bar>k\<bar> + \<bar>l\<bar>\<close> |
|
1704 |
by auto |
|
1705 |
moreover from * have \<open>\<bar>k div 2\<bar> + \<bar>l div 2\<bar> < \<bar>k\<bar> + \<bar>l\<bar>\<close> |
|
1706 |
proof |
|
1707 |
assume \<open>k \<notin> {0, - 1}\<close> |
|
1708 |
then have \<open>\<bar>k div 2\<bar> < \<bar>k\<bar>\<close> |
|
1709 |
by (rule less) |
|
1710 |
with less_eq [of l] show ?thesis |
|
1711 |
by auto |
|
1712 |
next |
|
1713 |
assume \<open>l \<notin> {0, - 1}\<close> |
|
1714 |
then have \<open>\<bar>l div 2\<bar> < \<bar>l\<bar>\<close> |
|
1715 |
by (rule less) |
|
1716 |
with less_eq [of k] show ?thesis |
|
1717 |
by auto |
|
1718 |
qed |
|
1719 |
ultimately show ?thesis |
|
79030
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1720 |
by (simp only: in_measure split_def fst_conv snd_conv nat_mono_iff) |
74101 | 1721 |
qed |
1722 |
qed |
|
71804
6fd70ed18199
simplified construction of binary bit operations
haftmann
parents:
71802
diff
changeset
|
1723 |
|
79030
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1724 |
declare F.simps [simp del] |
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1725 |
|
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1726 |
lemma rec: |
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1727 |
\<open>F k l = of_bool (f (odd k) (odd l)) + 2 * (F (k div 2) (l div 2))\<close> |
71804
6fd70ed18199
simplified construction of binary bit operations
haftmann
parents:
71802
diff
changeset
|
1728 |
for k l :: int |
6fd70ed18199
simplified construction of binary bit operations
haftmann
parents:
71802
diff
changeset
|
1729 |
proof (cases \<open>k \<in> {0, - 1} \<and> l \<in> {0, - 1}\<close>) |
6fd70ed18199
simplified construction of binary bit operations
haftmann
parents:
71802
diff
changeset
|
1730 |
case True |
6fd70ed18199
simplified construction of binary bit operations
haftmann
parents:
71802
diff
changeset
|
1731 |
then show ?thesis |
79030
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1732 |
by (auto simp add: F.simps [of 0] F.simps [of \<open>- 1\<close>]) |
71804
6fd70ed18199
simplified construction of binary bit operations
haftmann
parents:
71802
diff
changeset
|
1733 |
next |
6fd70ed18199
simplified construction of binary bit operations
haftmann
parents:
71802
diff
changeset
|
1734 |
case False |
6fd70ed18199
simplified construction of binary bit operations
haftmann
parents:
71802
diff
changeset
|
1735 |
then show ?thesis |
79030
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1736 |
by (auto simp add: ac_simps F.simps [of k l]) |
71802 | 1737 |
qed |
1738 |
||
79030
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1739 |
lemma bit_iff: |
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1740 |
\<open>bit (F k l) n \<longleftrightarrow> f (bit k n) (bit l n)\<close> for k l :: int |
71804
6fd70ed18199
simplified construction of binary bit operations
haftmann
parents:
71802
diff
changeset
|
1741 |
proof (induction n arbitrary: k l) |
6fd70ed18199
simplified construction of binary bit operations
haftmann
parents:
71802
diff
changeset
|
1742 |
case 0 |
6fd70ed18199
simplified construction of binary bit operations
haftmann
parents:
71802
diff
changeset
|
1743 |
then show ?case |
79030
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1744 |
by (simp add: rec [of k l] bit_0) |
71804
6fd70ed18199
simplified construction of binary bit operations
haftmann
parents:
71802
diff
changeset
|
1745 |
next |
6fd70ed18199
simplified construction of binary bit operations
haftmann
parents:
71802
diff
changeset
|
1746 |
case (Suc n) |
6fd70ed18199
simplified construction of binary bit operations
haftmann
parents:
71802
diff
changeset
|
1747 |
then show ?case |
79030
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1748 |
by (simp add: rec [of k l] bit_Suc) |
71802 | 1749 |
qed |
1750 |
||
79030
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1751 |
end |
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1752 |
|
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1753 |
end |
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1754 |
|
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1755 |
instantiation int :: ring_bit_operations |
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1756 |
begin |
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1757 |
|
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1758 |
definition not_int :: \<open>int \<Rightarrow> int\<close> |
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1759 |
where \<open>not_int k = - k - 1\<close> |
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1760 |
|
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1761 |
global_interpretation and_int: fold2_bit_int \<open>(\<and>)\<close> |
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1762 |
defines and_int = and_int.F . |
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1763 |
|
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1764 |
global_interpretation or_int: fold2_bit_int \<open>(\<or>)\<close> |
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1765 |
defines or_int = or_int.F . |
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1766 |
|
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1767 |
global_interpretation xor_int: fold2_bit_int \<open>(\<noteq>)\<close> |
bdea2b95817b
more direct characterization of binary bit operations
haftmann
parents:
79018
diff
changeset
|
1768 |
defines xor_int = xor_int.F . |
71802 | 1769 |
|
72082 | 1770 |
definition mask_int :: \<open>nat \<Rightarrow> int\<close> |
1771 |
where \<open>mask n = (2 :: int) ^ n - 1\<close> |
|
1772 |
||
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1773 |
definition push_bit_int :: \<open>nat \<Rightarrow> int \<Rightarrow> int\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1774 |
where \<open>push_bit_int n k = k * 2 ^ n\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1775 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1776 |
definition drop_bit_int :: \<open>nat \<Rightarrow> int \<Rightarrow> int\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1777 |
where \<open>drop_bit_int n k = k div 2 ^ n\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1778 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1779 |
definition take_bit_int :: \<open>nat \<Rightarrow> int \<Rightarrow> int\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1780 |
where \<open>take_bit_int n k = k mod 2 ^ n\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1781 |
|
73682
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1782 |
definition set_bit_int :: \<open>nat \<Rightarrow> int \<Rightarrow> int\<close> |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1783 |
where \<open>set_bit n k = k OR push_bit n 1\<close> for k :: int |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1784 |
|
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1785 |
definition unset_bit_int :: \<open>nat \<Rightarrow> int \<Rightarrow> int\<close> |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1786 |
where \<open>unset_bit n k = k AND NOT (push_bit n 1)\<close> for k :: int |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1787 |
|
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1788 |
definition flip_bit_int :: \<open>nat \<Rightarrow> int \<Rightarrow> int\<close> |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1789 |
where \<open>flip_bit n k = k XOR push_bit n 1\<close> for k :: int |
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1790 |
|
79072
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1791 |
lemma not_int_div_2: |
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1792 |
\<open>NOT k div 2 = NOT (k div 2)\<close> for k :: int |
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1793 |
by (simp add: not_int_def) |
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1794 |
|
79068 | 1795 |
lemma bit_not_int_iff: |
79072
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1796 |
\<open>bit (NOT k) n \<longleftrightarrow> \<not> bit k n\<close> for k :: int |
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1797 |
proof (rule sym, induction n arbitrary: k) |
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1798 |
case 0 |
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1799 |
then show ?case |
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1800 |
by (simp add: bit_0 not_int_def) |
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1801 |
next |
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1802 |
case (Suc n) |
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1803 |
then show ?case |
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1804 |
by (simp add: bit_Suc not_int_div_2) |
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1805 |
qed |
79068 | 1806 |
|
71042
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
1807 |
instance proof |
73682
78044b2f001c
explicit type class operations for type-specific implementations
haftmann
parents:
73535
diff
changeset
|
1808 |
fix k l :: int and m n :: nat |
79031
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1809 |
show \<open>unset_bit 0 k = 2 * (k div 2)\<close> |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1810 |
by (rule bit_eqI) |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1811 |
(auto simp add: unset_bit_int_def push_bit_int_def and_int.bit_iff bit_not_int_iff bit_simps simp flip: bit_Suc) |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1812 |
show \<open>unset_bit (Suc n) k = k mod 2 + 2 * unset_bit n (k div 2)\<close> |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1813 |
by (rule bit_eqI) |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1814 |
(auto simp add: unset_bit_int_def push_bit_int_def and_int.bit_iff bit_not_int_iff bit_simps mod_2_eq_odd even_bit_succ_iff bit_0 simp flip: bit_Suc) |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
1815 |
qed (fact and_int.rec or_int.rec xor_int.rec mask_int_def set_bit_int_def flip_bit_int_def |
79072
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
1816 |
push_bit_int_def drop_bit_int_def take_bit_int_def not_int_def)+ |
71042
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
1817 |
|
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
1818 |
end |
400e9512f1d3
proof-of-concept theory for bit operations without a constructivistic representation and a minimal common logical foundation
haftmann
parents:
diff
changeset
|
1819 |
|
79070 | 1820 |
instance int :: linordered_euclidean_semiring_bit_operations .. |
1821 |
||
1822 |
context ring_bit_operations |
|
1823 |
begin |
|
1824 |
||
1825 |
lemma even_of_int_iff: |
|
1826 |
\<open>even (of_int k) \<longleftrightarrow> even k\<close> |
|
1827 |
by (induction k rule: int_bit_induct) simp_all |
|
1828 |
||
1829 |
lemma bit_of_int_iff [bit_simps]: |
|
1830 |
\<open>bit (of_int k) n \<longleftrightarrow> possible_bit TYPE('a) n \<and> bit k n\<close> |
|
1831 |
proof (cases \<open>possible_bit TYPE('a) n\<close>) |
|
1832 |
case False |
|
1833 |
then show ?thesis |
|
1834 |
by (simp add: impossible_bit) |
|
1835 |
next |
|
1836 |
case True |
|
1837 |
then have \<open>bit (of_int k) n \<longleftrightarrow> bit k n\<close> |
|
1838 |
proof (induction k arbitrary: n rule: int_bit_induct) |
|
1839 |
case zero |
|
1840 |
then show ?case |
|
1841 |
by simp |
|
1842 |
next |
|
1843 |
case minus |
|
1844 |
then show ?case |
|
1845 |
by simp |
|
1846 |
next |
|
1847 |
case (even k) |
|
1848 |
then show ?case |
|
1849 |
using bit_double_iff [of \<open>of_int k\<close> n] Bit_Operations.bit_double_iff [of k n] |
|
1850 |
by (cases n) (auto simp add: ac_simps possible_bit_def dest: mult_not_zero) |
|
1851 |
next |
|
1852 |
case (odd k) |
|
1853 |
then show ?case |
|
1854 |
using bit_double_iff [of \<open>of_int k\<close> n] |
|
1855 |
by (cases n) |
|
1856 |
(auto simp add: ac_simps bit_double_iff even_bit_succ_iff Bit_Operations.bit_0 Bit_Operations.bit_Suc |
|
1857 |
possible_bit_def dest: mult_not_zero) |
|
1858 |
qed |
|
1859 |
with True show ?thesis |
|
1860 |
by simp |
|
1861 |
qed |
|
1862 |
||
1863 |
lemma push_bit_of_int: |
|
1864 |
\<open>push_bit n (of_int k) = of_int (push_bit n k)\<close> |
|
1865 |
by (simp add: push_bit_eq_mult Bit_Operations.push_bit_eq_mult) |
|
1866 |
||
1867 |
lemma of_int_push_bit: |
|
1868 |
\<open>of_int (push_bit n k) = push_bit n (of_int k)\<close> |
|
1869 |
by (simp add: push_bit_eq_mult Bit_Operations.push_bit_eq_mult) |
|
1870 |
||
1871 |
lemma take_bit_of_int: |
|
1872 |
\<open>take_bit n (of_int k) = of_int (take_bit n k)\<close> |
|
1873 |
by (rule bit_eqI) (simp add: bit_take_bit_iff Bit_Operations.bit_take_bit_iff bit_of_int_iff) |
|
1874 |
||
1875 |
lemma of_int_take_bit: |
|
1876 |
\<open>of_int (take_bit n k) = take_bit n (of_int k)\<close> |
|
1877 |
by (rule bit_eqI) (simp add: bit_take_bit_iff Bit_Operations.bit_take_bit_iff bit_of_int_iff) |
|
1878 |
||
1879 |
lemma of_int_not_eq: |
|
1880 |
\<open>of_int (NOT k) = NOT (of_int k)\<close> |
|
1881 |
by (rule bit_eqI) (simp add: bit_not_iff Bit_Operations.bit_not_iff bit_of_int_iff) |
|
1882 |
||
1883 |
lemma of_int_not_numeral: |
|
1884 |
\<open>of_int (NOT (numeral k)) = NOT (numeral k)\<close> |
|
1885 |
by (simp add: local.of_int_not_eq) |
|
1886 |
||
1887 |
lemma of_int_and_eq: |
|
1888 |
\<open>of_int (k AND l) = of_int k AND of_int l\<close> |
|
1889 |
by (rule bit_eqI) (simp add: bit_of_int_iff bit_and_iff Bit_Operations.bit_and_iff) |
|
1890 |
||
1891 |
lemma of_int_or_eq: |
|
1892 |
\<open>of_int (k OR l) = of_int k OR of_int l\<close> |
|
1893 |
by (rule bit_eqI) (simp add: bit_of_int_iff bit_or_iff Bit_Operations.bit_or_iff) |
|
1894 |
||
1895 |
lemma of_int_xor_eq: |
|
1896 |
\<open>of_int (k XOR l) = of_int k XOR of_int l\<close> |
|
1897 |
by (rule bit_eqI) (simp add: bit_of_int_iff bit_xor_iff Bit_Operations.bit_xor_iff) |
|
1898 |
||
1899 |
lemma of_int_mask_eq: |
|
1900 |
\<open>of_int (mask n) = mask n\<close> |
|
1901 |
by (induction n) (simp_all add: mask_Suc_double Bit_Operations.mask_Suc_double of_int_or_eq) |
|
1902 |
||
1903 |
end |
|
1904 |
||
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1905 |
lemma take_bit_int_less_exp [simp]: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1906 |
\<open>take_bit n k < 2 ^ n\<close> for k :: int |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1907 |
by (simp add: take_bit_eq_mod) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1908 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1909 |
lemma take_bit_int_eq_self_iff: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1910 |
\<open>take_bit n k = k \<longleftrightarrow> 0 \<le> k \<and> k < 2 ^ n\<close> (is \<open>?P \<longleftrightarrow> ?Q\<close>) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1911 |
for k :: int |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1912 |
proof |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1913 |
assume ?P |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1914 |
moreover note take_bit_int_less_exp [of n k] take_bit_nonnegative [of n k] |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1915 |
ultimately show ?Q |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1916 |
by simp |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1917 |
next |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1918 |
assume ?Q |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1919 |
then show ?P |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1920 |
by (simp add: take_bit_eq_mod) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1921 |
qed |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1922 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1923 |
lemma take_bit_int_eq_self: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1924 |
\<open>take_bit n k = k\<close> if \<open>0 \<le> k\<close> \<open>k < 2 ^ n\<close> for k :: int |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1925 |
using that by (simp add: take_bit_int_eq_self_iff) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
1926 |
|
72028 | 1927 |
lemma mask_nonnegative_int [simp]: |
1928 |
\<open>mask n \<ge> (0::int)\<close> |
|
79071 | 1929 |
by (simp add: mask_eq_exp_minus_1 add_le_imp_le_diff) |
72028 | 1930 |
|
1931 |
lemma not_mask_negative_int [simp]: |
|
1932 |
\<open>\<not> mask n < (0::int)\<close> |
|
1933 |
by (simp add: not_less) |
|
1934 |
||
71802 | 1935 |
lemma not_nonnegative_int_iff [simp]: |
1936 |
\<open>NOT k \<ge> 0 \<longleftrightarrow> k < 0\<close> for k :: int |
|
1937 |
by (simp add: not_int_def) |
|
1938 |
||
1939 |
lemma not_negative_int_iff [simp]: |
|
1940 |
\<open>NOT k < 0 \<longleftrightarrow> k \<ge> 0\<close> for k :: int |
|
1941 |
by (subst Not_eq_iff [symmetric]) (simp add: not_less not_le) |
|
1942 |
||
1943 |
lemma and_nonnegative_int_iff [simp]: |
|
1944 |
\<open>k AND l \<ge> 0 \<longleftrightarrow> k \<ge> 0 \<or> l \<ge> 0\<close> for k l :: int |
|
1945 |
proof (induction k arbitrary: l rule: int_bit_induct) |
|
1946 |
case zero |
|
1947 |
then show ?case |
|
1948 |
by simp |
|
1949 |
next |
|
1950 |
case minus |
|
1951 |
then show ?case |
|
1952 |
by simp |
|
1953 |
next |
|
1954 |
case (even k) |
|
1955 |
then show ?case |
|
79068 | 1956 |
using and_int.rec [of \<open>k * 2\<close> l] |
74101 | 1957 |
by (simp add: pos_imp_zdiv_nonneg_iff zero_le_mult_iff) |
71802 | 1958 |
next |
1959 |
case (odd k) |
|
1960 |
from odd have \<open>0 \<le> k AND l div 2 \<longleftrightarrow> 0 \<le> k \<or> 0 \<le> l div 2\<close> |
|
1961 |
by simp |
|
74101 | 1962 |
then have \<open>0 \<le> (1 + k * 2) div 2 AND l div 2 \<longleftrightarrow> 0 \<le> (1 + k * 2) div 2 \<or> 0 \<le> l div 2\<close> |
71802 | 1963 |
by simp |
79068 | 1964 |
with and_int.rec [of \<open>1 + k * 2\<close> l] |
71802 | 1965 |
show ?case |
74101 | 1966 |
by (auto simp add: zero_le_mult_iff not_le) |
71802 | 1967 |
qed |
1968 |
||
1969 |
lemma and_negative_int_iff [simp]: |
|
1970 |
\<open>k AND l < 0 \<longleftrightarrow> k < 0 \<and> l < 0\<close> for k l :: int |
|
1971 |
by (subst Not_eq_iff [symmetric]) (simp add: not_less) |
|
1972 |
||
72009 | 1973 |
lemma and_less_eq: |
1974 |
\<open>k AND l \<le> k\<close> if \<open>l < 0\<close> for k l :: int |
|
1975 |
using that proof (induction k arbitrary: l rule: int_bit_induct) |
|
1976 |
case zero |
|
1977 |
then show ?case |
|
1978 |
by simp |
|
1979 |
next |
|
1980 |
case minus |
|
1981 |
then show ?case |
|
1982 |
by simp |
|
1983 |
next |
|
1984 |
case (even k) |
|
1985 |
from even.IH [of \<open>l div 2\<close>] even.hyps even.prems |
|
1986 |
show ?case |
|
79068 | 1987 |
by (simp add: and_int.rec [of _ l]) |
72009 | 1988 |
next |
1989 |
case (odd k) |
|
1990 |
from odd.IH [of \<open>l div 2\<close>] odd.hyps odd.prems |
|
1991 |
show ?case |
|
79068 | 1992 |
by (simp add: and_int.rec [of _ l]) |
72009 | 1993 |
qed |
1994 |
||
71802 | 1995 |
lemma or_nonnegative_int_iff [simp]: |
1996 |
\<open>k OR l \<ge> 0 \<longleftrightarrow> k \<ge> 0 \<and> l \<ge> 0\<close> for k l :: int |
|
1997 |
by (simp only: or_eq_not_not_and not_nonnegative_int_iff) simp |
|
1998 |
||
1999 |
lemma or_negative_int_iff [simp]: |
|
2000 |
\<open>k OR l < 0 \<longleftrightarrow> k < 0 \<or> l < 0\<close> for k l :: int |
|
2001 |
by (subst Not_eq_iff [symmetric]) (simp add: not_less) |
|
2002 |
||
72009 | 2003 |
lemma or_greater_eq: |
2004 |
\<open>k OR l \<ge> k\<close> if \<open>l \<ge> 0\<close> for k l :: int |
|
2005 |
using that proof (induction k arbitrary: l rule: int_bit_induct) |
|
2006 |
case zero |
|
2007 |
then show ?case |
|
2008 |
by simp |
|
2009 |
next |
|
2010 |
case minus |
|
2011 |
then show ?case |
|
2012 |
by simp |
|
2013 |
next |
|
2014 |
case (even k) |
|
2015 |
from even.IH [of \<open>l div 2\<close>] even.hyps even.prems |
|
2016 |
show ?case |
|
79068 | 2017 |
by (simp add: or_int.rec [of _ l]) |
72009 | 2018 |
next |
2019 |
case (odd k) |
|
2020 |
from odd.IH [of \<open>l div 2\<close>] odd.hyps odd.prems |
|
2021 |
show ?case |
|
79068 | 2022 |
by (simp add: or_int.rec [of _ l]) |
72009 | 2023 |
qed |
2024 |
||
71802 | 2025 |
lemma xor_nonnegative_int_iff [simp]: |
2026 |
\<open>k XOR l \<ge> 0 \<longleftrightarrow> (k \<ge> 0 \<longleftrightarrow> l \<ge> 0)\<close> for k l :: int |
|
2027 |
by (simp only: bit.xor_def or_nonnegative_int_iff) auto |
|
2028 |
||
2029 |
lemma xor_negative_int_iff [simp]: |
|
2030 |
\<open>k XOR l < 0 \<longleftrightarrow> (k < 0) \<noteq> (l < 0)\<close> for k l :: int |
|
2031 |
by (subst Not_eq_iff [symmetric]) (auto simp add: not_less) |
|
2032 |
||
72488 | 2033 |
lemma OR_upper: \<^marker>\<open>contributor \<open>Stefan Berghofer\<close>\<close> |
79017 | 2034 |
\<open>x OR y < 2 ^ n\<close> if \<open>0 \<le> x\<close> \<open>x < 2 ^ n\<close> \<open>y < 2 ^ n\<close> for x y :: int |
2035 |
using that proof (induction x arbitrary: y n rule: int_bit_induct) |
|
72488 | 2036 |
case zero |
2037 |
then show ?case |
|
2038 |
by simp |
|
2039 |
next |
|
2040 |
case minus |
|
2041 |
then show ?case |
|
2042 |
by simp |
|
2043 |
next |
|
2044 |
case (even x) |
|
2045 |
from even.IH [of \<open>n - 1\<close> \<open>y div 2\<close>] even.prems even.hyps |
|
79068 | 2046 |
show ?case |
2047 |
by (cases n) (auto simp add: or_int.rec [of \<open>_ * 2\<close>] elim: oddE) |
|
72488 | 2048 |
next |
2049 |
case (odd x) |
|
2050 |
from odd.IH [of \<open>n - 1\<close> \<open>y div 2\<close>] odd.prems odd.hyps |
|
2051 |
show ?case |
|
79068 | 2052 |
by (cases n) (auto simp add: or_int.rec [of \<open>1 + _ * 2\<close>], linarith) |
72488 | 2053 |
qed |
2054 |
||
2055 |
lemma XOR_upper: \<^marker>\<open>contributor \<open>Stefan Berghofer\<close>\<close> |
|
79017 | 2056 |
\<open>x XOR y < 2 ^ n\<close> if \<open>0 \<le> x\<close> \<open>x < 2 ^ n\<close> \<open>y < 2 ^ n\<close> for x y :: int |
2057 |
using that proof (induction x arbitrary: y n rule: int_bit_induct) |
|
72488 | 2058 |
case zero |
2059 |
then show ?case |
|
2060 |
by simp |
|
2061 |
next |
|
2062 |
case minus |
|
2063 |
then show ?case |
|
2064 |
by simp |
|
2065 |
next |
|
2066 |
case (even x) |
|
2067 |
from even.IH [of \<open>n - 1\<close> \<open>y div 2\<close>] even.prems even.hyps |
|
79068 | 2068 |
show ?case |
2069 |
by (cases n) (auto simp add: xor_int.rec [of \<open>_ * 2\<close>] elim: oddE) |
|
72488 | 2070 |
next |
2071 |
case (odd x) |
|
2072 |
from odd.IH [of \<open>n - 1\<close> \<open>y div 2\<close>] odd.prems odd.hyps |
|
2073 |
show ?case |
|
79068 | 2074 |
by (cases n) (auto simp add: xor_int.rec [of \<open>1 + _ * 2\<close>]) |
72488 | 2075 |
qed |
2076 |
||
2077 |
lemma AND_lower [simp]: \<^marker>\<open>contributor \<open>Stefan Berghofer\<close>\<close> |
|
79017 | 2078 |
\<open>0 \<le> x AND y\<close> if \<open>0 \<le> x\<close> for x y :: int |
2079 |
using that by simp |
|
72488 | 2080 |
|
2081 |
lemma OR_lower [simp]: \<^marker>\<open>contributor \<open>Stefan Berghofer\<close>\<close> |
|
79017 | 2082 |
\<open>0 \<le> x OR y\<close> if \<open>0 \<le> x\<close> \<open>0 \<le> y\<close> for x y :: int |
2083 |
using that by simp |
|
72488 | 2084 |
|
2085 |
lemma XOR_lower [simp]: \<^marker>\<open>contributor \<open>Stefan Berghofer\<close>\<close> |
|
79017 | 2086 |
\<open>0 \<le> x XOR y\<close> if \<open>0 \<le> x\<close> \<open>0 \<le> y\<close> for x y :: int |
2087 |
using that by simp |
|
72488 | 2088 |
|
2089 |
lemma AND_upper1 [simp]: \<^marker>\<open>contributor \<open>Stefan Berghofer\<close>\<close> |
|
79017 | 2090 |
\<open>x AND y \<le> x\<close> if \<open>0 \<le> x\<close> for x y :: int |
2091 |
using that proof (induction x arbitrary: y rule: int_bit_induct) |
|
73535 | 2092 |
case (odd k) |
2093 |
then have \<open>k AND y div 2 \<le> k\<close> |
|
2094 |
by simp |
|
79068 | 2095 |
then show ?case |
2096 |
by (simp add: and_int.rec [of \<open>1 + _ * 2\<close>]) |
|
2097 |
qed (simp_all add: and_int.rec [of \<open>_ * 2\<close>]) |
|
72488 | 2098 |
|
79017 | 2099 |
lemma AND_upper1' [simp]: \<^marker>\<open>contributor \<open>Stefan Berghofer\<close>\<close> |
2100 |
\<open>y AND x \<le> z\<close> if \<open>0 \<le> y\<close> \<open>y \<le> z\<close> for x y z :: int |
|
2101 |
using _ \<open>y \<le> z\<close> by (rule order_trans) (use \<open>0 \<le> y\<close> in simp) |
|
2102 |
||
2103 |
lemma AND_upper1'' [simp]: \<^marker>\<open>contributor \<open>Stefan Berghofer\<close>\<close> |
|
2104 |
\<open>y AND x < z\<close> if \<open>0 \<le> y\<close> \<open>y < z\<close> for x y z :: int |
|
2105 |
using _ \<open>y < z\<close> by (rule order_le_less_trans) (use \<open>0 \<le> y\<close> in simp) |
|
72488 | 2106 |
|
2107 |
lemma AND_upper2 [simp]: \<^marker>\<open>contributor \<open>Stefan Berghofer\<close>\<close> |
|
79017 | 2108 |
\<open>x AND y \<le> y\<close> if \<open>0 \<le> y\<close> for x y :: int |
2109 |
using that AND_upper1 [of y x] by (simp add: ac_simps) |
|
2110 |
||
2111 |
lemma AND_upper2' [simp]: \<^marker>\<open>contributor \<open>Stefan Berghofer\<close>\<close> |
|
2112 |
\<open>x AND y \<le> z\<close> if \<open>0 \<le> y\<close> \<open>y \<le> z\<close> for x y :: int |
|
2113 |
using that AND_upper1' [of y z x] by (simp add: ac_simps) |
|
2114 |
||
2115 |
lemma AND_upper2'' [simp]: \<^marker>\<open>contributor \<open>Stefan Berghofer\<close>\<close> |
|
2116 |
\<open>x AND y < z\<close> if \<open>0 \<le> y\<close> \<open>y < z\<close> for x y :: int |
|
2117 |
using that AND_upper1'' [of y z x] by (simp add: ac_simps) |
|
2118 |
||
2119 |
lemma plus_and_or: |
|
2120 |
\<open>(x AND y) + (x OR y) = x + y\<close> for x y :: int |
|
72488 | 2121 |
proof (induction x arbitrary: y rule: int_bit_induct) |
2122 |
case zero |
|
2123 |
then show ?case |
|
2124 |
by simp |
|
2125 |
next |
|
2126 |
case minus |
|
2127 |
then show ?case |
|
2128 |
by simp |
|
2129 |
next |
|
2130 |
case (even x) |
|
2131 |
from even.IH [of \<open>y div 2\<close>] |
|
2132 |
show ?case |
|
79068 | 2133 |
by (auto simp add: and_int.rec [of _ y] or_int.rec [of _ y] elim: oddE) |
72488 | 2134 |
next |
2135 |
case (odd x) |
|
2136 |
from odd.IH [of \<open>y div 2\<close>] |
|
2137 |
show ?case |
|
79068 | 2138 |
by (auto simp add: and_int.rec [of _ y] or_int.rec [of _ y] elim: oddE) |
72488 | 2139 |
qed |
2140 |
||
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2141 |
lemma push_bit_minus_one: |
79017 | 2142 |
\<open>push_bit n (- 1 :: int) = - (2 ^ n)\<close> |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2143 |
by (simp add: push_bit_eq_mult) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2144 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2145 |
lemma minus_1_div_exp_eq_int: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2146 |
\<open>- 1 div (2 :: int) ^ n = - 1\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2147 |
by (induction n) (use div_exp_eq [symmetric, of \<open>- 1 :: int\<close> 1] in \<open>simp_all add: ac_simps\<close>) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2148 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2149 |
lemma drop_bit_minus_one [simp]: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2150 |
\<open>drop_bit n (- 1 :: int) = - 1\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2151 |
by (simp add: drop_bit_eq_div minus_1_div_exp_eq_int) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2152 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2153 |
lemma take_bit_minus: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2154 |
\<open>take_bit n (- take_bit n k) = take_bit n (- k)\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2155 |
for k :: int |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2156 |
by (simp add: take_bit_eq_mod mod_minus_eq) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2157 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2158 |
lemma take_bit_diff: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2159 |
\<open>take_bit n (take_bit n k - take_bit n l) = take_bit n (k - l)\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2160 |
for k l :: int |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2161 |
by (simp add: take_bit_eq_mod mod_diff_eq) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2162 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2163 |
lemma (in ring_1) of_nat_nat_take_bit_eq [simp]: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2164 |
\<open>of_nat (nat (take_bit n k)) = of_int (take_bit n k)\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2165 |
by simp |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2166 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2167 |
lemma take_bit_minus_small_eq: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2168 |
\<open>take_bit n (- k) = 2 ^ n - k\<close> if \<open>0 < k\<close> \<open>k \<le> 2 ^ n\<close> for k :: int |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2169 |
proof - |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2170 |
define m where \<open>m = nat k\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2171 |
with that have \<open>k = int m\<close> and \<open>0 < m\<close> and \<open>m \<le> 2 ^ n\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2172 |
by simp_all |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2173 |
have \<open>(2 ^ n - m) mod 2 ^ n = 2 ^ n - m\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2174 |
using \<open>0 < m\<close> by simp |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2175 |
then have \<open>int ((2 ^ n - m) mod 2 ^ n) = int (2 ^ n - m)\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2176 |
by simp |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2177 |
then have \<open>(2 ^ n - int m) mod 2 ^ n = 2 ^ n - int m\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2178 |
using \<open>m \<le> 2 ^ n\<close> by (simp only: of_nat_mod of_nat_diff) simp |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2179 |
with \<open>k = int m\<close> have \<open>(2 ^ n - k) mod 2 ^ n = 2 ^ n - k\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2180 |
by simp |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2181 |
then show ?thesis |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2182 |
by (simp add: take_bit_eq_mod) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2183 |
qed |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2184 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2185 |
lemma push_bit_nonnegative_int_iff [simp]: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2186 |
\<open>push_bit n k \<ge> 0 \<longleftrightarrow> k \<ge> 0\<close> for k :: int |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2187 |
by (simp add: push_bit_eq_mult zero_le_mult_iff power_le_zero_eq) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2188 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2189 |
lemma push_bit_negative_int_iff [simp]: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2190 |
\<open>push_bit n k < 0 \<longleftrightarrow> k < 0\<close> for k :: int |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2191 |
by (subst Not_eq_iff [symmetric]) (simp add: not_less) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2192 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2193 |
lemma drop_bit_nonnegative_int_iff [simp]: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2194 |
\<open>drop_bit n k \<ge> 0 \<longleftrightarrow> k \<ge> 0\<close> for k :: int |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2195 |
by (induction n) (auto simp add: drop_bit_Suc drop_bit_half) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2196 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2197 |
lemma drop_bit_negative_int_iff [simp]: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2198 |
\<open>drop_bit n k < 0 \<longleftrightarrow> k < 0\<close> for k :: int |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2199 |
by (subst Not_eq_iff [symmetric]) (simp add: not_less) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2200 |
|
71802 | 2201 |
lemma set_bit_nonnegative_int_iff [simp]: |
2202 |
\<open>set_bit n k \<ge> 0 \<longleftrightarrow> k \<ge> 0\<close> for k :: int |
|
79068 | 2203 |
by (simp add: set_bit_eq_or) |
71802 | 2204 |
|
2205 |
lemma set_bit_negative_int_iff [simp]: |
|
2206 |
\<open>set_bit n k < 0 \<longleftrightarrow> k < 0\<close> for k :: int |
|
79068 | 2207 |
by (simp add: set_bit_eq_or) |
71802 | 2208 |
|
2209 |
lemma unset_bit_nonnegative_int_iff [simp]: |
|
2210 |
\<open>unset_bit n k \<ge> 0 \<longleftrightarrow> k \<ge> 0\<close> for k :: int |
|
79068 | 2211 |
by (simp add: unset_bit_eq_and_not) |
71802 | 2212 |
|
2213 |
lemma unset_bit_negative_int_iff [simp]: |
|
2214 |
\<open>unset_bit n k < 0 \<longleftrightarrow> k < 0\<close> for k :: int |
|
79068 | 2215 |
by (simp add: unset_bit_eq_and_not) |
71802 | 2216 |
|
2217 |
lemma flip_bit_nonnegative_int_iff [simp]: |
|
2218 |
\<open>flip_bit n k \<ge> 0 \<longleftrightarrow> k \<ge> 0\<close> for k :: int |
|
79068 | 2219 |
by (simp add: flip_bit_eq_xor) |
71802 | 2220 |
|
2221 |
lemma flip_bit_negative_int_iff [simp]: |
|
2222 |
\<open>flip_bit n k < 0 \<longleftrightarrow> k < 0\<close> for k :: int |
|
79068 | 2223 |
by (simp add: flip_bit_eq_xor) |
71802 | 2224 |
|
71986 | 2225 |
lemma set_bit_greater_eq: |
2226 |
\<open>set_bit n k \<ge> k\<close> for k :: int |
|
79068 | 2227 |
by (simp add: set_bit_eq_or or_greater_eq) |
71986 | 2228 |
|
2229 |
lemma unset_bit_less_eq: |
|
2230 |
\<open>unset_bit n k \<le> k\<close> for k :: int |
|
79068 | 2231 |
by (simp add: unset_bit_eq_and_not and_less_eq) |
71986 | 2232 |
|
75651
f4116b7a6679
Move code lemmas for symbolic computation of bit operations on int to distribution.
haftmann
parents:
75138
diff
changeset
|
2233 |
lemma and_int_unfold: |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2234 |
\<open>k AND l = (if k = 0 \<or> l = 0 then 0 else if k = - 1 then l else if l = - 1 then k |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2235 |
else (k mod 2) * (l mod 2) + 2 * ((k div 2) AND (l div 2)))\<close> for k l :: int |
79068 | 2236 |
by (auto simp add: and_int.rec [of k l] zmult_eq_1_iff elim: oddE) |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2237 |
|
75651
f4116b7a6679
Move code lemmas for symbolic computation of bit operations on int to distribution.
haftmann
parents:
75138
diff
changeset
|
2238 |
lemma or_int_unfold: |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2239 |
\<open>k OR l = (if k = - 1 \<or> l = - 1 then - 1 else if k = 0 then l else if l = 0 then k |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2240 |
else max (k mod 2) (l mod 2) + 2 * ((k div 2) OR (l div 2)))\<close> for k l :: int |
79068 | 2241 |
by (auto simp add: or_int.rec [of k l] elim: oddE) |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2242 |
|
75651
f4116b7a6679
Move code lemmas for symbolic computation of bit operations on int to distribution.
haftmann
parents:
75138
diff
changeset
|
2243 |
lemma xor_int_unfold: |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2244 |
\<open>k XOR l = (if k = - 1 then NOT l else if l = - 1 then NOT k else if k = 0 then l else if l = 0 then k |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2245 |
else \<bar>k mod 2 - l mod 2\<bar> + 2 * ((k div 2) XOR (l div 2)))\<close> for k l :: int |
79068 | 2246 |
by (auto simp add: xor_int.rec [of k l] not_int_def elim!: oddE) |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2247 |
|
74163 | 2248 |
lemma bit_minus_int_iff: |
79017 | 2249 |
\<open>bit (- k) n \<longleftrightarrow> bit (NOT (k - 1)) n\<close> for k :: int |
74163 | 2250 |
by (simp add: bit_simps) |
2251 |
||
74592 | 2252 |
lemma take_bit_incr_eq: |
79017 | 2253 |
\<open>take_bit n (k + 1) = 1 + take_bit n k\<close> if \<open>take_bit n k \<noteq> 2 ^ n - 1\<close> for k :: int |
74592 | 2254 |
proof - |
2255 |
from that have \<open>2 ^ n \<noteq> k mod 2 ^ n + 1\<close> |
|
2256 |
by (simp add: take_bit_eq_mod) |
|
2257 |
moreover have \<open>k mod 2 ^ n < 2 ^ n\<close> |
|
2258 |
by simp |
|
2259 |
ultimately have *: \<open>k mod 2 ^ n + 1 < 2 ^ n\<close> |
|
2260 |
by linarith |
|
2261 |
have \<open>(k + 1) mod 2 ^ n = (k mod 2 ^ n + 1) mod 2 ^ n\<close> |
|
2262 |
by (simp add: mod_simps) |
|
2263 |
also have \<open>\<dots> = k mod 2 ^ n + 1\<close> |
|
2264 |
using * by (simp add: zmod_trivial_iff) |
|
2265 |
finally have \<open>(k + 1) mod 2 ^ n = k mod 2 ^ n + 1\<close> . |
|
2266 |
then show ?thesis |
|
2267 |
by (simp add: take_bit_eq_mod) |
|
2268 |
qed |
|
2269 |
||
2270 |
lemma take_bit_decr_eq: |
|
79017 | 2271 |
\<open>take_bit n (k - 1) = take_bit n k - 1\<close> if \<open>take_bit n k \<noteq> 0\<close> for k :: int |
74592 | 2272 |
proof - |
2273 |
from that have \<open>k mod 2 ^ n \<noteq> 0\<close> |
|
2274 |
by (simp add: take_bit_eq_mod) |
|
2275 |
moreover have \<open>k mod 2 ^ n \<ge> 0\<close> \<open>k mod 2 ^ n < 2 ^ n\<close> |
|
2276 |
by simp_all |
|
2277 |
ultimately have *: \<open>k mod 2 ^ n > 0\<close> |
|
2278 |
by linarith |
|
2279 |
have \<open>(k - 1) mod 2 ^ n = (k mod 2 ^ n - 1) mod 2 ^ n\<close> |
|
2280 |
by (simp add: mod_simps) |
|
2281 |
also have \<open>\<dots> = k mod 2 ^ n - 1\<close> |
|
2282 |
by (simp add: zmod_trivial_iff) |
|
2283 |
(use \<open>k mod 2 ^ n < 2 ^ n\<close> * in linarith) |
|
2284 |
finally have \<open>(k - 1) mod 2 ^ n = k mod 2 ^ n - 1\<close> . |
|
2285 |
then show ?thesis |
|
2286 |
by (simp add: take_bit_eq_mod) |
|
2287 |
qed |
|
2288 |
||
2289 |
lemma take_bit_int_greater_eq: |
|
2290 |
\<open>k + 2 ^ n \<le> take_bit n k\<close> if \<open>k < 0\<close> for k :: int |
|
2291 |
proof - |
|
2292 |
have \<open>k + 2 ^ n \<le> take_bit n (k + 2 ^ n)\<close> |
|
2293 |
proof (cases \<open>k > - (2 ^ n)\<close>) |
|
2294 |
case False |
|
2295 |
then have \<open>k + 2 ^ n \<le> 0\<close> |
|
2296 |
by simp |
|
2297 |
also note take_bit_nonnegative |
|
2298 |
finally show ?thesis . |
|
2299 |
next |
|
2300 |
case True |
|
2301 |
with that have \<open>0 \<le> k + 2 ^ n\<close> and \<open>k + 2 ^ n < 2 ^ n\<close> |
|
2302 |
by simp_all |
|
2303 |
then show ?thesis |
|
2304 |
by (simp only: take_bit_eq_mod mod_pos_pos_trivial) |
|
2305 |
qed |
|
2306 |
then show ?thesis |
|
2307 |
by (simp add: take_bit_eq_mod) |
|
2308 |
qed |
|
2309 |
||
2310 |
lemma take_bit_int_less_eq: |
|
2311 |
\<open>take_bit n k \<le> k - 2 ^ n\<close> if \<open>2 ^ n \<le> k\<close> and \<open>n > 0\<close> for k :: int |
|
2312 |
using that zmod_le_nonneg_dividend [of \<open>k - 2 ^ n\<close> \<open>2 ^ n\<close>] |
|
2313 |
by (simp add: take_bit_eq_mod) |
|
2314 |
||
2315 |
lemma take_bit_int_less_eq_self_iff: |
|
79017 | 2316 |
\<open>take_bit n k \<le> k \<longleftrightarrow> 0 \<le> k\<close> (is \<open>?P \<longleftrightarrow> ?Q\<close>) for k :: int |
74592 | 2317 |
proof |
2318 |
assume ?P |
|
2319 |
show ?Q |
|
2320 |
proof (rule ccontr) |
|
2321 |
assume \<open>\<not> 0 \<le> k\<close> |
|
2322 |
then have \<open>k < 0\<close> |
|
2323 |
by simp |
|
2324 |
with \<open>?P\<close> |
|
2325 |
have \<open>take_bit n k < 0\<close> |
|
2326 |
by (rule le_less_trans) |
|
2327 |
then show False |
|
2328 |
by simp |
|
2329 |
qed |
|
2330 |
next |
|
2331 |
assume ?Q |
|
2332 |
then show ?P |
|
2333 |
by (simp add: take_bit_eq_mod zmod_le_nonneg_dividend) |
|
2334 |
qed |
|
2335 |
||
2336 |
lemma take_bit_int_less_self_iff: |
|
79017 | 2337 |
\<open>take_bit n k < k \<longleftrightarrow> 2 ^ n \<le> k\<close> for k :: int |
74592 | 2338 |
by (auto simp add: less_le take_bit_int_less_eq_self_iff take_bit_int_eq_self_iff |
2339 |
intro: order_trans [of 0 \<open>2 ^ n\<close> k]) |
|
2340 |
||
2341 |
lemma take_bit_int_greater_self_iff: |
|
79017 | 2342 |
\<open>k < take_bit n k \<longleftrightarrow> k < 0\<close> for k :: int |
74592 | 2343 |
using take_bit_int_less_eq_self_iff [of n k] by auto |
2344 |
||
2345 |
lemma take_bit_int_greater_eq_self_iff: |
|
79017 | 2346 |
\<open>k \<le> take_bit n k \<longleftrightarrow> k < 2 ^ n\<close> for k :: int |
74592 | 2347 |
by (auto simp add: le_less take_bit_int_greater_self_iff take_bit_int_eq_self_iff |
2348 |
dest: sym not_sym intro: less_trans [of k 0 \<open>2 ^ n\<close>]) |
|
2349 |
||
79070 | 2350 |
lemma take_bit_tightened_less_eq_int: |
2351 |
\<open>take_bit m k \<le> take_bit n k\<close> if \<open>m \<le> n\<close> for k :: int |
|
2352 |
proof - |
|
2353 |
have \<open>take_bit m (take_bit n k) \<le> take_bit n k\<close> |
|
2354 |
by (simp only: take_bit_int_less_eq_self_iff take_bit_nonnegative) |
|
2355 |
with that show ?thesis |
|
2356 |
by simp |
|
2357 |
qed |
|
2358 |
||
74592 | 2359 |
lemma not_exp_less_eq_0_int [simp]: |
2360 |
\<open>\<not> 2 ^ n \<le> (0::int)\<close> |
|
2361 |
by (simp add: power_le_zero_eq) |
|
2362 |
||
2363 |
lemma int_bit_bound: |
|
2364 |
fixes k :: int |
|
2365 |
obtains n where \<open>\<And>m. n \<le> m \<Longrightarrow> bit k m \<longleftrightarrow> bit k n\<close> |
|
2366 |
and \<open>n > 0 \<Longrightarrow> bit k (n - 1) \<noteq> bit k n\<close> |
|
2367 |
proof - |
|
2368 |
obtain q where *: \<open>\<And>m. q \<le> m \<Longrightarrow> bit k m \<longleftrightarrow> bit k q\<close> |
|
2369 |
proof (cases \<open>k \<ge> 0\<close>) |
|
2370 |
case True |
|
2371 |
moreover from power_gt_expt [of 2 \<open>nat k\<close>] |
|
2372 |
have \<open>nat k < 2 ^ nat k\<close> |
|
2373 |
by simp |
|
2374 |
then have \<open>int (nat k) < int (2 ^ nat k)\<close> |
|
2375 |
by (simp only: of_nat_less_iff) |
|
2376 |
ultimately have *: \<open>k div 2 ^ nat k = 0\<close> |
|
2377 |
by simp |
|
2378 |
show thesis |
|
2379 |
proof (rule that [of \<open>nat k\<close>]) |
|
2380 |
fix m |
|
2381 |
assume \<open>nat k \<le> m\<close> |
|
2382 |
then show \<open>bit k m \<longleftrightarrow> bit k (nat k)\<close> |
|
2383 |
by (auto simp add: * bit_iff_odd power_add zdiv_zmult2_eq dest!: le_Suc_ex) |
|
2384 |
qed |
|
2385 |
next |
|
2386 |
case False |
|
2387 |
moreover from power_gt_expt [of 2 \<open>nat (- k)\<close>] |
|
2388 |
have \<open>nat (- k) < 2 ^ nat (- k)\<close> |
|
2389 |
by simp |
|
2390 |
then have \<open>int (nat (- k)) < int (2 ^ nat (- k))\<close> |
|
2391 |
by (simp only: of_nat_less_iff) |
|
2392 |
ultimately have \<open>- k div - (2 ^ nat (- k)) = - 1\<close> |
|
2393 |
by (subst div_pos_neg_trivial) simp_all |
|
2394 |
then have *: \<open>k div 2 ^ nat (- k) = - 1\<close> |
|
2395 |
by simp |
|
2396 |
show thesis |
|
2397 |
proof (rule that [of \<open>nat (- k)\<close>]) |
|
2398 |
fix m |
|
2399 |
assume \<open>nat (- k) \<le> m\<close> |
|
2400 |
then show \<open>bit k m \<longleftrightarrow> bit k (nat (- k))\<close> |
|
2401 |
by (auto simp add: * bit_iff_odd power_add zdiv_zmult2_eq minus_1_div_exp_eq_int dest!: le_Suc_ex) |
|
2402 |
qed |
|
2403 |
qed |
|
2404 |
show thesis |
|
2405 |
proof (cases \<open>\<forall>m. bit k m \<longleftrightarrow> bit k q\<close>) |
|
2406 |
case True |
|
2407 |
then have \<open>bit k 0 \<longleftrightarrow> bit k q\<close> |
|
2408 |
by blast |
|
2409 |
with True that [of 0] show thesis |
|
2410 |
by simp |
|
2411 |
next |
|
2412 |
case False |
|
2413 |
then obtain r where **: \<open>bit k r \<noteq> bit k q\<close> |
|
2414 |
by blast |
|
2415 |
have \<open>r < q\<close> |
|
2416 |
by (rule ccontr) (use * [of r] ** in simp) |
|
2417 |
define N where \<open>N = {n. n < q \<and> bit k n \<noteq> bit k q}\<close> |
|
2418 |
moreover have \<open>finite N\<close> \<open>r \<in> N\<close> |
|
2419 |
using ** N_def \<open>r < q\<close> by auto |
|
2420 |
moreover define n where \<open>n = Suc (Max N)\<close> |
|
2421 |
ultimately have \<open>\<And>m. n \<le> m \<Longrightarrow> bit k m \<longleftrightarrow> bit k n\<close> |
|
2422 |
apply auto |
|
2423 |
apply (metis (full_types, lifting) "*" Max_ge_iff Suc_n_not_le_n \<open>finite N\<close> all_not_in_conv mem_Collect_eq not_le) |
|
2424 |
apply (metis "*" Max_ge Suc_n_not_le_n \<open>finite N\<close> linorder_not_less mem_Collect_eq) |
|
2425 |
apply (metis "*" Max_ge Suc_n_not_le_n \<open>finite N\<close> linorder_not_less mem_Collect_eq) |
|
2426 |
apply (metis (full_types, lifting) "*" Max_ge_iff Suc_n_not_le_n \<open>finite N\<close> all_not_in_conv mem_Collect_eq not_le) |
|
2427 |
done |
|
2428 |
have \<open>bit k (Max N) \<noteq> bit k n\<close> |
|
2429 |
by (metis (mono_tags, lifting) "*" Max_in N_def \<open>\<And>m. n \<le> m \<Longrightarrow> bit k m = bit k n\<close> \<open>finite N\<close> \<open>r \<in> N\<close> empty_iff le_cases mem_Collect_eq) |
|
2430 |
show thesis apply (rule that [of n]) |
|
2431 |
using \<open>\<And>m. n \<le> m \<Longrightarrow> bit k m = bit k n\<close> apply blast |
|
2432 |
using \<open>bit k (Max N) \<noteq> bit k n\<close> n_def by auto |
|
2433 |
qed |
|
2434 |
qed |
|
2435 |
||
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2436 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2437 |
subsection \<open>Instance \<^typ>\<open>nat\<close>\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2438 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2439 |
instantiation nat :: semiring_bit_operations |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2440 |
begin |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2441 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2442 |
definition and_nat :: \<open>nat \<Rightarrow> nat \<Rightarrow> nat\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2443 |
where \<open>m AND n = nat (int m AND int n)\<close> for m n :: nat |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2444 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2445 |
definition or_nat :: \<open>nat \<Rightarrow> nat \<Rightarrow> nat\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2446 |
where \<open>m OR n = nat (int m OR int n)\<close> for m n :: nat |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2447 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2448 |
definition xor_nat :: \<open>nat \<Rightarrow> nat \<Rightarrow> nat\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2449 |
where \<open>m XOR n = nat (int m XOR int n)\<close> for m n :: nat |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2450 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2451 |
definition mask_nat :: \<open>nat \<Rightarrow> nat\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2452 |
where \<open>mask n = (2 :: nat) ^ n - 1\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2453 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2454 |
definition push_bit_nat :: \<open>nat \<Rightarrow> nat \<Rightarrow> nat\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2455 |
where \<open>push_bit_nat n m = m * 2 ^ n\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2456 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2457 |
definition drop_bit_nat :: \<open>nat \<Rightarrow> nat \<Rightarrow> nat\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2458 |
where \<open>drop_bit_nat n m = m div 2 ^ n\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2459 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2460 |
definition take_bit_nat :: \<open>nat \<Rightarrow> nat \<Rightarrow> nat\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2461 |
where \<open>take_bit_nat n m = m mod 2 ^ n\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2462 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2463 |
definition set_bit_nat :: \<open>nat \<Rightarrow> nat \<Rightarrow> nat\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2464 |
where \<open>set_bit m n = n OR push_bit m 1\<close> for m n :: nat |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2465 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2466 |
definition unset_bit_nat :: \<open>nat \<Rightarrow> nat \<Rightarrow> nat\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2467 |
where \<open>unset_bit m n = nat (unset_bit m (int n))\<close> for m n :: nat |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2468 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2469 |
definition flip_bit_nat :: \<open>nat \<Rightarrow> nat \<Rightarrow> nat\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2470 |
where \<open>flip_bit m n = n XOR push_bit m 1\<close> for m n :: nat |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2471 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2472 |
instance proof |
79031
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
2473 |
fix m n :: nat |
79008
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
2474 |
show \<open>m AND n = of_bool (odd m \<and> odd n) + 2 * (m div 2 AND n div 2)\<close> |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
2475 |
by (simp add: and_nat_def and_rec [of \<open>int m\<close> \<open>int n\<close>] nat_add_distrib of_nat_div) |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
2476 |
show \<open>m OR n = of_bool (odd m \<or> odd n) + 2 * (m div 2 OR n div 2)\<close> |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
2477 |
by (simp add: or_nat_def or_rec [of \<open>int m\<close> \<open>int n\<close>] nat_add_distrib of_nat_div) |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
2478 |
show \<open>m XOR n = of_bool (odd m \<noteq> odd n) + 2 * (m div 2 XOR n div 2)\<close> |
74a4776f7a22
operations AND, OR, XOR are specified by characteristic recursive equation
haftmann
parents:
78955
diff
changeset
|
2479 |
by (simp add: xor_nat_def xor_rec [of \<open>int m\<close> \<open>int n\<close>] nat_add_distrib of_nat_div) |
79031
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
2480 |
show \<open>unset_bit 0 n = 2 * (n div 2)\<close> |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
2481 |
by (simp add: unset_bit_nat_def nat_mult_distrib) |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
2482 |
show \<open>unset_bit (Suc m) n = n mod 2 + 2 * unset_bit m (n div 2)\<close> |
4596a14d9a95
slightly more elementary characterization of unset_bit
haftmann
parents:
79030
diff
changeset
|
2483 |
by (simp add: unset_bit_nat_def unset_bit_Suc nat_add_distrib nat_mult_distrib nat_mod_distrib of_nat_div) |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2484 |
qed (simp_all add: mask_nat_def set_bit_nat_def flip_bit_nat_def push_bit_nat_def drop_bit_nat_def take_bit_nat_def) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2485 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2486 |
end |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2487 |
|
79070 | 2488 |
instance nat :: linordered_euclidean_semiring_bit_operations .. |
2489 |
||
2490 |
context semiring_bit_operations |
|
2491 |
begin |
|
2492 |
||
2493 |
lemma push_bit_of_nat: |
|
2494 |
\<open>push_bit n (of_nat m) = of_nat (push_bit n m)\<close> |
|
2495 |
by (simp add: push_bit_eq_mult Bit_Operations.push_bit_eq_mult) |
|
2496 |
||
2497 |
lemma of_nat_push_bit: |
|
2498 |
\<open>of_nat (push_bit m n) = push_bit m (of_nat n)\<close> |
|
2499 |
by (simp add: push_bit_eq_mult Bit_Operations.push_bit_eq_mult) |
|
2500 |
||
2501 |
lemma take_bit_of_nat: |
|
2502 |
\<open>take_bit n (of_nat m) = of_nat (take_bit n m)\<close> |
|
2503 |
by (rule bit_eqI) (simp add: bit_take_bit_iff Bit_Operations.bit_take_bit_iff bit_of_nat_iff) |
|
2504 |
||
2505 |
lemma of_nat_take_bit: |
|
2506 |
\<open>of_nat (take_bit n m) = take_bit n (of_nat m)\<close> |
|
2507 |
by (rule bit_eqI) (simp add: bit_take_bit_iff Bit_Operations.bit_take_bit_iff bit_of_nat_iff) |
|
2508 |
||
2509 |
lemma of_nat_and_eq: |
|
2510 |
\<open>of_nat (m AND n) = of_nat m AND of_nat n\<close> |
|
2511 |
by (rule bit_eqI) (simp add: bit_of_nat_iff bit_and_iff Bit_Operations.bit_and_iff) |
|
2512 |
||
2513 |
lemma of_nat_or_eq: |
|
2514 |
\<open>of_nat (m OR n) = of_nat m OR of_nat n\<close> |
|
2515 |
by (rule bit_eqI) (simp add: bit_of_nat_iff bit_or_iff Bit_Operations.bit_or_iff) |
|
2516 |
||
2517 |
lemma of_nat_xor_eq: |
|
2518 |
\<open>of_nat (m XOR n) = of_nat m XOR of_nat n\<close> |
|
2519 |
by (rule bit_eqI) (simp add: bit_of_nat_iff bit_xor_iff Bit_Operations.bit_xor_iff) |
|
2520 |
||
2521 |
lemma of_nat_mask_eq: |
|
2522 |
\<open>of_nat (mask n) = mask n\<close> |
|
2523 |
by (induction n) (simp_all add: mask_Suc_double Bit_Operations.mask_Suc_double of_nat_or_eq) |
|
2524 |
||
2525 |
end |
|
2526 |
||
2527 |
context linordered_euclidean_semiring_bit_operations |
|
2528 |
begin |
|
2529 |
||
2530 |
lemma drop_bit_of_nat: |
|
2531 |
"drop_bit n (of_nat m) = of_nat (drop_bit n m)" |
|
2532 |
by (simp add: drop_bit_eq_div Bit_Operations.drop_bit_eq_div of_nat_div [of m "2 ^ n"]) |
|
2533 |
||
2534 |
lemma of_nat_drop_bit: |
|
2535 |
\<open>of_nat (drop_bit m n) = drop_bit m (of_nat n)\<close> |
|
2536 |
by (simp add: drop_bit_eq_div Bit_Operations.drop_bit_eq_div of_nat_div) |
|
2537 |
||
2538 |
end |
|
2539 |
||
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2540 |
lemma take_bit_nat_less_exp [simp]: |
79068 | 2541 |
\<open>take_bit n m < 2 ^ n\<close> for n m :: nat |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2542 |
by (simp add: take_bit_eq_mod) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2543 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2544 |
lemma take_bit_nat_eq_self_iff: |
79017 | 2545 |
\<open>take_bit n m = m \<longleftrightarrow> m < 2 ^ n\<close> (is \<open>?P \<longleftrightarrow> ?Q\<close>) for n m :: nat |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2546 |
proof |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2547 |
assume ?P |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2548 |
moreover note take_bit_nat_less_exp [of n m] |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2549 |
ultimately show ?Q |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2550 |
by simp |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2551 |
next |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2552 |
assume ?Q |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2553 |
then show ?P |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2554 |
by (simp add: take_bit_eq_mod) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2555 |
qed |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2556 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2557 |
lemma take_bit_nat_eq_self: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2558 |
\<open>take_bit n m = m\<close> if \<open>m < 2 ^ n\<close> for m n :: nat |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2559 |
using that by (simp add: take_bit_nat_eq_self_iff) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2560 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2561 |
lemma take_bit_nat_less_eq_self [simp]: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2562 |
\<open>take_bit n m \<le> m\<close> for n m :: nat |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2563 |
by (simp add: take_bit_eq_mod) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2564 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2565 |
lemma take_bit_nat_less_self_iff: |
79017 | 2566 |
\<open>take_bit n m < m \<longleftrightarrow> 2 ^ n \<le> m\<close> (is \<open>?P \<longleftrightarrow> ?Q\<close>) for m n :: nat |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2567 |
proof |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2568 |
assume ?P |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2569 |
then have \<open>take_bit n m \<noteq> m\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2570 |
by simp |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2571 |
then show \<open>?Q\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2572 |
by (simp add: take_bit_nat_eq_self_iff) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2573 |
next |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2574 |
have \<open>take_bit n m < 2 ^ n\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2575 |
by (fact take_bit_nat_less_exp) |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2576 |
also assume ?Q |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2577 |
finally show ?P . |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2578 |
qed |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2579 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2580 |
lemma Suc_0_and_eq [simp]: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2581 |
\<open>Suc 0 AND n = n mod 2\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2582 |
using one_and_eq [of n] by simp |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2583 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2584 |
lemma and_Suc_0_eq [simp]: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2585 |
\<open>n AND Suc 0 = n mod 2\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2586 |
using and_one_eq [of n] by simp |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2587 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2588 |
lemma Suc_0_or_eq: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2589 |
\<open>Suc 0 OR n = n + of_bool (even n)\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2590 |
using one_or_eq [of n] by simp |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2591 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2592 |
lemma or_Suc_0_eq: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2593 |
\<open>n OR Suc 0 = n + of_bool (even n)\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2594 |
using or_one_eq [of n] by simp |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2595 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2596 |
lemma Suc_0_xor_eq: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2597 |
\<open>Suc 0 XOR n = n + of_bool (even n) - of_bool (odd n)\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2598 |
using one_xor_eq [of n] by simp |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2599 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2600 |
lemma xor_Suc_0_eq: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2601 |
\<open>n XOR Suc 0 = n + of_bool (even n) - of_bool (odd n)\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2602 |
using xor_one_eq [of n] by simp |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2603 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2604 |
lemma and_nat_unfold [code]: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2605 |
\<open>m AND n = (if m = 0 \<or> n = 0 then 0 else (m mod 2) * (n mod 2) + 2 * ((m div 2) AND (n div 2)))\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2606 |
for m n :: nat |
79070 | 2607 |
by (auto simp add: and_rec [of m n] elim: oddE) |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2608 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2609 |
lemma or_nat_unfold [code]: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2610 |
\<open>m OR n = (if m = 0 then n else if n = 0 then m |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2611 |
else max (m mod 2) (n mod 2) + 2 * ((m div 2) OR (n div 2)))\<close> for m n :: nat |
79070 | 2612 |
by (auto simp add: or_rec [of m n] elim: oddE) |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2613 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2614 |
lemma xor_nat_unfold [code]: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2615 |
\<open>m XOR n = (if m = 0 then n else if n = 0 then m |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2616 |
else (m mod 2 + n mod 2) mod 2 + 2 * ((m div 2) XOR (n div 2)))\<close> for m n :: nat |
79070 | 2617 |
by (auto simp add: xor_rec [of m n] elim!: oddE) |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2618 |
|
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2619 |
lemma [code]: |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2620 |
\<open>unset_bit 0 m = 2 * (m div 2)\<close> |
74163 | 2621 |
\<open>unset_bit (Suc n) m = m mod 2 + 2 * unset_bit n (m div 2)\<close> for m n :: nat |
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2622 |
by (simp_all add: unset_bit_Suc) |
74495 | 2623 |
|
74592 | 2624 |
lemma push_bit_of_Suc_0 [simp]: |
2625 |
\<open>push_bit n (Suc 0) = 2 ^ n\<close> |
|
2626 |
using push_bit_of_1 [where ?'a = nat] by simp |
|
2627 |
||
2628 |
lemma take_bit_of_Suc_0 [simp]: |
|
2629 |
\<open>take_bit n (Suc 0) = of_bool (0 < n)\<close> |
|
2630 |
using take_bit_of_1 [where ?'a = nat] by simp |
|
2631 |
||
2632 |
lemma drop_bit_of_Suc_0 [simp]: |
|
2633 |
\<open>drop_bit n (Suc 0) = of_bool (n = 0)\<close> |
|
2634 |
using drop_bit_of_1 [where ?'a = nat] by simp |
|
2635 |
||
2636 |
lemma Suc_mask_eq_exp: |
|
2637 |
\<open>Suc (mask n) = 2 ^ n\<close> |
|
2638 |
by (simp add: mask_eq_exp_minus_1) |
|
2639 |
||
2640 |
lemma less_eq_mask: |
|
2641 |
\<open>n \<le> mask n\<close> |
|
2642 |
by (simp add: mask_eq_exp_minus_1 le_diff_conv2) |
|
2643 |
(metis Suc_mask_eq_exp diff_Suc_1 diff_le_diff_pow diff_zero le_refl not_less_eq_eq power_0) |
|
2644 |
||
2645 |
lemma less_mask: |
|
2646 |
\<open>n < mask n\<close> if \<open>Suc 0 < n\<close> |
|
2647 |
proof - |
|
2648 |
define m where \<open>m = n - 2\<close> |
|
2649 |
with that have *: \<open>n = m + 2\<close> |
|
2650 |
by simp |
|
2651 |
have \<open>Suc (Suc (Suc m)) < 4 * 2 ^ m\<close> |
|
2652 |
by (induction m) simp_all |
|
2653 |
then have \<open>Suc (m + 2) < Suc (mask (m + 2))\<close> |
|
2654 |
by (simp add: Suc_mask_eq_exp) |
|
2655 |
then have \<open>m + 2 < mask (m + 2)\<close> |
|
2656 |
by (simp add: less_le) |
|
2657 |
with * show ?thesis |
|
2658 |
by simp |
|
2659 |
qed |
|
2660 |
||
2661 |
lemma mask_nat_less_exp [simp]: |
|
2662 |
\<open>(mask n :: nat) < 2 ^ n\<close> |
|
2663 |
by (simp add: mask_eq_exp_minus_1) |
|
2664 |
||
2665 |
lemma mask_nat_positive_iff [simp]: |
|
2666 |
\<open>(0::nat) < mask n \<longleftrightarrow> 0 < n\<close> |
|
2667 |
proof (cases \<open>n = 0\<close>) |
|
2668 |
case True |
|
2669 |
then show ?thesis |
|
2670 |
by simp |
|
2671 |
next |
|
2672 |
case False |
|
2673 |
then have \<open>0 < n\<close> |
|
2674 |
by simp |
|
2675 |
then have \<open>(0::nat) < mask n\<close> |
|
2676 |
using less_eq_mask [of n] by (rule order_less_le_trans) |
|
2677 |
with \<open>0 < n\<close> show ?thesis |
|
2678 |
by simp |
|
2679 |
qed |
|
2680 |
||
2681 |
lemma take_bit_tightened_less_eq_nat: |
|
2682 |
\<open>take_bit m q \<le> take_bit n q\<close> if \<open>m \<le> n\<close> for q :: nat |
|
2683 |
proof - |
|
2684 |
have \<open>take_bit m (take_bit n q) \<le> take_bit n q\<close> |
|
2685 |
by (rule take_bit_nat_less_eq_self) |
|
2686 |
with that show ?thesis |
|
2687 |
by simp |
|
2688 |
qed |
|
2689 |
||
2690 |
lemma push_bit_nat_eq: |
|
2691 |
\<open>push_bit n (nat k) = nat (push_bit n k)\<close> |
|
2692 |
by (cases \<open>k \<ge> 0\<close>) (simp_all add: push_bit_eq_mult nat_mult_distrib not_le mult_nonneg_nonpos2) |
|
2693 |
||
2694 |
lemma drop_bit_nat_eq: |
|
2695 |
\<open>drop_bit n (nat k) = nat (drop_bit n k)\<close> |
|
2696 |
apply (cases \<open>k \<ge> 0\<close>) |
|
2697 |
apply (simp_all add: drop_bit_eq_div nat_div_distrib nat_power_eq not_le) |
|
2698 |
apply (simp add: divide_int_def) |
|
2699 |
done |
|
2700 |
||
2701 |
lemma take_bit_nat_eq: |
|
2702 |
\<open>take_bit n (nat k) = nat (take_bit n k)\<close> if \<open>k \<ge> 0\<close> |
|
2703 |
using that by (simp add: take_bit_eq_mod nat_mod_distrib nat_power_eq) |
|
2704 |
||
2705 |
lemma nat_take_bit_eq: |
|
2706 |
\<open>nat (take_bit n k) = take_bit n (nat k)\<close> |
|
2707 |
if \<open>k \<ge> 0\<close> |
|
2708 |
using that by (simp add: take_bit_eq_mod nat_mod_distrib nat_power_eq) |
|
2709 |
||
2710 |
lemma nat_mask_eq: |
|
2711 |
\<open>nat (mask n) = mask n\<close> |
|
2712 |
by (simp add: nat_eq_iff of_nat_mask_eq) |
|
2713 |
||
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
2714 |
|
74163 | 2715 |
subsection \<open>Symbolic computations on numeral expressions\<close> |
2716 |
||
75138 | 2717 |
context semiring_bits |
74163 | 2718 |
begin |
2719 |
||
75085 | 2720 |
lemma not_bit_numeral_Bit0_0 [simp]: |
2721 |
\<open>\<not> bit (numeral (Num.Bit0 m)) 0\<close> |
|
2722 |
by (simp add: bit_0) |
|
2723 |
||
2724 |
lemma bit_numeral_Bit1_0 [simp]: |
|
2725 |
\<open>bit (numeral (Num.Bit1 m)) 0\<close> |
|
2726 |
by (simp add: bit_0) |
|
2727 |
||
75138 | 2728 |
end |
2729 |
||
2730 |
context ring_bit_operations |
|
2731 |
begin |
|
2732 |
||
2733 |
lemma not_bit_minus_numeral_Bit0_0 [simp]: |
|
2734 |
\<open>\<not> bit (- numeral (Num.Bit0 m)) 0\<close> |
|
2735 |
by (simp add: bit_0) |
|
2736 |
||
2737 |
lemma bit_minus_numeral_Bit1_0 [simp]: |
|
2738 |
\<open>bit (- numeral (Num.Bit1 m)) 0\<close> |
|
2739 |
by (simp add: bit_0) |
|
2740 |
||
2741 |
end |
|
2742 |
||
78955 | 2743 |
context linordered_euclidean_semiring_bit_operations |
75138 | 2744 |
begin |
2745 |
||
2746 |
lemma bit_numeral_iff: |
|
2747 |
\<open>bit (numeral m) n \<longleftrightarrow> bit (numeral m :: nat) n\<close> |
|
2748 |
using bit_of_nat_iff_bit [of \<open>numeral m\<close> n] by simp |
|
2749 |
||
74163 | 2750 |
lemma bit_numeral_Bit0_Suc_iff [simp]: |
2751 |
\<open>bit (numeral (Num.Bit0 m)) (Suc n) \<longleftrightarrow> bit (numeral m) n\<close> |
|
2752 |
by (simp add: bit_Suc numeral_Bit0_div_2) |
|
2753 |
||
2754 |
lemma bit_numeral_Bit1_Suc_iff [simp]: |
|
2755 |
\<open>bit (numeral (Num.Bit1 m)) (Suc n) \<longleftrightarrow> bit (numeral m) n\<close> |
|
2756 |
by (simp add: bit_Suc numeral_Bit1_div_2) |
|
2757 |
||
2758 |
lemma bit_numeral_rec: |
|
2759 |
\<open>bit (numeral (Num.Bit0 w)) n \<longleftrightarrow> (case n of 0 \<Rightarrow> False | Suc m \<Rightarrow> bit (numeral w) m)\<close> |
|
2760 |
\<open>bit (numeral (Num.Bit1 w)) n \<longleftrightarrow> (case n of 0 \<Rightarrow> True | Suc m \<Rightarrow> bit (numeral w) m)\<close> |
|
75085 | 2761 |
by (cases n; simp add: bit_0)+ |
74163 | 2762 |
|
2763 |
lemma bit_numeral_simps [simp]: |
|
2764 |
\<open>\<not> bit 1 (numeral n)\<close> |
|
2765 |
\<open>bit (numeral (Num.Bit0 w)) (numeral n) \<longleftrightarrow> bit (numeral w) (pred_numeral n)\<close> |
|
2766 |
\<open>bit (numeral (Num.Bit1 w)) (numeral n) \<longleftrightarrow> bit (numeral w) (pred_numeral n)\<close> |
|
2767 |
by (simp_all add: bit_1_iff numeral_eq_Suc) |
|
2768 |
||
2769 |
lemma and_numerals [simp]: |
|
2770 |
\<open>1 AND numeral (Num.Bit0 y) = 0\<close> |
|
2771 |
\<open>1 AND numeral (Num.Bit1 y) = 1\<close> |
|
2772 |
\<open>numeral (Num.Bit0 x) AND numeral (Num.Bit0 y) = 2 * (numeral x AND numeral y)\<close> |
|
2773 |
\<open>numeral (Num.Bit0 x) AND numeral (Num.Bit1 y) = 2 * (numeral x AND numeral y)\<close> |
|
2774 |
\<open>numeral (Num.Bit0 x) AND 1 = 0\<close> |
|
2775 |
\<open>numeral (Num.Bit1 x) AND numeral (Num.Bit0 y) = 2 * (numeral x AND numeral y)\<close> |
|
2776 |
\<open>numeral (Num.Bit1 x) AND numeral (Num.Bit1 y) = 1 + 2 * (numeral x AND numeral y)\<close> |
|
2777 |
\<open>numeral (Num.Bit1 x) AND 1 = 1\<close> |
|
75085 | 2778 |
by (simp_all add: bit_eq_iff) (simp_all add: bit_0 bit_simps bit_Suc bit_numeral_rec split: nat.splits) |
74163 | 2779 |
|
2780 |
lemma or_numerals [simp]: |
|
2781 |
\<open>1 OR numeral (Num.Bit0 y) = numeral (Num.Bit1 y)\<close> |
|
2782 |
\<open>1 OR numeral (Num.Bit1 y) = numeral (Num.Bit1 y)\<close> |
|
2783 |
\<open>numeral (Num.Bit0 x) OR numeral (Num.Bit0 y) = 2 * (numeral x OR numeral y)\<close> |
|
2784 |
\<open>numeral (Num.Bit0 x) OR numeral (Num.Bit1 y) = 1 + 2 * (numeral x OR numeral y)\<close> |
|
2785 |
\<open>numeral (Num.Bit0 x) OR 1 = numeral (Num.Bit1 x)\<close> |
|
2786 |
\<open>numeral (Num.Bit1 x) OR numeral (Num.Bit0 y) = 1 + 2 * (numeral x OR numeral y)\<close> |
|
2787 |
\<open>numeral (Num.Bit1 x) OR numeral (Num.Bit1 y) = 1 + 2 * (numeral x OR numeral y)\<close> |
|
2788 |
\<open>numeral (Num.Bit1 x) OR 1 = numeral (Num.Bit1 x)\<close> |
|
75085 | 2789 |
by (simp_all add: bit_eq_iff) (simp_all add: bit_0 bit_simps bit_Suc bit_numeral_rec split: nat.splits) |
74163 | 2790 |
|
2791 |
lemma xor_numerals [simp]: |
|
2792 |
\<open>1 XOR numeral (Num.Bit0 y) = numeral (Num.Bit1 y)\<close> |
|
2793 |
\<open>1 XOR numeral (Num.Bit1 y) = numeral (Num.Bit0 y)\<close> |
|
2794 |
\<open>numeral (Num.Bit0 x) XOR numeral (Num.Bit0 y) = 2 * (numeral x XOR numeral y)\<close> |
|
2795 |
\<open>numeral (Num.Bit0 x) XOR numeral (Num.Bit1 y) = 1 + 2 * (numeral x XOR numeral y)\<close> |
|
2796 |
\<open>numeral (Num.Bit0 x) XOR 1 = numeral (Num.Bit1 x)\<close> |
|
2797 |
\<open>numeral (Num.Bit1 x) XOR numeral (Num.Bit0 y) = 1 + 2 * (numeral x XOR numeral y)\<close> |
|
2798 |
\<open>numeral (Num.Bit1 x) XOR numeral (Num.Bit1 y) = 2 * (numeral x XOR numeral y)\<close> |
|
2799 |
\<open>numeral (Num.Bit1 x) XOR 1 = numeral (Num.Bit0 x)\<close> |
|
75085 | 2800 |
by (simp_all add: bit_eq_iff) (simp_all add: bit_0 bit_simps bit_Suc bit_numeral_rec split: nat.splits) |
74163 | 2801 |
|
2802 |
end |
|
2803 |
||
79017 | 2804 |
lemma drop_bit_Suc_minus_bit0 [simp]: |
2805 |
\<open>drop_bit (Suc n) (- numeral (Num.Bit0 k)) = drop_bit n (- numeral k :: int)\<close> |
|
2806 |
by (simp add: drop_bit_Suc numeral_Bit0_div_2) |
|
2807 |
||
2808 |
lemma drop_bit_Suc_minus_bit1 [simp]: |
|
2809 |
\<open>drop_bit (Suc n) (- numeral (Num.Bit1 k)) = drop_bit n (- numeral (Num.inc k) :: int)\<close> |
|
2810 |
by (simp add: drop_bit_Suc numeral_Bit1_div_2 add_One) |
|
2811 |
||
2812 |
lemma drop_bit_numeral_minus_bit0 [simp]: |
|
2813 |
\<open>drop_bit (numeral l) (- numeral (Num.Bit0 k)) = drop_bit (pred_numeral l) (- numeral k :: int)\<close> |
|
2814 |
by (simp add: numeral_eq_Suc numeral_Bit0_div_2) |
|
2815 |
||
2816 |
lemma drop_bit_numeral_minus_bit1 [simp]: |
|
2817 |
\<open>drop_bit (numeral l) (- numeral (Num.Bit1 k)) = drop_bit (pred_numeral l) (- numeral (Num.inc k) :: int)\<close> |
|
2818 |
by (simp add: numeral_eq_Suc numeral_Bit1_div_2) |
|
2819 |
||
2820 |
lemma take_bit_Suc_minus_bit0: |
|
2821 |
\<open>take_bit (Suc n) (- numeral (Num.Bit0 k)) = take_bit n (- numeral k) * (2 :: int)\<close> |
|
2822 |
by (simp add: take_bit_Suc numeral_Bit0_div_2) |
|
2823 |
||
2824 |
lemma take_bit_Suc_minus_bit1: |
|
2825 |
\<open>take_bit (Suc n) (- numeral (Num.Bit1 k)) = take_bit n (- numeral (Num.inc k)) * 2 + (1 :: int)\<close> |
|
2826 |
by (simp add: take_bit_Suc numeral_Bit1_div_2 add_One) |
|
2827 |
||
2828 |
lemma take_bit_numeral_minus_bit0: |
|
2829 |
\<open>take_bit (numeral l) (- numeral (Num.Bit0 k)) = take_bit (pred_numeral l) (- numeral k) * (2 :: int)\<close> |
|
2830 |
by (simp add: numeral_eq_Suc numeral_Bit0_div_2 take_bit_Suc_minus_bit0) |
|
2831 |
||
2832 |
lemma take_bit_numeral_minus_bit1: |
|
2833 |
\<open>take_bit (numeral l) (- numeral (Num.Bit1 k)) = take_bit (pred_numeral l) (- numeral (Num.inc k)) * 2 + (1 :: int)\<close> |
|
2834 |
by (simp add: numeral_eq_Suc numeral_Bit1_div_2 take_bit_Suc_minus_bit1) |
|
2835 |
||
74495 | 2836 |
lemma and_nat_numerals [simp]: |
2837 |
\<open>Suc 0 AND numeral (Num.Bit0 y) = 0\<close> |
|
2838 |
\<open>Suc 0 AND numeral (Num.Bit1 y) = 1\<close> |
|
2839 |
\<open>numeral (Num.Bit0 x) AND Suc 0 = 0\<close> |
|
2840 |
\<open>numeral (Num.Bit1 x) AND Suc 0 = 1\<close> |
|
2841 |
by (simp_all only: and_numerals flip: One_nat_def) |
|
2842 |
||
2843 |
lemma or_nat_numerals [simp]: |
|
2844 |
\<open>Suc 0 OR numeral (Num.Bit0 y) = numeral (Num.Bit1 y)\<close> |
|
2845 |
\<open>Suc 0 OR numeral (Num.Bit1 y) = numeral (Num.Bit1 y)\<close> |
|
2846 |
\<open>numeral (Num.Bit0 x) OR Suc 0 = numeral (Num.Bit1 x)\<close> |
|
2847 |
\<open>numeral (Num.Bit1 x) OR Suc 0 = numeral (Num.Bit1 x)\<close> |
|
2848 |
by (simp_all only: or_numerals flip: One_nat_def) |
|
2849 |
||
2850 |
lemma xor_nat_numerals [simp]: |
|
2851 |
\<open>Suc 0 XOR numeral (Num.Bit0 y) = numeral (Num.Bit1 y)\<close> |
|
2852 |
\<open>Suc 0 XOR numeral (Num.Bit1 y) = numeral (Num.Bit0 y)\<close> |
|
2853 |
\<open>numeral (Num.Bit0 x) XOR Suc 0 = numeral (Num.Bit1 x)\<close> |
|
2854 |
\<open>numeral (Num.Bit1 x) XOR Suc 0 = numeral (Num.Bit0 x)\<close> |
|
2855 |
by (simp_all only: xor_numerals flip: One_nat_def) |
|
2856 |
||
74163 | 2857 |
context ring_bit_operations |
2858 |
begin |
|
2859 |
||
2860 |
lemma minus_numeral_inc_eq: |
|
2861 |
\<open>- numeral (Num.inc n) = NOT (numeral n)\<close> |
|
2862 |
by (simp add: not_eq_complement sub_inc_One_eq add_One) |
|
2863 |
||
2864 |
lemma sub_one_eq_not_neg: |
|
2865 |
\<open>Num.sub n num.One = NOT (- numeral n)\<close> |
|
2866 |
by (simp add: not_eq_complement) |
|
2867 |
||
2868 |
lemma minus_numeral_eq_not_sub_one: |
|
2869 |
\<open>- numeral n = NOT (Num.sub n num.One)\<close> |
|
2870 |
by (simp add: not_eq_complement) |
|
2871 |
||
74495 | 2872 |
lemma not_numeral_eq [simp]: |
74163 | 2873 |
\<open>NOT (numeral n) = - numeral (Num.inc n)\<close> |
2874 |
by (simp add: minus_numeral_inc_eq) |
|
2875 |
||
2876 |
lemma not_minus_numeral_eq [simp]: |
|
2877 |
\<open>NOT (- numeral n) = Num.sub n num.One\<close> |
|
2878 |
by (simp add: sub_one_eq_not_neg) |
|
2879 |
||
2880 |
lemma minus_not_numeral_eq [simp]: |
|
2881 |
\<open>- (NOT (numeral n)) = numeral (Num.inc n)\<close> |
|
74495 | 2882 |
by simp |
2883 |
||
2884 |
lemma not_numeral_BitM_eq: |
|
2885 |
\<open>NOT (numeral (Num.BitM n)) = - numeral (num.Bit0 n)\<close> |
|
79068 | 2886 |
by (simp add: inc_BitM_eq) |
74495 | 2887 |
|
2888 |
lemma not_numeral_Bit0_eq: |
|
2889 |
\<open>NOT (numeral (Num.Bit0 n)) = - numeral (num.Bit1 n)\<close> |
|
2890 |
by simp |
|
74163 | 2891 |
|
2892 |
end |
|
2893 |
||
2894 |
lemma bit_minus_numeral_int [simp]: |
|
2895 |
\<open>bit (- numeral (num.Bit0 w) :: int) (numeral n) \<longleftrightarrow> bit (- numeral w :: int) (pred_numeral n)\<close> |
|
2896 |
\<open>bit (- numeral (num.Bit1 w) :: int) (numeral n) \<longleftrightarrow> \<not> bit (numeral w :: int) (pred_numeral n)\<close> |
|
2897 |
by (simp_all add: bit_minus_iff bit_not_iff numeral_eq_Suc bit_Suc add_One sub_inc_One_eq) |
|
2898 |
||
74592 | 2899 |
lemma bit_minus_numeral_Bit0_Suc_iff [simp]: |
2900 |
\<open>bit (- numeral (num.Bit0 w) :: int) (Suc n) \<longleftrightarrow> bit (- numeral w :: int) n\<close> |
|
2901 |
by (simp add: bit_Suc) |
|
2902 |
||
2903 |
lemma bit_minus_numeral_Bit1_Suc_iff [simp]: |
|
2904 |
\<open>bit (- numeral (num.Bit1 w) :: int) (Suc n) \<longleftrightarrow> \<not> bit (numeral w :: int) n\<close> |
|
2905 |
by (simp add: bit_Suc add_One flip: bit_not_int_iff) |
|
2906 |
||
74495 | 2907 |
lemma and_not_numerals: |
74163 | 2908 |
\<open>1 AND NOT 1 = (0 :: int)\<close> |
2909 |
\<open>1 AND NOT (numeral (Num.Bit0 n)) = (1 :: int)\<close> |
|
2910 |
\<open>1 AND NOT (numeral (Num.Bit1 n)) = (0 :: int)\<close> |
|
2911 |
\<open>numeral (Num.Bit0 m) AND NOT (1 :: int) = numeral (Num.Bit0 m)\<close> |
|
2912 |
\<open>numeral (Num.Bit0 m) AND NOT (numeral (Num.Bit0 n)) = (2 :: int) * (numeral m AND NOT (numeral n))\<close> |
|
2913 |
\<open>numeral (Num.Bit0 m) AND NOT (numeral (Num.Bit1 n)) = (2 :: int) * (numeral m AND NOT (numeral n))\<close> |
|
2914 |
\<open>numeral (Num.Bit1 m) AND NOT (1 :: int) = numeral (Num.Bit0 m)\<close> |
|
2915 |
\<open>numeral (Num.Bit1 m) AND NOT (numeral (Num.Bit0 n)) = 1 + (2 :: int) * (numeral m AND NOT (numeral n))\<close> |
|
2916 |
\<open>numeral (Num.Bit1 m) AND NOT (numeral (Num.Bit1 n)) = (2 :: int) * (numeral m AND NOT (numeral n))\<close> |
|
75085 | 2917 |
by (simp_all add: bit_eq_iff) (auto simp add: bit_0 bit_simps bit_Suc bit_numeral_rec BitM_inc_eq sub_inc_One_eq split: nat.split) |
74163 | 2918 |
|
2919 |
fun and_not_num :: \<open>num \<Rightarrow> num \<Rightarrow> num option\<close> \<^marker>\<open>contributor \<open>Andreas Lochbihler\<close>\<close> |
|
2920 |
where |
|
2921 |
\<open>and_not_num num.One num.One = None\<close> |
|
2922 |
| \<open>and_not_num num.One (num.Bit0 n) = Some num.One\<close> |
|
2923 |
| \<open>and_not_num num.One (num.Bit1 n) = None\<close> |
|
2924 |
| \<open>and_not_num (num.Bit0 m) num.One = Some (num.Bit0 m)\<close> |
|
2925 |
| \<open>and_not_num (num.Bit0 m) (num.Bit0 n) = map_option num.Bit0 (and_not_num m n)\<close> |
|
2926 |
| \<open>and_not_num (num.Bit0 m) (num.Bit1 n) = map_option num.Bit0 (and_not_num m n)\<close> |
|
2927 |
| \<open>and_not_num (num.Bit1 m) num.One = Some (num.Bit0 m)\<close> |
|
2928 |
| \<open>and_not_num (num.Bit1 m) (num.Bit0 n) = (case and_not_num m n of None \<Rightarrow> Some num.One | Some n' \<Rightarrow> Some (num.Bit1 n'))\<close> |
|
2929 |
| \<open>and_not_num (num.Bit1 m) (num.Bit1 n) = map_option num.Bit0 (and_not_num m n)\<close> |
|
2930 |
||
2931 |
lemma int_numeral_and_not_num: |
|
2932 |
\<open>numeral m AND NOT (numeral n) = (case and_not_num m n of None \<Rightarrow> 0 :: int | Some n' \<Rightarrow> numeral n')\<close> |
|
74495 | 2933 |
by (induction m n rule: and_not_num.induct) (simp_all del: not_numeral_eq not_one_eq add: and_not_numerals split: option.splits) |
74163 | 2934 |
|
2935 |
lemma int_numeral_not_and_num: |
|
2936 |
\<open>NOT (numeral m) AND numeral n = (case and_not_num n m of None \<Rightarrow> 0 :: int | Some n' \<Rightarrow> numeral n')\<close> |
|
2937 |
using int_numeral_and_not_num [of n m] by (simp add: ac_simps) |
|
2938 |
||
2939 |
lemma and_not_num_eq_None_iff: |
|
2940 |
\<open>and_not_num m n = None \<longleftrightarrow> numeral m AND NOT (numeral n) = (0 :: int)\<close> |
|
74495 | 2941 |
by (simp del: not_numeral_eq add: int_numeral_and_not_num split: option.split) |
74163 | 2942 |
|
2943 |
lemma and_not_num_eq_Some_iff: |
|
2944 |
\<open>and_not_num m n = Some q \<longleftrightarrow> numeral m AND NOT (numeral n) = (numeral q :: int)\<close> |
|
74495 | 2945 |
by (simp del: not_numeral_eq add: int_numeral_and_not_num split: option.split) |
2946 |
||
2947 |
lemma and_minus_numerals [simp]: |
|
2948 |
\<open>1 AND - (numeral (num.Bit0 n)) = (0::int)\<close> |
|
2949 |
\<open>1 AND - (numeral (num.Bit1 n)) = (1::int)\<close> |
|
2950 |
\<open>numeral m AND - (numeral (num.Bit0 n)) = (case and_not_num m (Num.BitM n) of None \<Rightarrow> 0 :: int | Some n' \<Rightarrow> numeral n')\<close> |
|
2951 |
\<open>numeral m AND - (numeral (num.Bit1 n)) = (case and_not_num m (Num.Bit0 n) of None \<Rightarrow> 0 :: int | Some n' \<Rightarrow> numeral n')\<close> |
|
2952 |
\<open>- (numeral (num.Bit0 n)) AND 1 = (0::int)\<close> |
|
2953 |
\<open>- (numeral (num.Bit1 n)) AND 1 = (1::int)\<close> |
|
2954 |
\<open>- (numeral (num.Bit0 n)) AND numeral m = (case and_not_num m (Num.BitM n) of None \<Rightarrow> 0 :: int | Some n' \<Rightarrow> numeral n')\<close> |
|
2955 |
\<open>- (numeral (num.Bit1 n)) AND numeral m = (case and_not_num m (Num.Bit0 n) of None \<Rightarrow> 0 :: int | Some n' \<Rightarrow> numeral n')\<close> |
|
2956 |
by (simp_all del: not_numeral_eq add: ac_simps |
|
2957 |
and_not_numerals one_and_eq not_numeral_BitM_eq not_numeral_Bit0_eq and_not_num_eq_None_iff and_not_num_eq_Some_iff split: option.split) |
|
2958 |
||
2959 |
lemma and_minus_minus_numerals [simp]: |
|
2960 |
\<open>- (numeral m :: int) AND - (numeral n :: int) = NOT ((numeral m - 1) OR (numeral n - 1))\<close> |
|
2961 |
by (simp add: minus_numeral_eq_not_sub_one) |
|
2962 |
||
2963 |
lemma or_not_numerals: |
|
74163 | 2964 |
\<open>1 OR NOT 1 = NOT (0 :: int)\<close> |
2965 |
\<open>1 OR NOT (numeral (Num.Bit0 n)) = NOT (numeral (Num.Bit0 n) :: int)\<close> |
|
2966 |
\<open>1 OR NOT (numeral (Num.Bit1 n)) = NOT (numeral (Num.Bit0 n) :: int)\<close> |
|
2967 |
\<open>numeral (Num.Bit0 m) OR NOT (1 :: int) = NOT (1 :: int)\<close> |
|
2968 |
\<open>numeral (Num.Bit0 m) OR NOT (numeral (Num.Bit0 n)) = 1 + (2 :: int) * (numeral m OR NOT (numeral n))\<close> |
|
2969 |
\<open>numeral (Num.Bit0 m) OR NOT (numeral (Num.Bit1 n)) = (2 :: int) * (numeral m OR NOT (numeral n))\<close> |
|
2970 |
\<open>numeral (Num.Bit1 m) OR NOT (1 :: int) = NOT (0 :: int)\<close> |
|
2971 |
\<open>numeral (Num.Bit1 m) OR NOT (numeral (Num.Bit0 n)) = 1 + (2 :: int) * (numeral m OR NOT (numeral n))\<close> |
|
2972 |
\<open>numeral (Num.Bit1 m) OR NOT (numeral (Num.Bit1 n)) = 1 + (2 :: int) * (numeral m OR NOT (numeral n))\<close> |
|
74495 | 2973 |
by (simp_all add: bit_eq_iff) |
75085 | 2974 |
(auto simp add: bit_0 bit_simps bit_Suc bit_numeral_rec sub_inc_One_eq split: nat.split) |
74163 | 2975 |
|
2976 |
fun or_not_num_neg :: \<open>num \<Rightarrow> num \<Rightarrow> num\<close> \<^marker>\<open>contributor \<open>Andreas Lochbihler\<close>\<close> |
|
2977 |
where |
|
2978 |
\<open>or_not_num_neg num.One num.One = num.One\<close> |
|
2979 |
| \<open>or_not_num_neg num.One (num.Bit0 m) = num.Bit1 m\<close> |
|
2980 |
| \<open>or_not_num_neg num.One (num.Bit1 m) = num.Bit1 m\<close> |
|
2981 |
| \<open>or_not_num_neg (num.Bit0 n) num.One = num.Bit0 num.One\<close> |
|
2982 |
| \<open>or_not_num_neg (num.Bit0 n) (num.Bit0 m) = Num.BitM (or_not_num_neg n m)\<close> |
|
2983 |
| \<open>or_not_num_neg (num.Bit0 n) (num.Bit1 m) = num.Bit0 (or_not_num_neg n m)\<close> |
|
2984 |
| \<open>or_not_num_neg (num.Bit1 n) num.One = num.One\<close> |
|
2985 |
| \<open>or_not_num_neg (num.Bit1 n) (num.Bit0 m) = Num.BitM (or_not_num_neg n m)\<close> |
|
2986 |
| \<open>or_not_num_neg (num.Bit1 n) (num.Bit1 m) = Num.BitM (or_not_num_neg n m)\<close> |
|
2987 |
||
2988 |
lemma int_numeral_or_not_num_neg: |
|
2989 |
\<open>numeral m OR NOT (numeral n :: int) = - numeral (or_not_num_neg m n)\<close> |
|
74495 | 2990 |
by (induction m n rule: or_not_num_neg.induct) (simp_all del: not_numeral_eq not_one_eq add: or_not_numerals, simp_all) |
74163 | 2991 |
|
2992 |
lemma int_numeral_not_or_num_neg: |
|
2993 |
\<open>NOT (numeral m) OR (numeral n :: int) = - numeral (or_not_num_neg n m)\<close> |
|
2994 |
using int_numeral_or_not_num_neg [of n m] by (simp add: ac_simps) |
|
2995 |
||
2996 |
lemma numeral_or_not_num_eq: |
|
2997 |
\<open>numeral (or_not_num_neg m n) = - (numeral m OR NOT (numeral n :: int))\<close> |
|
2998 |
using int_numeral_or_not_num_neg [of m n] by simp |
|
2999 |
||
74495 | 3000 |
lemma or_minus_numerals [simp]: |
3001 |
\<open>1 OR - (numeral (num.Bit0 n)) = - (numeral (or_not_num_neg num.One (Num.BitM n)) :: int)\<close> |
|
3002 |
\<open>1 OR - (numeral (num.Bit1 n)) = - (numeral (num.Bit1 n) :: int)\<close> |
|
3003 |
\<open>numeral m OR - (numeral (num.Bit0 n)) = - (numeral (or_not_num_neg m (Num.BitM n)) :: int)\<close> |
|
3004 |
\<open>numeral m OR - (numeral (num.Bit1 n)) = - (numeral (or_not_num_neg m (Num.Bit0 n)) :: int)\<close> |
|
3005 |
\<open>- (numeral (num.Bit0 n)) OR 1 = - (numeral (or_not_num_neg num.One (Num.BitM n)) :: int)\<close> |
|
3006 |
\<open>- (numeral (num.Bit1 n)) OR 1 = - (numeral (num.Bit1 n) :: int)\<close> |
|
3007 |
\<open>- (numeral (num.Bit0 n)) OR numeral m = - (numeral (or_not_num_neg m (Num.BitM n)) :: int)\<close> |
|
3008 |
\<open>- (numeral (num.Bit1 n)) OR numeral m = - (numeral (or_not_num_neg m (Num.Bit0 n)) :: int)\<close> |
|
3009 |
by (simp_all only: or.commute [of _ 1] or.commute [of _ \<open>numeral m\<close>] |
|
3010 |
minus_numeral_eq_not_sub_one or_not_numerals |
|
3011 |
numeral_or_not_num_eq arith_simps minus_minus numeral_One) |
|
3012 |
||
3013 |
lemma or_minus_minus_numerals [simp]: |
|
3014 |
\<open>- (numeral m :: int) OR - (numeral n :: int) = NOT ((numeral m - 1) AND (numeral n - 1))\<close> |
|
3015 |
by (simp add: minus_numeral_eq_not_sub_one) |
|
3016 |
||
74163 | 3017 |
lemma xor_minus_numerals [simp]: |
3018 |
\<open>- numeral n XOR k = NOT (neg_numeral_class.sub n num.One XOR k)\<close> |
|
3019 |
\<open>k XOR - numeral n = NOT (k XOR (neg_numeral_class.sub n num.One))\<close> for k :: int |
|
3020 |
by (simp_all add: minus_numeral_eq_not_sub_one) |
|
3021 |
||
74592 | 3022 |
definition take_bit_num :: \<open>nat \<Rightarrow> num \<Rightarrow> num option\<close> |
3023 |
where \<open>take_bit_num n m = |
|
75651
f4116b7a6679
Move code lemmas for symbolic computation of bit operations on int to distribution.
haftmann
parents:
75138
diff
changeset
|
3024 |
(if take_bit n (numeral m :: nat) = 0 then None else Some (num_of_nat (take_bit n (numeral m :: nat))))\<close> |
74592 | 3025 |
|
74618 | 3026 |
lemma take_bit_num_simps: |
74592 | 3027 |
\<open>take_bit_num 0 m = None\<close> |
3028 |
\<open>take_bit_num (Suc n) Num.One = |
|
3029 |
Some Num.One\<close> |
|
3030 |
\<open>take_bit_num (Suc n) (Num.Bit0 m) = |
|
3031 |
(case take_bit_num n m of None \<Rightarrow> None | Some q \<Rightarrow> Some (Num.Bit0 q))\<close> |
|
3032 |
\<open>take_bit_num (Suc n) (Num.Bit1 m) = |
|
3033 |
Some (case take_bit_num n m of None \<Rightarrow> Num.One | Some q \<Rightarrow> Num.Bit1 q)\<close> |
|
74618 | 3034 |
\<open>take_bit_num (numeral r) Num.One = |
74592 | 3035 |
Some Num.One\<close> |
74618 | 3036 |
\<open>take_bit_num (numeral r) (Num.Bit0 m) = |
3037 |
(case take_bit_num (pred_numeral r) m of None \<Rightarrow> None | Some q \<Rightarrow> Some (Num.Bit0 q))\<close> |
|
3038 |
\<open>take_bit_num (numeral r) (Num.Bit1 m) = |
|
3039 |
Some (case take_bit_num (pred_numeral r) m of None \<Rightarrow> Num.One | Some q \<Rightarrow> Num.Bit1 q)\<close> |
|
74592 | 3040 |
by (auto simp add: take_bit_num_def ac_simps mult_2 num_of_nat_double |
74618 | 3041 |
take_bit_Suc_bit0 take_bit_Suc_bit1 take_bit_numeral_bit0 take_bit_numeral_bit1) |
3042 |
||
3043 |
lemma take_bit_num_code [code]: |
|
3044 |
\<comment> \<open>Ocaml-style pattern matching is more robust wrt. different representations of \<^typ>\<open>nat\<close>\<close> |
|
3045 |
\<open>take_bit_num n m = (case (n, m) |
|
3046 |
of (0, _) \<Rightarrow> None |
|
3047 |
| (Suc n, Num.One) \<Rightarrow> Some Num.One |
|
3048 |
| (Suc n, Num.Bit0 m) \<Rightarrow> (case take_bit_num n m of None \<Rightarrow> None | Some q \<Rightarrow> Some (Num.Bit0 q)) |
|
3049 |
| (Suc n, Num.Bit1 m) \<Rightarrow> Some (case take_bit_num n m of None \<Rightarrow> Num.One | Some q \<Rightarrow> Num.Bit1 q))\<close> |
|
3050 |
by (cases n; cases m) (simp_all add: take_bit_num_simps) |
|
74592 | 3051 |
|
3052 |
context semiring_bit_operations |
|
3053 |
begin |
|
3054 |
||
3055 |
lemma take_bit_num_eq_None_imp: |
|
3056 |
\<open>take_bit m (numeral n) = 0\<close> if \<open>take_bit_num m n = None\<close> |
|
3057 |
proof - |
|
3058 |
from that have \<open>take_bit m (numeral n :: nat) = 0\<close> |
|
3059 |
by (simp add: take_bit_num_def split: if_splits) |
|
3060 |
then have \<open>of_nat (take_bit m (numeral n)) = of_nat 0\<close> |
|
3061 |
by simp |
|
3062 |
then show ?thesis |
|
3063 |
by (simp add: of_nat_take_bit) |
|
3064 |
qed |
|
79068 | 3065 |
|
74592 | 3066 |
lemma take_bit_num_eq_Some_imp: |
3067 |
\<open>take_bit m (numeral n) = numeral q\<close> if \<open>take_bit_num m n = Some q\<close> |
|
3068 |
proof - |
|
3069 |
from that have \<open>take_bit m (numeral n :: nat) = numeral q\<close> |
|
3070 |
by (auto simp add: take_bit_num_def Num.numeral_num_of_nat_unfold split: if_splits) |
|
3071 |
then have \<open>of_nat (take_bit m (numeral n)) = of_nat (numeral q)\<close> |
|
3072 |
by simp |
|
3073 |
then show ?thesis |
|
3074 |
by (simp add: of_nat_take_bit) |
|
3075 |
qed |
|
3076 |
||
3077 |
lemma take_bit_numeral_numeral: |
|
3078 |
\<open>take_bit (numeral m) (numeral n) = |
|
3079 |
(case take_bit_num (numeral m) n of None \<Rightarrow> 0 | Some q \<Rightarrow> numeral q)\<close> |
|
3080 |
by (auto split: option.split dest: take_bit_num_eq_None_imp take_bit_num_eq_Some_imp) |
|
3081 |
||
3082 |
end |
|
3083 |
||
3084 |
lemma take_bit_numeral_minus_numeral_int: |
|
3085 |
\<open>take_bit (numeral m) (- numeral n :: int) = |
|
3086 |
(case take_bit_num (numeral m) n of None \<Rightarrow> 0 | Some q \<Rightarrow> take_bit (numeral m) (2 ^ numeral m - numeral q))\<close> (is \<open>?lhs = ?rhs\<close>) |
|
3087 |
proof (cases \<open>take_bit_num (numeral m) n\<close>) |
|
3088 |
case None |
|
3089 |
then show ?thesis |
|
3090 |
by (auto dest: take_bit_num_eq_None_imp [where ?'a = int] simp add: take_bit_eq_0_iff) |
|
3091 |
next |
|
3092 |
case (Some q) |
|
3093 |
then have q: \<open>take_bit (numeral m) (numeral n :: int) = numeral q\<close> |
|
3094 |
by (auto dest: take_bit_num_eq_Some_imp) |
|
3095 |
let ?T = \<open>take_bit (numeral m) :: int \<Rightarrow> int\<close> |
|
3096 |
have *: \<open>?T (2 ^ numeral m) = ?T (?T 0)\<close> |
|
3097 |
by (simp add: take_bit_eq_0_iff) |
|
3098 |
have \<open>?lhs = ?T (0 - numeral n)\<close> |
|
3099 |
by simp |
|
3100 |
also have \<open>\<dots> = ?T (?T (?T 0) - ?T (?T (numeral n)))\<close> |
|
3101 |
by (simp only: take_bit_diff) |
|
3102 |
also have \<open>\<dots> = ?T (2 ^ numeral m - ?T (numeral n))\<close> |
|
3103 |
by (simp only: take_bit_diff flip: *) |
|
3104 |
also have \<open>\<dots> = ?rhs\<close> |
|
3105 |
by (simp add: q Some) |
|
3106 |
finally show ?thesis . |
|
3107 |
qed |
|
3108 |
||
74618 | 3109 |
declare take_bit_num_simps [simp] |
3110 |
take_bit_numeral_numeral [simp] |
|
74592 | 3111 |
take_bit_numeral_minus_numeral_int [simp] |
3112 |
||
74163 | 3113 |
|
79069 | 3114 |
subsection \<open>Symbolic computations for code generation\<close> |
3115 |
||
3116 |
lemma bit_int_code [code]: |
|
3117 |
\<open>bit (0::int) n \<longleftrightarrow> False\<close> |
|
3118 |
\<open>bit (Int.Neg num.One) n \<longleftrightarrow> True\<close> |
|
3119 |
\<open>bit (Int.Pos num.One) 0 \<longleftrightarrow> True\<close> |
|
3120 |
\<open>bit (Int.Pos (num.Bit0 m)) 0 \<longleftrightarrow> False\<close> |
|
3121 |
\<open>bit (Int.Pos (num.Bit1 m)) 0 \<longleftrightarrow> True\<close> |
|
3122 |
\<open>bit (Int.Neg (num.Bit0 m)) 0 \<longleftrightarrow> False\<close> |
|
3123 |
\<open>bit (Int.Neg (num.Bit1 m)) 0 \<longleftrightarrow> True\<close> |
|
3124 |
\<open>bit (Int.Pos num.One) (Suc n) \<longleftrightarrow> False\<close> |
|
3125 |
\<open>bit (Int.Pos (num.Bit0 m)) (Suc n) \<longleftrightarrow> bit (Int.Pos m) n\<close> |
|
3126 |
\<open>bit (Int.Pos (num.Bit1 m)) (Suc n) \<longleftrightarrow> bit (Int.Pos m) n\<close> |
|
3127 |
\<open>bit (Int.Neg (num.Bit0 m)) (Suc n) \<longleftrightarrow> bit (Int.Neg m) n\<close> |
|
3128 |
\<open>bit (Int.Neg (num.Bit1 m)) (Suc n) \<longleftrightarrow> bit (Int.Neg (Num.inc m)) n\<close> |
|
3129 |
by (simp_all add: Num.add_One bit_0 bit_Suc) |
|
3130 |
||
3131 |
lemma not_int_code [code]: |
|
3132 |
\<open>NOT (0 :: int) = - 1\<close> |
|
3133 |
\<open>NOT (Int.Pos n) = Int.Neg (Num.inc n)\<close> |
|
3134 |
\<open>NOT (Int.Neg n) = Num.sub n num.One\<close> |
|
3135 |
by (simp_all add: Num.add_One not_int_def) |
|
3136 |
||
3137 |
fun and_num :: \<open>num \<Rightarrow> num \<Rightarrow> num option\<close> \<^marker>\<open>contributor \<open>Andreas Lochbihler\<close>\<close> |
|
3138 |
where |
|
3139 |
\<open>and_num num.One num.One = Some num.One\<close> |
|
3140 |
| \<open>and_num num.One (num.Bit0 n) = None\<close> |
|
3141 |
| \<open>and_num num.One (num.Bit1 n) = Some num.One\<close> |
|
3142 |
| \<open>and_num (num.Bit0 m) num.One = None\<close> |
|
3143 |
| \<open>and_num (num.Bit0 m) (num.Bit0 n) = map_option num.Bit0 (and_num m n)\<close> |
|
3144 |
| \<open>and_num (num.Bit0 m) (num.Bit1 n) = map_option num.Bit0 (and_num m n)\<close> |
|
3145 |
| \<open>and_num (num.Bit1 m) num.One = Some num.One\<close> |
|
3146 |
| \<open>and_num (num.Bit1 m) (num.Bit0 n) = map_option num.Bit0 (and_num m n)\<close> |
|
3147 |
| \<open>and_num (num.Bit1 m) (num.Bit1 n) = (case and_num m n of None \<Rightarrow> Some num.One | Some n' \<Rightarrow> Some (num.Bit1 n'))\<close> |
|
3148 |
||
3149 |
context linordered_euclidean_semiring_bit_operations |
|
3150 |
begin |
|
3151 |
||
3152 |
lemma numeral_and_num: |
|
3153 |
\<open>numeral m AND numeral n = (case and_num m n of None \<Rightarrow> 0 | Some n' \<Rightarrow> numeral n')\<close> |
|
3154 |
by (induction m n rule: and_num.induct) (simp_all add: split: option.split) |
|
3155 |
||
3156 |
lemma and_num_eq_None_iff: |
|
3157 |
\<open>and_num m n = None \<longleftrightarrow> numeral m AND numeral n = 0\<close> |
|
3158 |
by (simp add: numeral_and_num split: option.split) |
|
3159 |
||
3160 |
lemma and_num_eq_Some_iff: |
|
3161 |
\<open>and_num m n = Some q \<longleftrightarrow> numeral m AND numeral n = numeral q\<close> |
|
3162 |
by (simp add: numeral_and_num split: option.split) |
|
3163 |
||
3164 |
end |
|
3165 |
||
3166 |
lemma and_int_code [code]: |
|
3167 |
fixes i j :: int shows |
|
3168 |
\<open>0 AND j = 0\<close> |
|
3169 |
\<open>i AND 0 = 0\<close> |
|
3170 |
\<open>Int.Pos n AND Int.Pos m = (case and_num n m of None \<Rightarrow> 0 | Some n' \<Rightarrow> Int.Pos n')\<close> |
|
3171 |
\<open>Int.Neg n AND Int.Neg m = NOT (Num.sub n num.One OR Num.sub m num.One)\<close> |
|
3172 |
\<open>Int.Pos n AND Int.Neg num.One = Int.Pos n\<close> |
|
3173 |
\<open>Int.Pos n AND Int.Neg (num.Bit0 m) = Num.sub (or_not_num_neg (Num.BitM m) n) num.One\<close> |
|
3174 |
\<open>Int.Pos n AND Int.Neg (num.Bit1 m) = Num.sub (or_not_num_neg (num.Bit0 m) n) num.One\<close> |
|
3175 |
\<open>Int.Neg num.One AND Int.Pos m = Int.Pos m\<close> |
|
3176 |
\<open>Int.Neg (num.Bit0 n) AND Int.Pos m = Num.sub (or_not_num_neg (Num.BitM n) m) num.One\<close> |
|
3177 |
\<open>Int.Neg (num.Bit1 n) AND Int.Pos m = Num.sub (or_not_num_neg (num.Bit0 n) m) num.One\<close> |
|
3178 |
apply (auto simp add: and_num_eq_None_iff [where ?'a = int] and_num_eq_Some_iff [where ?'a = int] |
|
3179 |
split: option.split) |
|
3180 |
apply (simp_all only: sub_one_eq_not_neg numeral_or_not_num_eq minus_minus and_not_numerals |
|
3181 |
bit.de_Morgan_disj bit.double_compl and_not_num_eq_None_iff and_not_num_eq_Some_iff ac_simps) |
|
3182 |
done |
|
3183 |
||
3184 |
context linordered_euclidean_semiring_bit_operations |
|
3185 |
begin |
|
3186 |
||
3187 |
fun or_num :: \<open>num \<Rightarrow> num \<Rightarrow> num\<close> \<^marker>\<open>contributor \<open>Andreas Lochbihler\<close>\<close> |
|
3188 |
where |
|
3189 |
\<open>or_num num.One num.One = num.One\<close> |
|
3190 |
| \<open>or_num num.One (num.Bit0 n) = num.Bit1 n\<close> |
|
3191 |
| \<open>or_num num.One (num.Bit1 n) = num.Bit1 n\<close> |
|
3192 |
| \<open>or_num (num.Bit0 m) num.One = num.Bit1 m\<close> |
|
3193 |
| \<open>or_num (num.Bit0 m) (num.Bit0 n) = num.Bit0 (or_num m n)\<close> |
|
3194 |
| \<open>or_num (num.Bit0 m) (num.Bit1 n) = num.Bit1 (or_num m n)\<close> |
|
3195 |
| \<open>or_num (num.Bit1 m) num.One = num.Bit1 m\<close> |
|
3196 |
| \<open>or_num (num.Bit1 m) (num.Bit0 n) = num.Bit1 (or_num m n)\<close> |
|
3197 |
| \<open>or_num (num.Bit1 m) (num.Bit1 n) = num.Bit1 (or_num m n)\<close> |
|
3198 |
||
3199 |
lemma numeral_or_num: |
|
3200 |
\<open>numeral m OR numeral n = numeral (or_num m n)\<close> |
|
3201 |
by (induction m n rule: or_num.induct) simp_all |
|
3202 |
||
3203 |
lemma numeral_or_num_eq: |
|
3204 |
\<open>numeral (or_num m n) = numeral m OR numeral n\<close> |
|
3205 |
by (simp add: numeral_or_num) |
|
3206 |
||
3207 |
end |
|
3208 |
||
3209 |
lemma or_int_code [code]: |
|
3210 |
fixes i j :: int shows |
|
3211 |
\<open>0 OR j = j\<close> |
|
3212 |
\<open>i OR 0 = i\<close> |
|
3213 |
\<open>Int.Pos n OR Int.Pos m = Int.Pos (or_num n m)\<close> |
|
3214 |
\<open>Int.Neg n OR Int.Neg m = NOT (Num.sub n num.One AND Num.sub m num.One)\<close> |
|
3215 |
\<open>Int.Pos n OR Int.Neg num.One = Int.Neg num.One\<close> |
|
3216 |
\<open>Int.Pos n OR Int.Neg (num.Bit0 m) = (case and_not_num (Num.BitM m) n of None \<Rightarrow> -1 | Some n' \<Rightarrow> Int.Neg (Num.inc n'))\<close> |
|
3217 |
\<open>Int.Pos n OR Int.Neg (num.Bit1 m) = (case and_not_num (num.Bit0 m) n of None \<Rightarrow> -1 | Some n' \<Rightarrow> Int.Neg (Num.inc n'))\<close> |
|
3218 |
\<open>Int.Neg num.One OR Int.Pos m = Int.Neg num.One\<close> |
|
3219 |
\<open>Int.Neg (num.Bit0 n) OR Int.Pos m = (case and_not_num (Num.BitM n) m of None \<Rightarrow> -1 | Some n' \<Rightarrow> Int.Neg (Num.inc n'))\<close> |
|
3220 |
\<open>Int.Neg (num.Bit1 n) OR Int.Pos m = (case and_not_num (num.Bit0 n) m of None \<Rightarrow> -1 | Some n' \<Rightarrow> Int.Neg (Num.inc n'))\<close> |
|
3221 |
apply (auto simp add: numeral_or_num_eq split: option.splits) |
|
3222 |
apply (simp_all only: and_not_num_eq_None_iff and_not_num_eq_Some_iff and_not_numerals |
|
3223 |
numeral_or_not_num_eq or_eq_not_not_and bit.double_compl ac_simps flip: numeral_eq_iff [where ?'a = int]) |
|
3224 |
apply simp_all |
|
3225 |
done |
|
3226 |
||
3227 |
fun xor_num :: \<open>num \<Rightarrow> num \<Rightarrow> num option\<close> \<^marker>\<open>contributor \<open>Andreas Lochbihler\<close>\<close> |
|
3228 |
where |
|
3229 |
\<open>xor_num num.One num.One = None\<close> |
|
3230 |
| \<open>xor_num num.One (num.Bit0 n) = Some (num.Bit1 n)\<close> |
|
3231 |
| \<open>xor_num num.One (num.Bit1 n) = Some (num.Bit0 n)\<close> |
|
3232 |
| \<open>xor_num (num.Bit0 m) num.One = Some (num.Bit1 m)\<close> |
|
3233 |
| \<open>xor_num (num.Bit0 m) (num.Bit0 n) = map_option num.Bit0 (xor_num m n)\<close> |
|
3234 |
| \<open>xor_num (num.Bit0 m) (num.Bit1 n) = Some (case xor_num m n of None \<Rightarrow> num.One | Some n' \<Rightarrow> num.Bit1 n')\<close> |
|
3235 |
| \<open>xor_num (num.Bit1 m) num.One = Some (num.Bit0 m)\<close> |
|
3236 |
| \<open>xor_num (num.Bit1 m) (num.Bit0 n) = Some (case xor_num m n of None \<Rightarrow> num.One | Some n' \<Rightarrow> num.Bit1 n')\<close> |
|
3237 |
| \<open>xor_num (num.Bit1 m) (num.Bit1 n) = map_option num.Bit0 (xor_num m n)\<close> |
|
3238 |
||
3239 |
context linordered_euclidean_semiring_bit_operations |
|
3240 |
begin |
|
3241 |
||
3242 |
lemma numeral_xor_num: |
|
3243 |
\<open>numeral m XOR numeral n = (case xor_num m n of None \<Rightarrow> 0 | Some n' \<Rightarrow> numeral n')\<close> |
|
3244 |
by (induction m n rule: xor_num.induct) (simp_all split: option.split) |
|
3245 |
||
3246 |
lemma xor_num_eq_None_iff: |
|
3247 |
\<open>xor_num m n = None \<longleftrightarrow> numeral m XOR numeral n = 0\<close> |
|
3248 |
by (simp add: numeral_xor_num split: option.split) |
|
3249 |
||
3250 |
lemma xor_num_eq_Some_iff: |
|
3251 |
\<open>xor_num m n = Some q \<longleftrightarrow> numeral m XOR numeral n = numeral q\<close> |
|
3252 |
by (simp add: numeral_xor_num split: option.split) |
|
3253 |
||
3254 |
end |
|
3255 |
||
3256 |
lemma xor_int_code [code]: |
|
3257 |
fixes i j :: int shows |
|
3258 |
\<open>0 XOR j = j\<close> |
|
3259 |
\<open>i XOR 0 = i\<close> |
|
3260 |
\<open>Int.Pos n XOR Int.Pos m = (case xor_num n m of None \<Rightarrow> 0 | Some n' \<Rightarrow> Int.Pos n')\<close> |
|
3261 |
\<open>Int.Neg n XOR Int.Neg m = Num.sub n num.One XOR Num.sub m num.One\<close> |
|
3262 |
\<open>Int.Neg n XOR Int.Pos m = NOT (Num.sub n num.One XOR Int.Pos m)\<close> |
|
3263 |
\<open>Int.Pos n XOR Int.Neg m = NOT (Int.Pos n XOR Num.sub m num.One)\<close> |
|
3264 |
by (simp_all add: xor_num_eq_None_iff [where ?'a = int] xor_num_eq_Some_iff [where ?'a = int] split: option.split) |
|
3265 |
||
3266 |
lemma push_bit_int_code [code]: |
|
3267 |
\<open>push_bit 0 i = i\<close> |
|
3268 |
\<open>push_bit (Suc n) i = push_bit n (Int.dup i)\<close> |
|
3269 |
by (simp_all add: ac_simps) |
|
3270 |
||
3271 |
lemma drop_bit_int_code [code]: |
|
3272 |
fixes i :: int shows |
|
3273 |
\<open>drop_bit 0 i = i\<close> |
|
3274 |
\<open>drop_bit (Suc n) 0 = (0 :: int)\<close> |
|
3275 |
\<open>drop_bit (Suc n) (Int.Pos num.One) = 0\<close> |
|
3276 |
\<open>drop_bit (Suc n) (Int.Pos (num.Bit0 m)) = drop_bit n (Int.Pos m)\<close> |
|
3277 |
\<open>drop_bit (Suc n) (Int.Pos (num.Bit1 m)) = drop_bit n (Int.Pos m)\<close> |
|
3278 |
\<open>drop_bit (Suc n) (Int.Neg num.One) = - 1\<close> |
|
3279 |
\<open>drop_bit (Suc n) (Int.Neg (num.Bit0 m)) = drop_bit n (Int.Neg m)\<close> |
|
3280 |
\<open>drop_bit (Suc n) (Int.Neg (num.Bit1 m)) = drop_bit n (Int.Neg (Num.inc m))\<close> |
|
3281 |
by (simp_all add: drop_bit_Suc add_One) |
|
3282 |
||
3283 |
||
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
3284 |
subsection \<open>More properties\<close> |
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
3285 |
|
72830 | 3286 |
lemma take_bit_eq_mask_iff: |
3287 |
\<open>take_bit n k = mask n \<longleftrightarrow> take_bit n (k + 1) = 0\<close> (is \<open>?P \<longleftrightarrow> ?Q\<close>) |
|
3288 |
for k :: int |
|
3289 |
proof |
|
3290 |
assume ?P |
|
3291 |
then have \<open>take_bit n (take_bit n k + take_bit n 1) = 0\<close> |
|
74108
3146646a43a7
simplified hierarchy of type classes for bit operations
haftmann
parents:
74101
diff
changeset
|
3292 |
by (simp add: mask_eq_exp_minus_1 take_bit_eq_0_iff) |
72830 | 3293 |
then show ?Q |
3294 |
by (simp only: take_bit_add) |
|
3295 |
next |
|
3296 |
assume ?Q |
|
3297 |
then have \<open>take_bit n (k + 1) - 1 = - 1\<close> |
|
3298 |
by simp |
|
3299 |
then have \<open>take_bit n (take_bit n (k + 1) - 1) = take_bit n (- 1)\<close> |
|
3300 |
by simp |
|
3301 |
moreover have \<open>take_bit n (take_bit n (k + 1) - 1) = take_bit n k\<close> |
|
3302 |
by (simp add: take_bit_eq_mod mod_simps) |
|
3303 |
ultimately show ?P |
|
74592 | 3304 |
by simp |
72830 | 3305 |
qed |
3306 |
||
3307 |
lemma take_bit_eq_mask_iff_exp_dvd: |
|
3308 |
\<open>take_bit n k = mask n \<longleftrightarrow> 2 ^ n dvd k + 1\<close> |
|
3309 |
for k :: int |
|
3310 |
by (simp add: take_bit_eq_mask_iff flip: take_bit_eq_0_iff) |
|
3311 |
||
71442 | 3312 |
|
72028 | 3313 |
subsection \<open>Bit concatenation\<close> |
3314 |
||
3315 |
definition concat_bit :: \<open>nat \<Rightarrow> int \<Rightarrow> int \<Rightarrow> int\<close> |
|
72227 | 3316 |
where \<open>concat_bit n k l = take_bit n k OR push_bit n l\<close> |
72028 | 3317 |
|
72611
c7bc3e70a8c7
official collection for bit projection simplifications
haftmann
parents:
72512
diff
changeset
|
3318 |
lemma bit_concat_bit_iff [bit_simps]: |
72028 | 3319 |
\<open>bit (concat_bit m k l) n \<longleftrightarrow> n < m \<and> bit k n \<or> m \<le> n \<and> bit l (n - m)\<close> |
72227 | 3320 |
by (simp add: concat_bit_def bit_or_iff bit_and_iff bit_take_bit_iff bit_push_bit_iff ac_simps) |
72028 | 3321 |
|
3322 |
lemma concat_bit_eq: |
|
3323 |
\<open>concat_bit n k l = take_bit n k + push_bit n l\<close> |
|
3324 |
by (simp add: concat_bit_def take_bit_eq_mask |
|
3325 |
bit_and_iff bit_mask_iff bit_push_bit_iff disjunctive_add) |
|
3326 |
||
3327 |
lemma concat_bit_0 [simp]: |
|
3328 |
\<open>concat_bit 0 k l = l\<close> |
|
3329 |
by (simp add: concat_bit_def) |
|
3330 |
||
3331 |
lemma concat_bit_Suc: |
|
3332 |
\<open>concat_bit (Suc n) k l = k mod 2 + 2 * concat_bit n (k div 2) l\<close> |
|
3333 |
by (simp add: concat_bit_eq take_bit_Suc push_bit_double) |
|
3334 |
||
3335 |
lemma concat_bit_of_zero_1 [simp]: |
|
3336 |
\<open>concat_bit n 0 l = push_bit n l\<close> |
|
3337 |
by (simp add: concat_bit_def) |
|
3338 |
||
3339 |
lemma concat_bit_of_zero_2 [simp]: |
|
3340 |
\<open>concat_bit n k 0 = take_bit n k\<close> |
|
3341 |
by (simp add: concat_bit_def take_bit_eq_mask) |
|
3342 |
||
3343 |
lemma concat_bit_nonnegative_iff [simp]: |
|
3344 |
\<open>concat_bit n k l \<ge> 0 \<longleftrightarrow> l \<ge> 0\<close> |
|
3345 |
by (simp add: concat_bit_def) |
|
3346 |
||
3347 |
lemma concat_bit_negative_iff [simp]: |
|
3348 |
\<open>concat_bit n k l < 0 \<longleftrightarrow> l < 0\<close> |
|
3349 |
by (simp add: concat_bit_def) |
|
3350 |
||
3351 |
lemma concat_bit_assoc: |
|
3352 |
\<open>concat_bit n k (concat_bit m l r) = concat_bit (m + n) (concat_bit n k l) r\<close> |
|
3353 |
by (rule bit_eqI) (auto simp add: bit_concat_bit_iff ac_simps) |
|
3354 |
||
3355 |
lemma concat_bit_assoc_sym: |
|
3356 |
\<open>concat_bit m (concat_bit n k l) r = concat_bit (min m n) k (concat_bit (m - n) l r)\<close> |
|
3357 |
by (rule bit_eqI) (auto simp add: bit_concat_bit_iff ac_simps min_def) |
|
3358 |
||
72227 | 3359 |
lemma concat_bit_eq_iff: |
3360 |
\<open>concat_bit n k l = concat_bit n r s |
|
3361 |
\<longleftrightarrow> take_bit n k = take_bit n r \<and> l = s\<close> (is \<open>?P \<longleftrightarrow> ?Q\<close>) |
|
3362 |
proof |
|
3363 |
assume ?Q |
|
3364 |
then show ?P |
|
3365 |
by (simp add: concat_bit_def) |
|
3366 |
next |
|
3367 |
assume ?P |
|
3368 |
then have *: \<open>bit (concat_bit n k l) m = bit (concat_bit n r s) m\<close> for m |
|
3369 |
by (simp add: bit_eq_iff) |
|
3370 |
have \<open>take_bit n k = take_bit n r\<close> |
|
3371 |
proof (rule bit_eqI) |
|
3372 |
fix m |
|
3373 |
from * [of m] |
|
3374 |
show \<open>bit (take_bit n k) m \<longleftrightarrow> bit (take_bit n r) m\<close> |
|
3375 |
by (auto simp add: bit_take_bit_iff bit_concat_bit_iff) |
|
3376 |
qed |
|
3377 |
moreover have \<open>push_bit n l = push_bit n s\<close> |
|
3378 |
proof (rule bit_eqI) |
|
3379 |
fix m |
|
3380 |
from * [of m] |
|
3381 |
show \<open>bit (push_bit n l) m \<longleftrightarrow> bit (push_bit n s) m\<close> |
|
3382 |
by (auto simp add: bit_push_bit_iff bit_concat_bit_iff) |
|
3383 |
qed |
|
3384 |
then have \<open>l = s\<close> |
|
3385 |
by (simp add: push_bit_eq_mult) |
|
3386 |
ultimately show ?Q |
|
3387 |
by (simp add: concat_bit_def) |
|
3388 |
qed |
|
3389 |
||
3390 |
lemma take_bit_concat_bit_eq: |
|
3391 |
\<open>take_bit m (concat_bit n k l) = concat_bit (min m n) k (take_bit (m - n) l)\<close> |
|
3392 |
by (rule bit_eqI) |
|
79068 | 3393 |
(auto simp add: bit_take_bit_iff bit_concat_bit_iff min_def) |
72227 | 3394 |
|
72488 | 3395 |
lemma concat_bit_take_bit_eq: |
3396 |
\<open>concat_bit n (take_bit n b) = concat_bit n b\<close> |
|
3397 |
by (simp add: concat_bit_def [abs_def]) |
|
3398 |
||
72028 | 3399 |
|
72241 | 3400 |
subsection \<open>Taking bits with sign propagation\<close> |
72010 | 3401 |
|
72241 | 3402 |
context ring_bit_operations |
3403 |
begin |
|
72010 | 3404 |
|
72241 | 3405 |
definition signed_take_bit :: \<open>nat \<Rightarrow> 'a \<Rightarrow> 'a\<close> |
3406 |
where \<open>signed_take_bit n a = take_bit n a OR (of_bool (bit a n) * NOT (mask n))\<close> |
|
72227 | 3407 |
|
72241 | 3408 |
lemma signed_take_bit_eq_if_positive: |
3409 |
\<open>signed_take_bit n a = take_bit n a\<close> if \<open>\<not> bit a n\<close> |
|
72010 | 3410 |
using that by (simp add: signed_take_bit_def) |
3411 |
||
72241 | 3412 |
lemma signed_take_bit_eq_if_negative: |
3413 |
\<open>signed_take_bit n a = take_bit n a OR NOT (mask n)\<close> if \<open>bit a n\<close> |
|
3414 |
using that by (simp add: signed_take_bit_def) |
|
3415 |
||
3416 |
lemma even_signed_take_bit_iff: |
|
3417 |
\<open>even (signed_take_bit m a) \<longleftrightarrow> even a\<close> |
|
75085 | 3418 |
by (auto simp add: bit_0 signed_take_bit_def even_or_iff even_mask_iff bit_double_iff) |
72241 | 3419 |
|
72611
c7bc3e70a8c7
official collection for bit projection simplifications
haftmann
parents:
72512
diff
changeset
|
3420 |
lemma bit_signed_take_bit_iff [bit_simps]: |
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
3421 |
\<open>bit (signed_take_bit m a) n \<longleftrightarrow> possible_bit TYPE('a) n \<and> bit a (min m n)\<close> |
72241 | 3422 |
by (simp add: signed_take_bit_def bit_take_bit_iff bit_or_iff bit_not_iff bit_mask_iff min_def not_le) |
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
3423 |
(blast dest: bit_imp_possible_bit) |
72010 | 3424 |
|
3425 |
lemma signed_take_bit_0 [simp]: |
|
72241 | 3426 |
\<open>signed_take_bit 0 a = - (a mod 2)\<close> |
75085 | 3427 |
by (simp add: bit_0 signed_take_bit_def odd_iff_mod_2_eq_one) |
72010 | 3428 |
|
3429 |
lemma signed_take_bit_Suc: |
|
72241 | 3430 |
\<open>signed_take_bit (Suc n) a = a mod 2 + 2 * signed_take_bit n (a div 2)\<close> |
75085 | 3431 |
by (simp add: bit_eq_iff bit_sum_mult_2_cases bit_simps bit_0 possible_bit_less_imp flip: bit_Suc min_Suc_Suc) |
72010 | 3432 |
|
72187 | 3433 |
lemma signed_take_bit_of_0 [simp]: |
3434 |
\<open>signed_take_bit n 0 = 0\<close> |
|
3435 |
by (simp add: signed_take_bit_def) |
|
3436 |
||
3437 |
lemma signed_take_bit_of_minus_1 [simp]: |
|
3438 |
\<open>signed_take_bit n (- 1) = - 1\<close> |
|
74592 | 3439 |
by (simp add: signed_take_bit_def mask_eq_exp_minus_1 possible_bit_def) |
72187 | 3440 |
|
72241 | 3441 |
lemma signed_take_bit_Suc_1 [simp]: |
3442 |
\<open>signed_take_bit (Suc n) 1 = 1\<close> |
|
3443 |
by (simp add: signed_take_bit_Suc) |
|
3444 |
||
74497 | 3445 |
lemma signed_take_bit_numeral_of_1 [simp]: |
3446 |
\<open>signed_take_bit (numeral k) 1 = 1\<close> |
|
3447 |
by (simp add: bit_1_iff signed_take_bit_eq_if_positive) |
|
3448 |
||
72241 | 3449 |
lemma signed_take_bit_rec: |
3450 |
\<open>signed_take_bit n a = (if n = 0 then - (a mod 2) else a mod 2 + 2 * signed_take_bit (n - 1) (a div 2))\<close> |
|
3451 |
by (cases n) (simp_all add: signed_take_bit_Suc) |
|
72187 | 3452 |
|
3453 |
lemma signed_take_bit_eq_iff_take_bit_eq: |
|
72241 | 3454 |
\<open>signed_take_bit n a = signed_take_bit n b \<longleftrightarrow> take_bit (Suc n) a = take_bit (Suc n) b\<close> |
3455 |
proof - |
|
3456 |
have \<open>bit (signed_take_bit n a) = bit (signed_take_bit n b) \<longleftrightarrow> bit (take_bit (Suc n) a) = bit (take_bit (Suc n) b)\<close> |
|
3457 |
by (simp add: fun_eq_iff bit_signed_take_bit_iff bit_take_bit_iff not_le less_Suc_eq_le min_def) |
|
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
3458 |
(use bit_imp_possible_bit in fastforce) |
72187 | 3459 |
then show ?thesis |
74309
42523fbf643b
explicit predicate for confined bit range avoids cyclic rewriting in presence of extensionality rule for bit values (contributed by Thomas Sewell)
haftmann
parents:
74163
diff
changeset
|
3460 |
by (auto simp add: fun_eq_iff intro: bit_eqI) |
72187 | 3461 |
qed |
3462 |
||
72241 | 3463 |
lemma signed_take_bit_signed_take_bit [simp]: |
3464 |
\<open>signed_take_bit m (signed_take_bit n a) = signed_take_bit (min m n) a\<close> |
|
74495 | 3465 |
by (auto simp add: bit_eq_iff bit_simps ac_simps) |
72241 | 3466 |
|
3467 |
lemma signed_take_bit_take_bit: |
|
3468 |
\<open>signed_take_bit m (take_bit n a) = (if n \<le> m then take_bit n else signed_take_bit m) a\<close> |
|
3469 |
by (rule bit_eqI) (auto simp add: bit_signed_take_bit_iff min_def bit_take_bit_iff) |
|
3470 |
||
72187 | 3471 |
lemma take_bit_signed_take_bit: |
72241 | 3472 |
\<open>take_bit m (signed_take_bit n a) = take_bit m a\<close> if \<open>m \<le> Suc n\<close> |
72187 | 3473 |
using that by (rule le_SucE; intro bit_eqI) |
3474 |
(auto simp add: bit_take_bit_iff bit_signed_take_bit_iff min_def less_Suc_eq) |
|
3475 |
||
72241 | 3476 |
end |
3477 |
||
3478 |
text \<open>Modulus centered around 0\<close> |
|
3479 |
||
3480 |
lemma signed_take_bit_eq_concat_bit: |
|
3481 |
\<open>signed_take_bit n k = concat_bit n k (- of_bool (bit k n))\<close> |
|
74592 | 3482 |
by (simp add: concat_bit_def signed_take_bit_def) |
72241 | 3483 |
|
72187 | 3484 |
lemma signed_take_bit_add: |
3485 |
\<open>signed_take_bit n (signed_take_bit n k + signed_take_bit n l) = signed_take_bit n (k + l)\<close> |
|
72241 | 3486 |
for k l :: int |
72187 | 3487 |
proof - |
3488 |
have \<open>take_bit (Suc n) |
|
3489 |
(take_bit (Suc n) (signed_take_bit n k) + |
|
3490 |
take_bit (Suc n) (signed_take_bit n l)) = |
|
3491 |
take_bit (Suc n) (k + l)\<close> |
|
3492 |
by (simp add: take_bit_signed_take_bit take_bit_add) |
|
3493 |
then show ?thesis |
|
3494 |
by (simp only: signed_take_bit_eq_iff_take_bit_eq take_bit_add) |
|
3495 |
qed |
|
3496 |
||
3497 |
lemma signed_take_bit_diff: |
|
3498 |
\<open>signed_take_bit n (signed_take_bit n k - signed_take_bit n l) = signed_take_bit n (k - l)\<close> |
|
72241 | 3499 |
for k l :: int |
72187 | 3500 |
proof - |
3501 |
have \<open>take_bit (Suc n) |
|
3502 |
(take_bit (Suc n) (signed_take_bit n k) - |
|
3503 |
take_bit (Suc n) (signed_take_bit n l)) = |
|
3504 |
take_bit (Suc n) (k - l)\<close> |
|
3505 |
by (simp add: take_bit_signed_take_bit take_bit_diff) |
|
3506 |
then show ?thesis |
|
3507 |
by (simp only: signed_take_bit_eq_iff_take_bit_eq take_bit_diff) |
|
3508 |
qed |
|
3509 |
||
3510 |
lemma signed_take_bit_minus: |
|
3511 |
\<open>signed_take_bit n (- signed_take_bit n k) = signed_take_bit n (- k)\<close> |
|
72241 | 3512 |
for k :: int |
72187 | 3513 |
proof - |
3514 |
have \<open>take_bit (Suc n) |
|
3515 |
(- take_bit (Suc n) (signed_take_bit n k)) = |
|
3516 |
take_bit (Suc n) (- k)\<close> |
|
3517 |
by (simp add: take_bit_signed_take_bit take_bit_minus) |
|
3518 |
then show ?thesis |
|
3519 |
by (simp only: signed_take_bit_eq_iff_take_bit_eq take_bit_minus) |
|
3520 |
qed |
|
3521 |
||
3522 |
lemma signed_take_bit_mult: |
|
3523 |
\<open>signed_take_bit n (signed_take_bit n k * signed_take_bit n l) = signed_take_bit n (k * l)\<close> |
|
72241 | 3524 |
for k l :: int |
72187 | 3525 |
proof - |
3526 |
have \<open>take_bit (Suc n) |
|
3527 |
(take_bit (Suc n) (signed_take_bit n k) * |
|
3528 |
take_bit (Suc n) (signed_take_bit n l)) = |
|
3529 |
take_bit (Suc n) (k * l)\<close> |
|
3530 |
by (simp add: take_bit_signed_take_bit take_bit_mult) |
|
3531 |
then show ?thesis |
|
3532 |
by (simp only: signed_take_bit_eq_iff_take_bit_eq take_bit_mult) |
|
3533 |
qed |
|
3534 |
||
72010 | 3535 |
lemma signed_take_bit_eq_take_bit_minus: |
3536 |
\<open>signed_take_bit n k = take_bit (Suc n) k - 2 ^ Suc n * of_bool (bit k n)\<close> |
|
72241 | 3537 |
for k :: int |
72010 | 3538 |
proof (cases \<open>bit k n\<close>) |
3539 |
case True |
|
3540 |
have \<open>signed_take_bit n k = take_bit (Suc n) k OR NOT (mask (Suc n))\<close> |
|
3541 |
by (rule bit_eqI) (auto simp add: bit_signed_take_bit_iff min_def bit_take_bit_iff bit_or_iff bit_not_iff bit_mask_iff less_Suc_eq True) |
|
3542 |
then have \<open>signed_take_bit n k = take_bit (Suc n) k + NOT (mask (Suc n))\<close> |
|
3543 |
by (simp add: disjunctive_add bit_take_bit_iff bit_not_iff bit_mask_iff) |
|
3544 |
with True show ?thesis |
|
3545 |
by (simp flip: minus_exp_eq_not_mask) |
|
3546 |
next |
|
3547 |
case False |
|
72241 | 3548 |
show ?thesis |
3549 |
by (rule bit_eqI) (simp add: False bit_signed_take_bit_iff bit_take_bit_iff min_def less_Suc_eq) |
|
72010 | 3550 |
qed |
3551 |
||
3552 |
lemma signed_take_bit_eq_take_bit_shift: |
|
3553 |
\<open>signed_take_bit n k = take_bit (Suc n) (k + 2 ^ n) - 2 ^ n\<close> |
|
72241 | 3554 |
for k :: int |
72010 | 3555 |
proof - |
3556 |
have *: \<open>take_bit n k OR 2 ^ n = take_bit n k + 2 ^ n\<close> |
|
3557 |
by (simp add: disjunctive_add bit_exp_iff bit_take_bit_iff) |
|
3558 |
have \<open>take_bit n k - 2 ^ n = take_bit n k + NOT (mask n)\<close> |
|
3559 |
by (simp add: minus_exp_eq_not_mask) |
|
3560 |
also have \<open>\<dots> = take_bit n k OR NOT (mask n)\<close> |
|
3561 |
by (rule disjunctive_add) |
|
3562 |
(simp add: bit_exp_iff bit_take_bit_iff bit_not_iff bit_mask_iff) |
|
3563 |
finally have **: \<open>take_bit n k - 2 ^ n = take_bit n k OR NOT (mask n)\<close> . |
|
3564 |
have \<open>take_bit (Suc n) (k + 2 ^ n) = take_bit (Suc n) (take_bit (Suc n) k + take_bit (Suc n) (2 ^ n))\<close> |
|
3565 |
by (simp only: take_bit_add) |
|
3566 |
also have \<open>take_bit (Suc n) k = 2 ^ n * of_bool (bit k n) + take_bit n k\<close> |
|
3567 |
by (simp add: take_bit_Suc_from_most) |
|
3568 |
finally have \<open>take_bit (Suc n) (k + 2 ^ n) = take_bit (Suc n) (2 ^ (n + of_bool (bit k n)) + take_bit n k)\<close> |
|
3569 |
by (simp add: ac_simps) |
|
3570 |
also have \<open>2 ^ (n + of_bool (bit k n)) + take_bit n k = 2 ^ (n + of_bool (bit k n)) OR take_bit n k\<close> |
|
3571 |
by (rule disjunctive_add) |
|
3572 |
(auto simp add: disjunctive_add bit_take_bit_iff bit_double_iff bit_exp_iff) |
|
3573 |
finally show ?thesis |
|
72241 | 3574 |
using * ** by (simp add: signed_take_bit_def concat_bit_Suc min_def ac_simps) |
72010 | 3575 |
qed |
3576 |
||
3577 |
lemma signed_take_bit_nonnegative_iff [simp]: |
|
3578 |
\<open>0 \<le> signed_take_bit n k \<longleftrightarrow> \<not> bit k n\<close> |
|
72241 | 3579 |
for k :: int |
72028 | 3580 |
by (simp add: signed_take_bit_def not_less concat_bit_def) |
72010 | 3581 |
|
3582 |
lemma signed_take_bit_negative_iff [simp]: |
|
3583 |
\<open>signed_take_bit n k < 0 \<longleftrightarrow> bit k n\<close> |
|
72241 | 3584 |
for k :: int |
72028 | 3585 |
by (simp add: signed_take_bit_def not_less concat_bit_def) |
72010 | 3586 |
|
73868 | 3587 |
lemma signed_take_bit_int_greater_eq_minus_exp [simp]: |
3588 |
\<open>- (2 ^ n) \<le> signed_take_bit n k\<close> |
|
3589 |
for k :: int |
|
3590 |
by (simp add: signed_take_bit_eq_take_bit_shift) |
|
3591 |
||
3592 |
lemma signed_take_bit_int_less_exp [simp]: |
|
3593 |
\<open>signed_take_bit n k < 2 ^ n\<close> |
|
3594 |
for k :: int |
|
3595 |
using take_bit_int_less_exp [of \<open>Suc n\<close>] |
|
3596 |
by (simp add: signed_take_bit_eq_take_bit_shift) |
|
3597 |
||
72261 | 3598 |
lemma signed_take_bit_int_eq_self_iff: |
3599 |
\<open>signed_take_bit n k = k \<longleftrightarrow> - (2 ^ n) \<le> k \<and> k < 2 ^ n\<close> |
|
3600 |
for k :: int |
|
3601 |
by (auto simp add: signed_take_bit_eq_take_bit_shift take_bit_int_eq_self_iff algebra_simps) |
|
3602 |
||
72262 | 3603 |
lemma signed_take_bit_int_eq_self: |
3604 |
\<open>signed_take_bit n k = k\<close> if \<open>- (2 ^ n) \<le> k\<close> \<open>k < 2 ^ n\<close> |
|
3605 |
for k :: int |
|
3606 |
using that by (simp add: signed_take_bit_int_eq_self_iff) |
|
3607 |
||
72261 | 3608 |
lemma signed_take_bit_int_less_eq_self_iff: |
3609 |
\<open>signed_take_bit n k \<le> k \<longleftrightarrow> - (2 ^ n) \<le> k\<close> |
|
3610 |
for k :: int |
|
3611 |
by (simp add: signed_take_bit_eq_take_bit_shift take_bit_int_less_eq_self_iff algebra_simps) |
|
3612 |
linarith |
|
3613 |
||
3614 |
lemma signed_take_bit_int_less_self_iff: |
|
3615 |
\<open>signed_take_bit n k < k \<longleftrightarrow> 2 ^ n \<le> k\<close> |
|
3616 |
for k :: int |
|
3617 |
by (simp add: signed_take_bit_eq_take_bit_shift take_bit_int_less_self_iff algebra_simps) |
|
3618 |
||
3619 |
lemma signed_take_bit_int_greater_self_iff: |
|
3620 |
\<open>k < signed_take_bit n k \<longleftrightarrow> k < - (2 ^ n)\<close> |
|
3621 |
for k :: int |
|
3622 |
by (simp add: signed_take_bit_eq_take_bit_shift take_bit_int_greater_self_iff algebra_simps) |
|
3623 |
linarith |
|
3624 |
||
3625 |
lemma signed_take_bit_int_greater_eq_self_iff: |
|
3626 |
\<open>k \<le> signed_take_bit n k \<longleftrightarrow> k < 2 ^ n\<close> |
|
3627 |
for k :: int |
|
3628 |
by (simp add: signed_take_bit_eq_take_bit_shift take_bit_int_greater_eq_self_iff algebra_simps) |
|
3629 |
||
3630 |
lemma signed_take_bit_int_greater_eq: |
|
72010 | 3631 |
\<open>k + 2 ^ Suc n \<le> signed_take_bit n k\<close> if \<open>k < - (2 ^ n)\<close> |
72241 | 3632 |
for k :: int |
72262 | 3633 |
using that take_bit_int_greater_eq [of \<open>k + 2 ^ n\<close> \<open>Suc n\<close>] |
72010 | 3634 |
by (simp add: signed_take_bit_eq_take_bit_shift) |
3635 |
||
72261 | 3636 |
lemma signed_take_bit_int_less_eq: |
72010 | 3637 |
\<open>signed_take_bit n k \<le> k - 2 ^ Suc n\<close> if \<open>k \<ge> 2 ^ n\<close> |
72241 | 3638 |
for k :: int |
72262 | 3639 |
using that take_bit_int_less_eq [of \<open>Suc n\<close> \<open>k + 2 ^ n\<close>] |
72010 | 3640 |
by (simp add: signed_take_bit_eq_take_bit_shift) |
3641 |
||
3642 |
lemma signed_take_bit_Suc_bit0 [simp]: |
|
72241 | 3643 |
\<open>signed_take_bit (Suc n) (numeral (Num.Bit0 k)) = signed_take_bit n (numeral k) * (2 :: int)\<close> |
72010 | 3644 |
by (simp add: signed_take_bit_Suc) |
3645 |
||
3646 |
lemma signed_take_bit_Suc_bit1 [simp]: |
|
72241 | 3647 |
\<open>signed_take_bit (Suc n) (numeral (Num.Bit1 k)) = signed_take_bit n (numeral k) * 2 + (1 :: int)\<close> |
72010 | 3648 |
by (simp add: signed_take_bit_Suc) |
3649 |
||
3650 |
lemma signed_take_bit_Suc_minus_bit0 [simp]: |
|
72241 | 3651 |
\<open>signed_take_bit (Suc n) (- numeral (Num.Bit0 k)) = signed_take_bit n (- numeral k) * (2 :: int)\<close> |
72010 | 3652 |
by (simp add: signed_take_bit_Suc) |
3653 |
||
3654 |
lemma signed_take_bit_Suc_minus_bit1 [simp]: |
|
72241 | 3655 |
\<open>signed_take_bit (Suc n) (- numeral (Num.Bit1 k)) = signed_take_bit n (- numeral k - 1) * 2 + (1 :: int)\<close> |
72010 | 3656 |
by (simp add: signed_take_bit_Suc) |
3657 |
||
3658 |
lemma signed_take_bit_numeral_bit0 [simp]: |
|
72241 | 3659 |
\<open>signed_take_bit (numeral l) (numeral (Num.Bit0 k)) = signed_take_bit (pred_numeral l) (numeral k) * (2 :: int)\<close> |
72010 | 3660 |
by (simp add: signed_take_bit_rec) |
3661 |
||
3662 |
lemma signed_take_bit_numeral_bit1 [simp]: |
|
72241 | 3663 |
\<open>signed_take_bit (numeral l) (numeral (Num.Bit1 k)) = signed_take_bit (pred_numeral l) (numeral k) * 2 + (1 :: int)\<close> |
72010 | 3664 |
by (simp add: signed_take_bit_rec) |
3665 |
||
3666 |
lemma signed_take_bit_numeral_minus_bit0 [simp]: |
|
72241 | 3667 |
\<open>signed_take_bit (numeral l) (- numeral (Num.Bit0 k)) = signed_take_bit (pred_numeral l) (- numeral k) * (2 :: int)\<close> |
72010 | 3668 |
by (simp add: signed_take_bit_rec) |
3669 |
||
3670 |
lemma signed_take_bit_numeral_minus_bit1 [simp]: |
|
72241 | 3671 |
\<open>signed_take_bit (numeral l) (- numeral (Num.Bit1 k)) = signed_take_bit (pred_numeral l) (- numeral k - 1) * 2 + (1 :: int)\<close> |
72010 | 3672 |
by (simp add: signed_take_bit_rec) |
3673 |
||
3674 |
lemma signed_take_bit_code [code]: |
|
72241 | 3675 |
\<open>signed_take_bit n a = |
3676 |
(let l = take_bit (Suc n) a |
|
3677 |
in if bit l n then l + push_bit (Suc n) (- 1) else l)\<close> |
|
72010 | 3678 |
proof - |
72241 | 3679 |
have *: \<open>take_bit (Suc n) a + push_bit n (- 2) = |
3680 |
take_bit (Suc n) a OR NOT (mask (Suc n))\<close> |
|
3681 |
by (auto simp add: bit_take_bit_iff bit_push_bit_iff bit_not_iff bit_mask_iff disjunctive_add |
|
3682 |
simp flip: push_bit_minus_one_eq_not_mask) |
|
72010 | 3683 |
show ?thesis |
3684 |
by (rule bit_eqI) |
|
74592 | 3685 |
(auto simp add: Let_def * bit_signed_take_bit_iff bit_take_bit_iff min_def less_Suc_eq bit_not_iff |
3686 |
bit_mask_iff bit_or_iff simp del: push_bit_minus_one_eq_not_mask) |
|
72010 | 3687 |
qed |
3688 |
||
3689 |
||
71800 | 3690 |
subsection \<open>Key ideas of bit operations\<close> |
3691 |
||
3692 |
text \<open> |
|
3693 |
When formalizing bit operations, it is tempting to represent |
|
3694 |
bit values as explicit lists over a binary type. This however |
|
3695 |
is a bad idea, mainly due to the inherent ambiguities in |
|
3696 |
representation concerning repeating leading bits. |
|
3697 |
||
3698 |
Hence this approach avoids such explicit lists altogether |
|
3699 |
following an algebraic path: |
|
3700 |
||
3701 |
\<^item> Bit values are represented by numeric types: idealized |
|
3702 |
unbounded bit values can be represented by type \<^typ>\<open>int\<close>, |
|
3703 |
bounded bit values by quotient types over \<^typ>\<open>int\<close>. |
|
3704 |
||
3705 |
\<^item> (A special case are idealized unbounded bit values ending |
|
3706 |
in @{term [source] 0} which can be represented by type \<^typ>\<open>nat\<close> but |
|
3707 |
only support a restricted set of operations). |
|
3708 |
||
3709 |
\<^item> From this idea follows that |
|
3710 |
||
3711 |
\<^item> multiplication by \<^term>\<open>2 :: int\<close> is a bit shift to the left and |
|
3712 |
||
3713 |
\<^item> division by \<^term>\<open>2 :: int\<close> is a bit shift to the right. |
|
3714 |
||
3715 |
\<^item> Concerning bounded bit values, iterated shifts to the left |
|
3716 |
may result in eliminating all bits by shifting them all |
|
3717 |
beyond the boundary. The property \<^prop>\<open>(2 :: int) ^ n \<noteq> 0\<close> |
|
3718 |
represents that \<^term>\<open>n\<close> is \<^emph>\<open>not\<close> beyond that boundary. |
|
3719 |
||
71965
d45f5d4c41bd
more class operations for the sake of efficient generated code
haftmann
parents:
71956
diff
changeset
|
3720 |
\<^item> The projection on a single bit is then @{thm bit_iff_odd [where ?'a = int, no_vars]}. |
71800 | 3721 |
|
3722 |
\<^item> This leads to the most fundamental properties of bit values: |
|
3723 |
||
3724 |
\<^item> Equality rule: @{thm bit_eqI [where ?'a = int, no_vars]} |
|
3725 |
||
3726 |
\<^item> Induction rule: @{thm bits_induct [where ?'a = int, no_vars]} |
|
3727 |
||
3728 |
\<^item> Typical operations are characterized as follows: |
|
3729 |
||
3730 |
\<^item> Singleton \<^term>\<open>n\<close>th bit: \<^term>\<open>(2 :: int) ^ n\<close> |
|
3731 |
||
71956 | 3732 |
\<^item> Bit mask upto bit \<^term>\<open>n\<close>: @{thm mask_eq_exp_minus_1 [where ?'a = int, no_vars]} |
71800 | 3733 |
|
3734 |
\<^item> Left shift: @{thm push_bit_eq_mult [where ?'a = int, no_vars]} |
|
3735 |
||
3736 |
\<^item> Right shift: @{thm drop_bit_eq_div [where ?'a = int, no_vars]} |
|
3737 |
||
3738 |
\<^item> Truncation: @{thm take_bit_eq_mod [where ?'a = int, no_vars]} |
|
3739 |
||
3740 |
\<^item> Negation: @{thm bit_not_iff [where ?'a = int, no_vars]} |
|
3741 |
||
3742 |
\<^item> And: @{thm bit_and_iff [where ?'a = int, no_vars]} |
|
3743 |
||
3744 |
\<^item> Or: @{thm bit_or_iff [where ?'a = int, no_vars]} |
|
3745 |
||
3746 |
\<^item> Xor: @{thm bit_xor_iff [where ?'a = int, no_vars]} |
|
3747 |
||
79068 | 3748 |
\<^item> Set a single bit: @{thm set_bit_eq_or [where ?'a = int, no_vars]} |
3749 |
||
3750 |
\<^item> Unset a single bit: @{thm unset_bit_eq_and_not [where ?'a = int, no_vars]} |
|
3751 |
||
3752 |
\<^item> Flip a single bit: @{thm flip_bit_eq_xor [where ?'a = int, no_vars]} |
|
72028 | 3753 |
|
72241 | 3754 |
\<^item> Signed truncation, or modulus centered around \<^term>\<open>0::int\<close>: @{thm signed_take_bit_def [no_vars]} |
72028 | 3755 |
|
72241 | 3756 |
\<^item> Bit concatenation: @{thm concat_bit_def [no_vars]} |
72028 | 3757 |
|
3758 |
\<^item> (Bounded) conversion from and to a list of bits: @{thm horner_sum_bit_eq_take_bit [where ?'a = int, no_vars]} |
|
71800 | 3759 |
\<close> |
3760 |
||
79068 | 3761 |
|
3762 |
subsection \<open>Lemma duplicates and other\<close> |
|
3763 |
||
79116 | 3764 |
context semiring_bit_operations |
3765 |
begin |
|
3766 |
||
3767 |
lemmas set_bit_def [no_atp] = set_bit_eq_or |
|
3768 |
||
3769 |
lemmas unset_bit_def [no_atp] = unset_bit_eq_and_not |
|
3770 |
||
3771 |
lemmas flip_bit_def [no_atp] = flip_bit_eq_xor |
|
3772 |
||
3773 |
end |
|
3774 |
||
3775 |
lemma and_nat_rec [no_atp]: |
|
79070 | 3776 |
\<open>m AND n = of_bool (odd m \<and> odd n) + 2 * ((m div 2) AND (n div 2))\<close> for m n :: nat |
3777 |
by (fact and_rec) |
|
3778 |
||
79116 | 3779 |
lemma or_nat_rec [no_atp]: |
79070 | 3780 |
\<open>m OR n = of_bool (odd m \<or> odd n) + 2 * ((m div 2) OR (n div 2))\<close> for m n :: nat |
3781 |
by (fact or_rec) |
|
3782 |
||
79116 | 3783 |
lemma xor_nat_rec [no_atp]: |
79070 | 3784 |
\<open>m XOR n = of_bool (odd m \<noteq> odd n) + 2 * ((m div 2) XOR (n div 2))\<close> for m n :: nat |
3785 |
by (fact xor_rec) |
|
3786 |
||
79116 | 3787 |
lemma bit_push_bit_iff_nat [no_atp]: |
79071 | 3788 |
\<open>bit (push_bit m q) n \<longleftrightarrow> m \<le> n \<and> bit q (n - m)\<close> for q :: nat |
3789 |
by (fact bit_push_bit_iff') |
|
3790 |
||
79116 | 3791 |
lemma mask_half_int [no_atp]: |
3792 |
\<open>mask n div 2 = (mask (n - 1) :: int)\<close> |
|
3793 |
by (fact mask_half) |
|
3794 |
||
3795 |
lemma not_int_rec [no_atp]: |
|
79068 | 3796 |
\<open>NOT k = of_bool (even k) + 2 * NOT (k div 2)\<close> for k :: int |
3797 |
by (fact not_rec) |
|
3798 |
||
79116 | 3799 |
lemma even_not_iff_int [no_atp]: |
79068 | 3800 |
\<open>even (NOT k) \<longleftrightarrow> odd k\<close> for k :: int |
3801 |
by (fact even_not_iff) |
|
3802 |
||
79072
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
3803 |
lemma bit_not_int_iff': |
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
3804 |
\<open>bit (- k - 1) n \<longleftrightarrow> \<not> bit k n\<close> for k :: int |
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
3805 |
by (simp flip: not_eq_complement add: bit_simps) |
a91050cd5c93
de-duplicated specification of class ring_bit_operations
haftmann
parents:
79071
diff
changeset
|
3806 |
|
79116 | 3807 |
lemmas and_int_rec [no_atp] = and_int.rec |
3808 |
||
3809 |
lemma even_and_iff_int [no_atp]: |
|
3810 |
\<open>even (k AND l) \<longleftrightarrow> even k \<or> even l\<close> for k l :: int |
|
3811 |
by (fact even_and_iff) |
|
3812 |
||
3813 |
lemmas bit_and_int_iff [no_atp] = and_int.bit_iff |
|
3814 |
||
3815 |
lemmas or_int_rec [no_atp] = or_int.rec |
|
3816 |
||
3817 |
lemmas bit_or_int_iff [no_atp] = or_int.bit_iff |
|
3818 |
||
3819 |
lemmas xor_int_rec [no_atp] = xor_int.rec |
|
3820 |
||
3821 |
lemmas bit_xor_int_iff [no_atp] = xor_int.bit_iff |
|
3822 |
||
3823 |
lemma drop_bit_push_bit_int [no_atp]: |
|
3824 |
\<open>drop_bit m (push_bit n k) = drop_bit (m - n) (push_bit (n - m) k)\<close> for k :: int |
|
3825 |
by (fact drop_bit_push_bit) |
|
3826 |
||
3827 |
lemma bit_push_bit_iff_int [no_atp] : |
|
3828 |
\<open>bit (push_bit m k) n \<longleftrightarrow> m \<le> n \<and> bit k (n - m)\<close> for k :: int |
|
3829 |
by (fact bit_push_bit_iff') |
|
3830 |
||
74097 | 3831 |
no_notation |
74391 | 3832 |
not (\<open>NOT\<close>) |
74364 | 3833 |
and "and" (infixr \<open>AND\<close> 64) |
74097 | 3834 |
and or (infixr \<open>OR\<close> 59) |
3835 |
and xor (infixr \<open>XOR\<close> 59) |
|
3836 |
||
3837 |
bundle bit_operations_syntax |
|
74101 | 3838 |
begin |
74097 | 3839 |
|
3840 |
notation |
|
74391 | 3841 |
not (\<open>NOT\<close>) |
74364 | 3842 |
and "and" (infixr \<open>AND\<close> 64) |
74097 | 3843 |
and or (infixr \<open>OR\<close> 59) |
3844 |
and xor (infixr \<open>XOR\<close> 59) |
|
3845 |
||
71442 | 3846 |
end |
74097 | 3847 |
|
3848 |
end |