src/HOL/Word/Word.thy
author haftmann
Wed, 30 Jun 2010 17:12:38 +0200
changeset 37660 56e3520b68b2
parent 36899 bcd6fce5bf06
child 37667 41acc0fa6b6c
permissions -rw-r--r--
one unified Word theory
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
29628
d9294387ab0e entry point for Word library now named Word
haftmann
parents: 27137
diff changeset
     1
(*  Title:      HOL/Word/Word.thy
37660
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
     2
    Author: Jeremy Dawson and Gerwin Klein, NICTA
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
     3
*)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
     4
37660
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
     5
header {* A type of finite bit strings *}
24350
4d74f37c6367 headers for document generation
huffman
parents: 24333
diff changeset
     6
29628
d9294387ab0e entry point for Word library now named Word
haftmann
parents: 27137
diff changeset
     7
theory Word
37660
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
     8
imports Type_Length Misc_Typedef Boolean_Algebra Bool_List_Representation
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
     9
uses ("~~/src/HOL/Tools/SMT/smt_word.ML")
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    10
begin
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    11
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    12
text {* see @{text "Examples/WordExamples.thy"} for examples *}
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    13
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    14
subsection {* Type definition *}
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    15
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    16
typedef (open word) 'a word = "{(0::int) ..< 2^len_of TYPE('a::len0)}"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    17
  morphisms uint Abs_word by auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    18
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    19
definition word_of_int :: "int \<Rightarrow> 'a\<Colon>len0 word" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    20
  -- {* representation of words using unsigned or signed bins, 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    21
        only difference in these is the type class *}
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    22
  "word_of_int w = Abs_word (bintrunc (len_of TYPE ('a)) w)" 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    23
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    24
lemma uint_word_of_int [code]: "uint (word_of_int w \<Colon> 'a\<Colon>len0 word) = w mod 2 ^ len_of TYPE('a)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    25
  by (auto simp add: word_of_int_def bintrunc_mod2p intro: Abs_word_inverse)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    26
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    27
code_datatype word_of_int
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    28
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    29
notation fcomp (infixl "o>" 60)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    30
notation scomp (infixl "o\<rightarrow>" 60)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    31
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    32
instantiation word :: ("{len0, typerep}") random
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    33
begin
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    34
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    35
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    36
  "random_word i = Random.range (max i (2 ^ len_of TYPE('a))) o\<rightarrow> (\<lambda>k. Pair (
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    37
     let j = word_of_int (Code_Numeral.int_of k) :: 'a word
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    38
     in (j, \<lambda>_::unit. Code_Evaluation.term_of j)))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    39
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    40
instance ..
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    41
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    42
end
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    43
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    44
no_notation fcomp (infixl "o>" 60)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    45
no_notation scomp (infixl "o\<rightarrow>" 60)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    46
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    47
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    48
subsection {* Type conversions and casting *}
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    49
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    50
definition sint :: "'a :: len word => int" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    51
  -- {* treats the most-significant-bit as a sign bit *}
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    52
  sint_uint: "sint w = sbintrunc (len_of TYPE ('a) - 1) (uint w)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    53
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    54
definition unat :: "'a :: len0 word => nat" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    55
  "unat w = nat (uint w)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    56
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    57
definition uints :: "nat => int set" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    58
  -- "the sets of integers representing the words"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    59
  "uints n = range (bintrunc n)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    60
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    61
definition sints :: "nat => int set" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    62
  "sints n = range (sbintrunc (n - 1))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    63
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    64
definition unats :: "nat => nat set" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    65
  "unats n = {i. i < 2 ^ n}"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    66
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    67
definition norm_sint :: "nat => int => int" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    68
  "norm_sint n w = (w + 2 ^ (n - 1)) mod 2 ^ n - 2 ^ (n - 1)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    69
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    70
definition scast :: "'a :: len word => 'b :: len word" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    71
  -- "cast a word to a different length"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    72
  "scast w = word_of_int (sint w)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    73
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    74
definition ucast :: "'a :: len0 word => 'b :: len0 word" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    75
  "ucast w = word_of_int (uint w)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    76
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    77
instantiation word :: (len0) size
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    78
begin
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    79
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    80
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    81
  word_size: "size (w :: 'a word) = len_of TYPE('a)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    82
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    83
instance ..
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    84
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    85
end
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    86
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    87
definition source_size :: "('a :: len0 word => 'b) => nat" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    88
  -- "whether a cast (or other) function is to a longer or shorter length"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    89
  "source_size c = (let arb = undefined ; x = c arb in size arb)"  
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    90
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    91
definition target_size :: "('a => 'b :: len0 word) => nat" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    92
  "target_size c = size (c undefined)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    93
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    94
definition is_up :: "('a :: len0 word => 'b :: len0 word) => bool" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    95
  "is_up c \<longleftrightarrow> source_size c <= target_size c"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    96
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    97
definition is_down :: "('a :: len0 word => 'b :: len0 word) => bool" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    98
  "is_down c \<longleftrightarrow> target_size c <= source_size c"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
    99
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   100
definition of_bl :: "bool list => 'a :: len0 word" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   101
  "of_bl bl = word_of_int (bl_to_bin bl)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   102
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   103
definition to_bl :: "'a :: len0 word => bool list" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   104
  "to_bl w = bin_to_bl (len_of TYPE ('a)) (uint w)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   105
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   106
definition word_reverse :: "'a :: len0 word => 'a word" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   107
  "word_reverse w = of_bl (rev (to_bl w))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   108
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   109
definition word_int_case :: "(int => 'b) => ('a :: len0 word) => 'b" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   110
  "word_int_case f w = f (uint w)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   111
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   112
syntax
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   113
  of_int :: "int => 'a"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   114
translations
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   115
  "case x of CONST of_int y => b" == "CONST word_int_case (%y. b) x"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   116
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   117
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   118
subsection  "Arithmetic operations"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   119
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   120
instantiation word :: (len0) "{number, uminus, minus, plus, one, zero, times, Divides.div, ord, bit}"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   121
begin
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   122
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   123
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   124
  word_0_wi: "0 = word_of_int 0"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   125
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   126
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   127
  word_1_wi: "1 = word_of_int 1"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   128
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   129
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   130
  word_add_def: "a + b = word_of_int (uint a + uint b)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   131
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   132
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   133
  word_sub_wi: "a - b = word_of_int (uint a - uint b)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   134
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   135
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   136
  word_minus_def: "- a = word_of_int (- uint a)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   137
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   138
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   139
  word_mult_def: "a * b = word_of_int (uint a * uint b)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   140
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   141
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   142
  word_div_def: "a div b = word_of_int (uint a div uint b)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   143
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   144
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   145
  word_mod_def: "a mod b = word_of_int (uint a mod uint b)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   146
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   147
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   148
  word_number_of_def: "number_of w = word_of_int w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   149
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   150
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   151
  word_le_def: "a \<le> b \<longleftrightarrow> uint a \<le> uint b"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   152
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   153
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   154
  word_less_def: "x < y \<longleftrightarrow> x \<le> y \<and> x \<noteq> (y \<Colon> 'a word)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   155
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   156
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   157
  word_and_def: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   158
  "(a::'a word) AND b = word_of_int (uint a AND uint b)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   159
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   160
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   161
  word_or_def:  
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   162
  "(a::'a word) OR b = word_of_int (uint a OR uint b)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   163
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   164
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   165
  word_xor_def: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   166
  "(a::'a word) XOR b = word_of_int (uint a XOR uint b)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   167
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   168
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   169
  word_not_def: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   170
  "NOT (a::'a word) = word_of_int (NOT (uint a))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   171
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   172
instance ..
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   173
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   174
end
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   175
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   176
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   177
  word_succ :: "'a :: len0 word => 'a word"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   178
where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   179
  "word_succ a = word_of_int (Int.succ (uint a))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   180
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   181
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   182
  word_pred :: "'a :: len0 word => 'a word"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   183
