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