src/HOL/Word/BinGeneral.thy
author haftmann
Mon, 08 Feb 2010 17:12:30 +0100
changeset 35048 82ab78fff970
parent 32642 026e7c6a6d08
child 36176 3fe7e97ccca8
permissions -rw-r--r--
tuned proofs
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
     1
(* 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
     2
  Author: Jeremy Dawson, NICTA
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
     3
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
     4
  contains basic definition to do with integers
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
     5
  expressed using Pls, Min, BIT and important resulting theorems, 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
     6
  in particular, bin_rec and related work
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
     7
*) 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
     8
24350
4d74f37c6367 headers for document generation
huffman
parents: 24333
diff changeset
     9
header {* Basic Definitions for Binary Integers *}
4d74f37c6367 headers for document generation
huffman
parents: 24333
diff changeset
    10
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    11
theory BinGeneral
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    12
imports Num_Lemmas
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
    13
begin
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
    14
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    15
subsection {* Further properties of numerals *}
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    16
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    17
datatype bit = B0 | B1
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    18
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    19
definition
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    20
  Bit :: "int \<Rightarrow> bit \<Rightarrow> int" (infixl "BIT" 90) where
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    21
  "k BIT b = (case b of B0 \<Rightarrow> 0 | B1 \<Rightarrow> 1) + k + k"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    22
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    23
lemma BIT_B0_eq_Bit0 [simp]: "w BIT B0 = Int.Bit0 w"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    24
  unfolding Bit_def Bit0_def by simp
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    25
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    26
lemma BIT_B1_eq_Bit1 [simp]: "w BIT B1 = Int.Bit1 w"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    27
  unfolding Bit_def Bit1_def by simp
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    28
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    29
lemmas BIT_simps = BIT_B0_eq_Bit0 BIT_B1_eq_Bit1
24384
0002537695df move BIT datatype stuff from Num_Lemmas to BinGeneral
huffman
parents: 24383
diff changeset
    30
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    31
hide (open) const B0 B1
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    32
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    33
lemma Min_ne_Pls [iff]:  
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    34
  "Int.Min ~= Int.Pls"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    35
  unfolding Min_def Pls_def by auto
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    36
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    37
lemmas Pls_ne_Min [iff] = Min_ne_Pls [symmetric]
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    38
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    39
lemmas PlsMin_defs [intro!] = 
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    40
  Pls_def Min_def Pls_def [symmetric] Min_def [symmetric]
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    41
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    42
lemmas PlsMin_simps [simp] = PlsMin_defs [THEN Eq_TrueI]
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    43
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    44
lemma number_of_False_cong: 
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    45
  "False \<Longrightarrow> number_of x = number_of y"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    46
  by (rule FalseE)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    47
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    48
(** ways in which type Bin resembles a datatype **)
24350
4d74f37c6367 headers for document generation
huffman
parents: 24333
diff changeset
    49
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    50
lemma BIT_eq: "u BIT b = v BIT c ==> u = v & b = c"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    51
  apply (unfold Bit_def)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    52
  apply (simp (no_asm_use) split: bit.split_asm)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    53
     apply simp_all
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    54
   apply (drule_tac f=even in arg_cong, clarsimp)+
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    55
  done
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    56
     
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    57
lemmas BIT_eqE [elim!] = BIT_eq [THEN conjE, standard]
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    58
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    59
lemma BIT_eq_iff [simp]: 
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    60
  "(u BIT b = v BIT c) = (u = v \<and> b = c)"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    61
  by (rule iffI) auto
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    62
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    63
lemmas BIT_eqI [intro!] = conjI [THEN BIT_eq_iff [THEN iffD2]]
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    64
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    65
lemma less_Bits: 
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    66
  "(v BIT b < w BIT c) = (v < w | v <= w & b = bit.B0 & c = bit.B1)"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    67
  unfolding Bit_def by (auto split: bit.split)
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
    68
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    69
lemma le_Bits: 
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    70
  "(v BIT b <= w BIT c) = (v < w | v <= w & (b ~= bit.B1 | c ~= bit.B0))" 
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    71
  unfolding Bit_def by (auto split: bit.split)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    72
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    73
lemma no_no [simp]: "number_of (number_of i) = i"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    74
  unfolding number_of_eq by simp
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    75
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    76
lemma Bit_B0:
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    77
  "k BIT bit.B0 = k + k"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    78
   by (unfold Bit_def) simp
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    79
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    80
lemma Bit_B1:
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    81
  "k BIT bit.B1 = k + k + 1"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    82
   by (unfold Bit_def) simp
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    83
  
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    84
lemma Bit_B0_2t: "k BIT bit.B0 = 2 * k"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    85
  by (rule trans, rule Bit_B0) simp
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    86
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    87
lemma Bit_B1_2t: "k BIT bit.B1 = 2 * k + 1"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    88
  by (rule trans, rule Bit_B1) simp
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    89
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    90
lemma B_mod_2': 
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    91
  "X = 2 ==> (w BIT bit.B1) mod X = 1 & (w BIT bit.B0) mod X = 0"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    92
  apply (simp (no_asm) only: Bit_B0 Bit_B1)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    93
  apply (simp add: z1pmod2)
24465
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
    94
  done
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
    95
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    96
lemma B1_mod_2 [simp]: "(Int.Bit1 w) mod 2 = 1"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    97
  unfolding numeral_simps number_of_is_id by (simp add: z1pmod2)
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
    98
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
    99
lemma B0_mod_2 [simp]: "(Int.Bit0 w) mod 2 = 0"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   100
  unfolding numeral_simps number_of_is_id by simp
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   101
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   102
lemma neB1E [elim!]:
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   103
  assumes ne: "y \<noteq> bit.B1"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   104
  assumes y: "y = bit.B0 \<Longrightarrow> P"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   105
  shows "P"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   106
  apply (rule y)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   107
  apply (cases y rule: bit.exhaust, simp)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   108
  apply (simp add: ne)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   109
  done
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   110
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   111
lemma bin_ex_rl: "EX w b. w BIT b = bin"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   112
  apply (unfold Bit_def)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   113
  apply (cases "even bin")
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   114
   apply (clarsimp simp: even_equiv_def)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   115
   apply (auto simp: odd_equiv_def split: bit.split)
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   116
  done
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   117
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   118
lemma bin_exhaust:
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   119
  assumes Q: "\<And>x b. bin = x BIT b \<Longrightarrow> Q"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   120
  shows "Q"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   121
  apply (insert bin_ex_rl [of bin])  
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   122
  apply (erule exE)+
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   123
  apply (rule Q)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   124
  apply force
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   125
  done
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   126
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   127
24465
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   128
subsection {* Destructors for binary integers *}
24364
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   129
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   130
definition bin_rl :: "int \<Rightarrow> int \<times> bit" where 
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 26827
diff changeset
   131
  [code del]: "bin_rl w = (THE (r, l). w = r BIT l)"
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   132
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   133
lemma bin_rl_char: "(bin_rl w = (r, l)) = (r BIT l = w)"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   134
  apply (unfold bin_rl_def)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   135
  apply safe
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   136
   apply (cases w rule: bin_exhaust)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   137
   apply auto
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   138
  done
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   139
26514
eff55c0a6d34 tuned towards code generation
haftmann
parents: 26294
diff changeset
   140
