src/HOL/List.thy
author wenzelm
Tue Aug 06 11:22:05 2002 +0200 (2002-08-06)
changeset 13462 56610e2ba220
parent 13366 114b7c14084a
child 13480 bb72bd43c6c3
permissions -rw-r--r--
sane interface for simprocs;
wenzelm@13462
     1
(*  Title:      HOL/List.thy
wenzelm@13462
     2
    ID:         $Id$
wenzelm@13462
     3
    Author:     Tobias Nipkow
wenzelm@13462
     4
    License:    GPL (GNU GENERAL PUBLIC LICENSE)
clasohm@923
     5
*)
clasohm@923
     6
wenzelm@13114
     7
header {* The datatype of finite lists *}
wenzelm@13122
     8
wenzelm@13122
     9
theory List = PreList:
clasohm@923
    10
wenzelm@13142
    11
datatype 'a list =
wenzelm@13366
    12
    Nil    ("[]")
wenzelm@13366
    13
  | Cons 'a  "'a list"    (infixr "#" 65)
clasohm@923
    14
clasohm@923
    15
consts
wenzelm@13366
    16
  "@" :: "'a list => 'a list => 'a list"    (infixr 65)
wenzelm@13366
    17
  filter:: "('a => bool) => 'a list => 'a list"
wenzelm@13366
    18
  concat:: "'a list list => 'a list"
wenzelm@13366
    19
  foldl :: "('b => 'a => 'b) => 'b => 'a list => 'b"
wenzelm@13366
    20
  foldr :: "('a => 'b => 'b) => 'a list => 'b => 'b"
wenzelm@13366
    21
  hd:: "'a list => 'a"
wenzelm@13366
    22
  tl:: "'a list => 'a list"
wenzelm@13366
    23
  last:: "'a list => 'a"
wenzelm@13366
    24
  butlast :: "'a list => 'a list"
wenzelm@13366
    25
  set :: "'a list => 'a set"
wenzelm@13366
    26
  list_all:: "('a => bool) => ('a list => bool)"
wenzelm@13366
    27
  list_all2 :: "('a => 'b => bool) => 'a list => 'b list => bool"
wenzelm@13366
    28
  map :: "('a=>'b) => ('a list => 'b list)"
wenzelm@13366
    29
  mem :: "'a => 'a list => bool"    (infixl 55)
wenzelm@13366
    30
  nth :: "'a list => nat => 'a"    (infixl "!" 100)
wenzelm@13366
    31
  list_update :: "'a list => nat => 'a => 'a list"
wenzelm@13366
    32
  take:: "nat => 'a list => 'a list"
wenzelm@13366
    33
  drop:: "nat => 'a list => 'a list"
wenzelm@13366
    34
  takeWhile :: "('a => bool) => 'a list => 'a list"
wenzelm@13366
    35
  dropWhile :: "('a => bool) => 'a list => 'a list"
wenzelm@13366
    36
  rev :: "'a list => 'a list"
wenzelm@13366
    37
  zip :: "'a list => 'b list => ('a * 'b) list"
wenzelm@13366
    38
  upt :: "nat => nat => nat list" ("(1[_../_'(])")
wenzelm@13366
    39
  remdups :: "'a list => 'a list"
wenzelm@13366
    40
  null:: "'a list => bool"
wenzelm@13366
    41
  "distinct":: "'a list => bool"
wenzelm@13366
    42
  replicate :: "nat => 'a => 'a list"
clasohm@923
    43
nipkow@13146
    44
nonterminals lupdbinds lupdbind
nipkow@5077
    45
clasohm@923
    46
syntax
wenzelm@13366
    47
  -- {* list Enumeration *}
wenzelm@13366
    48
  "@list" :: "args => 'a list"    ("[(_)]")
clasohm@923
    49
wenzelm@13366
    50
  -- {* Special syntax for filter *}
wenzelm@13366
    51
  "@filter" :: "[pttrn, 'a list, bool] => 'a list"    ("(1[_:_./ _])")
clasohm@923
    52
wenzelm@13366
    53
  -- {* list update *}
wenzelm@13366
    54
  "_lupdbind":: "['a, 'a] => lupdbind"    ("(2_ :=/ _)")
wenzelm@13366
    55
  "" :: "lupdbind => lupdbinds"    ("_")
wenzelm@13366
    56
  "_lupdbinds" :: "[lupdbind, lupdbinds] => lupdbinds"    ("_,/ _")
wenzelm@13366
    57
  "_LUpdate" :: "['a, lupdbinds] => 'a"    ("_/[(_)]" [900,0] 900)
nipkow@5077
    58
wenzelm@13366
    59
  upto:: "nat => nat => nat list"    ("(1[_../_])")
nipkow@5427
    60
clasohm@923
    61
translations
wenzelm@13366
    62
  "[x, xs]" == "x#[xs]"
wenzelm@13366
    63
  "[x]" == "x#[]"
wenzelm@13366
    64
  "[x:xs . P]"== "filter (%x. P) xs"
clasohm@923
    65
wenzelm@13366
    66
  "_LUpdate xs (_lupdbinds b bs)"== "_LUpdate (_LUpdate xs b) bs"
wenzelm@13366
    67
  "xs[i:=x]" == "list_update xs i x"
nipkow@5077
    68
wenzelm@13366
    69
  "[i..j]" == "[i..(Suc j)(]"
nipkow@5427
    70
nipkow@5427
    71
wenzelm@12114
    72
syntax (xsymbols)
wenzelm@13366
    73
  "@filter" :: "[pttrn, 'a list, bool] => 'a list"("(1[_\<in>_ ./ _])")
paulson@3342
    74
paulson@3342
    75
wenzelm@13142
    76
text {*
wenzelm@13366
    77
  Function @{text size} is overloaded for all datatypes.Users may
wenzelm@13366
    78
  refer to the list version as @{text length}. *}
wenzelm@13142
    79
wenzelm@13142
    80
syntax length :: "'a list => nat"
wenzelm@13142
    81
translations "length" => "size :: _ list => nat"
wenzelm@13114
    82
wenzelm@13142
    83
