src/HOL/List.thy
author nipkow
Sat Sep 24 21:13:15 2005 +0200 (2005-09-24)
changeset 17629 f8ea8068c6d9
parent 17589 58eeffd73be1
child 17724 e969fc0a4925
permissions -rw-r--r--
a few new filter lemmas
wenzelm@13462
     1
(*  Title:      HOL/List.thy
wenzelm@13462
     2
    ID:         $Id$
wenzelm@13462
     3
    Author:     Tobias Nipkow
clasohm@923
     4
*)
clasohm@923
     5
wenzelm@13114
     6
header {* The datatype of finite lists *}
wenzelm@13122
     7
nipkow@15131
     8
theory List
nipkow@15140
     9
imports PreList
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
nipkow@15392
    16
subsection{*Basic list processing functions*}
nipkow@15302
    17
clasohm@923
    18
consts
wenzelm@13366
    19
  "@" :: "'a list => 'a list => 'a list"    (infixr 65)
wenzelm@13366
    20
  filter:: "('a => bool) => 'a list => 'a list"
wenzelm@13366
    21
  concat:: "'a list list => 'a list"
wenzelm@13366
    22
  foldl :: "('b => 'a => 'b) => 'b => 'a list => 'b"
wenzelm@13366
    23
  foldr :: "('a => 'b => 'b) => 'a list => 'b => 'b"
wenzelm@13366
    24
  hd:: "'a list => 'a"
wenzelm@13366
    25
  tl:: "'a list => 'a list"
wenzelm@13366
    26
  last:: "'a list => 'a"
wenzelm@13366
    27
  butlast :: "'a list => 'a list"
wenzelm@13366
    28
  set :: "'a list => 'a set"
wenzelm@13366
    29
  list_all2 :: "('a => 'b => bool) => 'a list => 'b list => bool"
wenzelm@13366
    30
  map :: "('a=>'b) => ('a list => 'b list)"
wenzelm@13366
    31
  nth :: "'a list => nat => 'a"    (infixl "!" 100)
wenzelm@13366
    32
  list_update :: "'a list => nat => 'a => 'a list"
wenzelm@13366
    33
  take:: "nat => 'a list => 'a list"
wenzelm@13366
    34
  drop:: "nat => 'a list => 'a list"
wenzelm@13366
    35
  takeWhile :: "('a => bool) => 'a list => 'a list"
wenzelm@13366
    36
  dropWhile :: "('a => bool) => 'a list => 'a list"
wenzelm@13366
    37
  rev :: "'a list => 'a list"
wenzelm@13366
    38
  zip :: "'a list => 'b list => ('a * 'b) list"
nipkow@15425
    39
  upt :: "nat => nat => nat list" ("(1[_..</_'])")
wenzelm@13366
    40
  remdups :: "'a list => 'a list"
nipkow@15110
    41
  remove1 :: "'a => 'a list => 'a list"
wenzelm@13366
    42
  null:: "'a list => bool"
wenzelm@13366
    43
  "distinct":: "'a list => bool"
wenzelm@13366
    44
  replicate :: "nat => 'a => 'a list"
nipkow@15302
    45
  rotate1 :: "'a list \<Rightarrow> 'a list"
nipkow@15302
    46
  rotate :: "nat \<Rightarrow> 'a list \<Rightarrow> 'a list"
nipkow@15302
    47
  sublist :: "'a list => nat set => 'a list"
nipkow@17086
    48
(* For efficiency *)
nipkow@17086
    49
  mem :: "'a => 'a list => bool"    (infixl 55)
nipkow@17086
    50
  list_inter :: "'a list \<Rightarrow> 'a list \<Rightarrow> 'a list"
nipkow@17086
    51
  list_ex :: "('a \<Rightarrow> bool) \<Rightarrow> 'a list \<Rightarrow> bool"
nipkow@17086
    52
  list_all:: "('a => bool) => ('a list => bool)"
nipkow@17086
    53
  itrev :: "'a list \<Rightarrow> 'a list \<Rightarrow> 'a list"
nipkow@17086
    54
  filtermap :: "('a \<Rightarrow> 'b option) \<Rightarrow> 'a list \<Rightarrow> 'b list"
nipkow@17086
    55
  map_filter :: "('a => 'b) => ('a => bool) => 'a list => 'b list"
nipkow@15302
    56
clasohm@923
    57
nipkow@13146
    58
nonterminals lupdbinds lupdbind
nipkow@5077
    59
clasohm@923
    60
syntax
wenzelm@13366
    61
  -- {* list Enumeration *}
wenzelm@13366
    62
  "@list" :: "args => 'a list"    ("[(_)]")
clasohm@923
    63
wenzelm@13366
    64
  -- {* Special syntax for filter *}
wenzelm@13366
    65
  "@filter" :: "[pttrn, 'a list, bool] => 'a list"    ("(1[_:_./ _])")
clasohm@923
    66
wenzelm@13366
    67
  -- {* list update *}
wenzelm@13366
    68
  "_lupdbind":: "['a, 'a] => lupdbind"    ("(2_ :=/ _)")
wenzelm@13366
    69
  "" :: "lupdbind => lupdbinds"    ("_")
wenzelm@13366
    70
  "_lupdbinds" :: "[lupdbind, lupdbinds] => lupdbinds"    ("_,/ _")
wenzelm@13366
    71
  "_LUpdate" :: "['a, lupdbinds] => 'a"    ("_/[(_)]" [900,0] 900)
nipkow@5077
    72
wenzelm@13366
    73
  upto:: "nat => nat => nat list"    ("(1[_../_])")
nipkow@5427
    74
clasohm@923
    75
translations
wenzelm@13366
    76
  "[x, xs]" == "x#[xs]"
wenzelm@13366
    77
  "[x]" == "x#[]"
wenzelm@13366
    78
  "[x:xs . P]"== "filter (%x. P) xs"
clasohm@923
    79
wenzelm@13366
    80
  "_LUpdate xs (_lupdbinds b bs)"== "_LUpdate (_LUpdate xs b) bs"
wenzelm@13366
    81
  "xs[i:=x]" == "list_update xs i x"
nipkow@5077
    82
nipkow@15425
    83
  "[i..j]" == "[i..<(Suc j)]"
nipkow@5427
    84
nipkow@5427
    85
wenzelm@12114
    86
syntax (xsymbols)
wenzelm@13366
    87
  "@filter" :: "[pttrn, 'a list, bool] => 'a list"("(1[_\<in>_ ./ _])")
kleing@14565
    88
syntax (HTML output)
kleing@14565
    89
  "@filter" :: "[pttrn, 'a list, bool] => 'a list"("(1[_\<in>_ ./ _])")
paulson@3342
    90
paulson@3342
    91
wenzelm@13142
    92
text {*
wenzelm@14589
    93
  Function @{text size} is overloaded for all datatypes. Users may
wenzelm@13366
    94
  refer to the list version as @{text length}. *}
wenzelm@13142
    95
wenzelm@13142
    96
syntax length :: "'a list => nat"
wenzelm@13142
    97
translations "length" => "size :: _ list => nat"
wenzelm@13114
    98
wenzelm@13142
    99