definition
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 26827
diff changeset
   141
  bin_rest_def [code del]: "bin_rest w = fst (bin_rl w)"
26514
eff55c0a6d34 tuned towards code generation
haftmann
parents: 26294
diff changeset
   142
eff55c0a6d34 tuned towards code generation
haftmann
parents: 26294
diff changeset
   143
definition
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 26827
diff changeset
   144
  bin_last_def [code del] : "bin_last w = snd (bin_rl w)"
24465
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   145
26514
eff55c0a6d34 tuned towards code generation
haftmann
parents: 26294
diff changeset
   146
primrec bin_nth where
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   147
  Z: "bin_nth w 0 = (bin_last w = bit.B1)"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   148
  | Suc: "bin_nth w (Suc n) = bin_nth (bin_rest w) n"
24364
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   149
24465
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   150
lemma bin_rl: "bin_rl w = (bin_rest w, bin_last w)"
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   151
  unfolding bin_rest_def bin_last_def by auto
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   152
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   153
lemma bin_rl_simps [simp]:
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   154
  "bin_rl Int.Pls = (Int.Pls, bit.B0)"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   155
  "bin_rl Int.Min = (Int.Min, bit.B1)"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   156
  "bin_rl (Int.Bit0 r) = (r, bit.B0)"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   157
  "bin_rl (Int.Bit1 r) = (r, bit.B1)"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   158
  "bin_rl (r BIT b) = (r, b)"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   159
  unfolding bin_rl_char by simp_all
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   160
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 26827
diff changeset
   161
declare bin_rl_simps(1-4) [code]
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   162
24465
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   163
lemmas bin_rl_simp [simp] = iffD1 [OF bin_rl_char bin_rl]
24364
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   164
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   165
lemma bin_abs_lem:
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   166
  "bin = (w BIT b) ==> ~ bin = Int.Min --> ~ bin = Int.Pls -->
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   167
    nat (abs w) < nat (abs bin)"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   168
  apply (clarsimp simp add: bin_rl_char)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   169
  apply (unfold Pls_def Min_def Bit_def)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   170
  apply (cases b)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   171
   apply (clarsimp, arith)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   172
  apply (clarsimp, arith)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   173
  done
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   174
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   175
lemma bin_induct:
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   176
  assumes PPls: "P Int.Pls"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   177
    and PMin: "P Int.Min"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   178
    and PBit: "!!bin bit. P bin ==> P (bin BIT bit)"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   179
  shows "P bin"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   180
  apply (rule_tac P=P and a=bin and f1="nat o abs" 
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   181
                  in wf_measure [THEN wf_induct])
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   182
  apply (simp add: measure_def inv_image_def)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   183
  apply (case_tac x rule: bin_exhaust)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   184
  apply (frule bin_abs_lem)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   185
  apply (auto simp add : PPls PMin PBit)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   186
  done
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   187
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   188
lemma numeral_induct:
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   189
  assumes Pls: "P Int.Pls"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   190
  assumes Min: "P Int.Min"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   191
  assumes Bit0: "\<And>w. \<lbrakk>P w; w \<noteq> Int.Pls\<rbrakk> \<Longrightarrow> P (Int.Bit0 w)"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   192
  assumes Bit1: "\<And>w. \<lbrakk>P w; w \<noteq> Int.Min\<rbrakk> \<Longrightarrow> P (Int.Bit1 w)"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   193
  shows "P x"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   194
  apply (induct x rule: bin_induct)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   195
    apply (rule Pls)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   196
   apply (rule Min)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   197
  apply (case_tac bit)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   198
   apply (case_tac "bin = Int.Pls")
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   199
    apply simp
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   200
   apply (simp add: Bit0)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   201
  apply (case_tac "bin = Int.Min")
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   202
   apply simp
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   203
  apply (simp add: Bit1)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   204
  done
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   205
24465
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   206
lemma bin_rest_simps [simp]: 
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   207
  "bin_rest Int.Pls = Int.Pls"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   208
  "bin_rest Int.Min = Int.Min"
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   209
  "bin_rest (Int.Bit0 w) = w"
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   210
  "bin_rest (Int.Bit1 w) = w"
26514
eff55c0a6d34 tuned towards code generation
haftmann
parents: 26294
diff changeset
   211
  "bin_rest (w BIT b) = w"
24465
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   212
  unfolding bin_rest_def by auto
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   213
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 26827
diff changeset
   214
declare bin_rest_simps(1-4) [code]
26514
eff55c0a6d34 tuned towards code generation
haftmann
parents: 26294
diff changeset
   215
24465
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   216
lemma bin_last_simps [simp]: 
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   217
  "bin_last Int.Pls = bit.B0"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   218
  "bin_last Int.Min = bit.B1"
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   219
  "bin_last (Int.Bit0 w) = bit.B0"
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   220
  "bin_last (Int.Bit1 w) = bit.B1"
26514
eff55c0a6d34 tuned towards code generation
haftmann
parents: 26294
diff changeset
   221
  "bin_last (w BIT b) = b"
24465
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   222
  unfolding bin_last_def by auto
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   223
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 26827
diff changeset
   224
declare bin_last_simps(1-4) [code]
26514
eff55c0a6d34 tuned towards code generation
haftmann
parents: 26294
diff changeset
   225
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   226
lemma bin_r_l_extras [simp]:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   227
  "bin_last 0 = bit.B0"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   228
  "bin_last (- 1) = bit.B1"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   229
  "bin_last -1 = bit.B1"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   230
  "bin_last 1 = bit.B1"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   231
  "bin_rest 1 = 0"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   232
  "bin_rest 0 = 0"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   233
  "bin_rest (- 1) = - 1"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   234
  "bin_rest -1 = -1"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   235
  apply (unfold number_of_Min)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   236
  apply (unfold Pls_def [symmetric] Min_def [symmetric])
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   237
  apply (unfold numeral_1_eq_1 [symmetric])
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   238
  apply (auto simp: number_of_eq) 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   239
  done
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   240
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   241
lemma bin_last_mod: 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   242
  "bin_last w = (if w mod 2 = 0 then bit.B0 else bit.B1)"
24465
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   243
  apply (case_tac w rule: bin_exhaust)
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   244
  apply (case_tac b)
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   245
   apply auto
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   246
  done
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   247
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   248
lemma bin_rest_div: 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   249
  "bin_rest w = w div 2"
