src/HOL/List.thy
author haftmann
Wed Oct 27 16:40:31 2010 +0200 (2010-10-27)
changeset 40210 aee7ef725330
parent 40195 430fff4a9167
child 40230 be5c622e1de2
permissions -rw-r--r--
sorting: avoid _key suffix if lemma applies both to simple and generalized variant; generalized insort_insert to insort_insert_key; additional lemmas
wenzelm@13462
     1
(*  Title:      HOL/List.thy
wenzelm@13462
     2
    Author:     Tobias Nipkow
clasohm@923
     3
*)
clasohm@923
     4
wenzelm@13114
     5
header {* The datatype of finite lists *}
wenzelm@13122
     6
nipkow@15131
     7
theory List
haftmann@40195
     8
imports Plain Presburger Recdef Code_Numeral Quotient ATP
haftmann@31055
     9
uses ("Tools/list_code.ML")
nipkow@15131
    10
begin
clasohm@923
    11
wenzelm@13142
    12
datatype 'a list =
wenzelm@13366
    13
    Nil    ("[]")
wenzelm@13366
    14
  | Cons 'a  "'a list"    (infixr "#" 65)
clasohm@923
    15
haftmann@34941
    16
syntax
haftmann@34941
    17
  -- {* list Enumeration *}
wenzelm@35115
    18
  "_list" :: "args => 'a list"    ("[(_)]")
haftmann@34941
    19
haftmann@34941
    20
translations
haftmann@34941
    21
  "[x, xs]" == "x#[xs]"
haftmann@34941
    22
  "[x]" == "x#[]"
haftmann@34941
    23
wenzelm@35115
    24
wenzelm@35115
    25
subsection {* Basic list processing functions *}
nipkow@15302
    26
haftmann@34941
    27
primrec
haftmann@34941
    28
  hd :: "'a list \<Rightarrow> 'a" where
haftmann@34941
    29
  "hd (x # xs) = x"
haftmann@34941
    30
haftmann@34941
    31
primrec
haftmann@34941
    32
  tl :: "'a list \<Rightarrow> 'a list" where
haftmann@34941
    33
    "tl [] = []"
haftmann@34941
    34
  | "tl (x # xs) = xs"
haftmann@34941
    35
haftmann@34941
    36
primrec
haftmann@34941
    37
  last :: "'a list \<Rightarrow> 'a" where
haftmann@34941
    38
  "last (x # xs) = (if xs = [] then x else last xs)"
haftmann@34941
    39
haftmann@34941
    40
primrec
haftmann@34941
    41
  butlast :: "'a list \<Rightarrow> 'a list" where
haftmann@34941
    42
    "butlast []= []"
haftmann@34941
    43
  | "butlast (x # xs) = (if xs = [] then [] else x # butlast xs)"
haftmann@34941
    44
haftmann@34941
    45
primrec
haftmann@34941
    46
  set :: "'a list \<Rightarrow> 'a set" where
haftmann@34941
    47
    "set [] = {}"
haftmann@34941
    48
  | "set (x # xs) = insert x (set xs)"
haftmann@34941
    49
haftmann@34941
    50
primrec
haftmann@34941
    51
  map :: "('a \<Rightarrow> 'b) \<Rightarrow> 'a list \<Rightarrow> 'b list" where
haftmann@34941
    52
    "map f [] = []"
haftmann@34941
    53
  | "map f (x # xs) = f x # map f xs"
haftmann@34941
    54
haftmann@34941
    55
primrec
haftmann@34941
    56
  append :: "'a list \<Rightarrow> 'a list \<Rightarrow> 'a list" (infixr "@" 65) where
haftmann@34941
    57
    append_Nil:"[] @ ys = ys"
haftmann@34941
    58
  | append_Cons: "(x#xs) @ ys = x # xs @ ys"
haftmann@34941
    59
haftmann@34941
    60
primrec
haftmann@34941
    61
  rev :: "'a list \<Rightarrow> 'a list" where
haftmann@34941
    62
    "rev [] = []"
haftmann@34941
    63
  | "rev (x # xs) = rev xs @ [x]"
haftmann@34941
    64
haftmann@34941
    65
primrec
haftmann@34941
    66
  filter:: "('a \<Rightarrow> bool) \<Rightarrow> 'a list \<Rightarrow> 'a list" where
haftmann@34941
    67
    "filter P [] = []"
haftmann@34941
    68
  | "filter P (x # xs) = (if P x then x # filter P xs else filter P xs)"
haftmann@34941
    69
haftmann@34941
    70
syntax
haftmann@34941
    71
  -- {* Special syntax for filter *}
wenzelm@35115
    72
  "_filter" :: "[pttrn, 'a list, bool] => 'a list"    ("(1[_<-_./ _])")
haftmann@34941
    73
haftmann@34941
    74
translations
haftmann@34941
    75
  "[x<-xs . P]"== "CONST filter (%x. P) xs"
haftmann@34941
    76
haftmann@34941
    77
syntax (xsymbols)
wenzelm@35115
    78
  "_filter" :: "[pttrn, 'a list, bool] => 'a list"("(1[_\<leftarrow>_ ./ _])")
haftmann@34941
    79
syntax (HTML output)
wenzelm@35115
    80
  "_filter" :: "[pttrn, 'a list, bool] => 'a list"("(1[_\<leftarrow>_ ./ _])")
haftmann@34941
    81
haftmann@34941
    82
primrec
haftmann@34941
    83
  foldl :: "('b \<Rightarrow> 'a \<Rightarrow> 'b) \<Rightarrow> 'b \<Rightarrow> 'a list \<Rightarrow> 'b" where
haftmann@34941
    84
    foldl_Nil: "foldl f a [] = a"
haftmann@34941
    85
  | foldl_Cons: "foldl f a (x # xs) = foldl f (f a x) xs"
haftmann@34941
    86
haftmann@34941
    87
primrec
haftmann@34941
    88
  foldr :: "('a \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'a list \<Rightarrow> 'b \<Rightarrow> 'b" where
haftmann@34941
    89
    "foldr f [] a = a"
haftmann@34941
    90
  | "foldr f (x # xs) a = f x (foldr f xs a)"
haftmann@34941
    91
haftmann@34941
    92
primrec
haftmann@34941
    93
  concat:: "'a list list \<Rightarrow> 'a list" where
haftmann@34941
    94
    "concat [] = []"
haftmann@34941
    95
  | "concat (x # xs) = x @ concat xs"
haftmann@34941
    96
haftmann@39774
    97
definition (in monoid_add)
haftmann@34941
    98
  listsum :: "'a list \<Rightarrow> 'a" where
haftmann@39774
    99
  "listsum xs = foldr plus xs 0"
haftmann@34941
   100
haftmann@34941
   101
primrec
haftmann@34941
   102
  drop:: "nat \<Rightarrow> 'a list \<Rightarrow> 'a list" where
haftmann@34941
   103
    drop_Nil: "drop n [] = []"
haftmann@34941
   104
  | drop_Cons: "drop n (x # xs) = (case n of 0 \<Rightarrow> x # xs | Suc m \<Rightarrow> drop m xs)"
haftmann@34941
   105
  -- {*Warning: simpset does not contain this definition, but separate
haftmann@34941
   106
       theorems for @{text "n = 0"} and @{text "n = Suc k"} *}
haftmann@34941
   107
haftmann@34941
   108
primrec
haftmann@34941
   109
  take:: "nat \<Rightarrow> 'a list \<Rightarrow> 'a list" where
haftmann@34941
   110
    take_Nil:"take n [] = []"
haftmann@34941
   111
  | take_Cons: "take n (x # xs) = (case n of 0 \<Rightarrow> [] | Suc m \<Rightarrow> x # take m xs)"
haftmann@34941
   112
  -- {*Warning: simpset does not contain this definition, but separate
haftmann@34941
   113
       theorems for @{text "n = 0"} and @{text "n = Suc k"} *}
haftmann@34941
   114
haftmann@34941
   115
primrec
haftmann@34941
   116
  nth :: "'a list => nat => 'a" (infixl "!" 100) where
haftmann@34941
   117
  nth_Cons: "(x # xs) ! n = (case n of 0 \<Rightarrow> x | Suc k \<Rightarrow> xs ! k)"
haftmann@34941
   118
  -- {*Warning: simpset does not contain this definition, but separate
haftmann@34941
   119
       theorems for @{text "n = 0"} and @{text "n = Suc k"} *}
haftmann@34941
   120
haftmann@34941
   121
primrec
haftmann@34941
   122
  list_update :: "'a list \<Rightarrow> nat \<Rightarrow> 'a \<Rightarrow> 'a list" where
haftmann@34941
   123
    "list_update [] i v = []"
haftmann@34941
   124
  | "list_update (x # xs) i v = (case i of 0 \<Rightarrow> v # xs | Suc j \<Rightarrow> x # list_update xs j v)"
clasohm@923
   125
nipkow@13146
   126
nonterminals lupdbinds lupdbind
nipkow@5077
   127
clasohm@923
   128
syntax
wenzelm@13366
   129
  "_lupdbind":: "['a, 'a] => lupdbind"    ("(2_ :=/ _)")
wenzelm@13366
   130
  "" :: "lupdbind => lupdbinds"    ("_")
wenzelm@13366
   131
  "_lupdbinds" :: "[lupdbind, lupdbinds] => lupdbinds"    ("_,/ _")
wenzelm@13366
   132
  "_LUpdate" :: "['a, lupdbinds] => 'a"    ("_/[(_)]" [900,0] 900)
nipkow@5077
   133
clasohm@923
   134
translations
wenzelm@35115
   135
  "_LUpdate xs (_lupdbinds b bs)" == "_LUpdate (_LUpdate xs b) bs"
haftmann@34941
   136
  "xs[i:=x]" == "CONST list_update xs i x"
haftmann@34941
   137
haftmann@34941
   138
primrec
haftmann@34941
   139
  takeWhile :: "('a \<Rightarrow> bool) \<Rightarrow> 'a list \<Rightarrow> 'a list" where
haftmann@34941
   140
    "takeWhile P [] = []"
haftmann@34941
   141
  | "takeWhile P (x # xs) = (if P x then x # takeWhile P xs else [])"
haftmann@34941
   142
haftmann@34941
   143
primrec
haftmann@34941
   144
  dropWhile :: "('a \<Rightarrow> bool) \<Rightarrow> 'a list \<Rightarrow> 'a list" where
haftmann@34941
   145
    "dropWhile P [] = []"
haftmann@34941
   146
  | "dropWhile P (x # xs) = (if P x then dropWhile P xs else x # xs)"
haftmann@34941
   147
haftmann@34941
   148
primrec
haftmann@34941
   149
  zip :: "'a list \<Rightarrow> 'b list \<Rightarrow> ('a \<times> 'b) list" where
haftmann@34941
   150
    "zip xs [] = []"
haftmann@34941
   151
  | zip_Cons: "zip xs (y # ys) = (case xs of [] => [] | z # zs => (z, y) # zip zs ys)"
haftmann@34941
   152
  -- {*Warning: simpset does not contain this definition, but separate
haftmann@34941
   153
       theorems for @{text "xs = []"} and @{text "xs = z # zs"} *}
haftmann@34941
   154
haftmann@34941
   155
primrec 
haftmann@34941
   156
  upt :: "nat \<Rightarrow> nat \<Rightarrow> nat list" ("(1[_..</_'])") where
haftmann@34941
   157
    upt_0: "[i..<0] = []"
haftmann@34941
   158
  | upt_Suc: "[i..<(Suc j)] = (if i <= j then [i..<j] @ [j] else [])"
haftmann@34941
   159
haftmann@34978
   160
definition
haftmann@34978
   161
  insert :: "'a \<Rightarrow> 'a list \<Rightarrow> 'a list" where
haftmann@34978
   162
  "insert x xs = (if x \<in> set xs then xs else x # xs)"
haftmann@34978
   163
wenzelm@36176
   164
hide_const (open) insert
wenzelm@36176
   165
hide_fact (open) insert_def
haftmann@34978
   166
haftmann@34941
   167
primrec
haftmann@34941
   168
  remove1 :: "'a \<Rightarrow> 'a list \<Rightarrow> 'a list" where
haftmann@34941
   169
    "remove1 x [] = []"
haftmann@34941
   170
  | "remove1 x (y # xs) = (if x = y then xs else y # remove1 x xs)"
haftmann@34941
   171
haftmann@34941
   172
primrec
haftmann@34941
   173
  removeAll :: "'a \<Rightarrow> 'a list \<Rightarrow> 'a list" where
haftmann@34941
   174
    "removeAll x [] = []"
haftmann@34941
   175
  | "removeAll x (y # xs) = (if x = y then removeAll x xs else y # removeAll x xs)"
haftmann@34941
   176
haftmann@40122
   177
primrec
haftmann@39915
   178
  distinct :: "'a list \<Rightarrow> bool" where
haftmann@40122
   179
    "distinct [] \<longleftrightarrow> True"
haftmann@40122
   180
  | "distinct (x # xs) \<longleftrightarrow> x \<notin> set xs \<and> distinct xs"
haftmann@39915
   181
haftmann@39915
   182
primrec
haftmann@39915
   183
  remdups :: "'a list \<Rightarrow> 'a list" where
haftmann@39915
   184
    "remdups [] = []"
haftmann@39915
   185
  | "remdups (x # xs) = (if x \<in> set xs then remdups xs else x # remdups xs)"
haftmann@39915
   186
haftmann@34941
   187
primrec
haftmann@34941
   188
  replicate :: "nat \<Rightarrow> 'a \<Rightarrow> 'a list" where
haftmann@34941
   189
    replicate_0: "replicate 0 x = []"
haftmann@34941
   190
  | replicate_Suc: "replicate (Suc n) x = x # replicate n x"
paulson@3342
   191
wenzelm@13142
   192
text {*
wenzelm@14589
   193
  Function @{text size} is overloaded for all datatypes. Users may
wenzelm@13366
   194
  refer to the list version as @{text length}. *}
wenzelm@13142
   195
wenzelm@19363
   196
abbreviation
haftmann@34941
   197
  length :: "'a list \<Rightarrow> nat" where
haftmann@34941
   198
  "length \<equiv> size"
paulson@15307
   199
haftmann@21061
   200
definition
wenzelm@21404
   201
  rotate1 :: "'a list \<Rightarrow> 'a list" where
wenzelm@21404
   202
  "rotate1 xs = (case xs of [] \<Rightarrow> [] | x#xs \<Rightarrow> xs @ [x])"
wenzelm@21404
   203
wenzelm@21404
   204
definition
wenzelm@21404
   205
  rotate :: "nat \<Rightarrow> 'a list \<Rightarrow> 'a list" where
haftmann@30971
   206
  "rotate n = rotate1 ^^ n"
wenzelm@21404
   207
wenzelm@21404
   208
definition
wenzelm@21404
   209
  list_all2 :: "('a => 'b => bool) => 'a list => 'b list => bool" where
haftmann@37767
   210
  "list_all2 P xs ys =
haftmann@21061
   211
    (length xs = length ys \<and> (\<forall>(x, y) \<in> set (zip xs ys). P x y))"
wenzelm@21404
   212
wenzelm@21404
   213
definition
wenzelm@21404
   214
  sublist :: "'a list => nat set => 'a list" where
wenzelm@21404
   215
  "sublist xs A = map fst (filter (\<lambda>p. snd p \<in> A) (zip xs [0..<size xs]))"
nipkow@17086
   216
nipkow@17086
   217
primrec
haftmann@34941
   218
  splice :: "'a list \<Rightarrow> 'a list \<Rightarrow> 'a list" where
haftmann@34941
   219
    "splice [] ys = ys"
haftmann@34941
   220
  | "splice (x # xs) ys = (if ys = [] then x # xs else x # hd ys # splice xs (tl ys))"
haftmann@21061
   221
    -- {*Warning: simpset does not contain the second eqn but a derived one. *}
haftmann@21061
   222
nipkow@26771
   223
text{*
nipkow@26771
   224
\begin{figure}[htbp]
nipkow@26771
   225
\fbox{
nipkow@26771
   226
\begin{tabular}{l}
wenzelm@27381
   227
@{lemma "[a,b]@[c,d] = [a,b,c,d]" by simp}\\
wenzelm@27381
   228
@{lemma "length [a,b,c] = 3" by simp}\\
wenzelm@27381
   229
@{lemma "set [a,b,c] = {a,b,c}" by simp}\\
wenzelm@27381
   230
@{lemma "map f [a,b,c] = [f a, f b, f c]" by simp}\\
wenzelm@27381
   231
@{lemma "rev [a,b,c] = [c,b,a]" by simp}\\
wenzelm@27381
   232
@{lemma "hd [a,b,c,d] = a" by simp}\\
wenzelm@27381
   233
@{lemma "tl [a,b,c,d] = [b,c,d]" by simp}\\
wenzelm@27381
   234
@{lemma "last [a,b,c,d] = d" by simp}\\
wenzelm@27381
   235
@{lemma "butlast [a,b,c,d] = [a,b,c]" by simp}\\
wenzelm@27381
   236
@{lemma[source] "filter (\<lambda>n::nat. n<2) [0,2,1] = [0,1]" by simp}\\
wenzelm@27381
   237
@{lemma "concat [[a,b],[c,d,e],[],[f]] = [a,b,c,d,e,f]" by simp}\\
wenzelm@27381
   238
@{lemma "foldl f x [a,b,c] = f (f (f x a) b) c" by simp}\\
wenzelm@27381
   239
@{lemma "foldr f [a,b,c] x = f a (f b (f c x))" by simp}\\
wenzelm@27381
   240
@{lemma "zip [a,b,c] [x,y,z] = [(a,x),(b,y),(c,z)]" by simp}\\
wenzelm@27381
   241
@{lemma "zip [a,b] [x,y,z] = [(a,x),(b,y)]" by simp}\\
wenzelm@27381
   242
@{lemma "splice [a,b,c] [x,y,z] = [a,x,b,y,c,z]" by simp}\\
wenzelm@27381
   243
@{lemma "splice [a,b,c,d] [x,y] = [a,x,b,y,c,d]" by simp}\\
wenzelm@27381
   244
@{lemma "take 2 [a,b,c,d] = [a,b]" by simp}\\
wenzelm@27381
   245
@{lemma "take 6 [a,b,c,d] = [a,b,c,d]" by simp}\\
wenzelm@27381
   246
@{lemma "drop 2 [a,b,c,d] = [c,d]" by simp}\\
wenzelm@27381
   247
@{lemma "drop 6 [a,b,c,d] = []" by simp}\\
wenzelm@27381
   248
@{lemma "takeWhile (%n::nat. n<3) [1,2,3,0] = [1,2]" by simp}\\
wenzelm@27381
   249
@{lemma "dropWhile (%n::nat. n<3) [1,2,3,0] = [3,0]" by simp}\\
wenzelm@27381
   250
@{lemma "distinct [2,0,1::nat]" by simp}\\
wenzelm@27381
   251
@{lemma "remdups [2,0,2,1::nat,2] = [0,1,2]" by simp}\\
haftmann@34978
   252
@{lemma "List.insert 2 [0::nat,1,2] = [0,1,2]" by (simp add: List.insert_def)}\\
haftmann@35295
   253
@{lemma "List.insert 3 [0::nat,1,2] = [3,0,1,2]" by (simp add: List.insert_def)}\\
wenzelm@27381
   254
@{lemma "remove1 2 [2,0,2,1::nat,2] = [0,2,1,2]" by simp}\\
nipkow@27693
   255
@{lemma "removeAll 2 [2,0,2,1::nat,2] = [0,1]" by simp}\\
wenzelm@27381
   256
@{lemma "nth [a,b,c,d] 2 = c" by simp}\\
wenzelm@27381
   257
@{lemma "[a,b,c,d][2 := x] = [a,b,x,d]" by simp}\\
wenzelm@27381
   258
@{lemma "sublist [a,b,c,d,e] {0,2,3} = [a,c,d]" by (simp add:sublist_def)}\\
wenzelm@27381
   259
@{lemma "rotate1 [a,b,c,d] = [b,c,d,a]" by (simp add:rotate1_def)}\\
nipkow@40077
   260
@{lemma "rotate 3 [a,b,c,d] = [d,a,b,c]" by (simp add:rotate1_def rotate_def eval_nat_numeral)}\\
nipkow@40077
   261
@{lemma "replicate 4 a = [a,a,a,a]" by (simp add:eval_nat_numeral)}\\
nipkow@40077
   262
@{lemma "[2..<5] = [2,3,4]" by (simp add:eval_nat_numeral)}\\
haftmann@39774
   263
@{lemma "listsum [1,2,3::nat] = 6" by (simp add: listsum_def)}
nipkow@26771
   264
\end{tabular}}
nipkow@26771
   265
\caption{Characteristic examples}
nipkow@26771
   266
\label{fig:Characteristic}
nipkow@26771
   267
\end{figure}
blanchet@29927
   268
Figure~\ref{fig:Characteristic} shows characteristic examples
nipkow@26771
   269
that should give an intuitive understanding of the above functions.
nipkow@26771
   270
*}
nipkow@26771
   271
nipkow@24616
   272
text{* The following simple sort functions are intended for proofs,
nipkow@24616
   273
not for efficient implementations. *}
nipkow@24616
   274
wenzelm@25221
   275
context linorder
wenzelm@25221
   276
begin
wenzelm@25221
   277
haftmann@39915
   278
inductive sorted :: "'a list \<Rightarrow> bool" where
haftmann@39915
   279
  Nil [iff]: "sorted []"
haftmann@39915
   280
| Cons: "\<forall>y\<in>set xs. x \<le> y \<Longrightarrow> sorted xs \<Longrightarrow> sorted (x # xs)"
haftmann@39915
   281
haftmann@39915
   282
lemma sorted_single [iff]:
haftmann@39915
   283
  "sorted [x]"
haftmann@39915
   284
  by (rule sorted.Cons) auto
haftmann@39915
   285
haftmann@39915
   286
lemma sorted_many:
haftmann@39915
   287
  "x \<le> y \<Longrightarrow> sorted (y # zs) \<Longrightarrow> sorted (x # y # zs)"
haftmann@39915
   288
  by (rule sorted.Cons) (cases "y # zs" rule: sorted.cases, auto)
haftmann@39915
   289
haftmann@39915
   290
lemma sorted_many_eq [simp, code]:
haftmann@39915
   291
  "sorted (x # y # zs) \<longleftrightarrow> x \<le> y \<and> sorted (y # zs)"
haftmann@39915
   292
  by (auto intro: sorted_many elim: sorted.cases)
haftmann@39915
   293
haftmann@39915
   294
lemma [code]:
haftmann@39915
   295
  "sorted [] \<longleftrightarrow> True"
haftmann@39915
   296
  "sorted [x] \<longleftrightarrow> True"
haftmann@39915
   297
  by simp_all
nipkow@24697
   298
hoelzl@33639
   299
primrec insort_key :: "('b \<Rightarrow> 'a) \<Rightarrow> 'b \<Rightarrow> 'b list \<Rightarrow> 'b list" where
hoelzl@33639
   300
"insort_key f x [] = [x]" |
hoelzl@33639
   301
"insort_key f x (y#ys) = (if f x \<le> f y then (x#y#ys) else y#(insort_key f x ys))"
hoelzl@33639
   302
haftmann@35195
   303
definition sort_key :: "('b \<Rightarrow> 'a) \<Rightarrow> 'b list \<Rightarrow> 'b list" where
haftmann@35195
   304
"sort_key f xs = foldr (insort_key f) xs []"
hoelzl@33639
   305
haftmann@40210
   306
definition insort_insert_key :: "('b \<Rightarrow> 'a) \<Rightarrow> 'b \<Rightarrow> 'b list \<Rightarrow> 'b list" where
haftmann@40210
   307
  "insort_insert_key f x xs = (if f x \<in> f ` set xs then xs else insort_key f x xs)"
haftmann@40210
   308
hoelzl@33639
   309