where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   184
  "word_pred a = word_of_int (Int.pred (uint a))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   185
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   186
definition udvd :: "'a::len word => 'a::len word => bool" (infixl "udvd" 50) where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   187
  "a udvd b == EX n>=0. uint b = n * uint a"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   188
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   189
definition word_sle :: "'a :: len word => 'a word => bool" ("(_/ <=s _)" [50, 51] 50) where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   190
  "a <=s b == sint a <= sint b"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   191
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   192
definition word_sless :: "'a :: len word => 'a word => bool" ("(_/ <s _)" [50, 51] 50) where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   193
  "(x <s y) == (x <=s y & x ~= y)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   194
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   195
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   196
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   197
subsection "Bit-wise operations"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   198
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   199
instantiation word :: (len0) bits
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   200
begin
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   201
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   202
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   203
  word_test_bit_def: "test_bit a = bin_nth (uint a)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   204
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   205
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   206
  word_set_bit_def: "set_bit a n x =
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   207
   word_of_int (bin_sc n (If x 1 0) (uint a))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   208
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   209
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   210
  word_set_bits_def: "(BITS n. f n) = of_bl (bl_of_nth (len_of TYPE ('a)) f)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   211
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   212
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   213
  word_lsb_def: "lsb a \<longleftrightarrow> bin_last (uint a) = 1"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   214
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   215
definition shiftl1 :: "'a word \<Rightarrow> 'a word" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   216
  "shiftl1 w = word_of_int (uint w BIT 0)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   217
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   218
definition shiftr1 :: "'a word \<Rightarrow> 'a word" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   219
  -- "shift right as unsigned or as signed, ie logical or arithmetic"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   220
  "shiftr1 w = word_of_int (bin_rest (uint w))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   221
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   222
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   223
  shiftl_def: "w << n = (shiftl1 ^^ n) w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   224
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   225
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   226
  shiftr_def: "w >> n = (shiftr1 ^^ n) w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   227
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   228
instance ..
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   229
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   230
end
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   231
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   232
instantiation word :: (len) bitss
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   233
begin
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   234
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   235
definition
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   236
  word_msb_def: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   237
  "msb a \<longleftrightarrow> bin_sign (sint a) = Int.Min"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   238
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   239
instance ..
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   240
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   241
end
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   242
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   243
definition setBit :: "'a :: len0 word => nat => 'a word" where 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   244
  "setBit w n == set_bit w n True"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   245
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   246
definition clearBit :: "'a :: len0 word => nat => 'a word" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   247
  "clearBit w n == set_bit w n False"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   248
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   249
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   250
subsection "Shift operations"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   251
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   252
definition sshiftr1 :: "'a :: len word => 'a word" where 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   253
  "sshiftr1 w == word_of_int (bin_rest (sint w))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   254
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   255
definition bshiftr1 :: "bool => 'a :: len word => 'a word" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   256
  "bshiftr1 b w == of_bl (b # butlast (to_bl w))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   257
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   258
definition sshiftr :: "'a :: len word => nat => 'a word" (infixl ">>>" 55) where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   259
  "w >>> n == (sshiftr1 ^^ n) w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   260
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   261
definition mask :: "nat => 'a::len word" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   262
  "mask n == (1 << n) - 1"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   263
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   264
definition revcast :: "'a :: len0 word => 'b :: len0 word" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   265
  "revcast w ==  of_bl (takefill False (len_of TYPE('b)) (to_bl w))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   266
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   267
definition slice1 :: "nat => 'a :: len0 word => 'b :: len0 word" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   268
  "slice1 n w == of_bl (takefill False n (to_bl w))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   269
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   270
definition slice :: "nat => 'a :: len0 word => 'b :: len0 word" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   271
  "slice n w == slice1 (size w - n) w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   272
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   273
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   274
subsection "Rotation"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   275
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   276
definition rotater1 :: "'a list => 'a list" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   277
  "rotater1 ys == 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   278
    case ys of [] => [] | x # xs => last ys # butlast ys"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   279
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   280
definition rotater :: "nat => 'a list => 'a list" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   281
  "rotater n == rotater1 ^^ n"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   282
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   283
definition word_rotr :: "nat => 'a :: len0 word => 'a :: len0 word" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   284
  "word_rotr n w == of_bl (rotater n (to_bl w))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   285
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   286
definition word_rotl :: "nat => 'a :: len0 word => 'a :: len0 word" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   287
  "word_rotl n w == of_bl (rotate n (to_bl w))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   288
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   289
definition word_roti :: "int => 'a :: len0 word => 'a :: len0 word" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   290
  "word_roti i w == if i >= 0 then word_rotr (nat i) w
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   291
                    else word_rotl (nat (- i)) w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   292
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   293
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   294
subsection "Split and cat operations"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   295
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   296
definition word_cat :: "'a :: len0 word => 'b :: len0 word => 'c :: len0 word" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   297
  "word_cat a b == word_of_int (bin_cat (uint a) (len_of TYPE ('b)) (uint b))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   298
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   299
definition word_split :: "'a :: len0 word => ('b :: len0 word) * ('c :: len0 word)" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   300
  "word_split a == 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   301
   case bin_split (len_of TYPE ('c)) (uint a) of 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   302
     (u, v) => (word_of_int u, word_of_int v)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   303
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   304
definition word_rcat :: "'a :: len0 word list => 'b :: len0 word" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   305
  "word_rcat ws == 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   306
  word_of_int (bin_rcat (len_of TYPE ('a)) (map uint ws))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   307
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   308
definition word_rsplit :: "'a :: len0 word => 'b :: len word list" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   309
  "word_rsplit w == 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   310
  map word_of_int (bin_rsplit (len_of TYPE ('b)) (len_of TYPE ('a), uint w))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   311
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   312
definition max_word :: "'a::len word" -- "Largest representable machine integer." where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   313
  "max_word \<equiv> word_of_int (2 ^ len_of TYPE('a) - 1)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   314
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   315
primrec of_bool :: "bool \<Rightarrow> 'a::len word" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   316
  "of_bool False = 0"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   317
| "of_bool True = 1"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   318
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   319
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   320
lemmas of_nth_def = word_set_bits_def
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   321
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   322
lemmas word_size_gt_0 [iff] = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   323
  xtr1 [OF word_size len_gt_0, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   324
lemmas lens_gt_0 = word_size_gt_0 len_gt_0
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   325
lemmas lens_not_0 [iff] = lens_gt_0 [THEN gr_implies_not0, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   326
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   327
lemma uints_num: "uints n = {i. 0 \<le> i \<and> i < 2 ^ n}"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   328
  by (simp add: uints_def range_bintrunc)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   329
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   330
lemma sints_num: "sints n = {i. - (2 ^ (n - 1)) \<le> i \<and> i < 2 ^ (n - 1)}"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   331
  by (simp add: sints_def range_sbintrunc)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   332
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   333
lemmas atLeastLessThan_alt = atLeastLessThan_def [unfolded 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   334
  atLeast_def lessThan_def Collect_conj_eq [symmetric]]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   335
  
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   336
lemma mod_in_reps: "m > 0 ==> y mod m : {0::int ..< m}"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   337
  unfolding atLeastLessThan_alt by auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   338
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   339
lemma 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   340
  uint_0:"0 <= uint x" and 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   341
  uint_lt: "uint (x::'a::len0 word) < 2 ^ len_of TYPE('a)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   342
  by (auto simp: uint [simplified])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   343
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   344
lemma uint_mod_same:
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   345
  "uint x mod 2 ^ len_of TYPE('a) = uint (x::'a::len0 word)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   346
  by (simp add: int_mod_eq uint_lt uint_0)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   347
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   348
lemma td_ext_uint: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   349
  "td_ext (uint :: 'a word => int) word_of_int (uints (len_of TYPE('a::len0))) 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   350
    (%w::int. w mod 2 ^ len_of TYPE('a))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   351
  apply (unfold td_ext_def')
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   352
  apply (simp add: uints_num word_of_int_def bintrunc_mod2p)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   353
  apply (simp add: uint_mod_same uint_0 uint_lt
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   354
                   word.uint_inverse word.Abs_word_inverse int_mod_lem)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   355
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   356
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   357
lemmas int_word_uint = td_ext_uint [THEN td_ext.eq_norm, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   358
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   359
interpretation word_uint:
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   360
  td_ext "uint::'a::len0 word \<Rightarrow> int" 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   361
         word_of_int 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   362
         "uints (len_of TYPE('a::len0))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   363
         "\<lambda>w. w mod 2 ^ len_of TYPE('a::len0)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   364
  by (rule td_ext_uint)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   365
  
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   366
lemmas td_uint = word_uint.td_thm
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   367
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   368
lemmas td_ext_ubin = td_ext_uint 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   369
  [simplified len_gt_0 no_bintr_alt1 [symmetric]]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   370
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   371
interpretation word_ubin:
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   372
  td_ext "uint::'a::len0 word \<Rightarrow> int" 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   373
         word_of_int 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   374
         "uints (len_of TYPE('a::len0))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   375
         "bintrunc (len_of TYPE('a::len0))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   376
  by (rule td_ext_ubin)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   377
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   378
lemma sint_sbintrunc': 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   379
  "sint (word_of_int bin :: 'a word) = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   380
    (sbintrunc (len_of TYPE ('a :: len) - 1) bin)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   381
  unfolding sint_uint 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   382
  by (auto simp: word_ubin.eq_norm sbintrunc_bintrunc_lt)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   383
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   384
lemma uint_sint: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   385
  "uint w = bintrunc (len_of TYPE('a)) (sint (w :: 'a :: len word))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   386
  unfolding sint_uint by (auto simp: bintrunc_sbintrunc_le)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   387
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   388
lemma bintr_uint': 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   389
  "n >= size w ==> bintrunc n (uint w) = uint w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   390
  apply (unfold word_size)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   391
  apply (subst word_ubin.norm_Rep [symmetric]) 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   392
  apply (simp only: bintrunc_bintrunc_min word_size)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   393
  apply (simp add: min_max.inf_absorb2)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   394
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   395
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   396
lemma wi_bintr': 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   397
  "wb = word_of_int bin ==> n >= size wb ==> 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   398
    word_of_int (bintrunc n bin) = wb"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   399
  unfolding word_size
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   400
  by (clarsimp simp add: word_ubin.norm_eq_iff [symmetric] min_max.inf_absorb1)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   401
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   402
lemmas bintr_uint = bintr_uint' [unfolded word_size]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   403
lemmas wi_bintr = wi_bintr' [unfolded word_size]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   404
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   405
lemma td_ext_sbin: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   406
  "td_ext (sint :: 'a word => int) word_of_int (sints (len_of TYPE('a::len))) 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   407
    (sbintrunc (len_of TYPE('a) - 1))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   408
  apply (unfold td_ext_def' sint_uint)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   409
  apply (simp add : word_ubin.eq_norm)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   410
  apply (cases "len_of TYPE('a)")
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   411
   apply (auto simp add : sints_def)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   412
  apply (rule sym [THEN trans])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   413
  apply (rule word_ubin.Abs_norm)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   414
  apply (simp only: bintrunc_sbintrunc)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   415
  apply (drule sym)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   416
  apply simp
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   417
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   418
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   419
lemmas td_ext_sint = td_ext_sbin 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   420
  [simplified len_gt_0 no_sbintr_alt2 Suc_pred' [symmetric]]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   421
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   422
(* We do sint before sbin, before sint is the user version
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   423
   and interpretations do not produce thm duplicates. I.e. 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   424
   we get the name word_sint.Rep_eqD, but not word_sbin.Req_eqD,
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   425
   because the latter is the same thm as the former *)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   426
interpretation word_sint:
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   427
  td_ext "sint ::'a::len word => int" 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   428
          word_of_int 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   429
          "sints (len_of TYPE('a::len))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   430
          "%w. (w + 2^(len_of TYPE('a::len) - 1)) mod 2^len_of TYPE('a::len) -
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   431
               2 ^ (len_of TYPE('a::len) - 1)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   432
  by (rule td_ext_sint)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   433
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   434
interpretation word_sbin:
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   435
  td_ext "sint ::'a::len word => int" 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   436
          word_of_int 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   437
          "sints (len_of TYPE('a::len))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   438
          "sbintrunc (len_of TYPE('a::len) - 1)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   439
  by (rule td_ext_sbin)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   440
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   441
lemmas int_word_sint = td_ext_sint [THEN td_ext.eq_norm, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   442
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   443
lemmas td_sint = word_sint.td
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   444
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   445
lemma word_number_of_alt: "number_of b == word_of_int (number_of b)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   446
  unfolding word_number_of_def by (simp add: number_of_eq)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   447
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   448
lemma word_no_wi: "number_of = word_of_int"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   449
  by (auto simp: word_number_of_def intro: ext)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   450
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   451
lemma to_bl_def': 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   452
  "(to_bl :: 'a :: len0 word => bool list) =
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   453
    bin_to_bl (len_of TYPE('a)) o uint"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   454
  by (auto simp: to_bl_def intro: ext)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   455
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   456
lemmas word_reverse_no_def [simp] = word_reverse_def [of "number_of w", standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   457
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   458
lemmas uints_mod = uints_def [unfolded no_bintr_alt1]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   459
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   460
lemma uint_bintrunc: "uint (number_of bin :: 'a word) = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   461
    number_of (bintrunc (len_of TYPE ('a :: len0)) bin)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   462
  unfolding word_number_of_def number_of_eq
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   463
  by (auto intro: word_ubin.eq_norm) 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   464
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   465
lemma sint_sbintrunc: "sint (number_of bin :: 'a word) = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   466
    number_of (sbintrunc (len_of TYPE ('a :: len) - 1) bin)" 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   467
  unfolding word_number_of_def number_of_eq
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   468
  by (subst word_sbin.eq_norm) simp
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   469
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   470
lemma unat_bintrunc: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   471
  "unat (number_of bin :: 'a :: len0 word) =
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   472
    number_of (bintrunc (len_of TYPE('a)) bin)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   473
  unfolding unat_def nat_number_of_def 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   474
  by (simp only: uint_bintrunc)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   475
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   476
(* WARNING - these may not always be helpful *)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   477
declare 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   478
  uint_bintrunc [simp] 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   479
  sint_sbintrunc [simp] 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   480
  unat_bintrunc [simp]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   481
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   482
lemma size_0_eq: "size (w :: 'a :: len0 word) = 0 ==> v = w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   483
  apply (unfold word_size)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   484
  apply (rule word_uint.Rep_eqD)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   485
  apply (rule box_equals)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   486
    defer
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   487
    apply (rule word_ubin.norm_Rep)+
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   488
  apply simp
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   489
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   490
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   491
lemmas uint_lem = word_uint.Rep [unfolded uints_num mem_Collect_eq]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   492
lemmas sint_lem = word_sint.Rep [unfolded sints_num mem_Collect_eq]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   493
lemmas uint_ge_0 [iff] = uint_lem [THEN conjunct1, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   494
lemmas uint_lt2p [iff] = uint_lem [THEN conjunct2, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   495
lemmas sint_ge = sint_lem [THEN conjunct1, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   496
lemmas sint_lt = sint_lem [THEN conjunct2, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   497
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   498
lemma sign_uint_Pls [simp]: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   499
  "bin_sign (uint x) = Int.Pls"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   500
  by (simp add: sign_Pls_ge_0 number_of_eq)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   501
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   502
lemmas uint_m2p_neg = iffD2 [OF diff_less_0_iff_less uint_lt2p, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   503
lemmas uint_m2p_not_non_neg = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   504
  iffD2 [OF linorder_not_le uint_m2p_neg, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   505
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   506
lemma lt2p_lem:
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   507
  "len_of TYPE('a) <= n ==> uint (w :: 'a :: len0 word) < 2 ^ n"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   508
  by (rule xtr8 [OF _ uint_lt2p]) simp
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   509
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   510
lemmas uint_le_0_iff [simp] = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   511
  uint_ge_0 [THEN leD, THEN linorder_antisym_conv1, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   512
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   513
lemma uint_nat: "uint w == int (unat w)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   514
  unfolding unat_def by auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   515
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   516
lemma uint_number_of:
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   517
  "uint (number_of b :: 'a :: len0 word) = number_of b mod 2 ^ len_of TYPE('a)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   518
  unfolding word_number_of_alt
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   519
  by (simp only: int_word_uint)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   520
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   521
lemma unat_number_of: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   522
  "bin_sign b = Int.Pls ==> 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   523
  unat (number_of b::'a::len0 word) = number_of b mod 2 ^ len_of TYPE ('a)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   524
  apply (unfold unat_def)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   525
  apply (clarsimp simp only: uint_number_of)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   526
  apply (rule nat_mod_distrib [THEN trans])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   527
    apply (erule sign_Pls_ge_0 [THEN iffD1])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   528
   apply (simp_all add: nat_power_eq)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   529
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   530
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   531
lemma sint_number_of: "sint (number_of b :: 'a :: len word) = (number_of b + 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   532
    2 ^ (len_of TYPE('a) - 1)) mod 2 ^ len_of TYPE('a) -
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   533
    2 ^ (len_of TYPE('a) - 1)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   534
  unfolding word_number_of_alt by (rule int_word_sint)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   535
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   536
lemma word_of_int_bin [simp] : 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   537
  "(word_of_int (number_of bin) :: 'a :: len0 word) = (number_of bin)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   538
  unfolding word_number_of_alt by auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   539
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   540
lemma word_int_case_wi: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   541
  "word_int_case f (word_of_int i :: 'b word) = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   542
    f (i mod 2 ^ len_of TYPE('b::len0))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   543
  unfolding word_int_case_def by (simp add: word_uint.eq_norm)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   544
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   545
lemma word_int_split: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   546
  "P (word_int_case f x) = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   547
    (ALL i. x = (word_of_int i :: 'b :: len0 word) & 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   548
      0 <= i & i < 2 ^ len_of TYPE('b) --> P (f i))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   549
  unfolding word_int_case_def
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   550
  by (auto simp: word_uint.eq_norm int_mod_eq')
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   551
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   552
lemma word_int_split_asm: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   553
  "P (word_int_case f x) = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   554
    (~ (EX n. x = (word_of_int n :: 'b::len0 word) &
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   555
      0 <= n & n < 2 ^ len_of TYPE('b::len0) & ~ P (f n)))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   556
  unfolding word_int_case_def
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   557
  by (auto simp: word_uint.eq_norm int_mod_eq')
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   558
  
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   559
lemmas uint_range' =
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   560
  word_uint.Rep [unfolded uints_num mem_Collect_eq, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   561
lemmas sint_range' = word_sint.Rep [unfolded One_nat_def
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   562
  sints_num mem_Collect_eq, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   563
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   564
lemma uint_range_size: "0 <= uint w & uint w < 2 ^ size w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   565
  unfolding word_size by (rule uint_range')
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   566
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   567
lemma sint_range_size:
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   568
  "- (2 ^ (size w - Suc 0)) <= sint w & sint w < 2 ^ (size w - Suc 0)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   569
  unfolding word_size by (rule sint_range')
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   570
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   571
lemmas sint_above_size = sint_range_size
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   572
  [THEN conjunct2, THEN [2] xtr8, folded One_nat_def, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   573
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   574
lemmas sint_below_size = sint_range_size
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   575
  [THEN conjunct1, THEN [2] order_trans, folded One_nat_def, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   576
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   577
lemma test_bit_eq_iff: "(test_bit (u::'a::len0 word) = test_bit v) = (u = v)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   578
  unfolding word_test_bit_def by (simp add: bin_nth_eq_iff)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   579
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   580
lemma test_bit_size [rule_format] : "(w::'a::len0 word) !! n --> n < size w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   581
  apply (unfold word_test_bit_def)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   582
  apply (subst word_ubin.norm_Rep [symmetric])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   583
  apply (simp only: nth_bintr word_size)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   584
  apply fast
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   585
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   586
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   587
lemma word_eqI [rule_format] : 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   588
  fixes u :: "'a::len0 word"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   589
  shows "(ALL n. n < size u --> u !! n = v !! n) ==> u = v"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   590
  apply (rule test_bit_eq_iff [THEN iffD1])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   591
  apply (rule ext)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   592
  apply (erule allE)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   593
  apply (erule impCE)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   594
   prefer 2
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   595
   apply assumption
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   596
  apply (auto dest!: test_bit_size simp add: word_size)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   597
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   598
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   599
lemmas word_eqD = test_bit_eq_iff [THEN iffD2, THEN fun_cong, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   600
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   601
lemma test_bit_bin': "w !! n = (n < size w & bin_nth (uint w) n)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   602
  unfolding word_test_bit_def word_size
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   603
  by (simp add: nth_bintr [symmetric])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   604
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   605
lemmas test_bit_bin = test_bit_bin' [unfolded word_size]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   606
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   607
lemma bin_nth_uint_imp': "bin_nth (uint w) n --> n < size w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   608
  apply (unfold word_size)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   609
  apply (rule impI)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   610
  apply (rule nth_bintr [THEN iffD1, THEN conjunct1])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   611
  apply (subst word_ubin.norm_Rep)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   612
  apply assumption
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   613
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   614
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   615
lemma bin_nth_sint': 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   616
  "n >= size w --> bin_nth (sint w) n = bin_nth (sint w) (size w - 1)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   617
  apply (rule impI)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   618
  apply (subst word_sbin.norm_Rep [symmetric])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   619
  apply (simp add : nth_sbintr word_size)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   620
  apply auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   621
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   622
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   623
lemmas bin_nth_uint_imp = bin_nth_uint_imp' [rule_format, unfolded word_size]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   624
lemmas bin_nth_sint = bin_nth_sint' [rule_format, unfolded word_size]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   625
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   626
(* type definitions theorem for in terms of equivalent bool list *)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   627
lemma td_bl: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   628
  "type_definition (to_bl :: 'a::len0 word => bool list) 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   629
                   of_bl  
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   630
                   {bl. length bl = len_of TYPE('a)}"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   631
  apply (unfold type_definition_def of_bl_def to_bl_def)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   632
  apply (simp add: word_ubin.eq_norm)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   633
  apply safe
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   634
  apply (drule sym)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   635
  apply simp
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   636
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   637
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   638
interpretation word_bl:
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   639
  type_definition "to_bl :: 'a::len0 word => bool list"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   640
                  of_bl  
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   641
                  "{bl. length bl = len_of TYPE('a::len0)}"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   642
  by (rule td_bl)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   643
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   644
lemma word_size_bl: "size w == size (to_bl w)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   645
  unfolding word_size by auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   646
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   647
lemma to_bl_use_of_bl:
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   648
  "(to_bl w = bl) = (w = of_bl bl \<and> length bl = length (to_bl w))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   649
  by (fastsimp elim!: word_bl.Abs_inverse [simplified])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   650
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   651
lemma to_bl_word_rev: "to_bl (word_reverse w) = rev (to_bl w)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   652
  unfolding word_reverse_def by (simp add: word_bl.Abs_inverse)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   653
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   654
lemma word_rev_rev [simp] : "word_reverse (word_reverse w) = w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   655
  unfolding word_reverse_def by (simp add : word_bl.Abs_inverse)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   656
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   657
lemma word_rev_gal: "word_reverse w = u ==> word_reverse u = w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   658
  by auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   659
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   660
lemmas word_rev_gal' = sym [THEN word_rev_gal, symmetric, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   661
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   662
lemmas length_bl_gt_0 [iff] = xtr1 [OF word_bl.Rep' len_gt_0, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   663
lemmas bl_not_Nil [iff] = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   664
  length_bl_gt_0 [THEN length_greater_0_conv [THEN iffD1], standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   665
lemmas length_bl_neq_0 [iff] = length_bl_gt_0 [THEN gr_implies_not0]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   666
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   667
lemma hd_bl_sign_sint: "hd (to_bl w) = (bin_sign (sint w) = Int.Min)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   668
  apply (unfold to_bl_def sint_uint)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   669
  apply (rule trans [OF _ bl_sbin_sign])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   670
  apply simp
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   671
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   672
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   673
lemma of_bl_drop': 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   674
  "lend = length bl - len_of TYPE ('a :: len0) ==> 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   675
    of_bl (drop lend bl) = (of_bl bl :: 'a word)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   676
  apply (unfold of_bl_def)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   677
  apply (clarsimp simp add : trunc_bl2bin [symmetric])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   678
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   679
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   680
lemmas of_bl_no = of_bl_def [folded word_number_of_def]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   681
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   682
lemma test_bit_of_bl:  
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   683
  "(of_bl bl::'a::len0 word) !! n = (rev bl ! n \<and> n < len_of TYPE('a) \<and> n < length bl)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   684
  apply (unfold of_bl_def word_test_bit_def)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   685
  apply (auto simp add: word_size word_ubin.eq_norm nth_bintr bin_nth_of_bl)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   686
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   687
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   688
lemma no_of_bl: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   689
  "(number_of bin ::'a::len0 word) = of_bl (bin_to_bl (len_of TYPE ('a)) bin)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   690
  unfolding word_size of_bl_no by (simp add : word_number_of_def)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   691
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   692
lemma uint_bl: "to_bl w == bin_to_bl (size w) (uint w)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   693
  unfolding word_size to_bl_def by auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   694
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   695
lemma to_bl_bin: "bl_to_bin (to_bl w) = uint w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   696
  unfolding uint_bl by (simp add : word_size)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   697
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   698
lemma to_bl_of_bin: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   699
  "to_bl (word_of_int bin::'a::len0 word) = bin_to_bl (len_of TYPE('a)) bin"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   700
  unfolding uint_bl by (clarsimp simp add: word_ubin.eq_norm word_size)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   701
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   702
lemmas to_bl_no_bin [simp] = to_bl_of_bin [folded word_number_of_def]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   703
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   704
lemma to_bl_to_bin [simp] : "bl_to_bin (to_bl w) = uint w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   705
  unfolding uint_bl by (simp add : word_size)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   706
  
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   707
lemmas uint_bl_bin [simp] = trans [OF bin_bl_bin word_ubin.norm_Rep, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   708
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   709
lemmas num_AB_u [simp] = word_uint.Rep_inverse 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   710
  [unfolded o_def word_number_of_def [symmetric], standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   711
lemmas num_AB_s [simp] = word_sint.Rep_inverse 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   712
  [unfolded o_def word_number_of_def [symmetric], standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   713
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   714
(* naturals *)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   715
lemma uints_unats: "uints n = int ` unats n"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   716
  apply (unfold unats_def uints_num)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   717
  apply safe
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   718
  apply (rule_tac image_eqI)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   719
  apply (erule_tac nat_0_le [symmetric])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   720
  apply auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   721
  apply (erule_tac nat_less_iff [THEN iffD2])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   722
  apply (rule_tac [2] zless_nat_eq_int_zless [THEN iffD1])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   723
  apply (auto simp add : nat_power_eq int_power)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   724
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   725
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   726
lemma unats_uints: "unats n = nat ` uints n"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   727
  by (auto simp add : uints_unats image_iff)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   728
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   729
lemmas bintr_num = word_ubin.norm_eq_iff 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   730
  [symmetric, folded word_number_of_def, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   731
lemmas sbintr_num = word_sbin.norm_eq_iff 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   732
  [symmetric, folded word_number_of_def, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   733
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   734
lemmas num_of_bintr = word_ubin.Abs_norm [folded word_number_of_def, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   735
lemmas num_of_sbintr = word_sbin.Abs_norm [folded word_number_of_def, standard];
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   736
    
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   737
(* don't add these to simpset, since may want bintrunc n w to be simplified;
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   738
  may want these in reverse, but loop as simp rules, so use following *)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   739
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   740
lemma num_of_bintr':
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   741
  "bintrunc (len_of TYPE('a :: len0)) a = b ==> 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   742
    number_of a = (number_of b :: 'a word)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   743
  apply safe
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   744
  apply (rule_tac num_of_bintr [symmetric])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   745
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   746
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   747
lemma num_of_sbintr':
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   748
  "sbintrunc (len_of TYPE('a :: len) - 1) a = b ==> 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   749
    number_of a = (number_of b :: 'a word)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   750
  apply safe
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   751
  apply (rule_tac num_of_sbintr [symmetric])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   752
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   753
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   754
lemmas num_abs_bintr = sym [THEN trans,
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   755
  OF num_of_bintr word_number_of_def, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   756
lemmas num_abs_sbintr = sym [THEN trans,
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   757
  OF num_of_sbintr word_number_of_def, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   758
  
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   759
(** cast - note, no arg for new length, as it's determined by type of result,
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   760
  thus in "cast w = w, the type means cast to length of w! **)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   761
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   762
lemma ucast_id: "ucast w = w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   763
  unfolding ucast_def by auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   764
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   765
lemma scast_id: "scast w = w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   766
  unfolding scast_def by auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   767
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   768
lemma ucast_bl: "ucast w == of_bl (to_bl w)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   769
  unfolding ucast_def of_bl_def uint_bl
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   770
  by (auto simp add : word_size)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   771
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   772
lemma nth_ucast: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   773
  "(ucast w::'a::len0 word) !! n = (w !! n & n < len_of TYPE('a))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   774
  apply (unfold ucast_def test_bit_bin)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   775
  apply (simp add: word_ubin.eq_norm nth_bintr word_size) 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   776
  apply (fast elim!: bin_nth_uint_imp)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   777
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   778
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   779
(* for literal u(s)cast *)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   780
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   781
lemma ucast_bintr [simp]: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   782
  "ucast (number_of w ::'a::len0 word) = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   783
   number_of (bintrunc (len_of TYPE('a)) w)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   784
  unfolding ucast_def by simp
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   785
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   786
lemma scast_sbintr [simp]: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   787
  "scast (number_of w ::'a::len word) = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   788
   number_of (sbintrunc (len_of TYPE('a) - Suc 0) w)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   789
  unfolding scast_def by simp
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   790
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   791
lemmas source_size = source_size_def [unfolded Let_def word_size]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   792
lemmas target_size = target_size_def [unfolded Let_def word_size]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   793
lemmas is_down = is_down_def [unfolded source_size target_size]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   794
lemmas is_up = is_up_def [unfolded source_size target_size]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   795
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   796
lemmas is_up_down =  trans [OF is_up is_down [symmetric], standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   797
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   798
lemma down_cast_same': "uc = ucast ==> is_down uc ==> uc = scast"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   799
  apply (unfold is_down)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   800
  apply safe
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   801
  apply (rule ext)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   802
  apply (unfold ucast_def scast_def uint_sint)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   803
  apply (rule word_ubin.norm_eq_iff [THEN iffD1])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   804
  apply simp
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   805
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   806
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   807
lemma word_rev_tf': 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   808
  "r = to_bl (of_bl bl) ==> r = rev (takefill False (length r) (rev bl))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   809
  unfolding of_bl_def uint_bl
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   810
  by (clarsimp simp add: bl_bin_bl_rtf word_ubin.eq_norm word_size)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   811
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   812
lemmas word_rev_tf = refl [THEN word_rev_tf', unfolded word_bl.Rep', standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   813
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   814
lemmas word_rep_drop = word_rev_tf [simplified takefill_alt,
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   815
  simplified, simplified rev_take, simplified]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   816
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   817
lemma to_bl_ucast: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   818
  "to_bl (ucast (w::'b::len0 word) ::'a::len0 word) = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   819
   replicate (len_of TYPE('a) - len_of TYPE('b)) False @
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   820
   drop (len_of TYPE('b) - len_of TYPE('a)) (to_bl w)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   821
  apply (unfold ucast_bl)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   822
  apply (rule trans)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   823
   apply (rule word_rep_drop)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   824
  apply simp
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   825
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   826
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   827
lemma ucast_up_app': 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   828
  "uc = ucast ==> source_size uc + n = target_size uc ==> 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   829
    to_bl (uc w) = replicate n False @ (to_bl w)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   830
  by (auto simp add : source_size target_size to_bl_ucast)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   831
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   832
lemma ucast_down_drop': 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   833
  "uc = ucast ==> source_size uc = target_size uc + n ==> 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   834
    to_bl (uc w) = drop n (to_bl w)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   835
  by (auto simp add : source_size target_size to_bl_ucast)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   836
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   837
lemma scast_down_drop': 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   838
  "sc = scast ==> source_size sc = target_size sc + n ==> 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   839
    to_bl (sc w) = drop n (to_bl w)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   840
  apply (subgoal_tac "sc = ucast")
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   841
   apply safe
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   842
   apply simp
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   843
   apply (erule refl [THEN ucast_down_drop'])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   844
  apply (rule refl [THEN down_cast_same', symmetric])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   845
  apply (simp add : source_size target_size is_down)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   846
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   847
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   848
lemma sint_up_scast': 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   849
  "sc = scast ==> is_up sc ==> sint (sc w) = sint w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   850
  apply (unfold is_up)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   851
  apply safe
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   852
  apply (simp add: scast_def word_sbin.eq_norm)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   853
  apply (rule box_equals)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   854
    prefer 3
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   855
    apply (rule word_sbin.norm_Rep)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   856
   apply (rule sbintrunc_sbintrunc_l)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   857
   defer
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   858
   apply (subst word_sbin.norm_Rep)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   859
   apply (rule refl)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   860
  apply simp
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   861
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   862
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   863
lemma uint_up_ucast':
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   864
  "uc = ucast ==> is_up uc ==> uint (uc w) = uint w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   865
  apply (unfold is_up)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   866
  apply safe
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   867
  apply (rule bin_eqI)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   868
  apply (fold word_test_bit_def)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   869
  apply (auto simp add: nth_ucast)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   870
  apply (auto simp add: test_bit_bin)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   871
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   872
    
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   873
lemmas down_cast_same = refl [THEN down_cast_same']
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   874
lemmas ucast_up_app = refl [THEN ucast_up_app']
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   875
lemmas ucast_down_drop = refl [THEN ucast_down_drop']
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   876
lemmas scast_down_drop = refl [THEN scast_down_drop']
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   877
lemmas uint_up_ucast = refl [THEN uint_up_ucast']
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   878
lemmas sint_up_scast = refl [THEN sint_up_scast']
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   879
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   880
lemma ucast_up_ucast': "uc = ucast ==> is_up uc ==> ucast (uc w) = ucast w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   881
  apply (simp (no_asm) add: ucast_def)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   882
  apply (clarsimp simp add: uint_up_ucast)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   883
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   884
    
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   885
lemma scast_up_scast': "sc = scast ==> is_up sc ==> scast (sc w) = scast w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   886
  apply (simp (no_asm) add: scast_def)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   887
  apply (clarsimp simp add: sint_up_scast)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   888
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   889
    
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   890
lemma ucast_of_bl_up': 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   891
  "w = of_bl bl ==> size bl <= size w ==> ucast w = of_bl bl"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   892
  by (auto simp add : nth_ucast word_size test_bit_of_bl intro!: word_eqI)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   893
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   894
lemmas ucast_up_ucast = refl [THEN ucast_up_ucast']
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   895
lemmas scast_up_scast = refl [THEN scast_up_scast']
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   896
lemmas ucast_of_bl_up = refl [THEN ucast_of_bl_up']
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   897
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   898
lemmas ucast_up_ucast_id = trans [OF ucast_up_ucast ucast_id]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   899
lemmas scast_up_scast_id = trans [OF scast_up_scast scast_id]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   900
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   901
lemmas isduu = is_up_down [where c = "ucast", THEN iffD2]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   902
lemmas isdus = is_up_down [where c = "scast", THEN iffD2]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   903
lemmas ucast_down_ucast_id = isduu [THEN ucast_up_ucast_id]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   904
lemmas scast_down_scast_id = isdus [THEN ucast_up_ucast_id]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   905
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   906
lemma up_ucast_surj:
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   907
  "is_up (ucast :: 'b::len0 word => 'a::len0 word) ==> 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   908
   surj (ucast :: 'a word => 'b word)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   909
  by (rule surjI, erule ucast_up_ucast_id)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   910
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   911
lemma up_scast_surj:
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   912
  "is_up (scast :: 'b::len word => 'a::len word) ==> 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   913
   surj (scast :: 'a word => 'b word)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   914
  by (rule surjI, erule scast_up_scast_id)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   915
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   916
lemma down_scast_inj:
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   917
  "is_down (scast :: 'b::len word => 'a::len word) ==> 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   918
   inj_on (ucast :: 'a word => 'b word) A"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   919
  by (rule inj_on_inverseI, erule scast_down_scast_id)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   920
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   921
lemma down_ucast_inj:
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   922
  "is_down (ucast :: 'b::len0 word => 'a::len0 word) ==> 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   923
   inj_on (ucast :: 'a word => 'b word) A"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   924
  by (rule inj_on_inverseI, erule ucast_down_ucast_id)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   925
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   926
lemma of_bl_append_same: "of_bl (X @ to_bl w) = w"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   927
  by (rule word_bl.Rep_eqD) (simp add: word_rep_drop)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   928
  
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   929
lemma ucast_down_no': 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   930
  "uc = ucast ==> is_down uc ==> uc (number_of bin) = number_of bin"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   931
  apply (unfold word_number_of_def is_down)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   932
  apply (clarsimp simp add: ucast_def word_ubin.eq_norm)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   933
  apply (rule word_ubin.norm_eq_iff [THEN iffD1])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   934
  apply (erule bintrunc_bintrunc_ge)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   935
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   936
    
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   937
lemmas ucast_down_no = ucast_down_no' [OF refl]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   938
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   939
lemma ucast_down_bl': "uc = ucast ==> is_down uc ==> uc (of_bl bl) = of_bl bl"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   940
  unfolding of_bl_no by clarify (erule ucast_down_no)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   941
    
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   942
lemmas ucast_down_bl = ucast_down_bl' [OF refl]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   943
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   944
lemmas slice_def' = slice_def [unfolded word_size]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   945
lemmas test_bit_def' = word_test_bit_def [THEN fun_cong]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   946
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   947
lemmas word_log_defs = word_and_def word_or_def word_xor_def word_not_def
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   948
lemmas word_log_bin_defs = word_log_defs
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   949
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   950
text {* Executable equality *}
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   951
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   952
instantiation word :: ("{len0}") eq
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   953
begin
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   954
37660
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   955
definition eq_word :: "'a word \<Rightarrow> 'a word \<Rightarrow> bool" where
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   956
  "eq_word k l \<longleftrightarrow> HOL.eq (uint k) (uint l)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   957
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   958
instance proof
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   959
qed (simp add: eq eq_word_def)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   960
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   961
end
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   962
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   963
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   964
subsection {* Word Arithmetic *}
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   965
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   966
lemma word_less_alt: "(a < b) = (uint a < uint b)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   967
  unfolding word_less_def word_le_def
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   968
  by (auto simp del: word_uint.Rep_inject 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   969
           simp: word_uint.Rep_inject [symmetric])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   970
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   971
lemma signed_linorder: "class.linorder word_sle word_sless"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   972
proof
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   973
qed (unfold word_sle_def word_sless_def, auto)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   974
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   975
interpretation signed: linorder "word_sle" "word_sless"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   976
  by (rule signed_linorder)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   977
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   978
lemmas word_arith_wis = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   979
  word_add_def word_mult_def word_minus_def 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   980
  word_succ_def word_pred_def word_0_wi word_1_wi
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   981
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   982
lemma udvdI: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   983
  "0 \<le> n ==> uint b = n * uint a ==> a udvd b"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   984
  by (auto simp: udvd_def)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   985
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   986
lemmas word_div_no [simp] = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   987
  word_div_def [of "number_of a" "number_of b", standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   988
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   989
lemmas word_mod_no [simp] = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   990
  word_mod_def [of "number_of a" "number_of b", standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   991
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   992
lemmas word_less_no [simp] = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   993
  word_less_def [of "number_of a" "number_of b", standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   994
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   995
lemmas word_le_no [simp] = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   996
  word_le_def [of "number_of a" "number_of b", standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   997
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   998
lemmas word_sless_no [simp] = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
   999
  word_sless_def [of "number_of a" "number_of b", standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1000
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1001
lemmas word_sle_no [simp] = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1002
  word_sle_def [of "number_of a" "number_of b", standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1003
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1004
(* following two are available in class number_ring, 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1005
  but convenient to have them here here;
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1006
  note - the number_ring versions, numeral_0_eq_0 and numeral_1_eq_1
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1007
  are in the default simpset, so to use the automatic simplifications for
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1008
  (eg) sint (number_of bin) on sint 1, must do
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1009
  (simp add: word_1_no del: numeral_1_eq_1) 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1010
  *)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1011
lemmas word_0_wi_Pls = word_0_wi [folded Pls_def]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1012
lemmas word_0_no = word_0_wi_Pls [folded word_no_wi]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1013
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1014
lemma int_one_bin: "(1 :: int) == (Int.Pls BIT 1)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1015
  unfolding Pls_def Bit_def by auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1016
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1017
lemma word_1_no: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1018
  "(1 :: 'a :: len0 word) == number_of (Int.Pls BIT 1)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1019
  unfolding word_1_wi word_number_of_def int_one_bin by auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1020
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1021
lemma word_m1_wi: "-1 == word_of_int -1" 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1022
  by (rule word_number_of_alt)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1023
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1024
lemma word_m1_wi_Min: "-1 = word_of_int Int.Min"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1025
  by (simp add: word_m1_wi number_of_eq)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1026
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1027
lemma word_0_bl: "of_bl [] = 0" 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1028
  unfolding word_0_wi of_bl_def by (simp add : Pls_def)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1029
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1030
lemma word_1_bl: "of_bl [True] = 1" 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1031
  unfolding word_1_wi of_bl_def
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1032
  by (simp add : bl_to_bin_def Bit_def Pls_def)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1033
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1034
lemma uint_eq_0 [simp] : "(uint 0 = 0)" 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1035
  unfolding word_0_wi
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1036
  by (simp add: word_ubin.eq_norm Pls_def [symmetric])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1037
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1038
lemma of_bl_0 [simp] : "of_bl (replicate n False) = 0"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1039
  by (simp add : word_0_wi of_bl_def bl_to_bin_rep_False Pls_def)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1040
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1041
lemma to_bl_0: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1042
  "to_bl (0::'a::len0 word) = replicate (len_of TYPE('a)) False"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1043
  unfolding uint_bl
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1044
  by (simp add : word_size bin_to_bl_Pls Pls_def [symmetric])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1045
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1046
lemma uint_0_iff: "(uint x = 0) = (x = 0)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1047
  by (auto intro!: word_uint.Rep_eqD)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1048
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1049
lemma unat_0_iff: "(unat x = 0) = (x = 0)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1050
  unfolding unat_def by (auto simp add : nat_eq_iff uint_0_iff)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1051
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1052
lemma unat_0 [simp]: "unat 0 = 0"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1053
  unfolding unat_def by auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1054
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1055
lemma size_0_same': "size w = 0 ==> w = (v :: 'a :: len0 word)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1056
  apply (unfold word_size)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1057
  apply (rule box_equals)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1058
    defer
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1059
    apply (rule word_uint.Rep_inverse)+
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1060
  apply (rule word_ubin.norm_eq_iff [THEN iffD1])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1061
  apply simp
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1062
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1063
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1064
lemmas size_0_same = size_0_same' [folded word_size]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1065
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1066
lemmas unat_eq_0 = unat_0_iff
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1067
lemmas unat_eq_zero = unat_0_iff
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1068
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1069
lemma unat_gt_0: "(0 < unat x) = (x ~= 0)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1070
by (auto simp: unat_0_iff [symmetric])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1071
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1072
lemma ucast_0 [simp] : "ucast 0 = 0"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1073
unfolding ucast_def
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1074
by simp (simp add: word_0_wi)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1075
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1076
lemma sint_0 [simp] : "sint 0 = 0"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1077
unfolding sint_uint
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1078
by (simp add: Pls_def [symmetric])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1079
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1080
lemma scast_0 [simp] : "scast 0 = 0"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1081
apply (unfold scast_def)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1082
apply simp
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1083
apply (simp add: word_0_wi)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1084
done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1085
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1086
lemma sint_n1 [simp] : "sint -1 = -1"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1087
apply (unfold word_m1_wi_Min)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1088
apply (simp add: word_sbin.eq_norm)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1089
apply (unfold Min_def number_of_eq)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1090
apply simp
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1091
done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1092
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1093
lemma scast_n1 [simp] : "scast -1 = -1"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1094
  apply (unfold scast_def sint_n1)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1095
  apply (unfold word_number_of_alt)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1096
  apply (rule refl)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1097
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1098
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1099
lemma uint_1 [simp] : "uint (1 :: 'a :: len word) = 1"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1100
  unfolding word_1_wi
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1101
  by (simp add: word_ubin.eq_norm int_one_bin bintrunc_minus_simps)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1102
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1103
lemma unat_1 [simp] : "unat (1 :: 'a :: len word) = 1"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1104
  by (unfold unat_def uint_1) auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1105
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1106
lemma ucast_1 [simp] : "ucast (1 :: 'a :: len word) = 1"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1107
  unfolding ucast_def word_1_wi
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1108
  by (simp add: word_ubin.eq_norm int_one_bin bintrunc_minus_simps)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1109
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1110
(* abstraction preserves the operations
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1111
  (the definitions tell this for bins in range uint) *)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1112
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1113
lemmas arths = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1114
  bintr_ariths [THEN word_ubin.norm_eq_iff [THEN iffD1],
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1115
                folded word_ubin.eq_norm, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1116
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1117
lemma wi_homs: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1118
  shows
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1119
  wi_hom_add: "word_of_int a + word_of_int b = word_of_int (a + b)" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1120
  wi_hom_mult: "word_of_int a * word_of_int b = word_of_int (a * b)" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1121
  wi_hom_neg: "- word_of_int a = word_of_int (- a)" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1122
  wi_hom_succ: "word_succ (word_of_int a) = word_of_int (Int.succ a)" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1123
  wi_hom_pred: "word_pred (word_of_int a) = word_of_int (Int.pred a)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1124
  by (auto simp: word_arith_wis arths)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1125
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1126
lemmas wi_hom_syms = wi_homs [symmetric]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1127
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1128
lemma word_sub_def: "a - b == a + - (b :: 'a :: len0 word)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1129
  unfolding word_sub_wi diff_def
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1130
  by (simp only : word_uint.Rep_inverse wi_hom_syms)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1131
    
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1132
lemmas word_diff_minus = word_sub_def [THEN meta_eq_to_obj_eq, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1133
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1134
lemma word_of_int_sub_hom:
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1135
  "(word_of_int a) - word_of_int b = word_of_int (a - b)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1136
  unfolding word_sub_def diff_def by (simp only : wi_homs)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1137
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1138
lemmas new_word_of_int_homs = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1139
  word_of_int_sub_hom wi_homs word_0_wi word_1_wi 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1140
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1141
lemmas new_word_of_int_hom_syms = new_word_of_int_homs [symmetric, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1142
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1143
lemmas word_of_int_hom_syms =
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1144
  new_word_of_int_hom_syms [unfolded succ_def pred_def]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1145
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1146
lemmas word_of_int_homs =
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1147
  new_word_of_int_homs [unfolded succ_def pred_def]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1148
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1149
lemmas word_of_int_add_hom = word_of_int_homs (2)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1150
lemmas word_of_int_mult_hom = word_of_int_homs (3)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1151
lemmas word_of_int_minus_hom = word_of_int_homs (4)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1152
lemmas word_of_int_succ_hom = word_of_int_homs (5)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1153
lemmas word_of_int_pred_hom = word_of_int_homs (6)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1154
lemmas word_of_int_0_hom = word_of_int_homs (7)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1155
lemmas word_of_int_1_hom = word_of_int_homs (8)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1156
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1157
(* now, to get the weaker results analogous to word_div/mod_def *)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1158
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1159
lemmas word_arith_alts = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1160
  word_sub_wi [unfolded succ_def pred_def, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1161
  word_arith_wis [unfolded succ_def pred_def, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1162
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1163
lemmas word_sub_alt = word_arith_alts (1)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1164
lemmas word_add_alt = word_arith_alts (2)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1165
lemmas word_mult_alt = word_arith_alts (3)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1166
lemmas word_minus_alt = word_arith_alts (4)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1167
lemmas word_succ_alt = word_arith_alts (5)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1168
lemmas word_pred_alt = word_arith_alts (6)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1169
lemmas word_0_alt = word_arith_alts (7)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1170
lemmas word_1_alt = word_arith_alts (8)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1171
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1172
subsection  "Transferring goals from words to ints"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1173
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1174
lemma word_ths:  
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1175
  shows
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1176
  word_succ_p1:   "word_succ a = a + 1" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1177
  word_pred_m1:   "word_pred a = a - 1" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1178
  word_pred_succ: "word_pred (word_succ a) = a" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1179
  word_succ_pred: "word_succ (word_pred a) = a" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1180
  word_mult_succ: "word_succ a * b = b + a * b"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1181
  by (rule word_uint.Abs_cases [of b],
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1182
      rule word_uint.Abs_cases [of a],
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1183
      simp add: pred_def succ_def add_commute mult_commute 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1184
                ring_distribs new_word_of_int_homs)+
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1185
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1186
lemmas uint_cong = arg_cong [where f = uint]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1187
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1188
lemmas uint_word_ariths = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1189
  word_arith_alts [THEN trans [OF uint_cong int_word_uint], standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1190
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1191
lemmas uint_word_arith_bintrs = uint_word_ariths [folded bintrunc_mod2p]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1192
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1193
(* similar expressions for sint (arith operations) *)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1194
lemmas sint_word_ariths = uint_word_arith_bintrs
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1195
  [THEN uint_sint [symmetric, THEN trans],
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1196
  unfolded uint_sint bintr_arith1s bintr_ariths 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1197
    len_gt_0 [THEN bin_sbin_eq_iff'] word_sbin.norm_Rep, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1198
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1199
lemmas uint_div_alt = word_div_def
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1200
  [THEN trans [OF uint_cong int_word_uint], standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1201
lemmas uint_mod_alt = word_mod_def
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1202
  [THEN trans [OF uint_cong int_word_uint], standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1203
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1204
lemma word_pred_0_n1: "word_pred 0 = word_of_int -1"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1205
  unfolding word_pred_def number_of_eq
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1206
  by (simp add : pred_def word_no_wi)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1207
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1208
lemma word_pred_0_Min: "word_pred 0 = word_of_int Int.Min"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1209
  by (simp add: word_pred_0_n1 number_of_eq)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1210
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1211
lemma word_m1_Min: "- 1 = word_of_int Int.Min"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1212
  unfolding Min_def by (simp only: word_of_int_hom_syms)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1213
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1214
lemma succ_pred_no [simp]:
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1215
  "word_succ (number_of bin) = number_of (Int.succ bin) & 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1216
    word_pred (number_of bin) = number_of (Int.pred bin)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1217
  unfolding word_number_of_def by (simp add : new_word_of_int_homs)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1218
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1219
lemma word_sp_01 [simp] : 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1220
  "word_succ -1 = 0 & word_succ 0 = 1 & word_pred 0 = -1 & word_pred 1 = 0"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1221
  by (unfold word_0_no word_1_no) auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1222
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1223
(* alternative approach to lifting arithmetic equalities *)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1224
lemma word_of_int_Ex:
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1225
  "\<exists>y. x = word_of_int y"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1226
  by (rule_tac x="uint x" in exI) simp
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1227
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1228
lemma word_arith_eqs:
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1229
  fixes a :: "'a::len0 word"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1230
  fixes b :: "'a::len0 word"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1231
  shows
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1232
  word_add_0: "0 + a = a" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1233
  word_add_0_right: "a + 0 = a" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1234
  word_mult_1: "1 * a = a" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1235
  word_mult_1_right: "a * 1 = a" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1236
  word_add_commute: "a + b = b + a" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1237
  word_add_assoc: "a + b + c = a + (b + c)" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1238
  word_add_left_commute: "a + (b + c) = b + (a + c)" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1239
  word_mult_commute: "a * b = b * a" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1240
  word_mult_assoc: "a * b * c = a * (b * c)" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1241
  word_mult_left_commute: "a * (b * c) = b * (a * c)" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1242
  word_left_distrib: "(a + b) * c = a * c + b * c" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1243
  word_right_distrib: "a * (b + c) = a * b + a * c" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1244
  word_left_minus: "- a + a = 0" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1245
  word_diff_0_right: "a - 0 = a" and
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1246
  word_diff_self: "a - a = 0"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1247
  using word_of_int_Ex [of a] 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1248
        word_of_int_Ex [of b] 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1249
        word_of_int_Ex [of c]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1250
  by (auto simp: word_of_int_hom_syms [symmetric]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1251
                 zadd_0_right add_commute add_assoc add_left_commute
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1252
                 mult_commute mult_assoc mult_left_commute
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1253
                 left_distrib right_distrib)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1254
  
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1255
lemmas word_add_ac = word_add_commute word_add_assoc word_add_left_commute
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1256
lemmas word_mult_ac = word_mult_commute word_mult_assoc word_mult_left_commute
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1257
  
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1258
lemmas word_plus_ac0 = word_add_0 word_add_0_right word_add_ac
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1259
lemmas word_times_ac1 = word_mult_1 word_mult_1_right word_mult_ac
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1260
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1261
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1262
subsection "Order on fixed-length words"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1263
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1264
lemma word_order_trans: "x <= y ==> y <= z ==> x <= (z :: 'a :: len0 word)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1265
  unfolding word_le_def by auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1266
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1267
lemma word_order_refl: "z <= (z :: 'a :: len0 word)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1268
  unfolding word_le_def by auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1269
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1270
lemma word_order_antisym: "x <= y ==> y <= x ==> x = (y :: 'a :: len0 word)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1271
  unfolding word_le_def by (auto intro!: word_uint.Rep_eqD)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1272
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1273
lemma word_order_linear:
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1274
  "y <= x | x <= (y :: 'a :: len0 word)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1275
  unfolding word_le_def by auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1276
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1277
lemma word_zero_le [simp] :
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1278
  "0 <= (y :: 'a :: len0 word)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1279
  unfolding word_le_def by auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1280
  
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1281
instance word :: (len0) semigroup_add
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1282
  by intro_classes (simp add: word_add_assoc)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1283
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1284
instance word :: (len0) linorder
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1285
  by intro_classes (auto simp: word_less_def word_le_def)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1286
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1287
instance word :: (len0) ring
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1288
  by intro_classes
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1289
     (auto simp: word_arith_eqs word_diff_minus 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1290
                 word_diff_self [unfolded word_diff_minus])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1291
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1292
lemma word_m1_ge [simp] : "word_pred 0 >= y"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1293
  unfolding word_le_def
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1294
  by (simp only : word_pred_0_n1 word_uint.eq_norm m1mod2k) auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1295
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1296
lemmas word_n1_ge [simp]  = word_m1_ge [simplified word_sp_01]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1297
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1298
lemmas word_not_simps [simp] = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1299
  word_zero_le [THEN leD] word_m1_ge [THEN leD] word_n1_ge [THEN leD]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1300
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1301
lemma word_gt_0: "0 < y = (0 ~= (y :: 'a :: len0 word))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1302
  unfolding word_less_def by auto
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1303
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1304
lemmas word_gt_0_no [simp] = word_gt_0 [of "number_of y", standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1305
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1306
lemma word_sless_alt: "(a <s b) == (sint a < sint b)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1307
  unfolding word_sle_def word_sless_def
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1308
  by (auto simp add: less_le)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1309
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1310
lemma word_le_nat_alt: "(a <= b) = (unat a <= unat b)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1311
  unfolding unat_def word_le_def
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1312
  by (rule nat_le_eq_zle [symmetric]) simp
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1313
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1314
lemma word_less_nat_alt: "(a < b) = (unat a < unat b)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1315
  unfolding unat_def word_less_alt
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1316
  by (rule nat_less_eq_zless [symmetric]) simp
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1317
  
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1318
lemma wi_less: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1319
  "(word_of_int n < (word_of_int m :: 'a :: len0 word)) = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1320
    (n mod 2 ^ len_of TYPE('a) < m mod 2 ^ len_of TYPE('a))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1321
  unfolding word_less_alt by (simp add: word_uint.eq_norm)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1322
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1323
lemma wi_le: 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1324
  "(word_of_int n <= (word_of_int m :: 'a :: len0 word)) = 
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1325
    (n mod 2 ^ len_of TYPE('a) <= m mod 2 ^ len_of TYPE('a))"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1326
  unfolding word_le_def by (simp add: word_uint.eq_norm)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1327
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1328
lemma udvd_nat_alt: "a udvd b = (EX n>=0. unat b = n * unat a)"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1329
  apply (unfold udvd_def)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1330
  apply safe
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1331
   apply (simp add: unat_def nat_mult_distrib)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1332
  apply (simp add: uint_nat int_mult)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1333
  apply (rule exI)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1334
  apply safe
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1335
   prefer 2
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1336
   apply (erule notE)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1337
   apply (rule refl)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1338
  apply force
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1339
  done
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1340
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1341
lemma udvd_iff_dvd: "x udvd y <-> unat x dvd unat y"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1342
  unfolding dvd_def udvd_nat_alt by force
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1343
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1344
lemmas unat_mono = word_less_nat_alt [THEN iffD1, standard]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1345
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1346
lemma word_zero_neq_one: "0 < len_of TYPE ('a :: len0) ==> (0 :: 'a word) ~= 1";
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1347
  unfolding word_arith_wis
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1348
  by (auto simp add: word_ubin.norm_eq_iff [symmetric] gr0_conv_Suc)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1349
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1350
lemmas lenw1_zero_neq_one = len_gt_0 [THEN word_zero_neq_one]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1351
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1352
lemma no_no [simp] : "number_of (number_of b) = number_of b"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1353
  by (simp add: number_of_eq)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1354
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1355
lemma unat_minus_one: "x ~= 0 ==> unat (x - 1) = unat x - 1"
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1356
  apply (unfold unat_def)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1357
  apply (simp only: int_word_uint word_arith_alts rdmods)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1358
  apply (subgoal_tac "uint x >= 1")
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1359
   prefer 2
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1360
   apply (drule contrapos_nn)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1361
    apply (erule word_uint.Rep_inverse' [symmetric])
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1362
   apply (insert uint_ge_0 [of x])[1]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1363
   apply arith
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1364
  apply (rule box_equals)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1365
    apply (rule nat_diff_distrib)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1366
     prefer 2
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1367
     apply assumption
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1368
    apply simp
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1369
   apply (subst mod_pos_pos_trivial)
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1370
     apply arith
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1371
    apply (insert uint_lt2p [of x])[1]
56e3520b68b2 one unified Word theory
haftmann
parents: 36899
diff changeset
  1372
    apply arith
56e3520b68b2 one unified Word theory
haftmann</