24465
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   250
  apply (case_tac w rule: bin_exhaust)
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   251
  apply (rule trans)
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   252
   apply clarsimp
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   253
   apply (rule refl)
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   254
  apply (drule trans)
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   255
   apply (rule Bit_def)
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   256
  apply (simp add: z1pdiv2 split: bit.split)
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   257
  done
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   258
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   259
lemma Bit_div2 [simp]: "(w BIT b) div 2 = w"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   260
  unfolding bin_rest_div [symmetric] by auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   261
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   262
lemma Bit0_div2 [simp]: "(Int.Bit0 w) div 2 = w"
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   263
  using Bit_div2 [where b=bit.B0] by simp
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   264
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   265
lemma Bit1_div2 [simp]: "(Int.Bit1 w) div 2 = w"
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   266
  using Bit_div2 [where b=bit.B1] by simp
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   267
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   268
lemma bin_nth_lem [rule_format]:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   269
  "ALL y. bin_nth x = bin_nth y --> x = y"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   270
  apply (induct x rule: bin_induct)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   271
    apply safe
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   272
    apply (erule rev_mp)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   273
    apply (induct_tac y rule: bin_induct)
26827
a62f8db42f4a Deleted subset_antisym in a few proofs, because it is
berghofe
parents: 26557
diff changeset
   274
      apply (safe del: subset_antisym)
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   275
      apply (drule_tac x=0 in fun_cong, force)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   276
     apply (erule notE, rule ext, 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   277
            drule_tac x="Suc x" in fun_cong, force)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   278
    apply (drule_tac x=0 in fun_cong, force)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   279
   apply (erule rev_mp)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   280
   apply (induct_tac y rule: bin_induct)
26827
a62f8db42f4a Deleted subset_antisym in a few proofs, because it is
berghofe
parents: 26557
diff changeset
   281
     apply (safe del: subset_antisym)
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   282
     apply (drule_tac x=0 in fun_cong, force)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   283
    apply (erule notE, rule ext, 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   284
           drule_tac x="Suc x" in fun_cong, force)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   285
   apply (drule_tac x=0 in fun_cong, force)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   286
  apply (case_tac y rule: bin_exhaust)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   287
  apply clarify
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   288
  apply (erule allE)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   289
  apply (erule impE)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   290
   prefer 2
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   291
   apply (erule BIT_eqI)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   292
   apply (drule_tac x=0 in fun_cong, force)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   293
  apply (rule ext)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   294
  apply (drule_tac x="Suc ?x" in fun_cong, force)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   295
  done
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   296
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   297
lemma bin_nth_eq_iff: "(bin_nth x = bin_nth y) = (x = y)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   298
  by (auto elim: bin_nth_lem)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   299
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   300
lemmas bin_eqI = ext [THEN bin_nth_eq_iff [THEN iffD1], standard]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   301
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   302
lemma bin_nth_Pls [simp]: "~ bin_nth Int.Pls n"
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   303
  by (induct n) auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   304
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   305
lemma bin_nth_Min [simp]: "bin_nth Int.Min n"
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   306
  by (induct n) auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   307
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   308
lemma bin_nth_0_BIT: "bin_nth (w BIT b) 0 = (b = bit.B1)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   309
  by auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   310
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   311
lemma bin_nth_Suc_BIT: "bin_nth (w BIT b) (Suc n) = bin_nth w n"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   312
  by auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   313
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   314
lemma bin_nth_minus [simp]: "0 < n ==> bin_nth (w BIT b) n = bin_nth w (n - 1)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   315
  by (cases n) auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   316
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   317
lemma bin_nth_minus_Bit0 [simp]:
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   318
  "0 < n ==> bin_nth (Int.Bit0 w) n = bin_nth w (n - 1)"
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   319
  using bin_nth_minus [where b=bit.B0] by simp
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   320
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   321
lemma bin_nth_minus_Bit1 [simp]:
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   322
  "0 < n ==> bin_nth (Int.Bit1 w) n = bin_nth w (n - 1)"
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   323
  using bin_nth_minus [where b=bit.B1] by simp
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   324
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   325
lemmas bin_nth_0 = bin_nth.simps(1)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   326
lemmas bin_nth_Suc = bin_nth.simps(2)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   327
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   328
lemmas bin_nth_simps = 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   329
  bin_nth_0 bin_nth_Suc bin_nth_Pls bin_nth_Min bin_nth_minus
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   330
  bin_nth_minus_Bit0 bin_nth_minus_Bit1
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   331
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   332
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   333
subsection {* Recursion combinator for binary integers *}
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   334
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   335
lemma brlem: "(bin = Int.Min) = (- bin + Int.pred 0 = 0)"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   336
  unfolding Min_def pred_def by arith
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   337
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   338
function
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   339
  bin_rec :: "'a \<Rightarrow> 'a \<Rightarrow> (int \<Rightarrow> bit \<Rightarrow> 'a \<Rightarrow> 'a) \<Rightarrow> int \<Rightarrow> 'a"  
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   340
where 
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   341
  "bin_rec f1 f2 f3 bin = (if bin = Int.Pls then f1 
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   342
    else if bin = Int.Min then f2
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   343
    else case bin_rl bin of (w, b) => f3 w b (bin_rec f1 f2 f3 w))"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   344
  by pat_completeness auto
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   345
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   346
termination 
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   347
  apply (relation "measure (nat o abs o snd o snd o snd)")
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   348
   apply simp
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   349
  apply (simp add: Pls_def brlem)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   350
  apply (clarsimp simp: bin_rl_char pred_def)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   351
  apply (frule thin_rl [THEN refl [THEN bin_abs_lem [rule_format]]]) 
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   352
    apply (unfold Pls_def Min_def number_of_eq)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   353
    prefer 2
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   354
    apply (erule asm_rl)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   355
   apply auto
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   356
  done
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   357
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   358
declare bin_rec.simps [simp del]
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   359
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   360
lemma bin_rec_PM:
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   361
  "f = bin_rec f1 f2 f3 ==> f Int.Pls = f1 & f Int.Min = f2"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   362
  by (auto simp add: bin_rec.simps)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   363
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   364
lemma bin_rec_Pls: "bin_rec f1 f2 f3 Int.Pls = f1"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   365
  by (simp add: bin_rec.simps)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   366
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   367
lemma bin_rec_Min: "bin_rec f1 f2 f3 Int.Min = f2"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   368
  by (simp add: bin_rec.simps)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   369
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   370
lemma bin_rec_Bit0:
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   371
  "f3 Int.Pls bit.B0 f1 = f1 \<Longrightarrow>
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   372
    bin_rec f1 f2 f3 (Int.Bit0 w) = f3 w bit.B0 (bin_rec f1 f2 f3 w)"
28959
9d35303719b5 fixed proofs due to changes in Int.thy
huffman
parents: 28562
diff changeset
   373
  by (simp add: bin_rec_Pls bin_rec.simps [of _ _ _ "Int.Bit0 w"])
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   374
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   375
lemma bin_rec_Bit1:
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   376
  "f3 Int.Min bit.B1 f2 = f2 \<Longrightarrow>
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   377
    bin_rec f1 f2 f3 (Int.Bit1 w) = f3 w bit.B1 (bin_rec f1 f2 f3 w)"
