72102
|
1 |
(* Author: Florian Haftmann, TUM
|
|
2 |
*)
|
|
3 |
|
|
4 |
section \<open>Proof of concept for conversions for algebraically founded bit word types\<close>
|
|
5 |
|
72198
|
6 |
theory Conversions
|
72102
|
7 |
imports
|
|
8 |
Main
|
|
9 |
"HOL-Library.Type_Length"
|
|
10 |
"HOL-Library.Bit_Operations"
|
|
11 |
"HOL-Word.Word"
|
|
12 |
begin
|
|
13 |
|
72198
|
14 |
hide_const (open) unat uint sint word_of_int ucast scast
|
|
15 |
|
72227
|
16 |
|
|
17 |
subsection \<open>Conversions to word\<close>
|
72198
|
18 |
|
|
19 |
abbreviation word_of_nat :: \<open>nat \<Rightarrow> 'a::len word\<close>
|
|
20 |
where \<open>word_of_nat \<equiv> of_nat\<close>
|
|
21 |
|
|
22 |
abbreviation word_of_int :: \<open>int \<Rightarrow> 'a::len word\<close>
|
|
23 |
where \<open>word_of_int \<equiv> of_int\<close>
|
|
24 |
|
|
25 |
lemma Word_eq_word_of_int [simp]:
|
|
26 |
\<open>Word.Word = word_of_int\<close>
|
|
27 |
by (rule ext; transfer) simp
|
|
28 |
|
|
29 |
lemma word_of_nat_eq_iff:
|
|
30 |
\<open>word_of_nat m = (word_of_nat n :: 'a::len word) \<longleftrightarrow> take_bit LENGTH('a) m = take_bit LENGTH('a) n\<close>
|
|
31 |
by transfer (simp add: take_bit_of_nat)
|
|
32 |
|
|
33 |
lemma word_of_int_eq_iff:
|
|
34 |
\<open>word_of_int k = (word_of_int l :: 'a::len word) \<longleftrightarrow> take_bit LENGTH('a) k = take_bit LENGTH('a) l\<close>
|
|
35 |
by transfer rule
|
|
36 |
|
|
37 |
lemma word_of_nat_less_eq_iff:
|
|
38 |
\<open>word_of_nat m \<le> (word_of_nat n :: 'a::len word) \<longleftrightarrow> take_bit LENGTH('a) m \<le> take_bit LENGTH('a) n\<close>
|
|
39 |
by transfer (simp add: take_bit_of_nat)
|
|
40 |
|
|
41 |
lemma word_of_int_less_eq_iff:
|
|
42 |
\<open>word_of_int k \<le> (word_of_int l :: 'a::len word) \<longleftrightarrow> take_bit LENGTH('a) k \<le> take_bit LENGTH('a) l\<close>
|
|
43 |
by transfer rule
|
|
44 |
|
|
45 |
lemma word_of_nat_less_iff:
|
|
46 |
\<open>word_of_nat m < (word_of_nat n :: 'a::len word) \<longleftrightarrow> take_bit LENGTH('a) m < take_bit LENGTH('a) n\<close>
|
|
47 |
by transfer (simp add: take_bit_of_nat)
|
|
48 |
|
|
49 |
lemma word_of_int_less_iff:
|
|
50 |
\<open>word_of_int k < (word_of_int l :: 'a::len word) \<longleftrightarrow> take_bit LENGTH('a) k < take_bit LENGTH('a) l\<close>
|
|
51 |
by transfer rule
|
|
52 |
|
|
53 |
lemma word_of_nat_eq_0_iff [simp]:
|
|
54 |
\<open>word_of_nat n = (0 :: 'a::len word) \<longleftrightarrow> 2 ^ LENGTH('a) dvd n\<close>
|
|
55 |
using of_nat_word_eq_iff [where ?'a = 'a, of n 0] by (simp add: take_bit_eq_0_iff)
|
|
56 |
|
|
57 |
lemma word_of_int_eq_0_iff [simp]:
|
|
58 |
\<open>word_of_int k = (0 :: 'a::len word) \<longleftrightarrow> 2 ^ LENGTH('a) dvd k\<close>
|
|
59 |
using of_int_word_eq_iff [where ?'a = 'a, of k 0] by (simp add: take_bit_eq_0_iff)
|
|
60 |
|
|
61 |
|
72227
|
62 |
subsection \<open>Conversion from word\<close>
|
72198
|
63 |
|
72227
|
64 |
subsubsection \<open>Generic unsigned conversion\<close>
|
72198
|
65 |
|
72102
|
66 |
context semiring_1
|
|
67 |
begin
|
|
68 |
|
|
69 |
lift_definition unsigned :: \<open>'b::len word \<Rightarrow> 'a\<close>
|
|
70 |
is \<open>of_nat \<circ> nat \<circ> take_bit LENGTH('b)\<close>
|
|
71 |
by simp
|
|
72 |
|
|
73 |
lemma unsigned_0 [simp]:
|
|
74 |
\<open>unsigned 0 = 0\<close>
|
|
75 |
by transfer simp
|
|
76 |
|
|
77 |
lemma unsigned_1 [simp]:
|
|
78 |
\<open>unsigned 1 = 1\<close>
|
|
79 |
by transfer simp
|
|
80 |
|
|
81 |
end
|
|
82 |
|
|
83 |
context semiring_char_0
|
|
84 |
begin
|
|
85 |
|
|
86 |
lemma unsigned_word_eqI:
|
|
87 |
\<open>v = w\<close> if \<open>unsigned v = unsigned w\<close>
|
|
88 |
using that by transfer (simp add: eq_nat_nat_iff)
|
|
89 |
|
|
90 |
lemma word_eq_iff_unsigned:
|
|
91 |
\<open>v = w \<longleftrightarrow> unsigned v = unsigned w\<close>
|
|
92 |
by (auto intro: unsigned_word_eqI)
|
|
93 |
|
|
94 |
end
|
|
95 |
|
72227
|
96 |
context semiring_bits
|
|
97 |
begin
|
|
98 |
|
|
99 |
lemma bit_unsigned_iff:
|
|
100 |
\<open>bit (unsigned w) n \<longleftrightarrow> 2 ^ n \<noteq> 0 \<and> bit w n\<close>
|
|
101 |
for w :: \<open>'b::len word\<close>
|
|
102 |
by (transfer fixing: bit) (simp add: bit_of_nat_iff bit_nat_iff bit_take_bit_iff)
|
|
103 |
|
|
104 |
end
|
|
105 |
|
|
106 |
context semiring_bit_shifts
|
|
107 |
begin
|
|
108 |
|
|
109 |
lemma unsigned_push_bit_eq:
|
|
110 |
\<open>unsigned (push_bit n w) = take_bit LENGTH('b) (push_bit n (unsigned w))\<close>
|
|
111 |
for w :: \<open>'b::len word\<close>
|
|
112 |
proof (rule bit_eqI)
|
|
113 |
fix m
|
|
114 |
assume \<open>2 ^ m \<noteq> 0\<close>
|
|
115 |
show \<open>bit (unsigned (push_bit n w)) m = bit (take_bit LENGTH('b) (push_bit n (unsigned w))) m\<close>
|
|
116 |
proof (cases \<open>n \<le> m\<close>)
|
|
117 |
case True
|
|
118 |
with \<open>2 ^ m \<noteq> 0\<close> have \<open>2 ^ (m - n) \<noteq> 0\<close>
|
|
119 |
by (metis (full_types) diff_add exp_add_not_zero_imp)
|
|
120 |
with True show ?thesis
|
|
121 |
by (simp add: bit_unsigned_iff bit_push_bit_iff Parity.bit_push_bit_iff bit_take_bit_iff ac_simps exp_eq_zero_iff not_le)
|
|
122 |
next
|
|
123 |
case False
|
|
124 |
then show ?thesis
|
|
125 |
by (simp add: not_le bit_unsigned_iff bit_push_bit_iff Parity.bit_push_bit_iff bit_take_bit_iff)
|
|
126 |
qed
|
|
127 |
qed
|
|
128 |
|
|
129 |
lemma unsigned_take_bit_eq:
|
|
130 |
\<open>unsigned (take_bit n w) = take_bit n (unsigned w)\<close>
|
|
131 |
for w :: \<open>'b::len word\<close>
|
|
132 |
by (rule bit_eqI) (simp add: bit_unsigned_iff bit_take_bit_iff Parity.bit_take_bit_iff)
|
|
133 |
|
|
134 |
end
|
|
135 |
|
|
136 |
context semiring_bit_operations
|
|
137 |
begin
|
|
138 |
|
|
139 |
lemma unsigned_and_eq:
|
|
140 |
\<open>unsigned (v AND w) = unsigned v AND unsigned w\<close>
|
|
141 |
for v w :: \<open>'b::len word\<close>
|
|
142 |
by (rule bit_eqI) (simp add: bit_unsigned_iff bit_and_iff Bit_Operations.bit_and_iff)
|
|
143 |
|
|
144 |
lemma unsigned_or_eq:
|
|
145 |
\<open>unsigned (v OR w) = unsigned v OR unsigned w\<close>
|
|
146 |
for v w :: \<open>'b::len word\<close>
|
|
147 |
by (rule bit_eqI) (simp add: bit_unsigned_iff bit_or_iff Bit_Operations.bit_or_iff)
|
|
148 |
|
|
149 |
lemma unsigned_xor_eq:
|
|
150 |
\<open>unsigned (v XOR w) = unsigned v XOR unsigned w\<close>
|
|
151 |
for v w :: \<open>'b::len word\<close>
|
|
152 |
by (rule bit_eqI) (simp add: bit_unsigned_iff bit_xor_iff Bit_Operations.bit_xor_iff)
|
|
153 |
|
|
154 |
end
|
|
155 |
|
|
156 |
context ring_bit_operations
|
|
157 |
begin
|
|
158 |
|
|
159 |
lemma unsigned_not_eq:
|
|
160 |
\<open>unsigned (NOT w) = take_bit LENGTH('b) (NOT (unsigned w))\<close>
|
|
161 |
for w :: \<open>'b::len word\<close>
|
|
162 |
by (rule bit_eqI)
|
|
163 |
(simp add: bit_unsigned_iff bit_take_bit_iff bit_not_iff Bit_Operations.bit_not_iff exp_eq_zero_iff not_le)
|
|
164 |
|
|
165 |
end
|
|
166 |
|
|
167 |
lemma unsigned_of_nat [simp]:
|
|
168 |
\<open>unsigned (word_of_nat n :: 'a::len word) = of_nat (take_bit LENGTH('a) n)\<close>
|
|
169 |
by transfer (simp add: nat_eq_iff take_bit_of_nat)
|
|
170 |
|
|
171 |
lemma unsigned_of_int [simp]:
|
|
172 |
\<open>unsigned (word_of_int n :: 'a::len word) = of_int (take_bit LENGTH('a) n)\<close>
|
|
173 |
by transfer (simp add: nat_eq_iff take_bit_of_nat)
|
|
174 |
|
|
175 |
context unique_euclidean_semiring_numeral
|
|
176 |
begin
|
|
177 |
|
|
178 |
lemma unsigned_greater_eq:
|
|
179 |
\<open>0 \<le> unsigned w\<close> for w :: \<open>'b::len word\<close>
|
|
180 |
by (transfer fixing: less_eq) simp
|
|
181 |
|
|
182 |
lemma unsigned_less:
|
|
183 |
\<open>unsigned w < 2 ^ LENGTH('b)\<close> for w :: \<open>'b::len word\<close>
|
|
184 |
by (transfer fixing: less) (simp add: take_bit_int_less_exp)
|
|
185 |
|
|
186 |
end
|
|
187 |
|
|
188 |
context linordered_semidom
|
|
189 |
begin
|
|
190 |
|
|
191 |
lemma word_less_eq_iff_unsigned:
|
|
192 |
"a \<le> b \<longleftrightarrow> unsigned a \<le> unsigned b"
|
|
193 |
by (transfer fixing: less_eq) (simp add: nat_le_eq_zle)
|
|
194 |
|
|
195 |
lemma word_less_iff_unsigned:
|
|
196 |
"a < b \<longleftrightarrow> unsigned a < unsigned b"
|
|
197 |
by (transfer fixing: less) (auto dest: preorder_class.le_less_trans [OF take_bit_nonnegative])
|
|
198 |
|
|
199 |
end
|
|
200 |
|
|
201 |
|
|
202 |
subsubsection \<open>Generic signed conversion\<close>
|
|
203 |
|
72102
|
204 |
context ring_1
|
|
205 |
begin
|
|
206 |
|
|
207 |
lift_definition signed :: \<open>'b::len word \<Rightarrow> 'a\<close>
|
|
208 |
is \<open>of_int \<circ> signed_take_bit (LENGTH('b) - 1)\<close>
|
|
209 |
by (simp flip: signed_take_bit_decr_length_iff)
|
|
210 |
|
|
211 |
lemma signed_0 [simp]:
|
|
212 |
\<open>signed 0 = 0\<close>
|
|
213 |
by transfer simp
|
|
214 |
|
|
215 |
lemma signed_1 [simp]:
|
|
216 |
\<open>signed (1 :: 'b::len word) = (if LENGTH('b) = 1 then - 1 else 1)\<close>
|
|
217 |
by (transfer fixing: uminus)
|
|
218 |
(simp_all add: signed_take_bit_eq not_le Suc_lessI)
|
|
219 |
|
|
220 |
lemma signed_minus_1 [simp]:
|
|
221 |
\<open>signed (- 1 :: 'b::len word) = - 1\<close>
|
|
222 |
by (transfer fixing: uminus) simp
|
|
223 |
|
|
224 |
end
|
|
225 |
|
|
226 |
context ring_char_0
|
|
227 |
begin
|
|
228 |
|
|
229 |
lemma signed_word_eqI:
|
|
230 |
\<open>v = w\<close> if \<open>signed v = signed w\<close>
|
|
231 |
using that by transfer (simp flip: signed_take_bit_decr_length_iff)
|
|
232 |
|
|
233 |
lemma word_eq_iff_signed:
|
|
234 |
\<open>v = w \<longleftrightarrow> signed v = signed w\<close>
|
|
235 |
by (auto intro: signed_word_eqI)
|
|
236 |
|
|
237 |
end
|
|
238 |
|
72227
|
239 |
context ring_bit_operations
|
|
240 |
begin
|
|
241 |
|
|
242 |
lemma bit_signed_iff:
|
|
243 |
\<open>bit (signed w) n \<longleftrightarrow> 2 ^ n \<noteq> 0 \<and> bit w (min (LENGTH('b) - Suc 0) n)\<close>
|
|
244 |
for w :: \<open>'b::len word\<close>
|
|
245 |
by (transfer fixing: bit) (auto simp add: bit_of_int_iff bit_signed_take_bit_iff min_def)
|
|
246 |
|
|
247 |
lemma signed_push_bit_eq:
|
|
248 |
\<open>signed (push_bit n w) = take_bit (LENGTH('b) - Suc 0) (push_bit n (signed w))
|
|
249 |
OR of_bool (n < LENGTH('b) \<and> bit w (LENGTH('b) - Suc n)) * NOT (mask (LENGTH('b) - Suc 0))\<close>
|
|
250 |
for w :: \<open>'b::len word\<close>
|
|
251 |
proof (rule bit_eqI)
|
|
252 |
fix m
|
|
253 |
assume \<open>2 ^ m \<noteq> 0\<close>
|
|
254 |
define q where \<open>q = LENGTH('b) - Suc 0\<close>
|
|
255 |
then have *: \<open>LENGTH('b) = Suc q\<close>
|
|
256 |
by simp
|
|
257 |
show \<open>bit (signed (push_bit n w)) m \<longleftrightarrow>
|
|
258 |
bit (take_bit (LENGTH('b) - Suc 0) (push_bit n (signed w)) OR
|
|
259 |
of_bool (n < LENGTH('b) \<and> bit w (LENGTH('b) - Suc n)) * NOT (mask (LENGTH('b) - Suc 0))) m\<close>
|
|
260 |
proof (cases \<open>n \<le> m\<close>)
|
|
261 |
case True
|
|
262 |
with \<open>2 ^ m \<noteq> 0\<close> have \<open>2 ^ (m - n) \<noteq> 0\<close>
|
|
263 |
by (metis (full_types) diff_add exp_add_not_zero_imp)
|
|
264 |
with True show ?thesis
|
|
265 |
by (auto simp add: * bit_signed_iff bit_push_bit_iff Parity.bit_push_bit_iff bit_or_iff bit_take_bit_iff bit_not_iff bit_mask_iff exp_eq_zero_iff min_def)
|
|
266 |
next
|
|
267 |
case False
|
|
268 |
then show ?thesis
|
|
269 |
by (simp add: * bit_signed_iff bit_push_bit_iff Parity.bit_push_bit_iff bit_or_iff bit_take_bit_iff bit_not_iff bit_mask_iff)
|
|
270 |
qed
|
|
271 |
qed
|
|
272 |
|
|
273 |
lemma signed_take_bit_eq:
|
|
274 |
\<open>signed (take_bit n w) = (if n < LENGTH('b) then take_bit n (signed w) else signed w)\<close>
|
|
275 |
for w :: \<open>'b::len word\<close>
|
|
276 |
by (transfer fixing: take_bit; cases \<open>LENGTH('b)\<close>)
|
|
277 |
(auto simp add: signed_take_bit_take_bit take_bit_signed_take_bit take_bit_of_int min_def)
|
|
278 |
|
|
279 |
lemma signed_not_eq:
|
|
280 |
\<open>signed (NOT w) = take_bit LENGTH('b) (NOT (signed w)) OR of_bool (bit (NOT (signed w)) LENGTH('b)) * NOT (mask LENGTH('b))\<close>
|
|
281 |
for w :: \<open>'b::len word\<close>
|
|
282 |
proof (rule bit_eqI)
|
|
283 |
fix n
|
|
284 |
assume \<open>2 ^ n \<noteq> 0\<close>
|
|
285 |
show \<open>bit (signed (NOT w)) n \<longleftrightarrow>
|
|
286 |
bit (take_bit LENGTH('b) (NOT (signed w)) OR
|
|
287 |
of_bool (bit (NOT (signed w)) LENGTH('b)) * NOT (mask LENGTH('b))) n\<close>
|
|
288 |
proof (cases \<open>LENGTH('b) \<le> n\<close>)
|
|
289 |
case False
|
|
290 |
then show ?thesis
|
|
291 |
by (auto simp add: bit_signed_iff bit_not_iff bit_or_iff bit_take_bit_iff bit_mask_iff Bit_Operations.bit_not_iff exp_eq_zero_iff)
|
|
292 |
next
|
|
293 |
case True
|
|
294 |
moreover define q where \<open>q = n - LENGTH('b)\<close>
|
|
295 |
ultimately have \<open>n = LENGTH('b) + q\<close>
|
|
296 |
by simp
|
|
297 |
with \<open>2 ^ n \<noteq> 0\<close> have \<open>2 ^ q \<noteq> 0\<close> \<open>2 ^ LENGTH('b) \<noteq> 0\<close>
|
|
298 |
by (simp_all add: power_add) (use mult_not_zero in blast)+
|
|
299 |
then show ?thesis
|
|
300 |
by (simp add: bit_signed_iff bit_not_iff bit_or_iff bit_take_bit_iff bit_mask_iff Bit_Operations.bit_not_iff exp_eq_zero_iff min_def not_le not_less le_diff_conv le_Suc_eq)
|
|
301 |
qed
|
|
302 |
qed
|
|
303 |
|
|
304 |
lemma signed_and_eq:
|
|
305 |
\<open>signed (v AND w) = signed v AND signed w\<close>
|
|
306 |
for v w :: \<open>'b::len word\<close>
|
|
307 |
by (rule bit_eqI) (simp add: bit_signed_iff bit_and_iff Bit_Operations.bit_and_iff)
|
|
308 |
|
|
309 |
lemma signed_or_eq:
|
|
310 |
\<open>signed (v OR w) = signed v OR signed w\<close>
|
|
311 |
for v w :: \<open>'b::len word\<close>
|
|
312 |
by (rule bit_eqI) (simp add: bit_signed_iff bit_or_iff Bit_Operations.bit_or_iff)
|
|
313 |
|
|
314 |
lemma signed_xor_eq:
|
|
315 |
\<open>signed (v XOR w) = signed v XOR signed w\<close>
|
|
316 |
for v w :: \<open>'b::len word\<close>
|
|
317 |
by (rule bit_eqI) (simp add: bit_signed_iff bit_xor_iff Bit_Operations.bit_xor_iff)
|
|
318 |
|
|
319 |
end
|
|
320 |
|
|
321 |
lemma signed_of_nat [simp]:
|
|
322 |
\<open>signed (word_of_nat n :: 'a::len word) = of_int (signed_take_bit (LENGTH('a) - Suc 0) (int n))\<close>
|
|
323 |
by transfer simp
|
|
324 |
|
|
325 |
lemma signed_of_int [simp]:
|
|
326 |
\<open>signed (word_of_int n :: 'a::len word) = of_int (signed_take_bit (LENGTH('a) - Suc 0) n)\<close>
|
|
327 |
by transfer simp
|
|
328 |
|
|
329 |
|
|
330 |
subsubsection \<open>Important special cases\<close>
|
|
331 |
|
72198
|
332 |
abbreviation unat :: \<open>'a::len word \<Rightarrow> nat\<close>
|
|
333 |
where \<open>unat \<equiv> unsigned\<close>
|
|
334 |
|
|
335 |
abbreviation uint :: \<open>'a::len word \<Rightarrow> int\<close>
|
|
336 |
where \<open>uint \<equiv> unsigned\<close>
|
|
337 |
|
|
338 |
abbreviation sint :: \<open>'a::len word \<Rightarrow> int\<close>
|
|
339 |
where \<open>sint \<equiv> signed\<close>
|
|
340 |
|
|
341 |
abbreviation ucast :: \<open>'a::len word \<Rightarrow> 'b::len word\<close>
|
|
342 |
where \<open>ucast \<equiv> unsigned\<close>
|
72102
|
343 |
|
72198
|
344 |
abbreviation scast :: \<open>'a::len word \<Rightarrow> 'b::len word\<close>
|
|
345 |
where \<open>scast \<equiv> signed\<close>
|
|
346 |
|
|
347 |
context
|
|
348 |
includes lifting_syntax
|
|
349 |
begin
|
|
350 |
|
|
351 |
lemma [transfer_rule]:
|
|
352 |
\<open>(pcr_word ===> (=)) (nat \<circ> take_bit LENGTH('a)) (unat :: 'a::len word \<Rightarrow> nat)\<close>
|
|
353 |
using unsigned.transfer [where ?'a = nat] by simp
|
|
354 |
|
|
355 |
lemma [transfer_rule]:
|
|
356 |
\<open>(pcr_word ===> (=)) (take_bit LENGTH('a)) (uint :: 'a::len word \<Rightarrow> int)\<close>
|
|
357 |
using unsigned.transfer [where ?'a = int] by (simp add: comp_def)
|
72102
|
358 |
|
72198
|
359 |
lemma [transfer_rule]:
|
|
360 |
\<open>(pcr_word ===> (=)) (signed_take_bit (LENGTH('a) - Suc 0)) (sint :: 'a::len word \<Rightarrow> int)\<close>
|
|
361 |
using signed.transfer [where ?'a = int] by simp
|
72102
|
362 |
|
72198
|
363 |
lemma [transfer_rule]:
|
|
364 |
\<open>(pcr_word ===> pcr_word) (take_bit LENGTH('a)) (ucast :: 'a::len word \<Rightarrow> 'b::len word)\<close>
|
|
365 |
proof (rule rel_funI)
|
|
366 |
fix k :: int and w :: \<open>'a word\<close>
|
|
367 |
assume \<open>pcr_word k w\<close>
|
|
368 |
then have \<open>w = word_of_int k\<close>
|
|
369 |
by (simp add: pcr_word_def cr_word_def relcompp_apply)
|
|
370 |
moreover have \<open>pcr_word (take_bit LENGTH('a) k) (ucast (word_of_int k :: 'a word))\<close>
|
|
371 |
by transfer (simp add: pcr_word_def cr_word_def relcompp_apply)
|
|
372 |
ultimately show \<open>pcr_word (take_bit LENGTH('a) k) (ucast w)\<close>
|
|
373 |
by simp
|
|
374 |
qed
|
72102
|
375 |
|
72198
|
376 |
lemma [transfer_rule]:
|
|
377 |
\<open>(pcr_word ===> pcr_word) (signed_take_bit (LENGTH('a) - 1)) (scast :: 'a::len word \<Rightarrow> 'b::len word)\<close>
|
|
378 |
proof (rule rel_funI)
|
|
379 |
fix k :: int and w :: \<open>'a word\<close>
|
|
380 |
assume \<open>pcr_word k w\<close>
|
|
381 |
then have \<open>w = word_of_int k\<close>
|
|
382 |
by (simp add: pcr_word_def cr_word_def relcompp_apply)
|
|
383 |
moreover have \<open>pcr_word (signed_take_bit (LENGTH('a) - 1) k) (scast (word_of_int k :: 'a word))\<close>
|
|
384 |
by transfer (simp add: pcr_word_def cr_word_def relcompp_apply)
|
|
385 |
ultimately show \<open>pcr_word (signed_take_bit (LENGTH('a) - 1) k) (scast w)\<close>
|
|
386 |
by simp
|
|
387 |
qed
|
|
388 |
|
|
389 |
end
|
72102
|
390 |
|
72198
|
391 |
lemma of_nat_unat [simp]:
|
|
392 |
\<open>of_nat (unat w) = unsigned w\<close>
|
72102
|
393 |
by transfer simp
|
|
394 |
|
72198
|
395 |
lemma of_int_uint [simp]:
|
|
396 |
\<open>of_int (uint w) = unsigned w\<close>
|
72102
|
397 |
by transfer simp
|
|
398 |
|
72227
|
399 |
lemma unat_div_distrib:
|
|
400 |
\<open>unat (v div w) = unat v div unat w\<close>
|
|
401 |
proof transfer
|
|
402 |
fix k l
|
|
403 |
have \<open>nat (take_bit LENGTH('a) k) div nat (take_bit LENGTH('a) l) \<le> nat (take_bit LENGTH('a) k)\<close>
|
|
404 |
by (rule div_le_dividend)
|
|
405 |
also have \<open>nat (take_bit LENGTH('a) k) < 2 ^ LENGTH('a)\<close>
|
|
406 |
by (simp add: nat_less_iff take_bit_int_less_exp)
|
|
407 |
finally show \<open>(nat \<circ> take_bit LENGTH('a)) (take_bit LENGTH('a) k div take_bit LENGTH('a) l) =
|
|
408 |
(nat \<circ> take_bit LENGTH('a)) k div (nat \<circ> take_bit LENGTH('a)) l\<close>
|
|
409 |
by (simp add: nat_take_bit_eq div_int_pos_iff nat_div_distrib take_bit_eq_self)
|
|
410 |
qed
|
72102
|
411 |
|
72227
|
412 |
lemma unat_mod_distrib:
|
|
413 |
\<open>unat (v mod w) = unat v mod unat w\<close>
|
|
414 |
proof transfer
|
|
415 |
fix k l
|
|
416 |
have \<open>nat (take_bit LENGTH('a) k) mod nat (take_bit LENGTH('a) l) \<le> nat (take_bit LENGTH('a) k)\<close>
|
|
417 |
by (rule mod_less_eq_dividend)
|
|
418 |
also have \<open>nat (take_bit LENGTH('a) k) < 2 ^ LENGTH('a)\<close>
|
|
419 |
by (simp add: nat_less_iff take_bit_int_less_exp)
|
|
420 |
finally show \<open>(nat \<circ> take_bit LENGTH('a)) (take_bit LENGTH('a) k mod take_bit LENGTH('a) l) =
|
|
421 |
(nat \<circ> take_bit LENGTH('a)) k mod (nat \<circ> take_bit LENGTH('a)) l\<close>
|
|
422 |
by (simp add: nat_take_bit_eq mod_int_pos_iff less_le nat_mod_distrib take_bit_eq_self)
|
|
423 |
qed
|
72102
|
424 |
|
72227
|
425 |
lemma uint_div_distrib:
|
|
426 |
\<open>uint (v div w) = uint v div uint w\<close>
|
|
427 |
proof -
|
|
428 |
have \<open>int (unat (v div w)) = int (unat v div unat w)\<close>
|
|
429 |
by (simp add: unat_div_distrib)
|
|
430 |
then show ?thesis
|
|
431 |
by (simp add: of_nat_div)
|
|
432 |
qed
|
72102
|
433 |
|
72227
|
434 |
lemma uint_mod_distrib:
|
|
435 |
\<open>uint (v mod w) = uint v mod uint w\<close>
|
|
436 |
proof -
|
|
437 |
have \<open>int (unat (v mod w)) = int (unat v mod unat w)\<close>
|
|
438 |
by (simp add: unat_mod_distrib)
|
|
439 |
then show ?thesis
|
|
440 |
by (simp add: of_nat_mod)
|
|
441 |
qed
|
72102
|
442 |
|
72198
|
443 |
lemma of_int_sint [simp]:
|
|
444 |
\<open>of_int (sint a) = signed a\<close>
|
|
445 |
by transfer (simp_all add: take_bit_signed_take_bit)
|
72102
|
446 |
|
72227
|
447 |
lemma sint_not_eq:
|
|
448 |
\<open>sint (NOT w) = signed_take_bit LENGTH('a) (NOT (sint w))\<close>
|
|
449 |
for w :: \<open>'a::len word\<close>
|
|
450 |
by (simp add: signed_not_eq signed_take_bit_unfold)
|
|
451 |
|
|
452 |
lemma sint_push_bit_eq:
|
|
453 |
\<open>signed (push_bit n w) = signed_take_bit (LENGTH('a) - 1) (push_bit n (signed w))\<close>
|
|
454 |
for w :: \<open>'a::len word\<close>
|
|
455 |
by (transfer fixing: n; cases \<open>LENGTH('a)\<close>)
|
|
456 |
(auto simp add: signed_take_bit_def bit_concat_bit_iff bit_push_bit_iff bit_take_bit_iff bit_or_iff le_diff_conv2,
|
|
457 |
auto simp add: take_bit_push_bit not_less concat_bit_eq_iff take_bit_concat_bit_eq le_diff_conv2)
|
|
458 |
|
72198
|
459 |
lemma sint_greater_eq:
|
|
460 |
\<open>- (2 ^ (LENGTH('a) - 1)) \<le> sint w\<close> for w :: \<open>'a::len word\<close>
|
|
461 |
proof (cases \<open>bit w (LENGTH('a) - 1)\<close>)
|
|
462 |
case True
|
|
463 |
then show ?thesis
|
|
464 |
by transfer (simp add: signed_take_bit_eq_or minus_exp_eq_not_mask or_greater_eq ac_simps)
|
|
465 |
next
|
|
466 |
have *: \<open>- (2 ^ (LENGTH('a) - Suc 0)) \<le> (0::int)\<close>
|
|
467 |
by simp
|
|
468 |
case False
|
|
469 |
then show ?thesis
|
|
470 |
by transfer (auto simp add: signed_take_bit_eq intro: order_trans *)
|
|
471 |
qed
|
72102
|
472 |
|
72198
|
473 |
lemma sint_less:
|
|
474 |
\<open>sint w < 2 ^ (LENGTH('a) - 1)\<close> for w :: \<open>'a::len word\<close>
|
|
475 |
by (cases \<open>bit w (LENGTH('a) - 1)\<close>; transfer)
|
72227
|
476 |
(simp_all add: signed_take_bit_eq signed_take_bit_unfold take_bit_int_less_exp not_eq_complement mask_eq_exp_minus_1 OR_upper)
|
72102
|
477 |
|
|
478 |
end
|