typed_print_translation {*
wenzelm@13366
   100
  let
wenzelm@13366
   101
    fun size_tr' _ (Type ("fun", (Type ("list", _) :: _))) [t] =
wenzelm@13366
   102
          Syntax.const "length" $ t
wenzelm@13366
   103
      | size_tr' _ _ _ = raise Match;
wenzelm@13366
   104
  in [("size", size_tr')] end
wenzelm@13114
   105
*}
paulson@3437
   106
nipkow@15302
   107
berghofe@5183
   108
primrec
paulson@15307
   109
  "hd(x#xs) = x"
paulson@15307
   110
berghofe@5183
   111
primrec
paulson@15307
   112
  "tl([]) = []"
paulson@15307
   113
  "tl(x#xs) = xs"
paulson@15307
   114
berghofe@5183
   115
primrec
paulson@15307
   116
  "null([]) = True"
paulson@15307
   117
  "null(x#xs) = False"
paulson@15307
   118
paulson@8972
   119
primrec
paulson@15307
   120
  "last(x#xs) = (if xs=[] then x else last xs)"
paulson@15307
   121
berghofe@5183
   122
primrec
paulson@15307
   123
  "butlast []= []"
paulson@15307
   124
  "butlast(x#xs) = (if xs=[] then [] else x#butlast xs)"
paulson@15307
   125
berghofe@5183
   126
primrec
paulson@15307
   127
  "set [] = {}"
paulson@15307
   128
  "set (x#xs) = insert x (set xs)"
paulson@15307
   129
berghofe@5183
   130
primrec
paulson@15307
   131
  "map f [] = []"
paulson@15307
   132
  "map f (x#xs) = f(x)#map f xs"
paulson@15307
   133
berghofe@5183
   134
primrec
paulson@15307
   135
  append_Nil:"[]@ys = ys"
paulson@15307
   136
  append_Cons: "(x#xs)@ys = x#(xs@ys)"
paulson@15307
   137
berghofe@5183
   138
primrec
paulson@15307
   139
  "rev([]) = []"
paulson@15307
   140
  "rev(x#xs) = rev(xs) @ [x]"
paulson@15307
   141
berghofe@5183
   142
primrec
paulson@15307
   143
  "filter P [] = []"
paulson@15307
   144
  "filter P (x#xs) = (if P x then x#filter P xs else filter P xs)"
paulson@15307
   145
berghofe@5183
   146
primrec
paulson@15307
   147
  foldl_Nil:"foldl f a [] = a"
paulson@15307
   148
  foldl_Cons: "foldl f a (x#xs) = foldl f (f a x) xs"
paulson@15307
   149
paulson@8000
   150
primrec
paulson@15307
   151
  "foldr f [] a = a"
paulson@15307
   152
  "foldr f (x#xs) a = f x (foldr f xs a)"
paulson@15307
   153
berghofe@5183
   154
primrec
paulson@15307
   155
  "concat([]) = []"
paulson@15307
   156
  "concat(x#xs) = x @ concat(xs)"
paulson@15307
   157
berghofe@5183
   158
primrec
paulson@15307
   159
  drop_Nil:"drop n [] = []"
paulson@15307
   160
  drop_Cons: "drop n (x#xs) = (case n of 0 => x#xs | Suc(m) => drop m xs)"
paulson@15307
   161
  -- {*Warning: simpset does not contain this definition, but separate
paulson@15307
   162
       theorems for @{text "n = 0"} and @{text "n = Suc k"} *}
paulson@15307
   163
berghofe@5183
   164
primrec
paulson@15307
   165
  take_Nil:"take n [] = []"
paulson@15307
   166
  take_Cons: "take n (x#xs) = (case n of 0 => [] | Suc(m) => x # take m xs)"
paulson@15307
   167
  -- {*Warning: simpset does not contain this definition, but separate
paulson@15307
   168
       theorems for @{text "n = 0"} and @{text "n = Suc k"} *}
paulson@15307
   169
wenzelm@13142
   170
primrec
paulson@15307
   171
  nth_Cons:"(x#xs)!n = (case n of 0 => x | (Suc k) => xs!k)"
paulson@15307
   172
  -- {*Warning: simpset does not contain this definition, but separate
paulson@15307
   173
       theorems for @{text "n = 0"} and @{text "n = Suc k"} *}
paulson@15307
   174
berghofe@5183
   175
primrec
paulson@15307
   176
  "[][i:=v] = []"
paulson@15307
   177
  "(x#xs)[i:=v] = (case i of 0 => v # xs | Suc j => x # xs[j:=v])"
paulson@15307
   178
paulson@15307
   179
primrec
paulson@15307
   180
  "takeWhile P [] = []"
paulson@15307
   181
  "takeWhile P (x#xs) = (if P x then x#takeWhile P xs else [])"
paulson@15307
   182
berghofe@5183
   183
primrec
paulson@15307
   184
  "dropWhile P [] = []"
paulson@15307
   185
  "dropWhile P (x#xs) = (if P x then dropWhile P xs else x#xs)"
paulson@15307
   186
berghofe@5183
   187
primrec
paulson@15307
   188
  "zip xs [] = []"
paulson@15307
   189
  zip_Cons: "zip xs (y#ys) = (case xs of [] => [] | z#zs => (z,y)#zip zs ys)"
paulson@15307
   190
  -- {*Warning: simpset does not contain this definition, but separate
paulson@15307
   191
       theorems for @{text "xs = []"} and @{text "xs = z # zs"} *}
paulson@15307
   192
nipkow@5427
   193
primrec
nipkow@15425
   194
  upt_0: "[i..<0] = []"
nipkow@15425
   195
  upt_Suc: "[i..<(Suc j)] = (if i <= j then [i..<j] @ [j] else [])"
paulson@15307
   196
berghofe@5183
   197
primrec
paulson@15307
   198
  "distinct [] = True"
paulson@15307
   199
  "distinct (x#xs) = (x ~: set xs \<and> distinct xs)"
paulson@15307
   200
berghofe@5183
   201
primrec
paulson@15307
   202
  "remdups [] = []"
paulson@15307
   203
  "remdups (x#xs) = (if x : set xs then remdups xs else x # remdups xs)"
paulson@15307
   204
berghofe@5183
   205
primrec
paulson@15307
   206
  "remove1 x [] = []"
paulson@15307
   207
  "remove1 x (y#xs) = (if x=y then xs else y # remove1 x xs)"
paulson@15307
   208
nipkow@15110
   209
primrec
paulson@15307
   210
  replicate_0: "replicate 0 x = []"
paulson@15307
   211
  replicate_Suc: "replicate (Suc n) x = x # replicate n x"
paulson@15307
   212
nipkow@8115
   213
defs
nipkow@15302
   214
rotate1_def: "rotate1 xs == (case xs of [] \<Rightarrow> [] | x#xs \<Rightarrow> xs @ [x])"
nipkow@15302
   215
rotate_def:  "rotate n == rotate1 ^ n"
nipkow@15302
   216
nipkow@15302
   217
list_all2_def:
nipkow@15302
   218
 "list_all2 P xs ys ==
nipkow@15302
   219
  length xs = length ys \<and> (\<forall>(x, y) \<in> set (zip xs ys). P x y)"
nipkow@15302
   220
nipkow@15302
   221
sublist_def:
nipkow@15425
   222
 "sublist xs A == map fst (filter (%p. snd p : A) (zip xs [0..<size xs]))"
nipkow@5281
   223
nipkow@17086
   224
primrec
nipkow@17086
   225
  "x mem [] = False"
nipkow@17086
   226
  "x mem (y#ys) = (if y=x then True else x mem ys)"
nipkow@17086
   227
nipkow@17086
   228
primrec
nipkow@17086
   229
 "list_inter [] bs = []"
nipkow@17086
   230
 "list_inter (a#as) bs =
nipkow@17086
   231
  (if a \<in> set bs then a#(list_inter as bs) else list_inter as bs)"
nipkow@17086
   232
nipkow@17086
   233
primrec
nipkow@17086
   234
  "list_all P [] = True"
nipkow@17086
   235
  "list_all P (x#xs) = (P(x) \<and> list_all P xs)"
nipkow@17086
   236
nipkow@17086
   237
primrec
nipkow@17086
   238
"list_ex P [] = False"
nipkow@17086
   239
"list_ex P (x#xs) = (P x \<or> list_ex P xs)"
nipkow@17086
   240
nipkow@17086
   241
primrec
nipkow@17086
   242
 "filtermap f [] = []"
nipkow@17086
   243
 "filtermap f (x#xs) =
nipkow@17086
   244
    (case f x of None \<Rightarrow> filtermap f xs
nipkow@17086
   245
     | Some y \<Rightarrow> y # (filtermap f xs))"
nipkow@17086
   246
nipkow@17086
   247
primrec
nipkow@17086
   248
  "map_filter f P [] = []"
nipkow@17086
   249
  "map_filter f P (x#xs) = (if P x then f x # map_filter f P xs else 
nipkow@17086
   250
               map_filter f P xs)"
nipkow@17086
   251
nipkow@17086
   252
primrec
nipkow@17086
   253
"itrev [] ys = ys"
nipkow@17086
   254
"itrev (x#xs) ys = itrev xs (x#ys)"
nipkow@17086
   255
wenzelm@13114
   256
wenzelm@13142
   257
lemma not_Cons_self [simp]: "xs \<noteq> x # xs"
nipkow@13145
   258
by (induct xs) auto
wenzelm@13114
   259
wenzelm@13142
   260
lemmas not_Cons_self2 [simp] = not_Cons_self [symmetric]
wenzelm@13114
   261
wenzelm@13142
   262
lemma neq_Nil_conv: "(xs \<noteq> []) = (\<exists>y ys. xs = y # ys)"
nipkow@13145
   263
by (induct xs) auto
wenzelm@13114
   264
wenzelm@13142
   265
lemma length_induct:
nipkow@13145
   266
"(!!xs. \<forall>ys. length ys < length xs --> P ys ==> P xs) ==> P xs"
nipkow@17589
   267
by (rule measure_induct [of length]) iprover
wenzelm@13114
   268
wenzelm@13114
   269
nipkow@15392
   270
subsubsection {* @{text length} *}
wenzelm@13114
   271
wenzelm@13142
   272
text {*
nipkow@13145
   273
Needs to come before @{text "@"} because of theorem @{text
nipkow@13145
   274
append_eq_append_conv}.
wenzelm@13142
   275
*}
wenzelm@13114
   276
wenzelm@13142
   277
lemma length_append [simp]: "length (xs @ ys) = length xs + length ys"
nipkow@13145
   278
by (induct xs) auto
wenzelm@13114
   279
wenzelm@13142
   280
lemma length_map [simp]: "length (map f xs) = length xs"
nipkow@13145
   281
by (induct xs) auto
wenzelm@13114
   282
wenzelm@13142
   283
lemma length_rev [simp]: "length (rev xs) = length xs"
nipkow@13145
   284
by (induct xs) auto
wenzelm@13114
   285
wenzelm@13142
   286
lemma length_tl [simp]: "length (tl xs) = length xs - 1"
nipkow@13145
   287
by (cases xs) auto
wenzelm@13114
   288
wenzelm@13142
   289
lemma length_0_conv [iff]: "(length xs = 0) = (xs = [])"
nipkow@13145
   290
by (induct xs) auto
wenzelm@13114
   291
wenzelm@13142
   292
lemma length_greater_0_conv [iff]: "(0 < length xs) = (xs \<noteq> [])"
nipkow@13145
   293
by (induct xs) auto
wenzelm@13114
   294
wenzelm@13114
   295
lemma length_Suc_conv:
nipkow@13145
   296
"(length xs = Suc n) = (\<exists>y ys. xs = y # ys \<and> length ys = n)"
nipkow@13145
   297
by (induct xs) auto
wenzelm@13142
   298
nipkow@14025
   299
lemma Suc_length_conv:
nipkow@14025
   300
"(Suc n = length xs) = (\<exists>y ys. xs = y # ys \<and> length ys = n)"
paulson@14208
   301
apply (induct xs, simp, simp)
nipkow@14025
   302
apply blast
nipkow@14025
   303
done
nipkow@14025
   304
oheimb@14099
   305
lemma impossible_Cons [rule_format]: 
oheimb@14099
   306
  "length xs <= length ys --> xs = x # ys = False"
paulson@14208
   307
apply (induct xs, auto)
oheimb@14099
   308
done
oheimb@14099
   309
nipkow@14247
   310
lemma list_induct2[consumes 1]: "\<And>ys.
nipkow@14247
   311
 \<lbrakk> length xs = length ys;
nipkow@14247
   312
   P [] [];
nipkow@14247
   313
   \<And>x xs y ys. \<lbrakk> length xs = length ys; P xs ys \<rbrakk> \<Longrightarrow> P (x#xs) (y#ys) \<rbrakk>
nipkow@14247
   314
 \<Longrightarrow> P xs ys"
nipkow@14247
   315
apply(induct xs)
nipkow@14247
   316
 apply simp
nipkow@14247
   317
apply(case_tac ys)
nipkow@14247
   318
 apply simp
nipkow@14247
   319
apply(simp)
nipkow@14247
   320
done
wenzelm@13114
   321
nipkow@15392
   322
subsubsection {* @{text "@"} -- append *}
wenzelm@13114
   323
wenzelm@13142
   324
lemma append_assoc [simp]: "(xs @ ys) @ zs = xs @ (ys @ zs)"
nipkow@13145
   325
by (induct xs) auto
wenzelm@13114
   326
wenzelm@13142
   327
lemma append_Nil2 [simp]: "xs @ [] = xs"
nipkow@13145
   328
by (induct xs) auto
nipkow@3507
   329
wenzelm@13142
   330
lemma append_is_Nil_conv [iff]: "(xs @ ys = []) = (xs = [] \<and> ys = [])"
nipkow@13145
   331
by (induct xs) auto
wenzelm@13114
   332
wenzelm@13142
   333
lemma Nil_is_append_conv [iff]: "([] = xs @ ys) = (xs = [] \<and> ys = [])"
nipkow@13145
   334
by (induct xs) auto
wenzelm@13114
   335
wenzelm@13142
   336
lemma append_self_conv [iff]: "(xs @ ys = xs) = (ys = [])"
nipkow@13145
   337
by (induct xs) auto
wenzelm@13114
   338
wenzelm@13142
   339
lemma self_append_conv [iff]: "(xs = xs @ ys) = (ys = [])"
nipkow@13145
   340
by (induct xs) auto
wenzelm@13114
   341
berghofe@13883
   342
lemma append_eq_append_conv [simp]:
berghofe@13883
   343
 "!!ys. length xs = length ys \<or> length us = length vs
berghofe@13883
   344
 ==> (xs@us = ys@vs) = (xs=ys \<and> us=vs)"
berghofe@13883
   345
apply (induct xs)
paulson@14208
   346
 apply (case_tac ys, simp, force)
paulson@14208
   347
apply (case_tac ys, force, simp)
nipkow@13145
   348
done
wenzelm@13142
   349
nipkow@14495
   350
lemma append_eq_append_conv2: "!!ys zs ts.
nipkow@14495
   351
 (xs @ ys = zs @ ts) =
nipkow@14495
   352
 (EX us. xs = zs @ us & us @ ys = ts | xs @ us = zs & ys = us@ ts)"
nipkow@14495
   353
apply (induct xs)
nipkow@14495
   354
 apply fastsimp
nipkow@14495
   355
apply(case_tac zs)
nipkow@14495
   356
 apply simp
nipkow@14495
   357
apply fastsimp
nipkow@14495
   358
done
nipkow@14495
   359
wenzelm@13142
   360
lemma same_append_eq [iff]: "(xs @ ys = xs @ zs) = (ys = zs)"
nipkow@13145
   361
by simp
wenzelm@13142
   362
wenzelm@13142
   363
lemma append1_eq_conv [iff]: "(xs @ [x] = ys @ [y]) = (xs = ys \<and> x = y)"
nipkow@13145
   364
by simp
wenzelm@13114
   365
wenzelm@13142
   366
lemma append_same_eq [iff]: "(ys @ xs = zs @ xs) = (ys = zs)"
nipkow@13145
   367
by simp
wenzelm@13114
   368
wenzelm@13142
   369
lemma append_self_conv2 [iff]: "(xs @ ys = ys) = (xs = [])"
nipkow@13145
   370
using append_same_eq [of _ _ "[]"] by auto
nipkow@3507
   371
wenzelm@13142
   372
lemma self_append_conv2 [iff]: "(ys = xs @ ys) = (xs = [])"
nipkow@13145
   373
using append_same_eq [of "[]"] by auto
wenzelm@13114
   374
wenzelm@13142
   375
lemma hd_Cons_tl [simp]: "xs \<noteq> [] ==> hd xs # tl xs = xs"
nipkow@13145
   376
by (induct xs) auto
wenzelm@13114
   377
wenzelm@13142
   378
lemma hd_append: "hd (xs @ ys) = (if xs = [] then hd ys else hd xs)"
nipkow@13145
   379
by (induct xs) auto
wenzelm@13114
   380
wenzelm@13142
   381
lemma hd_append2 [simp]: "xs \<noteq> [] ==> hd (xs @ ys) = hd xs"
nipkow@13145
   382
by (simp add: hd_append split: list.split)
wenzelm@13114
   383
wenzelm@13142
   384
lemma tl_append: "tl (xs @ ys) = (case xs of [] => tl ys | z#zs => zs @ ys)"
nipkow@13145
   385
by (simp split: list.split)
wenzelm@13114
   386
wenzelm@13142
   387
lemma tl_append2 [simp]: "xs \<noteq> [] ==> tl (xs @ ys) = tl xs @ ys"
nipkow@13145
   388
by (simp add: tl_append split: list.split)
wenzelm@13114
   389
wenzelm@13114
   390
nipkow@14300
   391
lemma Cons_eq_append_conv: "x#xs = ys@zs =
nipkow@14300
   392
 (ys = [] & x#xs = zs | (EX ys'. x#ys' = ys & xs = ys'@zs))"
nipkow@14300
   393
by(cases ys) auto
nipkow@14300
   394
nipkow@15281
   395
lemma append_eq_Cons_conv: "(ys@zs = x#xs) =
nipkow@15281
   396
 (ys = [] & zs = x#xs | (EX ys'. ys = x#ys' & ys'@zs = xs))"
nipkow@15281
   397
by(cases ys) auto
nipkow@15281
   398
nipkow@14300
   399
wenzelm@13142
   400
text {* Trivial rules for solving @{text "@"}-equations automatically. *}
wenzelm@13114
   401
wenzelm@13114
   402
lemma eq_Nil_appendI: "xs = ys ==> xs = [] @ ys"
nipkow@13145
   403
by simp
wenzelm@13114
   404
wenzelm@13142
   405
lemma Cons_eq_appendI:
nipkow@13145
   406
"[| x # xs1 = ys; xs = xs1 @ zs |] ==> x # xs = ys @ zs"
nipkow@13145
   407
by (drule sym) simp
wenzelm@13114
   408
wenzelm@13142
   409
lemma append_eq_appendI:
nipkow@13145
   410
"[| xs @ xs1 = zs; ys = xs1 @ us |] ==> xs @ ys = zs @ us"
nipkow@13145
   411
by (drule sym) simp
wenzelm@13114
   412
wenzelm@13114
   413
wenzelm@13142
   414
text {*
nipkow@13145
   415
Simplification procedure for all list equalities.
nipkow@13145
   416
Currently only tries to rearrange @{text "@"} to see if
nipkow@13145
   417
- both lists end in a singleton list,
nipkow@13145
   418
- or both lists end in the same list.
wenzelm@13142
   419
*}
wenzelm@13142
   420
wenzelm@13142
   421
ML_setup {*
nipkow@3507
   422
local
nipkow@3507
   423
wenzelm@13122
   424
val append_assoc = thm "append_assoc";
wenzelm@13122
   425
val append_Nil = thm "append_Nil";
wenzelm@13122
   426
val append_Cons = thm "append_Cons";
wenzelm@13122
   427
val append1_eq_conv = thm "append1_eq_conv";
wenzelm@13122
   428
val append_same_eq = thm "append_same_eq";
wenzelm@13122
   429
wenzelm@13114
   430
fun last (cons as Const("List.list.Cons",_) $ _ $ xs) =
wenzelm@13462
   431
  (case xs of Const("List.list.Nil",_) => cons | _ => last xs)
wenzelm@13462
   432
  | last (Const("List.op @",_) $ _ $ ys) = last ys
wenzelm@13462
   433
  | last t = t;
wenzelm@13114
   434
wenzelm@13114
   435
fun list1 (Const("List.list.Cons",_) $ _ $ Const("List.list.Nil",_)) = true
wenzelm@13462
   436
  | list1 _ = false;
wenzelm@13114
   437
wenzelm@13114
   438
fun butlast ((cons as Const("List.list.Cons",_) $ x) $ xs) =
wenzelm@13462
   439
  (case xs of Const("List.list.Nil",_) => xs | _ => cons $ butlast xs)
wenzelm@13462
   440
  | butlast ((app as Const("List.op @",_) $ xs) $ ys) = app $ butlast ys
wenzelm@13462
   441
  | butlast xs = Const("List.list.Nil",fastype_of xs);
wenzelm@13114
   442
wenzelm@16973
   443
val rearr_ss = HOL_basic_ss addsimps [append_assoc, append_Nil, append_Cons];
wenzelm@16973
   444
wenzelm@16973
   445
fun list_eq sg ss (F as (eq as Const(_,eqT)) $ lhs $ rhs) =
wenzelm@13462
   446
  let
wenzelm@13462
   447
    val lastl = last lhs and lastr = last rhs;
wenzelm@13462
   448
    fun rearr conv =
wenzelm@13462
   449
      let
wenzelm@13462
   450
        val lhs1 = butlast lhs and rhs1 = butlast rhs;
wenzelm@13462
   451
        val Type(_,listT::_) = eqT
wenzelm@13462
   452
        val appT = [listT,listT] ---> listT
wenzelm@13462
   453
        val app = Const("List.op @",appT)
wenzelm@13462
   454
        val F2 = eq $ (app$lhs1$lastl) $ (app$rhs1$lastr)
wenzelm@13480
   455
        val eq = HOLogic.mk_Trueprop (HOLogic.mk_eq (F,F2));
wenzelm@16973
   456
        val thm = Tactic.prove sg [] [] eq
wenzelm@16973
   457
          (K (simp_tac (Simplifier.inherit_bounds ss rearr_ss) 1));
skalberg@15531
   458
      in SOME ((conv RS (thm RS trans)) RS eq_reflection) end;
wenzelm@13114
   459
wenzelm@13462
   460
  in
wenzelm@13462
   461
    if list1 lastl andalso list1 lastr then rearr append1_eq_conv
wenzelm@13462
   462
    else if lastl aconv lastr then rearr append_same_eq
skalberg@15531
   463
    else NONE
wenzelm@13462
   464
  end;
wenzelm@13462
   465
wenzelm@13114
   466
in
wenzelm@13462
   467
wenzelm@13462
   468
val list_eq_simproc =
wenzelm@13462
   469
  Simplifier.simproc (Theory.sign_of (the_context ())) "list_eq" ["(xs::'a list) = ys"] list_eq;
wenzelm@13462
   470
wenzelm@13114
   471
end;
wenzelm@13114
   472
wenzelm@13114
   473
Addsimprocs [list_eq_simproc];
wenzelm@13114
   474
*}
wenzelm@13114
   475
wenzelm@13114
   476
nipkow@15392
   477
subsubsection {* @{text map} *}
wenzelm@13114
   478
wenzelm@13142
   479
lemma map_ext: "(!!x. x : set xs --> f x = g x) ==> map f xs = map g xs"
nipkow@13145
   480
by (induct xs) simp_all
wenzelm@13114
   481
wenzelm@13142
   482
lemma map_ident [simp]: "map (\<lambda>x. x) = (\<lambda>xs. xs)"
nipkow@13145
   483
by (rule ext, induct_tac xs) auto
wenzelm@13114
   484
wenzelm@13142
   485
lemma map_append [simp]: "map f (xs @ ys) = map f xs @ map f ys"
nipkow@13145
   486
by (induct xs) auto
wenzelm@13114
   487
wenzelm@13142
   488
lemma map_compose: "map (f o g) xs = map f (map g xs)"
nipkow@13145
   489
by (induct xs) (auto simp add: o_def)
wenzelm@13114
   490
wenzelm@13142
   491
lemma rev_map: "rev (map f xs) = map f (rev xs)"
nipkow@13145
   492
by (induct xs) auto
wenzelm@13114
   493
nipkow@13737
   494
lemma map_eq_conv[simp]: "(map f xs = map g xs) = (!x : set xs. f x = g x)"
nipkow@13737
   495
by (induct xs) auto
nipkow@13737
   496
wenzelm@13366
   497
lemma map_cong [recdef_cong]:
nipkow@13145
   498
"xs = ys ==> (!!x. x : set ys ==> f x = g x) ==> map f xs = map g ys"
nipkow@13145
   499
-- {* a congruence rule for @{text map} *}
nipkow@13737
   500
by simp
wenzelm@13114
   501
wenzelm@13142
   502
lemma map_is_Nil_conv [iff]: "(map f xs = []) = (xs = [])"
nipkow@13145
   503
by (cases xs) auto
wenzelm@13114
   504
wenzelm@13142
   505
lemma Nil_is_map_conv [iff]: "([] = map f xs) = (xs = [])"
nipkow@13145
   506
by (cases xs) auto
wenzelm@13114
   507
nipkow@14025
   508
lemma map_eq_Cons_conv[iff]:
nipkow@14025
   509
 "(map f xs = y#ys) = (\<exists>z zs. xs = z#zs \<and> f z = y \<and> map f zs = ys)"
nipkow@13145
   510
by (cases xs) auto
wenzelm@13114
   511
nipkow@14025
   512
lemma Cons_eq_map_conv[iff]:
nipkow@14025
   513
 "(x#xs = map f ys) = (\<exists>z zs. ys = z#zs \<and> x = f z \<and> xs = map f zs)"
nipkow@14025
   514
by (cases ys) auto
nipkow@14025
   515
nipkow@14111
   516
lemma ex_map_conv:
nipkow@14111
   517
  "(EX xs. ys = map f xs) = (ALL y : set ys. EX x. y = f x)"
nipkow@14111
   518
by(induct ys, auto)
nipkow@14111
   519
nipkow@15110
   520
lemma map_eq_imp_length_eq:
nipkow@15110
   521
  "!!xs. map f xs = map f ys ==> length xs = length ys"
nipkow@15110
   522
apply (induct ys)
nipkow@15110
   523
 apply simp
nipkow@15110
   524
apply(simp (no_asm_use))
nipkow@15110
   525
apply clarify
nipkow@15110
   526
apply(simp (no_asm_use))
nipkow@15110
   527
apply fast
nipkow@15110
   528
done
nipkow@15110
   529
nipkow@15110
   530
lemma map_inj_on:
nipkow@15110
   531
 "[| map f xs = map f ys; inj_on f (set xs Un set ys) |]
nipkow@15110
   532
  ==> xs = ys"
nipkow@15110
   533
apply(frule map_eq_imp_length_eq)
nipkow@15110
   534
apply(rotate_tac -1)
nipkow@15110
   535
apply(induct rule:list_induct2)
nipkow@15110
   536
 apply simp
nipkow@15110
   537
apply(simp)
nipkow@15110
   538
apply (blast intro:sym)
nipkow@15110
   539
done
nipkow@15110
   540
nipkow@15110
   541
lemma inj_on_map_eq_map:
nipkow@15110
   542
 "inj_on f (set xs Un set ys) \<Longrightarrow> (map f xs = map f ys) = (xs = ys)"
nipkow@15110
   543
by(blast dest:map_inj_on)
nipkow@15110
   544
wenzelm@13114
   545
lemma map_injective:
nipkow@14338
   546
 "!!xs. map f xs = map f ys ==> inj f ==> xs = ys"
nipkow@14338
   547
by (induct ys) (auto dest!:injD)
wenzelm@13114
   548
nipkow@14339
   549
lemma inj_map_eq_map[simp]: "inj f \<Longrightarrow> (map f xs = map f ys) = (xs = ys)"
nipkow@14339
   550
by(blast dest:map_injective)
nipkow@14339
   551
wenzelm@13114
   552
lemma inj_mapI: "inj f ==> inj (map f)"
nipkow@17589
   553
by (iprover dest: map_injective injD intro: inj_onI)
wenzelm@13114
   554
wenzelm@13114
   555
lemma inj_mapD: "inj (map f) ==> inj f"
paulson@14208
   556
apply (unfold inj_on_def, clarify)
nipkow@13145
   557
apply (erule_tac x = "[x]" in ballE)
paulson@14208
   558
 apply (erule_tac x = "[y]" in ballE, simp, blast)
nipkow@13145
   559
apply blast
nipkow@13145
   560
done
wenzelm@13114
   561
nipkow@14339
   562
lemma inj_map[iff]: "inj (map f) = inj f"
nipkow@13145
   563
by (blast dest: inj_mapD intro: inj_mapI)
wenzelm@13114
   564
nipkow@15303
   565
lemma inj_on_mapI: "inj_on f (\<Union>(set ` A)) \<Longrightarrow> inj_on (map f) A"
nipkow@15303
   566
apply(rule inj_onI)
nipkow@15303
   567
apply(erule map_inj_on)
nipkow@15303
   568
apply(blast intro:inj_onI dest:inj_onD)
nipkow@15303
   569
done
nipkow@15303
   570
kleing@14343
   571
lemma map_idI: "(\<And>x. x \<in> set xs \<Longrightarrow> f x = x) \<Longrightarrow> map f xs = xs"
kleing@14343
   572
by (induct xs, auto)
wenzelm@13114
   573
nipkow@14402
   574
lemma map_fun_upd [simp]: "y \<notin> set xs \<Longrightarrow> map (f(y:=v)) xs = map f xs"
nipkow@14402
   575
by (induct xs) auto
nipkow@14402
   576
nipkow@15110
   577
lemma map_fst_zip[simp]:
nipkow@15110
   578
  "length xs = length ys \<Longrightarrow> map fst (zip xs ys) = xs"
nipkow@15110
   579
by (induct rule:list_induct2, simp_all)
nipkow@15110
   580
nipkow@15110
   581
lemma map_snd_zip[simp]:
nipkow@15110
   582
  "length xs = length ys \<Longrightarrow> map snd (zip xs ys) = ys"
nipkow@15110
   583
by (induct rule:list_induct2, simp_all)
nipkow@15110
   584
nipkow@15110
   585
nipkow@15392
   586
subsubsection {* @{text rev} *}
wenzelm@13114
   587
wenzelm@13142
   588
lemma rev_append [simp]: "rev (xs @ ys) = rev ys @ rev xs"
nipkow@13145
   589
by (induct xs) auto
wenzelm@13114
   590
wenzelm@13142
   591
lemma rev_rev_ident [simp]: "rev (rev xs) = xs"
nipkow@13145
   592
by (induct xs) auto
wenzelm@13114
   593
kleing@15870
   594
lemma rev_swap: "(rev xs = ys) = (xs = rev ys)"
kleing@15870
   595
by auto
kleing@15870
   596
wenzelm@13142
   597
lemma rev_is_Nil_conv [iff]: "(rev xs = []) = (xs = [])"
nipkow@13145
   598
by (induct xs) auto
wenzelm@13114
   599
wenzelm@13142
   600
lemma Nil_is_rev_conv [iff]: "([] = rev xs) = (xs = [])"
nipkow@13145
   601
by (induct xs) auto
wenzelm@13114
   602
kleing@15870
   603
lemma rev_singleton_conv [simp]: "(rev xs = [x]) = (xs = [x])"
kleing@15870
   604
by (cases xs) auto
kleing@15870
   605
kleing@15870
   606
lemma singleton_rev_conv [simp]: "([x] = rev xs) = (xs = [x])"
kleing@15870
   607
by (cases xs) auto
kleing@15870
   608
wenzelm@13142
   609
lemma rev_is_rev_conv [iff]: "!!ys. (rev xs = rev ys) = (xs = ys)"
paulson@14208
   610
apply (induct xs, force)
paulson@14208
   611
apply (case_tac ys, simp, force)
nipkow@13145
   612
done
wenzelm@13114
   613
nipkow@15439
   614
lemma inj_on_rev[iff]: "inj_on rev A"
nipkow@15439
   615
by(simp add:inj_on_def)
nipkow@15439
   616
wenzelm@13366
   617
lemma rev_induct [case_names Nil snoc]:
wenzelm@13366
   618
  "[| P []; !!x xs. P xs ==> P (xs @ [x]) |] ==> P xs"
berghofe@15489
   619
apply(simplesubst rev_rev_ident[symmetric])
nipkow@13145
   620
apply(rule_tac list = "rev xs" in list.induct, simp_all)
nipkow@13145
   621
done
wenzelm@13114
   622
nipkow@13145
   623
ML {* val rev_induct_tac = induct_thm_tac (thm "rev_induct") *}-- "compatibility"
wenzelm@13114
   624
wenzelm@13366
   625
lemma rev_exhaust [case_names Nil snoc]:
wenzelm@13366
   626
  "(xs = [] ==> P) ==>(!!ys y. xs = ys @ [y] ==> P) ==> P"
nipkow@13145
   627
by (induct xs rule: rev_induct) auto
wenzelm@13114
   628
wenzelm@13366
   629
lemmas rev_cases = rev_exhaust
wenzelm@13366
   630
wenzelm@13114
   631
nipkow@15392
   632
subsubsection {* @{text set} *}
wenzelm@13114
   633
wenzelm@13142
   634
lemma finite_set [iff]: "finite (set xs)"
nipkow@13145
   635
by (induct xs) auto
wenzelm@13114
   636
wenzelm@13142
   637
lemma set_append [simp]: "set (xs @ ys) = (set xs \<union> set ys)"
nipkow@13145
   638
by (induct xs) auto
wenzelm@13114
   639
oheimb@14099
   640
lemma hd_in_set: "l = x#xs \<Longrightarrow> x\<in>set l"
paulson@14208
   641
by (case_tac l, auto)
oheimb@14099
   642
wenzelm@13142
   643
lemma set_subset_Cons: "set xs \<subseteq> set (x # xs)"
nipkow@13145
   644
by auto
wenzelm@13114
   645
oheimb@14099
   646
lemma set_ConsD: "y \<in> set (x # xs) \<Longrightarrow> y=x \<or> y \<in> set xs" 
oheimb@14099
   647
by auto
oheimb@14099
   648
wenzelm@13142
   649
lemma set_empty [iff]: "(set xs = {}) = (xs = [])"
nipkow@13145
   650
by (induct xs) auto
wenzelm@13114
   651
nipkow@15245
   652
lemma set_empty2[iff]: "({} = set xs) = (xs = [])"
nipkow@15245
   653
by(induct xs) auto
nipkow@15245
   654
wenzelm@13142
   655
lemma set_rev [simp]: "set (rev xs) = set xs"
nipkow@13145
   656
by (induct xs) auto
wenzelm@13114
   657
wenzelm@13142
   658
lemma set_map [simp]: "set (map f xs) = f`(set xs)"
nipkow@13145
   659
by (induct xs) auto
wenzelm@13114
   660
wenzelm@13142
   661
lemma set_filter [simp]: "set (filter P xs) = {x. x : set xs \<and> P x}"
nipkow@13145
   662
by (induct xs) auto
wenzelm@13114
   663
nipkow@15425
   664
lemma set_upt [simp]: "set[i..<j] = {k. i \<le> k \<and> k < j}"
paulson@14208
   665
apply (induct j, simp_all)
paulson@14208
   666
apply (erule ssubst, auto)
nipkow@13145
   667
done
wenzelm@13114
   668
wenzelm@13142
   669
lemma in_set_conv_decomp: "(x : set xs) = (\<exists>ys zs. xs = ys @ x # zs)"
paulson@15113
   670
proof (induct xs)
paulson@15113
   671
  case Nil show ?case by simp
paulson@15113
   672
  case (Cons a xs)
paulson@15113
   673
  show ?case
paulson@15113
   674
  proof 
paulson@15113
   675
    assume "x \<in> set (a # xs)"
paulson@15113
   676
    with prems show "\<exists>ys zs. a # xs = ys @ x # zs"
paulson@15113
   677
      by (simp, blast intro: Cons_eq_appendI)
paulson@15113
   678
  next
paulson@15113
   679
    assume "\<exists>ys zs. a # xs = ys @ x # zs"
paulson@15113
   680
    then obtain ys zs where eq: "a # xs = ys @ x # zs" by blast
paulson@15113
   681
    show "x \<in> set (a # xs)" 
paulson@15113
   682
      by (cases ys, auto simp add: eq)
paulson@15113
   683
  qed
paulson@15113
   684
qed
wenzelm@13142
   685
paulson@13508
   686
lemma finite_list: "finite A ==> EX l. set l = A"
paulson@13508
   687
apply (erule finite_induct, auto)
paulson@13508
   688
apply (rule_tac x="x#l" in exI, auto)
paulson@13508
   689
done
paulson@13508
   690
kleing@14388
   691
lemma card_length: "card (set xs) \<le> length xs"
kleing@14388
   692
by (induct xs) (auto simp add: card_insert_if)
wenzelm@13114
   693
paulson@15168
   694
nipkow@15392
   695
subsubsection {* @{text filter} *}
wenzelm@13114
   696
wenzelm@13142
   697
lemma filter_append [simp]: "filter P (xs @ ys) = filter P xs @ filter P ys"
nipkow@13145
   698
by (induct xs) auto
wenzelm@13114
   699
nipkow@15305
   700
lemma rev_filter: "rev (filter P xs) = filter P (rev xs)"
nipkow@15305
   701
by (induct xs) simp_all
nipkow@15305
   702
wenzelm@13142
   703
lemma filter_filter [simp]: "filter P (filter Q xs) = filter (\<lambda>x. Q x \<and> P x) xs"
nipkow@13145
   704
by (induct xs) auto
wenzelm@13114
   705
nipkow@16998
   706
lemma length_filter_le [simp]: "length (filter P xs) \<le> length xs"
nipkow@16998
   707
by (induct xs) (auto simp add: le_SucI)
nipkow@16998
   708
wenzelm@13142
   709
lemma filter_True [simp]: "\<forall>x \<in> set xs. P x ==> filter P xs = xs"
nipkow@13145
   710
by (induct xs) auto
wenzelm@13114
   711
wenzelm@13142
   712
lemma filter_False [simp]: "\<forall>x \<in> set xs. \<not> P x ==> filter P xs = []"
nipkow@13145
   713
by (induct xs) auto
wenzelm@13114
   714
nipkow@16998
   715
lemma filter_empty_conv: "(filter P xs = []) = (\<forall>x\<in>set xs. \<not> P x)" 
nipkow@16998
   716
  by (induct xs) simp_all
nipkow@16998
   717
nipkow@16998
   718
lemma filter_id_conv: "(filter P xs = xs) = (\<forall>x\<in>set xs. P x)"
nipkow@16998
   719
apply (induct xs)
nipkow@16998
   720
 apply auto
nipkow@16998
   721
apply(cut_tac P=P and xs=xs in length_filter_le)
nipkow@16998
   722
apply simp
nipkow@16998
   723
done
wenzelm@13114
   724
nipkow@16965
   725
lemma filter_map:
nipkow@16965
   726
  "filter P (map f xs) = map f (filter (P o f) xs)"
nipkow@16965
   727
by (induct xs) simp_all
nipkow@16965
   728
nipkow@16965
   729
lemma length_filter_map[simp]:
nipkow@16965
   730
  "length (filter P (map f xs)) = length(filter (P o f) xs)"
nipkow@16965
   731
by (simp add:filter_map)
nipkow@16965
   732
wenzelm@13142
   733
lemma filter_is_subset [simp]: "set (filter P xs) \<le> set xs"
nipkow@13145
   734
by auto
wenzelm@13114
   735
nipkow@15246
   736
lemma length_filter_less:
nipkow@15246
   737
  "\<lbrakk> x : set xs; ~ P x \<rbrakk> \<Longrightarrow> length(filter P xs) < length xs"
nipkow@15246
   738
proof (induct xs)
nipkow@15246
   739
  case Nil thus ?case by simp
nipkow@15246
   740
next
nipkow@15246
   741
  case (Cons x xs) thus ?case
nipkow@15246
   742
    apply (auto split:split_if_asm)
nipkow@15246
   743
    using length_filter_le[of P xs] apply arith
nipkow@15246
   744
  done
nipkow@15246
   745
qed
wenzelm@13114
   746
nipkow@15281
   747
lemma length_filter_conv_card:
nipkow@15281
   748
 "length(filter p xs) = card{i. i < length xs & p(xs!i)}"
nipkow@15281
   749
proof (induct xs)
nipkow@15281
   750
  case Nil thus ?case by simp
nipkow@15281
   751
next
nipkow@15281
   752
  case (Cons x xs)
nipkow@15281
   753
  let ?S = "{i. i < length xs & p(xs!i)}"
nipkow@15281
   754
  have fin: "finite ?S" by(fast intro: bounded_nat_set_is_finite)
nipkow@15281
   755
  show ?case (is "?l = card ?S'")
nipkow@15281
   756
  proof (cases)
nipkow@15281
   757
    assume "p x"
nipkow@15281
   758
    hence eq: "?S' = insert 0 (Suc ` ?S)"
nipkow@15281
   759
      by(auto simp add: nth_Cons image_def split:nat.split elim:lessE)
nipkow@15281
   760
    have "length (filter p (x # xs)) = Suc(card ?S)"
nipkow@15281
   761
      using Cons by simp
nipkow@15281
   762
    also have "\<dots> = Suc(card(Suc ` ?S))" using fin
nipkow@15281
   763
      by (simp add: card_image inj_Suc)
nipkow@15281
   764
    also have "\<dots> = card ?S'" using eq fin
nipkow@15281
   765
      by (simp add:card_insert_if) (simp add:image_def)
nipkow@15281
   766
    finally show ?thesis .
nipkow@15281
   767
  next
nipkow@15281
   768
    assume "\<not> p x"
nipkow@15281
   769
    hence eq: "?S' = Suc ` ?S"
nipkow@15281
   770
      by(auto simp add: nth_Cons image_def split:nat.split elim:lessE)
nipkow@15281
   771
    have "length (filter p (x # xs)) = card ?S"
nipkow@15281
   772
      using Cons by simp
nipkow@15281
   773
    also have "\<dots> = card(Suc ` ?S)" using fin
nipkow@15281
   774
      by (simp add: card_image inj_Suc)
nipkow@15281
   775
    also have "\<dots> = card ?S'" using eq fin
nipkow@15281
   776
      by (simp add:card_insert_if)
nipkow@15281
   777
    finally show ?thesis .
nipkow@15281
   778
  qed
nipkow@15281
   779
qed
nipkow@15281
   780
nipkow@17629
   781
lemma Cons_eq_filterD:
nipkow@17629
   782
 "x#xs = filter P ys \<Longrightarrow>
nipkow@17629
   783
  \<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
   784
  (concl is "\<exists>us vs. ?P ys us vs")
nipkow@17629
   785
proof(induct ys)
nipkow@17629
   786
  case Nil thus ?case by simp
nipkow@17629
   787
next
nipkow@17629
   788
  case (Cons y ys)
nipkow@17629
   789
  show ?case (is "\<exists>x. ?Q x")
nipkow@17629
   790
  proof cases
nipkow@17629
   791
    assume Py: "P y"
nipkow@17629
   792
    show ?thesis
nipkow@17629
   793
    proof cases
nipkow@17629
   794
      assume xy: "x = y"
nipkow@17629
   795
      show ?thesis
nipkow@17629
   796
      proof from Py xy Cons(2) show "?Q []" by simp qed
nipkow@17629
   797
    next
nipkow@17629
   798
      assume "x \<noteq> y" with Py Cons(2) show ?thesis by simp
nipkow@17629
   799
    qed
nipkow@17629
   800
  next
nipkow@17629
   801
    assume Py: "\<not> P y"
nipkow@17629
   802
    with Cons obtain us vs where 1 : "?P (y#ys) (y#us) vs" by fastsimp
nipkow@17629
   803
    show ?thesis (is "? us. ?Q us")
nipkow@17629
   804
    proof show "?Q (y#us)" using 1 by simp qed
nipkow@17629
   805
  qed
nipkow@17629
   806
qed
nipkow@17629
   807
nipkow@17629
   808
lemma filter_eq_ConsD:
nipkow@17629
   809
 "filter P ys = x#xs \<Longrightarrow>
nipkow@17629
   810
  \<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
   811
by(rule Cons_eq_filterD) simp
nipkow@17629
   812
nipkow@17629
   813
lemma filter_eq_Cons_iff:
nipkow@17629
   814
 "(filter P ys = x#xs) =
nipkow@17629
   815
  (\<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
   816
by(auto dest:filter_eq_ConsD)
nipkow@17629
   817
nipkow@17629
   818
lemma Cons_eq_filter_iff:
nipkow@17629
   819
 "(x#xs = filter P ys) =
nipkow@17629
   820
  (\<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
   821
by(auto dest:Cons_eq_filterD)
nipkow@17629
   822
nipkow@17501
   823
lemma filter_cong:
nipkow@17501
   824
 "xs = ys \<Longrightarrow> (\<And>x. x \<in> set ys \<Longrightarrow> P x = Q x) \<Longrightarrow> filter P xs = filter Q ys"
nipkow@17501
   825
apply simp
nipkow@17501
   826
apply(erule thin_rl)
nipkow@17501
   827
by (induct ys) simp_all
nipkow@17501
   828
nipkow@15281
   829
nipkow@15392
   830
subsubsection {* @{text concat} *}
wenzelm@13114
   831
wenzelm@13142
   832
lemma concat_append [simp]: "concat (xs @ ys) = concat xs @ concat ys"
nipkow@13145
   833
by (induct xs) auto
wenzelm@13114
   834
wenzelm@13142
   835
lemma concat_eq_Nil_conv [iff]: "(concat xss = []) = (\<forall>xs \<in> set xss. xs = [])"
nipkow@13145
   836
by (induct xss) auto
wenzelm@13114
   837
wenzelm@13142
   838
lemma Nil_eq_concat_conv [iff]: "([] = concat xss) = (\<forall>xs \<in> set xss. xs = [])"
nipkow@13145
   839
by (induct xss) auto
wenzelm@13114
   840
wenzelm@13142
   841
lemma set_concat [simp]: "set (concat xs) = \<Union>(set ` set xs)"
nipkow@13145
   842
by (induct xs) auto
wenzelm@13114
   843
wenzelm@13142
   844
lemma map_concat: "map f (concat xs) = concat (map (map f) xs)"
nipkow@13145
   845
by (induct xs) auto
wenzelm@13114
   846
wenzelm@13142
   847
lemma filter_concat: "filter p (concat xs) = concat (map (filter p) xs)"
nipkow@13145
   848
by (induct xs) auto
wenzelm@13114
   849
wenzelm@13142
   850
lemma rev_concat: "rev (concat xs) = concat (map rev (rev xs))"
nipkow@13145
   851
by (induct xs) auto
wenzelm@13114
   852
wenzelm@13114
   853
nipkow@15392
   854
subsubsection {* @{text nth} *}
wenzelm@13114
   855
wenzelm@13142
   856
lemma nth_Cons_0 [simp]: "(x # xs)!0 = x"
nipkow@13145
   857
by auto
wenzelm@13114
   858
wenzelm@13142
   859
lemma nth_Cons_Suc [simp]: "(x # xs)!(Suc n) = xs!n"
nipkow@13145
   860
by auto
wenzelm@13114
   861
wenzelm@13142
   862
declare nth.simps [simp del]
wenzelm@13114
   863
wenzelm@13114
   864
lemma nth_append:
nipkow@13145
   865
"!!n. (xs @ ys)!n = (if n < length xs then xs!n else ys!(n - length xs))"
paulson@14208
   866
apply (induct "xs", simp)
paulson@14208
   867
apply (case_tac n, auto)
nipkow@13145
   868
done
wenzelm@13114
   869
nipkow@14402
   870
lemma nth_append_length [simp]: "(xs @ x # ys) ! length xs = x"
nipkow@14402
   871
by (induct "xs") auto
nipkow@14402
   872
nipkow@14402
   873
lemma nth_append_length_plus[simp]: "(xs @ ys) ! (length xs + n) = ys ! n"
nipkow@14402
   874
by (induct "xs") auto
nipkow@14402
   875
wenzelm@13142
   876
lemma nth_map [simp]: "!!n. n < length xs ==> (map f xs)!n = f(xs!n)"
paulson@14208
   877
apply (induct xs, simp)
paulson@14208
   878
apply (case_tac n, auto)
nipkow@13145
   879
done
wenzelm@13114
   880
wenzelm@13142
   881
lemma set_conv_nth: "set xs = {xs!i | i. i < length xs}"
paulson@15251
   882
apply (induct xs, simp, simp)
nipkow@13145
   883
apply safe
paulson@14208
   884
apply (rule_tac x = 0 in exI, simp)
paulson@14208
   885
 apply (rule_tac x = "Suc i" in exI, simp)
paulson@14208
   886
apply (case_tac i, simp)
nipkow@13145
   887
apply (rename_tac j)
paulson@14208
   888
apply (rule_tac x = j in exI, simp)
nipkow@13145
   889
done
wenzelm@13114
   890
nipkow@17501
   891
lemma in_set_conv_nth: "(x \<in> set xs) = (\<exists>i < length xs. xs!i = x)"
nipkow@17501
   892
by(auto simp:set_conv_nth)
nipkow@17501
   893
nipkow@13145
   894
lemma list_ball_nth: "[| n < length xs; !x : set xs. P x|] ==> P(xs!n)"
nipkow@13145
   895
by (auto simp add: set_conv_nth)
wenzelm@13114
   896
wenzelm@13142
   897
lemma nth_mem [simp]: "n < length xs ==> xs!n : set xs"
nipkow@13145
   898
by (auto simp add: set_conv_nth)
wenzelm@13114
   899
wenzelm@13114
   900
lemma all_nth_imp_all_set:
nipkow@13145
   901
"[| !i < length xs. P(xs!i); x : set xs|] ==> P x"
nipkow@13145
   902
by (auto simp add: set_conv_nth)
wenzelm@13114
   903
wenzelm@13114
   904
lemma all_set_conv_all_nth:
nipkow@13145
   905
"(\<forall>x \<in> set xs. P x) = (\<forall>i. i < length xs --> P (xs ! i))"
nipkow@13145
   906
by (auto simp add: set_conv_nth)
wenzelm@13114
   907
wenzelm@13114
   908
nipkow@15392
   909
subsubsection {* @{text list_update} *}
wenzelm@13114
   910
wenzelm@13142
   911
lemma length_list_update [simp]: "!!i. length(xs[i:=x]) = length xs"
nipkow@13145
   912
by (induct xs) (auto split: nat.split)
wenzelm@13114
   913
wenzelm@13114
   914
lemma nth_list_update:
nipkow@13145
   915
"!!i j. i < length xs==> (xs[i:=x])!j = (if i = j then x else xs!j)"
nipkow@13145
   916
by (induct xs) (auto simp add: nth_Cons split: nat.split)
wenzelm@13114
   917
wenzelm@13142
   918
lemma nth_list_update_eq [simp]: "i < length xs ==> (xs[i:=x])!i = x"
nipkow@13145
   919
by (simp add: nth_list_update)
wenzelm@13114
   920
wenzelm@13142
   921
lemma nth_list_update_neq [simp]: "!!i j. i \<noteq> j ==> xs[i:=x]!j = xs!j"
nipkow@13145
   922
by (induct xs) (auto simp add: nth_Cons split: nat.split)
wenzelm@13114
   923
wenzelm@13142
   924
lemma list_update_overwrite [simp]:
nipkow@13145
   925
"!!i. i < size xs ==> xs[i:=x, i:=y] = xs[i:=y]"
nipkow@13145
   926
by (induct xs) (auto split: nat.split)
wenzelm@13114
   927
nipkow@14402
   928
lemma list_update_id[simp]: "!!i. i < length xs ==> xs[i := xs!i] = xs"
paulson@14208
   929
apply (induct xs, simp)
nipkow@14187
   930
apply(simp split:nat.splits)
nipkow@14187
   931
done
nipkow@14187
   932
nipkow@17501
   933
lemma list_update_beyond[simp]: "\<And>i. length xs \<le> i \<Longrightarrow> xs[i:=x] = xs"
nipkow@17501
   934
apply (induct xs)
nipkow@17501
   935
 apply simp
nipkow@17501
   936
apply (case_tac i)
nipkow@17501
   937
apply simp_all
nipkow@17501
   938
done
nipkow@17501
   939
wenzelm@13114
   940
lemma list_update_same_conv:
nipkow@13145
   941
"!!i. i < length xs ==> (xs[i := x] = xs) = (xs!i = x)"
nipkow@13145
   942
by (induct xs) (auto split: nat.split)
wenzelm@13114
   943
nipkow@14187
   944
lemma list_update_append1:
nipkow@14187
   945
 "!!i. i < size xs \<Longrightarrow> (xs @ ys)[i:=x] = xs[i:=x] @ ys"
paulson@14208
   946
apply (induct xs, simp)
nipkow@14187
   947
apply(simp split:nat.split)
nipkow@14187
   948
done
nipkow@14187
   949
kleing@15868
   950
lemma list_update_append:
kleing@15868
   951
  "!!n. (xs @ ys) [n:= x] = 
kleing@15868
   952
  (if n < length xs then xs[n:= x] @ ys else xs @ (ys [n-length xs:= x]))"
kleing@15868
   953
by (induct xs) (auto split:nat.splits)
kleing@15868
   954
nipkow@14402
   955
lemma list_update_length [simp]:
nipkow@14402
   956
 "(xs @ x # ys)[length xs := y] = (xs @ y # ys)"
nipkow@14402
   957
by (induct xs, auto)
nipkow@14402
   958
wenzelm@13114
   959
lemma update_zip:
nipkow@13145
   960
"!!i xy xs. length xs = length ys ==>
nipkow@13145
   961
(zip xs ys)[i:=xy] = zip (xs[i:=fst xy]) (ys[i:=snd xy])"
nipkow@13145
   962
by (induct ys) (auto, case_tac xs, auto split: nat.split)
wenzelm@13114
   963
wenzelm@13114
   964
lemma set_update_subset_insert: "!!i. set(xs[i:=x]) <= insert x (set xs)"
nipkow@13145
   965
by (induct xs) (auto split: nat.split)
wenzelm@13114
   966
wenzelm@13114
   967
lemma set_update_subsetI: "[| set xs <= A; x:A |] ==> set(xs[i := x]) <= A"
nipkow@13145
   968
by (blast dest!: set_update_subset_insert [THEN subsetD])
wenzelm@13114
   969
kleing@15868
   970
lemma set_update_memI: "!!n. n < length xs \<Longrightarrow> x \<in> set (xs[n := x])"
kleing@15868
   971
by (induct xs) (auto split:nat.splits)
kleing@15868
   972
wenzelm@13114
   973
nipkow@15392
   974
subsubsection {* @{text last} and @{text butlast} *}
wenzelm@13114
   975
wenzelm@13142
   976
lemma last_snoc [simp]: "last (xs @ [x]) = x"
nipkow@13145
   977
by (induct xs) auto
wenzelm@13114
   978
wenzelm@13142
   979
lemma butlast_snoc [simp]: "butlast (xs @ [x]) = xs"
nipkow@13145
   980
by (induct xs) auto
wenzelm@13114
   981
nipkow@14302
   982
lemma last_ConsL: "xs = [] \<Longrightarrow> last(x#xs) = x"
nipkow@14302
   983
by(simp add:last.simps)
nipkow@14302
   984
nipkow@14302
   985
lemma last_ConsR: "xs \<noteq> [] \<Longrightarrow> last(x#xs) = last xs"
nipkow@14302
   986
by(simp add:last.simps)
nipkow@14302
   987
nipkow@14302
   988
lemma last_append: "last(xs @ ys) = (if ys = [] then last xs else last ys)"
nipkow@14302
   989
by (induct xs) (auto)
nipkow@14302
   990
nipkow@14302
   991
lemma last_appendL[simp]: "ys = [] \<Longrightarrow> last(xs @ ys) = last xs"
nipkow@14302
   992
by(simp add:last_append)
nipkow@14302
   993
nipkow@14302
   994
lemma last_appendR[simp]: "ys \<noteq> [] \<Longrightarrow> last(xs @ ys) = last ys"
nipkow@14302
   995
by(simp add:last_append)
nipkow@14302
   996
nipkow@14302
   997
wenzelm@13142
   998
lemma length_butlast [simp]: "length (butlast xs) = length xs - 1"
nipkow@13145
   999
by (induct xs rule: rev_induct) auto
wenzelm@13114
  1000
wenzelm@13114
  1001
lemma butlast_append:
nipkow@13145
  1002
"!!ys. butlast (xs @ ys) = (if ys = [] then butlast xs else xs @ butlast ys)"
nipkow@13145
  1003
by (induct xs) auto
wenzelm@13114
  1004
wenzelm@13142
  1005
lemma append_butlast_last_id [simp]:
nipkow@13145
  1006
"xs \<noteq> [] ==> butlast xs @ [last xs] = xs"
nipkow@13145
  1007
by (induct xs) auto
wenzelm@13114
  1008
wenzelm@13142
  1009
lemma in_set_butlastD: "x : set (butlast xs) ==> x : set xs"
nipkow@13145
  1010
by (induct xs) (auto split: split_if_asm)
wenzelm@13114
  1011
wenzelm@13114
  1012
lemma in_set_butlast_appendI:
nipkow@13145
  1013
"x : set (butlast xs) | x : set (butlast ys) ==> x : set (butlast (xs @ ys))"
nipkow@13145
  1014
by (auto dest: in_set_butlastD simp add: butlast_append)
wenzelm@13114
  1015
nipkow@17501
  1016
lemma last_drop[simp]: "!!n. n < length xs \<Longrightarrow> last (drop n xs) = last xs"
nipkow@17501
  1017
apply (induct xs)
nipkow@17501
  1018
 apply simp
nipkow@17501
  1019
apply (auto split:nat.split)
nipkow@17501
  1020
done
nipkow@17501
  1021
nipkow@17589
  1022
lemma last_conv_nth: "xs\<noteq>[] \<Longrightarrow> last xs = xs!(length xs - 1)"
nipkow@17589
  1023
by(induct xs)(auto simp:neq_Nil_conv)
nipkow@17589
  1024
wenzelm@13142
  1025
nipkow@15392
  1026
subsubsection {* @{text take} and @{text drop} *}
wenzelm@13114
  1027
wenzelm@13142
  1028
lemma take_0 [simp]: "take 0 xs = []"
nipkow@13145
  1029
by (induct xs) auto
wenzelm@13114
  1030
wenzelm@13142
  1031
lemma drop_0 [simp]: "drop 0 xs = xs"
nipkow@13145
  1032
by (induct xs) auto
wenzelm@13114
  1033
wenzelm@13142
  1034
lemma take_Suc_Cons [simp]: "take (Suc n) (x # xs) = x # take n xs"
nipkow@13145
  1035
by simp
wenzelm@13114
  1036
wenzelm@13142
  1037
lemma drop_Suc_Cons [simp]: "drop (Suc n) (x # xs) = drop n xs"
nipkow@13145
  1038
by simp
wenzelm@13114
  1039
wenzelm@13142
  1040
declare take_Cons [simp del] and drop_Cons [simp del]
wenzelm@13114
  1041
nipkow@15110
  1042
lemma take_Suc: "xs ~= [] ==> take (Suc n) xs = hd xs # take n (tl xs)"
nipkow@15110
  1043
by(clarsimp simp add:neq_Nil_conv)
nipkow@15110
  1044
nipkow@14187
  1045
lemma drop_Suc: "drop (Suc n) xs = drop n (tl xs)"
nipkow@14187
  1046
by(cases xs, simp_all)
nipkow@14187
  1047
nipkow@14187
  1048
lemma drop_tl: "!!n. drop n (tl xs) = tl(drop n xs)"
nipkow@14187
  1049
by(induct xs, simp_all add:drop_Cons drop_Suc split:nat.split)
nipkow@14187
  1050
nipkow@14187
  1051
lemma nth_via_drop: "!!n. drop n xs = y#ys \<Longrightarrow> xs!n = y"
paulson@14208
  1052
apply (induct xs, simp)
nipkow@14187
  1053
apply(simp add:drop_Cons nth_Cons split:nat.splits)
nipkow@14187
  1054
done
nipkow@14187
  1055
nipkow@13913
  1056
lemma take_Suc_conv_app_nth:
nipkow@13913
  1057
 "!!i. i < length xs \<Longrightarrow> take (Suc i) xs = take i xs @ [xs!i]"
paulson@14208
  1058
apply (induct xs, simp)
paulson@14208
  1059
apply (case_tac i, auto)
nipkow@13913
  1060
done
nipkow@13913
  1061
mehta@14591
  1062
lemma drop_Suc_conv_tl:
mehta@14591
  1063
  "!!i. i < length xs \<Longrightarrow> (xs!i) # (drop (Suc i) xs) = drop i xs"
mehta@14591
  1064
apply (induct xs, simp)
mehta@14591
  1065
apply (case_tac i, auto)
mehta@14591
  1066
done
mehta@14591
  1067
wenzelm@13142
  1068
lemma length_take [simp]: "!!xs. length (take n xs) = min (length xs) n"
nipkow@13145
  1069
by (induct n) (auto, case_tac xs, auto)
wenzelm@13114
  1070
wenzelm@13142
  1071
lemma length_drop [simp]: "!!xs. length (drop n xs) = (length xs - n)"
nipkow@13145
  1072
by (induct n) (auto, case_tac xs, auto)
wenzelm@13114
  1073
wenzelm@13142
  1074
lemma take_all [simp]: "!!xs. length xs <= n ==> take n xs = xs"
nipkow@13145
  1075
by (induct n) (auto, case_tac xs, auto)
wenzelm@13114
  1076
wenzelm@13142
  1077
lemma drop_all [simp]: "!!xs. length xs <= n ==> drop n xs = []"
nipkow@13145
  1078
by (induct n) (auto, case_tac xs, auto)
wenzelm@13114
  1079
wenzelm@13142
  1080
lemma take_append [simp]:
nipkow@13145
  1081
"!!xs. take n (xs @ ys) = (take n xs @ take (n - length xs) ys)"
nipkow@13145
  1082
by (induct n) (auto, case_tac xs, auto)
wenzelm@13114
  1083
wenzelm@13142
  1084
lemma drop_append [simp]:
nipkow@13145
  1085
"!!xs. drop n (xs @ ys) = drop n xs @ drop (n - length xs) ys"
nipkow@13145
  1086
by (induct n) (auto, case_tac xs, auto)
wenzelm@13114
  1087
wenzelm@13142
  1088
lemma take_take [simp]: "!!xs n. take n (take m xs) = take (min n m) xs"
paulson@14208
  1089
apply (induct m, auto)
paulson@14208
  1090
apply (case_tac xs, auto)
nipkow@15236
  1091
apply (case_tac n, auto)
nipkow@13145
  1092
done
wenzelm@13114
  1093
wenzelm@13142
  1094
lemma drop_drop [simp]: "!!xs. drop n (drop m xs) = drop (n + m) xs"
paulson@14208
  1095
apply (induct m, auto)
paulson@14208
  1096
apply (case_tac xs, auto)
nipkow@13145
  1097
done
wenzelm@13114
  1098
wenzelm@13114
  1099
lemma take_drop: "!!xs n. take n (drop m xs) = drop m (take (n + m) xs)"
paulson@14208
  1100
apply (induct m, auto)
paulson@14208
  1101
apply (case_tac xs, auto)
nipkow@13145
  1102
done
wenzelm@13114
  1103
nipkow@14802
  1104
lemma drop_take: "!!m n. drop n (take m xs) = take (m-n) (drop n xs)"
nipkow@14802
  1105
apply(induct xs)
nipkow@14802
  1106
 apply simp
nipkow@14802
  1107
apply(simp add: take_Cons drop_Cons split:nat.split)
nipkow@14802
  1108
done
nipkow@14802
  1109
wenzelm@13142
  1110
lemma append_take_drop_id [simp]: "!!xs. take n xs @ drop n xs = xs"
paulson@14208
  1111
apply (induct n, auto)
paulson@14208
  1112
apply (case_tac xs, auto)
nipkow@13145
  1113
done
wenzelm@13114
  1114
nipkow@15110
  1115
lemma take_eq_Nil[simp]: "!!n. (take n xs = []) = (n = 0 \<or> xs = [])"
nipkow@15110
  1116
apply(induct xs)
nipkow@15110
  1117
 apply simp
nipkow@15110
  1118
apply(simp add:take_Cons split:nat.split)
nipkow@15110
  1119
done
nipkow@15110
  1120
nipkow@15110
  1121
lemma drop_eq_Nil[simp]: "!!n. (drop n xs = []) = (length xs <= n)"
nipkow@15110
  1122
apply(induct xs)
nipkow@15110
  1123
apply simp
nipkow@15110
  1124
apply(simp add:drop_Cons split:nat.split)
nipkow@15110
  1125
done
nipkow@15110
  1126
wenzelm@13114
  1127
lemma take_map: "!!xs. take n (map f xs) = map f (take n xs)"
paulson@14208
  1128
apply (induct n, auto)
paulson@14208
  1129
apply (case_tac xs, auto)
nipkow@13145
  1130
done
wenzelm@13114
  1131
wenzelm@13142
  1132
lemma drop_map: "!!xs. drop n (map f xs) = map f (drop n xs)"
paulson@14208
  1133
apply (induct n, auto)
paulson@14208
  1134
apply (case_tac xs, auto)
nipkow@13145
  1135
done
wenzelm@13114
  1136
wenzelm@13114
  1137
lemma rev_take: "!!i. rev (take i xs) = drop (length xs - i) (rev xs)"
paulson@14208
  1138
apply (induct xs, auto)
paulson@14208
  1139
apply (case_tac i, auto)
nipkow@13145
  1140
done
wenzelm@13114
  1141
wenzelm@13114
  1142
lemma rev_drop: "!!i. rev (drop i xs) = take (length xs - i) (rev xs)"
paulson@14208
  1143
apply (induct xs, auto)
paulson@14208
  1144
apply (case_tac i, auto)
nipkow@13145
  1145
done
wenzelm@13114
  1146
wenzelm@13142
  1147
lemma nth_take [simp]: "!!n i. i < n ==> (take n xs)!i = xs!i"
paulson@14208
  1148
apply (induct xs, auto)
paulson@14208
  1149
apply (case_tac n, blast)
paulson@14208
  1150
apply (case_tac i, auto)
nipkow@13145
  1151
done
wenzelm@13114
  1152
wenzelm@13142
  1153
lemma nth_drop [simp]:
nipkow@13145
  1154
"!!xs i. n + i <= length xs ==> (drop n xs)!i = xs!(n + i)"
paulson@14208
  1155
apply (induct n, auto)
paulson@14208
  1156
apply (case_tac xs, auto)
nipkow@13145
  1157
done
nipkow@3507
  1158
nipkow@14025
  1159
lemma set_take_subset: "\<And>n. set(take n xs) \<subseteq> set xs"
nipkow@14025
  1160
by(induct xs)(auto simp:take_Cons split:nat.split)
nipkow@14025
  1161
nipkow@14025
  1162
lemma set_drop_subset: "\<And>n. set(drop n xs) \<subseteq> set xs"
nipkow@14025
  1163
by(induct xs)(auto simp:drop_Cons split:nat.split)
nipkow@14025
  1164
nipkow@14187
  1165
lemma in_set_takeD: "x : set(take n xs) \<Longrightarrow> x : set xs"
nipkow@14187
  1166
using set_take_subset by fast
nipkow@14187
  1167
nipkow@14187
  1168
lemma in_set_dropD: "x : set(drop n xs) \<Longrightarrow> x : set xs"
nipkow@14187
  1169
using set_drop_subset by fast
nipkow@14187
  1170
wenzelm@13114
  1171
lemma append_eq_conv_conj:
nipkow@13145
  1172
"!!zs. (xs @ ys = zs) = (xs = take (length xs) zs \<and> ys = drop (length xs) zs)"
paulson@14208
  1173
apply (induct xs, simp, clarsimp)
paulson@14208
  1174
apply (case_tac zs, auto)
nipkow@13145
  1175
done
wenzelm@13142
  1176
paulson@14050
  1177
lemma take_add [rule_format]: 
paulson@14050
  1178
    "\<forall>i. i+j \<le> length(xs) --> take (i+j) xs = take i xs @ take j (drop i xs)"
paulson@14050
  1179
apply (induct xs, auto) 
paulson@14050
  1180
apply (case_tac i, simp_all) 
paulson@14050
  1181
done
paulson@14050
  1182
nipkow@14300
  1183
lemma append_eq_append_conv_if:
nipkow@14300
  1184
 "!! ys\<^isub>1. (xs\<^isub>1 @ xs\<^isub>2 = ys\<^isub>1 @ ys\<^isub>2) =
nipkow@14300
  1185
  (if size xs\<^isub>1 \<le> size ys\<^isub>1
nipkow@14300
  1186
   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
  1187
   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@14300
  1188
apply(induct xs\<^isub>1)
nipkow@14300
  1189
 apply simp
nipkow@14300
  1190
apply(case_tac ys\<^isub>1)
nipkow@14300
  1191
apply simp_all
nipkow@14300
  1192
done
nipkow@14300
  1193
nipkow@15110
  1194
lemma take_hd_drop:
nipkow@15110
  1195
  "!!n. n < length xs \<Longrightarrow> take n xs @ [hd (drop n xs)] = take (n+1) xs"
nipkow@15110
  1196
apply(induct xs)
nipkow@15110
  1197
apply simp
nipkow@15110
  1198
apply(simp add:drop_Cons split:nat.split)
nipkow@15110
  1199
done
nipkow@15110
  1200
nipkow@17501
  1201
lemma id_take_nth_drop:
nipkow@17501
  1202
 "i < length xs \<Longrightarrow> xs = take i xs @ xs!i # drop (Suc i) xs" 
nipkow@17501
  1203
proof -
nipkow@17501
  1204
  assume si: "i < length xs"
nipkow@17501
  1205
  hence "xs = take (Suc i) xs @ drop (Suc i) xs" by auto
nipkow@17501
  1206
  moreover
nipkow@17501
  1207
  from si have "take (Suc i) xs = take i xs @ [xs!i]"
nipkow@17501
  1208
    apply (rule_tac take_Suc_conv_app_nth) by arith
nipkow@17501
  1209
  ultimately show ?thesis by auto
nipkow@17501
  1210
qed
nipkow@17501
  1211
  
nipkow@17501
  1212
lemma upd_conv_take_nth_drop:
nipkow@17501
  1213
 "i < length xs \<Longrightarrow> xs[i:=a] = take i xs @ a # drop (Suc i) xs"
nipkow@17501
  1214
proof -
nipkow@17501
  1215
  assume i: "i < length xs"
nipkow@17501
  1216
  have "xs[i:=a] = (take i xs @ xs!i # drop (Suc i) xs)[i:=a]"
nipkow@17501
  1217
    by(rule arg_cong[OF id_take_nth_drop[OF i]])
nipkow@17501
  1218
  also have "\<dots> = take i xs @ a # drop (Suc i) xs"
nipkow@17501
  1219
    using i by (simp add: list_update_append)
nipkow@17501
  1220
  finally show ?thesis .
nipkow@17501
  1221
qed
nipkow@17501
  1222
wenzelm@13114
  1223
nipkow@15392
  1224
subsubsection {* @{text takeWhile} and @{text dropWhile} *}
wenzelm@13114
  1225
wenzelm@13142
  1226
lemma takeWhile_dropWhile_id [simp]: "takeWhile P xs @ dropWhile P xs = xs"
nipkow@13145
  1227
by (induct xs) auto
wenzelm@13114
  1228
wenzelm@13142
  1229
lemma takeWhile_append1 [simp]:
nipkow@13145
  1230
"[| x:set xs; ~P(x)|] ==> takeWhile P (xs @ ys) = takeWhile P xs"
nipkow@13145
  1231
by (induct xs) auto
wenzelm@13114
  1232
wenzelm@13142
  1233
lemma takeWhile_append2 [simp]:
nipkow@13145
  1234
"(!!x. x : set xs ==> P x) ==> takeWhile P (xs @ ys) = xs @ takeWhile P ys"
nipkow@13145
  1235
by (induct xs) auto
wenzelm@13114
  1236
wenzelm@13142
  1237
lemma takeWhile_tail: "\<not> P x ==> takeWhile P (xs @ (x#l)) = takeWhile P xs"
nipkow@13145
  1238
by (induct xs) auto
wenzelm@13114
  1239
wenzelm@13142
  1240
lemma dropWhile_append1 [simp]:
nipkow@13145
  1241
"[| x : set xs; ~P(x)|] ==> dropWhile P (xs @ ys) = (dropWhile P xs)@ys"
nipkow@13145
  1242
by (induct xs) auto
wenzelm@13114
  1243
wenzelm@13142
  1244
lemma dropWhile_append2 [simp]:
nipkow@13145
  1245
"(!!x. x:set xs ==> P(x)) ==> dropWhile P (xs @ ys) = dropWhile P ys"
nipkow@13145
  1246
by (induct xs) auto
wenzelm@13114
  1247
wenzelm@13142
  1248
lemma set_take_whileD: "x : set (takeWhile P xs) ==> x : set xs \<and> P x"
nipkow@13145
  1249
by (induct xs) (auto split: split_if_asm)
wenzelm@13114
  1250
nipkow@13913
  1251
lemma takeWhile_eq_all_conv[simp]:
nipkow@13913
  1252
 "(takeWhile P xs = xs) = (\<forall>x \<in> set xs. P x)"
nipkow@13913
  1253
by(induct xs, auto)
nipkow@13913
  1254
nipkow@13913
  1255
lemma dropWhile_eq_Nil_conv[simp]:
nipkow@13913
  1256
 "(dropWhile P xs = []) = (\<forall>x \<in> set xs. P x)"
nipkow@13913
  1257
by(induct xs, auto)
nipkow@13913
  1258
nipkow@13913
  1259
lemma dropWhile_eq_Cons_conv:
nipkow@13913
  1260
 "(dropWhile P xs = y#ys) = (xs = takeWhile P xs @ y # ys & \<not> P y)"
nipkow@13913
  1261
by(induct xs, auto)
nipkow@13913
  1262
nipkow@17501
  1263
text{* The following two lemmmas could be generalized to an arbitrary
nipkow@17501
  1264
property. *}
nipkow@17501
  1265
nipkow@17501
  1266
lemma takeWhile_neq_rev: "\<lbrakk>distinct xs; x \<in> set xs\<rbrakk> \<Longrightarrow>
nipkow@17501
  1267
 takeWhile (\<lambda>y. y \<noteq> x) (rev xs) = rev (tl (dropWhile (\<lambda>y. y \<noteq> x) xs))"
nipkow@17501
  1268
by(induct xs) (auto simp: takeWhile_tail[where l="[]"])
nipkow@17501
  1269
nipkow@17501
  1270
lemma dropWhile_neq_rev: "\<lbrakk>distinct xs; x \<in> set xs\<rbrakk> \<Longrightarrow>
nipkow@17501
  1271
  dropWhile (\<lambda>y. y \<noteq> x) (rev xs) = x # rev (takeWhile (\<lambda>y. y \<noteq> x) xs)"
nipkow@17501
  1272
apply(induct xs)
nipkow@17501
  1273
 apply simp
nipkow@17501
  1274
apply auto
nipkow@17501
  1275
apply(subst dropWhile_append2)
nipkow@17501
  1276
apply auto
nipkow@17501
  1277
done
nipkow@17501
  1278
wenzelm@13114
  1279
nipkow@15392
  1280
subsubsection {* @{text zip} *}
wenzelm@13114
  1281
wenzelm@13142
  1282
lemma zip_Nil [simp]: "zip [] ys = []"
nipkow@13145
  1283
by (induct ys) auto
wenzelm@13114
  1284
wenzelm@13142
  1285
lemma zip_Cons_Cons [simp]: "zip (x # xs) (y # ys) = (x, y) # zip xs ys"
nipkow@13145
  1286
by simp
wenzelm@13114
  1287
wenzelm@13142
  1288
declare zip_Cons [simp del]
wenzelm@13114
  1289
nipkow@15281
  1290
lemma zip_Cons1:
nipkow@15281
  1291
 "zip (x#xs) ys = (case ys of [] \<Rightarrow> [] | y#ys \<Rightarrow> (x,y)#zip xs ys)"
nipkow@15281
  1292
by(auto split:list.split)
nipkow@15281
  1293
wenzelm@13142
  1294
lemma length_zip [simp]:
nipkow@13145
  1295
"!!xs. length (zip xs ys) = min (length xs) (length ys)"
paulson@14208
  1296
apply (induct ys, simp)
paulson@14208
  1297
apply (case_tac xs, auto)
nipkow@13145
  1298
done
wenzelm@13114
  1299
wenzelm@13114
  1300
lemma zip_append1:
nipkow@13145
  1301
"!!xs. zip (xs @ ys) zs =
nipkow@13145
  1302
zip xs (take (length xs) zs) @ zip ys (drop (length xs) zs)"
paulson@14208
  1303
apply (induct zs, simp)
paulson@14208
  1304
apply (case_tac xs, simp_all)
nipkow@13145
  1305
done
wenzelm@13114
  1306
wenzelm@13114
  1307
lemma zip_append2:
nipkow@13145
  1308
"!!ys. zip xs (ys @ zs) =
nipkow@13145
  1309
zip (take (length ys) xs) ys @ zip (drop (length ys) xs) zs"
paulson@14208
  1310
apply (induct xs, simp)
paulson@14208
  1311
apply (case_tac ys, simp_all)
nipkow@13145
  1312
done
wenzelm@13114
  1313
wenzelm@13142
  1314
lemma zip_append [simp]:
wenzelm@13142
  1315
 "[| length xs = length us; length ys = length vs |] ==>
nipkow@13145
  1316
zip (xs@ys) (us@vs) = zip xs us @ zip ys vs"
nipkow@13145
  1317
by (simp add: zip_append1)
wenzelm@13114
  1318
wenzelm@13114
  1319
lemma zip_rev:
nipkow@14247
  1320
"length xs = length ys ==> zip (rev xs) (rev ys) = rev (zip xs ys)"
nipkow@14247
  1321
by (induct rule:list_induct2, simp_all)
wenzelm@13114
  1322
wenzelm@13142
  1323
lemma nth_zip [simp]:
nipkow@13145
  1324
"!!i xs. [| i < length xs; i < length ys|] ==> (zip xs ys)!i = (xs!i, ys!i)"
paulson@14208
  1325
apply (induct ys, simp)
nipkow@13145
  1326
apply (case_tac xs)
nipkow@13145
  1327
 apply (simp_all add: nth.simps split: nat.split)
nipkow@13145
  1328
done
wenzelm@13114
  1329
wenzelm@13114
  1330
lemma set_zip:
nipkow@13145
  1331
"set (zip xs ys) = {(xs!i, ys!i) | i. i < min (length xs) (length ys)}"
nipkow@13145
  1332
by (simp add: set_conv_nth cong: rev_conj_cong)
wenzelm@13114
  1333
wenzelm@13114
  1334
lemma zip_update:
nipkow@13145
  1335
"length xs = length ys ==> zip (xs[i:=x]) (ys[i:=y]) = (zip xs ys)[i:=(x,y)]"
nipkow@13145
  1336
by (rule sym, simp add: update_zip)
wenzelm@13114
  1337
wenzelm@13142
  1338
lemma zip_replicate [simp]:
nipkow@13145
  1339
"!!j. zip (replicate i x) (replicate j y) = replicate (min i j) (x,y)"
paulson@14208
  1340
apply (induct i, auto)
paulson@14208
  1341
apply (case_tac j, auto)
nipkow@13145
  1342
done
wenzelm@13114
  1343
wenzelm@13142
  1344
nipkow@15392
  1345
subsubsection {* @{text list_all2} *}
wenzelm@13114
  1346
kleing@14316
  1347
lemma list_all2_lengthD [intro?]: 
kleing@14316
  1348
  "list_all2 P xs ys ==> length xs = length ys"
nipkow@13145
  1349
by (simp add: list_all2_def)
wenzelm@13114
  1350
nipkow@17090
  1351
lemma list_all2_Nil [iff,code]: "list_all2 P [] ys = (ys = [])"
nipkow@13145
  1352
by (simp add: list_all2_def)
wenzelm@13114
  1353
wenzelm@13142
  1354
lemma list_all2_Nil2[iff]: "list_all2 P xs [] = (xs = [])"
nipkow@13145
  1355
by (simp add: list_all2_def)
wenzelm@13114
  1356
nipkow@17090
  1357
lemma list_all2_Cons [iff,code]:
nipkow@13145
  1358
"list_all2 P (x # xs) (y # ys) = (P x y \<and> list_all2 P xs ys)"
nipkow@13145
  1359
by (auto simp add: list_all2_def)
wenzelm@13114
  1360
wenzelm@13114
  1361
lemma list_all2_Cons1:
nipkow@13145
  1362
"list_all2 P (x # xs) ys = (\<exists>z zs. ys = z # zs \<and> P x z \<and> list_all2 P xs zs)"
nipkow@13145
  1363
by (cases ys) auto
wenzelm@13114
  1364
wenzelm@13114
  1365
lemma list_all2_Cons2:
nipkow@13145
  1366
"list_all2 P xs (y # ys) = (\<exists>z zs. xs = z # zs \<and> P z y \<and> list_all2 P zs ys)"
nipkow@13145
  1367
by (cases xs) auto
wenzelm@13114
  1368
wenzelm@13142
  1369
lemma list_all2_rev [iff]:
nipkow@13145
  1370
"list_all2 P (rev xs) (rev ys) = list_all2 P xs ys"
nipkow@13145
  1371
by (simp add: list_all2_def zip_rev cong: conj_cong)
wenzelm@13114
  1372
kleing@13863
  1373
lemma list_all2_rev1:
kleing@13863
  1374
"list_all2 P (rev xs) ys = list_all2 P xs (rev ys)"
kleing@13863
  1375
by (subst list_all2_rev [symmetric]) simp
kleing@13863
  1376
wenzelm@13114
  1377
lemma list_all2_append1:
nipkow@13145
  1378
"list_all2 P (xs @ ys) zs =
nipkow@13145
  1379
(EX us vs. zs = us @ vs \<and> length us = length xs \<and> length vs = length ys \<and>
nipkow@13145
  1380
list_all2 P xs us \<and> list_all2 P ys vs)"
nipkow@13145
  1381
apply (simp add: list_all2_def zip_append1)
nipkow@13145
  1382
apply (rule iffI)
nipkow@13145
  1383
 apply (rule_tac x = "take (length xs) zs" in exI)
nipkow@13145
  1384
 apply (rule_tac x = "drop (length xs) zs" in exI)
paulson@14208
  1385
 apply (force split: nat_diff_split simp add: min_def, clarify)
nipkow@13145
  1386
apply (simp add: ball_Un)
nipkow@13145
  1387
done
wenzelm@13114
  1388
wenzelm@13114
  1389
lemma list_all2_append2:
nipkow@13145
  1390
"list_all2 P xs (ys @ zs) =
nipkow@13145
  1391
(EX us vs. xs = us @ vs \<and> length us = length ys \<and> length vs = length zs \<and>
nipkow@13145
  1392
list_all2 P us ys \<and> list_all2 P vs zs)"
nipkow@13145
  1393
apply (simp add: list_all2_def zip_append2)
nipkow@13145
  1394
apply (rule iffI)
nipkow@13145
  1395
 apply (rule_tac x = "take (length ys) xs" in exI)
nipkow@13145
  1396
 apply (rule_tac x = "drop (length ys) xs" in exI)
paulson@14208
  1397
 apply (force split: nat_diff_split simp add: min_def, clarify)
nipkow@13145
  1398
apply (simp add: ball_Un)
nipkow@13145
  1399
done
wenzelm@13114
  1400
kleing@13863
  1401
lemma list_all2_append:
nipkow@14247
  1402
  "length xs = length ys \<Longrightarrow>
nipkow@14247
  1403
  list_all2 P (xs@us) (ys@vs) = (list_all2 P xs ys \<and> list_all2 P us vs)"
nipkow@14247
  1404
by (induct rule:list_induct2, simp_all)
kleing@13863
  1405
kleing@13863
  1406
lemma list_all2_appendI [intro?, trans]:
kleing@13863
  1407
  "\<lbrakk> list_all2 P a b; list_all2 P c d \<rbrakk> \<Longrightarrow> list_all2 P (a@c) (b@d)"
kleing@13863
  1408
  by (simp add: list_all2_append list_all2_lengthD)
kleing@13863
  1409
wenzelm@13114
  1410
lemma list_all2_conv_all_nth:
nipkow@13145
  1411
"list_all2 P xs ys =
nipkow@13145
  1412
(length xs = length ys \<and> (\<forall>i < length xs. P (xs!i) (ys!i)))"
nipkow@13145
  1413
by (force simp add: list_all2_def set_zip)
wenzelm@13114
  1414
berghofe@13883
  1415
lemma list_all2_trans:
berghofe@13883
  1416
  assumes tr: "!!a b c. P1 a b ==> P2 b c ==> P3 a c"
berghofe@13883
  1417
  shows "!!bs cs. list_all2 P1 as bs ==> list_all2 P2 bs cs ==> list_all2 P3 as cs"
berghofe@13883
  1418
        (is "!!bs cs. PROP ?Q as bs cs")
berghofe@13883
  1419
proof (induct as)
berghofe@13883
  1420
  fix x xs bs assume I1: "!!bs cs. PROP ?Q xs bs cs"
berghofe@13883
  1421
  show "!!cs. PROP ?Q (x # xs) bs cs"
berghofe@13883
  1422
  proof (induct bs)
berghofe@13883
  1423
    fix y ys cs assume I2: "!!cs. PROP ?Q (x # xs) ys cs"
berghofe@13883
  1424
    show "PROP ?Q (x # xs) (y # ys) cs"
berghofe@13883
  1425
      by (induct cs) (auto intro: tr I1 I2)
berghofe@13883
  1426
  qed simp
berghofe@13883
  1427
qed simp
berghofe@13883
  1428
kleing@13863
  1429
lemma list_all2_all_nthI [intro?]:
kleing@13863
  1430
  "length a = length b \<Longrightarrow> (\<And>n. n < length a \<Longrightarrow> P (a!n) (b!n)) \<Longrightarrow> list_all2 P a b"
kleing@13863
  1431
  by (simp add: list_all2_conv_all_nth)
kleing@13863
  1432
paulson@14395
  1433
lemma list_all2I:
paulson@14395
  1434
  "\<forall>x \<in> set (zip a b). split P x \<Longrightarrow> length a = length b \<Longrightarrow> list_all2 P a b"
paulson@14395
  1435
  by (simp add: list_all2_def)
paulson@14395
  1436
kleing@14328
  1437
lemma list_all2_nthD:
kleing@13863
  1438
  "\<lbrakk> list_all2 P xs ys; p < size xs \<rbrakk> \<Longrightarrow> P (xs!p) (ys!p)"
kleing@13863
  1439
  by (simp add: list_all2_conv_all_nth)
kleing@13863
  1440
nipkow@14302
  1441
lemma list_all2_nthD2:
nipkow@14302
  1442
  "\<lbrakk>list_all2 P xs ys; p < size ys\<rbrakk> \<Longrightarrow> P (xs!p) (ys!p)"
nipkow@14302
  1443
  by (frule list_all2_lengthD) (auto intro: list_all2_nthD)
nipkow@14302
  1444
kleing@13863
  1445
lemma list_all2_map1: 
kleing@13863
  1446
  "list_all2 P (map f as) bs = list_all2 (\<lambda>x y. P (f x) y) as bs"
kleing@13863
  1447
  by (simp add: list_all2_conv_all_nth)
kleing@13863
  1448
kleing@13863
  1449
lemma list_all2_map2: 
kleing@13863
  1450
  "list_all2 P as (map f bs) = list_all2 (\<lambda>x y. P x (f y)) as bs"
kleing@13863
  1451
  by (auto simp add: list_all2_conv_all_nth)
kleing@13863
  1452
kleing@14316
  1453
lemma list_all2_refl [intro?]:
kleing@13863
  1454
  "(\<And>x. P x x) \<Longrightarrow> list_all2 P xs xs"
kleing@13863
  1455
  by (simp add: list_all2_conv_all_nth)
kleing@13863
  1456
kleing@13863
  1457
lemma list_all2_update_cong:
kleing@13863
  1458
  "\<lbrakk> i<size xs; list_all2 P xs ys; P x y \<rbrakk> \<Longrightarrow> list_all2 P (xs[i:=x]) (ys[i:=y])"
kleing@13863
  1459
  by (simp add: list_all2_conv_all_nth nth_list_update)
kleing@13863
  1460
kleing@13863
  1461
lemma list_all2_update_cong2:
kleing@13863
  1462
  "\<lbrakk>list_all2 P xs ys; P x y; i < length ys\<rbrakk> \<Longrightarrow> list_all2 P (xs[i:=x]) (ys[i:=y])"
kleing@13863
  1463
  by (simp add: list_all2_lengthD list_all2_update_cong)
kleing@13863
  1464
nipkow@14302
  1465
lemma list_all2_takeI [simp,intro?]:
nipkow@14302
  1466
  "\<And>n ys. list_all2 P xs ys \<Longrightarrow> list_all2 P (take n xs) (take n ys)"
nipkow@14302
  1467
  apply (induct xs)
nipkow@14302
  1468
   apply simp
nipkow@14302
  1469
  apply (clarsimp simp add: list_all2_Cons1)
nipkow@14302
  1470
  apply (case_tac n)
nipkow@14302
  1471
  apply auto
nipkow@14302
  1472
  done
nipkow@14302
  1473
nipkow@14302
  1474
lemma list_all2_dropI [simp,intro?]:
kleing@13863
  1475
  "\<And>n bs. list_all2 P as bs \<Longrightarrow> list_all2 P (drop n as) (drop n bs)"
paulson@14208
  1476
  apply (induct as, simp)
kleing@13863
  1477
  apply (clarsimp simp add: list_all2_Cons1)
paulson@14208
  1478
  apply (case_tac n, simp, simp)
kleing@13863
  1479
  done
kleing@13863
  1480
kleing@14327
  1481
lemma list_all2_mono [intro?]:
kleing@13863
  1482
  "\<And>y. list_all2 P x y \<Longrightarrow> (\<And>x y. P x y \<Longrightarrow> Q x y) \<Longrightarrow> list_all2 Q x y"
paulson@14208
  1483
  apply (induct x, simp)
paulson@14208
  1484
  apply (case_tac y, auto)
kleing@13863
  1485
  done
kleing@13863
  1486
wenzelm@13142
  1487
nipkow@15392
  1488
subsubsection {* @{text foldl} and @{text foldr} *}
wenzelm@13142
  1489
wenzelm@13142
  1490
lemma foldl_append [simp]:
nipkow@13145
  1491
"!!a. foldl f a (xs @ ys) = foldl f (foldl f a xs) ys"
nipkow@13145
  1492
by (induct xs) auto
wenzelm@13142
  1493
nipkow@14402
  1494
lemma foldr_append[simp]: "foldr f (xs @ ys) a = foldr f xs (foldr f ys a)"
nipkow@14402
  1495
by (induct xs) auto
nipkow@14402
  1496
nipkow@14402
  1497
lemma foldr_foldl: "foldr f xs a = foldl (%x y. f y x) a (rev xs)"
nipkow@14402
  1498
by (induct xs) auto
nipkow@14402
  1499
nipkow@14402
  1500
lemma foldl_foldr: "foldl f a xs = foldr (%x y. f y x) (rev xs) a"
nipkow@14402
  1501
by (simp add: foldr_foldl [of "%x y. f y x" "rev xs"])
nipkow@14402
  1502
wenzelm@13142
  1503
text {*
nipkow@13145
  1504
Note: @{text "n \<le> foldl (op +) n ns"} looks simpler, but is more
nipkow@13145
  1505
difficult to use because it requires an additional transitivity step.
wenzelm@13142
  1506
*}
wenzelm@13142
  1507
wenzelm@13142
  1508
lemma start_le_sum: "!!n::nat. m <= n ==> m <= foldl (op +) n ns"
nipkow@13145
  1509
by (induct ns) auto
wenzelm@13142
  1510
wenzelm@13142
  1511
lemma elem_le_sum: "!!n::nat. n : set ns ==> n <= foldl (op +) 0 ns"
nipkow@13145
  1512
by (force intro: start_le_sum simp add: in_set_conv_decomp)
wenzelm@13142
  1513
wenzelm@13142
  1514
lemma sum_eq_0_conv [iff]:
nipkow@13145
  1515
"!!m::nat. (foldl (op +) m ns = 0) = (m = 0 \<and> (\<forall>n \<in> set ns. n = 0))"
nipkow@13145
  1516
by (induct ns) auto
wenzelm@13114
  1517
wenzelm@13114
  1518
nipkow@15392
  1519
subsubsection {* @{text upto} *}
wenzelm@13114
  1520
nipkow@17090
  1521
lemma upt_rec[code]: "[i..<j] = (if i<j then i#[Suc i..<j] else [])"
nipkow@17090
  1522
-- {* simp does not terminate! *}
nipkow@13145
  1523
by (induct j) auto
wenzelm@13142
  1524
nipkow@15425
  1525
lemma upt_conv_Nil [simp]: "j <= i ==> [i..<j] = []"
nipkow@13145
  1526
by (subst upt_rec) simp
wenzelm@13114
  1527
nipkow@15425
  1528
lemma upt_eq_Nil_conv[simp]: "([i..<j] = []) = (j = 0 \<or> j <= i)"
nipkow@15281
  1529
by(induct j)simp_all
nipkow@15281
  1530
nipkow@15281
  1531
lemma upt_eq_Cons_conv:
nipkow@15425
  1532
 "!!x xs. ([i..<j] = x#xs) = (i < j & i = x & [i+1..<j] = xs)"
nipkow@15281
  1533
apply(induct j)
nipkow@15281
  1534
 apply simp
nipkow@15281
  1535
apply(clarsimp simp add: append_eq_Cons_conv)
nipkow@15281
  1536
apply arith
nipkow@15281
  1537
done
nipkow@15281
  1538
nipkow@15425
  1539
lemma upt_Suc_append: "i <= j ==> [i..<(Suc j)] = [i..<j]@[j]"
nipkow@13145
  1540
-- {* Only needed if @{text upt_Suc} is deleted from the simpset. *}
nipkow@13145
  1541
by simp
wenzelm@13114
  1542
nipkow@15425
  1543
lemma upt_conv_Cons: "i < j ==> [i..<j] = i # [Suc i..<j]"
nipkow@13145
  1544
apply(rule trans)
nipkow@13145
  1545
apply(subst upt_rec)
paulson@14208
  1546
 prefer 2 apply (rule refl, simp)
nipkow@13145
  1547
done
wenzelm@13114
  1548
nipkow@15425
  1549
lemma upt_add_eq_append: "i<=j ==> [i..<j+k] = [i..<j]@[j..<j+k]"
nipkow@13145
  1550
-- {* LOOPS as a simprule, since @{text "j <= j"}. *}
nipkow@13145
  1551
by (induct k) auto
wenzelm@13114
  1552
nipkow@15425
  1553
lemma length_upt [simp]: "length [i..<j] = j - i"
nipkow@13145
  1554
by (induct j) (auto simp add: Suc_diff_le)
wenzelm@13114
  1555
nipkow@15425
  1556
lemma nth_upt [simp]: "i + k < j ==> [i..<j] ! k = i + k"
nipkow@13145
  1557
apply (induct j)
nipkow@13145
  1558
apply (auto simp add: less_Suc_eq nth_append split: nat_diff_split)
nipkow@13145
  1559
done
wenzelm@13114
  1560
nipkow@15425
  1561
lemma take_upt [simp]: "!!i. i+m <= n ==> take m [i..<n] = [i..<i+m]"
paulson@14208
  1562
apply (induct m, simp)
nipkow@13145
  1563
apply (subst upt_rec)
nipkow@13145
  1564
apply (rule sym)
nipkow@13145
  1565
apply (subst upt_rec)
nipkow@13145
  1566
apply (simp del: upt.simps)
nipkow@13145
  1567
done
nipkow@3507
  1568
nipkow@17501
  1569
lemma drop_upt[simp]: "drop m [i..<j] = [i+m..<j]"
nipkow@17501
  1570
apply(induct j)
nipkow@17501
  1571
apply auto
nipkow@17501
  1572
apply arith
nipkow@17501
  1573
done
nipkow@17501
  1574
nipkow@15425
  1575
lemma map_Suc_upt: "map Suc [m..<n] = [Suc m..n]"
nipkow@13145
  1576
by (induct n) auto
wenzelm@13114
  1577
nipkow@15425
  1578
lemma nth_map_upt: "!!i. i < n-m ==> (map f [m..<n]) ! i = f(m+i)"
nipkow@13145
  1579
apply (induct n m rule: diff_induct)
nipkow@13145
  1580
prefer 3 apply (subst map_Suc_upt[symmetric])
nipkow@13145
  1581
apply (auto simp add: less_diff_conv nth_upt)
nipkow@13145
  1582
done
wenzelm@13114
  1583
berghofe@13883
  1584
lemma nth_take_lemma:
berghofe@13883
  1585
  "!!xs ys. k <= length xs ==> k <= length ys ==>
berghofe@13883
  1586
     (!!i. i < k --> xs!i = ys!i) ==> take k xs = take k ys"
berghofe@13883
  1587
apply (atomize, induct k)
paulson@14208
  1588
apply (simp_all add: less_Suc_eq_0_disj all_conj_distrib, clarify)
nipkow@13145
  1589
txt {* Both lists must be non-empty *}
paulson@14208
  1590
apply (case_tac xs, simp)
paulson@14208
  1591
apply (case_tac ys, clarify)
nipkow@13145
  1592
 apply (simp (no_asm_use))
nipkow@13145
  1593
apply clarify
nipkow@13145
  1594
txt {* prenexing's needed, not miniscoping *}
nipkow@13145
  1595
apply (simp (no_asm_use) add: all_simps [symmetric] del: all_simps)
nipkow@13145
  1596
apply blast
nipkow@13145
  1597
done
wenzelm@13114
  1598
wenzelm@13114
  1599
lemma nth_equalityI:
wenzelm@13114
  1600
 "[| length xs = length ys; ALL i < length xs. xs!i = ys!i |] ==> xs = ys"
nipkow@13145
  1601
apply (frule nth_take_lemma [OF le_refl eq_imp_le])
nipkow@13145
  1602
apply (simp_all add: take_all)
nipkow@13145
  1603
done
wenzelm@13142
  1604
kleing@13863
  1605
(* needs nth_equalityI *)
kleing@13863
  1606
lemma list_all2_antisym:
kleing@13863
  1607
  "\<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
  1608
  \<Longrightarrow> xs = ys"
kleing@13863
  1609
  apply (simp add: list_all2_conv_all_nth) 
paulson@14208
  1610
  apply (rule nth_equalityI, blast, simp)
kleing@13863
  1611
  done
kleing@13863
  1612
wenzelm@13142
  1613
lemma take_equalityI: "(\<forall>i. take i xs = take i ys) ==> xs = ys"
nipkow@13145
  1614
-- {* The famous take-lemma. *}
nipkow@13145
  1615
apply (drule_tac x = "max (length xs) (length ys)" in spec)
nipkow@13145
  1616
apply (simp add: le_max_iff_disj take_all)
nipkow@13145
  1617
done
wenzelm@13142
  1618
wenzelm@13142
  1619
nipkow@15302
  1620
lemma take_Cons':
nipkow@15302
  1621
     "take n (x # xs) = (if n = 0 then [] else x # take (n - 1) xs)"
nipkow@15302
  1622
by (cases n) simp_all
nipkow@15302
  1623
nipkow@15302
  1624
lemma drop_Cons':
nipkow@15302
  1625
     "drop n (x # xs) = (if n = 0 then x # xs else drop (n - 1) xs)"
nipkow@15302
  1626
by (cases n) simp_all
nipkow@15302
  1627
nipkow@15302
  1628
lemma nth_Cons': "(x # xs)!n = (if n = 0 then x else xs!(n - 1))"
nipkow@15302
  1629
by (cases n) simp_all
nipkow@15302
  1630
nipkow@15302
  1631
lemmas [simp] = take_Cons'[of "number_of v",standard]
nipkow@15302
  1632
                drop_Cons'[of "number_of v",standard]
nipkow@15302
  1633
                nth_Cons'[of _ _ "number_of v",standard]
nipkow@15302
  1634
nipkow@15302
  1635
nipkow@15392
  1636
subsubsection {* @{text "distinct"} and @{text remdups} *}
wenzelm@13142
  1637
wenzelm@13142
  1638
lemma distinct_append [simp]:
nipkow@13145
  1639
"distinct (xs @ ys) = (distinct xs \<and> distinct ys \<and> set xs \<inter> set ys = {})"
nipkow@13145
  1640
by (induct xs) auto
wenzelm@13142
  1641
nipkow@15305
  1642
lemma distinct_rev[simp]: "distinct(rev xs) = distinct xs"
nipkow@15305
  1643
by(induct xs) auto
nipkow@15305
  1644
wenzelm@13142
  1645
lemma set_remdups [simp]: "set (remdups xs) = set xs"
nipkow@13145
  1646
by (induct xs) (auto simp add: insert_absorb)
wenzelm@13142
  1647
wenzelm@13142
  1648
lemma distinct_remdups [iff]: "distinct (remdups xs)"
nipkow@13145
  1649
by (induct xs) auto
wenzelm@13142
  1650
paulson@15072
  1651
lemma remdups_eq_nil_iff [simp]: "(remdups x = []) = (x = [])"
paulson@15251
  1652
  by (induct x, auto) 
paulson@15072
  1653
paulson@15072
  1654
lemma remdups_eq_nil_right_iff [simp]: "([] = remdups x) = (x = [])"
paulson@15251
  1655
  by (induct x, auto)
paulson@15072
  1656
nipkow@15245
  1657
lemma length_remdups_leq[iff]: "length(remdups xs) <= length xs"
nipkow@15245
  1658
by (induct xs) auto
nipkow@15245
  1659
nipkow@15245
  1660
lemma length_remdups_eq[iff]:
nipkow@15245
  1661
  "(length (remdups xs) = length xs) = (remdups xs = xs)"
nipkow@15245
  1662
apply(induct xs)
nipkow@15245
  1663
 apply auto
nipkow@15245
  1664
apply(subgoal_tac "length (remdups xs) <= length xs")
nipkow@15245
  1665
 apply arith
nipkow@15245
  1666
apply(rule length_remdups_leq)
nipkow@15245
  1667
done
nipkow@15245
  1668
wenzelm@13142
  1669
lemma distinct_filter [simp]: "distinct xs ==> distinct (filter P xs)"
nipkow@13145
  1670
by (induct xs) auto
wenzelm@13114
  1671
nipkow@15304
  1672
lemma distinct_map_filterI:
nipkow@15304
  1673
 "distinct(map f xs) \<Longrightarrow> distinct(map f (filter P xs))"
nipkow@15304
  1674
apply(induct xs)
nipkow@15304
  1675
 apply simp
nipkow@15304
  1676
apply force
nipkow@15304
  1677
done
nipkow@15304
  1678
nipkow@17501
  1679
lemma distinct_upt[simp]: "distinct[i..<j]"
nipkow@17501
  1680
by (induct j) auto
nipkow@17501
  1681
nipkow@17501
  1682
lemma distinct_take[simp]: "\<And>i. distinct xs \<Longrightarrow> distinct (take i xs)"
nipkow@17501
  1683
apply(induct xs)
nipkow@17501
  1684
 apply simp
nipkow@17501
  1685
apply (case_tac i)
nipkow@17501
  1686
 apply simp_all
nipkow@17501
  1687
apply(blast dest:in_set_takeD)
nipkow@17501
  1688
done
nipkow@17501
  1689
nipkow@17501
  1690
lemma distinct_drop[simp]: "\<And>i. distinct xs \<Longrightarrow> distinct (drop i xs)"
nipkow@17501
  1691
apply(induct xs)
nipkow@17501
  1692
 apply simp
nipkow@17501
  1693
apply (case_tac i)
nipkow@17501
  1694
 apply simp_all
nipkow@17501
  1695
done
nipkow@17501
  1696
nipkow@17501
  1697
lemma distinct_list_update:
nipkow@17501
  1698
assumes d: "distinct xs" and a: "a \<notin> set xs - {xs!i}"
nipkow@17501
  1699
shows "distinct (xs[i:=a])"
nipkow@17501
  1700
proof (cases "i < length xs")
nipkow@17501
  1701
  case True
nipkow@17501
  1702
  with a have "a \<notin> set (take i xs @ xs ! i # drop (Suc i) xs) - {xs!i}"
nipkow@17501
  1703
    apply (drule_tac id_take_nth_drop) by simp
nipkow@17501
  1704
  with d True show ?thesis
nipkow@17501
  1705
    apply (simp add: upd_conv_take_nth_drop)
nipkow@17501
  1706
    apply (drule subst [OF id_take_nth_drop]) apply assumption
nipkow@17501
  1707
    apply simp apply (cases "a = xs!i") apply simp by blast
nipkow@17501
  1708
next
nipkow@17501
  1709
  case False with d show ?thesis by auto
nipkow@17501
  1710
qed
nipkow@17501
  1711
nipkow@17501
  1712
nipkow@17501
  1713
text {* It is best to avoid this indexed version of distinct, but
nipkow@17501
  1714
sometimes it is useful. *}
nipkow@17501
  1715
wenzelm@13142
  1716
lemma distinct_conv_nth:
nipkow@17501
  1717
"distinct xs = (\<forall>i < size xs. \<forall>j < size xs. i \<noteq> j --> xs!i \<noteq> xs!j)"
paulson@15251
  1718
apply (induct xs, simp, simp)
paulson@14208
  1719
apply (rule iffI, clarsimp)
nipkow@13145
  1720
 apply (case_tac i)
paulson@14208
  1721
apply (case_tac j, simp)
nipkow@13145
  1722
apply (simp add: set_conv_nth)
nipkow@13145
  1723
 apply (case_tac j)
paulson@14208
  1724
apply (clarsimp simp add: set_conv_nth, simp)
nipkow@13145
  1725
apply (rule conjI)
nipkow@13145
  1726
 apply (clarsimp simp add: set_conv_nth)
nipkow@17501
  1727
 apply (erule_tac x = 0 in allE, simp)
paulson@14208
  1728
 apply (erule_tac x = "Suc i" in allE, simp, clarsimp)
nipkow@17501
  1729
apply (erule_tac x = "Suc i" in allE, simp)
paulson@14208
  1730
apply (erule_tac x = "Suc j" in allE, simp)
nipkow@13145
  1731
done
wenzelm@13114
  1732
nipkow@15110
  1733
lemma distinct_card: "distinct xs ==> card (set xs) = size xs"
kleing@14388
  1734
  by (induct xs) auto
kleing@14388
  1735
nipkow@15110
  1736
lemma card_distinct: "card (set xs) = size xs ==> distinct xs"
kleing@14388
  1737
proof (induct xs)
kleing@14388
  1738
  case Nil thus ?case by simp
kleing@14388
  1739
next
kleing@14388
  1740
  case (Cons x xs)
kleing@14388
  1741
  show ?case
kleing@14388
  1742
  proof (cases "x \<in> set xs")
kleing@14388
  1743
    case False with Cons show ?thesis by simp
kleing@14388
  1744
  next
kleing@14388
  1745
    case True with Cons.prems
kleing@14388
  1746
    have "card (set xs) = Suc (length xs)" 
kleing@14388
  1747
      by (simp add: card_insert_if split: split_if_asm)
kleing@14388
  1748
    moreover have "card (set xs) \<le> length xs" by (rule card_length)
kleing@14388
  1749
    ultimately have False by simp
kleing@14388
  1750
    thus ?thesis ..
kleing@14388
  1751
  qed
kleing@14388
  1752
qed
kleing@14388
  1753
nipkow@15110
  1754
lemma inj_on_setI: "distinct(map f xs) ==> inj_on f (set xs)"
nipkow@15110
  1755
apply(induct xs)
nipkow@15110
  1756
 apply simp
nipkow@15110
  1757
apply fastsimp
nipkow@15110
  1758
done
nipkow@15110
  1759
nipkow@15110
  1760
lemma inj_on_set_conv:
nipkow@15110
  1761
 "distinct xs \<Longrightarrow> inj_on f (set xs) = distinct(map f xs)"
nipkow@15110
  1762
apply(induct xs)
nipkow@15110
  1763
 apply simp
nipkow@15110
  1764
apply fastsimp
nipkow@15110
  1765
done
nipkow@15110
  1766
nipkow@15110
  1767
nipkow@15392
  1768
subsubsection {* @{text remove1} *}
nipkow@15110
  1769
nipkow@15110
  1770
lemma set_remove1_subset: "set(remove1 x xs) <= set xs"
nipkow@15110
  1771
apply(induct xs)
nipkow@15110
  1772
 apply simp
nipkow@15110
  1773
apply simp
nipkow@15110
  1774
apply blast
nipkow@15110
  1775
done
nipkow@15110
  1776
nipkow@15110
  1777
lemma [simp]: "distinct xs ==> set(remove1 x xs) = set xs - {x}"
nipkow@15110
  1778
apply(induct xs)
nipkow@15110
  1779
 apply simp
nipkow@15110
  1780
apply simp
nipkow@15110
  1781
apply blast
nipkow@15110
  1782
done
nipkow@15110
  1783
nipkow@15110
  1784
lemma notin_set_remove1[simp]: "x ~: set xs ==> x ~: set(remove1 y xs)"
nipkow@15110
  1785
apply(insert set_remove1_subset)
nipkow@15110
  1786
apply fast
nipkow@15110
  1787
done
nipkow@15110
  1788
nipkow@15110
  1789
lemma distinct_remove1[simp]: "distinct xs ==> distinct(remove1 x xs)"
nipkow@15110
  1790
by (induct xs) simp_all
nipkow@15110
  1791
wenzelm@13114
  1792
nipkow@15392
  1793
subsubsection {* @{text replicate} *}
wenzelm@13114
  1794
wenzelm@13142
  1795
lemma length_replicate [simp]: "length (replicate n x) = n"
nipkow@13145
  1796
by (induct n) auto
nipkow@13124
  1797
wenzelm@13142
  1798
lemma map_replicate [simp]: "map f (replicate n x) = replicate n (f x)"
nipkow@13145
  1799
by (induct n) auto
wenzelm@13114
  1800
wenzelm@13114
  1801
lemma replicate_app_Cons_same:
nipkow@13145
  1802
"(replicate n x) @ (x # xs) = x # replicate n x @ xs"
nipkow@13145
  1803
by (induct n) auto
wenzelm@13114
  1804
wenzelm@13142
  1805
lemma rev_replicate [simp]: "rev (replicate n x) = replicate n x"
paulson@14208
  1806
apply (induct n, simp)
nipkow@13145
  1807
apply (simp add: replicate_app_Cons_same)
nipkow@13145
  1808
done
wenzelm@13114
  1809
wenzelm@13142
  1810
lemma replicate_add: "replicate (n + m) x = replicate n x @ replicate m x"
nipkow@13145
  1811
by (induct n) auto
wenzelm@13114
  1812
nipkow@16397
  1813
text{* Courtesy of Matthias Daum: *}
nipkow@16397
  1814
lemma append_replicate_commute:
nipkow@16397
  1815
  "replicate n x @ replicate k x = replicate k x @ replicate n x"
nipkow@16397
  1816
apply (simp add: replicate_add [THEN sym])
nipkow@16397
  1817
apply (simp add: add_commute)
nipkow@16397
  1818
done
nipkow@16397
  1819
wenzelm@13142
  1820
lemma hd_replicate [simp]: "n \<noteq> 0 ==> hd (replicate n x) = x"
nipkow@13145
  1821
by (induct n) auto
wenzelm@13114
  1822
wenzelm@13142
  1823
lemma tl_replicate [simp]: "n \<noteq> 0 ==> tl (replicate n x) = replicate (n - 1) x"
nipkow@13145
  1824
by (induct n) auto
wenzelm@13114
  1825
wenzelm@13142
  1826
lemma last_replicate [simp]: "n \<noteq> 0 ==> last (replicate n x) = x"
nipkow@13145
  1827
by (atomize (full), induct n) auto
wenzelm@13114
  1828
wenzelm@13142
  1829
lemma nth_replicate[simp]: "!!i. i < n ==> (replicate n x)!i = x"
paulson@14208
  1830
apply (induct n, simp)
nipkow@13145
  1831
apply (simp add: nth_Cons split: nat.split)
nipkow@13145
  1832
done
wenzelm@13114
  1833
nipkow@16397
  1834
text{* Courtesy of Matthias Daum (2 lemmas): *}
nipkow@16397
  1835
lemma take_replicate[simp]: "take i (replicate k x) = replicate (min i k) x"
nipkow@16397
  1836
apply (case_tac "k \<le> i")
nipkow@16397
  1837
 apply  (simp add: min_def)
nipkow@16397
  1838
apply (drule not_leE)
nipkow@16397
  1839
apply (simp add: min_def)
nipkow@16397
  1840
apply (subgoal_tac "replicate k x = replicate i x @ replicate (k - i) x")
nipkow@16397
  1841
 apply  simp
nipkow@16397
  1842
apply (simp add: replicate_add [symmetric])
nipkow@16397
  1843
done
nipkow@16397
  1844
nipkow@16397
  1845
lemma drop_replicate[simp]: "!!i. drop i (replicate k x) = replicate (k-i) x"
nipkow@16397
  1846
apply (induct k)
nipkow@16397
  1847
 apply simp
nipkow@16397
  1848
apply clarsimp
nipkow@16397
  1849
apply (case_tac i)
nipkow@16397
  1850
 apply simp
nipkow@16397
  1851
apply clarsimp
nipkow@16397
  1852
done
nipkow@16397
  1853
nipkow@16397
  1854
wenzelm@13142
  1855
lemma set_replicate_Suc: "set (replicate (Suc n) x) = {x}"
nipkow@13145
  1856
by (induct n) auto
wenzelm@13114
  1857
wenzelm@13142
  1858
lemma set_replicate [simp]: "n \<noteq> 0 ==> set (replicate n x) = {x}"
nipkow@13145
  1859
by (fast dest!: not0_implies_Suc intro!: set_replicate_Suc)
wenzelm@13114
  1860
wenzelm@13142
  1861
lemma set_replicate_conv_if: "set (replicate n x) = (if n = 0 then {} else {x})"
nipkow@13145
  1862
by auto
wenzelm@13114
  1863
wenzelm@13142
  1864
lemma in_set_replicateD: "x : set (replicate n y) ==> x = y"
nipkow@13145
  1865
by (simp add: set_replicate_conv_if split: split_if_asm)
wenzelm@13114
  1866
wenzelm@13114
  1867
nipkow@15392
  1868
subsubsection{*@{text rotate1} and @{text rotate}*}
nipkow@15302
  1869
nipkow@15302
  1870
lemma rotate_simps[simp]: "rotate1 [] = [] \<and> rotate1 (x#xs) = xs @ [x]"
nipkow@15302
  1871
by(simp add:rotate1_def)
nipkow@15302
  1872
nipkow@15302
  1873
lemma rotate0[simp]: "rotate 0 = id"
nipkow@15302
  1874
by(simp add:rotate_def)
nipkow@15302
  1875
nipkow@15302
  1876
lemma rotate_Suc[simp]: "rotate (Suc n) xs = rotate1(rotate n xs)"
nipkow@15302
  1877
by(simp add:rotate_def)
nipkow@15302
  1878
nipkow@15302
  1879
lemma rotate_add:
nipkow@15302
  1880
  "rotate (m+n) = rotate m o rotate n"
nipkow@15302
  1881
by(simp add:rotate_def funpow_add)
nipkow@15302
  1882
nipkow@15302
  1883
lemma rotate_rotate: "rotate m (rotate n xs) = rotate (m+n) xs"
nipkow@15302
  1884
by(simp add:rotate_add)
nipkow@15302
  1885
nipkow@15302
  1886
lemma rotate1_length01[simp]: "length xs <= 1 \<Longrightarrow> rotate1 xs = xs"
nipkow@15302
  1887
by(cases xs) simp_all
nipkow@15302
  1888
nipkow@15302
  1889
lemma rotate_length01[simp]: "length xs <= 1 \<Longrightarrow> rotate n xs = xs"
nipkow@15302
  1890
apply(induct n)
nipkow@15302
  1891
 apply simp
nipkow@15302
  1892
apply (simp add:rotate_def)
nipkow@13145
  1893
done
wenzelm@13114
  1894
nipkow@15302
  1895
lemma rotate1_hd_tl: "xs \<noteq> [] \<Longrightarrow> rotate1 xs = tl xs @ [hd xs]"
nipkow@15302
  1896
by(simp add:rotate1_def split:list.split)
nipkow@15302
  1897
nipkow@15302
  1898
lemma rotate_drop_take:
nipkow@15302
  1899
  "rotate n xs = drop (n mod length xs) xs @ take (n mod length xs) xs"
nipkow@15302
  1900
apply(induct n)
nipkow@15302
  1901
 apply simp
nipkow@15302
  1902
apply(simp add:rotate_def)
nipkow@15302
  1903
apply(cases "xs = []")
nipkow@15302
  1904
 apply (simp)
nipkow@15302
  1905
apply(case_tac "n mod length xs = 0")
nipkow@15302
  1906
 apply(simp add:mod_Suc)
nipkow@15302
  1907
 apply(simp add: rotate1_hd_tl drop_Suc take_Suc)
nipkow@15302
  1908
apply(simp add:mod_Suc rotate1_hd_tl drop_Suc[symmetric] drop_tl[symmetric]
nipkow@15302
  1909
                take_hd_drop linorder_not_le)
nipkow@13145
  1910
done
wenzelm@13114
  1911
nipkow@15302
  1912
lemma rotate_conv_mod: "rotate n xs = rotate (n mod length xs) xs"
nipkow@15302
  1913
by(simp add:rotate_drop_take)
nipkow@15302
  1914
nipkow@15302
  1915
lemma rotate_id[simp]: "n mod length xs = 0 \<Longrightarrow> rotate n xs = xs"
nipkow@15302
  1916
by(simp add:rotate_drop_take)
nipkow@15302
  1917
nipkow@15302
  1918
lemma length_rotate1[simp]: "length(rotate1 xs) = length xs"
nipkow@15302
  1919
by(simp add:rotate1_def split:list.split)
nipkow@15302
  1920
nipkow@15302
  1921
lemma length_rotate[simp]: "!!xs. length(rotate n xs) = length xs"
nipkow@15302
  1922
by (induct n) (simp_all add:rotate_def)
nipkow@15302
  1923
nipkow@15302
  1924
lemma distinct1_rotate[simp]: "distinct(rotate1 xs) = distinct xs"
nipkow@15302
  1925
by(simp add:rotate1_def split:list.split) blast
nipkow@15302
  1926
nipkow@15302
  1927
lemma distinct_rotate[simp]: "distinct(rotate n xs) = distinct xs"
nipkow@15302
  1928
by (induct n) (simp_all add:rotate_def)
nipkow@15302
  1929
nipkow@15302
  1930
lemma rotate_map: "rotate n (map f xs) = map f (rotate n xs)"
nipkow@15302
  1931
by(simp add:rotate_drop_take take_map drop_map)
nipkow@15302
  1932
nipkow@15302
  1933
lemma set_rotate1[simp]: "set(rotate1 xs) = set xs"
nipkow@15302
  1934
by(simp add:rotate1_def split:list.split)
nipkow@15302
  1935
nipkow@15302
  1936
lemma set_rotate[simp]: "set(rotate n xs) = set xs"
nipkow@15302
  1937
by (induct n) (simp_all add:rotate_def)
nipkow@15302
  1938
nipkow@15302
  1939
lemma rotate1_is_Nil_conv[simp]: "(rotate1 xs = []) = (xs = [])"
nipkow@15302
  1940
by(simp add:rotate1_def split:list.split)
nipkow@15302
  1941
nipkow@15302
  1942
lemma rotate_is_Nil_conv[simp]: "(rotate n xs = []) = (xs = [])"
nipkow@15302
  1943
by (induct n) (simp_all add:rotate_def)
wenzelm@13114
  1944
nipkow@15439
  1945
lemma rotate_rev:
nipkow@15439
  1946
  "rotate n (rev xs) = rev(rotate (length xs - (n mod length xs)) xs)"
nipkow@15439
  1947
apply(simp add:rotate_drop_take rev_drop rev_take)
nipkow@15439
  1948
apply(cases "length xs = 0")
nipkow@15439
  1949
 apply simp
nipkow@15439
  1950
apply(cases "n mod length xs = 0")
nipkow@15439
  1951
 apply simp
nipkow@15439
  1952
apply(simp add:rotate_drop_take rev_drop rev_take)
nipkow@15439
  1953
done
nipkow@15439
  1954
wenzelm@13114
  1955
nipkow@15392
  1956
subsubsection {* @{text sublist} --- a generalization of @{text nth} to sets *}
wenzelm@13114
  1957
wenzelm@13142
  1958
lemma sublist_empty [simp]: "sublist xs {} = []"
nipkow@13145
  1959
by (auto simp add: sublist_def)
wenzelm@13114
  1960
wenzelm@13142
  1961
lemma sublist_nil [simp]: "sublist [] A = []"
nipkow@13145
  1962
by (auto simp add: sublist_def)
wenzelm@13114
  1963
nipkow@15281
  1964
lemma length_sublist:
nipkow@15281
  1965
  "length(sublist xs I) = card{i. i < length xs \<and> i : I}"
nipkow@15281
  1966
by(simp add: sublist_def length_filter_conv_card cong:conj_cong)
nipkow@15281
  1967
nipkow@15281
  1968
lemma sublist_shift_lemma_Suc:
nipkow@15281
  1969
  "!!is. map fst (filter (%p. P(Suc(snd p))) (zip xs is)) =
nipkow@15281
  1970
         map fst (filter (%p. P(snd p)) (zip xs (map Suc is)))"
nipkow@15281
  1971
apply(induct xs)
nipkow@15281
  1972
 apply simp
nipkow@15281
  1973
apply (case_tac "is")
nipkow@15281
  1974
 apply simp
nipkow@15281
  1975
apply simp
nipkow@15281
  1976
done
nipkow@15281
  1977
wenzelm@13114
  1978
lemma sublist_shift_lemma:
nipkow@15425
  1979
     "map fst [p:zip xs [i..<i + length xs] . snd p : A] =
nipkow@15425
  1980
      map fst [p:zip xs [0..<length xs] . snd p + i : A]"
nipkow@13145
  1981
by (induct xs rule: rev_induct) (simp_all add: add_commute)
wenzelm@13114
  1982
wenzelm@13114
  1983
lemma sublist_append:
paulson@15168
  1984
     "sublist (l @ l') A = sublist l A @ sublist l' {j. j + length l : A}"
nipkow@13145
  1985
apply (unfold sublist_def)
paulson@14208
  1986
apply (induct l' rule: rev_induct, simp)
nipkow@13145
  1987
apply (simp add: upt_add_eq_append[of 0] zip_append sublist_shift_lemma)
nipkow@13145
  1988
apply (simp add: add_commute)
nipkow@13145
  1989
done
wenzelm@13114
  1990
wenzelm@13114
  1991
lemma sublist_Cons:
nipkow@13145
  1992
"sublist (x # l) A = (if 0:A then [x] else []) @ sublist l {j. Suc j : A}"
nipkow@13145
  1993
apply (induct l rule: rev_induct)
nipkow@13145
  1994
 apply (simp add: sublist_def)
nipkow@13145
  1995
apply (simp del: append_Cons add: append_Cons[symmetric] sublist_append)
nipkow@13145
  1996
done
wenzelm@13114
  1997
nipkow@15281
  1998
lemma set_sublist: "!!I. set(sublist xs I) = {xs!i|i. i<size xs \<and> i \<in> I}"
nipkow@15281
  1999
apply(induct xs)
nipkow@15281
  2000
 apply simp
nipkow@15281
  2001
apply(auto simp add:sublist_Cons nth_Cons split:nat.split elim: lessE)
nipkow@15281
  2002
 apply(erule lessE)
nipkow@15281
  2003
  apply auto
nipkow@15281
  2004
apply(erule lessE)
nipkow@15281
  2005
apply auto
nipkow@15281
  2006
done
nipkow@15281
  2007
nipkow@15281
  2008
lemma set_sublist_subset: "set(sublist xs I) \<subseteq> set xs"
nipkow@15281
  2009
by(auto simp add:set_sublist)
nipkow@15281
  2010
nipkow@15281
  2011
lemma notin_set_sublistI[simp]: "x \<notin> set xs \<Longrightarrow> x \<notin> set(sublist xs I)"
nipkow@15281
  2012
by(auto simp add:set_sublist)
nipkow@15281
  2013
nipkow@15281
  2014
lemma in_set_sublistD: "x \<in> set(sublist xs I) \<Longrightarrow> x \<in> set xs"
nipkow@15281
  2015
by(auto simp add:set_sublist)
nipkow@15281
  2016
wenzelm@13142
  2017
lemma sublist_singleton [simp]: "sublist [x] A = (if 0 : A then [x] else [])"
nipkow@13145
  2018
by (simp add: sublist_Cons)
wenzelm@13114
  2019
nipkow@15281
  2020
nipkow@15281
  2021
lemma distinct_sublistI[simp]: "!!I. distinct xs \<Longrightarrow> distinct(sublist xs I)"
nipkow@15281
  2022
apply(induct xs)
nipkow@15281
  2023
 apply simp
nipkow@15281
  2024
apply(auto simp add:sublist_Cons)
nipkow@15281
  2025
done
nipkow@15281
  2026
nipkow@15281
  2027
nipkow@15045
  2028
lemma sublist_upt_eq_take [simp]: "sublist l {..<n} = take n l"
paulson@14208
  2029
apply (induct l rule: rev_induct, simp)
nipkow@13145
  2030
apply (simp split: nat_diff_split add: sublist_append)
nipkow@13145
  2031
done
wenzelm@13114
  2032
nipkow@17501
  2033
lemma filter_in_sublist: "\<And>s. distinct xs \<Longrightarrow>
nipkow@17501
  2034
  filter (%x. x \<in> set(sublist xs s)) xs = sublist xs s"
nipkow@17501
  2035
proof (induct xs)
nipkow@17501
  2036
  case Nil thus ?case by simp
nipkow@17501
  2037
next
nipkow@17501
  2038
  case (Cons a xs)
nipkow@17501
  2039
  moreover hence "!x. x: set xs \<longrightarrow> x \<noteq> a" by auto
nipkow@17501
  2040
  ultimately show ?case by(simp add: sublist_Cons cong:filter_cong)
nipkow@17501
  2041
qed
nipkow@17501
  2042
wenzelm@13114
  2043
nipkow@15392
  2044
subsubsection{*Sets of Lists*}
nipkow@15392
  2045
nipkow@15392
  2046
subsubsection {* @{text lists}: the list-forming operator over sets *}
nipkow@15302
  2047
nipkow@15302
  2048
consts lists :: "'a set => 'a list set"
nipkow@15302
  2049
inductive "lists A"
nipkow@15302
  2050
 intros
nipkow@15302
  2051
  Nil [intro!]: "[]: lists A"
nipkow@15302
  2052
  Cons [intro!]: "[| a: A;l: lists A|] ==> a#l : lists A"
nipkow@15302
  2053
nipkow@15302
  2054
inductive_cases listsE [elim!]: "x#l : lists A"
nipkow@15302
  2055
nipkow@15302
  2056
lemma lists_mono [mono]: "A \<subseteq> B ==> lists A \<subseteq> lists B"
nipkow@15302
  2057
by (unfold lists.defs) (blast intro!: lfp_mono)
nipkow@15302
  2058
nipkow@15302
  2059
lemma lists_IntI:
nipkow@15302
  2060
  assumes l: "l: lists A" shows "l: lists B ==> l: lists (A Int B)" using l
nipkow@15302
  2061
  by induct blast+
nipkow@15302
  2062
nipkow@15302
  2063
lemma lists_Int_eq [simp]: "lists (A \<inter> B) = lists A \<inter> lists B"
nipkow@15302
  2064
proof (rule mono_Int [THEN equalityI])
nipkow@15302
  2065
  show "mono lists" by (simp add: mono_def lists_mono)
nipkow@15302
  2066
  show "lists A \<inter> lists B \<subseteq> lists (A \<inter> B)" by (blast intro: lists_IntI)
kleing@14388
  2067
qed
kleing@14388
  2068
nipkow@15302
  2069
lemma append_in_lists_conv [iff]:
nipkow@15302
  2070
     "(xs @ ys : lists A) = (xs : lists A \<and> ys : lists A)"
nipkow@15302
  2071
by (induct xs) auto
nipkow@15302
  2072
nipkow@15302
  2073
lemma in_lists_conv_set: "(xs : lists A) = (\<forall>x \<in> set xs. x : A)"
nipkow@15302
  2074
-- {* eliminate @{text lists} in favour of @{text set} *}
nipkow@15302
  2075
by (induct xs) auto
nipkow@15302
  2076
nipkow@15302
  2077
lemma in_listsD [dest!]: "xs \<in> lists A ==> \<forall>x\<in>set xs. x \<in> A"
nipkow@15302
  2078
by (rule in_lists_conv_set [THEN iffD1])
nipkow@15302
  2079
nipkow@15302
  2080
lemma in_listsI [intro!]: "\<forall>x\<in>set xs. x \<in> A ==> xs \<in> lists A"
nipkow@15302
  2081
by (rule in_lists_conv_set [THEN iffD2])
nipkow@15302
  2082
nipkow@15302
  2083
lemma lists_UNIV [simp]: "lists UNIV = UNIV"
nipkow@15302
  2084
by auto
nipkow@15302
  2085
nipkow@17086
  2086
subsubsection {* For efficiency *}
nipkow@17086
  2087
nipkow@17086
  2088
text{* Only use @{text mem} for generating executable code.  Otherwise
nipkow@17086
  2089
use @{prop"x : set xs"} instead --- it is much easier to reason about.
nipkow@17086
  2090
The same is true for @{const list_all} and @{const list_ex}: write
nipkow@17086
  2091
@{text"\<forall>x\<in>set xs"} and @{text"\<exists>x\<in>set xs"} instead because the HOL
nipkow@17090
  2092
quantifiers are aleady known to the automatic provers. In fact, the declarations in the Code subsection make sure that @{text"\<in>"}, @{text"\<forall>x\<in>set xs"}
nipkow@17090
  2093
and @{text"\<exists>x\<in>set xs"} are implemented efficiently.
nipkow@17086
  2094
nipkow@17086
  2095
The functions @{const itrev}, @{const filtermap} and @{const
nipkow@17086
  2096
map_filter} are just there to generate efficient code. Do not use them
nipkow@17086
  2097
for modelling and proving. *}
nipkow@17086
  2098
nipkow@17086
  2099
lemma mem_iff: "(x mem xs) = (x : set xs)"
nipkow@17086
  2100
by (induct xs) auto
nipkow@17086
  2101
nipkow@17086
  2102
lemma list_inter_conv: "set(list_inter xs ys) = set xs \<inter> set ys"
nipkow@17086
  2103
by (induct xs) auto
nipkow@17086
  2104
nipkow@17086
  2105
lemma list_all_iff: "list_all P xs = (\<forall>x \<in> set xs. P x)"
nipkow@17086
  2106
by (induct xs) auto
nipkow@17086
  2107
nipkow@17086
  2108
lemma list_all_append [simp]:
nipkow@17086
  2109
"list_all P (xs @ ys) = (list_all P xs \<and> list_all P ys)"
nipkow@17086
  2110
by (induct xs) auto
nipkow@17086
  2111
nipkow@17086
  2112
lemma list_all_rev [simp]: "list_all P (rev xs) = list_all P xs"
nipkow@17086
  2113
by (simp add: list_all_iff)
nipkow@17086
  2114
nipkow@17086
  2115
lemma list_ex_iff: "list_ex P xs = (\<exists>x \<in> set xs. P x)"
nipkow@17086
  2116
by (induct xs) simp_all
nipkow@17086
  2117
nipkow@17086
  2118
lemma itrev[simp]: "ALL ys. itrev xs ys = rev xs @ ys"
nipkow@17086
  2119
by (induct xs) simp_all
nipkow@17086
  2120
nipkow@17086
  2121
lemma filtermap_conv:
nipkow@17086
  2122
 "filtermap f xs = map (%x. the(f x)) (filter (%x. f x \<noteq> None) xs)"
nipkow@17086
  2123
by (induct xs) auto
nipkow@17086
  2124
nipkow@17086
  2125
lemma map_filter_conv[simp]: "map_filter f P xs = map f (filter P xs)"
nipkow@17086
  2126
by (induct xs) auto
nipkow@17086
  2127
nipkow@17086
  2128
nipkow@17086
  2129
subsubsection {* Code generation *}
nipkow@17086
  2130
nipkow@17086
  2131
text{* Defaults for generating efficient code for some standard functions. *}
nipkow@17086
  2132
nipkow@17090
  2133
lemmas in_set_code[code unfold] = mem_iff[symmetric, THEN eq_reflection]
nipkow@17090
  2134
nipkow@17090
  2135
lemma rev_code[code unfold]: "rev xs == itrev xs []"
nipkow@17086
  2136
by simp
nipkow@17086
  2137
nipkow@17090
  2138
lemma distinct_Cons_mem[code]: "distinct (x#xs) = (~(x mem xs) \<and> distinct xs)"
nipkow@17086
  2139
by (simp add:mem_iff)
nipkow@17086
  2140
nipkow@17090
  2141
lemma remdups_Cons_mem[code]:
nipkow@17086
  2142
 "remdups (x#xs) = (if x mem xs then remdups xs else x # remdups xs)"
nipkow@17086
  2143
by (simp add:mem_iff)
nipkow@17086
  2144
nipkow@17090
  2145
lemma list_inter_Cons_mem[code]:  "list_inter (a#as) bs =
nipkow@17086
  2146
  (if a mem bs then a#(list_inter as bs) else list_inter as bs)"
nipkow@17086
  2147
by(simp add:mem_iff)
nipkow@17086
  2148
nipkow@17090
  2149
text{* For implementing bounded quantifiers over lists by
nipkow@17090
  2150
@{const list_ex}/@{const list_all}: *}
nipkow@17090
  2151
nipkow@17090
  2152
lemmas list_bex_code[code unfold] = list_ex_iff[symmetric, THEN eq_reflection]
nipkow@17090
  2153
lemmas list_ball_code[code unfold] = list_all_iff[symmetric, THEN eq_reflection]
nipkow@17086
  2154
nipkow@17086
  2155
nipkow@17086
  2156
subsubsection{* Inductive definition for membership *}
nipkow@17086
  2157
nipkow@17086
  2158
consts ListMem :: "('a \<times> 'a list)set"
nipkow@17086
  2159
inductive ListMem
nipkow@17086
  2160
intros
nipkow@17086
  2161
 elem:  "(x,x#xs) \<in> ListMem"
nipkow@17086
  2162
 insert:  "(x,xs) \<in> ListMem \<Longrightarrow> (x,y#xs) \<in> ListMem"
nipkow@17086
  2163
nipkow@17086
  2164
lemma ListMem_iff: "((x,xs) \<in> ListMem) = (x \<in> set xs)"
nipkow@17086
  2165
apply (rule iffI)
nipkow@17086
  2166
 apply (induct set: ListMem)
nipkow@17086
  2167
  apply auto
nipkow@17086
  2168
apply (induct xs)
nipkow@17086
  2169
 apply (auto intro: ListMem.intros)
nipkow@17086
  2170
done
nipkow@17086
  2171
nipkow@17086
  2172
nipkow@17086
  2173
nipkow@15392
  2174
subsubsection{*Lists as Cartesian products*}
nipkow@15302
  2175
nipkow@15302
  2176
text{*@{text"set_Cons A Xs"}: the set of lists with head drawn from
nipkow@15302
  2177
@{term A} and tail drawn from @{term Xs}.*}
nipkow@15302
  2178
nipkow@15302
  2179
constdefs
nipkow@15302
  2180
  set_Cons :: "'a set \<Rightarrow> 'a list set \<Rightarrow> 'a list set"
nipkow@15302
  2181
  "set_Cons A XS == {z. \<exists>x xs. z = x#xs & x \<in> A & xs \<in> XS}"
nipkow@15302
  2182
nipkow@15302
  2183
lemma [simp]: "set_Cons A {[]} = (%x. [x])`A"
nipkow@15302
  2184
by (auto simp add: set_Cons_def)
nipkow@15302
  2185
nipkow@15302
  2186
text{*Yields the set of lists, all of the same length as the argument and
nipkow@15302
  2187
with elements drawn from the corresponding element of the argument.*}
nipkow@15302
  2188
nipkow@15302
  2189
consts  listset :: "'a set list \<Rightarrow> 'a list set"
nipkow@15302
  2190
primrec
nipkow@15302
  2191
   "listset []    = {[]}"
nipkow@15302
  2192
   "listset(A#As) = set_Cons A (listset As)"
nipkow@15302
  2193
nipkow@15302
  2194
paulson@15656
  2195
subsection{*Relations on Lists*}
paulson@15656
  2196
paulson@15656
  2197
subsubsection {* Length Lexicographic Ordering *}
paulson@15656
  2198
paulson@15656
  2199
text{*These orderings preserve well-foundedness: shorter lists 
paulson@15656
  2200
  precede longer lists. These ordering are not used in dictionaries.*}
paulson@15656
  2201
paulson@15656
  2202
consts lexn :: "('a * 'a)set => nat => ('a list * 'a list)set"
paulson@15656
  2203
        --{*The lexicographic ordering for lists of the specified length*}
nipkow@15302
  2204
primrec
paulson@15656
  2205
  "lexn r 0 = {}"
paulson@15656
  2206
  "lexn r (Suc n) =
paulson@15656
  2207
    (prod_fun (%(x,xs). x#xs) (%(x,xs). x#xs) ` (r <*lex*> lexn r n)) Int
paulson@15656
  2208
    {(xs,ys). length xs = Suc n \<and> length ys = Suc n}"
nipkow@15302
  2209
nipkow@15302
  2210
constdefs
paulson@15656
  2211
  lex :: "('a \<times> 'a) set => ('a list \<times> 'a list) set"
paulson@15656
  2212
    "lex r == \<Union>n. lexn r n"
paulson@15656
  2213
        --{*Holds only between lists of the same length*}
paulson@15656
  2214
nipkow@15693
  2215
  lenlex :: "('a \<times> 'a) set => ('a list \<times> 'a list) set"
nipkow@15693
  2216
    "lenlex r == inv_image (less_than <*lex*> lex r) (%xs. (length xs, xs))"
paulson@15656
  2217
        --{*Compares lists by their length and then lexicographically*}
nipkow@15302
  2218
nipkow@15302
  2219
nipkow@15302
  2220
lemma wf_lexn: "wf r ==> wf (lexn r n)"
nipkow@15302
  2221
apply (induct n, simp, simp)
nipkow@15302
  2222
apply(rule wf_subset)
nipkow@15302
  2223
 prefer 2 apply (rule Int_lower1)
nipkow@15302
  2224
apply(rule wf_prod_fun_image)
nipkow@15302
  2225
 prefer 2 apply (rule inj_onI, auto)
nipkow@15302
  2226
done
nipkow@15302
  2227
nipkow@15302
  2228
lemma lexn_length:
nipkow@15302
  2229
     "!!xs ys. (xs, ys) : lexn r n ==> length xs = n \<and> length ys = n"
nipkow@15302
  2230
by (induct n) auto
nipkow@15302
  2231
nipkow@15302
  2232
lemma wf_lex [intro!]: "wf r ==> wf (lex r)"
nipkow@15302
  2233
apply (unfold lex_def)
nipkow@15302
  2234
apply (rule wf_UN)
nipkow@15302
  2235
apply (blast intro: wf_lexn, clarify)
nipkow@15302
  2236
apply (rename_tac m n)
nipkow@15302
  2237
apply (subgoal_tac "m \<noteq> n")
nipkow@15302
  2238
 prefer 2 apply blast
nipkow@15302
  2239
apply (blast dest: lexn_length not_sym)
nipkow@15302
  2240
done
nipkow@15302
  2241
nipkow@15302
  2242
lemma lexn_conv:
paulson@15656
  2243
  "lexn r n =
paulson@15656
  2244
    {(xs,ys). length xs = n \<and> length ys = n \<and>
paulson@15656
  2245
    (\<exists>xys x y xs' ys'. xs= xys @ x#xs' \<and> ys= xys @ y # ys' \<and> (x, y):r)}"
nipkow@15302
  2246
apply (induct n, simp, blast)
nipkow@15302
  2247
apply (simp add: image_Collect lex_prod_def, safe, blast)
nipkow@15302
  2248
 apply (rule_tac x = "ab # xys" in exI, simp)
nipkow@15302
  2249
apply (case_tac xys, simp_all, blast)
nipkow@15302
  2250
done
nipkow@15302
  2251
nipkow@15302
  2252
lemma lex_conv:
paulson@15656
  2253
  "lex r =
paulson@15656
  2254
    {(xs,ys). length xs = length ys \<and>
paulson@15656
  2255
    (\<exists>xys x y xs' ys'. xs = xys @ x # xs' \<and> ys = xys @ y # ys' \<and> (x, y):r)}"
nipkow@15302
  2256
by (force simp add: lex_def lexn_conv)
nipkow@15302
  2257
nipkow@15693
  2258
lemma wf_lenlex [intro!]: "wf r ==> wf (lenlex r)"
nipkow@15693
  2259
by (unfold lenlex_def) blast
nipkow@15693
  2260
nipkow@15693
  2261
lemma lenlex_conv:
nipkow@15693
  2262
    "lenlex r = {(xs,ys). length xs < length ys |
paulson@15656
  2263
                 length xs = length ys \<and> (xs, ys) : lex r}"
nipkow@15693
  2264
by (simp add: lenlex_def diag_def lex_prod_def measure_def inv_image_def)
nipkow@15302
  2265
nipkow@15302
  2266
lemma Nil_notin_lex [iff]: "([], ys) \<notin> lex r"
nipkow@15302
  2267
by (simp add: lex_conv)
nipkow@15302
  2268
nipkow@15302
  2269
lemma Nil2_notin_lex [iff]: "(xs, []) \<notin> lex r"
nipkow@15302
  2270
by (simp add:lex_conv)
nipkow@15302
  2271
nipkow@15302
  2272
lemma Cons_in_lex [iff]:
paulson@15656
  2273
    "((x # xs, y # ys) : lex r) =
paulson@15656
  2274
      ((x, y) : r \<and> length xs = length ys | x = y \<and> (xs, ys) : lex r)"
nipkow@15302
  2275
apply (simp add: lex_conv)
nipkow@15302
  2276
apply (rule iffI)
nipkow@15302
  2277
 prefer 2 apply (blast intro: Cons_eq_appendI, clarify)
nipkow@15302
  2278
apply (case_tac xys, simp, simp)
nipkow@15302
  2279
apply blast
nipkow@15302
  2280
done
nipkow@15302
  2281
nipkow@15302
  2282
paulson@15656
  2283
subsubsection {* Lexicographic Ordering *}
paulson@15656
  2284
paulson@15656
  2285
text {* Classical lexicographic ordering on lists, ie. "a" < "ab" < "b".
paulson@15656
  2286
    This ordering does \emph{not} preserve well-foundedness.
nipkow@17090
  2287
     Author: N. Voelker, March 2005. *} 
paulson@15656
  2288
paulson@15656
  2289
constdefs 
paulson@15656
  2290
  lexord :: "('a * 'a)set \<Rightarrow> ('a list * 'a list) set" 
paulson@15656
  2291
  "lexord  r == {(x,y). \<exists> a v. y = x @ a # v \<or> 
paulson@15656
  2292
            (\<exists> u a b v w. (a,b) \<in> r \<and> x = u @ (a # v) \<and> y = u @ (b # w))}"
paulson@15656
  2293
paulson@15656
  2294
lemma lexord_Nil_left[simp]:  "([],y) \<in> lexord r = (\<exists> a x. y = a # x)"
paulson@15656
  2295
  by (unfold lexord_def, induct_tac y, auto) 
paulson@15656
  2296
paulson@15656
  2297
lemma lexord_Nil_right[simp]: "(x,[]) \<notin> lexord r"
paulson@15656
  2298
  by (unfold lexord_def, induct_tac x, auto)
paulson@15656
  2299
paulson@15656
  2300
lemma lexord_cons_cons[simp]:
paulson@15656
  2301
     "((a # x, b # y) \<in> lexord r) = ((a,b)\<in> r | (a = b & (x,y)\<in> lexord r))"
paulson@15656
  2302
  apply (unfold lexord_def, safe, simp_all)
paulson@15656
  2303
  apply (case_tac u, simp, simp)
paulson@15656
  2304
  apply (case_tac u, simp, clarsimp, blast, blast, clarsimp)
paulson@15656
  2305
  apply (erule_tac x="b # u" in allE)
paulson@15656
  2306
  by force
paulson@15656
  2307
paulson@15656
  2308
lemmas lexord_simps = lexord_Nil_left lexord_Nil_right lexord_cons_cons
paulson@15656
  2309
paulson@15656
  2310
lemma lexord_append_rightI: "\<exists> b z. y = b # z \<Longrightarrow> (x, x @ y) \<in> lexord r"
paulson@15656
  2311
  by (induct_tac x, auto)  
paulson@15656
  2312
paulson@15656
  2313
lemma lexord_append_left_rightI:
paulson@15656
  2314
     "(a,b) \<in> r \<Longrightarrow> (u @ a # x, u @ b # y) \<in> lexord r"
paulson@15656
  2315
  by (induct_tac u, auto)
paulson@15656
  2316
paulson@15656
  2317
lemma lexord_append_leftI: " (u,v) \<in> lexord r \<Longrightarrow> (x @ u, x @ v) \<in> lexord r"
paulson@15656
  2318
  by (induct x, auto)
paulson@15656
  2319
paulson@15656
  2320
lemma lexord_append_leftD:
paulson@15656
  2321
     "\<lbrakk> (x @ u, x @ v) \<in> lexord r; (! a. (a,a) \<notin> r) \<rbrakk> \<Longrightarrow> (u,v) \<in> lexord r"
paulson@15656
  2322
  by (erule rev_mp, induct_tac x, auto)
paulson@15656
  2323
paulson@15656
  2324
lemma lexord_take_index_conv: 
paulson@15656
  2325
   "((x,y) : lexord r) = 
paulson@15656
  2326
    ((length x < length y \<and> take (length x) y = x) \<or> 
paulson@15656
  2327
     (\<exists>i. i < min(length x)(length y) & take i x = take i y & (x!i,y!i) \<in> r))"
paulson@15656
  2328
  apply (unfold lexord_def Let_def, clarsimp) 
paulson@15656
  2329
  apply (rule_tac f = "(% a b. a \<or> b)" in arg_cong2)
paulson@15656
  2330
  apply auto 
paulson@15656
  2331
  apply (rule_tac x="hd (drop (length x) y)" in exI)
paulson@15656
  2332
  apply (rule_tac x="tl (drop (length x) y)" in exI)
paulson@15656
  2333
  apply (erule subst, simp add: min_def) 
paulson@15656
  2334
  apply (rule_tac x ="length u" in exI, simp) 
paulson@15656
  2335
  apply (rule_tac x ="take i x" in exI) 
paulson@15656
  2336
  apply (rule_tac x ="x ! i" in exI) 
paulson@15656
  2337
  apply (rule_tac x ="y ! i" in exI, safe) 
paulson@15656
  2338
  apply (rule_tac x="drop (Suc i) x" in exI)
paulson@15656
  2339
  apply (drule sym, simp add: drop_Suc_conv_tl) 
paulson@15656
  2340
  apply (rule_tac x="drop (Suc i) y" in exI)
paulson@15656
  2341
  by (simp add: drop_Suc_conv_tl) 
paulson@15656
  2342
paulson@15656
  2343
-- {* lexord is extension of partial ordering List.lex *} 
paulson@15656
  2344
lemma lexord_lex: " (x,y) \<in> lex r = ((x,y) \<in> lexord r \<and> length x = length y)"
paulson@15656
  2345
  apply (rule_tac x = y in spec) 
paulson@15656
  2346
  apply (induct_tac x, clarsimp) 
paulson@15656
  2347
  by (clarify, case_tac x, simp, force)
paulson@15656
  2348
paulson@15656
  2349
lemma lexord_irreflexive: "(! x. (x,x) \<notin> r) \<Longrightarrow> (y,y) \<notin> lexord r"
paulson@15656
  2350
  by (induct y, auto)
paulson@15656
  2351
paulson@15656
  2352
lemma lexord_trans: 
paulson@15656
  2353
    "\<lbrakk> (x, y) \<in> lexord r; (y, z) \<in> lexord r; trans r \<rbrakk> \<Longrightarrow> (x, z) \<in> lexord r"
paulson@15656
  2354
   apply (erule rev_mp)+
paulson@15656
  2355
   apply (rule_tac x = x in spec) 
paulson@15656
  2356
  apply (rule_tac x = z in spec) 
paulson@15656
  2357
  apply ( induct_tac y, simp, clarify)
paulson@15656
  2358
  apply (case_tac xa, erule ssubst) 
paulson@15656
  2359
  apply (erule allE, erule allE) -- {* avoid simp recursion *} 
paulson@15656
  2360
  apply (case_tac x, simp, simp) 
paulson@15656
  2361
  apply (case_tac x, erule allE, erule allE, simp) 
paulson@15656
  2362
  apply (erule_tac x = listb in allE) 
paulson@15656
  2363
  apply (erule_tac x = lista in allE, simp)
paulson@15656
  2364
  apply (unfold trans_def)
paulson@15656
  2365
  by blast
paulson@15656
  2366
paulson@15656
  2367
lemma lexord_transI:  "trans r \<Longrightarrow> trans (lexord r)"
paulson@15656
  2368
  by (rule transI, drule lexord_trans, blast) 
paulson@15656
  2369
paulson@15656
  2370
lemma lexord_linear: "(! a b. (a,b)\<in> r | a = b | (b,a) \<in> r) \<Longrightarrow> (x,y) : lexord r | x = y | (y,x) : lexord r"
paulson@15656
  2371
  apply (rule_tac x = y in spec) 
paulson@15656
  2372
  apply (induct_tac x, rule allI) 
paulson@15656
  2373
  apply (case_tac x, simp, simp) 
paulson@15656
  2374
  apply (rule allI, case_tac x, simp, simp) 
paulson@15656
  2375
  by blast
paulson@15656
  2376
paulson@15656
  2377
nipkow@15392
  2378
subsubsection{*Lifting a Relation on List Elements to the Lists*}
nipkow@15302
  2379
nipkow@15302
  2380
consts  listrel :: "('a * 'a)set => ('a list * 'a list)set"
nipkow@15302
  2381
nipkow@15302
  2382
inductive "listrel(r)"
nipkow@15302
  2383
 intros
nipkow@15302
  2384
   Nil:  "([],[]) \<in> listrel r"
nipkow@15302
  2385
   Cons: "[| (x,y) \<in> r; (xs,ys) \<in> listrel r |] ==> (x#xs, y#ys) \<in> listrel r"
nipkow@15302
  2386
nipkow@15302
  2387
inductive_cases listrel_Nil1 [elim!]: "([],xs) \<in> listrel r"
nipkow@15302
  2388
inductive_cases listrel_Nil2 [elim!]: "(xs,[]) \<in> listrel r"
nipkow@15302
  2389
inductive_cases listrel_Cons1 [elim!]: "(y#ys,xs) \<in> listrel r"
nipkow@15302
  2390
inductive_cases listrel_Cons2 [elim!]: "(xs,y#ys) \<in> listrel r"
nipkow@15302
  2391
nipkow@15302
  2392
nipkow@15302
  2393
lemma listrel_mono: "r \<subseteq> s \<Longrightarrow> listrel r \<subseteq> listrel s"
nipkow@15302
  2394
apply clarify  
nipkow@15302
  2395
apply (erule listrel.induct)
nipkow@15302
  2396
apply (blast intro: listrel.intros)+
nipkow@15302
  2397
done
nipkow@15302
  2398
nipkow@15302
  2399
lemma listrel_subset: "r \<subseteq> A \<times> A \<Longrightarrow> listrel r \<subseteq> lists A \<times> lists A"
nipkow@15302
  2400
apply clarify 
nipkow@15302
  2401
apply (erule listrel.induct, auto) 
nipkow@15302
  2402
done
nipkow@15302
  2403
nipkow@15302
  2404
lemma listrel_refl: "refl A r \<Longrightarrow> refl (lists A) (listrel r)" 
nipkow@15302
  2405
apply (simp add: refl_def listrel_subset Ball_def)
nipkow@15302
  2406
apply (rule allI) 
nipkow@15302
  2407
apply (induct_tac x) 
nipkow@15302
  2408
apply (auto intro: listrel.intros)
nipkow@15302
  2409
done
nipkow@15302
  2410
nipkow@15302
  2411
lemma listrel_sym: "sym r \<Longrightarrow> sym (listrel r)" 
nipkow@15302
  2412
apply (auto simp add: sym_def)
nipkow@15302
  2413
apply (erule listrel.induct) 
nipkow@15302
  2414
apply (blast intro: listrel.intros)+
nipkow@15302
  2415
done
nipkow@15302
  2416
nipkow@15302
  2417
lemma listrel_trans: "trans r \<Longrightarrow> trans (listrel r)" 
nipkow@15302
  2418
apply (simp add: trans_def)
nipkow@15302
  2419
apply (intro allI) 
nipkow@15302
  2420
apply (rule impI) 
nipkow@15302
  2421
apply (erule listrel.induct) 
nipkow@15302
  2422
apply (blast intro: listrel.intros)+
nipkow@15302
  2423
done
nipkow@15302
  2424
nipkow@15302
  2425
theorem equiv_listrel: "equiv A r \<Longrightarrow> equiv (lists A) (listrel r)"
nipkow@15302
  2426
by (simp add: equiv_def listrel_refl listrel_sym listrel_trans) 
nipkow@15302
  2427
nipkow@15302
  2428
lemma listrel_Nil [simp]: "listrel r `` {[]} = {[]}"
nipkow@15302
  2429
by (blast intro: listrel.intros)
nipkow@15302
  2430
nipkow@15302
  2431
lemma listrel_Cons:
nipkow@15302
  2432
     "listrel r `` {x#xs} = set_Cons (r``{x}) (listrel r `` {xs})";
nipkow@15302
  2433
by (auto simp add: set_Cons_def intro: listrel.intros) 
nipkow@15302
  2434
nipkow@15302
  2435
nipkow@15392
  2436
subsection{*Miscellany*}
nipkow@15392
  2437
nipkow@15392
  2438
subsubsection {* Characters and strings *}
wenzelm@13366
  2439
wenzelm@13366
  2440
datatype nibble =
wenzelm@13366
  2441
    Nibble0 | Nibble1 | Nibble2 | Nibble3 | Nibble4 | Nibble5 | Nibble6 | Nibble7
wenzelm@13366
  2442
  | Nibble8 | Nibble9 | NibbleA | NibbleB | NibbleC | NibbleD | NibbleE | NibbleF
wenzelm@13366
  2443
wenzelm@13366
  2444
datatype char = Char nibble nibble
wenzelm@13366
  2445
  -- "Note: canonical order of character encoding coincides with standard term ordering"
wenzelm@13366
  2446
wenzelm@13366
  2447
types string = "char list"
wenzelm@13366
  2448
wenzelm@13366
  2449
syntax
wenzelm@13366
  2450
  "_Char" :: "xstr => char"    ("CHR _")
wenzelm@13366
  2451
  "_String" :: "xstr => string"    ("_")
wenzelm@13366
  2452
wenzelm@13366
  2453
parse_ast_translation {*
wenzelm@13366
  2454
  let
wenzelm@13366
  2455
    val constants = Syntax.Appl o map Syntax.Constant;
wenzelm@13366
  2456
wenzelm@13366
  2457
    fun mk_nib n = "Nibble" ^ chr (n + (if n <= 9 then ord "0" else ord "A" - 10));
wenzelm@13366
  2458
    fun mk_char c =
wenzelm@13366
  2459
      if Symbol.is_ascii c andalso Symbol.is_printable c then
wenzelm@13366
  2460
        constants ["Char", mk_nib (ord c div 16), mk_nib (ord c mod 16)]
wenzelm@13366
  2461
      else error ("Printable ASCII character expected: " ^ quote c);
wenzelm@13366
  2462
wenzelm@13366
  2463
    fun mk_string [] = Syntax.Constant "Nil"
wenzelm@13366
  2464
      | mk_string (c :: cs) = Syntax.Appl [Syntax.Constant "Cons", mk_char c, mk_string cs];
wenzelm@13366
  2465
wenzelm@13366
  2466
    fun char_ast_tr [Syntax.Variable xstr] =
wenzelm@13366
  2467
        (case Syntax.explode_xstr xstr of
wenzelm@13366
  2468
          [c] => mk_char c
wenzelm@13366
  2469
        | _ => error ("Single character expected: " ^ xstr))
wenzelm@13366
  2470
      | char_ast_tr asts = raise AST ("char_ast_tr", asts);
wenzelm@13366
  2471
wenzelm@13366
  2472
    fun string_ast_tr [Syntax.Variable xstr] =
wenzelm@13366
  2473
        (case Syntax.explode_xstr xstr of
wenzelm@13366
  2474
          [] => constants [Syntax.constrainC, "Nil", "string"]
wenzelm@13366
  2475
        | cs => mk_string cs)
wenzelm@13366
  2476
      | string_ast_tr asts = raise AST ("string_tr", asts);
wenzelm@13366
  2477
  in [("_Char", char_ast_tr), ("_String", string_ast_tr)] end;
wenzelm@13366
  2478
*}
wenzelm@13366
  2479
berghofe@15064
  2480
ML {*
berghofe@15064
  2481
fun int_of_nibble h =
berghofe@15064
  2482
  if "0" <= h andalso h <= "9" then ord h - ord "0"
berghofe@15064
  2483
  else if "A" <= h andalso h <= "F" then ord h - ord "A" + 10
berghofe@15064
  2484
  else raise Match;
berghofe@15064
  2485
berghofe@15064
  2486
fun nibble_of_int i =
berghofe@15064
  2487
  if i <= 9 then chr (ord "0" + i) else chr (ord "A" + i - 10);
berghofe@15064
  2488
*}
berghofe@15064
  2489
wenzelm@13366
  2490
print_ast_translation {*
wenzelm@13366
  2491
  let
wenzelm@13366
  2492
    fun dest_nib (Syntax.Constant c) =
wenzelm@13366
  2493
        (case explode c of
berghofe@15064
  2494
          ["N", "i", "b", "b", "l", "e", h] => int_of_nibble h
wenzelm@13366
  2495
        | _ => raise Match)
wenzelm@13366
  2496
      | dest_nib _ = raise Match;
wenzelm@13366
  2497
wenzelm@13366
  2498
    fun dest_chr c1 c2 =
wenzelm@13366
  2499
      let val c = chr (dest_nib c1 * 16 + dest_nib c2)
wenzelm@13366
  2500
      in if Symbol.is_printable c then c else raise Match end;
wenzelm@13366
  2501
wenzelm@13366
  2502
    fun dest_char (Syntax.Appl [Syntax.Constant "Char", c1, c2]) = dest_chr c1 c2
wenzelm@13366
  2503
      | dest_char _ = raise Match;
wenzelm@13366
  2504
wenzelm@13366
  2505
    fun xstr cs = Syntax.Appl [Syntax.Constant "_xstr", Syntax.Variable (Syntax.implode_xstr cs)];
wenzelm@13366
  2506
wenzelm@13366
  2507
    fun char_ast_tr' [c1, c2] = Syntax.Appl [Syntax.Constant "_Char", xstr [dest_chr c1 c2]]
wenzelm@13366
  2508
      | char_ast_tr' _ = raise Match;
wenzelm@13366
  2509
wenzelm@13366
  2510
    fun list_ast_tr' [args] = Syntax.Appl [Syntax.Constant "_String",
wenzelm@13366
  2511
            xstr (map dest_char (Syntax.unfold_ast "_args" args))]
wenzelm@13366
  2512
      | list_ast_tr' ts = raise Match;
wenzelm@13366
  2513
  in [("Char", char_ast_tr'), ("@list", list_ast_tr')] end;
wenzelm@13366
  2514
*}
wenzelm@13366
  2515
nipkow@15392
  2516
subsubsection {* Code generator setup *}
berghofe@15064
  2517
berghofe@15064
  2518
ML {*
berghofe@15064
  2519
local
berghofe@15064
  2520
berghofe@16634
  2521
fun list_codegen thy defs gr dep thyname b t =
berghofe@16634
  2522
  let val (gr', ps) = foldl_map (Codegen.invoke_codegen thy defs dep thyname false)
berghofe@15064
  2523
    (gr, HOLogic.dest_list t)
skalberg@15531
  2524
  in SOME (gr', Pretty.list "[" "]" ps) end handle TERM _ => NONE;
berghofe@15064
  2525
berghofe@15064
  2526
fun dest_nibble (Const (s, _)) = int_of_nibble (unprefix "List.nibble.Nibble" s)
berghofe@15064
  2527
  | dest_nibble _ = raise Match;
berghofe@15064
  2528
berghofe@16634
  2529
fun char_codegen thy defs gr dep thyname b (Const ("List.char.Char", _) $ c1 $ c2) =
berghofe@15064
  2530
    (let val c = chr (dest_nibble c1 * 16 + dest_nibble c2)
skalberg@15531
  2531
     in if Symbol.is_printable c then SOME (gr, Pretty.quote (Pretty.str c))
skalberg@15531
  2532
       else NONE
skalberg@15570
  2533
     end handle Fail _ => NONE | Match => NONE)
berghofe@16634
  2534
  | char_codegen thy defs gr dep thyname b _ = NONE;
berghofe@15064
  2535
berghofe@15064
  2536
in
berghofe@15064
  2537
berghofe@15064
  2538
val list_codegen_setup =
berghofe@15064
  2539
  [Codegen.add_codegen "list_codegen" list_codegen,
berghofe@15064
  2540
   Codegen.add_codegen "char_codegen" char_codegen];
berghofe@15064
  2541
berghofe@15064
  2542
end;
berghofe@16770
  2543
*}
berghofe@16770
  2544
berghofe@16770
  2545
types_code
berghofe@16770
  2546
  "list" ("_ list")
berghofe@16770
  2547
attach (term_of) {*
berghofe@15064
  2548
val term_of_list = HOLogic.mk_list;
berghofe@16770
  2549
*}
berghofe@16770
  2550
attach (test) {*
berghofe@15064
  2551
fun gen_list' aG i j = frequency
berghofe@15064
  2552
  [(i, fn () => aG j :: gen_list' aG (i-1) j), (1, fn () => [])] ()
berghofe@15064
  2553
and gen_list aG i = gen_list' aG i i;
berghofe@16770
  2554
*}
berghofe@16770
  2555
  "char" ("string")
berghofe@16770
  2556
attach (term_of) {*
berghofe@15064
  2557
val nibbleT = Type ("List.nibble", []);
berghofe@15064
  2558
berghofe@15064
  2559
fun term_of_char c =
berghofe@15064
  2560
  Const ("List.char.Char", nibbleT --> nibbleT --> Type ("List.char", [])) $
berghofe@15064
  2561
    Const ("List.nibble.Nibble" ^ nibble_of_int (ord c div 16), nibbleT) $
berghofe@15064
  2562
    Const ("List.nibble.Nibble" ^ nibble_of_int (ord c mod 16), nibbleT);
berghofe@16770
  2563
*}
berghofe@16770
  2564
attach (test) {*
berghofe@15064
  2565
fun gen_char i = chr (random_range (ord "a") (Int.min (ord "a" + i, ord "z")));
berghofe@15064
  2566
*}
berghofe@15064
  2567
berghofe@15064
  2568
consts_code "Cons" ("(_ ::/ _)")
berghofe@15064
  2569
berghofe@15064
  2570
setup list_codegen_setup
berghofe@15064
  2571
wenzelm@13122
  2572
end