src/HOL/List.thy
author krauss
Wed, 21 Mar 2007 16:07:40 +0100
changeset 22493 db930e490fe5
parent 22422 ee19cdb07528
child 22506 c78f1d924bfe
permissions -rw-r--r--
added another rule for simultaneous induction, and lemmas for zip
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
13462
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
     1
(*  Title:      HOL/List.thy
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
     2
    ID:         $Id$
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
     3
    Author:     Tobias Nipkow
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     4
*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     5
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
     6
header {* The datatype of finite lists *}
13122
wenzelm
parents: 13114
diff changeset
     7
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15113
diff changeset
     8
theory List
21455
b6be1d1b66c5 incorporated structure HOList into HOLogic
haftmann
parents: 21404
diff changeset
     9
imports PreList
21754
6316163ae934 moved char/string syntax to Tools/string_syntax.ML;
wenzelm
parents: 21548
diff changeset
    10
uses "Tools/string_syntax.ML"
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15113
diff changeset
    11
begin
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    12
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
    13
datatype 'a list =
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    14
    Nil    ("[]")
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    15
  | Cons 'a  "'a list"    (infixr "#" 65)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    16
15392
290bc97038c7 First step in reorganizing Finite_Set
nipkow
parents: 15307
diff changeset
    17
subsection{*Basic list processing functions*}
15302
a643fcbc3468 Restructured List and added "rotate"
nipkow
parents: 15281
diff changeset
    18
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    19
consts
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    20
  "@" :: "'a list => 'a list => 'a list"    (infixr 65)
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    21
  filter:: "('a => bool) => 'a list => 'a list"
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    22
  concat:: "'a list list => 'a list"
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    23
  foldl :: "('b => 'a => 'b) => 'b => 'a list => 'b"
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    24
  foldr :: "('a => 'b => 'b) => 'a list => 'b => 'b"
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    25
  hd:: "'a list => 'a"
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    26
  tl:: "'a list => 'a list"
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    27
  last:: "'a list => 'a"
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    28
  butlast :: "'a list => 'a list"
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    29
  set :: "'a list => 'a set"
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    30
  map :: "('a=>'b) => ('a list => 'b list)"
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    31
  nth :: "'a list => nat => 'a"    (infixl "!" 100)
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    32
  list_update :: "'a list => nat => 'a => 'a list"
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    33
  take:: "nat => 'a list => 'a list"
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    34
  drop:: "nat => 'a list => 'a list"
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    35
  takeWhile :: "('a => bool) => 'a list => 'a list"
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    36
  dropWhile :: "('a => bool) => 'a list => 'a list"
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    37
  rev :: "'a list => 'a list"
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    38
  zip :: "'a list => 'b list => ('a * 'b) list"
15425
6356d2523f73 [ .. (] -> [ ..< ]
nipkow
parents: 15392
diff changeset
    39
  upt :: "nat => nat => nat list" ("(1[_..</_'])")
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    40
  remdups :: "'a list => 'a list"
15110
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
    41
  remove1 :: "'a => 'a list => 'a list"
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    42
  "distinct":: "'a list => bool"
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    43
  replicate :: "nat => 'a => 'a list"
19390
6c7383f80ad1 Added function "splice"
nipkow
parents: 19363
diff changeset
    44
  splice :: "'a list \<Rightarrow> 'a list \<Rightarrow> 'a list"
15302
a643fcbc3468 Restructured List and added "rotate"
nipkow
parents: 15281
diff changeset
    45
19363
667b5ea637dd refined 'abbreviation';
wenzelm
parents: 19302
diff changeset
    46
abbreviation
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
    47
  upto:: "nat => nat => nat list"  ("(1[_../_])") where
19363
667b5ea637dd refined 'abbreviation';
wenzelm
parents: 19302
diff changeset
    48
  "[i..j] == [i..<(Suc j)]"
19302
e1bda4fc1d1d abbreviation upto, length;
wenzelm
parents: 19138
diff changeset
    49
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    50
13146
f43153b63361 *** empty log message ***
nipkow
parents: 13145
diff changeset
    51
nonterminals lupdbinds lupdbind
5077
71043526295f * HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents: 4643
diff changeset
    52
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    53
syntax
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    54
  -- {* list Enumeration *}
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    55
  "@list" :: "args => 'a list"    ("[(_)]")
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    56
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    57
  -- {* Special syntax for filter *}
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    58
  "@filter" :: "[pttrn, 'a list, bool] => 'a list"    ("(1[_:_./ _])")
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    59
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    60
  -- {* list update *}
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    61
  "_lupdbind":: "['a, 'a] => lupdbind"    ("(2_ :=/ _)")
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    62
  "" :: "lupdbind => lupdbinds"    ("_")
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    63
  "_lupdbinds" :: "[lupdbind, lupdbinds] => lupdbinds"    ("_,/ _")
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    64
  "_LUpdate" :: "['a, lupdbinds] => 'a"    ("_/[(_)]" [900,0] 900)
5077
71043526295f * HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents: 4643
diff changeset
    65
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    66
translations
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    67
  "[x, xs]" == "x#[xs]"
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    68
  "[x]" == "x#[]"
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    69
  "[x:xs . P]"== "filter (%x. P) xs"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    70
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    71
  "_LUpdate xs (_lupdbinds b bs)"== "_LUpdate (_LUpdate xs b) bs"
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    72
  "xs[i:=x]" == "list_update xs i x"
5077
71043526295f * HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents: 4643
diff changeset
    73
5427
26c9a7c0b36b Arith: less_diff_conv
nipkow
parents: 5425
diff changeset
    74
12114
a8e860c86252 eliminated old "symbols" syntax, use "xsymbols" instead;
wenzelm
parents: 10832
diff changeset
    75
syntax (xsymbols)
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    76
  "@filter" :: "[pttrn, 'a list, bool] => 'a list"("(1[_\<in>_ ./ _])")
14565
c6dc17aab88a use more symbols in HTML output
kleing
parents: 14538
diff changeset
    77
syntax (HTML output)
c6dc17aab88a use more symbols in HTML output
kleing
parents: 14538
diff changeset
    78
  "@filter" :: "[pttrn, 'a list, bool] => 'a list"("(1[_\<in>_ ./ _])")
3342
ec3b55fcb165 New operator "lists" for formalizing sets of lists
paulson
parents: 3320
diff changeset
    79
ec3b55fcb165 New operator "lists" for formalizing sets of lists
paulson
parents: 3320
diff changeset
    80
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
    81
text {*
14589
feae7b5fd425 tuned document;
wenzelm
parents: 14565
diff changeset
    82
  Function @{text size} is overloaded for all datatypes. Users may
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    83
  refer to the list version as @{text length}. *}
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
    84
19363
667b5ea637dd refined 'abbreviation';
wenzelm
parents: 19302
diff changeset
    85
abbreviation
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
    86
  length :: "'a list => nat" where
19363
667b5ea637dd refined 'abbreviation';
wenzelm
parents: 19302
diff changeset
    87
  "length == size"
15302
a643fcbc3468 Restructured List and added "rotate"
nipkow
parents: 15281
diff changeset
    88
5183
89f162de39cf Adapted to new datatype package.
berghofe
parents: 5162
diff changeset
    89
primrec
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
    90
  "hd(x#xs) = x"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
    91
5183
89f162de39cf Adapted to new datatype package.
berghofe
parents: 5162
diff changeset
    92
primrec
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
    93
  "tl([]) = []"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
    94
  "tl(x#xs) = xs"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
    95
5183
89f162de39cf Adapted to new datatype package.
berghofe
parents: 5162
diff changeset
    96
primrec
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
    97
  "last(x#xs) = (if xs=[] then x else last xs)"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
    98
5183
89f162de39cf Adapted to new datatype package.
berghofe
parents: 5162
diff changeset
    99
primrec
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   100
  "butlast []= []"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   101
  "butlast(x#xs) = (if xs=[] then [] else x#butlast xs)"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   102
5183
89f162de39cf Adapted to new datatype package.
berghofe
parents: 5162
diff changeset
   103
primrec
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   104
  "set [] = {}"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   105
  "set (x#xs) = insert x (set xs)"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   106
5183
89f162de39cf Adapted to new datatype package.
berghofe
parents: 5162
diff changeset
   107
primrec
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   108
  "map f [] = []"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   109
  "map f (x#xs) = f(x)#map f xs"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   110
5183
89f162de39cf Adapted to new datatype package.
berghofe
parents: 5162
diff changeset
   111
primrec
21754
6316163ae934 moved char/string syntax to Tools/string_syntax.ML;
wenzelm
parents: 21548
diff changeset
   112
  append_Nil: "[]@ys = ys"
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   113
  append_Cons: "(x#xs)@ys = x#(xs@ys)"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   114
5183
89f162de39cf Adapted to new datatype package.
berghofe
parents: 5162
diff changeset
   115
primrec
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   116
  "rev([]) = []"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   117
  "rev(x#xs) = rev(xs) @ [x]"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   118
5183
89f162de39cf Adapted to new datatype package.
berghofe
parents: 5162
diff changeset
   119
primrec
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   120
  "filter P [] = []"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   121
  "filter P (x#xs) = (if P x then x#filter P xs else filter P xs)"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   122
5183
89f162de39cf Adapted to new datatype package.
berghofe
parents: 5162
diff changeset
   123
primrec
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   124
  foldl_Nil:"foldl f a [] = a"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   125
  foldl_Cons: "foldl f a (x#xs) = foldl f (f a x) xs"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   126
8000
acafa0f15131 added foldr
paulson
parents: 7224
diff changeset
   127
primrec
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   128
  "foldr f [] a = a"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   129
  "foldr f (x#xs) a = f x (foldr f xs a)"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   130
5183
89f162de39cf Adapted to new datatype package.
berghofe
parents: 5162
diff changeset
   131
primrec
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   132
  "concat([]) = []"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   133
  "concat(x#xs) = x @ concat(xs)"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   134
5183
89f162de39cf Adapted to new datatype package.
berghofe
parents: 5162
diff changeset
   135
primrec
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   136
  drop_Nil:"drop n [] = []"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   137
  drop_Cons: "drop n (x#xs) = (case n of 0 => x#xs | Suc(m) => drop m xs)"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   138
  -- {*Warning: simpset does not contain this definition, but separate
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   139
       theorems for @{text "n = 0"} and @{text "n = Suc k"} *}
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   140
5183
89f162de39cf Adapted to new datatype package.
berghofe
parents: 5162
diff changeset
   141
primrec
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   142
  take_Nil:"take n [] = []"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   143
  take_Cons: "take n (x#xs) = (case n of 0 => [] | Suc(m) => x # take m xs)"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   144
  -- {*Warning: simpset does not contain this definition, but separate
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   145
       theorems for @{text "n = 0"} and @{text "n = Suc k"} *}
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   146
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   147
primrec
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   148
  nth_Cons:"(x#xs)!n = (case n of 0 => x | (Suc k) => xs!k)"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   149
  -- {*Warning: simpset does not contain this definition, but separate
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   150
       theorems for @{text "n = 0"} and @{text "n = Suc k"} *}
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   151
5183
89f162de39cf Adapted to new datatype package.
berghofe
parents: 5162
diff changeset
   152
primrec
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   153
  "[][i:=v] = []"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   154
  "(x#xs)[i:=v] = (case i of 0 => v # xs | Suc j => x # xs[j:=v])"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   155
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   156
primrec
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   157
  "takeWhile P [] = []"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   158
  "takeWhile P (x#xs) = (if P x then x#takeWhile P xs else [])"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   159
5183
89f162de39cf Adapted to new datatype package.
berghofe
parents: 5162
diff changeset
   160
primrec
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   161
  "dropWhile P [] = []"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   162
  "dropWhile P (x#xs) = (if P x then dropWhile P xs else x#xs)"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   163
5183
89f162de39cf Adapted to new datatype package.
berghofe
parents: 5162
diff changeset
   164
primrec
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   165
  "zip xs [] = []"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   166
  zip_Cons: "zip xs (y#ys) = (case xs of [] => [] | z#zs => (z,y)#zip zs ys)"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   167
  -- {*Warning: simpset does not contain this definition, but separate
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   168
       theorems for @{text "xs = []"} and @{text "xs = z # zs"} *}
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   169
5427
26c9a7c0b36b Arith: less_diff_conv
nipkow
parents: 5425
diff changeset
   170
primrec
15425
6356d2523f73 [ .. (] -> [ ..< ]
nipkow
parents: 15392
diff changeset
   171
  upt_0: "[i..<0] = []"
6356d2523f73 [ .. (] -> [ ..< ]
nipkow
parents: 15392
diff changeset
   172
  upt_Suc: "[i..<(Suc j)] = (if i <= j then [i..<j] @ [j] else [])"
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   173
5183
89f162de39cf Adapted to new datatype package.
berghofe
parents: 5162
diff changeset
   174
primrec
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   175
  "distinct [] = True"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   176
  "distinct (x#xs) = (x ~: set xs \<and> distinct xs)"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   177
5183
89f162de39cf Adapted to new datatype package.
berghofe
parents: 5162
diff changeset
   178
primrec
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   179
  "remdups [] = []"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   180
  "remdups (x#xs) = (if x : set xs then remdups xs else x # remdups xs)"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   181
5183
89f162de39cf Adapted to new datatype package.
berghofe
parents: 5162
diff changeset
   182
primrec
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   183
  "remove1 x [] = []"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   184
  "remove1 x (y#xs) = (if x=y then xs else y # remove1 x xs)"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   185
15110
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   186
primrec
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   187
  replicate_0: "replicate 0 x = []"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   188
  replicate_Suc: "replicate (Suc n) x = x # replicate n x"
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   189
21061
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   190
definition
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   191
  rotate1 :: "'a list \<Rightarrow> 'a list" where
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   192
  "rotate1 xs = (case xs of [] \<Rightarrow> [] | x#xs \<Rightarrow> xs @ [x])"
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   193
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   194
definition
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   195
  rotate :: "nat \<Rightarrow> 'a list \<Rightarrow> 'a list" where
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   196
  "rotate n = rotate1 ^ n"
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   197
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   198
definition
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   199
  list_all2 :: "('a => 'b => bool) => 'a list => 'b list => bool" where
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   200
  "list_all2 P xs ys =
21061
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   201
    (length xs = length ys \<and> (\<forall>(x, y) \<in> set (zip xs ys). P x y))"
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   202
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   203
definition
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   204
  sublist :: "'a list => nat set => 'a list" where
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   205
  "sublist xs A = map fst (filter (\<lambda>p. snd p \<in> A) (zip xs [0..<size xs]))"
17086
0eb0c9259dd7 added quite a few functions for code generation
nipkow
parents: 16998
diff changeset
   206
0eb0c9259dd7 added quite a few functions for code generation
nipkow
parents: 16998
diff changeset
   207
primrec
21061
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   208
  "splice [] ys = ys"
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   209
  "splice (x#xs) ys = (if ys=[] then x#xs else x # hd ys # splice xs (tl ys))"
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   210
    -- {*Warning: simpset does not contain the second eqn but a derived one. *}
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   211
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   212
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   213
subsubsection {* @{const Nil} and @{const Cons} *}
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   214
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   215
lemma not_Cons_self [simp]:
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   216
  "xs \<noteq> x # xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   217
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   218
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   219
lemmas not_Cons_self2 [simp] = not_Cons_self [symmetric]
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   220
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   221
lemma neq_Nil_conv: "(xs \<noteq> []) = (\<exists>y ys. xs = y # ys)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   222
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   223
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   224
lemma length_induct:
21061
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   225
  "(\<And>xs. \<forall>ys. length ys < length xs \<longrightarrow> P ys \<Longrightarrow> P xs) \<Longrightarrow> P xs"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17501
diff changeset
   226
by (rule measure_induct [of length]) iprover
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   227
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   228
21061
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   229
subsubsection {* @{const length} *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   230
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   231
text {*
21061
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   232
  Needs to come before @{text "@"} because of theorem @{text
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   233
  append_eq_append_conv}.
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   234
*}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   235
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   236
lemma length_append [simp]: "length (xs @ ys) = length xs + length ys"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   237
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   238
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   239
lemma length_map [simp]: "length (map f xs) = length xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   240
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   241
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   242
lemma length_rev [simp]: "length (rev xs) = length xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   243
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   244
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   245
lemma length_tl [simp]: "length (tl xs) = length xs - 1"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   246
by (cases xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   247
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   248
lemma length_0_conv [iff]: "(length xs = 0) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   249
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   250
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   251
lemma length_greater_0_conv [iff]: "(0 < length xs) = (xs \<noteq> [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   252
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   253
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   254
lemma length_Suc_conv:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   255
"(length xs = Suc n) = (\<exists>y ys. xs = y # ys \<and> length ys = n)"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   256
by (induct xs) auto
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   257
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   258
lemma Suc_length_conv:
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   259
"(Suc n = length xs) = (\<exists>y ys. xs = y # ys \<and> length ys = n)"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   260
apply (induct xs, simp, simp)
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   261
apply blast
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   262
done
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   263
14099
55d244f3c86d added fold_red, o2l, postfix, some thms
oheimb
parents: 14050
diff changeset
   264
lemma impossible_Cons [rule_format]: 
55d244f3c86d added fold_red, o2l, postfix, some thms
oheimb
parents: 14050
diff changeset
   265
  "length xs <= length ys --> xs = x # ys = False"
20503
503ac4c5ef91 induct method: renamed 'fixing' to 'arbitrary';
wenzelm
parents: 20453
diff changeset
   266
apply (induct xs)
503ac4c5ef91 induct method: renamed 'fixing' to 'arbitrary';
wenzelm
parents: 20453
diff changeset
   267
apply auto
14099
55d244f3c86d added fold_red, o2l, postfix, some thms
oheimb
parents: 14050
diff changeset
   268
done
55d244f3c86d added fold_red, o2l, postfix, some thms
oheimb
parents: 14050
diff changeset
   269
14247
cb32eb89bddd *** empty log message ***
nipkow
parents: 14208
diff changeset
   270
lemma list_induct2[consumes 1]: "\<And>ys.
cb32eb89bddd *** empty log message ***
nipkow
parents: 14208
diff changeset
   271
 \<lbrakk> length xs = length ys;
cb32eb89bddd *** empty log message ***
nipkow
parents: 14208
diff changeset
   272
   P [] [];
cb32eb89bddd *** empty log message ***
nipkow
parents: 14208
diff changeset
   273
   \<And>x xs y ys. \<lbrakk> length xs = length ys; P xs ys \<rbrakk> \<Longrightarrow> P (x#xs) (y#ys) \<rbrakk>
cb32eb89bddd *** empty log message ***
nipkow
parents: 14208
diff changeset
   274
 \<Longrightarrow> P xs ys"
cb32eb89bddd *** empty log message ***
nipkow
parents: 14208
diff changeset
   275
apply(induct xs)
cb32eb89bddd *** empty log message ***
nipkow
parents: 14208
diff changeset
   276
 apply simp
cb32eb89bddd *** empty log message ***
nipkow
parents: 14208
diff changeset
   277
apply(case_tac ys)
cb32eb89bddd *** empty log message ***
nipkow
parents: 14208
diff changeset
   278
 apply simp
cb32eb89bddd *** empty log message ***
nipkow
parents: 14208
diff changeset
   279
apply(simp)
cb32eb89bddd *** empty log message ***
nipkow
parents: 14208
diff changeset
   280
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   281
22493
db930e490fe5 added another rule for simultaneous induction, and lemmas for zip
krauss
parents: 22422
diff changeset
   282
lemma list_induct2': 
db930e490fe5 added another rule for simultaneous induction, and lemmas for zip
krauss
parents: 22422
diff changeset
   283
  "\<lbrakk> P [] [];
db930e490fe5 added another rule for simultaneous induction, and lemmas for zip
krauss
parents: 22422
diff changeset
   284
  \<And>x xs. P (x#xs) [];
db930e490fe5 added another rule for simultaneous induction, and lemmas for zip
krauss
parents: 22422
diff changeset
   285
  \<And>y ys. P [] (y#ys);
db930e490fe5 added another rule for simultaneous induction, and lemmas for zip
krauss
parents: 22422
diff changeset
   286
   \<And>x xs y ys. P xs ys  \<Longrightarrow> P (x#xs) (y#ys) \<rbrakk>
db930e490fe5 added another rule for simultaneous induction, and lemmas for zip
krauss
parents: 22422
diff changeset
   287
 \<Longrightarrow> P xs ys"
db930e490fe5 added another rule for simultaneous induction, and lemmas for zip
krauss
parents: 22422
diff changeset
   288
by (induct xs arbitrary: ys) (case_tac x, auto)+
db930e490fe5 added another rule for simultaneous induction, and lemmas for zip
krauss
parents: 22422
diff changeset
   289
22143
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   290
lemma neq_if_length_neq: "length xs \<noteq> length ys \<Longrightarrow> (xs = ys) == False"
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   291
apply(rule Eq_FalseI)
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   292
by auto
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   293
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   294
(*
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   295
Reduces xs=ys to False if xs and ys cannot be of the same length.
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   296
This is the case if the atomic sublists of one are a submultiset
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   297
of those of the other list and there are fewer Cons's in one than the other.
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   298
*)
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   299
ML_setup {*
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   300
local
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   301
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   302
val neq_if_length_neq = thm "neq_if_length_neq";
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   303
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   304
fun len (Const("List.list.Nil",_)) acc = acc
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   305
  | len (Const("List.list.Cons",_) $ _ $ xs) (ts,n) = len xs (ts,n+1)
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   306
  | len (Const("List.op @",_) $ xs $ ys) acc = len xs (len ys acc)
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   307
  | len (Const("List.rev",_) $ xs) acc = len xs acc
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   308
  | len (Const("List.map",_) $ _ $ xs) acc = len xs acc
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   309
  | len t (ts,n) = (t::ts,n);
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   310
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   311
val list_ss = simpset_of(the_context());
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   312
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   313
fun list_eq ss (Const(_,eqT) $ lhs $ rhs) =
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   314
  let
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   315
    val (ls,m) = len lhs ([],0) and (rs,n) = len rhs ([],0);
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   316
    fun prove_neq() =
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   317
      let
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   318
        val Type(_,listT::_) = eqT;
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   319
        val size = Const("Nat.size", listT --> HOLogic.natT);
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   320
        val eq_len = HOLogic.mk_eq (size $ lhs, size $ rhs);
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   321
        val neq_len = HOLogic.mk_Trueprop (HOLogic.Not $ eq_len);
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   322
        val thm = Goal.prove (Simplifier.the_context ss) [] [] neq_len
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   323
          (K (simp_tac (Simplifier.inherit_context ss list_ss) 1));
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   324
      in SOME (thm RS neq_if_length_neq) end
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   325
  in
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   326
    if m < n andalso gen_submultiset (op aconv) (ls,rs) orelse
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   327
       n < m andalso gen_submultiset (op aconv) (rs,ls)
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   328
    then prove_neq() else NONE
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   329
  end;
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   330
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   331
in
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   332
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   333
val list_neq_simproc =
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   334
  Simplifier.simproc (the_context ()) "list_neq" ["(xs::'a list) = ys"] (K list_eq);
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   335
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   336
end;
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   337
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   338
Addsimprocs [list_neq_simproc];
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   339
*}
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   340
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   341
15392
290bc97038c7 First step in reorganizing Finite_Set
nipkow
parents: 15307
diff changeset
   342
subsubsection {* @{text "@"} -- append *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   343
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   344
lemma append_assoc [simp]: "(xs @ ys) @ zs = xs @ (ys @ zs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   345
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   346
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   347
lemma append_Nil2 [simp]: "xs @ [] = xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   348
by (induct xs) auto
3507
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   349
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   350
lemma append_is_Nil_conv [iff]: "(xs @ ys = []) = (xs = [] \<and> ys = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   351
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   352
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   353
lemma Nil_is_append_conv [iff]: "([] = xs @ ys) = (xs = [] \<and> ys = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   354
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   355
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   356
lemma append_self_conv [iff]: "(xs @ ys = xs) = (ys = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   357
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   358
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   359
lemma self_append_conv [iff]: "(xs = xs @ ys) = (ys = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   360
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   361
13883
0451e0fb3f22 Re-structured some proofs in order to get rid of rule_format attribute.
berghofe
parents: 13863
diff changeset
   362
lemma append_eq_append_conv [simp]:
0451e0fb3f22 Re-structured some proofs in order to get rid of rule_format attribute.
berghofe
parents: 13863
diff changeset
   363
 "!!ys. length xs = length ys \<or> length us = length vs
0451e0fb3f22 Re-structured some proofs in order to get rid of rule_format attribute.
berghofe
parents: 13863
diff changeset
   364
 ==> (xs@us = ys@vs) = (xs=ys \<and> us=vs)"
0451e0fb3f22 Re-structured some proofs in order to get rid of rule_format attribute.
berghofe
parents: 13863
diff changeset
   365
apply (induct xs)
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   366
 apply (case_tac ys, simp, force)
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   367
apply (case_tac ys, force, simp)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   368
done
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   369
14495
e2a1c31cf6d3 Added append_eq_append_conv2
nipkow
parents: 14402
diff changeset
   370
lemma append_eq_append_conv2: "!!ys zs ts.
e2a1c31cf6d3 Added append_eq_append_conv2
nipkow
parents: 14402
diff changeset
   371
 (xs @ ys = zs @ ts) =
e2a1c31cf6d3 Added append_eq_append_conv2
nipkow
parents: 14402
diff changeset
   372
 (EX us. xs = zs @ us & us @ ys = ts | xs @ us = zs & ys = us@ ts)"
e2a1c31cf6d3 Added append_eq_append_conv2
nipkow
parents: 14402
diff changeset
   373
apply (induct xs)
e2a1c31cf6d3 Added append_eq_append_conv2
nipkow
parents: 14402
diff changeset
   374
 apply fastsimp
e2a1c31cf6d3 Added append_eq_append_conv2
nipkow
parents: 14402
diff changeset
   375
apply(case_tac zs)
e2a1c31cf6d3 Added append_eq_append_conv2
nipkow
parents: 14402
diff changeset
   376
 apply simp
e2a1c31cf6d3 Added append_eq_append_conv2
nipkow
parents: 14402
diff changeset
   377
apply fastsimp
e2a1c31cf6d3 Added append_eq_append_conv2
nipkow
parents: 14402
diff changeset
   378
done
e2a1c31cf6d3 Added append_eq_append_conv2
nipkow
parents: 14402
diff changeset
   379
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   380
lemma same_append_eq [iff]: "(xs @ ys = xs @ zs) = (ys = zs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   381
by simp
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   382
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   383
lemma append1_eq_conv [iff]: "(xs @ [x] = ys @ [y]) = (xs = ys \<and> x = y)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   384
by simp
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   385
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   386
lemma append_same_eq [iff]: "(ys @ xs = zs @ xs) = (ys = zs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   387
by simp
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   388
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   389
lemma append_self_conv2 [iff]: "(xs @ ys = ys) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   390
using append_same_eq [of _ _ "[]"] by auto
3507
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   391
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   392
lemma self_append_conv2 [iff]: "(ys = xs @ ys) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   393
using append_same_eq [of "[]"] by auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   394
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   395
lemma hd_Cons_tl [simp]: "xs \<noteq> [] ==> hd xs # tl xs = xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   396
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   397
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   398
lemma hd_append: "hd (xs @ ys) = (if xs = [] then hd ys else hd xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   399
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   400
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   401
lemma hd_append2 [simp]: "xs \<noteq> [] ==> hd (xs @ ys) = hd xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   402
by (simp add: hd_append split: list.split)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   403
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   404
lemma tl_append: "tl (xs @ ys) = (case xs of [] => tl ys | z#zs => zs @ ys)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   405
by (simp split: list.split)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   406
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   407
lemma tl_append2 [simp]: "xs \<noteq> [] ==> tl (xs @ ys) = tl xs @ ys"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   408
by (simp add: tl_append split: list.split)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   409
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   410
14300
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
   411
lemma Cons_eq_append_conv: "x#xs = ys@zs =
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
   412
 (ys = [] & x#xs = zs | (EX ys'. x#ys' = ys & xs = ys'@zs))"
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
   413
by(cases ys) auto
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
   414
15281
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   415
lemma append_eq_Cons_conv: "(ys@zs = x#xs) =
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   416
 (ys = [] & zs = x#xs | (EX ys'. ys = x#ys' & ys'@zs = xs))"
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   417
by(cases ys) auto
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   418
14300
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
   419
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   420
text {* Trivial rules for solving @{text "@"}-equations automatically. *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   421
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   422
lemma eq_Nil_appendI: "xs = ys ==> xs = [] @ ys"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   423
by simp
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   424
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   425
lemma Cons_eq_appendI:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   426
"[| x # xs1 = ys; xs = xs1 @ zs |] ==> x # xs = ys @ zs"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   427
by (drule sym) simp
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   428
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   429
lemma append_eq_appendI:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   430
"[| xs @ xs1 = zs; ys = xs1 @ us |] ==> xs @ ys = zs @ us"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   431
by (drule sym) simp
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   432
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   433
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   434
text {*
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   435
Simplification procedure for all list equalities.
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   436
Currently only tries to rearrange @{text "@"} to see if
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   437
- both lists end in a singleton list,
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   438
- or both lists end in the same list.
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   439
*}
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   440
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   441
ML_setup {*
3507
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   442
local
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   443
13122
wenzelm
parents: 13114
diff changeset
   444
val append_assoc = thm "append_assoc";
wenzelm
parents: 13114
diff changeset
   445
val append_Nil = thm "append_Nil";
wenzelm
parents: 13114
diff changeset
   446
val append_Cons = thm "append_Cons";
wenzelm
parents: 13114
diff changeset
   447
val append1_eq_conv = thm "append1_eq_conv";
wenzelm
parents: 13114
diff changeset
   448
val append_same_eq = thm "append_same_eq";
wenzelm
parents: 13114
diff changeset
   449
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   450
fun last (cons as Const("List.list.Cons",_) $ _ $ xs) =
13462
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   451
  (case xs of Const("List.list.Nil",_) => cons | _ => last xs)
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   452
  | last (Const("List.op @",_) $ _ $ ys) = last ys
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   453
  | last t = t;
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   454
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   455
fun list1 (Const("List.list.Cons",_) $ _ $ Const("List.list.Nil",_)) = true
13462
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   456
  | list1 _ = false;
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   457
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   458
fun butlast ((cons as Const("List.list.Cons",_) $ x) $ xs) =
13462
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   459
  (case xs of Const("List.list.Nil",_) => xs | _ => cons $ butlast xs)
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   460
  | butlast ((app as Const("List.op @",_) $ xs) $ ys) = app $ butlast ys
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   461
  | butlast xs = Const("List.list.Nil",fastype_of xs);
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   462
16973
b2a894562b8f simprocs: Simplifier.inherit_bounds;
wenzelm
parents: 16965
diff changeset
   463
val rearr_ss = HOL_basic_ss addsimps [append_assoc, append_Nil, append_Cons];
b2a894562b8f simprocs: Simplifier.inherit_bounds;
wenzelm
parents: 16965
diff changeset
   464
20044
92cc2f4c7335 simprocs: no theory argument -- use simpset context instead;
wenzelm
parents: 19890
diff changeset
   465
fun list_eq ss (F as (eq as Const(_,eqT)) $ lhs $ rhs) =
13462
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   466
  let
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   467
    val lastl = last lhs and lastr = last rhs;
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   468
    fun rearr conv =
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   469
      let
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   470
        val lhs1 = butlast lhs and rhs1 = butlast rhs;
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   471
        val Type(_,listT::_) = eqT
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   472
        val appT = [listT,listT] ---> listT
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   473
        val app = Const("List.op @",appT)
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   474
        val F2 = eq $ (app$lhs1$lastl) $ (app$rhs1$lastr)
13480
bb72bd43c6c3 use Tactic.prove instead of prove_goalw_cterm in internal proofs!
wenzelm
parents: 13462
diff changeset
   475
        val eq = HOLogic.mk_Trueprop (HOLogic.mk_eq (F,F2));
20044
92cc2f4c7335 simprocs: no theory argument -- use simpset context instead;
wenzelm
parents: 19890
diff changeset
   476
        val thm = Goal.prove (Simplifier.the_context ss) [] [] eq
17877
67d5ab1cb0d8 Simplifier.inherit_context instead of Simplifier.inherit_bounds;
wenzelm
parents: 17830
diff changeset
   477
          (K (simp_tac (Simplifier.inherit_context ss rearr_ss) 1));
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15489
diff changeset
   478
      in SOME ((conv RS (thm RS trans)) RS eq_reflection) end;
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   479
13462
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   480
  in
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   481
    if list1 lastl andalso list1 lastr then rearr append1_eq_conv
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   482
    else if lastl aconv lastr then rearr append_same_eq
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15489
diff changeset
   483
    else NONE
13462
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   484
  end;
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   485
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   486
in
13462
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   487
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   488
val list_eq_simproc =
21061
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   489
  Simplifier.simproc (the_context ()) "list_eq" ["(xs::'a list) = ys"] (K list_eq);
13462
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   490
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   491
end;
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   492
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   493
Addsimprocs [list_eq_simproc];
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   494
*}
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   495
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   496
15392
290bc97038c7 First step in reorganizing Finite_Set
nipkow
parents: 15307
diff changeset
   497
subsubsection {* @{text map} *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   498
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   499
lemma map_ext: "(!!x. x : set xs --> f x = g x) ==> map f xs = map g xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   500
by (induct xs) simp_all
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   501
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   502
lemma map_ident [simp]: "map (\<lambda>x. x) = (\<lambda>xs. xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   503
by (rule ext, induct_tac xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   504
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   505
lemma map_append [simp]: "map f (xs @ ys) = map f xs @ map f ys"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   506
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   507
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   508
lemma map_compose: "map (f o g) xs = map f (map g xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   509
by (induct xs) (auto simp add: o_def)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   510
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   511
lemma rev_map: "rev (map f xs) = map f (rev xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   512
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   513
13737
e564c3d2d174 added a few lemmas
nipkow
parents: 13601
diff changeset
   514
lemma map_eq_conv[simp]: "(map f xs = map g xs) = (!x : set xs. f x = g x)"
e564c3d2d174 added a few lemmas
nipkow
parents: 13601
diff changeset
   515
by (induct xs) auto
e564c3d2d174 added a few lemmas
nipkow
parents: 13601
diff changeset
   516
19770
be5c23ebe1eb HOL/Tools/function_package: Added support for mutual recursive definitions.
krauss
parents: 19623
diff changeset
   517
lemma map_cong [fundef_cong, recdef_cong]:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   518
"xs = ys ==> (!!x. x : set ys ==> f x = g x) ==> map f xs = map g ys"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   519
-- {* a congruence rule for @{text map} *}
13737
e564c3d2d174 added a few lemmas
nipkow
parents: 13601
diff changeset
   520
by simp
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   521
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   522
lemma map_is_Nil_conv [iff]: "(map f xs = []) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   523
by (cases xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   524
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   525
lemma Nil_is_map_conv [iff]: "([] = map f xs) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   526
by (cases xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   527
18447
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
   528
lemma map_eq_Cons_conv:
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   529
 "(map f xs = y#ys) = (\<exists>z zs. xs = z#zs \<and> f z = y \<and> map f zs = ys)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   530
by (cases xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   531
18447
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
   532
lemma Cons_eq_map_conv:
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   533
 "(x#xs = map f ys) = (\<exists>z zs. ys = z#zs \<and> x = f z \<and> xs = map f zs)"
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   534
by (cases ys) auto
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   535
18447
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
   536
lemmas map_eq_Cons_D = map_eq_Cons_conv [THEN iffD1]
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
   537
lemmas Cons_eq_map_D = Cons_eq_map_conv [THEN iffD1]
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
   538
declare map_eq_Cons_D [dest!]  Cons_eq_map_D [dest!]
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
   539
14111
993471c762b8 Some new thm (ex_map_conv?)
nipkow
parents: 14099
diff changeset
   540
lemma ex_map_conv:
993471c762b8 Some new thm (ex_map_conv?)
nipkow
parents: 14099
diff changeset
   541
  "(EX xs. ys = map f xs) = (ALL y : set ys. EX x. y = f x)"
18447
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
   542
by(induct ys, auto simp add: Cons_eq_map_conv)
14111
993471c762b8 Some new thm (ex_map_conv?)
nipkow
parents: 14099
diff changeset
   543
15110
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   544
lemma map_eq_imp_length_eq:
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   545
  "!!xs. map f xs = map f ys ==> length xs = length ys"
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   546
apply (induct ys)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   547
 apply simp
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   548
apply(simp (no_asm_use))
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   549
apply clarify
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   550
apply(simp (no_asm_use))
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   551
apply fast
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   552
done
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   553
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   554
lemma map_inj_on:
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   555
 "[| map f xs = map f ys; inj_on f (set xs Un set ys) |]
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   556
  ==> xs = ys"
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   557
apply(frule map_eq_imp_length_eq)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   558
apply(rotate_tac -1)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   559
apply(induct rule:list_induct2)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   560
 apply simp
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   561
apply(simp)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   562
apply (blast intro:sym)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   563
done
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   564
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   565
lemma inj_on_map_eq_map:
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   566
 "inj_on f (set xs Un set ys) \<Longrightarrow> (map f xs = map f ys) = (xs = ys)"
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   567
by(blast dest:map_inj_on)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   568
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   569
lemma map_injective:
14338
a1add2de7601 *** empty log message ***
nipkow
parents: 14328
diff changeset
   570
 "!!xs. map f xs = map f ys ==> inj f ==> xs = ys"
a1add2de7601 *** empty log message ***
nipkow
parents: 14328
diff changeset
   571
by (induct ys) (auto dest!:injD)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   572
14339
ec575b7bde7a *** empty log message ***
nipkow
parents: 14338
diff changeset
   573
lemma inj_map_eq_map[simp]: "inj f \<Longrightarrow> (map f xs = map f ys) = (xs = ys)"
ec575b7bde7a *** empty log message ***
nipkow
parents: 14338
diff changeset
   574
by(blast dest:map_injective)
ec575b7bde7a *** empty log message ***
nipkow
parents: 14338
diff changeset
   575
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   576
lemma inj_mapI: "inj f ==> inj (map f)"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17501
diff changeset
   577
by (iprover dest: map_injective injD intro: inj_onI)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   578
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   579
lemma inj_mapD: "inj (map f) ==> inj f"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   580
apply (unfold inj_on_def, clarify)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   581
apply (erule_tac x = "[x]" in ballE)
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   582
 apply (erule_tac x = "[y]" in ballE, simp, blast)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   583
apply blast
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   584
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   585
14339
ec575b7bde7a *** empty log message ***
nipkow
parents: 14338
diff changeset
   586
lemma inj_map[iff]: "inj (map f) = inj f"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   587
by (blast dest: inj_mapD intro: inj_mapI)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   588
15303
eedbb8d22ca2 added lemmas
nipkow
parents: 15302
diff changeset
   589
lemma inj_on_mapI: "inj_on f (\<Union>(set ` A)) \<Longrightarrow> inj_on (map f) A"
eedbb8d22ca2 added lemmas
nipkow
parents: 15302
diff changeset
   590
apply(rule inj_onI)
eedbb8d22ca2 added lemmas
nipkow
parents: 15302
diff changeset
   591
apply(erule map_inj_on)
eedbb8d22ca2 added lemmas
nipkow
parents: 15302
diff changeset
   592
apply(blast intro:inj_onI dest:inj_onD)
eedbb8d22ca2 added lemmas
nipkow
parents: 15302
diff changeset
   593
done
eedbb8d22ca2 added lemmas
nipkow
parents: 15302
diff changeset
   594
14343
6bc647f472b9 map_idI
kleing
parents: 14339
diff changeset
   595
lemma map_idI: "(\<And>x. x \<in> set xs \<Longrightarrow> f x = x) \<Longrightarrow> map f xs = xs"
6bc647f472b9 map_idI
kleing
parents: 14339
diff changeset
   596
by (induct xs, auto)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   597
14402
4201e1916482 moved lemmas from MicroJava/Comp/AuxLemmas.thy to List.thy
nipkow
parents: 14395
diff changeset
   598
lemma map_fun_upd [simp]: "y \<notin> set xs \<Longrightarrow> map (f(y:=v)) xs = map f xs"
4201e1916482 moved lemmas from MicroJava/Comp/AuxLemmas.thy to List.thy
nipkow
parents: 14395
diff changeset
   599
by (induct xs) auto
4201e1916482 moved lemmas from MicroJava/Comp/AuxLemmas.thy to List.thy
nipkow
parents: 14395
diff changeset
   600
15110
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   601
lemma map_fst_zip[simp]:
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   602
  "length xs = length ys \<Longrightarrow> map fst (zip xs ys) = xs"
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   603
by (induct rule:list_induct2, simp_all)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   604
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   605
lemma map_snd_zip[simp]:
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   606
  "length xs = length ys \<Longrightarrow> map snd (zip xs ys) = ys"
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   607
by (induct rule:list_induct2, simp_all)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   608
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   609
15392
290bc97038c7 First step in reorganizing Finite_Set
nipkow
parents: 15307
diff changeset
   610
subsubsection {* @{text rev} *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   611
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   612
lemma rev_append [simp]: "rev (xs @ ys) = rev ys @ rev xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   613
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   614
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   615
lemma rev_rev_ident [simp]: "rev (rev xs) = xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   616
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   617
15870
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
   618
lemma rev_swap: "(rev xs = ys) = (xs = rev ys)"
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
   619
by auto
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
   620
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   621
lemma rev_is_Nil_conv [iff]: "(rev xs = []) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   622
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   623
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   624
lemma Nil_is_rev_conv [iff]: "([] = rev xs) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   625
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   626
15870
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
   627
lemma rev_singleton_conv [simp]: "(rev xs = [x]) = (xs = [x])"
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
   628
by (cases xs) auto
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
   629
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
   630
lemma singleton_rev_conv [simp]: "([x] = rev xs) = (xs = [x])"
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
   631
by (cases xs) auto
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
   632
21061
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   633
lemma rev_is_rev_conv [iff]: "(rev xs = rev ys) = (xs = ys)"
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   634
apply (induct xs arbitrary: ys, force)
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   635
apply (case_tac ys, simp, force)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   636
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   637
15439
71c0f98e31f1 made diff_less a simp rule
nipkow
parents: 15426
diff changeset
   638
lemma inj_on_rev[iff]: "inj_on rev A"
71c0f98e31f1 made diff_less a simp rule
nipkow
parents: 15426
diff changeset
   639
by(simp add:inj_on_def)
71c0f98e31f1 made diff_less a simp rule
nipkow
parents: 15426
diff changeset
   640
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   641
lemma rev_induct [case_names Nil snoc]:
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   642
  "[| P []; !!x xs. P xs ==> P (xs @ [x]) |] ==> P xs"
15489
d136af442665 Replaced application of subst by simplesubst in proof of rev_induct
berghofe
parents: 15439
diff changeset
   643
apply(simplesubst rev_rev_ident[symmetric])
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   644
apply(rule_tac list = "rev xs" in list.induct, simp_all)
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   645
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   646
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   647
ML {* val rev_induct_tac = induct_thm_tac (thm "rev_induct") *}-- "compatibility"
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   648
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   649
lemma rev_exhaust [case_names Nil snoc]:
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   650
  "(xs = [] ==> P) ==>(!!ys y. xs = ys @ [y] ==> P) ==> P"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   651
by (induct xs rule: rev_induct) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   652
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   653
lemmas rev_cases = rev_exhaust
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   654
18423
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
   655
lemma rev_eq_Cons_iff[iff]: "(rev xs = y#ys) = (xs = rev ys @ [y])"
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
   656
by(rule rev_cases[of xs]) auto
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
   657
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   658
15392
290bc97038c7 First step in reorganizing Finite_Set
nipkow
parents: 15307
diff changeset
   659
subsubsection {* @{text set} *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   660
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   661
lemma finite_set [iff]: "finite (set xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   662
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   663
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   664
lemma set_append [simp]: "set (xs @ ys) = (set xs \<union> set ys)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   665
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   666
17830
695a2365d32f added hd lemma
nipkow
parents: 17765
diff changeset
   667
lemma hd_in_set[simp]: "xs \<noteq> [] \<Longrightarrow> hd xs : set xs"
695a2365d32f added hd lemma
nipkow
parents: 17765
diff changeset
   668
by(cases xs) auto
14099
55d244f3c86d added fold_red, o2l, postfix, some thms
oheimb
parents: 14050
diff changeset
   669
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   670
lemma set_subset_Cons: "set xs \<subseteq> set (x # xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   671
by auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   672
14099
55d244f3c86d added fold_red, o2l, postfix, some thms
oheimb
parents: 14050
diff changeset
   673
lemma set_ConsD: "y \<in> set (x # xs) \<Longrightarrow> y=x \<or> y \<in> set xs" 
55d244f3c86d added fold_red, o2l, postfix, some thms
oheimb
parents: 14050
diff changeset
   674
by auto
55d244f3c86d added fold_red, o2l, postfix, some thms
oheimb
parents: 14050
diff changeset
   675
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   676
lemma set_empty [iff]: "(set xs = {}) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   677
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   678
15245
5a21d9a8f14b Added a few lemmas
nipkow
parents: 15236
diff changeset
   679
lemma set_empty2[iff]: "({} = set xs) = (xs = [])"
5a21d9a8f14b Added a few lemmas
nipkow
parents: 15236
diff changeset
   680
by(induct xs) auto
5a21d9a8f14b Added a few lemmas
nipkow
parents: 15236
diff changeset
   681
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   682
lemma set_rev [simp]: "set (rev xs) = set xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   683
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   684
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   685
lemma set_map [simp]: "set (map f xs) = f`(set xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   686
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   687
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   688
lemma set_filter [simp]: "set (filter P xs) = {x. x : set xs \<and> P x}"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   689
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   690
15425
6356d2523f73 [ .. (] -> [ ..< ]
nipkow
parents: 15392
diff changeset
   691
lemma set_upt [simp]: "set[i..<j] = {k. i \<le> k \<and> k < j}"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   692
apply (induct j, simp_all)
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   693
apply (erule ssubst, auto)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   694
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   695
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   696
lemma in_set_conv_decomp: "(x : set xs) = (\<exists>ys zs. xs = ys @ x # zs)"
15113
fafcd72b9d4b some structured proofs
paulson
parents: 15110
diff changeset
   697
proof (induct xs)
fafcd72b9d4b some structured proofs
paulson
parents: 15110
diff changeset
   698
  case Nil show ?case by simp
fafcd72b9d4b some structured proofs
paulson
parents: 15110
diff changeset
   699
  case (Cons a xs)
fafcd72b9d4b some structured proofs
paulson
parents: 15110
diff changeset
   700
  show ?case
fafcd72b9d4b some structured proofs
paulson
parents: 15110
diff changeset
   701
  proof 
fafcd72b9d4b some structured proofs
paulson
parents: 15110
diff changeset
   702
    assume "x \<in> set (a # xs)"
fafcd72b9d4b some structured proofs
paulson
parents: 15110
diff changeset
   703
    with prems show "\<exists>ys zs. a # xs = ys @ x # zs"
fafcd72b9d4b some structured proofs
paulson
parents: 15110
diff changeset
   704
      by (simp, blast intro: Cons_eq_appendI)
fafcd72b9d4b some structured proofs
paulson
parents: 15110
diff changeset
   705
  next
fafcd72b9d4b some structured proofs
paulson
parents: 15110
diff changeset
   706
    assume "\<exists>ys zs. a # xs = ys @ x # zs"
fafcd72b9d4b some structured proofs
paulson
parents: 15110
diff changeset
   707
    then obtain ys zs where eq: "a # xs = ys @ x # zs" by blast
fafcd72b9d4b some structured proofs
paulson
parents: 15110
diff changeset
   708
    show "x \<in> set (a # xs)" 
fafcd72b9d4b some structured proofs
paulson
parents: 15110
diff changeset
   709
      by (cases ys, auto simp add: eq)
fafcd72b9d4b some structured proofs
paulson
parents: 15110
diff changeset
   710
  qed
fafcd72b9d4b some structured proofs
paulson
parents: 15110
diff changeset
   711
qed
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   712
18049
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   713
lemma in_set_conv_decomp_first:
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   714
 "(x : set xs) = (\<exists>ys zs. xs = ys @ x # zs \<and> x \<notin> set ys)"
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   715
proof (induct xs)
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   716
  case Nil show ?case by simp
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   717
next
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   718
  case (Cons a xs)
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   719
  show ?case
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   720
  proof cases
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   721
    assume "x = a" thus ?case using Cons by force
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   722
  next
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   723
    assume "x \<noteq> a"
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   724
    show ?case
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   725
    proof
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   726
      assume "x \<in> set (a # xs)"
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   727
      from prems show "\<exists>ys zs. a # xs = ys @ x # zs \<and> x \<notin> set ys"
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   728
	by(fastsimp intro!: Cons_eq_appendI)
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   729
    next
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   730
      assume "\<exists>ys zs. a # xs = ys @ x # zs \<and> x \<notin> set ys"
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   731
      then obtain ys zs where eq: "a # xs = ys @ x # zs" by blast
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   732
      show "x \<in> set (a # xs)" by (cases ys, auto simp add: eq)
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   733
    qed
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   734
  qed
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   735
qed
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   736
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   737
lemmas split_list       = in_set_conv_decomp[THEN iffD1, standard]
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   738
lemmas split_list_first = in_set_conv_decomp_first[THEN iffD1, standard]
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   739
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   740
13508
890d736b93a5 Frederic Blanqui's new "guard" examples
paulson
parents: 13480
diff changeset
   741
lemma finite_list: "finite A ==> EX l. set l = A"
890d736b93a5 Frederic Blanqui's new "guard" examples
paulson
parents: 13480
diff changeset
   742
apply (erule finite_induct, auto)
890d736b93a5 Frederic Blanqui's new "guard" examples
paulson
parents: 13480
diff changeset
   743
apply (rule_tac x="x#l" in exI, auto)
890d736b93a5 Frederic Blanqui's new "guard" examples
paulson
parents: 13480
diff changeset
   744
done
890d736b93a5 Frederic Blanqui's new "guard" examples
paulson
parents: 13480
diff changeset
   745
14388
04f04408b99b lemmas about card (set xs)
kleing
parents: 14343
diff changeset
   746
lemma card_length: "card (set xs) \<le> length xs"
04f04408b99b lemmas about card (set xs)
kleing
parents: 14343
diff changeset
   747
by (induct xs) (auto simp add: card_insert_if)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   748
15168
33a08cfc3ae5 new functions for sets of lists
paulson
parents: 15140
diff changeset
   749
15392
290bc97038c7 First step in reorganizing Finite_Set
nipkow
parents: 15307
diff changeset
   750
subsubsection {* @{text filter} *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   751
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   752
lemma filter_append [simp]: "filter P (xs @ ys) = filter P xs @ filter P ys"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   753
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   754
15305
0bd9eedaa301 added lemmas
nipkow
parents: 15304
diff changeset
   755
lemma rev_filter: "rev (filter P xs) = filter P (rev xs)"
0bd9eedaa301 added lemmas
nipkow
parents: 15304
diff changeset
   756
by (induct xs) simp_all
0bd9eedaa301 added lemmas
nipkow
parents: 15304
diff changeset
   757
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   758
lemma filter_filter [simp]: "filter P (filter Q xs) = filter (\<lambda>x. Q x \<and> P x) xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   759
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   760
16998
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
   761
lemma length_filter_le [simp]: "length (filter P xs) \<le> length xs"
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
   762
by (induct xs) (auto simp add: le_SucI)
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
   763
18423
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
   764
lemma sum_length_filter_compl:
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
   765
  "length(filter P xs) + length(filter (%x. ~P x) xs) = length xs"
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
   766
by(induct xs) simp_all
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
   767
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   768
lemma filter_True [simp]: "\<forall>x \<in> set xs. P x ==> filter P xs = xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   769
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   770
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   771
lemma filter_False [simp]: "\<forall>x \<in> set xs. \<not> P x ==> filter P xs = []"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   772
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   773
16998
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
   774
lemma filter_empty_conv: "(filter P xs = []) = (\<forall>x\<in>set xs. \<not> P x)" 
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
   775
  by (induct xs) simp_all
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
   776
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
   777
lemma filter_id_conv: "(filter P xs = xs) = (\<forall>x\<in>set xs. P x)"
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
   778
apply (induct xs)
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
   779
 apply auto
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
   780
apply(cut_tac P=P and xs=xs in length_filter_le)
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
   781
apply simp
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
   782
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   783
16965
46697fa536ab added map_filter lemmas
nipkow
parents: 16770
diff changeset
   784
lemma filter_map:
46697fa536ab added map_filter lemmas
nipkow
parents: 16770
diff changeset
   785
  "filter P (map f xs) = map f (filter (P o f) xs)"
46697fa536ab added map_filter lemmas
nipkow
parents: 16770
diff changeset
   786
by (induct xs) simp_all
46697fa536ab added map_filter lemmas
nipkow
parents: 16770
diff changeset
   787
46697fa536ab added map_filter lemmas
nipkow
parents: 16770
diff changeset
   788
lemma length_filter_map[simp]:
46697fa536ab added map_filter lemmas
nipkow
parents: 16770
diff changeset
   789
  "length (filter P (map f xs)) = length(filter (P o f) xs)"
46697fa536ab added map_filter lemmas
nipkow
parents: 16770
diff changeset
   790
by (simp add:filter_map)
46697fa536ab added map_filter lemmas
nipkow
parents: 16770
diff changeset
   791
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   792
lemma filter_is_subset [simp]: "set (filter P xs) \<le> set xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   793
by auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   794
15246
0984a2c2868b added and renamed
nipkow
parents: 15245
diff changeset
   795
lemma length_filter_less:
0984a2c2868b added and renamed
nipkow
parents: 15245
diff changeset
   796
  "\<lbrakk> x : set xs; ~ P x \<rbrakk> \<Longrightarrow> length(filter P xs) < length xs"
0984a2c2868b added and renamed
nipkow
parents: 15245
diff changeset
   797
proof (induct xs)
0984a2c2868b added and renamed
nipkow
parents: 15245
diff changeset
   798
  case Nil thus ?case by simp
0984a2c2868b added and renamed
nipkow
parents: 15245
diff changeset
   799
next
0984a2c2868b added and renamed
nipkow
parents: 15245
diff changeset
   800
  case (Cons x xs) thus ?case
0984a2c2868b added and renamed
nipkow
parents: 15245
diff changeset
   801
    apply (auto split:split_if_asm)
0984a2c2868b added and renamed
nipkow
parents: 15245
diff changeset
   802
    using length_filter_le[of P xs] apply arith
0984a2c2868b added and renamed
nipkow
parents: 15245
diff changeset
   803
  done
0984a2c2868b added and renamed
nipkow
parents: 15245
diff changeset
   804
qed
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   805
15281
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   806
lemma length_filter_conv_card:
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   807
 "length(filter p xs) = card{i. i < length xs & p(xs!i)}"
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   808
proof (induct xs)
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   809
  case Nil thus ?case by simp
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   810
next
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   811
  case (Cons x xs)
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   812
  let ?S = "{i. i < length xs & p(xs!i)}"
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   813
  have fin: "finite ?S" by(fast intro: bounded_nat_set_is_finite)
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   814
  show ?case (is "?l = card ?S'")
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   815
  proof (cases)
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   816
    assume "p x"
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   817
    hence eq: "?S' = insert 0 (Suc ` ?S)"
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   818
      by(auto simp add: nth_Cons image_def split:nat.split elim:lessE)
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   819
    have "length (filter p (x # xs)) = Suc(card ?S)"
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   820
      using Cons by simp
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   821
    also have "\<dots> = Suc(card(Suc ` ?S))" using fin
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   822
      by (simp add: card_image inj_Suc)
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   823
    also have "\<dots> = card ?S'" using eq fin
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   824
      by (simp add:card_insert_if) (simp add:image_def)
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   825
    finally show ?thesis .
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   826
  next
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   827
    assume "\<not> p x"
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   828
    hence eq: "?S' = Suc ` ?S"
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   829
      by(auto simp add: nth_Cons image_def split:nat.split elim:lessE)
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   830
    have "length (filter p (x # xs)) = card ?S"
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   831
      using Cons by simp
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   832
    also have "\<dots> = card(Suc ` ?S)" using fin
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   833
      by (simp add: card_image inj_Suc)
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   834
    also have "\<dots> = card ?S'" using eq fin
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   835
      by (simp add:card_insert_if)
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   836
    finally show ?thesis .
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   837
  qed
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   838
qed
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   839
17629
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   840
lemma Cons_eq_filterD:
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   841
 "x#xs = filter P ys \<Longrightarrow>
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   842
  \<exists>us vs. ys = us @ x # vs \<and> (\<forall>u\<in>set us. \<not> P u) \<and> P x \<and> xs = filter P vs"
19585
70a1ce3b23ae removed 'concl is' patterns;
wenzelm
parents: 19487
diff changeset
   843
  (is "_ \<Longrightarrow> \<exists>us vs. ?P ys us vs")
17629
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   844
proof(induct ys)
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   845
  case Nil thus ?case by simp
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   846
next
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   847
  case (Cons y ys)
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   848
  show ?case (is "\<exists>x. ?Q x")
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   849
  proof cases
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   850
    assume Py: "P y"
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   851
    show ?thesis
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   852
    proof cases
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   853
      assume xy: "x = y"
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   854
      show ?thesis
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   855
      proof from Py xy Cons(2) show "?Q []" by simp qed
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   856
    next
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   857
      assume "x \<noteq> y" with Py Cons(2) show ?thesis by simp
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   858
    qed
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   859
  next
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   860
    assume Py: "\<not> P y"
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   861
    with Cons obtain us vs where 1 : "?P (y#ys) (y#us) vs" by fastsimp
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   862
    show ?thesis (is "? us. ?Q us")
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   863
    proof show "?Q (y#us)" using 1 by simp qed
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   864
  qed
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   865
qed
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   866
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   867
lemma filter_eq_ConsD:
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   868
 "filter P ys = x#xs \<Longrightarrow>
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   869
  \<exists>us vs. ys = us @ x # vs \<and> (\<forall>u\<in>set us. \<not> P u) \<and> P x \<and> xs = filter P vs"
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   870
by(rule Cons_eq_filterD) simp
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   871
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   872
lemma filter_eq_Cons_iff:
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   873
 "(filter P ys = x#xs) =
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   874
  (\<exists>us vs. ys = us @ x # vs \<and> (\<forall>u\<in>set us. \<not> P u) \<and> P x \<and> xs = filter P vs)"
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   875
by(auto dest:filter_eq_ConsD)
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   876
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   877
lemma Cons_eq_filter_iff:
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   878
 "(x#xs = filter P ys) =
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   879
  (\<exists>us vs. ys = us @ x # vs \<and> (\<forall>u\<in>set us. \<not> P u) \<and> P x \<and> xs = filter P vs)"
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   880
by(auto dest:Cons_eq_filterD)
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
   881
19770
be5c23ebe1eb HOL/Tools/function_package: Added support for mutual recursive definitions.
krauss
parents: 19623
diff changeset
   882
lemma filter_cong[fundef_cong, recdef_cong]:
17501
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
   883
 "xs = ys \<Longrightarrow> (\<And>x. x \<in> set ys \<Longrightarrow> P x = Q x) \<Longrightarrow> filter P xs = filter Q ys"
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
   884
apply simp
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
   885
apply(erule thin_rl)
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
   886
by (induct ys) simp_all
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
   887
15281
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   888
15392
290bc97038c7 First step in reorganizing Finite_Set
nipkow
parents: 15307
diff changeset
   889
subsubsection {* @{text concat} *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   890
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   891
lemma concat_append [simp]: "concat (xs @ ys) = concat xs @ concat ys"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   892
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   893
18447
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
   894
lemma concat_eq_Nil_conv [simp]: "(concat xss = []) = (\<forall>xs \<in> set xss. xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   895
by (induct xss) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   896
18447
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
   897
lemma Nil_eq_concat_conv [simp]: "([] = concat xss) = (\<forall>xs \<in> set xss. xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   898
by (induct xss) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   899
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   900
lemma set_concat [simp]: "set (concat xs) = \<Union>(set ` set xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   901
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   902
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   903
lemma map_concat: "map f (concat xs) = concat (map (map f) xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   904
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   905
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   906
lemma filter_concat: "filter p (concat xs) = concat (map (filter p) xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   907
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   908
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   909
lemma rev_concat: "rev (concat xs) = concat (map rev (rev xs))"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   910
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   911
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   912
15392
290bc97038c7 First step in reorganizing Finite_Set
nipkow
parents: 15307
diff changeset
   913
subsubsection {* @{text nth} *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   914
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   915
lemma nth_Cons_0 [simp]: "(x # xs)!0 = x"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   916
by auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   917
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   918
lemma nth_Cons_Suc [simp]: "(x # xs)!(Suc n) = xs!n"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   919
by auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   920
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   921
declare nth.simps [simp del]
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   922
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   923
lemma nth_append:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   924
"!!n. (xs @ ys)!n = (if n < length xs then xs!n else ys!(n - length xs))"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   925
apply (induct "xs", simp)
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   926
apply (case_tac n, auto)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   927
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   928
14402
4201e1916482 moved lemmas from MicroJava/Comp/AuxLemmas.thy to List.thy
nipkow
parents: 14395
diff changeset
   929
lemma nth_append_length [simp]: "(xs @ x # ys) ! length xs = x"
4201e1916482 moved lemmas from MicroJava/Comp/AuxLemmas.thy to List.thy
nipkow
parents: 14395
diff changeset
   930
by (induct "xs") auto
4201e1916482 moved lemmas from MicroJava/Comp/AuxLemmas.thy to List.thy
nipkow
parents: 14395
diff changeset
   931
4201e1916482 moved lemmas from MicroJava/Comp/AuxLemmas.thy to List.thy
nipkow
parents: 14395
diff changeset
   932
lemma nth_append_length_plus[simp]: "(xs @ ys) ! (length xs + n) = ys ! n"
4201e1916482 moved lemmas from MicroJava/Comp/AuxLemmas.thy to List.thy
nipkow
parents: 14395
diff changeset
   933
by (induct "xs") auto
4201e1916482 moved lemmas from MicroJava/Comp/AuxLemmas.thy to List.thy
nipkow
parents: 14395
diff changeset
   934
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   935
lemma nth_map [simp]: "!!n. n < length xs ==> (map f xs)!n = f(xs!n)"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   936
apply (induct xs, simp)
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   937
apply (case_tac n, auto)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   938
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   939
18423
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
   940
lemma hd_conv_nth: "xs \<noteq> [] \<Longrightarrow> hd xs = xs!0"
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
   941
by(cases xs) simp_all
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
   942
18049
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   943
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   944
lemma list_eq_iff_nth_eq:
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   945
 "!!ys. (xs = ys) = (length xs = length ys \<and> (ALL i<length xs. xs!i = ys!i))"
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   946
apply(induct xs)
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   947
 apply simp apply blast
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   948
apply(case_tac ys)
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   949
 apply simp
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   950
apply(simp add:nth_Cons split:nat.split)apply blast
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   951
done
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
   952
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   953
lemma set_conv_nth: "set xs = {xs!i | i. i < length xs}"
15251
bb6f072c8d10 converted some induct_tac to induct
paulson
parents: 15246
diff changeset
   954
apply (induct xs, simp, simp)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   955
apply safe
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   956
apply (rule_tac x = 0 in exI, simp)
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   957
 apply (rule_tac x = "Suc i" in exI, simp)
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   958
apply (case_tac i, simp)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   959
apply (rename_tac j)
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   960
apply (rule_tac x = j in exI, simp)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   961
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   962
17501
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
   963
lemma in_set_conv_nth: "(x \<in> set xs) = (\<exists>i < length xs. xs!i = x)"
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
   964
by(auto simp:set_conv_nth)
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
   965
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   966
lemma list_ball_nth: "[| n < length xs; !x : set xs. P x|] ==> P(xs!n)"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   967
by (auto simp add: set_conv_nth)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   968
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   969
lemma nth_mem [simp]: "n < length xs ==> xs!n : set xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   970
by (auto simp add: set_conv_nth)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   971
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   972
lemma all_nth_imp_all_set:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   973
"[| !i < length xs. P(xs!i); x : set xs|] ==> P x"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   974
by (auto simp add: set_conv_nth)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   975
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   976
lemma all_set_conv_all_nth:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   977
"(\<forall>x \<in> set xs. P x) = (\<forall>i. i < length xs --> P (xs ! i))"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   978
by (auto simp add: set_conv_nth)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   979
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   980
15392
290bc97038c7 First step in reorganizing Finite_Set
nipkow
parents: 15307
diff changeset
   981
subsubsection {* @{text list_update} *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   982
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   983
lemma length_list_update [simp]: "!!i. length(xs[i:=x]) = length xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   984
by (induct xs) (auto split: nat.split)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   985
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   986
lemma nth_list_update:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   987
"!!i j. i < length xs==> (xs[i:=x])!j = (if i = j then x else xs!j)"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   988
by (induct xs) (auto simp add: nth_Cons split: nat.split)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   989
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   990
lemma nth_list_update_eq [simp]: "i < length xs ==> (xs[i:=x])!i = x"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   991
by (simp add: nth_list_update)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   992
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   993
lemma nth_list_update_neq [simp]: "!!i j. i \<noteq> j ==> xs[i:=x]!j = xs!j"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   994
by (induct xs) (auto simp add: nth_Cons split: nat.split)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   995
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   996
lemma list_update_overwrite [simp]:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   997
"!!i. i < size xs ==> xs[i:=x, i:=y] = xs[i:=y]"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   998
by (induct xs) (auto split: nat.split)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   999
14402
4201e1916482 moved lemmas from MicroJava/Comp/AuxLemmas.thy to List.thy
nipkow
parents: 14395
diff changeset
  1000
lemma list_update_id[simp]: "!!i. i < length xs ==> xs[i := xs!i] = xs"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1001
apply (induct xs, simp)
14187
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1002
apply(simp split:nat.splits)
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1003
done
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1004
17501
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1005
lemma list_update_beyond[simp]: "\<And>i. length xs \<le> i \<Longrightarrow> xs[i:=x] = xs"
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1006
apply (induct xs)
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1007
 apply simp
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1008
apply (case_tac i)
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1009
apply simp_all
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1010
done
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1011
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1012
lemma list_update_same_conv:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1013
"!!i. i < length xs ==> (xs[i := x] = xs) = (xs!i = x)"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1014
by (induct xs) (auto split: nat.split)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1015
14187
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1016
lemma list_update_append1:
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1017
 "!!i. i < size xs \<Longrightarrow> (xs @ ys)[i:=x] = xs[i:=x] @ ys"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1018
apply (induct xs, simp)
14187
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1019
apply(simp split:nat.split)
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1020
done
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1021
15868
9634b3f9d910 more about list_update
kleing
parents: 15693
diff changeset
  1022
lemma list_update_append:
9634b3f9d910 more about list_update
kleing
parents: 15693
diff changeset
  1023
  "!!n. (xs @ ys) [n:= x] = 
9634b3f9d910 more about list_update
kleing
parents: 15693
diff changeset
  1024
  (if n < length xs then xs[n:= x] @ ys else xs @ (ys [n-length xs:= x]))"
9634b3f9d910 more about list_update
kleing
parents: 15693
diff changeset
  1025
by (induct xs) (auto split:nat.splits)
9634b3f9d910 more about list_update
kleing
parents: 15693
diff changeset
  1026
14402
4201e1916482 moved lemmas from MicroJava/Comp/AuxLemmas.thy to List.thy
nipkow
parents: 14395
diff changeset
  1027
lemma list_update_length [simp]:
4201e1916482 moved lemmas from MicroJava/Comp/AuxLemmas.thy to List.thy
nipkow
parents: 14395
diff changeset
  1028
 "(xs @ x # ys)[length xs := y] = (xs @ y # ys)"
4201e1916482 moved lemmas from MicroJava/Comp/AuxLemmas.thy to List.thy
nipkow
parents: 14395
diff changeset
  1029
by (induct xs, auto)
4201e1916482 moved lemmas from MicroJava/Comp/AuxLemmas.thy to List.thy
nipkow
parents: 14395
diff changeset
  1030
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1031
lemma update_zip:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1032
"!!i xy xs. length xs = length ys ==>
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1033
(zip xs ys)[i:=xy] = zip (xs[i:=fst xy]) (ys[i:=snd xy])"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1034
by (induct ys) (auto, case_tac xs, auto split: nat.split)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1035
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1036
lemma set_update_subset_insert: "!!i. set(xs[i:=x]) <= insert x (set xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1037
by (induct xs) (auto split: nat.split)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1038
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1039
lemma set_update_subsetI: "[| set xs <= A; x:A |] ==> set(xs[i := x]) <= A"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1040
by (blast dest!: set_update_subset_insert [THEN subsetD])
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1041
15868
9634b3f9d910 more about list_update
kleing
parents: 15693
diff changeset
  1042
lemma set_update_memI: "!!n. n < length xs \<Longrightarrow> x \<in> set (xs[n := x])"
9634b3f9d910 more about list_update
kleing
parents: 15693
diff changeset
  1043
by (induct xs) (auto split:nat.splits)
9634b3f9d910 more about list_update
kleing
parents: 15693
diff changeset
  1044
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1045
15392
290bc97038c7 First step in reorganizing Finite_Set
nipkow
parents: 15307
diff changeset
  1046
subsubsection {* @{text last} and @{text butlast} *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1047
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1048
lemma last_snoc [simp]: "last (xs @ [x]) = x"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1049
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1050
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1051
lemma butlast_snoc [simp]: "butlast (xs @ [x]) = xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1052
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1053
14302
6c24235e8d5d *** empty log message ***
nipkow
parents: 14300
diff changeset
  1054
lemma last_ConsL: "xs = [] \<Longrightarrow> last(x#xs) = x"
6c24235e8d5d *** empty log message ***
nipkow
parents: 14300
diff changeset
  1055
by(simp add:last.simps)
6c24235e8d5d *** empty log message ***
nipkow
parents: 14300
diff changeset
  1056
6c24235e8d5d *** empty log message ***
nipkow
parents: 14300
diff changeset
  1057
lemma last_ConsR: "xs \<noteq> [] \<Longrightarrow> last(x#xs) = last xs"
6c24235e8d5d *** empty log message ***
nipkow
parents: 14300
diff changeset
  1058
by(simp add:last.simps)
6c24235e8d5d *** empty log message ***
nipkow
parents: 14300
diff changeset
  1059
6c24235e8d5d *** empty log message ***
nipkow
parents: 14300
diff changeset
  1060
lemma last_append: "last(xs @ ys) = (if ys = [] then last xs else last ys)"
6c24235e8d5d *** empty log message ***
nipkow
parents: 14300
diff changeset
  1061
by (induct xs) (auto)
6c24235e8d5d *** empty log message ***
nipkow
parents: 14300
diff changeset
  1062
6c24235e8d5d *** empty log message ***
nipkow
parents: 14300
diff changeset
  1063
lemma last_appendL[simp]: "ys = [] \<Longrightarrow> last(xs @ ys) = last xs"
6c24235e8d5d *** empty log message ***
nipkow
parents: 14300
diff changeset
  1064
by(simp add:last_append)
6c24235e8d5d *** empty log message ***
nipkow
parents: 14300
diff changeset
  1065
6c24235e8d5d *** empty log message ***
nipkow
parents: 14300
diff changeset
  1066
lemma last_appendR[simp]: "ys \<noteq> [] \<Longrightarrow> last(xs @ ys) = last ys"
6c24235e8d5d *** empty log message ***
nipkow
parents: 14300
diff changeset
  1067
by(simp add:last_append)
6c24235e8d5d *** empty log message ***
nipkow
parents: 14300
diff changeset
  1068
17762
478869f444ca new hd/rev/last lemmas
nipkow
parents: 17724
diff changeset
  1069
lemma hd_rev: "xs \<noteq> [] \<Longrightarrow> hd(rev xs) = last xs"
478869f444ca new hd/rev/last lemmas
nipkow
parents: 17724
diff changeset
  1070
by(rule rev_exhaust[of xs]) simp_all
478869f444ca new hd/rev/last lemmas
nipkow
parents: 17724
diff changeset
  1071
478869f444ca new hd/rev/last lemmas
nipkow
parents: 17724
diff changeset
  1072
lemma last_rev: "xs \<noteq> [] \<Longrightarrow> last(rev xs) = hd xs"
478869f444ca new hd/rev/last lemmas
nipkow
parents: 17724
diff changeset
  1073
by(cases xs) simp_all
478869f444ca new hd/rev/last lemmas
nipkow
parents: 17724
diff changeset
  1074
17765
e3cd31bc2e40 added last in set lemma
nipkow
parents: 17762
diff changeset
  1075
lemma last_in_set[simp]: "as \<noteq> [] \<Longrightarrow> last as \<in> set as"
e3cd31bc2e40 added last in set lemma
nipkow
parents: 17762
diff changeset
  1076
by (induct as) auto
17762
478869f444ca new hd/rev/last lemmas
nipkow
parents: 17724
diff changeset
  1077
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1078
lemma length_butlast [simp]: "length (butlast xs) = length xs - 1"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1079
by (induct xs rule: rev_induct) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1080
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1081
lemma butlast_append:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1082
"!!ys. butlast (xs @ ys) = (if ys = [] then butlast xs else xs @ butlast ys)"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1083
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1084
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1085
lemma append_butlast_last_id [simp]:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1086
"xs \<noteq> [] ==> butlast xs @ [last xs] = xs"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1087
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1088
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1089
lemma in_set_butlastD: "x : set (butlast xs) ==> x : set xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1090
by (induct xs) (auto split: split_if_asm)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1091
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1092
lemma in_set_butlast_appendI:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1093
"x : set (butlast xs) | x : set (butlast ys) ==> x : set (butlast (xs @ ys))"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1094
by (auto dest: in_set_butlastD simp add: butlast_append)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1095
17501
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1096
lemma last_drop[simp]: "!!n. n < length xs \<Longrightarrow> last (drop n xs) = last xs"
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1097
apply (induct xs)
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1098
 apply simp
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1099
apply (auto split:nat.split)
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1100
done
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1101
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17501
diff changeset
  1102
lemma last_conv_nth: "xs\<noteq>[] \<Longrightarrow> last xs = xs!(length xs - 1)"
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17501
diff changeset
  1103
by(induct xs)(auto simp:neq_Nil_conv)
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17501
diff changeset
  1104
15392
290bc97038c7 First step in reorganizing Finite_Set
nipkow
parents: 15307
diff changeset
  1105
subsubsection {* @{text take} and @{text drop} *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1106
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1107
lemma take_0 [simp]: "take 0 xs = []"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1108
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1109
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1110
lemma drop_0 [simp]: "drop 0 xs = xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1111
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1112
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1113
lemma take_Suc_Cons [simp]: "take (Suc n) (x # xs) = x # take n xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1114
by simp
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1115
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1116
lemma drop_Suc_Cons [simp]: "drop (Suc n) (x # xs) = drop n xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1117
by simp
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1118
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1119
declare take_Cons [simp del] and drop_Cons [simp del]
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1120
15110
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1121
lemma take_Suc: "xs ~= [] ==> take (Suc n) xs = hd xs # take n (tl xs)"
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1122
by(clarsimp simp add:neq_Nil_conv)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1123
14187
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1124
lemma drop_Suc: "drop (Suc n) xs = drop n (tl xs)"
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1125
by(cases xs, simp_all)
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1126
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1127
lemma drop_tl: "!!n. drop n (tl xs) = tl(drop n xs)"
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1128
by(induct xs, simp_all add:drop_Cons drop_Suc split:nat.split)
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1129
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1130
lemma nth_via_drop: "!!n. drop n xs = y#ys \<Longrightarrow> xs!n = y"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1131
apply (induct xs, simp)
14187
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1132
apply(simp add:drop_Cons nth_Cons split:nat.splits)
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1133
done
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1134
13913
b3ed67af04b8 Added take/dropWhile thms
nipkow
parents: 13883
diff changeset
  1135
lemma take_Suc_conv_app_nth:
b3ed67af04b8 Added take/dropWhile thms
nipkow
parents: 13883
diff changeset
  1136
 "!!i. i < length xs \<Longrightarrow> take (Suc i) xs = take i xs @ [xs!i]"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1137
apply (induct xs, simp)
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1138
apply (case_tac i, auto)
13913
b3ed67af04b8 Added take/dropWhile thms
nipkow
parents: 13883
diff changeset
  1139
done
b3ed67af04b8 Added take/dropWhile thms
nipkow
parents: 13883
diff changeset
  1140
14591
7be4d5dadf15 lemma drop_Suc_conv_tl added.
mehta
parents: 14589
diff changeset
  1141
lemma drop_Suc_conv_tl:
7be4d5dadf15 lemma drop_Suc_conv_tl added.
mehta
parents: 14589
diff changeset
  1142
  "!!i. i < length xs \<Longrightarrow> (xs!i) # (drop (Suc i) xs) = drop i xs"
7be4d5dadf15 lemma drop_Suc_conv_tl added.
mehta
parents: 14589
diff changeset
  1143
apply (induct xs, simp)
7be4d5dadf15 lemma drop_Suc_conv_tl added.
mehta
parents: 14589
diff changeset
  1144
apply (case_tac i, auto)
7be4d5dadf15 lemma drop_Suc_conv_tl added.
mehta
parents: 14589
diff changeset
  1145
done
7be4d5dadf15 lemma drop_Suc_conv_tl added.
mehta
parents: 14589
diff changeset
  1146
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1147
lemma length_take [simp]: "!!xs. length (take n xs) = min (length xs) n"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1148
by (induct n) (auto, case_tac xs, auto)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1149
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1150
lemma length_drop [simp]: "!!xs. length (drop n xs) = (length xs - n)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1151
by (induct n) (auto, case_tac xs, auto)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1152
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1153
lemma take_all [simp]: "!!xs. length xs <= n ==> take n xs = xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1154
by (induct n) (auto, case_tac xs, auto)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1155
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1156
lemma drop_all [simp]: "!!xs. length xs <= n ==> drop n xs = []"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1157
by (induct n) (auto, case_tac xs, auto)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1158
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1159
lemma take_append [simp]:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1160
"!!xs. take n (xs @ ys) = (take n xs @ take (n - length xs) ys)"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1161
by (induct n) (auto, case_tac xs, auto)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1162
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1163
lemma drop_append [simp]:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1164
"!!xs. drop n (xs @ ys) = drop n xs @ drop (n - length xs) ys"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1165
by (induct n) (auto, case_tac xs, auto)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1166
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1167
lemma take_take [simp]: "!!xs n. take n (take m xs) = take (min n m) xs"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1168
apply (induct m, auto)
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1169
apply (case_tac xs, auto)
15236
f289e8ba2bb3 Proofs needed to be updated because induction now preserves name of
nipkow
parents: 15176
diff changeset
  1170
apply (case_tac n, auto)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1171
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1172
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1173
lemma drop_drop [simp]: "!!xs. drop n (drop m xs) = drop (n + m) xs"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1174
apply (induct m, auto)
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1175
apply (case_tac xs, auto)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1176
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1177
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1178
lemma take_drop: "!!xs n. take n (drop m xs) = drop m (take (n + m) xs)"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1179
apply (induct m, auto)
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1180
apply (case_tac xs, auto)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1181
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1182
14802
e05116289ff9 added drop_take:thm
nipkow
parents: 14770
diff changeset
  1183
lemma drop_take: "!!m n. drop n (take m xs) = take (m-n) (drop n xs)"
e05116289ff9 added drop_take:thm
nipkow
parents: 14770
diff changeset
  1184
apply(induct xs)
e05116289ff9 added drop_take:thm
nipkow
parents: 14770
diff changeset
  1185
 apply simp
e05116289ff9 added drop_take:thm
nipkow
parents: 14770
diff changeset
  1186
apply(simp add: take_Cons drop_Cons split:nat.split)
e05116289ff9 added drop_take:thm
nipkow
parents: 14770
diff changeset
  1187
done
e05116289ff9 added drop_take:thm
nipkow
parents: 14770
diff changeset
  1188
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1189
lemma append_take_drop_id [simp]: "!!xs. take n xs @ drop n xs = xs"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1190
apply (induct n, auto)
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1191
apply (case_tac xs, auto)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1192
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1193
15110
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1194
lemma take_eq_Nil[simp]: "!!n. (take n xs = []) = (n = 0 \<or> xs = [])"
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1195
apply(induct xs)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1196
 apply simp
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1197
apply(simp add:take_Cons split:nat.split)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1198
done
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1199
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1200
lemma drop_eq_Nil[simp]: "!!n. (drop n xs = []) = (length xs <= n)"
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1201
apply(induct xs)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1202
apply simp
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1203
apply(simp add:drop_Cons split:nat.split)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1204
done
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1205
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1206
lemma take_map: "!!xs. take n (map f xs) = map f (take n xs)"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1207
apply (induct n, auto)
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1208
apply (case_tac xs, auto)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1209
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1210
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1211
lemma drop_map: "!!xs. drop n (map f xs) = map f (drop n xs)"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1212
apply (induct n, auto)
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1213
apply (case_tac xs, auto)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1214
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1215
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1216
lemma rev_take: "!!i. rev (take i xs) = drop (length xs - i) (rev xs)"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1217
apply (induct xs, auto)
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1218
apply (case_tac i, auto)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1219
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1220
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1221
lemma rev_drop: "!!i. rev (drop i xs) = take (length xs - i) (rev xs)"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1222
apply (induct xs, auto)
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1223
apply (case_tac i, auto)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1224
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1225
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1226
lemma nth_take [simp]: "!!n i. i < n ==> (take n xs)!i = xs!i"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1227
apply (induct xs, auto)
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1228
apply (case_tac n, blast)
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1229
apply (case_tac i, auto)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1230
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1231
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1232
lemma nth_drop [simp]:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1233
"!!xs i. n + i <= length xs ==> (drop n xs)!i = xs!(n + i)"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1234
apply (induct n, auto)
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1235
apply (case_tac xs, auto)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1236
done
3507
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
  1237
18423
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
  1238
lemma hd_drop_conv_nth: "\<lbrakk> xs \<noteq> []; n < length xs \<rbrakk> \<Longrightarrow> hd(drop n xs) = xs!n"
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
  1239
by(simp add: hd_conv_nth)
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
  1240
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
  1241
lemma set_take_subset: "\<And>n. set(take n xs) \<subseteq> set xs"
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
  1242
by(induct xs)(auto simp:take_Cons split:nat.split)
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
  1243
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
  1244
lemma set_drop_subset: "\<And>n. set(drop n xs) \<subseteq> set xs"
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
  1245
by(induct xs)(auto simp:drop_Cons split:nat.split)
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
  1246
14187
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1247
lemma in_set_takeD: "x : set(take n xs) \<Longrightarrow> x : set xs"
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1248
using set_take_subset by fast
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1249
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1250
lemma in_set_dropD: "x : set(drop n xs) \<Longrightarrow> x : set xs"
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1251
using set_drop_subset by fast
26dfcd0ac436 Added new theorems
nipkow
parents: 14111
diff changeset
  1252
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1253
lemma append_eq_conv_conj:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1254
"!!zs. (xs @ ys = zs) = (xs = take (length xs) zs \<and> ys = drop (length xs) zs)"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1255
apply (induct xs, simp, clarsimp)
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1256
apply (case_tac zs, auto)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1257
done
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1258
14050
826037db30cd new theorem
paulson
parents: 14025
diff changeset
  1259
lemma take_add [rule_format]: 
826037db30cd new theorem
paulson
parents: 14025
diff changeset
  1260
    "\<forall>i. i+j \<le> length(xs) --> take (i+j) xs = take i xs @ take j (drop i xs)"
826037db30cd new theorem
paulson
parents: 14025
diff changeset
  1261
apply (induct xs, auto) 
826037db30cd new theorem
paulson
parents: 14025
diff changeset
  1262
apply (case_tac i, simp_all) 
826037db30cd new theorem
paulson
parents: 14025
diff changeset
  1263
done
826037db30cd new theorem
paulson
parents: 14025
diff changeset
  1264
14300
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
  1265
lemma append_eq_append_conv_if:
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
  1266
 "!! ys\<^isub>1. (xs\<^isub>1 @ xs\<^isub>2 = ys\<^isub>1 @ ys\<^isub>2) =
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
  1267
  (if size xs\<^isub>1 \<le> size ys\<^isub>1
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
  1268
   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
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
  1269
   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)"
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
  1270
apply(induct xs\<^isub>1)
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
  1271
 apply simp
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
  1272
apply(case_tac ys\<^isub>1)
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
  1273
apply simp_all
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
  1274
done
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
  1275
15110
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1276
lemma take_hd_drop:
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1277
  "!!n. n < length xs \<Longrightarrow> take n xs @ [hd (drop n xs)] = take (n+1) xs"
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1278
apply(induct xs)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1279
apply simp
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1280
apply(simp add:drop_Cons split:nat.split)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1281
done
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1282
17501
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1283
lemma id_take_nth_drop:
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1284
 "i < length xs \<Longrightarrow> xs = take i xs @ xs!i # drop (Suc i) xs" 
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1285
proof -
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1286
  assume si: "i < length xs"
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1287
  hence "xs = take (Suc i) xs @ drop (Suc i) xs" by auto
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1288
  moreover
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1289
  from si have "take (Suc i) xs = take i xs @ [xs!i]"
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1290
    apply (rule_tac take_Suc_conv_app_nth) by arith
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1291
  ultimately show ?thesis by auto
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1292
qed
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1293
  
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1294
lemma upd_conv_take_nth_drop:
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1295
 "i < length xs \<Longrightarrow> xs[i:=a] = take i xs @ a # drop (Suc i) xs"
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1296
proof -
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1297
  assume i: "i < length xs"
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1298
  have "xs[i:=a] = (take i xs @ xs!i # drop (Suc i) xs)[i:=a]"
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1299
    by(rule arg_cong[OF id_take_nth_drop[OF i]])
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1300
  also have "\<dots> = take i xs @ a # drop (Suc i) xs"
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1301
    using i by (simp add: list_update_append)
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1302
  finally show ?thesis .
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1303
qed
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1304
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1305
15392
290bc97038c7 First step in reorganizing Finite_Set
nipkow
parents: 15307
diff changeset
  1306
subsubsection {* @{text takeWhile} and @{text dropWhile} *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1307
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1308
lemma takeWhile_dropWhile_id [simp]: "takeWhile P xs @ dropWhile P xs = xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1309
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1310
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1311
lemma takeWhile_append1 [simp]:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1312
"[| x:set xs; ~P(x)|] ==> takeWhile P (xs @ ys) = takeWhile P xs"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1313
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1314
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1315
lemma takeWhile_append2 [simp]:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1316
"(!!x. x : set xs ==> P x) ==> takeWhile P (xs @ ys) = xs @ takeWhile P ys"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1317
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1318
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1319
lemma takeWhile_tail: "\<not> P x ==> takeWhile P (xs @ (x#l)) = takeWhile P xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1320
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1321
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1322
lemma dropWhile_append1 [simp]:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1323
"[| x : set xs; ~P(x)|] ==> dropWhile P (xs @ ys) = (dropWhile P xs)@ys"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1324
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1325
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1326
lemma dropWhile_append2 [simp]:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1327
"(!!x. x:set xs ==> P(x)) ==> dropWhile P (xs @ ys) = dropWhile P ys"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1328
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1329
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1330
lemma set_take_whileD: "x : set (takeWhile P xs) ==> x : set xs \<and> P x"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1331
by (induct xs) (auto split: split_if_asm)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1332
13913
b3ed67af04b8 Added take/dropWhile thms
nipkow
parents: 13883
diff changeset
  1333
lemma takeWhile_eq_all_conv[simp]:
b3ed67af04b8 Added take/dropWhile thms
nipkow
parents: 13883
diff changeset
  1334
 "(takeWhile P xs = xs) = (\<forall>x \<in> set xs. P x)"
b3ed67af04b8 Added take/dropWhile thms
nipkow
parents: 13883
diff changeset
  1335
by(induct xs, auto)
b3ed67af04b8 Added take/dropWhile thms
nipkow
parents: 13883
diff changeset
  1336
b3ed67af04b8 Added take/dropWhile thms
nipkow
parents: 13883
diff changeset
  1337
lemma dropWhile_eq_Nil_conv[simp]:
b3ed67af04b8 Added take/dropWhile thms
nipkow
parents: 13883
diff changeset
  1338
 "(dropWhile P xs = []) = (\<forall>x \<in> set xs. P x)"
b3ed67af04b8 Added take/dropWhile thms
nipkow
parents: 13883
diff changeset
  1339
by(induct xs, auto)
b3ed67af04b8 Added take/dropWhile thms
nipkow
parents: 13883
diff changeset
  1340
b3ed67af04b8 Added take/dropWhile thms
nipkow
parents: 13883
diff changeset
  1341
lemma dropWhile_eq_Cons_conv:
b3ed67af04b8 Added take/dropWhile thms
nipkow
parents: 13883
diff changeset
  1342
 "(dropWhile P xs = y#ys) = (xs = takeWhile P xs @ y # ys & \<not> P y)"
b3ed67af04b8 Added take/dropWhile thms
nipkow
parents: 13883
diff changeset
  1343
by(induct xs, auto)
b3ed67af04b8 Added take/dropWhile thms
nipkow
parents: 13883
diff changeset
  1344
17501
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1345
text{* The following two lemmmas could be generalized to an arbitrary
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1346
property. *}
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1347
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1348
lemma takeWhile_neq_rev: "\<lbrakk>distinct xs; x \<in> set xs\<rbrakk> \<Longrightarrow>
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1349
 takeWhile (\<lambda>y. y \<noteq> x) (rev xs) = rev (tl (dropWhile (\<lambda>y. y \<noteq> x) xs))"
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1350
by(induct xs) (auto simp: takeWhile_tail[where l="[]"])
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1351
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1352
lemma dropWhile_neq_rev: "\<lbrakk>distinct xs; x \<in> set xs\<rbrakk> \<Longrightarrow>
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1353
  dropWhile (\<lambda>y. y \<noteq> x) (rev xs) = x # rev (takeWhile (\<lambda>y. y \<noteq> x) xs)"
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1354
apply(induct xs)
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1355
 apply simp
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1356
apply auto
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1357
apply(subst dropWhile_append2)