28959
9d35303719b5 fixed proofs due to changes in Int.thy
huffman
parents: 28562
diff changeset
   378
  by (simp add: bin_rec_Min bin_rec.simps [of _ _ _ "Int.Bit1 w"])
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   379
  
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   380
lemma bin_rec_Bit:
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   381
  "f = bin_rec f1 f2 f3  ==> f3 Int.Pls bit.B0 f1 = f1 ==> 
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   382
    f3 Int.Min bit.B1 f2 = f2 ==> f (w BIT b) = f3 w b (f w)"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   383
  by (cases b, simp add: bin_rec_Bit0, simp add: bin_rec_Bit1)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   384
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   385
lemmas bin_rec_simps = refl [THEN bin_rec_Bit] bin_rec_Pls bin_rec_Min
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   386
  bin_rec_Bit0 bin_rec_Bit1
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   387
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   388
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   389
subsection {* Truncating binary integers *}
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   390
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   391
definition
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 26827
diff changeset
   392
  bin_sign_def [code del] : "bin_sign = bin_rec Int.Pls Int.Min (%w b s. s)"
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   393
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   394
lemma bin_sign_simps [simp]:
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   395
  "bin_sign Int.Pls = Int.Pls"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   396
  "bin_sign Int.Min = Int.Min"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   397
  "bin_sign (Int.Bit0 w) = bin_sign w"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   398
  "bin_sign (Int.Bit1 w) = bin_sign w"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   399
  "bin_sign (w BIT b) = bin_sign w"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   400
  unfolding bin_sign_def by (auto simp: bin_rec_simps)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   401
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 26827
diff changeset
   402
declare bin_sign_simps(1-4) [code]
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   403
24364
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   404
lemma bin_sign_rest [simp]: 
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   405
  "bin_sign (bin_rest w) = (bin_sign w)"
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   406
  by (cases w rule: bin_exhaust) auto
24364
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   407
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   408
consts
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   409
  bintrunc :: "nat => int => int"
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   410
primrec 
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   411
  Z : "bintrunc 0 bin = Int.Pls"
24364
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   412
  Suc : "bintrunc (Suc n) bin = bintrunc n (bin_rest bin) BIT (bin_last bin)"
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   413
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   414
consts
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   415
  sbintrunc :: "nat => int => int" 
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   416
primrec 
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   417
  Z : "sbintrunc 0 bin = 
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   418
    (case bin_last bin of bit.B1 => Int.Min | bit.B0 => Int.Pls)"
24364
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   419
  Suc : "sbintrunc (Suc n) bin = sbintrunc n (bin_rest bin) BIT (bin_last bin)"
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   420
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   421
lemma sign_bintr:
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   422
  "!!w. bin_sign (bintrunc n w) = Int.Pls"
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   423
  by (induct n) auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   424
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   425
lemma bintrunc_mod2p:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   426
  "!!w. bintrunc n w = (w mod 2 ^ n :: int)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   427
  apply (induct n, clarsimp)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   428
  apply (simp add: bin_last_mod bin_rest_div Bit_def zmod_zmult2_eq
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   429
              cong: number_of_False_cong)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   430
  done
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   431
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   432
lemma sbintrunc_mod2p:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   433
  "!!w. sbintrunc n w = ((w + 2 ^ n) mod 2 ^ (Suc n) - 2 ^ n :: int)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   434
  apply (induct n)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   435
   apply clarsimp
30034
60f64f112174 removed redundant thms
nipkow
parents: 29631
diff changeset
   436
   apply (subst mod_add_left_eq)
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   437
   apply (simp add: bin_last_mod)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   438
   apply (simp add: number_of_eq)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   439
  apply clarsimp
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   440
  apply (simp add: bin_last_mod bin_rest_div Bit_def 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   441
              cong: number_of_False_cong)
