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