abbreviation "sort \<equiv> sort_key (\<lambda>x. x)"
hoelzl@33639
   310
abbreviation "insort \<equiv> insort_key (\<lambda>x. x)"
haftmann@40210
   311
abbreviation "insort_insert \<equiv> insort_insert_key (\<lambda>x. x)"
haftmann@35608
   312
wenzelm@25221
   313
end
wenzelm@25221
   314
nipkow@24616
   315
wenzelm@23388
   316
subsubsection {* List comprehension *}
nipkow@23192
   317
nipkow@24349
   318
text{* Input syntax for Haskell-like list comprehension notation.
nipkow@24349
   319
Typical example: @{text"[(x,y). x \<leftarrow> xs, y \<leftarrow> ys, x \<noteq> y]"},
nipkow@24349
   320
the list of all pairs of distinct elements from @{text xs} and @{text ys}.
nipkow@24349
   321
The syntax is as in Haskell, except that @{text"|"} becomes a dot
nipkow@24349
   322
(like in Isabelle's set comprehension): @{text"[e. x \<leftarrow> xs, \<dots>]"} rather than
nipkow@24349
   323
\verb![e| x <- xs, ...]!.
nipkow@24349
   324
nipkow@24349
   325
The qualifiers after the dot are
nipkow@24349
   326
\begin{description}
nipkow@24349
   327
\item[generators] @{text"p \<leftarrow> xs"},
nipkow@24476
   328
 where @{text p} is a pattern and @{text xs} an expression of list type, or
nipkow@24476
   329
\item[guards] @{text"b"}, where @{text b} is a boolean expression.
nipkow@24476
   330
%\item[local bindings] @ {text"let x = e"}.
nipkow@24349
   331
\end{description}
nipkow@23240
   332
nipkow@24476
   333
Just like in Haskell, list comprehension is just a shorthand. To avoid
nipkow@24476
   334
misunderstandings, the translation into desugared form is not reversed
nipkow@24476
   335
upon output. Note that the translation of @{text"[e. x \<leftarrow> xs]"} is
nipkow@24476
   336
optmized to @{term"map (%x. e) xs"}.
nipkow@23240
   337
nipkow@24349
   338
It is easy to write short list comprehensions which stand for complex
nipkow@24349
   339
expressions. During proofs, they may become unreadable (and
nipkow@24349
   340
mangled). In such cases it can be advisable to introduce separate
nipkow@24349
   341
definitions for the list comprehensions in question.  *}
nipkow@24349
   342
nipkow@23209
   343
(*
nipkow@23240
   344
Proper theorem proving support would be nice. For example, if
nipkow@23192
   345
@{text"set[f x y. x \<leftarrow> xs, y \<leftarrow> ys, P x y]"}
nipkow@23192
   346
produced something like
nipkow@23209
   347
@{term"{z. EX x: set xs. EX y:set ys. P x y \<and> z = f x y}"}.
nipkow@23209
   348
*)
nipkow@23209
   349
nipkow@23240
   350
nonterminals lc_qual lc_quals
nipkow@23192
   351
nipkow@23192
   352
syntax
nipkow@23240
   353
"_listcompr" :: "'a \<Rightarrow> lc_qual \<Rightarrow> lc_quals \<Rightarrow> 'a list"  ("[_ . __")
nipkow@24349
   354
"_lc_gen" :: "'a \<Rightarrow> 'a list \<Rightarrow> lc_qual" ("_ <- _")
nipkow@23240
   355
"_lc_test" :: "bool \<Rightarrow> lc_qual" ("_")
nipkow@24476
   356
(*"_lc_let" :: "letbinds => lc_qual"  ("let _")*)
nipkow@23240
   357
"_lc_end" :: "lc_quals" ("]")
nipkow@23240
   358
"_lc_quals" :: "lc_qual \<Rightarrow> lc_quals \<Rightarrow> lc_quals" (", __")
nipkow@24349
   359
"_lc_abs" :: "'a => 'b list => 'b list"
nipkow@23192
   360
nipkow@24476
   361
(* These are easier than ML code but cannot express the optimized
nipkow@24476
   362
   translation of [e. p<-xs]
nipkow@23192
   363
translations
nipkow@24349
   364
"[e. p<-xs]" => "concat(map (_lc_abs p [e]) xs)"
nipkow@23240
   365
"_listcompr e (_lc_gen p xs) (_lc_quals Q Qs)"
nipkow@24349
   366
 => "concat (map (_lc_abs p (_listcompr e Q Qs)) xs)"
nipkow@23240
   367
"[e. P]" => "if P then [e] else []"
nipkow@23240
   368
"_listcompr e (_lc_test P) (_lc_quals Q Qs)"
nipkow@23240
   369
 => "if P then (_listcompr e Q Qs) else []"
nipkow@24349
   370
"_listcompr e (_lc_let b) (_lc_quals Q Qs)"
nipkow@24349
   371
 => "_Let b (_listcompr e Q Qs)"
nipkow@24476
   372
*)
nipkow@23240
   373
nipkow@23279
   374
syntax (xsymbols)
nipkow@24349
   375
"_lc_gen" :: "'a \<Rightarrow> 'a list \<Rightarrow> lc_qual" ("_ \<leftarrow> _")
nipkow@23279
   376
syntax (HTML output)
nipkow@24349
   377
"_lc_gen" :: "'a \<Rightarrow> 'a list \<Rightarrow> lc_qual" ("_ \<leftarrow> _")
nipkow@24349
   378
nipkow@24349
   379
parse_translation (advanced) {*
nipkow@24349
   380
let
wenzelm@35256
   381
  val NilC = Syntax.const @{const_syntax Nil};
wenzelm@35256
   382
  val ConsC = Syntax.const @{const_syntax Cons};
wenzelm@35256
   383
  val mapC = Syntax.const @{const_syntax map};
wenzelm@35256
   384
  val concatC = Syntax.const @{const_syntax concat};
wenzelm@35256
   385
  val IfC = Syntax.const @{const_syntax If};
wenzelm@35115
   386
nipkow@24476
   387
  fun singl x = ConsC $ x $ NilC;
nipkow@24476
   388
wenzelm@35115
   389
  fun pat_tr ctxt p e opti = (* %x. case x of p => e | _ => [] *)
nipkow@24349
   390
    let
wenzelm@29281
   391
      val x = Free (Name.variant (fold Term.add_free_names [p, e] []) "x", dummyT);
nipkow@24476
   392
      val e = if opti then singl e else e;
wenzelm@35115
   393
      val case1 = Syntax.const @{syntax_const "_case1"} $ p $ e;
wenzelm@35256
   394
      val case2 =
wenzelm@35256
   395
        Syntax.const @{syntax_const "_case1"} $
wenzelm@35256
   396
          Syntax.const @{const_syntax dummy_pattern} $ NilC;
wenzelm@35115
   397
      val cs = Syntax.const @{syntax_const "_case2"} $ case1 $ case2;
wenzelm@35115
   398
      val ft = Datatype_Case.case_tr false Datatype.info_of_constr ctxt [x, cs];
nipkow@24349
   399
    in lambda x ft end;
nipkow@24349
   400
wenzelm@35256
   401
  fun abs_tr ctxt (p as Free (s, T)) e opti =
wenzelm@35115
   402
        let
wenzelm@35115
   403
          val thy = ProofContext.theory_of ctxt;
wenzelm@35115
   404
          val s' = Sign.intern_const thy s;
wenzelm@35115
   405
        in
wenzelm@35115
   406
          if Sign.declared_const thy s'
wenzelm@35115
   407
          then (pat_tr ctxt p e opti, false)
wenzelm@35115
   408
          else (lambda p e, true)
nipkow@24349
   409
        end
nipkow@24476
   410
    | abs_tr ctxt p e opti = (pat_tr ctxt p e opti, false);
nipkow@24476
   411
wenzelm@35115
   412
  fun lc_tr ctxt [e, Const (@{syntax_const "_lc_test"}, _) $ b, qs] =
wenzelm@35115
   413
        let
wenzelm@35115
   414
          val res =
wenzelm@35115
   415
            (case qs of
wenzelm@35115
   416
              Const (@{syntax_const "_lc_end"}, _) => singl e
wenzelm@35115
   417
            | Const (@{syntax_const "_lc_quals"}, _) $ q $ qs => lc_tr ctxt [e, q, qs]);
nipkow@24476
   418
        in IfC $ b $ res $ NilC end
wenzelm@35115
   419
    | lc_tr ctxt
wenzelm@35115
   420
          [e, Const (@{syntax_const "_lc_gen"}, _) $ p $ es,
wenzelm@35115
   421
            Const(@{syntax_const "_lc_end"}, _)] =
nipkow@24476
   422
        (case abs_tr ctxt p e true of
wenzelm@35115
   423
          (f, true) => mapC $ f $ es
wenzelm@35115
   424
        | (f, false) => concatC $ (mapC $ f $ es))
wenzelm@35115
   425
    | lc_tr ctxt
wenzelm@35115
   426
          [e, Const (@{syntax_const "_lc_gen"}, _) $ p $ es,
wenzelm@35115
   427
            Const (@{syntax_const "_lc_quals"}, _) $ q $ qs] =
wenzelm@35115
   428
        let val e' = lc_tr ctxt [e, q, qs];
wenzelm@35115
   429
        in concatC $ (mapC $ (fst (abs_tr ctxt p e' false)) $ es) end;
wenzelm@35115
   430
wenzelm@35115
   431
in [(@{syntax_const "_listcompr"}, lc_tr)] end
nipkow@24349
   432
*}
nipkow@23279
   433
nipkow@23240
   434
term "[(x,y,z). b]"
nipkow@24476
   435
term "[(x,y,z). x\<leftarrow>xs]"
nipkow@24476
   436
term "[e x y. x\<leftarrow>xs, y\<leftarrow>ys]"
nipkow@24476
   437
term "[(x,y,z). x<a, x>b]"
nipkow@24476
   438
term "[(x,y,z). x\<leftarrow>xs, x>b]"
nipkow@24476
   439
term "[(x,y,z). x<a, x\<leftarrow>xs]"
nipkow@24349
   440
term "[(x,y). Cons True x \<leftarrow> xs]"
nipkow@24349
   441
term "[(x,y,z). Cons x [] \<leftarrow> xs]"
nipkow@23240
   442
term "[(x,y,z). x<a, x>b, x=d]"
nipkow@23240
   443
term "[(x,y,z). x<a, x>b, y\<leftarrow>ys]"
nipkow@23240
   444
term "[(x,y,z). x<a, x\<leftarrow>xs,y>b]"
nipkow@23240
   445
term "[(x,y,z). x<a, x\<leftarrow>xs, y\<leftarrow>ys]"
nipkow@23240
   446
term "[(x,y,z). x\<leftarrow>xs, x>b, y<a]"
nipkow@23240
   447
term "[(x,y,z). x\<leftarrow>xs, x>b, y\<leftarrow>ys]"
nipkow@23240
   448
term "[(x,y,z). x\<leftarrow>xs, y\<leftarrow>ys,y>x]"
nipkow@23240
   449
term "[(x,y,z). x\<leftarrow>xs, y\<leftarrow>ys,z\<leftarrow>zs]"
wenzelm@35115
   450
(*
nipkow@24349
   451
term "[(x,y). x\<leftarrow>xs, let xx = x+x, y\<leftarrow>ys, y \<noteq> xx]"
nipkow@23192
   452
*)
nipkow@23192
   453
wenzelm@35115
   454
haftmann@21061
   455
subsubsection {* @{const Nil} and @{const Cons} *}
haftmann@21061
   456
haftmann@21061
   457
lemma not_Cons_self [simp]:
haftmann@21061
   458
  "xs \<noteq> x # xs"
nipkow@13145
   459
by (induct xs) auto
wenzelm@13114
   460
wenzelm@13142
   461
lemmas not_Cons_self2 [simp] = not_Cons_self [symmetric]
wenzelm@13114
   462
wenzelm@13142
   463
lemma neq_Nil_conv: "(xs \<noteq> []) = (\<exists>y ys. xs = y # ys)"
nipkow@13145
   464
by (induct xs) auto
wenzelm@13114
   465
wenzelm@13142
   466
lemma length_induct:
haftmann@21061
   467
  "(\<And>xs. \<forall>ys. length ys < length xs \<longrightarrow> P ys \<Longrightarrow> P xs) \<Longrightarrow> P xs"
nipkow@17589
   468
by (rule measure_induct [of length]) iprover
wenzelm@13114
   469
haftmann@37289
   470
lemma list_nonempty_induct [consumes 1, case_names single cons]:
haftmann@37289
   471
  assumes "xs \<noteq> []"
haftmann@37289
   472
  assumes single: "\<And>x. P [x]"
haftmann@37289
   473
  assumes cons: "\<And>x xs. xs \<noteq> [] \<Longrightarrow> P xs \<Longrightarrow> P (x # xs)"
haftmann@37289
   474
  shows "P xs"
haftmann@37289
   475
using `xs \<noteq> []` proof (induct xs)
haftmann@37289
   476
  case Nil then show ?case by simp
haftmann@37289
   477
next
haftmann@37289
   478
  case (Cons x xs) show ?case proof (cases xs)
haftmann@37289
   479
    case Nil with single show ?thesis by simp
haftmann@37289
   480
  next
haftmann@37289
   481
    case Cons then have "xs \<noteq> []" by simp
haftmann@37289
   482
    moreover with Cons.hyps have "P xs" .
haftmann@37289
   483
    ultimately show ?thesis by (rule cons)
haftmann@37289
   484
  qed
haftmann@37289
   485
qed
haftmann@37289
   486
wenzelm@13114
   487
haftmann@21061
   488
subsubsection {* @{const length} *}
wenzelm@13114
   489
wenzelm@13142
   490
text {*
haftmann@21061
   491
  Needs to come before @{text "@"} because of theorem @{text
haftmann@21061
   492
  append_eq_append_conv}.
wenzelm@13142
   493
*}
wenzelm@13114
   494
wenzelm@13142
   495
lemma length_append [simp]: "length (xs @ ys) = length xs + length ys"
nipkow@13145
   496
by (induct xs) auto
wenzelm@13114
   497
wenzelm@13142
   498
lemma length_map [simp]: "length (map f xs) = length xs"
nipkow@13145
   499
by (induct xs) auto
wenzelm@13114
   500
wenzelm@13142
   501
lemma length_rev [simp]: "length (rev xs) = length xs"
nipkow@13145
   502
by (induct xs) auto
wenzelm@13114
   503
wenzelm@13142
   504
lemma length_tl [simp]: "length (tl xs) = length xs - 1"
nipkow@13145
   505
by (cases xs) auto
wenzelm@13114
   506
wenzelm@13142
   507
lemma length_0_conv [iff]: "(length xs = 0) = (xs = [])"
nipkow@13145
   508
by (induct xs) auto
wenzelm@13114
   509
wenzelm@13142
   510
lemma length_greater_0_conv [iff]: "(0 < length xs) = (xs \<noteq> [])"
nipkow@13145
   511
by (induct xs) auto
wenzelm@13114
   512
nipkow@23479
   513
lemma length_pos_if_in_set: "x : set xs \<Longrightarrow> length xs > 0"
nipkow@23479
   514
by auto
nipkow@23479
   515
wenzelm@13114
   516
lemma length_Suc_conv:
nipkow@13145
   517
"(length xs = Suc n) = (\<exists>y ys. xs = y # ys \<and> length ys = n)"
nipkow@13145
   518
by (induct xs) auto
wenzelm@13142
   519
nipkow@14025
   520
lemma Suc_length_conv:
nipkow@14025
   521
"(Suc n = length xs) = (\<exists>y ys. xs = y # ys \<and> length ys = n)"
paulson@14208
   522
apply (induct xs, simp, simp)
nipkow@14025
   523
apply blast
nipkow@14025
   524
done
nipkow@14025
   525
wenzelm@25221
   526
lemma impossible_Cons: "length xs <= length ys ==> xs = x # ys = False"
wenzelm@25221
   527
  by (induct xs) auto
wenzelm@25221
   528
haftmann@26442
   529
lemma list_induct2 [consumes 1, case_names Nil Cons]:
haftmann@26442
   530
  "length xs = length ys \<Longrightarrow> P [] [] \<Longrightarrow>
haftmann@26442
   531
   (\<And>x xs y ys. length xs = length ys \<Longrightarrow> P xs ys \<Longrightarrow> P (x#xs) (y#ys))
haftmann@26442
   532
   \<Longrightarrow> P xs ys"
haftmann@26442
   533
proof (induct xs arbitrary: ys)
haftmann@26442
   534
  case Nil then show ?case by simp
haftmann@26442
   535
next
haftmann@26442
   536
  case (Cons x xs ys) then show ?case by (cases ys) simp_all
haftmann@26442
   537
qed
haftmann@26442
   538
haftmann@26442
   539
lemma list_induct3 [consumes 2, case_names Nil Cons]:
haftmann@26442
   540
  "length xs = length ys \<Longrightarrow> length ys = length zs \<Longrightarrow> P [] [] [] \<Longrightarrow>
haftmann@26442
   541
   (\<And>x xs y ys z zs. length xs = length ys \<Longrightarrow> length ys = length zs \<Longrightarrow> P xs ys zs \<Longrightarrow> P (x#xs) (y#ys) (z#zs))
haftmann@26442
   542
   \<Longrightarrow> P xs ys zs"
haftmann@26442
   543
proof (induct xs arbitrary: ys zs)
haftmann@26442
   544
  case Nil then show ?case by simp
haftmann@26442
   545
next
haftmann@26442
   546
  case (Cons x xs ys zs) then show ?case by (cases ys, simp_all)
haftmann@26442
   547
    (cases zs, simp_all)
haftmann@26442
   548
qed
wenzelm@13114
   549
kaliszyk@36154
   550
lemma list_induct4 [consumes 3, case_names Nil Cons]:
kaliszyk@36154
   551
  "length xs = length ys \<Longrightarrow> length ys = length zs \<Longrightarrow> length zs = length ws \<Longrightarrow>
kaliszyk@36154
   552
   P [] [] [] [] \<Longrightarrow> (\<And>x xs y ys z zs w ws. length xs = length ys \<Longrightarrow>
kaliszyk@36154
   553
   length ys = length zs \<Longrightarrow> length zs = length ws \<Longrightarrow> P xs ys zs ws \<Longrightarrow>
kaliszyk@36154
   554
   P (x#xs) (y#ys) (z#zs) (w#ws)) \<Longrightarrow> P xs ys zs ws"
kaliszyk@36154
   555
proof (induct xs arbitrary: ys zs ws)
kaliszyk@36154
   556
  case Nil then show ?case by simp
kaliszyk@36154
   557
next
kaliszyk@36154
   558
  case (Cons x xs ys zs ws) then show ?case by ((cases ys, simp_all), (cases zs,simp_all)) (cases ws, simp_all)
kaliszyk@36154
   559
qed
kaliszyk@36154
   560
krauss@22493
   561
lemma list_induct2': 
krauss@22493
   562
  "\<lbrakk> P [] [];
krauss@22493
   563
  \<And>x xs. P (x#xs) [];
krauss@22493
   564
  \<And>y ys. P [] (y#ys);
krauss@22493
   565
   \<And>x xs y ys. P xs ys  \<Longrightarrow> P (x#xs) (y#ys) \<rbrakk>
krauss@22493
   566
 \<Longrightarrow> P xs ys"
krauss@22493
   567
by (induct xs arbitrary: ys) (case_tac x, auto)+
krauss@22493
   568
nipkow@22143
   569
lemma neq_if_length_neq: "length xs \<noteq> length ys \<Longrightarrow> (xs = ys) == False"
nipkow@24349
   570
by (rule Eq_FalseI) auto
wenzelm@24037
   571
wenzelm@24037
   572
simproc_setup list_neq ("(xs::'a list) = ys") = {*
nipkow@22143
   573
(*
nipkow@22143
   574
Reduces xs=ys to False if xs and ys cannot be of the same length.
nipkow@22143
   575
This is the case if the atomic sublists of one are a submultiset
nipkow@22143
   576
of those of the other list and there are fewer Cons's in one than the other.
nipkow@22143
   577
*)
wenzelm@24037
   578
wenzelm@24037
   579
let
nipkow@22143
   580
huffman@29856
   581
fun len (Const(@{const_name Nil},_)) acc = acc
huffman@29856
   582
  | len (Const(@{const_name Cons},_) $ _ $ xs) (ts,n) = len xs (ts,n+1)
huffman@29856
   583
  | len (Const(@{const_name append},_) $ xs $ ys) acc = len xs (len ys acc)
huffman@29856
   584
  | len (Const(@{const_name rev},_) $ xs) acc = len xs acc
huffman@29856
   585
  | len (Const(@{const_name map},_) $ _ $ xs) acc = len xs acc
nipkow@22143
   586
  | len t (ts,n) = (t::ts,n);
nipkow@22143
   587
wenzelm@24037
   588
fun list_neq _ ss ct =
nipkow@22143
   589
  let
wenzelm@24037
   590
    val (Const(_,eqT) $ lhs $ rhs) = Thm.term_of ct;
nipkow@22143
   591
    val (ls,m) = len lhs ([],0) and (rs,n) = len rhs ([],0);
nipkow@22143
   592
    fun prove_neq() =
nipkow@22143
   593
      let
nipkow@22143
   594
        val Type(_,listT::_) = eqT;
haftmann@22994
   595
        val size = HOLogic.size_const listT;
nipkow@22143
   596
        val eq_len = HOLogic.mk_eq (size $ lhs, size $ rhs);
nipkow@22143
   597
        val neq_len = HOLogic.mk_Trueprop (HOLogic.Not $ eq_len);
nipkow@22143
   598
        val thm = Goal.prove (Simplifier.the_context ss) [] [] neq_len
haftmann@22633
   599
          (K (simp_tac (Simplifier.inherit_context ss @{simpset}) 1));
haftmann@22633
   600
      in SOME (thm RS @{thm neq_if_length_neq}) end
nipkow@22143
   601
  in
wenzelm@23214
   602
    if m < n andalso submultiset (op aconv) (ls,rs) orelse
wenzelm@23214
   603
       n < m andalso submultiset (op aconv) (rs,ls)
nipkow@22143
   604
    then prove_neq() else NONE
nipkow@22143
   605
  end;
wenzelm@24037
   606
in list_neq end;
nipkow@22143
   607
*}
nipkow@22143
   608
nipkow@22143
   609
nipkow@15392
   610
subsubsection {* @{text "@"} -- append *}
wenzelm@13114
   611
wenzelm@13142
   612
lemma append_assoc [simp]: "(xs @ ys) @ zs = xs @ (ys @ zs)"
nipkow@13145
   613
by (induct xs) auto
wenzelm@13114
   614
wenzelm@13142
   615
lemma append_Nil2 [simp]: "xs @ [] = xs"
nipkow@13145
   616
by (induct xs) auto
nipkow@3507
   617
wenzelm@13142
   618
lemma append_is_Nil_conv [iff]: "(xs @ ys = []) = (xs = [] \<and> ys = [])"
nipkow@13145
   619
by (induct xs) auto
wenzelm@13114
   620
wenzelm@13142
   621
lemma Nil_is_append_conv [iff]: "([] = xs @ ys) = (xs = [] \<and> ys = [])"
nipkow@13145
   622
by (induct xs) auto
wenzelm@13114
   623
wenzelm@13142
   624
lemma append_self_conv [iff]: "(xs @ ys = xs) = (ys = [])"
nipkow@13145
   625
by (induct xs) auto
wenzelm@13114
   626
wenzelm@13142
   627
lemma self_append_conv [iff]: "(xs = xs @ ys) = (ys = [])"
nipkow@13145
   628
by (induct xs) auto
wenzelm@13114
   629
blanchet@35828
   630
lemma append_eq_append_conv [simp, no_atp]:
nipkow@24526
   631
 "length xs = length ys \<or> length us = length vs
berghofe@13883
   632
 ==> (xs@us = ys@vs) = (xs=ys \<and> us=vs)"
nipkow@24526
   633
apply (induct xs arbitrary: ys)
paulson@14208
   634
 apply (case_tac ys, simp, force)
paulson@14208
   635
apply (case_tac ys, force, simp)
nipkow@13145
   636
done
wenzelm@13142
   637
nipkow@24526
   638
lemma append_eq_append_conv2: "(xs @ ys = zs @ ts) =
nipkow@24526
   639
  (EX us. xs = zs @ us & us @ ys = ts | xs @ us = zs & ys = us@ ts)"
nipkow@24526
   640
apply (induct xs arbitrary: ys zs ts)
nipkow@14495
   641
 apply fastsimp
nipkow@14495
   642
apply(case_tac zs)
nipkow@14495
   643
 apply simp
nipkow@14495
   644
apply fastsimp
nipkow@14495
   645
done
nipkow@14495
   646
berghofe@34910
   647
lemma same_append_eq [iff, induct_simp]: "(xs @ ys = xs @ zs) = (ys = zs)"
nipkow@13145
   648
by simp
wenzelm@13142
   649
wenzelm@13142
   650
lemma append1_eq_conv [iff]: "(xs @ [x] = ys @ [y]) = (xs = ys \<and> x = y)"
nipkow@13145
   651
by simp
wenzelm@13114
   652
berghofe@34910
   653
lemma append_same_eq [iff, induct_simp]: "(ys @ xs = zs @ xs) = (ys = zs)"
nipkow@13145
   654
by simp
wenzelm@13114
   655
wenzelm@13142
   656
lemma append_self_conv2 [iff]: "(xs @ ys = ys) = (xs = [])"
nipkow@13145
   657
using append_same_eq [of _ _ "[]"] by auto
nipkow@3507
   658
wenzelm@13142
   659
lemma self_append_conv2 [iff]: "(ys = xs @ ys) = (xs = [])"
nipkow@13145
   660
using append_same_eq [of "[]"] by auto
wenzelm@13114
   661
blanchet@35828
   662
lemma hd_Cons_tl [simp,no_atp]: "xs \<noteq> [] ==> hd xs # tl xs = xs"
nipkow@13145
   663
by (induct xs) auto
wenzelm@13114
   664
wenzelm@13142
   665
lemma hd_append: "hd (xs @ ys) = (if xs = [] then hd ys else hd xs)"
nipkow@13145
   666
by (induct xs) auto
wenzelm@13114
   667
wenzelm@13142
   668
lemma hd_append2 [simp]: "xs \<noteq> [] ==> hd (xs @ ys) = hd xs"
nipkow@13145
   669
by (simp add: hd_append split: list.split)
wenzelm@13114
   670
wenzelm@13142
   671
lemma tl_append: "tl (xs @ ys) = (case xs of [] => tl ys | z#zs => zs @ ys)"
nipkow@13145
   672
by (simp split: list.split)
wenzelm@13114
   673
wenzelm@13142
   674
lemma tl_append2 [simp]: "xs \<noteq> [] ==> tl (xs @ ys) = tl xs @ ys"
nipkow@13145
   675
by (simp add: tl_append split: list.split)
wenzelm@13114
   676
wenzelm@13114
   677
nipkow@14300
   678
lemma Cons_eq_append_conv: "x#xs = ys@zs =
nipkow@14300
   679
 (ys = [] & x#xs = zs | (EX ys'. x#ys' = ys & xs = ys'@zs))"
nipkow@14300
   680
by(cases ys) auto
nipkow@14300
   681
nipkow@15281
   682
lemma append_eq_Cons_conv: "(ys@zs = x#xs) =
nipkow@15281
   683
 (ys = [] & zs = x#xs | (EX ys'. ys = x#ys' & ys'@zs = xs))"
nipkow@15281
   684
by(cases ys) auto
nipkow@15281
   685
nipkow@14300
   686
wenzelm@13142
   687
text {* Trivial rules for solving @{text "@"}-equations automatically. *}
wenzelm@13114
   688
wenzelm@13114
   689
lemma eq_Nil_appendI: "xs = ys ==> xs = [] @ ys"
nipkow@13145
   690
by simp
wenzelm@13114
   691
wenzelm@13142
   692
lemma Cons_eq_appendI:
nipkow@13145
   693
"[| x # xs1 = ys; xs = xs1 @ zs |] ==> x # xs = ys @ zs"
nipkow@13145
   694
by (drule sym) simp
wenzelm@13114
   695
wenzelm@13142
   696
lemma append_eq_appendI:
nipkow@13145
   697
"[| xs @ xs1 = zs; ys = xs1 @ us |] ==> xs @ ys = zs @ us"
nipkow@13145
   698
by (drule sym) simp
wenzelm@13114
   699
wenzelm@13114
   700
wenzelm@13142
   701
text {*
nipkow@13145
   702
Simplification procedure for all list equalities.
nipkow@13145
   703
Currently only tries to rearrange @{text "@"} to see if
nipkow@13145
   704
- both lists end in a singleton list,
nipkow@13145
   705
- or both lists end in the same list.
wenzelm@13142
   706
*}
wenzelm@13142
   707
wenzelm@26480
   708
ML {*
nipkow@3507
   709
local
nipkow@3507
   710
huffman@29856
   711
fun last (cons as Const(@{const_name Cons},_) $ _ $ xs) =
huffman@29856
   712
  (case xs of Const(@{const_name Nil},_) => cons | _ => last xs)
huffman@29856
   713
  | last (Const(@{const_name append},_) $ _ $ ys) = last ys
wenzelm@13462
   714
  | last t = t;
wenzelm@13114
   715
huffman@29856
   716
fun list1 (Const(@{const_name Cons},_) $ _ $ Const(@{const_name Nil},_)) = true
wenzelm@13462
   717
  | list1 _ = false;
wenzelm@13114
   718
huffman@29856
   719
fun butlast ((cons as Const(@{const_name Cons},_) $ x) $ xs) =
huffman@29856
   720
  (case xs of Const(@{const_name Nil},_) => xs | _ => cons $ butlast xs)
huffman@29856
   721
  | butlast ((app as Const(@{const_name append},_) $ xs) $ ys) = app $ butlast ys
huffman@29856
   722
  | butlast xs = Const(@{const_name Nil},fastype_of xs);
wenzelm@13114
   723
haftmann@22633
   724
val rearr_ss = HOL_basic_ss addsimps [@{thm append_assoc},
haftmann@22633
   725
  @{thm append_Nil}, @{thm append_Cons}];
wenzelm@16973
   726
wenzelm@20044
   727
fun list_eq ss (F as (eq as Const(_,eqT)) $ lhs $ rhs) =
wenzelm@13462
   728
  let
wenzelm@13462
   729
    val lastl = last lhs and lastr = last rhs;
wenzelm@13462
   730
    fun rearr conv =
wenzelm@13462
   731
      let
wenzelm@13462
   732
        val lhs1 = butlast lhs and rhs1 = butlast rhs;
wenzelm@13462
   733
        val Type(_,listT::_) = eqT
wenzelm@13462
   734
        val appT = [listT,listT] ---> listT
huffman@29856
   735
        val app = Const(@{const_name append},appT)
wenzelm@13462
   736
        val F2 = eq $ (app$lhs1$lastl) $ (app$rhs1$lastr)
wenzelm@13480
   737
        val eq = HOLogic.mk_Trueprop (HOLogic.mk_eq (F,F2));
wenzelm@20044
   738
        val thm = Goal.prove (Simplifier.the_context ss) [] [] eq
wenzelm@17877
   739
          (K (simp_tac (Simplifier.inherit_context ss rearr_ss) 1));
skalberg@15531
   740
      in SOME ((conv RS (thm RS trans)) RS eq_reflection) end;
wenzelm@13114
   741
wenzelm@13462
   742
  in
haftmann@22633
   743
    if list1 lastl andalso list1 lastr then rearr @{thm append1_eq_conv}
haftmann@22633
   744
    else if lastl aconv lastr then rearr @{thm append_same_eq}
skalberg@15531
   745
    else NONE
wenzelm@13462
   746
  end;
wenzelm@13462
   747
wenzelm@13114
   748
in
wenzelm@13462
   749
wenzelm@13462
   750
val list_eq_simproc =
wenzelm@38715
   751
  Simplifier.simproc_global @{theory} "list_eq" ["(xs::'a list) = ys"] (K list_eq);
wenzelm@13462
   752
wenzelm@13114
   753
end;
wenzelm@13114
   754
wenzelm@13114
   755
Addsimprocs [list_eq_simproc];
wenzelm@13114
   756
*}
wenzelm@13114
   757
wenzelm@13114
   758
nipkow@15392
   759
subsubsection {* @{text map} *}
wenzelm@13114
   760
haftmann@40210
   761
lemma hd_map:
haftmann@40210
   762
  "xs \<noteq> [] \<Longrightarrow> hd (map f xs) = f (hd xs)"
haftmann@40210
   763
  by (cases xs) simp_all
haftmann@40210
   764
haftmann@40210
   765
lemma map_tl:
haftmann@40210
   766
  "map f (tl xs) = tl (map f xs)"
haftmann@40210
   767
  by (cases xs) simp_all
haftmann@40210
   768
wenzelm@13142
   769
lemma map_ext: "(!!x. x : set xs --> f x = g x) ==> map f xs = map g xs"
nipkow@13145
   770
by (induct xs) simp_all
wenzelm@13114
   771
wenzelm@13142
   772
lemma map_ident [simp]: "map (\<lambda>x. x) = (\<lambda>xs. xs)"
nipkow@13145
   773
by (rule ext, induct_tac xs) auto
wenzelm@13114
   774
wenzelm@13142
   775
lemma map_append [simp]: "map f (xs @ ys) = map f xs @ map f ys"
nipkow@13145
   776
by (induct xs) auto
wenzelm@13114
   777
hoelzl@33639
   778
lemma map_map [simp]: "map f (map g xs) = map (f \<circ> g) xs"
hoelzl@33639
   779
by (induct xs) auto
hoelzl@33639
   780
nipkow@35208
   781
lemma map_comp_map[simp]: "((map f) o (map g)) = map(f o g)"
nipkow@35208
   782
apply(rule ext)
nipkow@35208
   783
apply(simp)
nipkow@35208
   784
done
nipkow@35208
   785
wenzelm@13142
   786
lemma rev_map: "rev (map f xs) = map f (rev xs)"
nipkow@13145
   787
by (induct xs) auto
wenzelm@13114
   788
nipkow@13737
   789
lemma map_eq_conv[simp]: "(map f xs = map g xs) = (!x : set xs. f x = g x)"
nipkow@13737
   790
by (induct xs) auto
nipkow@13737
   791
krauss@19770
   792
lemma map_cong [fundef_cong, recdef_cong]:
haftmann@40122
   793
  "xs = ys \<Longrightarrow> (\<And>x. x \<in> set ys \<Longrightarrow> f x = g x) \<Longrightarrow> map f xs = map g ys"
haftmann@40122
   794
  by simp
wenzelm@13114
   795
wenzelm@13142
   796
lemma map_is_Nil_conv [iff]: "(map f xs = []) = (xs = [])"
nipkow@13145
   797
by (cases xs) auto
wenzelm@13114
   798
wenzelm@13142
   799
lemma Nil_is_map_conv [iff]: "([] = map f xs) = (xs = [])"
nipkow@13145
   800
by (cases xs) auto
wenzelm@13114
   801
paulson@18447
   802
lemma map_eq_Cons_conv:
nipkow@14025
   803
 "(map f xs = y#ys) = (\<exists>z zs. xs = z#zs \<and> f z = y \<and> map f zs = ys)"
nipkow@13145
   804
by (cases xs) auto
wenzelm@13114
   805
paulson@18447
   806
lemma Cons_eq_map_conv:
nipkow@14025
   807
 "(x#xs = map f ys) = (\<exists>z zs. ys = z#zs \<and> x = f z \<and> xs = map f zs)"
nipkow@14025
   808
by (cases ys) auto
nipkow@14025
   809
paulson@18447
   810
lemmas map_eq_Cons_D = map_eq_Cons_conv [THEN iffD1]
paulson@18447
   811
lemmas Cons_eq_map_D = Cons_eq_map_conv [THEN iffD1]
paulson@18447
   812
declare map_eq_Cons_D [dest!]  Cons_eq_map_D [dest!]
paulson@18447
   813
nipkow@14111
   814
lemma ex_map_conv:
nipkow@14111
   815
  "(EX xs. ys = map f xs) = (ALL y : set ys. EX x. y = f x)"
paulson@18447
   816
by(induct ys, auto simp add: Cons_eq_map_conv)
nipkow@14111
   817
nipkow@15110
   818
lemma map_eq_imp_length_eq:
paulson@35510
   819
  assumes "map f xs = map g ys"
haftmann@26734
   820
  shows "length xs = length ys"
haftmann@26734
   821
using assms proof (induct ys arbitrary: xs)
haftmann@26734
   822
  case Nil then show ?case by simp
haftmann@26734
   823
next
haftmann@26734
   824
  case (Cons y ys) then obtain z zs where xs: "xs = z # zs" by auto
paulson@35510
   825
  from Cons xs have "map f zs = map g ys" by simp
haftmann@26734
   826
  moreover with Cons have "length zs = length ys" by blast
haftmann@26734
   827
  with xs show ?case by simp
haftmann@26734
   828
qed
haftmann@26734
   829
  
nipkow@15110
   830
lemma map_inj_on:
nipkow@15110
   831
 "[| map f xs = map f ys; inj_on f (set xs Un set ys) |]
nipkow@15110
   832
  ==> xs = ys"
nipkow@15110
   833
apply(frule map_eq_imp_length_eq)
nipkow@15110
   834
apply(rotate_tac -1)
nipkow@15110
   835
apply(induct rule:list_induct2)
nipkow@15110
   836
 apply simp
nipkow@15110
   837
apply(simp)
nipkow@15110
   838
apply (blast intro:sym)
nipkow@15110
   839
done
nipkow@15110
   840
nipkow@15110
   841
lemma inj_on_map_eq_map:
nipkow@15110
   842
 "inj_on f (set xs Un set ys) \<Longrightarrow> (map f xs = map f ys) = (xs = ys)"
nipkow@15110
   843
by(blast dest:map_inj_on)
nipkow@15110
   844
wenzelm@13114
   845
lemma map_injective:
nipkow@24526
   846
 "map f xs = map f ys ==> inj f ==> xs = ys"
nipkow@24526
   847
by (induct ys arbitrary: xs) (auto dest!:injD)
wenzelm@13114
   848
nipkow@14339
   849
lemma inj_map_eq_map[simp]: "inj f \<Longrightarrow> (map f xs = map f ys) = (xs = ys)"
nipkow@14339
   850
by(blast dest:map_injective)
nipkow@14339
   851
wenzelm@13114
   852
lemma inj_mapI: "inj f ==> inj (map f)"
nipkow@17589
   853
by (iprover dest: map_injective injD intro: inj_onI)
wenzelm@13114
   854
wenzelm@13114
   855
lemma inj_mapD: "inj (map f) ==> inj f"
paulson@14208
   856
apply (unfold inj_on_def, clarify)
nipkow@13145
   857
apply (erule_tac x = "[x]" in ballE)
paulson@14208
   858
 apply (erule_tac x = "[y]" in ballE, simp, blast)
nipkow@13145
   859
apply blast
nipkow@13145
   860
done
wenzelm@13114
   861
nipkow@14339
   862
lemma inj_map[iff]: "inj (map f) = inj f"
nipkow@13145
   863
by (blast dest: inj_mapD intro: inj_mapI)
wenzelm@13114
   864
nipkow@15303
   865
lemma inj_on_mapI: "inj_on f (\<Union>(set ` A)) \<Longrightarrow> inj_on (map f) A"
nipkow@15303
   866
apply(rule inj_onI)
nipkow@15303
   867
apply(erule map_inj_on)
nipkow@15303
   868
apply(blast intro:inj_onI dest:inj_onD)
nipkow@15303
   869
done
nipkow@15303
   870
kleing@14343
   871
lemma map_idI: "(\<And>x. x \<in> set xs \<Longrightarrow> f x = x) \<Longrightarrow> map f xs = xs"
kleing@14343
   872
by (induct xs, auto)
wenzelm@13114
   873
nipkow@14402
   874
lemma map_fun_upd [simp]: "y \<notin> set xs \<Longrightarrow> map (f(y:=v)) xs = map f xs"
nipkow@14402
   875
by (induct xs) auto
nipkow@14402
   876
nipkow@15110
   877
lemma map_fst_zip[simp]:
nipkow@15110
   878
  "length xs = length ys \<Longrightarrow> map fst (zip xs ys) = xs"
nipkow@15110
   879
by (induct rule:list_induct2, simp_all)
nipkow@15110
   880
nipkow@15110
   881
lemma map_snd_zip[simp]:
nipkow@15110
   882
  "length xs = length ys \<Longrightarrow> map snd (zip xs ys) = ys"
nipkow@15110
   883
by (induct rule:list_induct2, simp_all)
nipkow@15110
   884
nipkow@15110
   885
nipkow@15392
   886
subsubsection {* @{text rev} *}
wenzelm@13114
   887
wenzelm@13142
   888
lemma rev_append [simp]: "rev (xs @ ys) = rev ys @ rev xs"
nipkow@13145
   889
by (induct xs) auto
wenzelm@13114
   890
wenzelm@13142
   891
lemma rev_rev_ident [simp]: "rev (rev xs) = xs"
nipkow@13145
   892
by (induct xs) auto
wenzelm@13114
   893
kleing@15870
   894
lemma rev_swap: "(rev xs = ys) = (xs = rev ys)"
kleing@15870
   895
by auto
kleing@15870
   896
wenzelm@13142
   897
lemma rev_is_Nil_conv [iff]: "(rev xs = []) = (xs = [])"
nipkow@13145
   898
by (induct xs) auto
wenzelm@13114
   899
wenzelm@13142
   900
lemma Nil_is_rev_conv [iff]: "([] = rev xs) = (xs = [])"
nipkow@13145
   901
by (induct xs) auto
wenzelm@13114
   902
kleing@15870
   903
lemma rev_singleton_conv [simp]: "(rev xs = [x]) = (xs = [x])"
kleing@15870
   904
by (cases xs) auto
kleing@15870
   905
kleing@15870
   906
lemma singleton_rev_conv [simp]: "([x] = rev xs) = (xs = [x])"
kleing@15870
   907
by (cases xs) auto
kleing@15870
   908
haftmann@21061
   909
lemma rev_is_rev_conv [iff]: "(rev xs = rev ys) = (xs = ys)"
haftmann@21061
   910
apply (induct xs arbitrary: ys, force)
paulson@14208
   911
apply (case_tac ys, simp, force)
nipkow@13145
   912
done
wenzelm@13114
   913
nipkow@15439
   914
lemma inj_on_rev[iff]: "inj_on rev A"
nipkow@15439
   915
by(simp add:inj_on_def)
nipkow@15439
   916
wenzelm@13366
   917
lemma rev_induct [case_names Nil snoc]:
wenzelm@13366
   918
  "[| P []; !!x xs. P xs ==> P (xs @ [x]) |] ==> P xs"
berghofe@15489
   919
apply(simplesubst rev_rev_ident[symmetric])
nipkow@13145
   920
apply(rule_tac list = "rev xs" in list.induct, simp_all)
nipkow@13145
   921
done
wenzelm@13114
   922
wenzelm@13366
   923
lemma rev_exhaust [case_names Nil snoc]:
wenzelm@13366
   924
  "(xs = [] ==> P) ==>(!!ys y. xs = ys @ [y] ==> P) ==> P"
nipkow@13145
   925
by (induct xs rule: rev_induct) auto
wenzelm@13114
   926
wenzelm@13366
   927
lemmas rev_cases = rev_exhaust
wenzelm@13366
   928
nipkow@18423
   929
lemma rev_eq_Cons_iff[iff]: "(rev xs = y#ys) = (xs = rev ys @ [y])"
nipkow@18423
   930
by(rule rev_cases[of xs]) auto
nipkow@18423
   931
wenzelm@13114
   932
nipkow@15392
   933
subsubsection {* @{text set} *}
wenzelm@13114
   934
wenzelm@13142
   935
lemma finite_set [iff]: "finite (set xs)"
nipkow@13145
   936
by (induct xs) auto
wenzelm@13114
   937
wenzelm@13142
   938
lemma set_append [simp]: "set (xs @ ys) = (set xs \<union> set ys)"
nipkow@13145
   939
by (induct xs) auto
wenzelm@13114
   940
nipkow@17830
   941
lemma hd_in_set[simp]: "xs \<noteq> [] \<Longrightarrow> hd xs : set xs"
nipkow@17830
   942
by(cases xs) auto
oheimb@14099
   943
wenzelm@13142
   944
lemma set_subset_Cons: "set xs \<subseteq> set (x # xs)"
nipkow@13145
   945
by auto
wenzelm@13114
   946
oheimb@14099
   947
lemma set_ConsD: "y \<in> set (x # xs) \<Longrightarrow> y=x \<or> y \<in> set xs" 
oheimb@14099
   948
by auto
oheimb@14099
   949
wenzelm@13142
   950
lemma set_empty [iff]: "(set xs = {}) = (xs = [])"
nipkow@13145
   951
by (induct xs) auto
wenzelm@13114
   952
nipkow@15245
   953
lemma set_empty2[iff]: "({} = set xs) = (xs = [])"
nipkow@15245
   954
by(induct xs) auto
nipkow@15245
   955
wenzelm@13142
   956
lemma set_rev [simp]: "set (rev xs) = set xs"
nipkow@13145
   957
by (induct xs) auto
wenzelm@13114
   958
wenzelm@13142
   959
lemma set_map [simp]: "set (map f xs) = f`(set xs)"
nipkow@13145
   960
by (induct xs) auto
wenzelm@13114
   961
wenzelm@13142
   962
lemma set_filter [simp]: "set (filter P xs) = {x. x : set xs \<and> P x}"
nipkow@13145
   963
by (induct xs) auto
wenzelm@13114
   964
nipkow@32417
   965
lemma set_upt [simp]: "set[i..<j] = {i..<j}"
nipkow@32417
   966
by (induct j) (simp_all add: atLeastLessThanSuc)
wenzelm@13114
   967
wenzelm@13142
   968
wenzelm@25221
   969
lemma split_list: "x : set xs \<Longrightarrow> \<exists>ys zs. xs = ys @ x # zs"
nipkow@18049
   970
proof (induct xs)
nipkow@26073
   971
  case Nil thus ?case by simp
nipkow@26073
   972
next
nipkow@26073
   973
  case Cons thus ?case by (auto intro: Cons_eq_appendI)
nipkow@26073
   974
qed
nipkow@26073
   975
haftmann@26734
   976
lemma in_set_conv_decomp: "x \<in> set xs \<longleftrightarrow> (\<exists>ys zs. xs = ys @ x # zs)"
haftmann@26734
   977
  by (auto elim: split_list)
nipkow@26073
   978
nipkow@26073
   979
lemma split_list_first: "x : set xs \<Longrightarrow> \<exists>ys zs. xs = ys @ x # zs \<and> x \<notin> set ys"
nipkow@26073
   980
proof (induct xs)
nipkow@26073
   981
  case Nil thus ?case by simp
nipkow@18049
   982
next
nipkow@18049
   983
  case (Cons a xs)
nipkow@18049
   984
  show ?case
nipkow@18049
   985
  proof cases
wenzelm@25221
   986
    assume "x = a" thus ?case using Cons by fastsimp
nipkow@18049
   987
  next
nipkow@26073
   988
    assume "x \<noteq> a" thus ?case using Cons by(fastsimp intro!: Cons_eq_appendI)
nipkow@26073
   989
  qed
nipkow@26073
   990
qed
nipkow@26073
   991
nipkow@26073
   992
lemma in_set_conv_decomp_first:
nipkow@26073
   993
  "(x : set xs) = (\<exists>ys zs. xs = ys @ x # zs \<and> x \<notin> set ys)"
haftmann@26734
   994
  by (auto dest!: split_list_first)
nipkow@26073
   995
haftmann@40122
   996
lemma split_list_last: "x \<in> set xs \<Longrightarrow> \<exists>ys zs. xs = ys @ x # zs \<and> x \<notin> set zs"
haftmann@40122
   997
proof (induct xs rule: rev_induct)
nipkow@26073
   998
  case Nil thus ?case by simp
nipkow@26073
   999
next
nipkow@26073
  1000
  case (snoc a xs)
nipkow@26073
  1001
  show ?case
nipkow@26073
  1002
  proof cases
haftmann@40122
  1003
    assume "x = a" thus ?case using snoc by (metis List.set.simps(1) emptyE)
nipkow@26073
  1004
  next
nipkow@26073
  1005
    assume "x \<noteq> a" thus ?case using snoc by fastsimp
nipkow@18049
  1006
  qed
nipkow@18049
  1007
qed
nipkow@18049
  1008
nipkow@26073
  1009
lemma in_set_conv_decomp_last:
nipkow@26073
  1010
  "(x : set xs) = (\<exists>ys zs. xs = ys @ x # zs \<and> x \<notin> set zs)"
haftmann@26734
  1011
  by (auto dest!: split_list_last)
nipkow@26073
  1012
nipkow@26073
  1013
lemma split_list_prop: "\<exists>x \<in> set xs. P x \<Longrightarrow> \<exists>ys x zs. xs = ys @ x # zs & P x"
nipkow@26073
  1014
proof (induct xs)
nipkow@26073
  1015
  case Nil thus ?case by simp
nipkow@26073
  1016
next
nipkow@26073
  1017
  case Cons thus ?case
nipkow@26073
  1018
    by(simp add:Bex_def)(metis append_Cons append.simps(1))
nipkow@26073
  1019
qed
nipkow@26073
  1020
nipkow@26073
  1021
lemma split_list_propE:
haftmann@26734
  1022
  assumes "\<exists>x \<in> set xs. P x"
haftmann@26734
  1023
  obtains ys x zs where "xs = ys @ x # zs" and "P x"
haftmann@26734
  1024
using split_list_prop [OF assms] by blast
nipkow@26073
  1025
nipkow@26073
  1026
lemma split_list_first_prop:
nipkow@26073
  1027
  "\<exists>x \<in> set xs. P x \<Longrightarrow>
nipkow@26073
  1028
   \<exists>ys x zs. xs = ys@x#zs \<and> P x \<and> (\<forall>y \<in> set ys. \<not> P y)"
haftmann@26734
  1029
proof (induct xs)
nipkow@26073
  1030
  case Nil thus ?case by simp
nipkow@26073
  1031
next
nipkow@26073
  1032
  case (Cons x xs)
nipkow@26073
  1033
  show ?case
nipkow@26073
  1034
  proof cases
nipkow@26073
  1035
    assume "P x"
haftmann@40122
  1036
    thus ?thesis by simp (metis Un_upper1 contra_subsetD in_set_conv_decomp_first self_append_conv2 set_append)
nipkow@26073
  1037
  next
nipkow@26073
  1038
    assume "\<not> P x"
nipkow@26073
  1039
    hence "\<exists>x\<in>set xs. P x" using Cons(2) by simp
nipkow@26073
  1040
    thus ?thesis using `\<not> P x` Cons(1) by (metis append_Cons set_ConsD)
nipkow@26073
  1041
  qed
nipkow@26073
  1042
qed
nipkow@26073
  1043
nipkow@26073
  1044
lemma split_list_first_propE:
haftmann@26734
  1045
  assumes "\<exists>x \<in> set xs. P x"
haftmann@26734
  1046
  obtains ys x zs where "xs = ys @ x # zs" and "P x" and "\<forall>y \<in> set ys. \<not> P y"
haftmann@26734
  1047
using split_list_first_prop [OF assms] by blast
nipkow@26073
  1048
nipkow@26073
  1049
lemma split_list_first_prop_iff:
nipkow@26073
  1050
  "(\<exists>x \<in> set xs. P x) \<longleftrightarrow>
nipkow@26073
  1051
   (\<exists>ys x zs. xs = ys@x#zs \<and> P x \<and> (\<forall>y \<in> set ys. \<not> P y))"
haftmann@26734
  1052
by (rule, erule split_list_first_prop) auto
nipkow@26073
  1053
nipkow@26073
  1054
lemma split_list_last_prop:
nipkow@26073
  1055
  "\<exists>x \<in> set xs. P x \<Longrightarrow>
nipkow@26073
  1056
   \<exists>ys x zs. xs = ys@x#zs \<and> P x \<and> (\<forall>z \<in> set zs. \<not> P z)"
nipkow@26073
  1057
proof(induct xs rule:rev_induct)
nipkow@26073
  1058
  case Nil thus ?case by simp
nipkow@26073
  1059
next
nipkow@26073
  1060
  case (snoc x xs)
nipkow@26073
  1061
  show ?case
nipkow@26073
  1062
  proof cases
nipkow@26073
  1063
    assume "P x" thus ?thesis by (metis emptyE set_empty)
nipkow@26073
  1064
  next
nipkow@26073
  1065
    assume "\<not> P x"
nipkow@26073
  1066
    hence "\<exists>x\<in>set xs. P x" using snoc(2) by simp
nipkow@26073
  1067
    thus ?thesis using `\<not> P x` snoc(1) by fastsimp
nipkow@26073
  1068
  qed
nipkow@26073
  1069
qed
nipkow@26073
  1070
nipkow@26073
  1071
lemma split_list_last_propE:
haftmann@26734
  1072
  assumes "\<exists>x \<in> set xs. P x"
haftmann@26734
  1073
  obtains ys x zs where "xs = ys @ x # zs" and "P x" and "\<forall>z \<in> set zs. \<not> P z"
haftmann@26734
  1074
using split_list_last_prop [OF assms] by blast
nipkow@26073
  1075
nipkow@26073
  1076
lemma split_list_last_prop_iff:
nipkow@26073
  1077
  "(\<exists>x \<in> set xs. P x) \<longleftrightarrow>
nipkow@26073
  1078
   (\<exists>ys x zs. xs = ys@x#zs \<and> P x \<and> (\<forall>z \<in> set zs. \<not> P z))"
haftmann@26734
  1079
by (metis split_list_last_prop [where P=P] in_set_conv_decomp)
nipkow@26073
  1080
nipkow@26073
  1081
lemma finite_list: "finite A ==> EX xs. set xs = A"
haftmann@26734
  1082
  by (erule finite_induct)
haftmann@26734
  1083
    (auto simp add: set.simps(2) [symmetric] simp del: set.simps(2))
paulson@13508
  1084
kleing@14388
  1085
lemma card_length: "card (set xs) \<le> length xs"
kleing@14388
  1086
by (induct xs) (auto simp add: card_insert_if)
wenzelm@13114
  1087
haftmann@26442
  1088
lemma set_minus_filter_out:
haftmann@26442
  1089
  "set xs - {y} = set (filter (\<lambda>x. \<not> (x = y)) xs)"
haftmann@26442
  1090
  by (induct xs) auto
paulson@15168
  1091
wenzelm@35115
  1092
nipkow@15392
  1093
subsubsection {* @{text filter} *}
wenzelm@13114
  1094
wenzelm@13142
  1095
lemma filter_append [simp]: "filter P (xs @ ys) = filter P xs @ filter P ys"
nipkow@13145
  1096
by (induct xs) auto
wenzelm@13114
  1097
nipkow@15305
  1098
lemma rev_filter: "rev (filter P xs) = filter P (rev xs)"
nipkow@15305
  1099
by (induct xs) simp_all
nipkow@15305
  1100
wenzelm@13142
  1101
lemma filter_filter [simp]: "filter P (filter Q xs) = filter (\<lambda>x. Q x \<and> P x) xs"
nipkow@13145
  1102
by (induct xs) auto
wenzelm@13114
  1103
nipkow@16998
  1104
lemma length_filter_le [simp]: "length (filter P xs) \<le> length xs"
nipkow@16998
  1105
by (induct xs) (auto simp add: le_SucI)
nipkow@16998
  1106
nipkow@18423
  1107
lemma sum_length_filter_compl:
nipkow@18423
  1108
  "length(filter P xs) + length(filter (%x. ~P x) xs) = length xs"
nipkow@18423
  1109
by(induct xs) simp_all
nipkow@18423
  1110
wenzelm@13142
  1111
lemma filter_True [simp]: "\<forall>x \<in> set xs. P x ==> filter P xs = xs"
nipkow@13145
  1112
by (induct xs) auto
wenzelm@13114
  1113
wenzelm@13142
  1114
lemma filter_False [simp]: "\<forall>x \<in> set xs. \<not> P x ==> filter P xs = []"
nipkow@13145
  1115
by (induct xs) auto
wenzelm@13114
  1116
nipkow@16998
  1117
lemma filter_empty_conv: "(filter P xs = []) = (\<forall>x\<in>set xs. \<not> P x)" 
nipkow@24349
  1118
by (induct xs) simp_all
nipkow@16998
  1119
nipkow@16998
  1120
lemma filter_id_conv: "(filter P xs = xs) = (\<forall>x\<in>set xs. P x)"
nipkow@16998
  1121
apply (induct xs)
nipkow@16998
  1122
 apply auto
nipkow@16998
  1123
apply(cut_tac P=P and xs=xs in length_filter_le)
nipkow@16998
  1124
apply simp
nipkow@16998
  1125
done
wenzelm@13114
  1126
nipkow@16965
  1127
lemma filter_map:
nipkow@16965
  1128
  "filter P (map f xs) = map f (filter (P o f) xs)"
nipkow@16965
  1129
by (induct xs) simp_all
nipkow@16965
  1130
nipkow@16965
  1131
lemma length_filter_map[simp]:
nipkow@16965
  1132
  "length (filter P (map f xs)) = length(filter (P o f) xs)"
nipkow@16965
  1133
by (simp add:filter_map)
nipkow@16965
  1134
wenzelm@13142
  1135
lemma filter_is_subset [simp]: "set (filter P xs) \<le> set xs"
nipkow@13145
  1136
by auto
wenzelm@13114
  1137
nipkow@15246
  1138
lemma length_filter_less:
nipkow@15246
  1139
  "\<lbrakk> x : set xs; ~ P x \<rbrakk> \<Longrightarrow> length(filter P xs) < length xs"
nipkow@15246
  1140
proof (induct xs)
nipkow@15246
  1141
  case Nil thus ?case by simp
nipkow@15246
  1142
next
nipkow@15246
  1143
  case (Cons x xs) thus ?case
nipkow@15246
  1144
    apply (auto split:split_if_asm)
nipkow@15246
  1145
    using length_filter_le[of P xs] apply arith
nipkow@15246
  1146
  done
nipkow@15246
  1147
qed
wenzelm@13114
  1148
nipkow@15281
  1149
lemma length_filter_conv_card:
nipkow@15281
  1150
 "length(filter p xs) = card{i. i < length xs & p(xs!i)}"
nipkow@15281
  1151
proof (induct xs)
nipkow@15281
  1152
  case Nil thus ?case by simp
nipkow@15281
  1153
next
nipkow@15281
  1154
  case (Cons x xs)
nipkow@15281
  1155
  let ?S = "{i. i < length xs & p(xs!i)}"
nipkow@15281
  1156
  have fin: "finite ?S" by(fast intro: bounded_nat_set_is_finite)
nipkow@15281
  1157
  show ?case (is "?l = card ?S'")
nipkow@15281
  1158
  proof (cases)
nipkow@15281
  1159
    assume "p x"
nipkow@15281
  1160
    hence eq: "?S' = insert 0 (Suc ` ?S)"
nipkow@25162
  1161
      by(auto simp: image_def split:nat.split dest:gr0_implies_Suc)
nipkow@15281
  1162
    have "length (filter p (x # xs)) = Suc(card ?S)"
wenzelm@23388
  1163
      using Cons `p x` by simp
nipkow@15281
  1164
    also have "\<dots> = Suc(card(Suc ` ?S))" using fin
nipkow@15281
  1165
      by (simp add: card_image inj_Suc)
nipkow@15281
  1166
    also have "\<dots> = card ?S'" using eq fin
nipkow@15281
  1167
      by (simp add:card_insert_if) (simp add:image_def)
nipkow@15281
  1168
    finally show ?thesis .
nipkow@15281
  1169
  next
nipkow@15281
  1170
    assume "\<not> p x"
nipkow@15281
  1171
    hence eq: "?S' = Suc ` ?S"
nipkow@25162
  1172
      by(auto simp add: image_def split:nat.split elim:lessE)
nipkow@15281
  1173
    have "length (filter p (x # xs)) = card ?S"
wenzelm@23388
  1174
      using Cons `\<not> p x` by simp
nipkow@15281
  1175
    also have "\<dots> = card(Suc ` ?S)" using fin
nipkow@15281
  1176
      by (simp add: card_image inj_Suc)
nipkow@15281
  1177
    also have "\<dots> = card ?S'" using eq fin
nipkow@15281
  1178
      by (simp add:card_insert_if)
nipkow@15281
  1179
    finally show ?thesis .
nipkow@15281
  1180
  qed
nipkow@15281
  1181
qed
nipkow@15281
  1182
nipkow@17629
  1183
lemma Cons_eq_filterD:
nipkow@17629
  1184
 "x#xs = filter P ys \<Longrightarrow>
nipkow@17629
  1185
  \<exists>us vs. ys = us @ x # vs \<and> (\<forall>u\<in>set us. \<not> P u) \<and> P x \<and> xs = filter P vs"
wenzelm@19585
  1186
  (is "_ \<Longrightarrow> \<exists>us vs. ?P ys us vs")
nipkow@17629
  1187
proof(induct ys)
nipkow@17629
  1188
  case Nil thus ?case by simp
nipkow@17629
  1189
next
nipkow@17629
  1190
  case (Cons y ys)
nipkow@17629
  1191
  show ?case (is "\<exists>x. ?Q x")
nipkow@17629
  1192
  proof cases
nipkow@17629
  1193
    assume Py: "P y"
nipkow@17629
  1194
    show ?thesis
nipkow@17629
  1195
    proof cases
wenzelm@25221
  1196
      assume "x = y"
wenzelm@25221
  1197
      with Py Cons.prems have "?Q []" by simp
wenzelm@25221
  1198
      then show ?thesis ..
nipkow@17629
  1199
    next
wenzelm@25221
  1200
      assume "x \<noteq> y"
wenzelm@25221
  1201
      with Py Cons.prems show ?thesis by simp
nipkow@17629
  1202
    qed
nipkow@17629
  1203
  next
wenzelm@25221
  1204
    assume "\<not> P y"
wenzelm@25221
  1205
    with Cons obtain us vs where "?P (y#ys) (y#us) vs" by fastsimp
wenzelm@25221
  1206
    then have "?Q (y#us)" by simp
wenzelm@25221
  1207
    then show ?thesis ..
nipkow@17629
  1208
  qed
nipkow@17629
  1209
qed
nipkow@17629
  1210
nipkow@17629
  1211
lemma filter_eq_ConsD:
nipkow@17629
  1212
 "filter P ys = x#xs \<Longrightarrow>
nipkow@17629
  1213
  \<exists>us vs. ys = us @ x # vs \<and> (\<forall>u\<in>set us. \<not> P u) \<and> P x \<and> xs = filter P vs"
nipkow@17629
  1214
by(rule Cons_eq_filterD) simp
nipkow@17629
  1215
nipkow@17629
  1216
lemma filter_eq_Cons_iff:
nipkow@17629
  1217
 "(filter P ys = x#xs) =
nipkow@17629
  1218
  (\<exists>us vs. ys = us @ x # vs \<and> (\<forall>u\<in>set us. \<not> P u) \<and> P x \<and> xs = filter P vs)"
nipkow@17629
  1219
by(auto dest:filter_eq_ConsD)
nipkow@17629
  1220
nipkow@17629
  1221
lemma Cons_eq_filter_iff:
nipkow@17629
  1222
 "(x#xs = filter P ys) =
nipkow@17629
  1223
  (\<exists>us vs. ys = us @ x # vs \<and> (\<forall>u\<in>set us. \<not> P u) \<and> P x \<and> xs = filter P vs)"
nipkow@17629
  1224
by(auto dest:Cons_eq_filterD)
nipkow@17629
  1225
krauss@19770
  1226
lemma filter_cong[fundef_cong, recdef_cong]:
nipkow@17501
  1227
 "xs = ys \<Longrightarrow> (\<And>x. x \<in> set ys \<Longrightarrow> P x = Q x) \<Longrightarrow> filter P xs = filter Q ys"
nipkow@17501
  1228
apply simp
nipkow@17501
  1229
apply(erule thin_rl)
nipkow@17501
  1230
by (induct ys) simp_all
nipkow@17501
  1231
nipkow@15281
  1232
haftmann@26442
  1233
subsubsection {* List partitioning *}
haftmann@26442
  1234
haftmann@26442
  1235
primrec partition :: "('a \<Rightarrow> bool) \<Rightarrow>'a list \<Rightarrow> 'a list \<times> 'a list" where
haftmann@26442
  1236
  "partition P [] = ([], [])"
haftmann@26442
  1237
  | "partition P (x # xs) = 
haftmann@26442
  1238
      (let (yes, no) = partition P xs
haftmann@26442
  1239
      in if P x then (x # yes, no) else (yes, x # no))"
haftmann@26442
  1240
haftmann@26442
  1241
lemma partition_filter1:
haftmann@26442
  1242
    "fst (partition P xs) = filter P xs"
haftmann@26442
  1243
by (induct xs) (auto simp add: Let_def split_def)
haftmann@26442
  1244
haftmann@26442
  1245
lemma partition_filter2:
haftmann@26442
  1246
    "snd (partition P xs) = filter (Not o P) xs"
haftmann@26442
  1247
by (induct xs) (auto simp add: Let_def split_def)
haftmann@26442
  1248
haftmann@26442
  1249
lemma partition_P:
haftmann@26442
  1250
  assumes "partition P xs = (yes, no)"
haftmann@26442
  1251
  shows "(\<forall>p \<in> set yes.  P p) \<and> (\<forall>p  \<in> set no. \<not> P p)"
haftmann@26442
  1252
proof -
haftmann@26442
  1253
  from assms have "yes = fst (partition P xs)" and "no = snd (partition P xs)"
haftmann@26442
  1254
    by simp_all
haftmann@26442
  1255
  then show ?thesis by (simp_all add: partition_filter1 partition_filter2)
haftmann@26442
  1256
qed
haftmann@26442
  1257
haftmann@26442
  1258
lemma partition_set:
haftmann@26442
  1259
  assumes "partition P xs = (yes, no)"
haftmann@26442
  1260
  shows "set yes \<union> set no = set xs"
haftmann@26442
  1261
proof -
haftmann@26442
  1262
  from assms have "yes = fst (partition P xs)" and "no = snd (partition P xs)"
haftmann@26442
  1263
    by simp_all
haftmann@26442
  1264
  then show ?thesis by (auto simp add: partition_filter1 partition_filter2) 
haftmann@26442
  1265
qed
haftmann@26442
  1266
hoelzl@33639
  1267
lemma partition_filter_conv[simp]:
hoelzl@33639
  1268
  "partition f xs = (filter f xs,filter (Not o f) xs)"
hoelzl@33639
  1269
unfolding partition_filter2[symmetric]
hoelzl@33639
  1270
unfolding partition_filter1[symmetric] by simp
hoelzl@33639
  1271
hoelzl@33639
  1272
declare partition.simps[simp del]
haftmann@26442
  1273
wenzelm@35115
  1274
nipkow@15392
  1275
subsubsection {* @{text concat} *}
wenzelm@13114
  1276
wenzelm@13142
  1277
lemma concat_append [simp]: "concat (xs @ ys) = concat xs @ concat ys"
nipkow@13145
  1278
by (induct xs) auto
wenzelm@13114
  1279
paulson@18447
  1280
lemma concat_eq_Nil_conv [simp]: "(concat xss = []) = (\<forall>xs \<in> set xss. xs = [])"
nipkow@13145
  1281
by (induct xss) auto
wenzelm@13114
  1282
paulson@18447
  1283
lemma Nil_eq_concat_conv [simp]: "([] = concat xss) = (\<forall>xs \<in> set xss. xs = [])"
nipkow@13145
  1284
by (induct xss) auto
wenzelm@13114
  1285
nipkow@24308
  1286
lemma set_concat [simp]: "set (concat xs) = (UN x:set xs. set x)"
nipkow@13145
  1287
by (induct xs) auto
wenzelm@13114
  1288
nipkow@24476
  1289
lemma concat_map_singleton[simp]: "concat(map (%x. [f x]) xs) = map f xs"
nipkow@24349
  1290
by (induct xs) auto
nipkow@24349
  1291
wenzelm@13142
  1292
lemma map_concat: "map f (concat xs) = concat (map (map f) xs)"
nipkow@13145
  1293
by (induct xs) auto
wenzelm@13114
  1294
wenzelm@13142
  1295
lemma filter_concat: "filter p (concat xs) = concat (map (filter p) xs)"
nipkow@13145
  1296
by (induct xs) auto
wenzelm@13114
  1297
wenzelm@13142
  1298
lemma rev_concat: "rev (concat xs) = concat (map rev (rev xs))"
nipkow@13145
  1299
by (induct xs) auto
wenzelm@13114
  1300
wenzelm@13114
  1301
nipkow@15392
  1302
subsubsection {* @{text nth} *}
wenzelm@13114
  1303
haftmann@29827
  1304
lemma nth_Cons_0 [simp, code]: "(x # xs)!0 = x"
nipkow@13145
  1305
by auto
wenzelm@13114
  1306
haftmann@29827
  1307
lemma nth_Cons_Suc [simp, code]: "(x # xs)!(Suc n) = xs!n"
nipkow@13145
  1308
by auto
wenzelm@13114
  1309
wenzelm@13142
  1310
declare nth.simps [simp del]
wenzelm@13114
  1311
wenzelm@13114
  1312
lemma nth_append:
nipkow@24526
  1313
  "(xs @ ys)!n = (if n < length xs then xs!n else ys!(n - length xs))"
nipkow@24526
  1314
apply (induct xs arbitrary: n, simp)
paulson@14208
  1315
apply (case_tac n, auto)
nipkow@13145
  1316
done
wenzelm@13114
  1317
nipkow@14402
  1318
lemma nth_append_length [simp]: "(xs @ x # ys) ! length xs = x"
wenzelm@25221
  1319
by (induct xs) auto
nipkow@14402
  1320
nipkow@14402
  1321
lemma nth_append_length_plus[simp]: "(xs @ ys) ! (length xs + n) = ys ! n"
wenzelm@25221
  1322
by (induct xs) auto
nipkow@14402
  1323
nipkow@24526
  1324
lemma nth_map [simp]: "n < length xs ==> (map f xs)!n = f(xs!n)"
nipkow@24526
  1325
apply (induct xs arbitrary: n, simp)
paulson@14208
  1326
apply (case_tac n, auto)
nipkow@13145
  1327
done
wenzelm@13114
  1328
nipkow@18423
  1329
lemma hd_conv_nth: "xs \<noteq> [] \<Longrightarrow> hd xs = xs!0"
nipkow@18423
  1330
by(cases xs) simp_all
nipkow@18423
  1331
nipkow@18049
  1332
nipkow@18049
  1333
lemma list_eq_iff_nth_eq:
nipkow@24526
  1334
 "(xs = ys) = (length xs = length ys \<and> (ALL i<length xs. xs!i = ys!i))"
nipkow@24526
  1335
apply(induct xs arbitrary: ys)
paulson@24632
  1336
 apply force
nipkow@18049
  1337
apply(case_tac ys)
nipkow@18049
  1338
 apply simp
nipkow@18049
  1339
apply(simp add:nth_Cons split:nat.split)apply blast
nipkow@18049
  1340
done
nipkow@18049
  1341
wenzelm@13142
  1342
lemma set_conv_nth: "set xs = {xs!i | i. i < length xs}"
paulson@15251
  1343
apply (induct xs, simp, simp)
nipkow@13145
  1344
apply safe
paulson@24632
  1345
apply (metis nat_case_0 nth.simps zero_less_Suc)
paulson@24632
  1346
apply (metis less_Suc_eq_0_disj nth_Cons_Suc)
paulson@14208
  1347
apply (case_tac i, simp)
paulson@24632
  1348
apply (metis diff_Suc_Suc nat_case_Suc nth.simps zero_less_diff)
nipkow@13145
  1349
done
wenzelm@13114
  1350
nipkow@17501
  1351
lemma in_set_conv_nth: "(x \<in> set xs) = (\<exists>i < length xs. xs!i = x)"
nipkow@17501
  1352
by(auto simp:set_conv_nth)
nipkow@17501
  1353
nipkow@13145
  1354
lemma list_ball_nth: "[| n < length xs; !x : set xs. P x|] ==> P(xs!n)"
nipkow@13145
  1355
by (auto simp add: set_conv_nth)
wenzelm@13114
  1356
wenzelm@13142
  1357
lemma nth_mem [simp]: "n < length xs ==> xs!n : set xs"
nipkow@13145
  1358
by (auto simp add: set_conv_nth)
wenzelm@13114
  1359
wenzelm@13114
  1360
lemma all_nth_imp_all_set:
nipkow@13145
  1361
"[| !i < length xs. P(xs!i); x : set xs|] ==> P x"
nipkow@13145
  1362
by (auto simp add: set_conv_nth)
wenzelm@13114
  1363
wenzelm@13114
  1364
lemma all_set_conv_all_nth:
nipkow@13145
  1365
"(\<forall>x \<in> set xs. P x) = (\<forall>i. i < length xs --> P (xs ! i))"
nipkow@13145
  1366
by (auto simp add: set_conv_nth)
wenzelm@13114
  1367
kleing@25296
  1368
lemma rev_nth:
kleing@25296
  1369
  "n < size xs \<Longrightarrow> rev xs ! n = xs ! (length xs - Suc n)"
kleing@25296
  1370
proof (induct xs arbitrary: n)
kleing@25296
  1371
  case Nil thus ?case by simp
kleing@25296
  1372
next
kleing@25296
  1373
  case (Cons x xs)
kleing@25296
  1374
  hence n: "n < Suc (length xs)" by simp
kleing@25296
  1375
  moreover
kleing@25296
  1376
  { assume "n < length xs"
kleing@25296
  1377
    with n obtain n' where "length xs - n = Suc n'"
kleing@25296
  1378
      by (cases "length xs - n", auto)
kleing@25296
  1379
    moreover
kleing@25296
  1380
    then have "length xs - Suc n = n'" by simp
kleing@25296
  1381
    ultimately
kleing@25296
  1382
    have "xs ! (length xs - Suc n) = (x # xs) ! (length xs - n)" by simp
kleing@25296
  1383
  }
kleing@25296
  1384
  ultimately
kleing@25296
  1385
  show ?case by (clarsimp simp add: Cons nth_append)
kleing@25296
  1386
qed
wenzelm@13114
  1387
nipkow@31159
  1388
lemma Skolem_list_nth:
nipkow@31159
  1389
  "(ALL i<k. EX x. P i x) = (EX xs. size xs = k & (ALL i<k. P i (xs!i)))"
nipkow@31159
  1390
  (is "_ = (EX xs. ?P k xs)")
nipkow@31159
  1391
proof(induct k)
nipkow@31159
  1392
  case 0 show ?case by simp
nipkow@31159
  1393
next
nipkow@31159
  1394
  case (Suc k)
nipkow@31159
  1395
  show ?case (is "?L = ?R" is "_ = (EX xs. ?P' xs)")
nipkow@31159
  1396
  proof
nipkow@31159
  1397
    assume "?R" thus "?L" using Suc by auto
nipkow@31159
  1398
  next
nipkow@31159
  1399
    assume "?L"
nipkow@31159
  1400
    with Suc obtain x xs where "?P k xs & P k x" by (metis less_Suc_eq)
nipkow@31159
  1401
    hence "?P'(xs@[x])" by(simp add:nth_append less_Suc_eq)
nipkow@31159
  1402
    thus "?R" ..
nipkow@31159
  1403
  qed
nipkow@31159
  1404
qed
nipkow@31159
  1405
nipkow@31159
  1406
nipkow@15392
  1407
subsubsection {* @{text list_update} *}
wenzelm@13114
  1408
nipkow@24526
  1409
lemma length_list_update [simp]: "length(xs[i:=x]) = length xs"
nipkow@24526
  1410
by (induct xs arbitrary: i) (auto split: nat.split)
wenzelm@13114
  1411
wenzelm@13114
  1412
lemma nth_list_update:
nipkow@24526
  1413
"i < length xs==> (xs[i:=x])!j = (if i = j then x else xs!j)"
nipkow@24526
  1414
by (induct xs arbitrary: i j) (auto simp add: nth_Cons split: nat.split)
wenzelm@13114
  1415
wenzelm@13142
  1416
lemma nth_list_update_eq [simp]: "i < length xs ==> (xs[i:=x])!i = x"
nipkow@13145
  1417
by (simp add: nth_list_update)
wenzelm@13114
  1418
nipkow@24526
  1419
lemma nth_list_update_neq [simp]: "i \<noteq> j ==> xs[i:=x]!j = xs!j"
nipkow@24526
  1420
by (induct xs arbitrary: i j) (auto simp add: nth_Cons split: nat.split)
wenzelm@13114
  1421
nipkow@24526
  1422
lemma list_update_id[simp]: "xs[i := xs!i] = xs"
nipkow@24526
  1423
by (induct xs arbitrary: i) (simp_all split:nat.splits)
nipkow@24526
  1424
nipkow@24526
  1425
lemma list_update_beyond[simp]: "length xs \<le> i \<Longrightarrow> xs[i:=x] = xs"
nipkow@24526
  1426
apply (induct xs arbitrary: i)
nipkow@17501
  1427
 apply simp
nipkow@17501
  1428
apply (case_tac i)
nipkow@17501
  1429
apply simp_all
nipkow@17501
  1430
done
nipkow@17501
  1431
nipkow@31077
  1432
lemma list_update_nonempty[simp]: "xs[k:=x] = [] \<longleftrightarrow> xs=[]"
nipkow@31077
  1433
by(metis length_0_conv length_list_update)
nipkow@31077
  1434
wenzelm@13114
  1435
lemma list_update_same_conv:
nipkow@24526
  1436
"i < length xs ==> (xs[i := x] = xs) = (xs!i = x)"
nipkow@24526
  1437
by (induct xs arbitrary: i) (auto split: nat.split)
wenzelm@13114
  1438
nipkow@14187
  1439
lemma list_update_append1:
nipkow@24526
  1440
 "i < size xs \<Longrightarrow> (xs @ ys)[i:=x] = xs[i:=x] @ ys"
nipkow@24526
  1441
apply (induct xs arbitrary: i, simp)
nipkow@14187
  1442
apply(simp split:nat.split)
nipkow@14187
  1443
done
nipkow@14187
  1444
kleing@15868
  1445
lemma list_update_append:
nipkow@24526
  1446
  "(xs @ ys) [n:= x] = 
kleing@15868
  1447
  (if n < length xs then xs[n:= x] @ ys else xs @ (ys [n-length xs:= x]))"
nipkow@24526
  1448
by (induct xs arbitrary: n) (auto split:nat.splits)
kleing@15868
  1449
nipkow@14402
  1450
lemma list_update_length [simp]:
nipkow@14402
  1451
 "(xs @ x # ys)[length xs := y] = (xs @ y # ys)"
nipkow@14402
  1452
by (induct xs, auto)
nipkow@14402
  1453
nipkow@31264
  1454
lemma map_update: "map f (xs[k:= y]) = (map f xs)[k := f y]"
nipkow@31264
  1455
by(induct xs arbitrary: k)(auto split:nat.splits)
nipkow@31264
  1456
nipkow@31264
  1457
lemma rev_update:
nipkow@31264
  1458
  "k < length xs \<Longrightarrow> rev (xs[k:= y]) = (rev xs)[length xs - k - 1 := y]"
nipkow@31264
  1459
by (induct xs arbitrary: k) (auto simp: list_update_append split:nat.splits)
nipkow@31264
  1460
wenzelm@13114
  1461
lemma update_zip:
nipkow@31080
  1462
  "(zip xs ys)[i:=xy] = zip (xs[i:=fst xy]) (ys[i:=snd xy])"
nipkow@24526
  1463
by (induct ys arbitrary: i xy xs) (auto, case_tac xs, auto split: nat.split)
nipkow@24526
  1464
nipkow@24526
  1465
lemma set_update_subset_insert: "set(xs[i:=x]) <= insert x (set xs)"
nipkow@24526
  1466
by (induct xs arbitrary: i) (auto split: nat.split)
wenzelm@13114
  1467
wenzelm@13114
  1468
lemma set_update_subsetI: "[| set xs <= A; x:A |] ==> set(xs[i := x]) <= A"
nipkow@13145
  1469
by (blast dest!: set_update_subset_insert [THEN subsetD])
wenzelm@13114
  1470
nipkow@24526
  1471
lemma set_update_memI: "n < length xs \<Longrightarrow> x \<in> set (xs[n := x])"
nipkow@24526
  1472
by (induct xs arbitrary: n) (auto split:nat.splits)
kleing@15868
  1473
nipkow@31077
  1474
lemma list_update_overwrite[simp]:
haftmann@24796
  1475
  "xs [i := x, i := y] = xs [i := y]"
nipkow@31077
  1476
apply (induct xs arbitrary: i) apply simp
nipkow@31077
  1477
apply (case_tac i, simp_all)
haftmann@24796
  1478
done
haftmann@24796
  1479
haftmann@24796
  1480
lemma list_update_swap:
haftmann@24796
  1481
  "i \<noteq> i' \<Longrightarrow> xs [i := x, i' := x'] = xs [i' := x', i := x]"
haftmann@24796
  1482
apply (induct xs arbitrary: i i')
haftmann@24796
  1483
apply simp
haftmann@24796
  1484
apply (case_tac i, case_tac i')
haftmann@24796
  1485
apply auto
haftmann@24796
  1486
apply (case_tac i')
haftmann@24796
  1487
apply auto
haftmann@24796
  1488
done
haftmann@24796
  1489
haftmann@29827
  1490
lemma list_update_code [code]:
haftmann@29827
  1491
  "[][i := y] = []"
haftmann@29827
  1492
  "(x # xs)[0 := y] = y # xs"
haftmann@29827
  1493
  "(x # xs)[Suc i := y] = x # xs[i := y]"
haftmann@29827
  1494
  by simp_all
haftmann@29827
  1495
wenzelm@13114
  1496
nipkow@15392
  1497
subsubsection {* @{text last} and @{text butlast} *}
wenzelm@13114
  1498
wenzelm@13142
  1499
lemma last_snoc [simp]: "last (xs @ [x]) = x"
nipkow@13145
  1500
by (induct xs) auto
wenzelm@13114
  1501
wenzelm@13142
  1502
lemma butlast_snoc [simp]: "butlast (xs @ [x]) = xs"
nipkow@13145
  1503
by (induct xs) auto
wenzelm@13114
  1504
nipkow@14302
  1505
lemma last_ConsL: "xs = [] \<Longrightarrow> last(x#xs) = x"
nipkow@14302
  1506
by(simp add:last.simps)
nipkow@14302
  1507
nipkow@14302
  1508
lemma last_ConsR: "xs \<noteq> [] \<Longrightarrow> last(x#xs) = last xs"
nipkow@14302
  1509
by(simp add:last.simps)
nipkow@14302
  1510
nipkow@14302
  1511
lemma last_append: "last(xs @ ys) = (if ys = [] then last xs else last ys)"
nipkow@14302
  1512
by (induct xs) (auto)
nipkow@14302
  1513
nipkow@14302
  1514
lemma last_appendL[simp]: "ys = [] \<Longrightarrow> last(xs @ ys) = last xs"
nipkow@14302
  1515
by(simp add:last_append)
nipkow@14302
  1516
nipkow@14302
  1517
lemma last_appendR[simp]: "ys \<noteq> [] \<Longrightarrow> last(xs @ ys) = last ys"
nipkow@14302
  1518
by(simp add:last_append)
nipkow@14302
  1519
nipkow@17762
  1520
lemma hd_rev: "xs \<noteq> [] \<Longrightarrow> hd(rev xs) = last xs"
nipkow@17762
  1521
by(rule rev_exhaust[of xs]) simp_all
nipkow@17762
  1522
nipkow@17762
  1523
lemma last_rev: "xs \<noteq> [] \<Longrightarrow> last(rev xs) = hd xs"
nipkow@17762
  1524
by(cases xs) simp_all
nipkow@17762
  1525
nipkow@17765
  1526
lemma last_in_set[simp]: "as \<noteq> [] \<Longrightarrow> last as \<in> set as"
nipkow@17765
  1527
by (induct as) auto
nipkow@17762
  1528
wenzelm@13142
  1529
lemma length_butlast [simp]: "length (butlast xs) = length xs - 1"
nipkow@13145
  1530
by (induct xs rule: rev_induct) auto
wenzelm@13114
  1531
wenzelm@13114
  1532
lemma butlast_append:
nipkow@24526
  1533
  "butlast (xs @ ys) = (if ys = [] then butlast xs else xs @ butlast ys)"
nipkow@24526
  1534
by (induct xs arbitrary: ys) auto
wenzelm@13114
  1535
wenzelm@13142
  1536
lemma append_butlast_last_id [simp]:
nipkow@13145
  1537
"xs \<noteq> [] ==> butlast xs @ [last xs] = xs"
nipkow@13145
  1538
by (induct xs) auto
wenzelm@13114
  1539
wenzelm@13142
  1540
lemma in_set_butlastD: "x : set (butlast xs) ==> x : set xs"
nipkow@13145
  1541
by (induct xs) (auto split: split_if_asm)
wenzelm@13114
  1542
wenzelm@13114
  1543
lemma in_set_butlast_appendI:
nipkow@13145
  1544
"x : set (butlast xs) | x : set (butlast ys) ==> x : set (butlast (xs @ ys))"
nipkow@13145
  1545
by (auto dest: in_set_butlastD simp add: butlast_append)
wenzelm@13114
  1546
nipkow@24526
  1547
lemma last_drop[simp]: "n < length xs \<Longrightarrow> last (drop n xs) = last xs"
nipkow@24526
  1548
apply (induct xs arbitrary: n)
nipkow@17501
  1549
 apply simp
nipkow@17501
  1550
apply (auto split:nat.split)
nipkow@17501
  1551
done
nipkow@17501
  1552
huffman@30128
  1553
lemma last_conv_nth: "xs\<noteq>[] \<Longrightarrow> last xs = xs!(length xs - 1)"
nipkow@17589
  1554
by(induct xs)(auto simp:neq_Nil_conv)
nipkow@17589
  1555
huffman@30128
  1556
lemma butlast_conv_take: "butlast xs = take (length xs - 1) xs"
huffman@26584
  1557
by (induct xs, simp, case_tac xs, simp_all)
huffman@26584
  1558
nipkow@31077
  1559
lemma last_list_update:
nipkow@31077
  1560
  "xs \<noteq> [] \<Longrightarrow> last(xs[k:=x]) = (if k = size xs - 1 then x else last xs)"
nipkow@31077
  1561
by (auto simp: last_conv_nth)
nipkow@31077
  1562
nipkow@31077
  1563
lemma butlast_list_update:
nipkow@31077
  1564
  "butlast(xs[k:=x]) =
nipkow@31077
  1565
 (if k = size xs - 1 then butlast xs else (butlast xs)[k:=x])"
nipkow@31077
  1566
apply(cases xs rule:rev_cases)
nipkow@31077
  1567
apply simp
nipkow@31077
  1568
apply(simp add:list_update_append split:nat.splits)
nipkow@31077
  1569
done
nipkow@31077
  1570
haftmann@36851
  1571
lemma last_map:
haftmann@36851
  1572
  "xs \<noteq> [] \<Longrightarrow> last (map f xs) = f (last xs)"
haftmann@36851
  1573
  by (cases xs rule: rev_cases) simp_all
haftmann@36851
  1574
haftmann@36851
  1575
lemma map_butlast:
haftmann@36851
  1576
  "map f (butlast xs) = butlast (map f xs)"
haftmann@36851
  1577
  by (induct xs) simp_all
haftmann@36851
  1578
haftmann@24796
  1579
nipkow@15392
  1580
subsubsection {* @{text take} and @{text drop} *}
wenzelm@13114
  1581
wenzelm@13142
  1582
lemma take_0 [simp]: "take 0 xs = []"
nipkow@13145
  1583
by (induct xs) auto
wenzelm@13114
  1584
wenzelm@13142
  1585
lemma drop_0 [simp]: "drop 0 xs = xs"
nipkow@13145
  1586
by (induct xs) auto
wenzelm@13114
  1587
wenzelm@13142
  1588
lemma take_Suc_Cons [simp]: "take (Suc n) (x # xs) = x # take n xs"
nipkow@13145
  1589
by simp
wenzelm@13114
  1590
wenzelm@13142
  1591
lemma drop_Suc_Cons [simp]: "drop (Suc n) (x # xs) = drop n xs"
nipkow@13145
  1592
by simp
wenzelm@13114
  1593
wenzelm@13142
  1594
declare take_Cons [simp del] and drop_Cons [simp del]
wenzelm@13114
  1595
huffman@30128
  1596
lemma take_1_Cons [simp]: "take 1 (x # xs) = [x]"
huffman@30128
  1597
  unfolding One_nat_def by simp
huffman@30128
  1598
huffman@30128
  1599
lemma drop_1_Cons [simp]: "drop 1 (x # xs) = xs"
huffman@30128
  1600
  unfolding One_nat_def by simp
huffman@30128
  1601
nipkow@15110
  1602
lemma take_Suc: "xs ~= [] ==> take (Suc n) xs = hd xs # take n (tl xs)"
nipkow@15110
  1603
by(clarsimp simp add:neq_Nil_conv)
nipkow@15110
  1604
nipkow@14187
  1605
lemma drop_Suc: "drop (Suc n) xs = drop n (tl xs)"
nipkow@14187
  1606
by(cases xs, simp_all)
nipkow@14187
  1607
huffman@26584
  1608
lemma take_tl: "take n (tl xs) = tl (take (Suc n) xs)"
huffman@26584
  1609
by (induct xs arbitrary: n) simp_all
huffman@26584
  1610
nipkow@24526
  1611
lemma drop_tl: "drop n (tl xs) = tl(drop n xs)"
nipkow@24526
  1612
by(induct xs arbitrary: n, simp_all add:drop_Cons drop_Suc split:nat.split)
nipkow@24526
  1613
huffman@26584
  1614
lemma tl_take: "tl (take n xs) = take (n - 1) (tl xs)"
huffman@26584
  1615
by (cases n, simp, cases xs, auto)
huffman@26584
  1616
huffman@26584
  1617
lemma tl_drop: "tl (drop n xs) = drop n (tl xs)"
huffman@26584
  1618
by (simp only: drop_tl)
huffman@26584
  1619
nipkow@24526
  1620
lemma nth_via_drop: "drop n xs = y#ys \<Longrightarrow> xs!n = y"
nipkow@24526
  1621
apply (induct xs arbitrary: n, simp)
nipkow@14187
  1622
apply(simp add:drop_Cons nth_Cons split:nat.splits)
nipkow@14187
  1623
done
nipkow@14187
  1624
nipkow@13913
  1625
lemma take_Suc_conv_app_nth:
nipkow@24526
  1626
  "i < length xs \<Longrightarrow> take (Suc i) xs = take i xs @ [xs!i]"
nipkow@24526
  1627
apply (induct xs arbitrary: i, simp)
paulson@14208
  1628
apply (case_tac i, auto)
nipkow@13913
  1629
done
nipkow@13913
  1630
mehta@14591
  1631
lemma drop_Suc_conv_tl:
nipkow@24526
  1632
  "i < length xs \<Longrightarrow> (xs!i) # (drop (Suc i) xs) = drop i xs"
nipkow@24526
  1633
apply (induct xs arbitrary: i, simp)
mehta@14591
  1634
apply (case_tac i, auto)
mehta@14591
  1635
done
mehta@14591
  1636
nipkow@24526
  1637
lemma length_take [simp]: "length (take n xs) = min (length xs) n"
nipkow@24526
  1638
by (induct n arbitrary: xs) (auto, case_tac xs, auto)
nipkow@24526
  1639
nipkow@24526
  1640
lemma length_drop [simp]: "length (drop n xs) = (length xs - n)"
nipkow@24526
  1641
by (induct n arbitrary: xs) (auto, case_tac xs, auto)
nipkow@24526
  1642
nipkow@24526
  1643
lemma take_all [simp]: "length xs <= n ==> take n xs = xs"
nipkow@24526
  1644
by (induct n arbitrary: xs) (auto, case_tac xs, auto)
nipkow@24526
  1645
nipkow@24526
  1646
lemma drop_all [simp]: "length xs <= n ==> drop n xs = []"
nipkow@24526
  1647
by (induct n arbitrary: xs) (auto, case_tac xs, auto)
wenzelm@13114
  1648
wenzelm@13142
  1649
lemma take_append [simp]:
nipkow@24526
  1650
  "take n (xs @ ys) = (take n xs @ take (n - length xs) ys)"
nipkow@24526
  1651
by (induct n arbitrary: xs) (auto, case_tac xs, auto)
wenzelm@13114
  1652
wenzelm@13142
  1653
lemma drop_append [simp]:
nipkow@24526
  1654
  "drop n (xs @ ys) = drop n xs @ drop (n - length xs) ys"
nipkow@24526
  1655
by (induct n arbitrary: xs) (auto, case_tac xs, auto)
nipkow@24526
  1656
nipkow@24526
  1657
lemma take_take [simp]: "take n (take m xs) = take (min n m) xs"
nipkow@24526
  1658
apply (induct m arbitrary: xs n, auto)
paulson@14208
  1659
apply (case_tac xs, auto)
nipkow@15236
  1660
apply (case_tac n, auto)
nipkow@13145
  1661
done
wenzelm@13114
  1662
nipkow@24526
  1663
lemma drop_drop [simp]: "drop n (drop m xs) = drop (n + m) xs"
nipkow@24526
  1664
apply (induct m arbitrary: xs, auto)
paulson@14208
  1665
apply (case_tac xs, auto)
nipkow@13145
  1666
done
wenzelm@13114
  1667
nipkow@24526
  1668
lemma take_drop: "take n (drop m xs) = drop m (take (n + m) xs)"
nipkow@24526
  1669
apply (induct m arbitrary: xs n, auto)
paulson@14208
  1670
apply (case_tac xs, auto)
nipkow@13145
  1671
done
wenzelm@13114
  1672
nipkow@24526
  1673
lemma drop_take: "drop n (take m xs) = take (m-n) (drop n xs)"
nipkow@24526
  1674
apply(induct xs arbitrary: m n)
nipkow@14802
  1675
 apply simp
nipkow@14802
  1676
apply(simp add: take_Cons drop_Cons split:nat.split)
nipkow@14802
  1677
done
nipkow@14802
  1678
nipkow@24526
  1679
lemma append_take_drop_id [simp]: "take n xs @ drop n xs = xs"
nipkow@24526
  1680
apply (induct n arbitrary: xs, auto)
paulson@14208
  1681
apply (case_tac xs, auto)
nipkow@13145
  1682
done
wenzelm@13114
  1683
nipkow@24526
  1684
lemma take_eq_Nil[simp]: "(take n xs = []) = (n = 0 \<or> xs = [])"
nipkow@24526
  1685
apply(induct xs arbitrary: n)
nipkow@15110
  1686
 apply simp
nipkow@15110
  1687
apply(simp add:take_Cons split:nat.split)
nipkow@15110
  1688
done
nipkow@15110
  1689
nipkow@24526
  1690
lemma drop_eq_Nil[simp]: "(drop n xs = []) = (length xs <= n)"
nipkow@24526
  1691
apply(induct xs arbitrary: n)
nipkow@15110
  1692
apply simp
nipkow@15110
  1693
apply(simp add:drop_Cons split:nat.split)
nipkow@15110
  1694
done
nipkow@15110
  1695
nipkow@24526
  1696
lemma take_map: "take n (map f xs) = map f (take n xs)"
nipkow@24526
  1697
apply (induct n arbitrary: xs, auto)
paulson@14208
  1698
apply (case_tac xs, auto)
nipkow@13145
  1699
done
wenzelm@13114
  1700
nipkow@24526
  1701
lemma drop_map: "drop n (map f xs) = map f (drop n xs)"
nipkow@24526
  1702
apply (induct n arbitrary: xs, auto)
paulson@14208
  1703
apply (case_tac xs, auto)
nipkow@13145
  1704
done
wenzelm@13114
  1705
nipkow@24526
  1706
lemma rev_take: "rev (take i xs) = drop (length xs - i) (rev xs)"
nipkow@24526
  1707
apply (induct xs arbitrary: i, auto)
paulson@14208
  1708
apply (case_tac i, auto)
nipkow@13145
  1709
done
wenzelm@13114
  1710
nipkow@24526
  1711
lemma rev_drop: "rev (drop i xs) = take (length xs - i) (rev xs)"
nipkow@24526
  1712
apply (induct xs arbitrary: i, auto)
paulson@14208
  1713
apply (case_tac i, auto)
nipkow@13145
  1714
done
wenzelm@13114
  1715
nipkow@24526
  1716
lemma nth_take [simp]: "i < n ==> (take n xs)!i = xs!i"
nipkow@24526
  1717
apply (induct xs arbitrary: i n, auto)
paulson@14208
  1718
apply (case_tac n, blast)
paulson@14208
  1719
apply (case_tac i, auto)
nipkow@13145
  1720
done
wenzelm@13114
  1721
wenzelm@13142
  1722
lemma nth_drop [simp]:
nipkow@24526
  1723
  "n + i <= length xs ==> (drop n xs)!i = xs!(n + i)"
nipkow@24526
  1724
apply (induct n arbitrary: xs i, auto)
paulson@14208
  1725
apply (case_tac xs, auto)
nipkow@13145
  1726
done
nipkow@3507
  1727
huffman@26584
  1728
lemma butlast_take:
huffman@30128
  1729
  "n <= length xs ==> butlast (take n xs) = take (n - 1) xs"
huffman@26584
  1730
by (simp add: butlast_conv_take min_max.inf_absorb1 min_max.inf_absorb2)
huffman@26584
  1731
huffman@26584
  1732
lemma butlast_drop: "butlast (drop n xs) = drop n (butlast xs)"
huffman@30128
  1733
by (simp add: butlast_conv_take drop_take add_ac)
huffman@26584
  1734
huffman@26584
  1735
lemma take_butlast: "n < length xs ==> take n (butlast xs) = take n xs"
huffman@26584
  1736
by (simp add: butlast_conv_take min_max.inf_absorb1)
huffman@26584
  1737
huffman@26584
  1738
lemma drop_butlast: "drop n (butlast xs) = butlast (drop n xs)"
huffman@30128
  1739
by (simp add: butlast_conv_take drop_take add_ac)
huffman@26584
  1740
nipkow@18423
  1741
lemma hd_drop_conv_nth: "\<lbrakk> xs \<noteq> []; n < length xs \<rbrakk> \<Longrightarrow> hd(drop n xs) = xs!n"
nipkow@18423
  1742
by(simp add: hd_conv_nth)
nipkow@18423
  1743
nipkow@35248
  1744
lemma set_take_subset_set_take:
nipkow@35248
  1745
  "m <= n \<Longrightarrow> set(take m xs) <= set(take n xs)"
nipkow@35248
  1746
by(induct xs arbitrary: m n)(auto simp:take_Cons split:nat.split)
nipkow@35248
  1747
nipkow@24526
  1748
lemma set_take_subset: "set(take n xs) \<subseteq> set xs"
nipkow@24526
  1749
by(induct xs arbitrary: n)(auto simp:take_Cons split:nat.split)
nipkow@24526
  1750
nipkow@24526
  1751
lemma set_drop_subset: "set(drop n xs) \<subseteq> set xs"
nipkow@24526
  1752
by(induct xs arbitrary: n)(auto simp:drop_Cons split:nat.split)
nipkow@14025
  1753
nipkow@35248
  1754
lemma set_drop_subset_set_drop:
nipkow@35248
  1755
  "m >= n \<Longrightarrow> set(drop m xs) <= set(drop n xs)"
nipkow@35248
  1756
apply(induct xs arbitrary: m n)
nipkow@35248
  1757
apply(auto simp:drop_Cons split:nat.split)
nipkow@35248
  1758
apply (metis set_drop_subset subset_iff)
nipkow@35248
  1759
done
nipkow@35248
  1760
nipkow@14187
  1761
lemma in_set_takeD: "x : set(take n xs) \<Longrightarrow> x : set xs"
nipkow@14187
  1762
using set_take_subset by fast
nipkow@14187
  1763
nipkow@14187
  1764
lemma in_set_dropD: "x : set(drop n xs) \<Longrightarrow> x : set xs"
nipkow@14187
  1765
using set_drop_subset by fast
nipkow@14187
  1766
wenzelm@13114
  1767
lemma append_eq_conv_conj:
nipkow@24526
  1768
  "(xs @ ys = zs) = (xs = take (length xs) zs \<and> ys = drop (length xs) zs)"
nipkow@24526
  1769
apply (induct xs arbitrary: zs, simp, clarsimp)
paulson@14208
  1770
apply (case_tac zs, auto)
nipkow@13145
  1771
done
wenzelm@13142
  1772
nipkow@24526
  1773
lemma take_add: 
nipkow@24526
  1774
  "i+j \<le> length(xs) \<Longrightarrow> take (i+j) xs = take i xs @ take j (drop i xs)"
nipkow@24526
  1775
apply (induct xs arbitrary: i, auto) 
nipkow@24526
  1776
apply (case_tac i, simp_all)
paulson@14050
  1777
done
paulson@14050
  1778
nipkow@14300
  1779
lemma append_eq_append_conv_if:
nipkow@24526
  1780
 "(xs\<^isub>1 @ xs\<^isub>2 = ys\<^isub>1 @ ys\<^isub>2) =
nipkow@14300
  1781
  (if size xs\<^isub>1 \<le> size ys\<^isub>1
nipkow@14300
  1782
   then xs\<^isub>1 = take (size xs\<^isub>1) ys\<^isub>1 \<and> xs\<^isub>2 = drop (size xs\<^isub>1) ys\<^isub>1 @ ys\<^isub>2
nipkow@14300
  1783
   else take (size ys\<^isub>1) xs\<^isub>1 = ys\<^isub>1 \<and> drop (size ys\<^isub>1) xs\<^isub>1 @ xs\<^isub>2 = ys\<^isub>2)"
nipkow@24526
  1784
apply(induct xs\<^isub>1 arbitrary: ys\<^isub>1)
nipkow@14300
  1785
 apply simp
nipkow@14300
  1786
apply(case_tac ys\<^isub>1)
nipkow@14300
  1787
apply simp_all
nipkow@14300
  1788
done
nipkow@14300
  1789
nipkow@15110
  1790
lemma take_hd_drop:
huffman@30079
  1791
  "n < length xs \<Longrightarrow> take n xs @ [hd (drop n xs)] = take (Suc n) xs"
nipkow@24526
  1792
apply(induct xs arbitrary: n)
nipkow@15110
  1793
apply simp
nipkow@15110
  1794
apply(simp add:drop_Cons split:nat.split)
nipkow@15110
  1795
done
nipkow@15110
  1796
nipkow@17501
  1797
lemma id_take_nth_drop:
nipkow@17501
  1798
 "i < length xs \<Longrightarrow> xs = take i xs @ xs!i # drop (Suc i) xs" 
nipkow@17501
  1799
proof -
nipkow@17501
  1800
  assume si: "i < length xs"
nipkow@17501
  1801
  hence "xs = take (Suc i) xs @ drop (Suc i) xs" by auto
nipkow@17501
  1802
  moreover
nipkow@17501
  1803
  from si have "take (Suc i) xs = take i xs @ [xs!i]"
nipkow@17501
  1804
    apply (rule_tac take_Suc_conv_app_nth) by arith
nipkow@17501
  1805
  ultimately show ?thesis by auto
nipkow@17501
  1806
qed
nipkow@17501
  1807
  
nipkow@17501
  1808
lemma upd_conv_take_nth_drop:
nipkow@17501
  1809
 "i < length xs \<Longrightarrow> xs[i:=a] = take i xs @ a # drop (Suc i) xs"
nipkow@17501
  1810
proof -
nipkow@17501
  1811
  assume i: "i < length xs"
nipkow@17501
  1812
  have "xs[i:=a] = (take i xs @ xs!i # drop (Suc i) xs)[i:=a]"
nipkow@17501
  1813
    by(rule arg_cong[OF id_take_nth_drop[OF i]])
nipkow@17501
  1814
  also have "\<dots> = take i xs @ a # drop (Suc i) xs"
nipkow@17501
  1815
    using i by (simp add: list_update_append)
nipkow@17501
  1816
  finally show ?thesis .
nipkow@17501
  1817
qed
nipkow@17501
  1818
haftmann@24796
  1819
lemma nth_drop':
haftmann@24796
  1820
  "i < length xs \<Longrightarrow> xs ! i # drop (Suc i) xs = drop i xs"
haftmann@24796
  1821
apply (induct i arbitrary: xs)
haftmann@24796
  1822
apply (simp add: neq_Nil_conv)
haftmann@24796
  1823
apply (erule exE)+
haftmann@24796
  1824
apply simp
haftmann@24796
  1825
apply (case_tac xs)
haftmann@24796
  1826
apply simp_all
haftmann@24796
  1827
done
haftmann@24796
  1828
wenzelm@13114
  1829
nipkow@15392
  1830
subsubsection {* @{text takeWhile} and @{text dropWhile} *}
wenzelm@13114
  1831
hoelzl@33639
  1832
lemma length_takeWhile_le: "length (takeWhile P xs) \<le> length xs"
hoelzl@33639
  1833
  by (induct xs) auto
hoelzl@33639
  1834
wenzelm@13142
  1835
lemma takeWhile_dropWhile_id [simp]: "takeWhile P xs @ dropWhile P xs = xs"
nipkow@13145
  1836
by (induct xs) auto
wenzelm@13114
  1837
wenzelm@13142
  1838
lemma takeWhile_append1 [simp]:
nipkow@13145
  1839
"[| x:set xs; ~P(x)|] ==> takeWhile P (xs @ ys) = takeWhile P xs"
nipkow@13145
  1840
by (induct xs) auto
wenzelm@13114
  1841
wenzelm@13142
  1842
lemma takeWhile_append2 [simp]:
nipkow@13145
  1843
"(!!x. x : set xs ==> P x) ==> takeWhile P (xs @ ys) = xs @ takeWhile P ys"
nipkow@13145
  1844
by (induct xs) auto
wenzelm@13114
  1845
wenzelm@13142
  1846
lemma takeWhile_tail: "\<not> P x ==> takeWhile P (xs @ (x#l)) = takeWhile P xs"
nipkow@13145
  1847
by (induct xs) auto
wenzelm@13114
  1848
hoelzl@33639
  1849
lemma takeWhile_nth: "j < length (takeWhile P xs) \<Longrightarrow> takeWhile P xs ! j = xs ! j"
hoelzl@33639
  1850
apply (subst (3) takeWhile_dropWhile_id[symmetric]) unfolding nth_append by auto
hoelzl@33639
  1851
hoelzl@33639
  1852
lemma dropWhile_nth: "j < length (dropWhile P xs) \<Longrightarrow> dropWhile P xs ! j = xs ! (j + length (takeWhile P xs))"
hoelzl@33639
  1853
apply (subst (3) takeWhile_dropWhile_id[symmetric]) unfolding nth_append by auto
hoelzl@33639
  1854
hoelzl@33639
  1855
lemma length_dropWhile_le: "length (dropWhile P xs) \<le> length xs"
hoelzl@33639
  1856
by (induct xs) auto
hoelzl@33639
  1857
wenzelm@13142
  1858
lemma dropWhile_append1 [simp]:
nipkow@13145
  1859
"[| x : set xs; ~P(x)|] ==> dropWhile P (xs @ ys) = (dropWhile P xs)@ys"
nipkow@13145
  1860
by (induct xs) auto
wenzelm@13114
  1861
wenzelm@13142
  1862
lemma dropWhile_append2 [simp]:
nipkow@13145
  1863
"(!!x. x:set xs ==> P(x)) ==> dropWhile P (xs @ ys) = dropWhile P ys"
nipkow@13145
  1864
by (induct xs) auto
wenzelm@13114
  1865
krauss@23971
  1866
lemma set_takeWhileD: "x : set (takeWhile P xs) ==> x : set xs \<and> P x"
nipkow@13145
  1867
by (induct xs) (auto split: split_if_asm)
wenzelm@13114
  1868
nipkow@13913
  1869
lemma takeWhile_eq_all_conv[simp]:
nipkow@13913
  1870
 "(takeWhile P xs = xs) = (\<forall>x \<in> set xs. P x)"
nipkow@13913
  1871
by(induct xs, auto)
nipkow@13913
  1872
nipkow@13913
  1873
lemma dropWhile_eq_Nil_conv[simp]:
nipkow@13913
  1874
 "(dropWhile P xs = []) = (\<forall>x \<in> set xs. P x)"
nipkow@13913
  1875
by(induct xs, auto)
nipkow@13913
  1876
nipkow@13913
  1877
lemma dropWhile_eq_Cons_conv:
nipkow@13913
  1878
 "(dropWhile P xs = y#ys) = (xs = takeWhile P xs @ y # ys & \<not> P y)"
nipkow@13913
  1879
by(induct xs, auto)
nipkow@13913
  1880
nipkow@31077
  1881
lemma distinct_takeWhile[simp]: "distinct xs ==> distinct (takeWhile P xs)"
nipkow@31077
  1882
by (induct xs) (auto dest: set_takeWhileD)
nipkow@31077
  1883
nipkow@31077
  1884
lemma distinct_dropWhile[simp]: "distinct xs ==> distinct (dropWhile P xs)"
nipkow@31077
  1885
by (induct xs) auto
nipkow@31077
  1886
hoelzl@33639
  1887
lemma takeWhile_map: "takeWhile P (map f xs) = map f (takeWhile (P \<circ> f) xs)"
hoelzl@33639
  1888
by (induct xs) auto
hoelzl@33639
  1889
hoelzl@33639
  1890
lemma dropWhile_map: "dropWhile P (map f xs) = map f (dropWhile (P \<circ> f) xs)"
hoelzl@33639
  1891
by (induct xs) auto
hoelzl@33639
  1892
hoelzl@33639
  1893
lemma takeWhile_eq_take: "takeWhile P xs = take (length (takeWhile P xs)) xs"
hoelzl@33639
  1894
by (induct xs) auto
hoelzl@33639
  1895
hoelzl@33639
  1896
lemma dropWhile_eq_drop: "dropWhile P xs = drop (length (takeWhile P xs)) xs"
hoelzl@33639
  1897
by (induct xs) auto
hoelzl@33639
  1898
hoelzl@33639
  1899
lemma hd_dropWhile:
hoelzl@33639
  1900
  "dropWhile P xs \<noteq> [] \<Longrightarrow> \<not> P (hd (dropWhile P xs))"
hoelzl@33639
  1901
using assms by (induct xs) auto
hoelzl@33639
  1902
hoelzl@33639
  1903
lemma takeWhile_eq_filter:
hoelzl@33639
  1904
  assumes "\<And> x. x \<in> set (dropWhile P xs) \<Longrightarrow> \<not> P x"
hoelzl@33639
  1905
  shows "takeWhile P xs = filter P xs"
hoelzl@33639
  1906
proof -
hoelzl@33639
  1907
  have A: "filter P xs = filter P (takeWhile P xs @ dropWhile P xs)"
hoelzl@33639
  1908
    by simp
hoelzl@33639
  1909
  have B: "filter P (dropWhile P xs) = []"
hoelzl@33639
  1910
    unfolding filter_empty_conv using assms by blast
hoelzl@33639
  1911
  have "filter P xs = takeWhile P xs"
hoelzl@33639
  1912
    unfolding A filter_append B
hoelzl@33639
  1913
    by (auto simp add: filter_id_conv dest: set_takeWhileD)
hoelzl@33639
  1914
  thus ?thesis ..
hoelzl@33639
  1915
qed
hoelzl@33639
  1916
hoelzl@33639
  1917
lemma takeWhile_eq_take_P_nth:
hoelzl@33639
  1918
  "\<lbrakk> \<And> i. \<lbrakk> i < n ; i < length xs \<rbrakk> \<Longrightarrow> P (xs ! i) ; n < length xs \<Longrightarrow> \<not> P (xs ! n) \<rbrakk> \<Longrightarrow>
hoelzl@33639
  1919
  takeWhile P xs = take n xs"
hoelzl@33639
  1920
proof (induct xs arbitrary: n)
hoelzl@33639
  1921
  case (Cons x xs)
hoelzl@33639
  1922
  thus ?case
hoelzl@33639
  1923
  proof (cases n)
hoelzl@33639
  1924
    case (Suc n') note this[simp]
hoelzl@33639
  1925
    have "P x" using Cons.prems(1)[of 0] by simp
hoelzl@33639
  1926
    moreover have "takeWhile P xs = take n' xs"
hoelzl@33639
  1927
    proof (rule Cons.hyps)
hoelzl@33639
  1928
      case goal1 thus "P (xs ! i)" using Cons.prems(1)[of "Suc i"] by simp
hoelzl@33639
  1929
    next case goal2 thus ?case using Cons by auto
hoelzl@33639
  1930
    qed
hoelzl@33639
  1931
    ultimately show ?thesis by simp
hoelzl@33639
  1932
   qed simp
hoelzl@33639
  1933
qed simp
hoelzl@33639
  1934
hoelzl@33639
  1935
lemma nth_length_takeWhile:
hoelzl@33639
  1936
  "length (takeWhile P xs) < length xs \<Longrightarrow> \<not> P (xs ! length (takeWhile P xs))"
hoelzl@33639
  1937
by (induct xs) auto
hoelzl@33639
  1938
hoelzl@33639
  1939
lemma length_takeWhile_less_P_nth:
hoelzl@33639
  1940
  assumes all: "\<And> i. i < j \<Longrightarrow> P (xs ! i)" and "j \<le> length xs"
hoelzl@33639
  1941
  shows "j \<le> length (takeWhile P xs)"
hoelzl@33639
  1942
proof (rule classical)
hoelzl@33639
  1943
  assume "\<not> ?thesis"
hoelzl@33639
  1944
  hence "length (takeWhile P xs) < length xs" using assms by simp
hoelzl@33639
  1945
  thus ?thesis using all `\<not> ?thesis` nth_length_takeWhile[of P xs] by auto
hoelzl@33639
  1946
qed
nipkow@31077
  1947
nipkow@17501
  1948
text{* The following two lemmmas could be generalized to an arbitrary
nipkow@17501
  1949
property. *}
nipkow@17501
  1950
nipkow@17501
  1951
lemma takeWhile_neq_rev: "\<lbrakk>distinct xs; x \<in> set xs\<rbrakk> \<Longrightarrow>
nipkow@17501
  1952
 takeWhile (\<lambda>y. y \<noteq> x) (rev xs) = rev (tl (dropWhile (\<lambda>y. y \<noteq> x) xs))"
nipkow@17501
  1953
by(induct xs) (auto simp: takeWhile_tail[where l="[]"])
nipkow@17501
  1954
nipkow@17501
  1955
lemma dropWhile_neq_rev: "\<lbrakk>distinct xs; x \<in> set xs\<rbrakk> \<Longrightarrow>
nipkow@17501
  1956
  dropWhile (\<lambda>y. y \<noteq> x) (rev xs) = x # rev (takeWhile (\<lambda>y. y \<noteq> x) xs)"
nipkow@17501
  1957
apply(induct xs)
nipkow@17501
  1958
 apply simp
nipkow@17501
  1959
apply auto
nipkow@17501
  1960
apply(subst dropWhile_append2)
nipkow@17501
  1961
apply auto
nipkow@17501
  1962
done
nipkow@17501
  1963
nipkow@18423
  1964
lemma takeWhile_not_last:
nipkow@18423
  1965
 "\<lbrakk> xs \<noteq> []; distinct xs\<rbrakk> \<Longrightarrow> takeWhile (\<lambda>y. y \<noteq> last xs) xs = butlast xs"
nipkow@18423
  1966
apply(induct xs)
nipkow@18423
  1967
 apply simp
nipkow@18423
  1968
apply(case_tac xs)
nipkow@18423
  1969
apply(auto)
nipkow@18423
  1970
done
nipkow@18423
  1971
krauss@19770
  1972
lemma takeWhile_cong [fundef_cong, recdef_cong]:
krauss@18336
  1973
  "[| l = k; !!x. x : set l ==> P x = Q x |] 
krauss@18336
  1974
  ==> takeWhile P l = takeWhile Q k"
nipkow@24349
  1975
by (induct k arbitrary: l) (simp_all)
krauss@18336
  1976
krauss@19770
  1977
lemma dropWhile_cong [fundef_cong, recdef_cong]:
krauss@18336
  1978
  "[| l = k; !!x. x : set l ==> P x = Q x |] 
krauss@18336
  1979
  ==> dropWhile P l = dropWhile Q k"
nipkow@24349
  1980
by (induct k arbitrary: l, simp_all)
krauss@18336
  1981
wenzelm@13114
  1982
nipkow@15392
  1983
subsubsection {* @{text zip} *}
wenzelm@13114
  1984
wenzelm@13142
  1985
lemma zip_Nil [simp]: "zip [] ys = []"
nipkow@13145
  1986
by (induct ys) auto
wenzelm@13114
  1987
wenzelm@13142
  1988
lemma zip_Cons_Cons [simp]: "zip (x # xs) (y # ys) = (x, y) # zip xs ys"
nipkow@13145
  1989
by simp
wenzelm@13114
  1990
wenzelm@13142
  1991
declare zip_Cons [simp del]
wenzelm@13114
  1992
haftmann@36198
  1993
lemma [code]:
haftmann@36198
  1994
  "zip [] ys = []"
haftmann@36198
  1995
  "zip xs [] = []"
haftmann@36198
  1996
  "zip (x # xs) (y # ys) = (x, y) # zip xs ys"
haftmann@36198
  1997
  by (fact zip_Nil zip.simps(1) zip_Cons_Cons)+
haftmann@36198
  1998
nipkow@15281
  1999
lemma zip_Cons1:
nipkow@15281
  2000
 "zip (x#xs) ys = (case ys of [] \<Rightarrow> [] | y#ys \<Rightarrow> (x,y)#zip xs ys)"
nipkow@15281
  2001
by(auto split:list.split)
nipkow@15281
  2002
wenzelm@13142
  2003
lemma length_zip [simp]:
krauss@22493
  2004
"length (zip xs ys) = min (length xs) (length ys)"
krauss@22493
  2005
by (induct xs ys rule:list_induct2') auto
wenzelm@13114
  2006
haftmann@34978
  2007
lemma zip_obtain_same_length:
haftmann@34978
  2008
  assumes "\<And>zs ws n. length zs = length ws \<Longrightarrow> n = min (length xs) (length ys)
haftmann@34978
  2009
    \<Longrightarrow> zs = take n xs \<Longrightarrow> ws = take n ys \<Longrightarrow> P (zip zs ws)"
haftmann@34978
  2010
  shows "P (zip xs ys)"
haftmann@34978
  2011
proof -
haftmann@34978
  2012
  let ?n = "min (length xs) (length ys)"
haftmann@34978
  2013
  have "P (zip (take ?n xs) (take ?n ys))"
haftmann@34978
  2014
    by (rule assms) simp_all
haftmann@34978
  2015
  moreover have "zip xs ys = zip (take ?n xs) (take ?n ys)"
haftmann@34978
  2016
  proof (induct xs arbitrary: ys)
haftmann@34978
  2017
    case Nil then show ?case by simp
haftmann@34978
  2018
  next
haftmann@34978
  2019
    case (Cons x xs) then show ?case by (cases ys) simp_all
haftmann@34978
  2020
  qed
haftmann@34978
  2021
  ultimately show ?thesis by simp
haftmann@34978
  2022
qed
haftmann@34978
  2023
wenzelm@13114
  2024
lemma zip_append1:
krauss@22493
  2025
"zip (xs @ ys) zs =
nipkow@13145
  2026
zip xs (take (length xs) zs) @ zip ys (drop (length xs) zs)"
krauss@22493
  2027
by (induct xs zs rule:list_induct2') auto
wenzelm@13114
  2028
wenzelm@13114
  2029
lemma zip_append2:
krauss@22493
  2030
"zip xs (ys @ zs) =
nipkow@13145
  2031
zip (take (length ys) xs) ys @ zip (drop (length ys) xs) zs"
krauss@22493
  2032
by (induct xs ys rule:list_induct2') auto
wenzelm@13114
  2033
wenzelm@13142
  2034
lemma zip_append [simp]:
wenzelm@13142
  2035
 "[| length xs = length us; length ys = length vs |] ==>
nipkow@13145
  2036
zip (xs@ys) (us@vs) = zip xs us @ zip ys vs"
nipkow@13145
  2037
by (simp add: zip_append1)
wenzelm@13114
  2038
wenzelm@13114
  2039
lemma zip_rev:
nipkow@14247
  2040
"length xs = length ys ==> zip (rev xs) (rev ys) = rev (zip xs ys)"
nipkow@14247
  2041
by (induct rule:list_induct2, simp_all)
wenzelm@13114
  2042
hoelzl@33639
  2043
lemma zip_map_map:
hoelzl@33639
  2044
  "zip (map f xs) (map g ys) = map (\<lambda> (x, y). (f x, g y)) (zip xs ys)"
hoelzl@33639
  2045
proof (induct xs arbitrary: ys)
hoelzl@33639
  2046
  case (Cons x xs) note Cons_x_xs = Cons.hyps
hoelzl@33639
  2047
  show ?case
hoelzl@33639
  2048
  proof (cases ys)
hoelzl@33639
  2049
    case (Cons y ys')
hoelzl@33639
  2050
    show ?thesis unfolding Cons using Cons_x_xs by simp
hoelzl@33639
  2051
  qed simp
hoelzl@33639
  2052
qed simp
hoelzl@33639
  2053
hoelzl@33639
  2054
lemma zip_map1:
hoelzl@33639
  2055
  "zip (map f xs) ys = map (\<lambda>(x, y). (f x, y)) (zip xs ys)"
hoelzl@33639
  2056
using zip_map_map[of f xs "\<lambda>x. x" ys] by simp
hoelzl@33639
  2057
hoelzl@33639
  2058
lemma zip_map2:
hoelzl@33639
  2059
  "zip xs (map f ys) = map (\<lambda>(x, y). (x, f y)) (zip xs ys)"
hoelzl@33639
  2060
using zip_map_map[of "\<lambda>x. x" xs f ys] by simp
hoelzl@33639
  2061
nipkow@23096
  2062
lemma map_zip_map:
hoelzl@33639
  2063
  "map f (zip (map g xs) ys) = map (%(x,y). f(g x, y)) (zip xs ys)"
hoelzl@33639
  2064
unfolding zip_map1 by auto
nipkow@23096
  2065
nipkow@23096
  2066
lemma map_zip_map2:
hoelzl@33639
  2067
  "map f (zip xs (map g ys)) = map (%(x,y). f(x, g y)) (zip xs ys)"
hoelzl@33639
  2068
unfolding zip_map2 by auto
nipkow@23096
  2069
nipkow@31080
  2070
text{* Courtesy of Andreas Lochbihler: *}
nipkow@31080
  2071
lemma zip_same_conv_map: "zip xs xs = map (\<lambda>x. (x, x)) xs"
nipkow@31080
  2072
by(induct xs) auto
nipkow@31080
  2073
wenzelm@13142
  2074
lemma nth_zip [simp]:
nipkow@24526
  2075
"[| i < length xs; i < length ys|] ==> (zip xs ys)!i = (xs!i, ys!i)"
nipkow@24526
  2076
apply (induct ys arbitrary: i xs, simp)
nipkow@13145
  2077
apply (case_tac xs)
nipkow@13145
  2078
 apply (simp_all add: nth.simps split: nat.split)
nipkow@13145
  2079
done
wenzelm@13114
  2080
wenzelm@13114
  2081
lemma set_zip:
nipkow@13145
  2082
"set (zip xs ys) = {(xs!i, ys!i) | i. i < min (length xs) (length ys)}"
nipkow@31080
  2083
by(simp add: set_conv_nth cong: rev_conj_cong)
wenzelm@13114
  2084
hoelzl@33639
  2085
lemma zip_same: "((a,b) \<in> set (zip xs xs)) = (a \<in> set xs \<and> a = b)"
hoelzl@33639
  2086
by(induct xs) auto
hoelzl@33639
  2087
wenzelm@13114
  2088
lemma zip_update:
nipkow@31080
  2089
  "zip (xs[i:=x]) (ys[i:=y]) = (zip xs ys)[i:=(x,y)]"
nipkow@31080
  2090
by(rule sym, simp add: update_zip)
wenzelm@13114
  2091
wenzelm@13142
  2092
lemma zip_replicate [simp]:
nipkow@24526
  2093
  "zip (replicate i x) (replicate j y) = replicate (min i j) (x,y)"
nipkow@24526
  2094
apply (induct i arbitrary: j, auto)
paulson@14208
  2095
apply (case_tac j, auto)
nipkow@13145
  2096
done
wenzelm@13114
  2097
nipkow@19487
  2098
lemma take_zip:
nipkow@24526
  2099
  "take n (zip xs ys) = zip (take n xs) (take n ys)"
nipkow@24526
  2100
apply (induct n arbitrary: xs ys)
nipkow@19487
  2101
 apply simp
nipkow@19487
  2102
apply (case_tac xs, simp)
nipkow@19487
  2103
apply (case_tac ys, simp_all)
nipkow@19487
  2104
done
nipkow@19487
  2105
nipkow@19487
  2106
lemma drop_zip:
nipkow@24526
  2107
  "drop n (zip xs ys) = zip (drop n xs) (drop n ys)"
nipkow@24526
  2108
apply (induct n arbitrary: xs ys)
nipkow@19487
  2109
 apply simp
nipkow@19487
  2110
apply (case_tac xs, simp)
nipkow@19487
  2111
apply (case_tac ys, simp_all)
nipkow@19487
  2112
done
nipkow@19487
  2113
hoelzl@33639
  2114
lemma zip_takeWhile_fst: "zip (takeWhile P xs) ys = takeWhile (P \<circ> fst) (zip xs ys)"
hoelzl@33639
  2115
proof (induct xs arbitrary: ys)
hoelzl@33639
  2116
  case (Cons x xs) thus ?case by (cases ys) auto
hoelzl@33639
  2117
qed simp
hoelzl@33639
  2118
hoelzl@33639
  2119
lemma zip_takeWhile_snd: "zip xs (takeWhile P ys) = takeWhile (P \<circ> snd) (zip xs ys)"
hoelzl@33639
  2120
proof (induct xs arbitrary: ys)
hoelzl@33639
  2121
  case (Cons x xs) thus ?case by (cases ys) auto
hoelzl@33639
  2122
qed simp
hoelzl@33639
  2123
krauss@22493
  2124
lemma set_zip_leftD:
krauss@22493
  2125
  "(x,y)\<in> set (zip xs ys) \<Longrightarrow> x \<in> set xs"
krauss@22493
  2126
by (induct xs ys rule:list_induct2') auto
krauss@22493
  2127
krauss@22493
  2128
lemma set_zip_rightD:
krauss@22493
  2129
  "(x,y)\<in> set (zip xs ys) \<Longrightarrow> y \<in> set ys"
krauss@22493
  2130
by (induct xs ys rule:list_induct2') auto
wenzelm@13142
  2131
nipkow@23983
  2132
lemma in_set_zipE:
nipkow@23983
  2133
  "(x,y) : set(zip xs ys) \<Longrightarrow> (\<lbrakk> x : set xs; y : set ys \<rbrakk> \<Longrightarrow> R) \<Longrightarrow> R"
nipkow@23983
  2134
by(blast dest: set_zip_leftD set_zip_rightD)
nipkow@23983
  2135
haftmann@29829
  2136
lemma zip_map_fst_snd:
haftmann@29829
  2137
  "zip (map fst zs) (map snd zs) = zs"
haftmann@29829
  2138
  by (induct zs) simp_all
haftmann@29829
  2139
haftmann@29829
  2140
lemma zip_eq_conv:
haftmann@29829
  2141
  "length xs = length ys \<Longrightarrow> zip xs ys = zs \<longleftrightarrow> map fst zs = xs \<and> map snd zs = ys"
haftmann@29829
  2142
  by (auto simp add: zip_map_fst_snd)
haftmann@29829
  2143
wenzelm@35115
  2144
nipkow@15392
  2145
subsubsection {* @{text list_all2} *}
wenzelm@13114
  2146
kleing@14316
  2147
lemma list_all2_lengthD [intro?]: 
kleing@14316
  2148
  "list_all2 P xs ys ==> length xs = length ys"
nipkow@24349
  2149
by (simp add: list_all2_def)
haftmann@19607
  2150
haftmann@19787
  2151
lemma list_all2_Nil [iff, code]: "list_all2 P [] ys = (ys = [])"
nipkow@24349
  2152
by (simp add: list_all2_def)
haftmann@19607
  2153
haftmann@19787
  2154
lemma list_all2_Nil2 [iff, code]: "list_all2 P xs [] = (xs = [])"
nipkow@24349
  2155
by (simp add: list_all2_def)
haftmann@19607
  2156
haftmann@19607
  2157
lemma list_all2_Cons [iff, code]:
haftmann@19607
  2158
  "list_all2 P (x # xs) (y # ys) = (P x y \<and> list_all2 P xs ys)"
nipkow@24349
  2159
by (auto simp add: list_all2_def)
wenzelm@13114
  2160
wenzelm@13114
  2161
lemma list_all2_Cons1:
nipkow@13145
  2162
"list_all2 P (x # xs) ys = (\<exists>z zs. ys = z # zs \<and> P x z \<and> list_all2 P xs zs)"
nipkow@13145
  2163
by (cases ys) auto
wenzelm@13114
  2164
wenzelm@13114
  2165
lemma list_all2_Cons2:
nipkow@13145
  2166
"list_all2 P xs (y # ys) = (\<exists>z zs. xs = z # zs \<and> P z y \<and> list_all2 P zs ys)"
nipkow@13145
  2167
by (cases xs) auto
wenzelm@13114
  2168
wenzelm@13142
  2169
lemma list_all2_rev [iff]:
nipkow@13145
  2170
"list_all2 P (rev xs) (rev ys) = list_all2 P xs ys"
nipkow@13145
  2171
by (simp add: list_all2_def zip_rev cong: conj_cong)
wenzelm@13114
  2172
kleing@13863
  2173
lemma list_all2_rev1:
kleing@13863
  2174
"list_all2 P (rev xs) ys = list_all2 P xs (rev ys)"
kleing@13863
  2175
by (subst list_all2_rev [symmetric]) simp
kleing@13863
  2176
wenzelm@13114
  2177
lemma list_all2_append1:
nipkow@13145
  2178
"list_all2 P (xs @ ys) zs =
nipkow@13145
  2179
(EX us vs. zs = us @ vs \<and> length us = length xs \<and> length vs = length ys \<and>
nipkow@13145
  2180
list_all2 P xs us \<and> list_all2 P ys vs)"
nipkow@13145
  2181
apply (simp add: list_all2_def zip_append1)
nipkow@13145
  2182
apply (rule iffI)
nipkow@13145
  2183
 apply (rule_tac x = "take (length xs) zs" in exI)
nipkow@13145
  2184
 apply (rule_tac x = "drop (length xs) zs" in exI)
paulson@14208
  2185
 apply (force split: nat_diff_split simp add: min_def, clarify)
nipkow@13145
  2186
apply (simp add: ball_Un)
nipkow@13145
  2187
done
wenzelm@13114
  2188
wenzelm@13114
  2189
lemma list_all2_append2:
nipkow@13145
  2190
"list_all2 P xs (ys @ zs) =
nipkow@13145
  2191
(EX us vs. xs = us @ vs \<and> length us = length ys \<and> length vs = length zs \<and>
nipkow@13145
  2192
list_all2 P us ys \<and> list_all2 P vs zs)"
nipkow@13145
  2193
apply (simp add: list_all2_def zip_append2)
nipkow@13145
  2194
apply (rule iffI)
nipkow@13145
  2195
 apply (rule_tac x = "take (length ys) xs" in exI)
nipkow@13145
  2196
 apply (rule_tac x = "drop (length ys) xs" in exI)
paulson@14208
  2197
 apply (force split: nat_diff_split simp add: min_def, clarify)
nipkow@13145
  2198
apply (simp add: ball_Un)
nipkow@13145
  2199
done
wenzelm@13114
  2200
kleing@13863
  2201
lemma list_all2_append:
nipkow@14247
  2202
  "length xs = length ys \<Longrightarrow>
nipkow@14247
  2203
  list_all2 P (xs@us) (ys@vs) = (list_all2 P xs ys \<and> list_all2 P us vs)"
nipkow@14247
  2204
by (induct rule:list_induct2, simp_all)
kleing@13863
  2205
kleing@13863
  2206
lemma list_all2_appendI [intro?, trans]:
kleing@13863
  2207
  "\<lbrakk> list_all2 P a b; list_all2 P c d \<rbrakk> \<Longrightarrow> list_all2 P (a@c) (b@d)"
nipkow@24349
  2208
by (simp add: list_all2_append list_all2_lengthD)
kleing@13863
  2209
wenzelm@13114
  2210
lemma list_all2_conv_all_nth:
nipkow@13145
  2211
"list_all2 P xs ys =
nipkow@13145
  2212
(length xs = length ys \<and> (\<forall>i < length xs. P (xs!i) (ys!i)))"
nipkow@13145
  2213
by (force simp add: list_all2_def set_zip)
wenzelm@13114
  2214
berghofe@13883
  2215
lemma list_all2_trans:
berghofe@13883
  2216
  assumes tr: "!!a b c. P1 a b ==> P2 b c ==> P3 a c"
berghofe@13883
  2217
  shows "!!bs cs. list_all2 P1 as bs ==> list_all2 P2 bs cs ==> list_all2 P3 as cs"
berghofe@13883
  2218
        (is "!!bs cs. PROP ?Q as bs cs")
berghofe@13883
  2219
proof (induct as)
berghofe@13883
  2220
  fix x xs bs assume I1: "!!bs cs. PROP ?Q xs bs cs"
berghofe@13883
  2221
  show "!!cs. PROP ?Q (x # xs) bs cs"
berghofe@13883
  2222
  proof (induct bs)
berghofe@13883
  2223
    fix y ys cs assume I2: "!!cs. PROP ?Q (x # xs) ys cs"
berghofe@13883
  2224
    show "PROP ?Q (x # xs) (y # ys) cs"
berghofe@13883
  2225
      by (induct cs) (auto intro: tr I1 I2)
berghofe@13883
  2226
  qed simp
berghofe@13883
  2227
qed simp
berghofe@13883
  2228
kleing@13863
  2229
lemma list_all2_all_nthI [intro?]:
kleing@13863
  2230
  "length a = length b \<Longrightarrow> (\<And>n. n < length a \<Longrightarrow> P (a!n) (b!n)) \<Longrightarrow> list_all2 P a b"
nipkow@24349
  2231
by (simp add: list_all2_conv_all_nth)
kleing@13863
  2232
paulson@14395
  2233
lemma list_all2I:
paulson@14395
  2234
  "\<forall>x \<in> set (zip a b). split P x \<Longrightarrow> length a = length b \<Longrightarrow> list_all2 P a b"
nipkow@24349
  2235
by (simp add: list_all2_def)
paulson@14395
  2236
kleing@14328
  2237
lemma list_all2_nthD:
kleing@13863
  2238
  "\<lbrakk> list_all2 P xs ys; p < size xs \<rbrakk> \<Longrightarrow> P (xs!p) (ys!p)"
nipkow@24349
  2239
by (simp add: list_all2_conv_all_nth)
kleing@13863
  2240
nipkow@14302
  2241
lemma list_all2_nthD2:
nipkow@14302
  2242
  "\<lbrakk>list_all2 P xs ys; p < size ys\<rbrakk> \<Longrightarrow> P (xs!p) (ys!p)"
nipkow@24349
  2243
by (frule list_all2_lengthD) (auto intro: list_all2_nthD)
nipkow@14302
  2244
kleing@13863
  2245
lemma list_all2_map1: 
kleing@13863
  2246
  "list_all2 P (map f as) bs = list_all2 (\<lambda>x y. P (f x) y) as bs"
nipkow@24349
  2247
by (simp add: list_all2_conv_all_nth)
kleing@13863
  2248
kleing@13863
  2249
lemma list_all2_map2: 
kleing@13863
  2250
  "list_all2 P as (map f bs) = list_all2 (\<lambda>x y. P x (f y)) as bs"
nipkow@24349
  2251
by (auto simp add: list_all2_conv_all_nth)
kleing@13863
  2252
kleing@14316
  2253
lemma list_all2_refl [intro?]:
kleing@13863
  2254
  "(\<And>x. P x x) \<Longrightarrow> list_all2 P xs xs"
nipkow@24349
  2255
by (simp add: list_all2_conv_all_nth)
kleing@13863
  2256
kleing@13863
  2257
lemma list_all2_update_cong:
kleing@13863
  2258
  "\<lbrakk> i<size xs; list_all2 P xs ys; P x y \<rbrakk> \<Longrightarrow> list_all2 P (xs[i:=x]) (ys[i:=y])"
nipkow@24349
  2259
by (simp add: list_all2_conv_all_nth nth_list_update)
kleing@13863
  2260
kleing@13863
  2261
lemma list_all2_update_cong2:
kleing@13863
  2262
  "\<lbrakk>list_all2 P xs ys; P x y; i < length ys\<rbrakk> \<Longrightarrow> list_all2 P (xs[i:=x]) (ys[i:=y])"
nipkow@24349
  2263
by (simp add: list_all2_lengthD list_all2_update_cong)
kleing@13863
  2264
nipkow@14302
  2265
lemma list_all2_takeI [simp,intro?]:
nipkow@24526
  2266
  "list_all2 P xs ys \<Longrightarrow> list_all2 P (take n xs) (take n ys)"
nipkow@24526
  2267
apply (induct xs arbitrary: n ys)
nipkow@24526
  2268
 apply simp
nipkow@24526
  2269
apply (clarsimp simp add: list_all2_Cons1)
nipkow@24526
  2270
apply (case_tac n)
nipkow@24526
  2271
apply auto
nipkow@24526
  2272
done
nipkow@14302
  2273
nipkow@14302
  2274
lemma list_all2_dropI [simp,intro?]:
nipkow@24526
  2275
  "list_all2 P as bs \<Longrightarrow> list_all2 P (drop n as) (drop n bs)"
nipkow@24526
  2276
apply (induct as arbitrary: n bs, simp)
nipkow@24526
  2277
apply (clarsimp simp add: list_all2_Cons1)
nipkow@24526
  2278
apply (case_tac n, simp, simp)
nipkow@24526
  2279
done
kleing@13863
  2280
kleing@14327
  2281
lemma list_all2_mono [intro?]:
nipkow@24526
  2282
  "list_all2 P xs ys \<Longrightarrow> (\<And>xs ys. P xs ys \<Longrightarrow> Q xs ys) \<Longrightarrow> list_all2 Q xs ys"
nipkow@24526
  2283
apply (induct xs arbitrary: ys, simp)
nipkow@24526
  2284
apply (case_tac ys, auto)
nipkow@24526
  2285
done
kleing@13863
  2286
haftmann@22551
  2287
lemma list_all2_eq:
haftmann@22551
  2288
  "xs = ys \<longleftrightarrow> list_all2 (op =) xs ys"
nipkow@24349
  2289
by (induct xs ys rule: list_induct2') auto
haftmann@22551
  2290
wenzelm@13142
  2291
nipkow@15392
  2292
subsubsection {* @{text foldl} and @{text foldr} *}
wenzelm@13142
  2293
wenzelm@13142
  2294
lemma foldl_append [simp]:
nipkow@24526
  2295
  "foldl f a (xs @ ys) = foldl f (foldl f a xs) ys"
nipkow@24526
  2296
by (induct xs arbitrary: a) auto
wenzelm@13142
  2297
nipkow@14402
  2298
lemma foldr_append[simp]: "foldr f (xs @ ys) a = foldr f xs (foldr f ys a)"
nipkow@14402
  2299
by (induct xs) auto
nipkow@14402
  2300
nipkow@23096
  2301
lemma foldr_map: "foldr g (map f xs) a = foldr (g o f) xs a"
nipkow@23096
  2302
by(induct xs) simp_all
nipkow@23096
  2303
nipkow@24449
  2304
text{* For efficient code generation: avoid intermediate list. *}
haftmann@31998
  2305
lemma foldl_map[code_unfold]:
nipkow@24449
  2306
  "foldl g a (map f xs) = foldl (%a x. g a (f x)) a xs"
nipkow@23096
  2307
by(induct xs arbitrary:a) simp_all
nipkow@23096
  2308
haftmann@34978
  2309
lemma foldl_apply:
haftmann@34978
  2310
  assumes "\<And>x. x \<in> set xs \<Longrightarrow> f x \<circ> h = h \<circ> g x"
haftmann@34978
  2311
  shows "foldl (\<lambda>s x. f x s) (h s) xs = h (foldl (\<lambda>s x. g x s) s xs)"
nipkow@39302
  2312
  by (rule sym, insert assms, induct xs arbitrary: s) (simp_all add: fun_eq_iff)
haftmann@31930
  2313
krauss@19770
  2314
lemma foldl_cong [fundef_cong, recdef_cong]:
krauss@18336
  2315
  "[| a = b; l = k; !!a x. x : set l ==> f a x = g a x |] 
krauss@18336
  2316
  ==> foldl f a l = foldl g b k"
nipkow@24349
  2317
by (induct k arbitrary: a b l) simp_all
krauss@18336
  2318
krauss@19770
  2319
lemma foldr_cong [fundef_cong, recdef_cong]:
krauss@18336
  2320
  "[| a = b; l = k; !!a x. x : set l ==> f x a = g x a |] 
krauss@18336
  2321
  ==> foldr f l a = foldr g k b"
nipkow@24349
  2322
by (induct k arbitrary: a b l) simp_all
krauss@18336
  2323
haftmann@35195
  2324
lemma foldl_fun_comm:
haftmann@35195
  2325
  assumes "\<And>x y s. f (f s x) y = f (f s y) x"
haftmann@35195
  2326
  shows "f (foldl f s xs) x = foldl f (f s x) xs"
haftmann@35195
  2327
  by (induct xs arbitrary: s)
haftmann@35195
  2328
    (simp_all add: assms)
haftmann@35195
  2329
nipkow@24449
  2330
lemma (in semigroup_add) foldl_assoc:
haftmann@25062
  2331
shows "foldl op+ (x+y) zs = x + (foldl op+ y zs)"
nipkow@24449
  2332
by (induct zs arbitrary: y) (simp_all add:add_assoc)
nipkow@24449
  2333
nipkow@24449
  2334
lemma (in monoid_add) foldl_absorb0:
haftmann@25062
  2335
shows "x + (foldl op+ 0 zs) = foldl op+ x zs"
nipkow@24449
  2336
by (induct zs) (simp_all add:foldl_assoc)
nipkow@24449
  2337
haftmann@35195
  2338
lemma foldl_rev:
haftmann@35195
  2339
  assumes "\<And>x y s. f (f s x) y = f (f s y) x"
haftmann@35195
  2340
  shows "foldl f s (rev xs) = foldl f s xs"
haftmann@35195
  2341
proof (induct xs arbitrary: s)
haftmann@35195
  2342
  case Nil then show ?case by simp
haftmann@35195
  2343
next
haftmann@35195
  2344
  case (Cons x xs) with assms show ?case by (simp add: foldl_fun_comm)
haftmann@35195
  2345
qed
haftmann@35195
  2346
haftmann@37605
  2347
lemma rev_foldl_cons [code]:
haftmann@37605
  2348
  "rev xs = foldl (\<lambda>xs x. x # xs) [] xs"
haftmann@37605
  2349
proof (induct xs)
haftmann@37605
  2350
  case Nil then show ?case by simp
haftmann@37605
  2351
next
haftmann@37605
  2352
  case Cons
haftmann@37605
  2353
  {
haftmann@37605
  2354
    fix x xs ys
haftmann@37605
  2355
    have "foldl (\<lambda>xs x. x # xs) ys xs @ [x]
haftmann@37605
  2356
      = foldl (\<lambda>xs x. x # xs) (ys @ [x]) xs"
haftmann@37605
  2357
    by (induct xs arbitrary: ys) auto
haftmann@37605
  2358
  }
haftmann@37605
  2359
  note aux = this
haftmann@37605
  2360
  show ?case by (induct xs) (auto simp add: Cons aux)
haftmann@37605
  2361
qed
haftmann@37605
  2362
nipkow@24449
  2363
haftmann@39774
  2364
text{* The ``Third Duality Theorem'' in Bird \& Wadler: *}
haftmann@39774
  2365
haftmann@39774
  2366
lemma foldr_foldl:
haftmann@39774
  2367
  "foldr f xs a = foldl (%x y. f y x) a (rev xs)"
haftmann@39774
  2368
  by (induct xs) auto
haftmann@39774
  2369
haftmann@39774
  2370
lemma foldl_foldr:
haftmann@39774
  2371
  "foldl f a xs = foldr (%x y. f y x) (rev xs) a"
haftmann@39774
  2372
  by (simp add: foldr_foldl [of "%x y. f y x" "rev xs"])
haftmann@39774
  2373
haftmann@39774
  2374
nipkow@23096
  2375
text{* The ``First Duality Theorem'' in Bird \& Wadler: *}
nipkow@23096
  2376
haftmann@39774
  2377
lemma (in monoid_add) foldl_foldr1_lemma:
haftmann@39774
  2378
  "foldl op + a xs = a + foldr op + xs 0"
haftmann@39774
  2379
  by (induct xs arbitrary: a) (auto simp: add_assoc)
haftmann@39774
  2380
haftmann@39774
  2381
corollary (in monoid_add) foldl_foldr1:
haftmann@39774
  2382
  "foldl op + 0 xs = foldr op + xs 0"
haftmann@39774
  2383
  by (simp add: foldl_foldr1_lemma)
haftmann@39774
  2384
haftmann@39774
  2385
lemma (in ab_semigroup_add) foldr_conv_foldl:
haftmann@39774
  2386
  "foldr op + xs a = foldl op + a xs"
haftmann@39774
  2387
  by (induct xs) (simp_all add: foldl_assoc add.commute)
chaieb@24471
  2388
wenzelm@13142
  2389
text {*
nipkow@13145
  2390
Note: @{text "n \<le> foldl (op +) n ns"} looks simpler, but is more
nipkow@13145
  2391
difficult to use because it requires an additional transitivity step.
wenzelm@13142
  2392
*}
wenzelm@13142
  2393
nipkow@24526
  2394
lemma start_le_sum: "(m::nat) <= n ==> m <= foldl (op +) n ns"
nipkow@24526
  2395
by (induct ns arbitrary: n) auto
nipkow@24526
  2396
nipkow@24526
  2397
lemma elem_le_sum: "(n::nat) : set ns ==> n <= foldl (op +) 0 ns"
nipkow@13145
  2398
by (force intro: start_le_sum simp add: in_set_conv_decomp)
wenzelm@13142
  2399
wenzelm@13142
  2400
lemma sum_eq_0_conv [iff]:
nipkow@24526
  2401
  "(foldl (op +) (m::nat) ns = 0) = (m = 0 \<and> (\<forall>n \<in> set ns. n = 0))"
nipkow@24526
  2402
by (induct ns arbitrary: m) auto
wenzelm@13114
  2403
chaieb@24471
  2404
lemma foldr_invariant: 
chaieb@24471
  2405
  "\<lbrakk>Q x ; \<forall> x\<in> set xs. P x; \<forall> x y. P x \<and> Q y \<longrightarrow> Q (f x y) \<rbrakk> \<Longrightarrow> Q (foldr f xs x)"
chaieb@24471
  2406
  by (induct xs, simp_all)
chaieb@24471
  2407
chaieb@24471
  2408
lemma foldl_invariant: 
chaieb@24471
  2409
  "\<lbrakk>Q x ; \<forall> x\<in> set xs. P x; \<forall> x y. P x \<and> Q y \<longrightarrow> Q (f y x) \<rbrakk> \<Longrightarrow> Q (foldl f x xs)"
chaieb@24471
  2410
  by (induct xs arbitrary: x, simp_all)
chaieb@24471
  2411
haftmann@34978
  2412
lemma foldl_weak_invariant:
haftmann@34978
  2413
  assumes "P s"
haftmann@34978
  2414
    and "\<And>s x. x \<in> set xs \<Longrightarrow> P s \<Longrightarrow> P (f s x)"
haftmann@34978
  2415
  shows "P (foldl f s xs)"
haftmann@34978
  2416
  using assms by (induct xs arbitrary: s) simp_all
haftmann@34978
  2417
haftmann@31455
  2418
text {* @{const foldl} and @{const concat} *}
nipkow@24449
  2419
nipkow@24449
  2420
lemma foldl_conv_concat:
haftmann@29782
  2421
  "foldl (op @) xs xss = xs @ concat xss"
haftmann@29782
  2422
proof (induct xss arbitrary: xs)
haftmann@29782
  2423
  case Nil show ?case by simp
haftmann@29782
  2424
next
haftmann@35267
  2425
  interpret monoid_add "op @" "[]" proof qed simp_all
haftmann@29782
  2426
  case Cons then show ?case by (simp add: foldl_absorb0)
haftmann@29782
  2427
qed
haftmann@29782
  2428
haftmann@29782
  2429
lemma concat_conv_foldl: "concat xss = foldl (op @) [] xss"
haftmann@29782
  2430
  by (simp add: foldl_conv_concat)
haftmann@29782
  2431
haftmann@31455
  2432
text {* @{const Finite_Set.fold} and @{const foldl} *}
haftmann@31455
  2433
haftmann@35195
  2434
lemma (in fun_left_comm) fold_set_remdups:
haftmann@35195
  2435
  "fold f y (set xs) = foldl (\<lambda>y x. f x y) y (remdups xs)"
haftmann@35195
  2436
  by (rule sym, induct xs arbitrary: y) (simp_all add: fold_fun_comm insert_absorb)
haftmann@35195
  2437
haftmann@31455
  2438
lemma (in fun_left_comm_idem) fold_set:
haftmann@31455
  2439
  "fold f y (set xs) = foldl (\<lambda>y x. f x y) y xs"
haftmann@31455
  2440
  by (rule sym, induct xs arbitrary: y) (simp_all add: fold_fun_comm)
haftmann@31455
  2441
haftmann@32681
  2442
lemma (in ab_semigroup_idem_mult) fold1_set:
haftmann@32681
  2443
  assumes "xs \<noteq> []"
haftmann@32681
  2444
  shows "fold1 times (set xs) = foldl times (hd xs) (tl xs)"
haftmann@32681
  2445
proof -
haftmann@32681
  2446
  interpret fun_left_comm_idem times by (fact fun_left_comm_idem)
haftmann@32681
  2447
  from assms obtain y ys where xs: "xs = y # ys"
haftmann@32681
  2448
    by (cases xs) auto
haftmann@32681
  2449
  show ?thesis
haftmann@32681
  2450
  proof (cases "set ys = {}")
haftmann@32681
  2451
    case True with xs show ?thesis by simp
haftmann@32681
  2452
  next
haftmann@32681
  2453
    case False
haftmann@32681
  2454
    then have "fold1 times (insert y (set ys)) = fold times y (set ys)"
haftmann@32681
  2455
      by (simp only: finite_set fold1_eq_fold_idem)
haftmann@32681
  2456
    with xs show ?thesis by (simp add: fold_set mult_commute)
haftmann@32681
  2457
  qed
haftmann@32681
  2458
qed
haftmann@32681
  2459
haftmann@32681
  2460
lemma (in lattice) Inf_fin_set_fold [code_unfold]:
haftmann@32681
  2461
  "Inf_fin (set (x # xs)) = foldl inf x xs"
haftmann@32681
  2462
proof -
haftmann@32681
  2463
  interpret ab_semigroup_idem_mult "inf :: 'a \<Rightarrow> 'a \<Rightarrow> 'a"
haftmann@32681
  2464
    by (fact ab_semigroup_idem_mult_inf)
haftmann@32681
  2465
  show ?thesis
haftmann@32681
  2466
    by (simp add: Inf_fin_def fold1_set del: set.simps)
haftmann@32681
  2467
qed
haftmann@32681
  2468
haftmann@32681
  2469
lemma (in lattice) Sup_fin_set_fold [code_unfold]:
haftmann@32681
  2470
  "Sup_fin (set (x # xs)) = foldl sup x xs"
haftmann@32681
  2471
proof -
haftmann@32681
  2472
  interpret ab_semigroup_idem_mult "sup :: 'a \<Rightarrow> 'a \<Rightarrow> 'a"
haftmann@32681
  2473
    by (fact ab_semigroup_idem_mult_sup)
haftmann@32681
  2474
  show ?thesis
haftmann@32681
  2475
    by (simp add: Sup_fin_def fold1_set del: set.simps)
haftmann@32681
  2476
qed
haftmann@32681
  2477
haftmann@32681
  2478
lemma (in linorder) Min_fin_set_fold [code_unfold]:
haftmann@32681
  2479
  "Min (set (x # xs)) = foldl min x xs"
haftmann@32681
  2480
proof -
haftmann@32681
  2481
  interpret ab_semigroup_idem_mult "min :: 'a \<Rightarrow> 'a \<Rightarrow> 'a"
haftmann@32681
  2482
    by (fact ab_semigroup_idem_mult_min)
haftmann@32681
  2483
  show ?thesis
haftmann@32681
  2484
    by (simp add: Min_def fold1_set del: set.simps)
haftmann@32681
  2485
qed
haftmann@32681
  2486
haftmann@32681
  2487
lemma (in linorder) Max_fin_set_fold [code_unfold]:
haftmann@32681
  2488
  "Max (set (x # xs)) = foldl max x xs"
haftmann@32681
  2489
proof -
haftmann@32681
  2490
  interpret ab_semigroup_idem_mult "max :: 'a \<Rightarrow> 'a \<Rightarrow> 'a"
haftmann@32681
  2491
    by (fact ab_semigroup_idem_mult_max)
haftmann@32681
  2492
  show ?thesis
haftmann@32681
  2493
    by (simp add: Max_def fold1_set del: set.simps)
haftmann@32681
  2494
qed
haftmann@32681
  2495
haftmann@32681
  2496
lemma (in complete_lattice) Inf_set_fold [code_unfold]:
haftmann@32681
  2497
  "Inf (set xs) = foldl inf top xs"
haftmann@34007
  2498
proof -
haftmann@34007
  2499
  interpret fun_left_comm_idem "inf :: 'a \<Rightarrow> 'a \<Rightarrow> 'a"
haftmann@34007
  2500
    by (fact fun_left_comm_idem_inf)
haftmann@34007
  2501
  show ?thesis by (simp add: Inf_fold_inf fold_set inf_commute)
haftmann@34007
  2502
qed
haftmann@32681
  2503
haftmann@32681
  2504
lemma (in complete_lattice) Sup_set_fold [code_unfold]:
haftmann@32681
  2505
  "Sup (set xs) = foldl sup bot xs"
haftmann@34007
  2506
proof -
haftmann@34007
  2507
  interpret fun_left_comm_idem "sup :: 'a \<Rightarrow> 'a \<Rightarrow> 'a"
haftmann@34007
  2508
    by (fact fun_left_comm_idem_sup)
haftmann@34007
  2509
  show ?thesis by (simp add: Sup_fold_sup fold_set sup_commute)
haftmann@34007
  2510
qed
haftmann@34007
  2511
haftmann@34007
  2512
lemma (in complete_lattice) INFI_set_fold:
haftmann@34007
  2513
  "INFI (set xs) f = foldl (\<lambda>y x. inf (f x) y) top xs"
haftmann@34007
  2514
  unfolding INFI_def set_map [symmetric] Inf_set_fold foldl_map
haftmann@34007
  2515
    by (simp add: inf_commute)
haftmann@34007
  2516
haftmann@34007
  2517
lemma (in complete_lattice) SUPR_set_fold:
haftmann@34007
  2518
  "SUPR (set xs) f = foldl (\<lambda>y x. sup (f x) y) bot xs"
haftmann@34007
  2519
  unfolding SUPR_def set_map [symmetric] Sup_set_fold foldl_map
haftmann@34007
  2520
    by (simp add: sup_commute)
haftmann@31455
  2521
wenzelm@35115
  2522
nipkow@24645
  2523
subsubsection {* @{text upt} *}
wenzelm@13114
  2524
nipkow@17090
  2525
lemma upt_rec[code]: "[i..<j] = (if i<j then i#[Suc i..<j] else [])"
nipkow@17090
  2526
-- {* simp does not terminate! *}
nipkow@13145
  2527
by (induct j) auto
wenzelm@13142
  2528
nipkow@32005
  2529
lemmas upt_rec_number_of[simp] = upt_rec[of "number_of m" "number_of n", standard]
nipkow@32005
  2530
nipkow@15425
  2531
lemma upt_conv_Nil [simp]: "j <= i ==> [i..<j] = []"
nipkow@13145
  2532
by (subst upt_rec) simp
wenzelm@13114
  2533
nipkow@15425
  2534
lemma upt_eq_Nil_conv[simp]: "([i..<j] = []) = (j = 0 \<or> j <= i)"
nipkow@15281
  2535
by(induct j)simp_all
nipkow@15281
  2536
nipkow@15281
  2537
lemma upt_eq_Cons_conv:
nipkow@24526
  2538
 "([i..<j] = x#xs) = (i < j & i = x & [i+1..<j] = xs)"
nipkow@24526
  2539
apply(induct j arbitrary: x xs)
nipkow@15281
  2540
 apply simp
nipkow@15281
  2541
apply(clarsimp simp add: append_eq_Cons_conv)
nipkow@15281
  2542
apply arith
nipkow@15281
  2543
done
nipkow@15281
  2544
nipkow@15425
  2545
lemma upt_Suc_append: "i <= j ==> [i..<(Suc j)] = [i..<j]@[j]"
nipkow@13145
  2546
-- {* Only needed if @{text upt_Suc} is deleted from the simpset. *}
nipkow@13145
  2547
by simp
wenzelm@13114
  2548
nipkow@15425
  2549
lemma upt_conv_Cons: "i < j ==> [i..<j] = i # [Suc i..<j]"
haftmann@26734
  2550
  by (simp add: upt_rec)
wenzelm@13114
  2551
nipkow@15425
  2552
lemma upt_add_eq_append: "i<=j ==> [i..<j+k] = [i..<j]@[j..<j+k]"
nipkow@13145
  2553
-- {* LOOPS as a simprule, since @{text "j <= j"}. *}
nipkow@13145
  2554
by (induct k) auto
wenzelm@13114
  2555
nipkow@15425
  2556
lemma length_upt [simp]: "length [i..<j] = j - i"
nipkow@13145
  2557
by (induct j) (auto simp add: Suc_diff_le)
wenzelm@13114
  2558
nipkow@15425
  2559
lemma nth_upt [simp]: "i + k < j ==> [i..<j] ! k = i + k"
nipkow@13145
  2560
apply (induct j)
nipkow@13145
  2561
apply (auto simp add: less_Suc_eq nth_append split: nat_diff_split)
nipkow@13145
  2562
done
wenzelm@13114
  2563
nipkow@17906
  2564
nipkow@17906
  2565
lemma hd_upt[simp]: "i < j \<Longrightarrow> hd[i..<j] = i"
nipkow@17906
  2566
by(simp add:upt_conv_Cons)
nipkow@17906
  2567
nipkow@17906
  2568
lemma last_upt[simp]: "i < j \<Longrightarrow> last[i..<j] = j - 1"
nipkow@17906
  2569
apply(cases j)
nipkow@17906
  2570
 apply simp
nipkow@17906
  2571
by(simp add:upt_Suc_append)
nipkow@17906
  2572
nipkow@24526
  2573
lemma take_upt [simp]: "i+m <= n ==> take m [i..<n] = [i..<i+m]"
nipkow@24526
  2574
apply (induct m arbitrary: i, simp)
nipkow@13145
  2575
apply (subst upt_rec)
nipkow@13145
  2576
apply (rule sym)
nipkow@13145
  2577
apply (subst upt_rec)
nipkow@13145
  2578
apply (simp del: upt.simps)
nipkow@13145
  2579
done
nipkow@3507
  2580
nipkow@17501
  2581
lemma drop_upt[simp]: "drop m [i..<j] = [i+m..<j]"
nipkow@17501
  2582
apply(induct j)
nipkow@17501
  2583
apply auto
nipkow@17501
  2584
done
nipkow@17501
  2585
nipkow@24645
  2586
lemma map_Suc_upt: "map Suc [m..<n] = [Suc m..<Suc n]"
nipkow@13145
  2587
by (induct n) auto
wenzelm@13114
  2588
nipkow@24526
  2589
lemma nth_map_upt: "i < n-m ==> (map f [m..<n]) ! i = f(m+i)"
nipkow@24526
  2590
apply (induct n m  arbitrary: i rule: diff_induct)
nipkow@13145
  2591
prefer 3 apply (subst map_Suc_upt[symmetric])
nipkow@13145
  2592
apply (auto simp add: less_diff_conv nth_upt)
nipkow@13145
  2593
done
wenzelm@13114
  2594
berghofe@13883
  2595
lemma nth_take_lemma:
nipkow@24526
  2596
  "k <= length xs ==> k <= length ys ==>
berghofe@13883
  2597
     (!!i. i < k --> xs!i = ys!i) ==> take k xs = take k ys"
nipkow@24526
  2598
apply (atomize, induct k arbitrary: xs ys)
paulson@14208
  2599
apply (simp_all add: less_Suc_eq_0_disj all_conj_distrib, clarify)
nipkow@13145
  2600
txt {* Both lists must be non-empty *}
paulson@14208
  2601
apply (case_tac xs, simp)
paulson@14208
  2602
apply (case_tac ys, clarify)
nipkow@13145
  2603
 apply (simp (no_asm_use))
nipkow@13145
  2604
apply clarify
nipkow@13145
  2605
txt {* prenexing's needed, not miniscoping *}
nipkow@13145
  2606
apply (simp (no_asm_use) add: all_simps [symmetric] del: all_simps)
nipkow@13145
  2607
apply blast
nipkow@13145
  2608
done
wenzelm@13114
  2609
wenzelm@13114
  2610
lemma nth_equalityI:
wenzelm@13114
  2611
 "[| length xs = length ys; ALL i < length xs. xs!i = ys!i |] ==> xs = ys"
nipkow@13145
  2612
apply (frule nth_take_lemma [OF le_refl eq_imp_le])
nipkow@13145
  2613
apply (simp_all add: take_all)
nipkow@13145
  2614
done
wenzelm@13142
  2615
haftmann@24796
  2616
lemma map_nth:
haftmann@24796
  2617
  "map (\<lambda>i. xs ! i) [0..<length xs] = xs"
haftmann@24796
  2618
  by (rule nth_equalityI, auto)
haftmann@24796
  2619
kleing@13863
  2620
(* needs nth_equalityI *)
kleing@13863
  2621
lemma list_all2_antisym:
kleing@13863
  2622
  "\<lbrakk> (\<And>x y. \<lbrakk>P x y; Q y x\<rbrakk> \<Longrightarrow> x = y); list_all2 P xs ys; list_all2 Q ys xs \<rbrakk> 
kleing@13863
  2623
  \<Longrightarrow> xs = ys"
kleing@13863
  2624
  apply (simp add: list_all2_conv_all_nth) 
paulson@14208
  2625
  apply (rule nth_equalityI, blast, simp)
kleing@13863
  2626
  done
kleing@13863
  2627
wenzelm@13142
  2628
lemma take_equalityI: "(\<forall>i. take i xs = take i ys) ==> xs = ys"
nipkow@13145
  2629
-- {* The famous take-lemma. *}
nipkow@13145
  2630
apply (drule_tac x = "max (length xs) (length ys)" in spec)
nipkow@13145
  2631
apply (simp add: le_max_iff_disj take_all)
nipkow@13145
  2632
done
wenzelm@13142
  2633
wenzelm@13142
  2634
nipkow@15302
  2635
lemma take_Cons':
nipkow@15302
  2636
     "take n (x # xs) = (if n = 0 then [] else x # take (n - 1) xs)"
nipkow@15302
  2637
by (cases n) simp_all
nipkow@15302
  2638
nipkow@15302
  2639
lemma drop_Cons':
nipkow@15302
  2640
     "drop n (x # xs) = (if n = 0 then x # xs else drop (n - 1) xs)"
nipkow@15302
  2641
by (cases n) simp_all
nipkow@15302
  2642
nipkow@15302
  2643
lemma nth_Cons': "(x # xs)!n = (if n = 0 then x else xs!(n - 1))"
nipkow@15302
  2644
by (cases n) simp_all
nipkow@15302
  2645
paulson@18622
  2646
lemmas take_Cons_number_of = take_Cons'[of "number_of v",standard]
paulson@18622
  2647
lemmas drop_Cons_number_of = drop_Cons'[of "number_of v",standard]
paulson@18622
  2648
lemmas nth_Cons_number_of = nth_Cons'[of _ _ "number_of v",standard]
paulson@18622
  2649
paulson@18622
  2650
declare take_Cons_number_of [simp] 
paulson@18622
  2651
        drop_Cons_number_of [simp] 
paulson@18622
  2652
        nth_Cons_number_of [simp] 
nipkow@15302
  2653
nipkow@15302
  2654
nipkow@32415
  2655
subsubsection {* @{text upto}: interval-list on @{typ int} *}
nipkow@32415
  2656
nipkow@32415
  2657
(* FIXME make upto tail recursive? *)
nipkow@32415
  2658
nipkow@32415
  2659
function upto :: "int \<Rightarrow> int \<Rightarrow> int list" ("(1[_../_])") where
nipkow@32415
  2660
"upto i j = (if i \<le> j then i # [i+1..j] else [])"
nipkow@32415
  2661
by auto
nipkow@32415
  2662
termination
nipkow@32415
  2663
by(relation "measure(%(i::int,j). nat(j - i + 1))") auto
nipkow@32415
  2664
nipkow@32415
  2665
declare upto.simps[code, simp del]
nipkow@32415
  2666
nipkow@32415
  2667
lemmas upto_rec_number_of[simp] =
nipkow@32415
  2668
  upto.simps[of "number_of m" "number_of n", standard]
nipkow@32415
  2669
nipkow@32415