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