typed_print_translation {*
wenzelm@13366
    84
  let
wenzelm@13366
    85
    fun size_tr' _ (Type ("fun", (Type ("list", _) :: _))) [t] =
wenzelm@13366
    86
          Syntax.const "length" $ t
wenzelm@13366
    87
      | size_tr' _ _ _ = raise Match;
wenzelm@13366
    88
  in [("size", size_tr')] end
wenzelm@13114
    89
*}
paulson@3437
    90
berghofe@5183
    91
primrec
nipkow@13145
    92
"hd(x#xs) = x"
berghofe@5183
    93
primrec
nipkow@13145
    94
"tl([]) = []"
nipkow@13145
    95
"tl(x#xs) = xs"
berghofe@5183
    96
primrec
nipkow@13145
    97
"null([]) = True"
nipkow@13145
    98
"null(x#xs) = False"
paulson@8972
    99
primrec
nipkow@13145
   100
"last(x#xs) = (if xs=[] then x else last xs)"
berghofe@5183
   101
primrec
nipkow@13145
   102
"butlast []= []"
nipkow@13145
   103
"butlast(x#xs) = (if xs=[] then [] else x#butlast xs)"
berghofe@5183
   104
primrec
nipkow@13145
   105
"x mem [] = False"
nipkow@13145
   106
"x mem (y#ys) = (if y=x then True else x mem ys)"
oheimb@5518
   107
primrec
nipkow@13145
   108
"set [] = {}"
nipkow@13145
   109
"set (x#xs) = insert x (set xs)"
berghofe@5183
   110
primrec
nipkow@13145
   111
list_all_Nil:"list_all P [] = True"
nipkow@13145
   112
list_all_Cons: "list_all P (x#xs) = (P(x) \<and> list_all P xs)"
oheimb@5518
   113
primrec
nipkow@13145
   114
"map f [] = []"
nipkow@13145
   115
"map f (x#xs) = f(x)#map f xs"
berghofe@5183
   116
primrec
nipkow@13145
   117
append_Nil:"[]@ys = ys"
nipkow@13145
   118
append_Cons: "(x#xs)@ys = x#(xs@ys)"
berghofe@5183
   119
primrec
nipkow@13145
   120
"rev([]) = []"
nipkow@13145
   121
"rev(x#xs) = rev(xs) @ [x]"
berghofe@5183
   122
primrec
nipkow@13145
   123
"filter P [] = []"
nipkow@13145
   124
"filter P (x#xs) = (if P x then x#filter P xs else filter P xs)"
berghofe@5183
   125
primrec
nipkow@13145
   126
foldl_Nil:"foldl f a [] = a"
nipkow@13145
   127
foldl_Cons: "foldl f a (x#xs) = foldl f (f a x) xs"
berghofe@5183
   128
primrec
nipkow@13145
   129
"foldr f [] a = a"
nipkow@13145
   130
"foldr f (x#xs) a = f x (foldr f xs a)"
paulson@8000
   131
primrec
nipkow@13145
   132
"concat([]) = []"
nipkow@13145
   133
"concat(x#xs) = x @ concat(xs)"
berghofe@5183
   134
primrec
nipkow@13145
   135
drop_Nil:"drop n [] = []"
nipkow@13145
   136
drop_Cons: "drop n (x#xs) = (case n of 0 => x#xs | Suc(m) => drop m xs)"
nipkow@13145
   137
-- {* Warning: simpset does not contain this definition *}
nipkow@13145
   138
-- {* but separate theorems for @{text "n = 0"} and @{text "n = Suc k"} *}
berghofe@5183
   139
primrec
nipkow@13145
   140
take_Nil:"take n [] = []"
nipkow@13145
   141
take_Cons: "take n (x#xs) = (case n of 0 => [] | Suc(m) => x # take m xs)"
nipkow@13145
   142
-- {* Warning: simpset does not contain this definition *}
nipkow@13145
   143
-- {* but separate theorems for @{text "n = 0"} and @{text "n = Suc k"} *}
berghofe@5183
   144
primrec
nipkow@13145
   145
nth_Cons:"(x#xs)!n = (case n of 0 => x | (Suc k) => xs!k)"
nipkow@13145
   146
-- {* Warning: simpset does not contain this definition *}
nipkow@13145
   147
-- {* but separate theorems for @{text "n = 0"} and @{text "n = Suc k"} *}
wenzelm@13142
   148
primrec
nipkow@13145
   149
"[][i:=v] = []"
nipkow@13145
   150
"(x#xs)[i:=v] =
nipkow@13145
   151
(case i of 0 => v # xs
nipkow@13145
   152
| Suc j => x # xs[j:=v])"
berghofe@5183
   153
primrec
nipkow@13145
   154
"takeWhile P [] = []"
nipkow@13145
   155
"takeWhile P (x#xs) = (if P x then x#takeWhile P xs else [])"
berghofe@5183
   156
primrec
nipkow@13145
   157
"dropWhile P [] = []"
nipkow@13145
   158
"dropWhile P (x#xs) = (if P x then dropWhile P xs else x#xs)"
berghofe@5183
   159
primrec
nipkow@13145
   160
"zip xs [] = []"
nipkow@13145
   161
zip_Cons: "zip xs (y#ys) = (case xs of [] => [] | z#zs => (z,y)#zip zs ys)"
nipkow@13145
   162
-- {* Warning: simpset does not contain this definition *}
nipkow@13145
   163
-- {* but separate theorems for @{text "xs = []"} and @{text "xs = z # zs"} *}
nipkow@5427
   164
primrec
nipkow@13145
   165
upt_0: "[i..0(] = []"
nipkow@13145
   166
upt_Suc: "[i..(Suc j)(] = (if i <= j then [i..j(] @ [j] else [])"
berghofe@5183
   167
primrec
nipkow@13145
   168
"distinct [] = True"
nipkow@13145
   169
"distinct (x#xs) = (x ~: set xs \<and> distinct xs)"
berghofe@5183
   170
primrec
nipkow@13145
   171
"remdups [] = []"
nipkow@13145
   172
"remdups (x#xs) = (if x : set xs then remdups xs else x # remdups xs)"
berghofe@5183
   173
primrec
nipkow@13147
   174
replicate_0: "replicate 0 x = []"
nipkow@13145
   175
replicate_Suc: "replicate (Suc n) x = x # replicate n x"
nipkow@8115
   176
defs
wenzelm@13114
   177
 list_all2_def:
wenzelm@13142
   178
 "list_all2 P xs ys == length xs = length ys \<and> (\<forall>(x, y) \<in> set (zip xs ys). P x y)"
nipkow@8115
   179
paulson@3196
   180
wenzelm@13142
   181
subsection {* Lexicographic orderings on lists *}
nipkow@5281
   182
nipkow@5281
   183
consts
nipkow@13145
   184
lexn :: "('a * 'a)set => nat => ('a list * 'a list)set"
nipkow@5281
   185
primrec
nipkow@13145
   186
"lexn r 0 = {}"
nipkow@13145
   187
"lexn r (Suc n) =
nipkow@13145
   188
(prod_fun (%(x,xs). x#xs) (%(x,xs). x#xs) ` (r <*lex*> lexn r n)) Int
nipkow@13145
   189
{(xs,ys). length xs = Suc n \<and> length ys = Suc n}"
nipkow@5281
   190
nipkow@5281
   191
constdefs
nipkow@13145
   192
lex :: "('a \<times> 'a) set => ('a list \<times> 'a list) set"
nipkow@13145
   193
"lex r == \<Union>n. lexn r n"
nipkow@5281
   194
nipkow@13145
   195
lexico :: "('a \<times> 'a) set => ('a list \<times> 'a list) set"
nipkow@13145
   196
"lexico r == inv_image (less_than <*lex*> lex r) (%xs. (length xs, xs))"
paulson@9336
   197
nipkow@13145
   198
sublist :: "'a list => nat set => 'a list"
nipkow@13145
   199
"sublist xs A == map fst (filter (%p. snd p : A) (zip xs [0..size xs(]))"
nipkow@5281
   200
wenzelm@13114
   201
wenzelm@13142
   202
lemma not_Cons_self [simp]: "xs \<noteq> x # xs"
nipkow@13145
   203
by (induct xs) auto
wenzelm@13114
   204
wenzelm@13142
   205
lemmas not_Cons_self2 [simp] = not_Cons_self [symmetric]
wenzelm@13114
   206
wenzelm@13142
   207
lemma neq_Nil_conv: "(xs \<noteq> []) = (\<exists>y ys. xs = y # ys)"
nipkow@13145
   208
by (induct xs) auto
wenzelm@13114
   209
wenzelm@13142
   210
lemma length_induct:
nipkow@13145
   211
"(!!xs. \<forall>ys. length ys < length xs --> P ys ==> P xs) ==> P xs"
nipkow@13145
   212
by (rule measure_induct [of length]) rules
wenzelm@13114
   213
wenzelm@13114
   214
wenzelm@13142
   215
subsection {* @{text lists}: the list-forming operator over sets *}
wenzelm@13114
   216
wenzelm@13142
   217
consts lists :: "'a set => 'a list set"
wenzelm@13142
   218
inductive "lists A"
nipkow@13145
   219
intros
nipkow@13145
   220
Nil [intro!]: "[]: lists A"
nipkow@13145
   221
Cons [intro!]: "[| a: A;l: lists A|] ==> a#l : lists A"
wenzelm@13114
   222
wenzelm@13142
   223
inductive_cases listsE [elim!]: "x#l : lists A"
wenzelm@13114
   224
wenzelm@13366
   225
lemma lists_mono [mono]: "A \<subseteq> B ==> lists A \<subseteq> lists B"
nipkow@13145
   226
by (unfold lists.defs) (blast intro!: lfp_mono)
wenzelm@13114
   227
wenzelm@13142
   228
lemma lists_IntI [rule_format]:
nipkow@13145
   229
"l: lists A ==> l: lists B --> l: lists (A Int B)"
nipkow@13145
   230
apply (erule lists.induct)
nipkow@13145
   231
apply blast+
nipkow@13145
   232
done
wenzelm@13142
   233
wenzelm@13142
   234
lemma lists_Int_eq [simp]: "lists (A \<inter> B) = lists A \<inter> lists B"
nipkow@13145
   235
apply (rule mono_Int [THEN equalityI])
nipkow@13145
   236
apply (simp add: mono_def lists_mono)
nipkow@13145
   237
apply (blast intro!: lists_IntI)
nipkow@13145
   238
done
wenzelm@13114
   239
wenzelm@13142
   240
lemma append_in_lists_conv [iff]:
nipkow@13145
   241
"(xs @ ys : lists A) = (xs : lists A \<and> ys : lists A)"
nipkow@13145
   242
by (induct xs) auto
wenzelm@13142
   243
wenzelm@13142
   244
wenzelm@13142
   245
subsection {* @{text length} *}
wenzelm@13114
   246
wenzelm@13142
   247
text {*
nipkow@13145
   248
Needs to come before @{text "@"} because of theorem @{text
nipkow@13145
   249
append_eq_append_conv}.
wenzelm@13142
   250
*}
wenzelm@13114
   251
wenzelm@13142
   252
lemma length_append [simp]: "length (xs @ ys) = length xs + length ys"
nipkow@13145
   253
by (induct xs) auto
wenzelm@13114
   254
wenzelm@13142
   255
lemma length_map [simp]: "length (map f xs) = length xs"
nipkow@13145
   256
by (induct xs) auto
wenzelm@13114
   257
wenzelm@13142
   258
lemma length_rev [simp]: "length (rev xs) = length xs"
nipkow@13145
   259
by (induct xs) auto
wenzelm@13114
   260
wenzelm@13142
   261
lemma length_tl [simp]: "length (tl xs) = length xs - 1"
nipkow@13145
   262
by (cases xs) auto
wenzelm@13114
   263
wenzelm@13142
   264
lemma length_0_conv [iff]: "(length xs = 0) = (xs = [])"
nipkow@13145
   265
by (induct xs) auto
wenzelm@13114
   266
wenzelm@13142
   267
lemma length_greater_0_conv [iff]: "(0 < length xs) = (xs \<noteq> [])"
nipkow@13145
   268
by (induct xs) auto
wenzelm@13114
   269
wenzelm@13114
   270
lemma length_Suc_conv:
nipkow@13145
   271
"(length xs = Suc n) = (\<exists>y ys. xs = y # ys \<and> length ys = n)"
nipkow@13145
   272
by (induct xs) auto
wenzelm@13142
   273
wenzelm@13114
   274
wenzelm@13142
   275
subsection {* @{text "@"} -- append *}
wenzelm@13114
   276
wenzelm@13142
   277
lemma append_assoc [simp]: "(xs @ ys) @ zs = xs @ (ys @ zs)"
nipkow@13145
   278
by (induct xs) auto
wenzelm@13114
   279
wenzelm@13142
   280
lemma append_Nil2 [simp]: "xs @ [] = xs"
nipkow@13145
   281
by (induct xs) auto
nipkow@3507
   282
wenzelm@13142
   283
lemma append_is_Nil_conv [iff]: "(xs @ ys = []) = (xs = [] \<and> ys = [])"
nipkow@13145
   284
by (induct xs) auto
wenzelm@13114
   285
wenzelm@13142
   286
lemma Nil_is_append_conv [iff]: "([] = xs @ ys) = (xs = [] \<and> ys = [])"
nipkow@13145
   287
by (induct xs) auto
wenzelm@13114
   288
wenzelm@13142
   289
lemma append_self_conv [iff]: "(xs @ ys = xs) = (ys = [])"
nipkow@13145
   290
by (induct xs) auto
wenzelm@13114
   291
wenzelm@13142
   292
lemma self_append_conv [iff]: "(xs = xs @ ys) = (ys = [])"
nipkow@13145
   293
by (induct xs) auto
wenzelm@13114
   294
wenzelm@13142
   295
lemma append_eq_append_conv [rule_format, simp]:
wenzelm@13142
   296
 "\<forall>ys. length xs = length ys \<or> length us = length vs
nipkow@13145
   297
 --> (xs@us = ys@vs) = (xs=ys \<and> us=vs)"
nipkow@13145
   298
apply (induct_tac xs)
nipkow@13145
   299
 apply(rule allI)
nipkow@13145
   300
 apply (case_tac ys)
nipkow@13145
   301
apply simp
nipkow@13145
   302
 apply force
nipkow@13145
   303
apply (rule allI)
nipkow@13145
   304
apply (case_tac ys)
nipkow@13145
   305
 apply force
nipkow@13145
   306
apply simp
nipkow@13145
   307
done
wenzelm@13142
   308
wenzelm@13142
   309
lemma same_append_eq [iff]: "(xs @ ys = xs @ zs) = (ys = zs)"
nipkow@13145
   310
by simp
wenzelm@13142
   311
wenzelm@13142
   312
lemma append1_eq_conv [iff]: "(xs @ [x] = ys @ [y]) = (xs = ys \<and> x = y)"
nipkow@13145
   313
by simp
wenzelm@13114
   314
wenzelm@13142
   315
lemma append_same_eq [iff]: "(ys @ xs = zs @ xs) = (ys = zs)"
nipkow@13145
   316
by simp
wenzelm@13114
   317
wenzelm@13142
   318
lemma append_self_conv2 [iff]: "(xs @ ys = ys) = (xs = [])"
nipkow@13145
   319
using append_same_eq [of _ _ "[]"] by auto
nipkow@3507
   320
wenzelm@13142
   321
lemma self_append_conv2 [iff]: "(ys = xs @ ys) = (xs = [])"
nipkow@13145
   322
using append_same_eq [of "[]"] by auto
wenzelm@13114
   323
wenzelm@13142
   324
lemma hd_Cons_tl [simp]: "xs \<noteq> [] ==> hd xs # tl xs = xs"
nipkow@13145
   325
by (induct xs) auto
wenzelm@13114
   326
wenzelm@13142
   327
lemma hd_append: "hd (xs @ ys) = (if xs = [] then hd ys else hd xs)"
nipkow@13145
   328
by (induct xs) auto
wenzelm@13114
   329
wenzelm@13142
   330
lemma hd_append2 [simp]: "xs \<noteq> [] ==> hd (xs @ ys) = hd xs"
nipkow@13145
   331
by (simp add: hd_append split: list.split)
wenzelm@13114
   332
wenzelm@13142
   333
lemma tl_append: "tl (xs @ ys) = (case xs of [] => tl ys | z#zs => zs @ ys)"
nipkow@13145
   334
by (simp split: list.split)
wenzelm@13114
   335
wenzelm@13142
   336
lemma tl_append2 [simp]: "xs \<noteq> [] ==> tl (xs @ ys) = tl xs @ ys"
nipkow@13145
   337
by (simp add: tl_append split: list.split)
wenzelm@13114
   338
wenzelm@13114
   339
wenzelm@13142
   340
text {* Trivial rules for solving @{text "@"}-equations automatically. *}
wenzelm@13114
   341
wenzelm@13114
   342
lemma eq_Nil_appendI: "xs = ys ==> xs = [] @ ys"
nipkow@13145
   343
by simp
wenzelm@13114
   344
wenzelm@13142
   345
lemma Cons_eq_appendI:
nipkow@13145
   346
"[| x # xs1 = ys; xs = xs1 @ zs |] ==> x # xs = ys @ zs"
nipkow@13145
   347
by (drule sym) simp
wenzelm@13114
   348
wenzelm@13142
   349
lemma append_eq_appendI:
nipkow@13145
   350
"[| xs @ xs1 = zs; ys = xs1 @ us |] ==> xs @ ys = zs @ us"
nipkow@13145
   351
by (drule sym) simp
wenzelm@13114
   352
wenzelm@13114
   353
wenzelm@13142
   354
text {*
nipkow@13145
   355
Simplification procedure for all list equalities.
nipkow@13145
   356
Currently only tries to rearrange @{text "@"} to see if
nipkow@13145
   357
- both lists end in a singleton list,
nipkow@13145
   358
- or both lists end in the same list.
wenzelm@13142
   359
*}
wenzelm@13142
   360
wenzelm@13142
   361
ML_setup {*
nipkow@3507
   362
local
nipkow@3507
   363
wenzelm@13122
   364
val append_assoc = thm "append_assoc";
wenzelm@13122
   365
val append_Nil = thm "append_Nil";
wenzelm@13122
   366
val append_Cons = thm "append_Cons";
wenzelm@13122
   367
val append1_eq_conv = thm "append1_eq_conv";
wenzelm@13122
   368
val append_same_eq = thm "append_same_eq";
wenzelm@13122
   369
wenzelm@13114
   370
fun last (cons as Const("List.list.Cons",_) $ _ $ xs) =
wenzelm@13462
   371
  (case xs of Const("List.list.Nil",_) => cons | _ => last xs)
wenzelm@13462
   372
  | last (Const("List.op @",_) $ _ $ ys) = last ys
wenzelm@13462
   373
  | last t = t;
wenzelm@13114
   374
wenzelm@13114
   375
fun list1 (Const("List.list.Cons",_) $ _ $ Const("List.list.Nil",_)) = true
wenzelm@13462
   376
  | list1 _ = false;
wenzelm@13114
   377
wenzelm@13114
   378
fun butlast ((cons as Const("List.list.Cons",_) $ x) $ xs) =
wenzelm@13462
   379
  (case xs of Const("List.list.Nil",_) => xs | _ => cons $ butlast xs)
wenzelm@13462
   380
  | butlast ((app as Const("List.op @",_) $ xs) $ ys) = app $ butlast ys
wenzelm@13462
   381
  | butlast xs = Const("List.list.Nil",fastype_of xs);
wenzelm@13114
   382
wenzelm@13114
   383
val rearr_tac =
wenzelm@13462
   384
  simp_tac (HOL_basic_ss addsimps [append_assoc, append_Nil, append_Cons]);
wenzelm@13114
   385
wenzelm@13114
   386
fun list_eq sg _ (F as (eq as Const(_,eqT)) $ lhs $ rhs) =
wenzelm@13462
   387
  let
wenzelm@13462
   388
    val lastl = last lhs and lastr = last rhs;
wenzelm@13462
   389
    fun rearr conv =
wenzelm@13462
   390
      let
wenzelm@13462
   391
        val lhs1 = butlast lhs and rhs1 = butlast rhs;
wenzelm@13462
   392
        val Type(_,listT::_) = eqT
wenzelm@13462
   393
        val appT = [listT,listT] ---> listT
wenzelm@13462
   394
        val app = Const("List.op @",appT)
wenzelm@13462
   395
        val F2 = eq $ (app$lhs1$lastl) $ (app$rhs1$lastr)
wenzelm@13462
   396
        val ct = cterm_of sg (HOLogic.mk_Trueprop(HOLogic.mk_eq(F,F2)))
wenzelm@13462
   397
        val thm = prove_goalw_cterm [] ct (K [rearr_tac 1])
wenzelm@13462
   398
          handle ERROR =>
wenzelm@13462
   399
            error("The error(s) above occurred while trying to prove " ^
wenzelm@13462
   400
              string_of_cterm ct);
wenzelm@13462
   401
      in Some ((conv RS (thm RS trans)) RS eq_reflection) end;
wenzelm@13114
   402
wenzelm@13462
   403
  in
wenzelm@13462
   404
    if list1 lastl andalso list1 lastr then rearr append1_eq_conv
wenzelm@13462
   405
    else if lastl aconv lastr then rearr append_same_eq
wenzelm@13462
   406
    else None
wenzelm@13462
   407
  end;
wenzelm@13462
   408
wenzelm@13114
   409
in
wenzelm@13462
   410
wenzelm@13462
   411
val list_eq_simproc =
wenzelm@13462
   412
  Simplifier.simproc (Theory.sign_of (the_context ())) "list_eq" ["(xs::'a list) = ys"] list_eq;
wenzelm@13462
   413
wenzelm@13114
   414
end;
wenzelm@13114
   415
wenzelm@13114
   416
Addsimprocs [list_eq_simproc];
wenzelm@13114
   417
*}
wenzelm@13114
   418
wenzelm@13114
   419
wenzelm@13142
   420
subsection {* @{text map} *}
wenzelm@13114
   421
wenzelm@13142
   422
lemma map_ext: "(!!x. x : set xs --> f x = g x) ==> map f xs = map g xs"
nipkow@13145
   423
by (induct xs) simp_all
wenzelm@13114
   424
wenzelm@13142
   425
lemma map_ident [simp]: "map (\<lambda>x. x) = (\<lambda>xs. xs)"
nipkow@13145
   426
by (rule ext, induct_tac xs) auto
wenzelm@13114
   427
wenzelm@13142
   428
lemma map_append [simp]: "map f (xs @ ys) = map f xs @ map f ys"
nipkow@13145
   429
by (induct xs) auto
wenzelm@13114
   430
wenzelm@13142
   431
lemma map_compose: "map (f o g) xs = map f (map g xs)"
nipkow@13145
   432
by (induct xs) (auto simp add: o_def)
wenzelm@13114
   433
wenzelm@13142
   434
lemma rev_map: "rev (map f xs) = map f (rev xs)"
nipkow@13145
   435
by (induct xs) auto
wenzelm@13114
   436
wenzelm@13366
   437
lemma map_cong [recdef_cong]:
nipkow@13145
   438
"xs = ys ==> (!!x. x : set ys ==> f x = g x) ==> map f xs = map g ys"
nipkow@13145
   439
-- {* a congruence rule for @{text map} *}
nipkow@13145
   440
by (clarify, induct ys) auto
wenzelm@13114
   441
wenzelm@13142
   442
lemma map_is_Nil_conv [iff]: "(map f xs = []) = (xs = [])"
nipkow@13145
   443
by (cases xs) auto
wenzelm@13114
   444
wenzelm@13142
   445
lemma Nil_is_map_conv [iff]: "([] = map f xs) = (xs = [])"
nipkow@13145
   446
by (cases xs) auto
wenzelm@13114
   447
wenzelm@13114
   448
lemma map_eq_Cons:
nipkow@13145
   449
"(map f xs = y # ys) = (\<exists>x xs'. xs = x # xs' \<and> f x = y \<and> map f xs' = ys)"
nipkow@13145
   450
by (cases xs) auto
wenzelm@13114
   451
wenzelm@13114
   452
lemma map_injective:
nipkow@13145
   453
"!!xs. map f xs = map f ys ==> (\<forall>x y. f x = f y --> x = y) ==> xs = ys"
nipkow@13145
   454
by (induct ys) (auto simp add: map_eq_Cons)
wenzelm@13114
   455
wenzelm@13114
   456
lemma inj_mapI: "inj f ==> inj (map f)"
nipkow@13145
   457
by (rules dest: map_injective injD intro: injI)
wenzelm@13114
   458
wenzelm@13114
   459
lemma inj_mapD: "inj (map f) ==> inj f"
nipkow@13145
   460
apply (unfold inj_on_def)
nipkow@13145
   461
apply clarify
nipkow@13145
   462
apply (erule_tac x = "[x]" in ballE)
nipkow@13145
   463
 apply (erule_tac x = "[y]" in ballE)
nipkow@13145
   464
apply simp
nipkow@13145
   465
 apply blast
nipkow@13145
   466
apply blast
nipkow@13145
   467
done
wenzelm@13114
   468
wenzelm@13114
   469
lemma inj_map: "inj (map f) = inj f"
nipkow@13145
   470
by (blast dest: inj_mapD intro: inj_mapI)
wenzelm@13114
   471
wenzelm@13114
   472
wenzelm@13142
   473
subsection {* @{text rev} *}
wenzelm@13114
   474
wenzelm@13142
   475
lemma rev_append [simp]: "rev (xs @ ys) = rev ys @ rev xs"
nipkow@13145
   476
by (induct xs) auto
wenzelm@13114
   477
wenzelm@13142
   478
lemma rev_rev_ident [simp]: "rev (rev xs) = xs"
nipkow@13145
   479
by (induct xs) auto
wenzelm@13114
   480
wenzelm@13142
   481
lemma rev_is_Nil_conv [iff]: "(rev xs = []) = (xs = [])"
nipkow@13145
   482
by (induct xs) auto
wenzelm@13114
   483
wenzelm@13142
   484
lemma Nil_is_rev_conv [iff]: "([] = rev xs) = (xs = [])"
nipkow@13145
   485
by (induct xs) auto
wenzelm@13114
   486
wenzelm@13142
   487
lemma rev_is_rev_conv [iff]: "!!ys. (rev xs = rev ys) = (xs = ys)"
nipkow@13145
   488
apply (induct xs)
nipkow@13145
   489
 apply force
nipkow@13145
   490
apply (case_tac ys)
nipkow@13145
   491
 apply simp
nipkow@13145
   492
apply force
nipkow@13145
   493
done
wenzelm@13114
   494
wenzelm@13366
   495
lemma rev_induct [case_names Nil snoc]:
wenzelm@13366
   496
  "[| P []; !!x xs. P xs ==> P (xs @ [x]) |] ==> P xs"
nipkow@13145
   497
apply(subst rev_rev_ident[symmetric])
nipkow@13145
   498
apply(rule_tac list = "rev xs" in list.induct, simp_all)
nipkow@13145
   499
done
wenzelm@13114
   500
nipkow@13145
   501
ML {* val rev_induct_tac = induct_thm_tac (thm "rev_induct") *}-- "compatibility"
wenzelm@13114
   502
wenzelm@13366
   503
lemma rev_exhaust [case_names Nil snoc]:
wenzelm@13366
   504
  "(xs = [] ==> P) ==>(!!ys y. xs = ys @ [y] ==> P) ==> P"
nipkow@13145
   505
by (induct xs rule: rev_induct) auto
wenzelm@13114
   506
wenzelm@13366
   507
lemmas rev_cases = rev_exhaust
wenzelm@13366
   508
wenzelm@13114
   509
wenzelm@13142
   510
subsection {* @{text set} *}
wenzelm@13114
   511
wenzelm@13142
   512
lemma finite_set [iff]: "finite (set xs)"
nipkow@13145
   513
by (induct xs) auto
wenzelm@13114
   514
wenzelm@13142
   515
lemma set_append [simp]: "set (xs @ ys) = (set xs \<union> set ys)"
nipkow@13145
   516
by (induct xs) auto
wenzelm@13114
   517
wenzelm@13142
   518
lemma set_subset_Cons: "set xs \<subseteq> set (x # xs)"
nipkow@13145
   519
by auto
wenzelm@13114
   520
wenzelm@13142
   521
lemma set_empty [iff]: "(set xs = {}) = (xs = [])"
nipkow@13145
   522
by (induct xs) auto
wenzelm@13114
   523
wenzelm@13142
   524
lemma set_rev [simp]: "set (rev xs) = set xs"
nipkow@13145
   525
by (induct xs) auto
wenzelm@13114
   526
wenzelm@13142
   527
lemma set_map [simp]: "set (map f xs) = f`(set xs)"
nipkow@13145
   528
by (induct xs) auto
wenzelm@13114
   529
wenzelm@13142
   530
lemma set_filter [simp]: "set (filter P xs) = {x. x : set xs \<and> P x}"
nipkow@13145
   531
by (induct xs) auto
wenzelm@13114
   532
wenzelm@13142
   533
lemma set_upt [simp]: "set[i..j(] = {k. i \<le> k \<and> k < j}"
nipkow@13145
   534
apply (induct j)
nipkow@13145
   535
 apply simp_all
nipkow@13145
   536
apply(erule ssubst)
nipkow@13145
   537
apply auto
nipkow@13145
   538
done
wenzelm@13114
   539
wenzelm@13142
   540
lemma in_set_conv_decomp: "(x : set xs) = (\<exists>ys zs. xs = ys @ x # zs)"
nipkow@13145
   541
apply (induct xs)
nipkow@13145
   542
 apply simp
nipkow@13145
   543
apply simp
nipkow@13145
   544
apply (rule iffI)
nipkow@13145
   545
 apply (blast intro: eq_Nil_appendI Cons_eq_appendI)
nipkow@13145
   546
apply (erule exE)+
nipkow@13145
   547
apply (case_tac ys)
nipkow@13145
   548
apply auto
nipkow@13145
   549
done
wenzelm@13142
   550
wenzelm@13142
   551
lemma in_lists_conv_set: "(xs : lists A) = (\<forall>x \<in> set xs. x : A)"
nipkow@13145
   552
-- {* eliminate @{text lists} in favour of @{text set} *}
nipkow@13145
   553
by (induct xs) auto
wenzelm@13142
   554
wenzelm@13142
   555
lemma in_listsD [dest!]: "xs \<in> lists A ==> \<forall>x\<in>set xs. x \<in> A"
nipkow@13145
   556
by (rule in_lists_conv_set [THEN iffD1])
wenzelm@13142
   557
wenzelm@13142
   558
lemma in_listsI [intro!]: "\<forall>x\<in>set xs. x \<in> A ==> xs \<in> lists A"
nipkow@13145
   559
by (rule in_lists_conv_set [THEN iffD2])
wenzelm@13114
   560
wenzelm@13114
   561
wenzelm@13142
   562
subsection {* @{text mem} *}
wenzelm@13114
   563
wenzelm@13114
   564
lemma set_mem_eq: "(x mem xs) = (x : set xs)"
nipkow@13145
   565
by (induct xs) auto
wenzelm@13114
   566
wenzelm@13114
   567
wenzelm@13142
   568
subsection {* @{text list_all} *}
wenzelm@13114
   569
wenzelm@13142
   570
lemma list_all_conv: "list_all P xs = (\<forall>x \<in> set xs. P x)"
nipkow@13145
   571
by (induct xs) auto
wenzelm@13114
   572
wenzelm@13142
   573
lemma list_all_append [simp]:
nipkow@13145
   574
"list_all P (xs @ ys) = (list_all P xs \<and> list_all P ys)"
nipkow@13145
   575
by (induct xs) auto
wenzelm@13114
   576
wenzelm@13114
   577
wenzelm@13142
   578
subsection {* @{text filter} *}
wenzelm@13114
   579
wenzelm@13142
   580
lemma filter_append [simp]: "filter P (xs @ ys) = filter P xs @ filter P ys"
nipkow@13145
   581
by (induct xs) auto
wenzelm@13114
   582
wenzelm@13142
   583
lemma filter_filter [simp]: "filter P (filter Q xs) = filter (\<lambda>x. Q x \<and> P x) xs"
nipkow@13145
   584
by (induct xs) auto
wenzelm@13114
   585
wenzelm@13142
   586
lemma filter_True [simp]: "\<forall>x \<in> set xs. P x ==> filter P xs = xs"
nipkow@13145
   587
by (induct xs) auto
wenzelm@13114
   588
wenzelm@13142
   589
lemma filter_False [simp]: "\<forall>x \<in> set xs. \<not> P x ==> filter P xs = []"
nipkow@13145
   590
by (induct xs) auto
wenzelm@13114
   591
wenzelm@13142
   592
lemma length_filter [simp]: "length (filter P xs) \<le> length xs"
nipkow@13145
   593
by (induct xs) (auto simp add: le_SucI)
wenzelm@13114
   594
wenzelm@13142
   595
lemma filter_is_subset [simp]: "set (filter P xs) \<le> set xs"
nipkow@13145
   596
by auto
wenzelm@13114
   597
wenzelm@13114
   598
wenzelm@13142
   599
subsection {* @{text concat} *}
wenzelm@13114
   600
wenzelm@13142
   601
lemma concat_append [simp]: "concat (xs @ ys) = concat xs @ concat ys"
nipkow@13145
   602
by (induct xs) auto
wenzelm@13114
   603
wenzelm@13142
   604
lemma concat_eq_Nil_conv [iff]: "(concat xss = []) = (\<forall>xs \<in> set xss. xs = [])"
nipkow@13145
   605
by (induct xss) auto
wenzelm@13114
   606
wenzelm@13142
   607
lemma Nil_eq_concat_conv [iff]: "([] = concat xss) = (\<forall>xs \<in> set xss. xs = [])"
nipkow@13145
   608
by (induct xss) auto
wenzelm@13114
   609
wenzelm@13142
   610
lemma set_concat [simp]: "set (concat xs) = \<Union>(set ` set xs)"
nipkow@13145
   611
by (induct xs) auto
wenzelm@13114
   612
wenzelm@13142
   613
lemma map_concat: "map f (concat xs) = concat (map (map f) xs)"
nipkow@13145
   614
by (induct xs) auto
wenzelm@13114
   615
wenzelm@13142
   616
lemma filter_concat: "filter p (concat xs) = concat (map (filter p) xs)"
nipkow@13145
   617
by (induct xs) auto
wenzelm@13114
   618
wenzelm@13142
   619
lemma rev_concat: "rev (concat xs) = concat (map rev (rev xs))"
nipkow@13145
   620
by (induct xs) auto
wenzelm@13114
   621
wenzelm@13114
   622
wenzelm@13142
   623
subsection {* @{text nth} *}
wenzelm@13114
   624
wenzelm@13142
   625
lemma nth_Cons_0 [simp]: "(x # xs)!0 = x"
nipkow@13145
   626
by auto
wenzelm@13114
   627
wenzelm@13142
   628
lemma nth_Cons_Suc [simp]: "(x # xs)!(Suc n) = xs!n"
nipkow@13145
   629
by auto
wenzelm@13114
   630
wenzelm@13142
   631
declare nth.simps [simp del]
wenzelm@13114
   632
wenzelm@13114
   633
lemma nth_append:
nipkow@13145
   634
"!!n. (xs @ ys)!n = (if n < length xs then xs!n else ys!(n - length xs))"
nipkow@13145
   635
apply(induct "xs")
nipkow@13145
   636
 apply simp
nipkow@13145
   637
apply (case_tac n)
nipkow@13145
   638
 apply auto
nipkow@13145
   639
done
wenzelm@13114
   640
wenzelm@13142
   641
lemma nth_map [simp]: "!!n. n < length xs ==> (map f xs)!n = f(xs!n)"
nipkow@13145
   642
apply(induct xs)
nipkow@13145
   643
 apply simp
nipkow@13145
   644
apply (case_tac n)
nipkow@13145
   645
 apply auto
nipkow@13145
   646
done
wenzelm@13114
   647
wenzelm@13142
   648
lemma set_conv_nth: "set xs = {xs!i | i. i < length xs}"
nipkow@13145
   649
apply (induct_tac xs)
nipkow@13145
   650
 apply simp
nipkow@13145
   651
apply simp
nipkow@13145
   652
apply safe
nipkow@13145
   653
apply (rule_tac x = 0 in exI)
nipkow@13145
   654
apply simp
nipkow@13145
   655
 apply (rule_tac x = "Suc i" in exI)
nipkow@13145
   656
 apply simp
nipkow@13145
   657
apply (case_tac i)
nipkow@13145
   658
 apply simp
nipkow@13145
   659
apply (rename_tac j)
nipkow@13145
   660
apply (rule_tac x = j in exI)
nipkow@13145
   661
apply simp
nipkow@13145
   662
done
wenzelm@13114
   663
nipkow@13145
   664
lemma list_ball_nth: "[| n < length xs; !x : set xs. P x|] ==> P(xs!n)"
nipkow@13145
   665
by (auto simp add: set_conv_nth)
wenzelm@13114
   666
wenzelm@13142
   667
lemma nth_mem [simp]: "n < length xs ==> xs!n : set xs"
nipkow@13145
   668
by (auto simp add: set_conv_nth)
wenzelm@13114
   669
wenzelm@13114
   670
lemma all_nth_imp_all_set:
nipkow@13145
   671
"[| !i < length xs. P(xs!i); x : set xs|] ==> P x"
nipkow@13145
   672
by (auto simp add: set_conv_nth)
wenzelm@13114
   673
wenzelm@13114
   674
lemma all_set_conv_all_nth:
nipkow@13145
   675
"(\<forall>x \<in> set xs. P x) = (\<forall>i. i < length xs --> P (xs ! i))"
nipkow@13145
   676
by (auto simp add: set_conv_nth)
wenzelm@13114
   677
wenzelm@13114
   678
wenzelm@13142
   679
subsection {* @{text list_update} *}
wenzelm@13114
   680
wenzelm@13142
   681
lemma length_list_update [simp]: "!!i. length(xs[i:=x]) = length xs"
nipkow@13145
   682
by (induct xs) (auto split: nat.split)
wenzelm@13114
   683
wenzelm@13114
   684
lemma nth_list_update:
nipkow@13145
   685
"!!i j. i < length xs==> (xs[i:=x])!j = (if i = j then x else xs!j)"
nipkow@13145
   686
by (induct xs) (auto simp add: nth_Cons split: nat.split)
wenzelm@13114
   687
wenzelm@13142
   688
lemma nth_list_update_eq [simp]: "i < length xs ==> (xs[i:=x])!i = x"
nipkow@13145
   689
by (simp add: nth_list_update)
wenzelm@13114
   690
wenzelm@13142
   691
lemma nth_list_update_neq [simp]: "!!i j. i \<noteq> j ==> xs[i:=x]!j = xs!j"
nipkow@13145
   692
by (induct xs) (auto simp add: nth_Cons split: nat.split)
wenzelm@13114
   693
wenzelm@13142
   694
lemma list_update_overwrite [simp]:
nipkow@13145
   695
"!!i. i < size xs ==> xs[i:=x, i:=y] = xs[i:=y]"
nipkow@13145
   696
by (induct xs) (auto split: nat.split)
wenzelm@13114
   697
wenzelm@13114
   698
lemma list_update_same_conv:
nipkow@13145
   699
"!!i. i < length xs ==> (xs[i := x] = xs) = (xs!i = x)"
nipkow@13145
   700
by (induct xs) (auto split: nat.split)
wenzelm@13114
   701
wenzelm@13114
   702
lemma update_zip:
nipkow@13145
   703
"!!i xy xs. length xs = length ys ==>
nipkow@13145
   704
(zip xs ys)[i:=xy] = zip (xs[i:=fst xy]) (ys[i:=snd xy])"
nipkow@13145
   705
by (induct ys) (auto, case_tac xs, auto split: nat.split)
wenzelm@13114
   706
wenzelm@13114
   707
lemma set_update_subset_insert: "!!i. set(xs[i:=x]) <= insert x (set xs)"
nipkow@13145
   708
by (induct xs) (auto split: nat.split)
wenzelm@13114
   709
wenzelm@13114
   710
lemma set_update_subsetI: "[| set xs <= A; x:A |] ==> set(xs[i := x]) <= A"
nipkow@13145
   711
by (blast dest!: set_update_subset_insert [THEN subsetD])
wenzelm@13114
   712
wenzelm@13114
   713
wenzelm@13142
   714
subsection {* @{text last} and @{text butlast} *}
wenzelm@13114
   715
wenzelm@13142
   716
lemma last_snoc [simp]: "last (xs @ [x]) = x"
nipkow@13145
   717
by (induct xs) auto
wenzelm@13114
   718
wenzelm@13142
   719
lemma butlast_snoc [simp]: "butlast (xs @ [x]) = xs"
nipkow@13145
   720
by (induct xs) auto
wenzelm@13114
   721
wenzelm@13142
   722
lemma length_butlast [simp]: "length (butlast xs) = length xs - 1"
nipkow@13145
   723
by (induct xs rule: rev_induct) auto
wenzelm@13114
   724
wenzelm@13114
   725
lemma butlast_append:
nipkow@13145
   726
"!!ys. butlast (xs @ ys) = (if ys = [] then butlast xs else xs @ butlast ys)"
nipkow@13145
   727
by (induct xs) auto
wenzelm@13114
   728
wenzelm@13142
   729
lemma append_butlast_last_id [simp]:
nipkow@13145
   730
"xs \<noteq> [] ==> butlast xs @ [last xs] = xs"
nipkow@13145
   731
by (induct xs) auto
wenzelm@13114
   732
wenzelm@13142
   733
lemma in_set_butlastD: "x : set (butlast xs) ==> x : set xs"
nipkow@13145
   734
by (induct xs) (auto split: split_if_asm)
wenzelm@13114
   735
wenzelm@13114
   736
lemma in_set_butlast_appendI:
nipkow@13145
   737
"x : set (butlast xs) | x : set (butlast ys) ==> x : set (butlast (xs @ ys))"
nipkow@13145
   738
by (auto dest: in_set_butlastD simp add: butlast_append)
wenzelm@13114
   739
wenzelm@13142
   740
wenzelm@13142
   741
subsection {* @{text take} and @{text drop} *}
wenzelm@13114
   742
wenzelm@13142
   743
lemma take_0 [simp]: "take 0 xs = []"
nipkow@13145
   744
by (induct xs) auto
wenzelm@13114
   745
wenzelm@13142
   746
lemma drop_0 [simp]: "drop 0 xs = xs"
nipkow@13145
   747
by (induct xs) auto
wenzelm@13114
   748
wenzelm@13142
   749
lemma take_Suc_Cons [simp]: "take (Suc n) (x # xs) = x # take n xs"
nipkow@13145
   750
by simp
wenzelm@13114
   751
wenzelm@13142
   752
lemma drop_Suc_Cons [simp]: "drop (Suc n) (x # xs) = drop n xs"
nipkow@13145
   753
by simp
wenzelm@13114
   754
wenzelm@13142
   755
declare take_Cons [simp del] and drop_Cons [simp del]
wenzelm@13114
   756
wenzelm@13142
   757
lemma length_take [simp]: "!!xs. length (take n xs) = min (length xs) n"
nipkow@13145
   758
by (induct n) (auto, case_tac xs, auto)
wenzelm@13114
   759
wenzelm@13142
   760
lemma length_drop [simp]: "!!xs. length (drop n xs) = (length xs - n)"
nipkow@13145
   761
by (induct n) (auto, case_tac xs, auto)
wenzelm@13114
   762
wenzelm@13142
   763
lemma take_all [simp]: "!!xs. length xs <= n ==> take n xs = xs"
nipkow@13145
   764
by (induct n) (auto, case_tac xs, auto)
wenzelm@13114
   765
wenzelm@13142
   766
lemma drop_all [simp]: "!!xs. length xs <= n ==> drop n xs = []"
nipkow@13145
   767
by (induct n) (auto, case_tac xs, auto)
wenzelm@13114
   768
wenzelm@13142
   769
lemma take_append [simp]:
nipkow@13145
   770
"!!xs. take n (xs @ ys) = (take n xs @ take (n - length xs) ys)"
nipkow@13145
   771
by (induct n) (auto, case_tac xs, auto)
wenzelm@13114
   772
wenzelm@13142
   773
lemma drop_append [simp]:
nipkow@13145
   774
"!!xs. drop n (xs @ ys) = drop n xs @ drop (n - length xs) ys"
nipkow@13145
   775
by (induct n) (auto, case_tac xs, auto)
wenzelm@13114
   776
wenzelm@13142
   777
lemma take_take [simp]: "!!xs n. take n (take m xs) = take (min n m) xs"
nipkow@13145
   778
apply (induct m)
nipkow@13145
   779
 apply auto
nipkow@13145
   780
apply (case_tac xs)
nipkow@13145
   781
 apply auto
nipkow@13145
   782
apply (case_tac na)
nipkow@13145
   783
 apply auto
nipkow@13145
   784
done
wenzelm@13114
   785
wenzelm@13142
   786
lemma drop_drop [simp]: "!!xs. drop n (drop m xs) = drop (n + m) xs"
nipkow@13145
   787
apply (induct m)
nipkow@13145
   788
 apply auto
nipkow@13145
   789
apply (case_tac xs)
nipkow@13145
   790
 apply auto
nipkow@13145
   791
done
wenzelm@13114
   792
wenzelm@13114
   793
lemma take_drop: "!!xs n. take n (drop m xs) = drop m (take (n + m) xs)"
nipkow@13145
   794
apply (induct m)
nipkow@13145
   795
 apply auto
nipkow@13145
   796
apply (case_tac xs)
nipkow@13145
   797
 apply auto
nipkow@13145
   798
done
wenzelm@13114
   799
wenzelm@13142
   800
lemma append_take_drop_id [simp]: "!!xs. take n xs @ drop n xs = xs"
nipkow@13145
   801
apply (induct n)
nipkow@13145
   802
 apply auto
nipkow@13145
   803
apply (case_tac xs)
nipkow@13145
   804
 apply auto
nipkow@13145
   805
done
wenzelm@13114
   806
wenzelm@13114
   807
lemma take_map: "!!xs. take n (map f xs) = map f (take n xs)"
nipkow@13145
   808
apply (induct n)
nipkow@13145
   809
 apply auto
nipkow@13145
   810
apply (case_tac xs)
nipkow@13145
   811
 apply auto
nipkow@13145
   812
done
wenzelm@13114
   813
wenzelm@13142
   814
lemma drop_map: "!!xs. drop n (map f xs) = map f (drop n xs)"
nipkow@13145
   815
apply (induct n)
nipkow@13145
   816
 apply auto
nipkow@13145
   817
apply (case_tac xs)
nipkow@13145
   818
 apply auto
nipkow@13145
   819
done
wenzelm@13114
   820
wenzelm@13114
   821
lemma rev_take: "!!i. rev (take i xs) = drop (length xs - i) (rev xs)"
nipkow@13145
   822
apply (induct xs)
nipkow@13145
   823
 apply auto
nipkow@13145
   824
apply (case_tac i)
nipkow@13145
   825
 apply auto
nipkow@13145
   826
done
wenzelm@13114
   827
wenzelm@13114
   828
lemma rev_drop: "!!i. rev (drop i xs) = take (length xs - i) (rev xs)"
nipkow@13145
   829
apply (induct xs)
nipkow@13145
   830
 apply auto
nipkow@13145
   831
apply (case_tac i)
nipkow@13145
   832
 apply auto
nipkow@13145
   833
done
wenzelm@13114
   834
wenzelm@13142
   835
lemma nth_take [simp]: "!!n i. i < n ==> (take n xs)!i = xs!i"
nipkow@13145
   836
apply (induct xs)
nipkow@13145
   837
 apply auto
nipkow@13145
   838
apply (case_tac n)
nipkow@13145
   839
 apply(blast )
nipkow@13145
   840
apply (case_tac i)
nipkow@13145
   841
 apply auto
nipkow@13145
   842
done
wenzelm@13114
   843
wenzelm@13142
   844
lemma nth_drop [simp]:
nipkow@13145
   845
"!!xs i. n + i <= length xs ==> (drop n xs)!i = xs!(n + i)"
nipkow@13145
   846
apply (induct n)
nipkow@13145
   847
 apply auto
nipkow@13145
   848
apply (case_tac xs)
nipkow@13145
   849
 apply auto
nipkow@13145
   850
done
nipkow@3507
   851
wenzelm@13114
   852
lemma append_eq_conv_conj:
nipkow@13145
   853
"!!zs. (xs @ ys = zs) = (xs = take (length xs) zs \<and> ys = drop (length xs) zs)"
nipkow@13145
   854
apply(induct xs)
nipkow@13145
   855
 apply simp
nipkow@13145
   856
apply clarsimp
nipkow@13145
   857
apply (case_tac zs)
nipkow@13145
   858
apply auto
nipkow@13145
   859
done
wenzelm@13142
   860
wenzelm@13114
   861
wenzelm@13142
   862
subsection {* @{text takeWhile} and @{text dropWhile} *}
wenzelm@13114
   863
wenzelm@13142
   864
lemma takeWhile_dropWhile_id [simp]: "takeWhile P xs @ dropWhile P xs = xs"
nipkow@13145
   865
by (induct xs) auto
wenzelm@13114
   866
wenzelm@13142
   867
lemma takeWhile_append1 [simp]:
nipkow@13145
   868
"[| x:set xs; ~P(x)|] ==> takeWhile P (xs @ ys) = takeWhile P xs"
nipkow@13145
   869
by (induct xs) auto
wenzelm@13114
   870
wenzelm@13142
   871
lemma takeWhile_append2 [simp]:
nipkow@13145
   872
"(!!x. x : set xs ==> P x) ==> takeWhile P (xs @ ys) = xs @ takeWhile P ys"
nipkow@13145
   873
by (induct xs) auto
wenzelm@13114
   874
wenzelm@13142
   875
lemma takeWhile_tail: "\<not> P x ==> takeWhile P (xs @ (x#l)) = takeWhile P xs"
nipkow@13145
   876
by (induct xs) auto
wenzelm@13114
   877
wenzelm@13142
   878
lemma dropWhile_append1 [simp]:
nipkow@13145
   879
"[| x : set xs; ~P(x)|] ==> dropWhile P (xs @ ys) = (dropWhile P xs)@ys"
nipkow@13145
   880
by (induct xs) auto
wenzelm@13114
   881
wenzelm@13142
   882
lemma dropWhile_append2 [simp]:
nipkow@13145
   883
"(!!x. x:set xs ==> P(x)) ==> dropWhile P (xs @ ys) = dropWhile P ys"
nipkow@13145
   884
by (induct xs) auto
wenzelm@13114
   885
wenzelm@13142
   886
lemma set_take_whileD: "x : set (takeWhile P xs) ==> x : set xs \<and> P x"
nipkow@13145
   887
by (induct xs) (auto split: split_if_asm)
wenzelm@13114
   888
wenzelm@13114
   889
wenzelm@13142
   890
subsection {* @{text zip} *}
wenzelm@13114
   891
wenzelm@13142
   892
lemma zip_Nil [simp]: "zip [] ys = []"
nipkow@13145
   893
by (induct ys) auto
wenzelm@13114
   894
wenzelm@13142
   895
lemma zip_Cons_Cons [simp]: "zip (x # xs) (y # ys) = (x, y) # zip xs ys"
nipkow@13145
   896
by simp
wenzelm@13114
   897
wenzelm@13142
   898
declare zip_Cons [simp del]
wenzelm@13114
   899
wenzelm@13142
   900
lemma length_zip [simp]:
nipkow@13145
   901
"!!xs. length (zip xs ys) = min (length xs) (length ys)"
nipkow@13145
   902
apply(induct ys)
nipkow@13145
   903
 apply simp
nipkow@13145
   904
apply (case_tac xs)
nipkow@13145
   905
 apply auto
nipkow@13145
   906
done
wenzelm@13114
   907
wenzelm@13114
   908
lemma zip_append1:
nipkow@13145
   909
"!!xs. zip (xs @ ys) zs =
nipkow@13145
   910
zip xs (take (length xs) zs) @ zip ys (drop (length xs) zs)"
nipkow@13145
   911
apply (induct zs)
nipkow@13145
   912
 apply simp
nipkow@13145
   913
apply (case_tac xs)
nipkow@13145
   914
 apply simp_all
nipkow@13145
   915
done
wenzelm@13114
   916
wenzelm@13114
   917
lemma zip_append2:
nipkow@13145
   918
"!!ys. zip xs (ys @ zs) =
nipkow@13145
   919
zip (take (length ys) xs) ys @ zip (drop (length ys) xs) zs"
nipkow@13145
   920
apply (induct xs)
nipkow@13145
   921
 apply simp
nipkow@13145
   922
apply (case_tac ys)
nipkow@13145
   923
 apply simp_all
nipkow@13145
   924
done
wenzelm@13114
   925
wenzelm@13142
   926
lemma zip_append [simp]:
wenzelm@13142
   927
 "[| length xs = length us; length ys = length vs |] ==>
nipkow@13145
   928
zip (xs@ys) (us@vs) = zip xs us @ zip ys vs"
nipkow@13145
   929
by (simp add: zip_append1)
wenzelm@13114
   930
wenzelm@13114
   931
lemma zip_rev:
nipkow@13145
   932
"!!xs. length xs = length ys ==> zip (rev xs) (rev ys) = rev (zip xs ys)"
nipkow@13145
   933
apply(induct ys)
nipkow@13145
   934
 apply simp
nipkow@13145
   935
apply (case_tac xs)
nipkow@13145
   936
 apply simp_all
nipkow@13145
   937
done
wenzelm@13114
   938
wenzelm@13142
   939
lemma nth_zip [simp]:
nipkow@13145
   940
"!!i xs. [| i < length xs; i < length ys|] ==> (zip xs ys)!i = (xs!i, ys!i)"
nipkow@13145
   941
apply (induct ys)
nipkow@13145
   942
 apply simp
nipkow@13145
   943
apply (case_tac xs)
nipkow@13145
   944
 apply (simp_all add: nth.simps split: nat.split)
nipkow@13145
   945
done
wenzelm@13114
   946
wenzelm@13114
   947
lemma set_zip:
nipkow@13145
   948
"set (zip xs ys) = {(xs!i, ys!i) | i. i < min (length xs) (length ys)}"
nipkow@13145
   949
by (simp add: set_conv_nth cong: rev_conj_cong)
wenzelm@13114
   950
wenzelm@13114
   951
lemma zip_update:
nipkow@13145
   952
"length xs = length ys ==> zip (xs[i:=x]) (ys[i:=y]) = (zip xs ys)[i:=(x,y)]"
nipkow@13145
   953
by (rule sym, simp add: update_zip)
wenzelm@13114
   954
wenzelm@13142
   955
lemma zip_replicate [simp]:
nipkow@13145
   956
"!!j. zip (replicate i x) (replicate j y) = replicate (min i j) (x,y)"
nipkow@13145
   957
apply (induct i)
nipkow@13145
   958
 apply auto
nipkow@13145
   959
apply (case_tac j)
nipkow@13145
   960
 apply auto
nipkow@13145
   961
done
wenzelm@13114
   962
wenzelm@13142
   963
wenzelm@13142
   964
subsection {* @{text list_all2} *}
wenzelm@13114
   965
wenzelm@13114
   966
lemma list_all2_lengthD: "list_all2 P xs ys ==> length xs = length ys"
nipkow@13145
   967
by (simp add: list_all2_def)
wenzelm@13114
   968
wenzelm@13142
   969
lemma list_all2_Nil [iff]: "list_all2 P [] ys = (ys = [])"
nipkow@13145
   970
by (simp add: list_all2_def)
wenzelm@13114
   971
wenzelm@13142
   972
lemma list_all2_Nil2[iff]: "list_all2 P xs [] = (xs = [])"
nipkow@13145
   973
by (simp add: list_all2_def)
wenzelm@13114
   974
wenzelm@13142
   975
lemma list_all2_Cons [iff]:
nipkow@13145
   976
"list_all2 P (x # xs) (y # ys) = (P x y \<and> list_all2 P xs ys)"
nipkow@13145
   977
by (auto simp add: list_all2_def)
wenzelm@13114
   978
wenzelm@13114
   979
lemma list_all2_Cons1:
nipkow@13145
   980
"list_all2 P (x # xs) ys = (\<exists>z zs. ys = z # zs \<and> P x z \<and> list_all2 P xs zs)"
nipkow@13145
   981
by (cases ys) auto
wenzelm@13114
   982
wenzelm@13114
   983
lemma list_all2_Cons2:
nipkow@13145
   984
"list_all2 P xs (y # ys) = (\<exists>z zs. xs = z # zs \<and> P z y \<and> list_all2 P zs ys)"
nipkow@13145
   985
by (cases xs) auto
wenzelm@13114
   986
wenzelm@13142
   987
lemma list_all2_rev [iff]:
nipkow@13145
   988
"list_all2 P (rev xs) (rev ys) = list_all2 P xs ys"
nipkow@13145
   989
by (simp add: list_all2_def zip_rev cong: conj_cong)
wenzelm@13114
   990
wenzelm@13114
   991
lemma list_all2_append1:
nipkow@13145
   992
"list_all2 P (xs @ ys) zs =
nipkow@13145
   993
(EX us vs. zs = us @ vs \<and> length us = length xs \<and> length vs = length ys \<and>
nipkow@13145
   994
list_all2 P xs us \<and> list_all2 P ys vs)"
nipkow@13145
   995
apply (simp add: list_all2_def zip_append1)
nipkow@13145
   996
apply (rule iffI)
nipkow@13145
   997
 apply (rule_tac x = "take (length xs) zs" in exI)
nipkow@13145
   998
 apply (rule_tac x = "drop (length xs) zs" in exI)
nipkow@13145
   999
 apply (force split: nat_diff_split simp add: min_def)
nipkow@13145
  1000
apply clarify
nipkow@13145
  1001
apply (simp add: ball_Un)
nipkow@13145
  1002
done
wenzelm@13114
  1003
wenzelm@13114
  1004
lemma list_all2_append2:
nipkow@13145
  1005
"list_all2 P xs (ys @ zs) =
nipkow@13145
  1006
(EX us vs. xs = us @ vs \<and> length us = length ys \<and> length vs = length zs \<and>
nipkow@13145
  1007
list_all2 P us ys \<and> list_all2 P vs zs)"
nipkow@13145
  1008
apply (simp add: list_all2_def zip_append2)
nipkow@13145
  1009
apply (rule iffI)
nipkow@13145
  1010
 apply (rule_tac x = "take (length ys) xs" in exI)
nipkow@13145
  1011
 apply (rule_tac x = "drop (length ys) xs" in exI)
nipkow@13145
  1012
 apply (force split: nat_diff_split simp add: min_def)
nipkow@13145
  1013
apply clarify
nipkow@13145
  1014
apply (simp add: ball_Un)
nipkow@13145
  1015
done
wenzelm@13114
  1016
wenzelm@13114
  1017
lemma list_all2_conv_all_nth:
nipkow@13145
  1018
"list_all2 P xs ys =
nipkow@13145
  1019
(length xs = length ys \<and> (\<forall>i < length xs. P (xs!i) (ys!i)))"
nipkow@13145
  1020
by (force simp add: list_all2_def set_zip)
wenzelm@13114
  1021
wenzelm@13114
  1022
lemma list_all2_trans[rule_format]:
nipkow@13145
  1023
"\<forall>a b c. P1 a b --> P2 b c --> P3 a c ==>
nipkow@13145
  1024
\<forall>bs cs. list_all2 P1 as bs --> list_all2 P2 bs cs --> list_all2 P3 as cs"
nipkow@13145
  1025
apply(induct_tac as)
nipkow@13145
  1026
 apply simp
nipkow@13145
  1027
apply(rule allI)
nipkow@13145
  1028
apply(induct_tac bs)
nipkow@13145
  1029
 apply simp
nipkow@13145
  1030
apply(rule allI)
nipkow@13145
  1031
apply(induct_tac cs)
nipkow@13145
  1032
 apply auto
nipkow@13145
  1033
done
wenzelm@13142
  1034
wenzelm@13142
  1035
wenzelm@13142
  1036
subsection {* @{text foldl} *}
wenzelm@13142
  1037
wenzelm@13142
  1038
lemma foldl_append [simp]:
nipkow@13145
  1039
"!!a. foldl f a (xs @ ys) = foldl f (foldl f a xs) ys"
nipkow@13145
  1040
by (induct xs) auto
wenzelm@13142
  1041
wenzelm@13142
  1042
text {*
nipkow@13145
  1043
Note: @{text "n \<le> foldl (op +) n ns"} looks simpler, but is more
nipkow@13145
  1044
difficult to use because it requires an additional transitivity step.
wenzelm@13142
  1045
*}
wenzelm@13142
  1046
wenzelm@13142
  1047
lemma start_le_sum: "!!n::nat. m <= n ==> m <= foldl (op +) n ns"
nipkow@13145
  1048
by (induct ns) auto
wenzelm@13142
  1049
wenzelm@13142
  1050
lemma elem_le_sum: "!!n::nat. n : set ns ==> n <= foldl (op +) 0 ns"
nipkow@13145
  1051
by (force intro: start_le_sum simp add: in_set_conv_decomp)
wenzelm@13142
  1052
wenzelm@13142
  1053
lemma sum_eq_0_conv [iff]:
nipkow@13145
  1054
"!!m::nat. (foldl (op +) m ns = 0) = (m = 0 \<and> (\<forall>n \<in> set ns. n = 0))"
nipkow@13145
  1055
by (induct ns) auto
wenzelm@13114
  1056
wenzelm@13114
  1057
wenzelm@13142
  1058
subsection {* @{text upto} *}
wenzelm@13114
  1059
wenzelm@13142
  1060
lemma upt_rec: "[i..j(] = (if i<j then i#[Suc i..j(] else [])"
nipkow@13145
  1061
-- {* Does not terminate! *}
nipkow@13145
  1062
by (induct j) auto
wenzelm@13142
  1063
wenzelm@13142
  1064
lemma upt_conv_Nil [simp]: "j <= i ==> [i..j(] = []"
nipkow@13145
  1065
by (subst upt_rec) simp
wenzelm@13114
  1066
wenzelm@13142
  1067
lemma upt_Suc_append: "i <= j ==> [i..(Suc j)(] = [i..j(]@[j]"
nipkow@13145
  1068
-- {* Only needed if @{text upt_Suc} is deleted from the simpset. *}
nipkow@13145
  1069
by simp
wenzelm@13114
  1070
wenzelm@13142
  1071
lemma upt_conv_Cons: "i < j ==> [i..j(] = i # [Suc i..j(]"
nipkow@13145
  1072
apply(rule trans)
nipkow@13145
  1073
apply(subst upt_rec)
nipkow@13145
  1074
 prefer 2 apply(rule refl)
nipkow@13145
  1075
apply simp
nipkow@13145
  1076
done
wenzelm@13114
  1077
wenzelm@13142
  1078
lemma upt_add_eq_append: "i<=j ==> [i..j+k(] = [i..j(]@[j..j+k(]"
nipkow@13145
  1079
-- {* LOOPS as a simprule, since @{text "j <= j"}. *}
nipkow@13145
  1080
by (induct k) auto
wenzelm@13114
  1081
wenzelm@13142
  1082
lemma length_upt [simp]: "length [i..j(] = j - i"
nipkow@13145
  1083
by (induct j) (auto simp add: Suc_diff_le)
wenzelm@13114
  1084
wenzelm@13142
  1085
lemma nth_upt [simp]: "i + k < j ==> [i..j(] ! k = i + k"
nipkow@13145
  1086
apply (induct j)
nipkow@13145
  1087
apply (auto simp add: less_Suc_eq nth_append split: nat_diff_split)
nipkow@13145
  1088
done
wenzelm@13114
  1089
wenzelm@13142
  1090
lemma take_upt [simp]: "!!i. i+m <= n ==> take m [i..n(] = [i..i+m(]"
nipkow@13145
  1091
apply (induct m)
nipkow@13145
  1092
 apply simp
nipkow@13145
  1093
apply (subst upt_rec)
nipkow@13145
  1094
apply (rule sym)
nipkow@13145
  1095
apply (subst upt_rec)
nipkow@13145
  1096
apply (simp del: upt.simps)
nipkow@13145
  1097
done
nipkow@3507
  1098
wenzelm@13114
  1099
lemma map_Suc_upt: "map Suc [m..n(] = [Suc m..n]"
nipkow@13145
  1100
by (induct n) auto
wenzelm@13114
  1101
wenzelm@13114
  1102
lemma nth_map_upt: "!!i. i < n-m ==> (map f [m..n(]) ! i = f(m+i)"
nipkow@13145
  1103
apply (induct n m rule: diff_induct)
nipkow@13145
  1104
prefer 3 apply (subst map_Suc_upt[symmetric])
nipkow@13145
  1105
apply (auto simp add: less_diff_conv nth_upt)
nipkow@13145
  1106
done
wenzelm@13114
  1107
wenzelm@13142
  1108
lemma nth_take_lemma [rule_format]:
nipkow@13145
  1109
"ALL xs ys. k <= length xs --> k <= length ys
nipkow@13145
  1110
--> (ALL i. i < k --> xs!i = ys!i)
nipkow@13145
  1111
--> take k xs = take k ys"
nipkow@13145
  1112
apply (induct k)
nipkow@13145
  1113
apply (simp_all add: less_Suc_eq_0_disj all_conj_distrib)
nipkow@13145
  1114
apply clarify
nipkow@13145
  1115
txt {* Both lists must be non-empty *}
nipkow@13145
  1116
apply (case_tac xs)
nipkow@13145
  1117
 apply simp
nipkow@13145
  1118
apply (case_tac ys)
nipkow@13145
  1119
 apply clarify
nipkow@13145
  1120
 apply (simp (no_asm_use))
nipkow@13145
  1121
apply clarify
nipkow@13145
  1122
txt {* prenexing's needed, not miniscoping *}
nipkow@13145
  1123
apply (simp (no_asm_use) add: all_simps [symmetric] del: all_simps)
nipkow@13145
  1124
apply blast
nipkow@13145
  1125
done
wenzelm@13114
  1126
wenzelm@13114
  1127
lemma nth_equalityI:
wenzelm@13114
  1128
 "[| length xs = length ys; ALL i < length xs. xs!i = ys!i |] ==> xs = ys"
nipkow@13145
  1129
apply (frule nth_take_lemma [OF le_refl eq_imp_le])
nipkow@13145
  1130
apply (simp_all add: take_all)
nipkow@13145
  1131
done
wenzelm@13142
  1132
wenzelm@13142
  1133
lemma take_equalityI: "(\<forall>i. take i xs = take i ys) ==> xs = ys"
nipkow@13145
  1134
-- {* The famous take-lemma. *}
nipkow@13145
  1135
apply (drule_tac x = "max (length xs) (length ys)" in spec)
nipkow@13145
  1136
apply (simp add: le_max_iff_disj take_all)
nipkow@13145
  1137
done
wenzelm@13142
  1138
wenzelm@13142
  1139
wenzelm@13142
  1140
subsection {* @{text "distinct"} and @{text remdups} *}
wenzelm@13142
  1141
wenzelm@13142
  1142
lemma distinct_append [simp]:
nipkow@13145
  1143
"distinct (xs @ ys) = (distinct xs \<and> distinct ys \<and> set xs \<inter> set ys = {})"
nipkow@13145
  1144
by (induct xs) auto
wenzelm@13142
  1145
wenzelm@13142
  1146
lemma set_remdups [simp]: "set (remdups xs) = set xs"
nipkow@13145
  1147
by (induct xs) (auto simp add: insert_absorb)
wenzelm@13142
  1148
wenzelm@13142
  1149
lemma distinct_remdups [iff]: "distinct (remdups xs)"
nipkow@13145
  1150
by (induct xs) auto
wenzelm@13142
  1151
wenzelm@13142
  1152
lemma distinct_filter [simp]: "distinct xs ==> distinct (filter P xs)"
nipkow@13145
  1153
by (induct xs) auto
wenzelm@13114
  1154
wenzelm@13142
  1155
text {*
nipkow@13145
  1156
It is best to avoid this indexed version of distinct, but sometimes
nipkow@13145
  1157
it is useful. *}
wenzelm@13142
  1158
lemma distinct_conv_nth:
nipkow@13145
  1159
"distinct xs = (\<forall>i j. i < size xs \<and> j < size xs \<and> i \<noteq> j --> xs!i \<noteq> xs!j)"
nipkow@13145
  1160
apply (induct_tac xs)
nipkow@13145
  1161
 apply simp
nipkow@13145
  1162
apply simp
nipkow@13145
  1163
apply (rule iffI)
nipkow@13145
  1164
 apply clarsimp
nipkow@13145
  1165
 apply (case_tac i)
nipkow@13145
  1166
apply (case_tac j)
nipkow@13145
  1167
 apply simp
nipkow@13145
  1168
apply (simp add: set_conv_nth)
nipkow@13145
  1169
 apply (case_tac j)
nipkow@13145
  1170
apply (clarsimp simp add: set_conv_nth)
nipkow@13145
  1171
 apply simp
nipkow@13145
  1172
apply (rule conjI)
nipkow@13145
  1173
 apply (clarsimp simp add: set_conv_nth)
nipkow@13145
  1174
 apply (erule_tac x = 0 in allE)
nipkow@13145
  1175
 apply (erule_tac x = "Suc i" in allE)
nipkow@13145
  1176
 apply simp
nipkow@13145
  1177
apply clarsimp
nipkow@13145
  1178
apply (erule_tac x = "Suc i" in allE)
nipkow@13145
  1179
apply (erule_tac x = "Suc j" in allE)
nipkow@13145
  1180
apply simp
nipkow@13145
  1181
done
wenzelm@13114
  1182
wenzelm@13114
  1183
wenzelm@13142
  1184
subsection {* @{text replicate} *}
wenzelm@13114
  1185
wenzelm@13142
  1186
lemma length_replicate [simp]: "length (replicate n x) = n"
nipkow@13145
  1187
by (induct n) auto
nipkow@13124
  1188
wenzelm@13142
  1189
lemma map_replicate [simp]: "map f (replicate n x) = replicate n (f x)"
nipkow@13145
  1190
by (induct n) auto
wenzelm@13114
  1191
wenzelm@13114
  1192
lemma replicate_app_Cons_same:
nipkow@13145
  1193
"(replicate n x) @ (x # xs) = x # replicate n x @ xs"
nipkow@13145
  1194
by (induct n) auto
wenzelm@13114
  1195
wenzelm@13142
  1196
lemma rev_replicate [simp]: "rev (replicate n x) = replicate n x"
nipkow@13145
  1197
apply(induct n)
nipkow@13145
  1198
 apply simp
nipkow@13145
  1199
apply (simp add: replicate_app_Cons_same)
nipkow@13145
  1200
done
wenzelm@13114
  1201
wenzelm@13142
  1202
lemma replicate_add: "replicate (n + m) x = replicate n x @ replicate m x"
nipkow@13145
  1203
by (induct n) auto
wenzelm@13114
  1204
wenzelm@13142
  1205
lemma hd_replicate [simp]: "n \<noteq> 0 ==> hd (replicate n x) = x"
nipkow@13145
  1206
by (induct n) auto
wenzelm@13114
  1207
wenzelm@13142
  1208
lemma tl_replicate [simp]: "n \<noteq> 0 ==> tl (replicate n x) = replicate (n - 1) x"
nipkow@13145
  1209
by (induct n) auto
wenzelm@13114
  1210
wenzelm@13142
  1211
lemma last_replicate [simp]: "n \<noteq> 0 ==> last (replicate n x) = x"
nipkow@13145
  1212
by (atomize (full), induct n) auto
wenzelm@13114
  1213
wenzelm@13142
  1214
lemma nth_replicate[simp]: "!!i. i < n ==> (replicate n x)!i = x"
nipkow@13145
  1215
apply(induct n)
nipkow@13145
  1216
 apply simp
nipkow@13145
  1217
apply (simp add: nth_Cons split: nat.split)
nipkow@13145
  1218
done
wenzelm@13114
  1219
wenzelm@13142
  1220
lemma set_replicate_Suc: "set (replicate (Suc n) x) = {x}"
nipkow@13145
  1221
by (induct n) auto
wenzelm@13114
  1222
wenzelm@13142
  1223
lemma set_replicate [simp]: "n \<noteq> 0 ==> set (replicate n x) = {x}"
nipkow@13145
  1224
by (fast dest!: not0_implies_Suc intro!: set_replicate_Suc)
wenzelm@13114
  1225
wenzelm@13142
  1226
lemma set_replicate_conv_if: "set (replicate n x) = (if n = 0 then {} else {x})"
nipkow@13145
  1227
by auto
wenzelm@13114
  1228
wenzelm@13142
  1229
lemma in_set_replicateD: "x : set (replicate n y) ==> x = y"
nipkow@13145
  1230
by (simp add: set_replicate_conv_if split: split_if_asm)
wenzelm@13114
  1231
wenzelm@13114
  1232
wenzelm@13142
  1233
subsection {* Lexcicographic orderings on lists *}
nipkow@3507
  1234
wenzelm@13142
  1235
lemma wf_lexn: "wf r ==> wf (lexn r n)"
nipkow@13145
  1236
apply (induct_tac n)
nipkow@13145
  1237
 apply simp
nipkow@13145
  1238
apply simp
nipkow@13145
  1239
apply(rule wf_subset)
nipkow@13145
  1240
 prefer 2 apply (rule Int_lower1)
nipkow@13145
  1241
apply(rule wf_prod_fun_image)
nipkow@13145
  1242
 prefer 2 apply (rule injI)
nipkow@13145
  1243
apply auto
nipkow@13145
  1244
done
wenzelm@13114
  1245
wenzelm@13114
  1246
lemma lexn_length:
nipkow@13145
  1247
"!!xs ys. (xs, ys) : lexn r n ==> length xs = n \<and> length ys = n"
nipkow@13145
  1248
by (induct n) auto
wenzelm@13114
  1249
wenzelm@13142
  1250
lemma wf_lex [intro!]: "wf r ==> wf (lex r)"
nipkow@13145
  1251
apply (unfold lex_def)
nipkow@13145
  1252
apply (rule wf_UN)
nipkow@13145
  1253
apply (blast intro: wf_lexn)
nipkow@13145
  1254
apply clarify
nipkow@13145
  1255
apply (rename_tac m n)
nipkow@13145
  1256
apply (subgoal_tac "m \<noteq> n")
nipkow@13145
  1257
 prefer 2 apply blast
nipkow@13145
  1258
apply (blast dest: lexn_length not_sym)
nipkow@13145
  1259
done
wenzelm@13114
  1260
wenzelm@13114
  1261
lemma lexn_conv:
nipkow@13145
  1262
"lexn r n =
nipkow@13145
  1263
{(xs,ys). length xs = n \<and> length ys = n \<and>
nipkow@13145
  1264
(\<exists>xys x y xs' ys'. xs= xys @ x#xs' \<and> ys= xys @ y # ys' \<and> (x, y):r)}"
nipkow@13145
  1265
apply (induct_tac n)
nipkow@13145
  1266
 apply simp
nipkow@13145
  1267
 apply blast
nipkow@13145
  1268
apply (simp add: image_Collect lex_prod_def)
nipkow@13145
  1269
apply auto
nipkow@13145
  1270
apply blast
nipkow@13145
  1271
 apply (rename_tac a xys x xs' y ys')
nipkow@13145
  1272
 apply (rule_tac x = "a # xys" in exI)
nipkow@13145
  1273
 apply simp
nipkow@13145
  1274
apply (case_tac xys)
nipkow@13145
  1275
 apply simp_all
nipkow@13145
  1276
apply blast
nipkow@13145
  1277
done
wenzelm@13114
  1278
wenzelm@13114
  1279
lemma lex_conv:
nipkow@13145
  1280
"lex r =
nipkow@13145
  1281
{(xs,ys). length xs = length ys \<and>
nipkow@13145
  1282
(\<exists>xys x y xs' ys'. xs = xys @ x # xs' \<and> ys = xys @ y # ys' \<and> (x, y):r)}"
nipkow@13145
  1283
by (force simp add: lex_def lexn_conv)
wenzelm@13114
  1284
wenzelm@13142
  1285
lemma wf_lexico [intro!]: "wf r ==> wf (lexico r)"
nipkow@13145
  1286
by (unfold lexico_def) blast
wenzelm@13114
  1287
wenzelm@13114
  1288
lemma lexico_conv:
nipkow@13145
  1289
"lexico r = {(xs,ys). length xs < length ys |
nipkow@13145
  1290
length xs = length ys \<and> (xs, ys) : lex r}"
nipkow@13145
  1291
by (simp add: lexico_def diag_def lex_prod_def measure_def inv_image_def)
wenzelm@13114
  1292
wenzelm@13142
  1293
lemma Nil_notin_lex [iff]: "([], ys) \<notin> lex r"
nipkow@13145
  1294
by (simp add: lex_conv)
wenzelm@13114
  1295
wenzelm@13142
  1296
lemma Nil2_notin_lex [iff]: "(xs, []) \<notin> lex r"
nipkow@13145
  1297
by (simp add:lex_conv)
wenzelm@13114
  1298
wenzelm@13142
  1299
lemma Cons_in_lex [iff]:
nipkow@13145
  1300
"((x # xs, y # ys) : lex r) =
nipkow@13145
  1301
((x, y) : r \<and> length xs = length ys | x = y \<and> (xs, ys) : lex r)"
nipkow@13145
  1302
apply (simp add: lex_conv)
nipkow@13145
  1303
apply (rule iffI)
nipkow@13145
  1304
 prefer 2 apply (blast intro: Cons_eq_appendI)
nipkow@13145
  1305
apply clarify
nipkow@13145
  1306
apply (case_tac xys)
nipkow@13145
  1307
 apply simp
nipkow@13145
  1308
apply simp
nipkow@13145
  1309
apply blast
nipkow@13145
  1310
done
wenzelm@13114
  1311
wenzelm@13114
  1312
wenzelm@13142
  1313
subsection {* @{text sublist} --- a generalization of @{text nth} to sets *}
wenzelm@13114
  1314
wenzelm@13142
  1315
lemma sublist_empty [simp]: "sublist xs {} = []"
nipkow@13145
  1316
by (auto simp add: sublist_def)
wenzelm@13114
  1317
wenzelm@13142
  1318
lemma sublist_nil [simp]: "sublist [] A = []"
nipkow@13145
  1319
by (auto simp add: sublist_def)
wenzelm@13114
  1320
wenzelm@13114
  1321
lemma sublist_shift_lemma:
nipkow@13145
  1322
"map fst [p:zip xs [i..i + length xs(] . snd p : A] =
nipkow@13145
  1323
map fst [p:zip xs [0..length xs(] . snd p + i : A]"
nipkow@13145
  1324
by (induct xs rule: rev_induct) (simp_all add: add_commute)
wenzelm@13114
  1325
wenzelm@13114
  1326
lemma sublist_append:
nipkow@13145
  1327
"sublist (l @ l') A = sublist l A @ sublist l' {j. j + length l : A}"
nipkow@13145
  1328
apply (unfold sublist_def)
nipkow@13145
  1329
apply (induct l' rule: rev_induct)
nipkow@13145
  1330
 apply simp
nipkow@13145
  1331
apply (simp add: upt_add_eq_append[of 0] zip_append sublist_shift_lemma)
nipkow@13145
  1332
apply (simp add: add_commute)
nipkow@13145
  1333
done
wenzelm@13114
  1334
wenzelm@13114
  1335
lemma sublist_Cons:
nipkow@13145
  1336
"sublist (x # l) A = (if 0:A then [x] else []) @ sublist l {j. Suc j : A}"
nipkow@13145
  1337
apply (induct l rule: rev_induct)
nipkow@13145
  1338
 apply (simp add: sublist_def)
nipkow@13145
  1339
apply (simp del: append_Cons add: append_Cons[symmetric] sublist_append)
nipkow@13145
  1340
done
wenzelm@13114
  1341
wenzelm@13142
  1342
lemma sublist_singleton [simp]: "sublist [x] A = (if 0 : A then [x] else [])"
nipkow@13145
  1343
by (simp add: sublist_Cons)
wenzelm@13114
  1344
wenzelm@13142
  1345
lemma sublist_upt_eq_take [simp]: "sublist l {..n(} = take n l"
nipkow@13145
  1346
apply (induct l rule: rev_induct)
nipkow@13145
  1347
 apply simp
nipkow@13145
  1348
apply (simp split: nat_diff_split add: sublist_append)
nipkow@13145
  1349
done
wenzelm@13114
  1350
wenzelm@13114
  1351
wenzelm@13142
  1352
lemma take_Cons':
nipkow@13145
  1353
"take n (x # xs) = (if n = 0 then [] else x # take (n - 1) xs)"
nipkow@13145
  1354
by (cases n) simp_all
wenzelm@13114
  1355
wenzelm@13142
  1356
lemma drop_Cons':
nipkow@13145
  1357
"drop n (x # xs) = (if n = 0 then x # xs else drop (n - 1) xs)"
nipkow@13145
  1358
by (cases n) simp_all
wenzelm@13114
  1359
wenzelm@13142
  1360
lemma nth_Cons': "(x # xs)!n = (if n = 0 then x else xs!(n - 1))"
nipkow@13145
  1361
by (cases n) simp_all
wenzelm@13142
  1362
nipkow@13145
  1363
lemmas [simp] = take_Cons'[of "number_of v",standard]
nipkow@13145
  1364
                drop_Cons'[of "number_of v",standard]
nipkow@13145
  1365
                nth_Cons'[of _ _ "number_of v",standard]
nipkow@3507
  1366
wenzelm@13462
  1367
wenzelm@13366
  1368
subsection {* Characters and strings *}
wenzelm@13366
  1369
wenzelm@13366
  1370
datatype nibble =
wenzelm@13366
  1371
    Nibble0 | Nibble1 | Nibble2 | Nibble3 | Nibble4 | Nibble5 | Nibble6 | Nibble7
wenzelm@13366
  1372
  | Nibble8 | Nibble9 | NibbleA | NibbleB | NibbleC | NibbleD | NibbleE | NibbleF
wenzelm@13366
  1373
wenzelm@13366
  1374
datatype char = Char nibble nibble
wenzelm@13366
  1375
  -- "Note: canonical order of character encoding coincides with standard term ordering"
wenzelm@13366
  1376
wenzelm@13366
  1377
types string = "char list"
wenzelm@13366
  1378
wenzelm@13366
  1379
syntax
wenzelm@13366
  1380
  "_Char" :: "xstr => char"    ("CHR _")
wenzelm@13366
  1381
  "_String" :: "xstr => string"    ("_")
wenzelm@13366
  1382
wenzelm@13366
  1383
parse_ast_translation {*
wenzelm@13366
  1384
  let
wenzelm@13366
  1385
    val constants = Syntax.Appl o map Syntax.Constant;
wenzelm@13366
  1386
wenzelm@13366
  1387
    fun mk_nib n = "Nibble" ^ chr (n + (if n <= 9 then ord "0" else ord "A" - 10));
wenzelm@13366
  1388
    fun mk_char c =
wenzelm@13366
  1389
      if Symbol.is_ascii c andalso Symbol.is_printable c then
wenzelm@13366
  1390
        constants ["Char", mk_nib (ord c div 16), mk_nib (ord c mod 16)]
wenzelm@13366
  1391
      else error ("Printable ASCII character expected: " ^ quote c);
wenzelm@13366
  1392
wenzelm@13366
  1393
    fun mk_string [] = Syntax.Constant "Nil"
wenzelm@13366
  1394
      | mk_string (c :: cs) = Syntax.Appl [Syntax.Constant "Cons", mk_char c, mk_string cs];
wenzelm@13366
  1395
wenzelm@13366
  1396
    fun char_ast_tr [Syntax.Variable xstr] =
wenzelm@13366
  1397
        (case Syntax.explode_xstr xstr of
wenzelm@13366
  1398
          [c] => mk_char c
wenzelm@13366
  1399
        | _ => error ("Single character expected: " ^ xstr))
wenzelm@13366
  1400
      | char_ast_tr asts = raise AST ("char_ast_tr", asts);
wenzelm@13366
  1401
wenzelm@13366
  1402
    fun string_ast_tr [Syntax.Variable xstr] =
wenzelm@13366
  1403
        (case Syntax.explode_xstr xstr of
wenzelm@13366
  1404
          [] => constants [Syntax.constrainC, "Nil", "string"]
wenzelm@13366
  1405
        | cs => mk_string cs)
wenzelm@13366
  1406
      | string_ast_tr asts = raise AST ("string_tr", asts);
wenzelm@13366
  1407
  in [("_Char", char_ast_tr), ("_String", string_ast_tr)] end;
wenzelm@13366
  1408
*}
wenzelm@13366
  1409
wenzelm@13366
  1410
print_ast_translation {*
wenzelm@13366
  1411
  let
wenzelm@13366
  1412
    fun dest_nib (Syntax.Constant c) =
wenzelm@13366
  1413
        (case explode c of
wenzelm@13366
  1414
          ["N", "i", "b", "b", "l", "e", h] =>
wenzelm@13366
  1415
            if "0" <= h andalso h <= "9" then ord h - ord "0"
wenzelm@13366
  1416
            else if "A" <= h andalso h <= "F" then ord h - ord "A" + 10
wenzelm@13366
  1417
            else raise Match
wenzelm@13366
  1418
        | _ => raise Match)
wenzelm@13366
  1419
      | dest_nib _ = raise Match;
wenzelm@13366
  1420
wenzelm@13366
  1421
    fun dest_chr c1 c2 =
wenzelm@13366
  1422
      let val c = chr (dest_nib c1 * 16 + dest_nib c2)
wenzelm@13366
  1423
      in if Symbol.is_printable c then c else raise Match end;
wenzelm@13366
  1424
wenzelm@13366
  1425
    fun dest_char (Syntax.Appl [Syntax.Constant "Char", c1, c2]) = dest_chr c1 c2
wenzelm@13366
  1426
      | dest_char _ = raise Match;
wenzelm@13366
  1427
wenzelm@13366
  1428
    fun xstr cs = Syntax.Appl [Syntax.Constant "_xstr", Syntax.Variable (Syntax.implode_xstr cs)];
wenzelm@13366
  1429
wenzelm@13366
  1430
    fun char_ast_tr' [c1, c2] = Syntax.Appl [Syntax.Constant "_Char", xstr [dest_chr c1 c2]]
wenzelm@13366
  1431
      | char_ast_tr' _ = raise Match;
wenzelm@13366
  1432
wenzelm@13366
  1433
    fun list_ast_tr' [args] = Syntax.Appl [Syntax.Constant "_String",
wenzelm@13366
  1434
            xstr (map dest_char (Syntax.unfold_ast "_args" args))]
wenzelm@13366
  1435
      | list_ast_tr' ts = raise Match;
wenzelm@13366
  1436
  in [("Char", char_ast_tr'), ("@list", list_ast_tr')] end;
wenzelm@13366
  1437
*}
wenzelm@13366
  1438
wenzelm@13122
  1439
end