30940
663af91c0720 zmod_zmult_zmult1 now subsumed by mod_mult_mult1
haftmann
parents: 30034
diff changeset
   442
  apply (clarsimp simp: mod_mult_mult1 [symmetric] 
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   443
         zmod_zdiv_equality [THEN diff_eq_eq [THEN iffD2 [THEN sym]]])
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   444
  apply (rule trans [symmetric, OF _ emep1])
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   445
     apply auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   446
  apply (auto simp: even_def)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   447
  done
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   448
24465
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   449
subsection "Simplifications for (s)bintrunc"
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   450
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   451
lemma bit_bool:
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   452
  "(b = (b' = bit.B1)) = (b' = (if b then bit.B1 else bit.B0))"
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   453
  by (cases b') auto
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   454
70f0214b3ecc revert to Word library version from 2007/08/20
huffman
parents: 24419
diff changeset
   455
lemmas bit_bool1 [simp] = refl [THEN bit_bool [THEN iffD1], symmetric]
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   456
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   457
lemma bin_sign_lem:
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   458
  "!!bin. (bin_sign (sbintrunc n bin) = Int.Min) = bin_nth bin n"
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   459
  apply (induct n)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   460
   apply (case_tac bin rule: bin_exhaust, case_tac b, auto)+
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   461
  done
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   462
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   463
lemma nth_bintr:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   464
  "!!w m. bin_nth (bintrunc m w) n = (n < m & bin_nth w n)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   465
  apply (induct n)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   466
   apply (case_tac m, auto)[1]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   467
  apply (case_tac m, auto)[1]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   468
  done
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   469
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   470
lemma nth_sbintr:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   471
  "!!w m. bin_nth (sbintrunc m w) n = 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   472
          (if n < m then bin_nth w n else bin_nth w m)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   473
  apply (induct n)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   474
   apply (case_tac m, simp_all split: bit.splits)[1]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   475
  apply (case_tac m, simp_all split: bit.splits)[1]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   476
  done
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   477
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   478
lemma bin_nth_Bit:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   479
  "bin_nth (w BIT b) n = (n = 0 & b = bit.B1 | (EX m. n = Suc m & bin_nth w m))"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   480
  by (cases n) auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   481
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   482
lemma bin_nth_Bit0:
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   483
  "bin_nth (Int.Bit0 w) n = (EX m. n = Suc m & bin_nth w m)"
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   484
  using bin_nth_Bit [where b=bit.B0] by simp
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   485
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   486
lemma bin_nth_Bit1:
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   487
  "bin_nth (Int.Bit1 w) n = (n = 0 | (EX m. n = Suc m & bin_nth w m))"
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   488
  using bin_nth_Bit [where b=bit.B1] by simp
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   489
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   490
lemma bintrunc_bintrunc_l:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   491
  "n <= m ==> (bintrunc m (bintrunc n w) = bintrunc n w)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   492
  by (rule bin_eqI) (auto simp add : nth_bintr)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   493
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   494
lemma sbintrunc_sbintrunc_l:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   495
  "n <= m ==> (sbintrunc m (sbintrunc n w) = sbintrunc n w)"
32439
7a91c7bcfe7e tuned proofs
nipkow
parents: 30971
diff changeset
   496
  by (rule bin_eqI) (auto simp: nth_sbintr)
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   497
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   498
lemma bintrunc_bintrunc_ge:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   499
  "n <= m ==> (bintrunc n (bintrunc m w) = bintrunc n w)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   500
  by (rule bin_eqI) (auto simp: nth_bintr)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   501
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   502
lemma bintrunc_bintrunc_min [simp]:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   503
  "bintrunc m (bintrunc n w) = bintrunc (min m n) w"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   504
  apply (rule bin_eqI)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   505
  apply (auto simp: nth_bintr)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   506
  done
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   507
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   508
lemma sbintrunc_sbintrunc_min [simp]:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   509
  "sbintrunc m (sbintrunc n w) = sbintrunc (min m n) w"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   510
  apply (rule bin_eqI)
32642
026e7c6a6d08 be more cautious wrt. simp rules: inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp rules by default any longer
haftmann
parents: 32439
diff changeset
   511
  apply (auto simp: nth_sbintr min_max.inf_absorb1 min_max.inf_absorb2)
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   512
  done
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   513
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   514
lemmas bintrunc_Pls = 
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   515
  bintrunc.Suc [where bin="Int.Pls", simplified bin_last_simps bin_rest_simps, standard]
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   516
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   517
lemmas bintrunc_Min [simp] = 
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   518
  bintrunc.Suc [where bin="Int.Min", simplified bin_last_simps bin_rest_simps, standard]
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   519
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   520
lemmas bintrunc_BIT  [simp] = 
25349
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   521
  bintrunc.Suc [where bin="w BIT b", simplified bin_last_simps bin_rest_simps, standard]
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   522
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   523
lemma bintrunc_Bit0 [simp]:
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   524
  "bintrunc (Suc n) (Int.Bit0 w) = Int.Bit0 (bintrunc n w)"
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   525
  using bintrunc_BIT [where b=bit.B0] by simp
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   526
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   527
lemma bintrunc_Bit1 [simp]:
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   528
  "bintrunc (Suc n) (Int.Bit1 w) = Int.Bit1 (bintrunc n w)"
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   529
  using bintrunc_BIT [where b=bit.B1] by simp
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   530
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   531
lemmas bintrunc_Sucs = bintrunc_Pls bintrunc_Min bintrunc_BIT
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   532
  bintrunc_Bit0 bintrunc_Bit1
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   533
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   534
lemmas sbintrunc_Suc_Pls = 
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   535
  sbintrunc.Suc [where bin="Int.Pls", simplified bin_last_simps bin_rest_simps, standard]
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   536
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   537
lemmas sbintrunc_Suc_Min = 
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   538
  sbintrunc.Suc [where bin="Int.Min", simplified bin_last_simps bin_rest_simps, standard]
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   539
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   540
lemmas sbintrunc_Suc_BIT [simp] = 
25349
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   541
  sbintrunc.Suc [where bin="w BIT b", simplified bin_last_simps bin_rest_simps, standard]
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   542
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   543
lemma sbintrunc_Suc_Bit0 [simp]:
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   544
  "sbintrunc (Suc n) (Int.Bit0 w) = Int.Bit0 (sbintrunc n w)"
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   545
  using sbintrunc_Suc_BIT [where b=bit.B0] by simp
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   546
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   547
lemma sbintrunc_Suc_Bit1 [simp]:
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   548
  "sbintrunc (Suc n) (Int.Bit1 w) = Int.Bit1 (sbintrunc n w)"
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   549
  using sbintrunc_Suc_BIT [where b=bit.B1] by simp
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   550
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   551
lemmas sbintrunc_Sucs = sbintrunc_Suc_Pls sbintrunc_Suc_Min sbintrunc_Suc_BIT
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   552
  sbintrunc_Suc_Bit0 sbintrunc_Suc_Bit1
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   553
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   554
lemmas sbintrunc_Pls = 
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   555
  sbintrunc.Z [where bin="Int.Pls", 
25349
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   556
               simplified bin_last_simps bin_rest_simps bit.simps, standard]
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   557
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   558
lemmas sbintrunc_Min = 
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   559
  sbintrunc.Z [where bin="Int.Min", 
25349
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   560
               simplified bin_last_simps bin_rest_simps bit.simps, standard]
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   561
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   562
lemmas sbintrunc_0_BIT_B0 [simp] = 
25349
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   563
  sbintrunc.Z [where bin="w BIT bit.B0", 
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   564
               simplified bin_last_simps bin_rest_simps bit.simps, standard]
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   565
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   566
lemmas sbintrunc_0_BIT_B1 [simp] = 
25349
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   567
  sbintrunc.Z [where bin="w BIT bit.B1", 
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   568
               simplified bin_last_simps bin_rest_simps bit.simps, standard]
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   569
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   570
lemma sbintrunc_0_Bit0 [simp]: "sbintrunc 0 (Int.Bit0 w) = Int.Pls"
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   571
  using sbintrunc_0_BIT_B0 by simp
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   572
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   573
lemma sbintrunc_0_Bit1 [simp]: "sbintrunc 0 (Int.Bit1 w) = Int.Min"
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   574
  using sbintrunc_0_BIT_B1 by simp
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   575
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   576
lemmas sbintrunc_0_simps =
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   577
  sbintrunc_Pls sbintrunc_Min sbintrunc_0_BIT_B0 sbintrunc_0_BIT_B1
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   578
  sbintrunc_0_Bit0 sbintrunc_0_Bit1
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   579
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   580
lemmas bintrunc_simps = bintrunc.Z bintrunc_Sucs
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   581
lemmas sbintrunc_simps = sbintrunc_0_simps sbintrunc_Sucs
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   582
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   583
lemma bintrunc_minus:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   584
  "0 < n ==> bintrunc (Suc (n - 1)) w = bintrunc n w"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   585
  by auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   586
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   587
lemma sbintrunc_minus:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   588
  "0 < n ==> sbintrunc (Suc (n - 1)) w = sbintrunc n w"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   589
  by auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   590
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   591
lemmas bintrunc_minus_simps = 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   592
  bintrunc_Sucs [THEN [2] bintrunc_minus [symmetric, THEN trans], standard]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   593
lemmas sbintrunc_minus_simps = 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   594
  sbintrunc_Sucs [THEN [2] sbintrunc_minus [symmetric, THEN trans], standard]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   595
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   596
lemma bintrunc_n_Pls [simp]:
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   597
  "bintrunc n Int.Pls = Int.Pls"
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   598
  by (induct n) auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   599
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   600
lemma sbintrunc_n_PM [simp]:
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   601
  "sbintrunc n Int.Pls = Int.Pls"
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   602
  "sbintrunc n Int.Min = Int.Min"
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   603
  by (induct n) auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   604
25349
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   605
lemmas thobini1 = arg_cong [where f = "%w. w BIT b", standard]
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   606
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   607
lemmas bintrunc_BIT_I = trans [OF bintrunc_BIT thobini1]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   608
lemmas bintrunc_Min_I = trans [OF bintrunc_Min thobini1]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   609
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   610
lemmas bmsts = bintrunc_minus_simps(1-3) [THEN thobini1 [THEN [2] trans], standard]
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   611
lemmas bintrunc_Pls_minus_I = bmsts(1)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   612
lemmas bintrunc_Min_minus_I = bmsts(2)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   613
lemmas bintrunc_BIT_minus_I = bmsts(3)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   614
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   615
lemma bintrunc_0_Min: "bintrunc 0 Int.Min = Int.Pls"
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   616
  by auto
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   617
lemma bintrunc_0_BIT: "bintrunc 0 (w BIT b) = Int.Pls"
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   618
  by auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   619
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   620
lemma bintrunc_Suc_lem:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   621
  "bintrunc (Suc n) x = y ==> m = Suc n ==> bintrunc m x = y"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   622
  by auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   623
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   624
lemmas bintrunc_Suc_Ialts = 
26294
c5fe289de634 fixed broken bintrunc lemma
kleing
parents: 26086
diff changeset
   625
  bintrunc_Min_I [THEN bintrunc_Suc_lem, standard]
c5fe289de634 fixed broken bintrunc lemma
kleing
parents: 26086
diff changeset
   626
  bintrunc_BIT_I [THEN bintrunc_Suc_lem, standard]
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   627
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   628
lemmas sbintrunc_BIT_I = trans [OF sbintrunc_Suc_BIT thobini1]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   629
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   630
lemmas sbintrunc_Suc_Is = 
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   631
  sbintrunc_Sucs(1-3) [THEN thobini1 [THEN [2] trans], standard]
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   632
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   633
lemmas sbintrunc_Suc_minus_Is = 
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   634
  sbintrunc_minus_simps(1-3) [THEN thobini1 [THEN [2] trans], standard]
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   635
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   636
lemma sbintrunc_Suc_lem:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   637
  "sbintrunc (Suc n) x = y ==> m = Suc n ==> sbintrunc m x = y"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   638
  by auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   639
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   640
lemmas sbintrunc_Suc_Ialts = 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   641
  sbintrunc_Suc_Is [THEN sbintrunc_Suc_lem, standard]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   642
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   643
lemma sbintrunc_bintrunc_lt:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   644
  "m > n ==> sbintrunc n (bintrunc m w) = sbintrunc n w"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   645
  by (rule bin_eqI) (auto simp: nth_sbintr nth_bintr)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   646
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   647
lemma bintrunc_sbintrunc_le:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   648
  "m <= Suc n ==> bintrunc m (sbintrunc n w) = bintrunc m w"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   649
  apply (rule bin_eqI)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   650
  apply (auto simp: nth_sbintr nth_bintr)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   651
   apply (subgoal_tac "x=n", safe, arith+)[1]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   652
  apply (subgoal_tac "x=n", safe, arith+)[1]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   653
  done
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   654
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   655
lemmas bintrunc_sbintrunc [simp] = order_refl [THEN bintrunc_sbintrunc_le]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   656
lemmas sbintrunc_bintrunc [simp] = lessI [THEN sbintrunc_bintrunc_lt]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   657
lemmas bintrunc_bintrunc [simp] = order_refl [THEN bintrunc_bintrunc_l]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   658
lemmas sbintrunc_sbintrunc [simp] = order_refl [THEN sbintrunc_sbintrunc_l] 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   659
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   660
lemma bintrunc_sbintrunc' [simp]:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   661
  "0 < n \<Longrightarrow> bintrunc n (sbintrunc (n - 1) w) = bintrunc n w"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   662
  by (cases n) (auto simp del: bintrunc.Suc)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   663
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   664
lemma sbintrunc_bintrunc' [simp]:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   665
  "0 < n \<Longrightarrow> sbintrunc (n - 1) (bintrunc n w) = sbintrunc (n - 1) w"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   666
  by (cases n) (auto simp del: bintrunc.Suc)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   667
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   668
lemma bin_sbin_eq_iff: 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   669
  "bintrunc (Suc n) x = bintrunc (Suc n) y <-> 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   670
   sbintrunc n x = sbintrunc n y"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   671
  apply (rule iffI)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   672
   apply (rule box_equals [OF _ sbintrunc_bintrunc sbintrunc_bintrunc])
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   673
   apply simp
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   674
  apply (rule box_equals [OF _ bintrunc_sbintrunc bintrunc_sbintrunc])
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   675
  apply simp
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   676
  done
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   677
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   678
lemma bin_sbin_eq_iff':
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   679
  "0 < n \<Longrightarrow> bintrunc n x = bintrunc n y <-> 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   680
            sbintrunc (n - 1) x = sbintrunc (n - 1) y"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   681
  by (cases n) (simp_all add: bin_sbin_eq_iff del: bintrunc.Suc)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   682
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   683
lemmas bintrunc_sbintruncS0 [simp] = bintrunc_sbintrunc' [unfolded One_nat_def]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   684
lemmas sbintrunc_bintruncS0 [simp] = sbintrunc_bintrunc' [unfolded One_nat_def]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   685
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   686
lemmas bintrunc_bintrunc_l' = le_add1 [THEN bintrunc_bintrunc_l]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   687
lemmas sbintrunc_sbintrunc_l' = le_add1 [THEN sbintrunc_sbintrunc_l]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   688
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   689
(* although bintrunc_minus_simps, if added to default simpset,
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   690
  tends to get applied where it's not wanted in developing the theories,
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   691
  we get a version for when the word length is given literally *)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   692
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   693
lemmas nat_non0_gr = 
25134
3d4953e88449 Eliminated most of the neq0_conv occurrences. As a result, many
nipkow
parents: 24465
diff changeset
   694
  trans [OF iszero_def [THEN Not_eq_iff [THEN iffD2]] refl, standard]
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   695
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   696
lemmas bintrunc_pred_simps [simp] = 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   697
  bintrunc_minus_simps [of "number_of bin", simplified nobm1, standard]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   698
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   699
lemmas sbintrunc_pred_simps [simp] = 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   700
  sbintrunc_minus_simps [of "number_of bin", simplified nobm1, standard]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   701
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   702
lemma no_bintr_alt:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   703
  "number_of (bintrunc n w) = w mod 2 ^ n"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   704
  by (simp add: number_of_eq bintrunc_mod2p)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   705
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   706
lemma no_bintr_alt1: "bintrunc n = (%w. w mod 2 ^ n :: int)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   707
  by (rule ext) (rule bintrunc_mod2p)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   708
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   709
lemma range_bintrunc: "range (bintrunc n) = {i. 0 <= i & i < 2 ^ n}"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   710
  apply (unfold no_bintr_alt1)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   711
  apply (auto simp add: image_iff)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   712
  apply (rule exI)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   713
  apply (auto intro: int_mod_lem [THEN iffD1, symmetric])
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   714
  done
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   715
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   716
lemma no_bintr: 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   717
  "number_of (bintrunc n w) = (number_of w mod 2 ^ n :: int)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   718
  by (simp add : bintrunc_mod2p number_of_eq)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   719
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   720
lemma no_sbintr_alt2: 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   721
  "sbintrunc n = (%w. (w + 2 ^ n) mod 2 ^ Suc n - 2 ^ n :: int)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   722
  by (rule ext) (simp add : sbintrunc_mod2p)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   723
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   724
lemma no_sbintr: 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   725
  "number_of (sbintrunc n w) = 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   726
   ((number_of w + 2 ^ n) mod 2 ^ Suc n - 2 ^ n :: int)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   727
  by (simp add : no_sbintr_alt2 number_of_eq)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   728
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   729
lemma range_sbintrunc: 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   730
  "range (sbintrunc n) = {i. - (2 ^ n) <= i & i < 2 ^ n}"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   731
  apply (unfold no_sbintr_alt2)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   732
  apply (auto simp add: image_iff eq_diff_eq)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   733
  apply (rule exI)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   734
  apply (auto intro: int_mod_lem [THEN iffD1, symmetric])
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   735
  done
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   736
25349
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   737
lemma sb_inc_lem:
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   738
  "(a::int) + 2^k < 0 \<Longrightarrow> a + 2^k + 2^(Suc k) <= (a + 2^k) mod 2^(Suc k)"
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   739
  apply (erule int_mod_ge' [where n = "2 ^ (Suc k)" and b = "a + 2 ^ k", simplified zless2p])
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   740
  apply (rule TrueI)
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   741
  done
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   742
25349
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   743
lemma sb_inc_lem':
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   744
  "(a::int) < - (2^k) \<Longrightarrow> a + 2^k + 2^(Suc k) <= (a + 2^k) mod 2^(Suc k)"
35048
82ab78fff970 tuned proofs
haftmann
parents: 32642
diff changeset
   745
  by (rule sb_inc_lem) simp
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   746
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   747
lemma sbintrunc_inc:
25349
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   748
  "x < - (2^n) ==> x + 2^(Suc n) <= sbintrunc n x"
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   749
  unfolding no_sbintr_alt2 by (drule sb_inc_lem') simp
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   750
25349
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   751
lemma sb_dec_lem:
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   752
  "(0::int) <= - (2^k) + a ==> (a + 2^k) mod (2 * 2 ^ k) <= - (2 ^ k) + a"
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   753
  by (rule int_mod_le' [where n = "2 ^ (Suc k)" and b = "a + 2 ^ k",
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   754
    simplified zless2p, OF _ TrueI, simplified])
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   755
25349
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   756
lemma sb_dec_lem':
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   757
  "(2::int) ^ k <= a ==> (a + 2 ^ k) mod (2 * 2 ^ k) <= - (2 ^ k) + a"
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   758
  by (rule iffD1 [OF diff_le_eq', THEN sb_dec_lem, simplified])
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   759
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   760
lemma sbintrunc_dec:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   761
  "x >= (2 ^ n) ==> x - 2 ^ (Suc n) >= sbintrunc n x"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   762
  unfolding no_sbintr_alt2 by (drule sb_dec_lem') simp
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   763
25349
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   764
lemmas zmod_uminus' = zmod_uminus [where b="c", standard]
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   765
lemmas zpower_zmod' = zpower_zmod [where m="c" and y="k", standard]
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   766
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   767
lemmas brdmod1s' [symmetric] = 
30034
60f64f112174 removed redundant thms
nipkow
parents: 29631
diff changeset
   768
  mod_add_left_eq mod_add_right_eq 
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   769
  zmod_zsub_left_eq zmod_zsub_right_eq 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   770
  zmod_zmult1_eq zmod_zmult1_eq_rev 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   771
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   772
lemmas brdmods' [symmetric] = 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   773
  zpower_zmod' [symmetric]
30034
60f64f112174 removed redundant thms
nipkow
parents: 29631
diff changeset
   774
  trans [OF mod_add_left_eq mod_add_right_eq] 
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   775
  trans [OF zmod_zsub_left_eq zmod_zsub_right_eq] 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   776
  trans [OF zmod_zmult1_eq zmod_zmult1_eq_rev] 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   777
  zmod_uminus' [symmetric]
30034
60f64f112174 removed redundant thms
nipkow
parents: 29631
diff changeset
   778
  mod_add_left_eq [where b = "1::int"]
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   779
  zmod_zsub_left_eq [where b = "1"]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   780
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   781
lemmas bintr_arith1s =
30034
60f64f112174 removed redundant thms
nipkow
parents: 29631
diff changeset
   782
  brdmod1s' [where c="2^n::int", folded pred_def succ_def bintrunc_mod2p, standard]
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   783
lemmas bintr_ariths =
30034
60f64f112174 removed redundant thms
nipkow
parents: 29631
diff changeset
   784
  brdmods' [where c="2^n::int", folded pred_def succ_def bintrunc_mod2p, standard]
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   785
25349
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   786
lemmas m2pths = pos_mod_sign pos_mod_bound [OF zless2p, standard] 
24364
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   787
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   788
lemma bintr_ge0: "(0 :: int) <= number_of (bintrunc n w)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   789
  by (simp add : no_bintr m2pths)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   790
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   791
lemma bintr_lt2p: "number_of (bintrunc n w) < (2 ^ n :: int)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   792
  by (simp add : no_bintr m2pths)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   793
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   794
lemma bintr_Min: 
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   795
  "number_of (bintrunc n Int.Min) = (2 ^ n :: int) - 1"
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   796
  by (simp add : no_bintr m1mod2k)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   797
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   798
lemma sbintr_ge: "(- (2 ^ n) :: int) <= number_of (sbintrunc n w)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   799
  by (simp add : no_sbintr m2pths)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   800
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   801
lemma sbintr_lt: "number_of (sbintrunc n w) < (2 ^ n :: int)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   802
  by (simp add : no_sbintr m2pths)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   803
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   804
lemma bintrunc_Suc:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   805
  "bintrunc (Suc n) bin = bintrunc n (bin_rest bin) BIT bin_last bin"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   806
  by (case_tac bin rule: bin_exhaust) auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   807
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   808
lemma sign_Pls_ge_0: 
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   809
  "(bin_sign bin = Int.Pls) = (number_of bin >= (0 :: int))"
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   810
  by (induct bin rule: numeral_induct) auto
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   811
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   812
lemma sign_Min_lt_0: 
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   813
  "(bin_sign bin = Int.Min) = (number_of bin < (0 :: int))"
26086
3c243098b64a New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents: 25919
diff changeset
   814
  by (induct bin rule: numeral_induct) auto
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   815
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   816
lemmas sign_Min_neg = trans [OF sign_Min_lt_0 neg_def [symmetric]] 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   817
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   818
lemma bin_rest_trunc:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   819
  "!!bin. (bin_rest (bintrunc n bin)) = bintrunc (n - 1) (bin_rest bin)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   820
  by (induct n) auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   821
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   822
lemma bin_rest_power_trunc [rule_format] :
30971
7fbebf75b3ef funpow and relpow with shared "^^" syntax
haftmann
parents: 30952
diff changeset
   823
  "(bin_rest ^^ k) (bintrunc n bin) = 
7fbebf75b3ef funpow and relpow with shared "^^" syntax
haftmann
parents: 30952
diff changeset
   824
    bintrunc (n - k) ((bin_rest ^^ k) bin)"
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   825
  by (induct k) (auto simp: bin_rest_trunc)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   826
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   827
lemma bin_rest_trunc_i:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   828
  "bintrunc n (bin_rest bin) = bin_rest (bintrunc (Suc n) bin)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   829
  by auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   830
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   831
lemma bin_rest_strunc:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   832
  "!!bin. bin_rest (sbintrunc (Suc n) bin) = sbintrunc n (bin_rest bin)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   833
  by (induct n) auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   834
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   835
lemma bintrunc_rest [simp]: 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   836
  "!!bin. bintrunc n (bin_rest (bintrunc n bin)) = bin_rest (bintrunc n bin)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   837
  apply (induct n, simp)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   838
  apply (case_tac bin rule: bin_exhaust)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   839
  apply (auto simp: bintrunc_bintrunc_l)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   840
  done
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   841
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   842
lemma sbintrunc_rest [simp]:
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   843
  "!!bin. sbintrunc n (bin_rest (sbintrunc n bin)) = bin_rest (sbintrunc n bin)"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   844
  apply (induct n, simp)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   845
  apply (case_tac bin rule: bin_exhaust)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   846
  apply (auto simp: bintrunc_bintrunc_l split: bit.splits)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   847
  done
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   848
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   849
lemma bintrunc_rest':
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   850
  "bintrunc n o bin_rest o bintrunc n = bin_rest o bintrunc n"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   851
  by (rule ext) auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   852
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   853
lemma sbintrunc_rest' :
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   854
  "sbintrunc n o bin_rest o sbintrunc n = bin_rest o sbintrunc n"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   855
  by (rule ext) auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   856
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   857
lemma rco_lem:
30971
7fbebf75b3ef funpow and relpow with shared "^^" syntax
haftmann
parents: 30952
diff changeset
   858
  "f o g o f = g o f ==> f o (g o f) ^^ n = g ^^ n o f"
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   859
  apply (rule ext)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   860
  apply (induct_tac n)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   861
   apply (simp_all (no_asm))
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   862
  apply (drule fun_cong)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   863
  apply (unfold o_def)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   864
  apply (erule trans)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   865
  apply simp
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   866
  done
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   867
30971
7fbebf75b3ef funpow and relpow with shared "^^" syntax
haftmann
parents: 30952
diff changeset
   868
lemma rco_alt: "(f o g) ^^ n o f = f o (g o f) ^^ n"
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   869
  apply (rule ext)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   870
  apply (induct n)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   871
   apply (simp_all add: o_def)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   872
  done
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   873
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   874
lemmas rco_bintr = bintrunc_rest' 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   875
  [THEN rco_lem [THEN fun_cong], unfolded o_def]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   876
lemmas rco_sbintr = sbintrunc_rest' 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   877
  [THEN rco_lem [THEN fun_cong], unfolded o_def]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   878
24364
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   879
subsection {* Splitting and concatenation *}
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   880
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   881
primrec bin_split :: "nat \<Rightarrow> int \<Rightarrow> int \<times> int" where
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   882
  Z: "bin_split 0 w = (w, Int.Pls)"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   883
  | Suc: "bin_split (Suc n) w = (let (w1, w2) = bin_split n (bin_rest w)
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   884
        in (w1, w2 BIT bin_last w))"
24364
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   885
26557
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   886
primrec bin_cat :: "int \<Rightarrow> nat \<Rightarrow> int \<Rightarrow> int" where
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   887
  Z: "bin_cat w 0 v = w"
9e7f95903b24 more new primrec
haftmann
parents: 26514
diff changeset
   888
  | Suc: "bin_cat w (Suc n) v = bin_cat w n (bin_rest v) BIT bin_last v"
24364
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   889
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   890
subsection {* Miscellaneous lemmas *}
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   891
30952
7ab2716dd93b power operation on functions with syntax o^; power operation on relations with syntax ^^
haftmann
parents: 30940
diff changeset
   892
lemma funpow_minus_simp:
30971
7fbebf75b3ef funpow and relpow with shared "^^" syntax
haftmann
parents: 30952
diff changeset
   893
  "0 < n \<Longrightarrow> f ^^ n = f \<circ> f ^^ (n - 1)"
30952
7ab2716dd93b power operation on functions with syntax o^; power operation on relations with syntax ^^
haftmann
parents: 30940
diff changeset
   894
  by (cases n) simp_all
24364
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   895
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   896
lemmas funpow_pred_simp [simp] =
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   897
  funpow_minus_simp [of "number_of bin", simplified nobm1, standard]
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   898
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   899
lemmas replicate_minus_simp = 
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   900
  trans [OF gen_minus [where f = "%n. replicate n x"] replicate.replicate_Suc,
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   901
         standard]
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   902
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   903
lemmas replicate_pred_simp [simp] =
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   904
  replicate_minus_simp [of "number_of bin", simplified nobm1, standard]
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   905
25349
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   906
lemmas power_Suc_no [simp] = power_Suc [of "number_of a", standard]
24364
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   907
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   908
lemmas power_minus_simp = 
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   909
  trans [OF gen_minus [where f = "power f"] power_Suc, standard]
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   910
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   911
lemmas power_pred_simp = 
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   912
  power_minus_simp [of "number_of bin", simplified nobm1, standard]
25349
0d46bea01741 eliminated illegal schematic variables in where/of;
wenzelm
parents: 25134
diff changeset
   913
lemmas power_pred_simp_no [simp] = power_pred_simp [where f= "number_of f", standard]
24364
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   914
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   915
lemma list_exhaust_size_gt0:
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   916
  assumes y: "\<And>a list. y = a # list \<Longrightarrow> P"
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   917
  shows "0 < length y \<Longrightarrow> P"
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   918
  apply (cases y, simp)
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   919
  apply (rule y)
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   920
  apply fastsimp
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   921
  done
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   922
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   923
lemma list_exhaust_size_eq0:
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   924
  assumes y: "y = [] \<Longrightarrow> P"
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   925
  shows "length y = 0 \<Longrightarrow> P"
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   926
  apply (cases y)
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   927
   apply (rule y, simp)
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   928
  apply simp
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   929
  done
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   930
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   931
lemma size_Cons_lem_eq:
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   932
  "y = xa # list ==> size y = Suc k ==> size list = k"
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   933
  by auto
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   934
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   935
lemma size_Cons_lem_eq_bin:
25919
8b1c0d434824 joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents: 25349
diff changeset
   936
  "y = xa # list ==> size y = number_of (Int.succ k) ==> 
24364
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   937
    size list = number_of k"
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   938
  by (auto simp: pred_def succ_def split add : split_if_asm)
31e359126ab6 reorganize into subsections
huffman
parents: 24350
diff changeset
   939
24333
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   940
lemmas ls_splits = 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   941
  prod.split split_split prod.split_asm split_split_asm split_if_asm
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   942
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   943
lemma not_B1_is_B0: "y \<noteq> bit.B1 \<Longrightarrow> y = bit.B0"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   944
  by (cases y) auto
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   945
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   946
lemma B1_ass_B0: 
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   947
  assumes y: "y = bit.B0 \<Longrightarrow> y = bit.B1"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   948
  shows "y = bit.B1"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   949
  apply (rule classical)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   950
  apply (drule not_B1_is_B0)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   951
  apply (erule y)
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   952
  done
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   953
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   954
-- "simplifications for specific word lengths"
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   955
lemmas n2s_ths [THEN eq_reflection] = add_2_eq_Suc add_2_eq_Suc'
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   956
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   957
lemmas s2n_ths = n2s_ths [symmetric]
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   958
e77ea0ea7f2c * HOL-Word:
kleing
parents:
diff changeset
   959
end