src/HOL/List.thy
author Andreas Lochbihler
Wed, 10 Oct 2012 15:16:44 +0200
changeset 49808 418991ce7567
parent 49757 73ab6d4a9236
child 49948 744934b818c7
child 49962 a8cc904a6820
permissions -rw-r--r--
tail-recursive implementation for length
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
    Author:     Tobias Nipkow
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     3
*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     4
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
     5
header {* The datatype of finite lists *}
13122
wenzelm
parents: 13114
diff changeset
     6
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15113
diff changeset
     7
theory List
44013
5cfc1c36ae97 moved recdef package to HOL/Library/Old_Recdef.thy
krauss
parents: 43594
diff changeset
     8
imports Plain Presburger Code_Numeral Quotient ATP
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15113
diff changeset
     9
begin
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    10
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
    11
datatype 'a list =
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    12
    Nil    ("[]")
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
    13
  | Cons 'a  "'a list"    (infixr "#" 65)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    14
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    15
syntax
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    16
  -- {* list Enumeration *}
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35028
diff changeset
    17
  "_list" :: "args => 'a list"    ("[(_)]")
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    18
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    19
translations
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    20
  "[x, xs]" == "x#[xs]"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    21
  "[x]" == "x#[]"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    22
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35028
diff changeset
    23
446c5063e4fd modernized translations;
wenzelm
parents: 35028
diff changeset
    24
subsection {* Basic list processing functions *}
15302
a643fcbc3468 Restructured List and added "rotate"
nipkow
parents: 15281
diff changeset
    25
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    26
primrec
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    27
  hd :: "'a list \<Rightarrow> 'a" where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    28
  "hd (x # xs) = x"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    29
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    30
primrec
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    31
  tl :: "'a list \<Rightarrow> 'a list" where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    32
    "tl [] = []"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    33
  | "tl (x # xs) = xs"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    34
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    35
primrec
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    36
  last :: "'a list \<Rightarrow> 'a" where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    37
  "last (x # xs) = (if xs = [] then x else last xs)"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    38
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    39
primrec
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    40
  butlast :: "'a list \<Rightarrow> 'a list" where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    41
    "butlast []= []"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    42
  | "butlast (x # xs) = (if xs = [] then [] else x # butlast xs)"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    43
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    44
primrec
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    45
  set :: "'a list \<Rightarrow> 'a set" where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    46
    "set [] = {}"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    47
  | "set (x # xs) = insert x (set xs)"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    48
46133
d9fe85d3d2cd incorporated canonical fold combinator on lists into body of List theory; refactored passages on List.fold(l/r)
haftmann
parents: 46125
diff changeset
    49
definition
d9fe85d3d2cd incorporated canonical fold combinator on lists into body of List theory; refactored passages on List.fold(l/r)
haftmann
parents: 46125
diff changeset
    50
  coset :: "'a list \<Rightarrow> 'a set" where
d9fe85d3d2cd incorporated canonical fold combinator on lists into body of List theory; refactored passages on List.fold(l/r)
haftmann
parents: 46125
diff changeset
    51
  [simp]: "coset xs = - set xs"
d9fe85d3d2cd incorporated canonical fold combinator on lists into body of List theory; refactored passages on List.fold(l/r)
haftmann
parents: 46125
diff changeset
    52
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    53
primrec
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    54
  map :: "('a \<Rightarrow> 'b) \<Rightarrow> 'a list \<Rightarrow> 'b list" where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    55
    "map f [] = []"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    56
  | "map f (x # xs) = f x # map f xs"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    57
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    58
primrec
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    59
  append :: "'a list \<Rightarrow> 'a list \<Rightarrow> 'a list" (infixr "@" 65) where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    60
    append_Nil:"[] @ ys = ys"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    61
  | append_Cons: "(x#xs) @ ys = x # xs @ ys"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    62
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    63
primrec
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    64
  rev :: "'a list \<Rightarrow> 'a list" where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    65
    "rev [] = []"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    66
  | "rev (x # xs) = rev xs @ [x]"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    67
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    68
primrec
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    69
  filter:: "('a \<Rightarrow> bool) \<Rightarrow> 'a list \<Rightarrow> 'a list" where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    70
    "filter P [] = []"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    71
  | "filter P (x # xs) = (if P x then x # filter P xs else filter P xs)"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    72
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    73
syntax
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    74
  -- {* Special syntax for filter *}
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35028
diff changeset
    75
  "_filter" :: "[pttrn, 'a list, bool] => 'a list"    ("(1[_<-_./ _])")
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    76
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    77
translations
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    78
  "[x<-xs . P]"== "CONST filter (%x. P) xs"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    79
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    80
syntax (xsymbols)
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35028
diff changeset
    81
  "_filter" :: "[pttrn, 'a list, bool] => 'a list"("(1[_\<leftarrow>_ ./ _])")
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    82
syntax (HTML output)
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35028
diff changeset
    83
  "_filter" :: "[pttrn, 'a list, bool] => 'a list"("(1[_\<leftarrow>_ ./ _])")
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    84
47397
d654c73e4b12 no preference wrt. fold(l/r); prefer fold rather than foldr for iterating over lists in generated code
haftmann
parents: 47131
diff changeset
    85
primrec fold :: "('a \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'a list \<Rightarrow> 'b \<Rightarrow> 'b"
d654c73e4b12 no preference wrt. fold(l/r); prefer fold rather than foldr for iterating over lists in generated code
haftmann
parents: 47131
diff changeset
    86
where
d654c73e4b12 no preference wrt. fold(l/r); prefer fold rather than foldr for iterating over lists in generated code
haftmann
parents: 47131
diff changeset
    87
  fold_Nil:  "fold f [] = id"
d654c73e4b12 no preference wrt. fold(l/r); prefer fold rather than foldr for iterating over lists in generated code
haftmann
parents: 47131
diff changeset
    88
| fold_Cons: "fold f (x # xs) = fold f xs \<circ> f x" -- {* natural argument order *}
d654c73e4b12 no preference wrt. fold(l/r); prefer fold rather than foldr for iterating over lists in generated code
haftmann
parents: 47131
diff changeset
    89
d654c73e4b12 no preference wrt. fold(l/r); prefer fold rather than foldr for iterating over lists in generated code
haftmann
parents: 47131
diff changeset
    90
primrec foldr :: "('a \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'a list \<Rightarrow> 'b \<Rightarrow> 'b"
d654c73e4b12 no preference wrt. fold(l/r); prefer fold rather than foldr for iterating over lists in generated code
haftmann
parents: 47131
diff changeset
    91
where
d654c73e4b12 no preference wrt. fold(l/r); prefer fold rather than foldr for iterating over lists in generated code
haftmann
parents: 47131
diff changeset
    92
  foldr_Nil:  "foldr f [] = id"
d654c73e4b12 no preference wrt. fold(l/r); prefer fold rather than foldr for iterating over lists in generated code
haftmann
parents: 47131
diff changeset
    93
| foldr_Cons: "foldr f (x # xs) = f x \<circ> foldr f xs" -- {* natural argument order *}
d654c73e4b12 no preference wrt. fold(l/r); prefer fold rather than foldr for iterating over lists in generated code
haftmann
parents: 47131
diff changeset
    94
d654c73e4b12 no preference wrt. fold(l/r); prefer fold rather than foldr for iterating over lists in generated code
haftmann
parents: 47131
diff changeset
    95
primrec foldl :: "('b \<Rightarrow> 'a \<Rightarrow> 'b) \<Rightarrow> 'b \<Rightarrow> 'a list \<Rightarrow> 'b"
d654c73e4b12 no preference wrt. fold(l/r); prefer fold rather than foldr for iterating over lists in generated code
haftmann
parents: 47131
diff changeset
    96
where
d654c73e4b12 no preference wrt. fold(l/r); prefer fold rather than foldr for iterating over lists in generated code
haftmann
parents: 47131
diff changeset
    97
  foldl_Nil:  "foldl f a [] = a"
d654c73e4b12 no preference wrt. fold(l/r); prefer fold rather than foldr for iterating over lists in generated code
haftmann
parents: 47131
diff changeset
    98
| foldl_Cons: "foldl f a (x # xs) = foldl f (f a x) xs"
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    99
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   100
primrec
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   101
  concat:: "'a list list \<Rightarrow> 'a list" where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   102
    "concat [] = []"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   103
  | "concat (x # xs) = x @ concat xs"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   104
39774
30cf9d80939e localized listsum
haftmann
parents: 39728
diff changeset
   105
definition (in monoid_add)
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   106
  listsum :: "'a list \<Rightarrow> 'a" where
39774
30cf9d80939e localized listsum
haftmann
parents: 39728
diff changeset
   107
  "listsum xs = foldr plus xs 0"
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   108
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   109
primrec
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   110
  drop:: "nat \<Rightarrow> 'a list \<Rightarrow> 'a list" where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   111
    drop_Nil: "drop n [] = []"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   112
  | drop_Cons: "drop n (x # xs) = (case n of 0 \<Rightarrow> x # xs | Suc m \<Rightarrow> drop m xs)"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   113
  -- {*Warning: simpset does not contain this definition, but separate
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   114
       theorems for @{text "n = 0"} and @{text "n = Suc k"} *}
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   115
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   116
primrec
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   117
  take:: "nat \<Rightarrow> 'a list \<Rightarrow> 'a list" where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   118
    take_Nil:"take n [] = []"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   119
  | take_Cons: "take n (x # xs) = (case n of 0 \<Rightarrow> [] | Suc m \<Rightarrow> x # take m xs)"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   120
  -- {*Warning: simpset does not contain this definition, but separate
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   121
       theorems for @{text "n = 0"} and @{text "n = Suc k"} *}
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   122
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   123
primrec
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   124
  nth :: "'a list => nat => 'a" (infixl "!" 100) where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   125
  nth_Cons: "(x # xs) ! n = (case n of 0 \<Rightarrow> x | Suc k \<Rightarrow> xs ! k)"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   126
  -- {*Warning: simpset does not contain this definition, but separate
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   127
       theorems for @{text "n = 0"} and @{text "n = Suc k"} *}
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   128
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   129
primrec
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   130
  list_update :: "'a list \<Rightarrow> nat \<Rightarrow> 'a \<Rightarrow> 'a list" where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   131
    "list_update [] i v = []"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   132
  | "list_update (x # xs) i v = (case i of 0 \<Rightarrow> v # xs | Suc j \<Rightarrow> x # list_update xs j v)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   133
41229
d797baa3d57c replaced command 'nonterminals' by slightly modernized version 'nonterminal';
wenzelm
parents: 41075
diff changeset
   134
nonterminal lupdbinds and lupdbind
5077
71043526295f * HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents: 4643
diff changeset
   135
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   136
syntax
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   137
  "_lupdbind":: "['a, 'a] => lupdbind"    ("(2_ :=/ _)")
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   138
  "" :: "lupdbind => lupdbinds"    ("_")
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   139
  "_lupdbinds" :: "[lupdbind, lupdbinds] => lupdbinds"    ("_,/ _")
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   140
  "_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
   141
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   142
translations
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35028
diff changeset
   143
  "_LUpdate xs (_lupdbinds b bs)" == "_LUpdate (_LUpdate xs b) bs"
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   144
  "xs[i:=x]" == "CONST list_update xs i x"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   145
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   146
primrec
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   147
  takeWhile :: "('a \<Rightarrow> bool) \<Rightarrow> 'a list \<Rightarrow> 'a list" where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   148
    "takeWhile P [] = []"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   149
  | "takeWhile P (x # xs) = (if P x then x # takeWhile P xs else [])"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   150
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   151
primrec
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   152
  dropWhile :: "('a \<Rightarrow> bool) \<Rightarrow> 'a list \<Rightarrow> 'a list" where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   153
    "dropWhile P [] = []"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   154
  | "dropWhile P (x # xs) = (if P x then dropWhile P xs else x # xs)"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   155
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   156
primrec
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   157
  zip :: "'a list \<Rightarrow> 'b list \<Rightarrow> ('a \<times> 'b) list" where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   158
    "zip xs [] = []"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   159
  | zip_Cons: "zip xs (y # ys) = (case xs of [] => [] | z # zs => (z, y) # zip zs ys)"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   160
  -- {*Warning: simpset does not contain this definition, but separate
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   161
       theorems for @{text "xs = []"} and @{text "xs = z # zs"} *}
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   162
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   163
primrec 
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   164
  upt :: "nat \<Rightarrow> nat \<Rightarrow> nat list" ("(1[_..</_'])") where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   165
    upt_0: "[i..<0] = []"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   166
  | upt_Suc: "[i..<(Suc j)] = (if i <= j then [i..<j] @ [j] else [])"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   167
34978
874150ddd50a canonical insert operation; generalized lemma foldl_apply_inv to foldl_apply
haftmann
parents: 34942
diff changeset
   168
definition
874150ddd50a canonical insert operation; generalized lemma foldl_apply_inv to foldl_apply
haftmann
parents: 34942
diff changeset
   169
  insert :: "'a \<Rightarrow> 'a list \<Rightarrow> 'a list" where
874150ddd50a canonical insert operation; generalized lemma foldl_apply_inv to foldl_apply
haftmann
parents: 34942
diff changeset
   170
  "insert x xs = (if x \<in> set xs then xs else x # xs)"
874150ddd50a canonical insert operation; generalized lemma foldl_apply_inv to foldl_apply
haftmann
parents: 34942
diff changeset
   171
36176
3fe7e97ccca8 replaced generic 'hide' command by more conventional 'hide_class', 'hide_type', 'hide_const', 'hide_fact' -- frees some popular keywords;
wenzelm
parents: 36154
diff changeset
   172
hide_const (open) insert
3fe7e97ccca8 replaced generic 'hide' command by more conventional 'hide_class', 'hide_type', 'hide_const', 'hide_fact' -- frees some popular keywords;
wenzelm
parents: 36154
diff changeset
   173
hide_fact (open) insert_def
34978
874150ddd50a canonical insert operation; generalized lemma foldl_apply_inv to foldl_apply
haftmann
parents: 34942
diff changeset
   174
47122
790fb5eb5969 Functions and lemmas by Christian Sternagel
nipkow
parents: 47108
diff changeset
   175
primrec find :: "('a \<Rightarrow> bool) \<Rightarrow> 'a list \<Rightarrow> 'a option" where
790fb5eb5969 Functions and lemmas by Christian Sternagel
nipkow
parents: 47108
diff changeset
   176
  "find _ [] = None"
790fb5eb5969 Functions and lemmas by Christian Sternagel
nipkow
parents: 47108
diff changeset
   177
| "find P (x#xs) = (if P x then Some x else find P xs)"
790fb5eb5969 Functions and lemmas by Christian Sternagel
nipkow
parents: 47108
diff changeset
   178
790fb5eb5969 Functions and lemmas by Christian Sternagel
nipkow
parents: 47108
diff changeset
   179
hide_const (open) find
790fb5eb5969 Functions and lemmas by Christian Sternagel
nipkow
parents: 47108
diff changeset
   180
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   181
primrec
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   182
  remove1 :: "'a \<Rightarrow> 'a list \<Rightarrow> 'a list" where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   183
    "remove1 x [] = []"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   184
  | "remove1 x (y # xs) = (if x = y then xs else y # remove1 x xs)"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   185
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   186
primrec
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   187
  removeAll :: "'a \<Rightarrow> 'a list \<Rightarrow> 'a list" where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   188
    "removeAll x [] = []"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   189
  | "removeAll x (y # xs) = (if x = y then removeAll x xs else y # removeAll x xs)"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   190
40122
1d8ad2ff3e01 dropped (almost) redundant distinct.induct rule; distinct_simps again named distinct.simps
haftmann
parents: 40077
diff changeset
   191
primrec
39915
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   192
  distinct :: "'a list \<Rightarrow> bool" where
40122
1d8ad2ff3e01 dropped (almost) redundant distinct.induct rule; distinct_simps again named distinct.simps
haftmann
parents: 40077
diff changeset
   193
    "distinct [] \<longleftrightarrow> True"
1d8ad2ff3e01 dropped (almost) redundant distinct.induct rule; distinct_simps again named distinct.simps
haftmann
parents: 40077
diff changeset
   194
  | "distinct (x # xs) \<longleftrightarrow> x \<notin> set xs \<and> distinct xs"
39915
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   195
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   196
primrec
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   197
  remdups :: "'a list \<Rightarrow> 'a list" where
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   198
    "remdups [] = []"
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   199
  | "remdups (x # xs) = (if x \<in> set xs then remdups xs else x # remdups xs)"
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   200
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   201
primrec
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   202
  replicate :: "nat \<Rightarrow> 'a \<Rightarrow> 'a list" where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   203
    replicate_0: "replicate 0 x = []"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   204
  | replicate_Suc: "replicate (Suc n) x = x # replicate n x"
3342
ec3b55fcb165 New operator "lists" for formalizing sets of lists
paulson
parents: 3320
diff changeset
   205
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   206
text {*
14589
feae7b5fd425 tuned document;
wenzelm
parents: 14565
diff changeset
   207
  Function @{text size} is overloaded for all datatypes. Users may
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   208
  refer to the list version as @{text length}. *}
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   209
19363
667b5ea637dd refined 'abbreviation';
wenzelm
parents: 19302
diff changeset
   210
abbreviation
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   211
  length :: "'a list \<Rightarrow> nat" where
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   212
  "length \<equiv> size"
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   213
46440
d4994e2e7364 use 'primrec' to define "rotate1", for uniformity (and to help first-order tools that rely on "Spec_Rules")
blanchet
parents: 46439
diff changeset
   214
primrec rotate1 :: "'a list \<Rightarrow> 'a list" where
d4994e2e7364 use 'primrec' to define "rotate1", for uniformity (and to help first-order tools that rely on "Spec_Rules")
blanchet
parents: 46439
diff changeset
   215
  "rotate1 [] = []" |
d4994e2e7364 use 'primrec' to define "rotate1", for uniformity (and to help first-order tools that rely on "Spec_Rules")
blanchet
parents: 46439
diff changeset
   216
  "rotate1 (x # xs) = xs @ [x]"
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   217
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   218
definition
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   219
  rotate :: "nat \<Rightarrow> 'a list \<Rightarrow> 'a list" where
30971
7fbebf75b3ef funpow and relpow with shared "^^" syntax
haftmann
parents: 30952
diff changeset
   220
  "rotate n = rotate1 ^^ n"
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   221
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   222
definition
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   223
  list_all2 :: "('a => 'b => bool) => 'a list => 'b list => bool" where
37767
a2b7a20d6ea3 dropped superfluous [code del]s
haftmann
parents: 37605
diff changeset
   224
  "list_all2 P xs ys =
21061
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   225
    (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
   226
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   227
definition
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   228
  sublist :: "'a list => nat set => 'a list" where
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21211
diff changeset
   229
  "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
   230
40593
1e57b18d27b1 code eqn for slice was missing; redefined splice with fun
nipkow
parents: 40365
diff changeset
   231
fun splice :: "'a list \<Rightarrow> 'a list \<Rightarrow> 'a list" where
1e57b18d27b1 code eqn for slice was missing; redefined splice with fun
nipkow
parents: 40365
diff changeset
   232
"splice [] ys = ys" |
1e57b18d27b1 code eqn for slice was missing; redefined splice with fun
nipkow
parents: 40365
diff changeset
   233
"splice xs [] = xs" |
1e57b18d27b1 code eqn for slice was missing; redefined splice with fun
nipkow
parents: 40365
diff changeset
   234
"splice (x#xs) (y#ys) = x # y # splice xs ys"
21061
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   235
26771
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   236
text{*
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   237
\begin{figure}[htbp]
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   238
\fbox{
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   239
\begin{tabular}{l}
27381
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   240
@{lemma "[a,b]@[c,d] = [a,b,c,d]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   241
@{lemma "length [a,b,c] = 3" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   242
@{lemma "set [a,b,c] = {a,b,c}" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   243
@{lemma "map f [a,b,c] = [f a, f b, f c]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   244
@{lemma "rev [a,b,c] = [c,b,a]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   245
@{lemma "hd [a,b,c,d] = a" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   246
@{lemma "tl [a,b,c,d] = [b,c,d]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   247
@{lemma "last [a,b,c,d] = d" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   248
@{lemma "butlast [a,b,c,d] = [a,b,c]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   249
@{lemma[source] "filter (\<lambda>n::nat. n<2) [0,2,1] = [0,1]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   250
@{lemma "concat [[a,b],[c,d,e],[],[f]] = [a,b,c,d,e,f]" by simp}\\
46133
d9fe85d3d2cd incorporated canonical fold combinator on lists into body of List theory; refactored passages on List.fold(l/r)
haftmann
parents: 46125
diff changeset
   251
@{lemma "fold f [a,b,c] x = f c (f b (f a x))" by simp}\\
47397
d654c73e4b12 no preference wrt. fold(l/r); prefer fold rather than foldr for iterating over lists in generated code
haftmann
parents: 47131
diff changeset
   252
@{lemma "foldr f [a,b,c] x = f a (f b (f c x))" by simp}\\
d654c73e4b12 no preference wrt. fold(l/r); prefer fold rather than foldr for iterating over lists in generated code
haftmann
parents: 47131
diff changeset
   253
@{lemma "foldl f x [a,b,c] = f (f (f x a) b) c" by simp}\\
27381
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   254
@{lemma "zip [a,b,c] [x,y,z] = [(a,x),(b,y),(c,z)]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   255
@{lemma "zip [a,b] [x,y,z] = [(a,x),(b,y)]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   256
@{lemma "splice [a,b,c] [x,y,z] = [a,x,b,y,c,z]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   257
@{lemma "splice [a,b,c,d] [x,y] = [a,x,b,y,c,d]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   258
@{lemma "take 2 [a,b,c,d] = [a,b]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   259
@{lemma "take 6 [a,b,c,d] = [a,b,c,d]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   260
@{lemma "drop 2 [a,b,c,d] = [c,d]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   261
@{lemma "drop 6 [a,b,c,d] = []" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   262
@{lemma "takeWhile (%n::nat. n<3) [1,2,3,0] = [1,2]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   263
@{lemma "dropWhile (%n::nat. n<3) [1,2,3,0] = [3,0]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   264
@{lemma "distinct [2,0,1::nat]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   265
@{lemma "remdups [2,0,2,1::nat,2] = [0,1,2]" by simp}\\
34978
874150ddd50a canonical insert operation; generalized lemma foldl_apply_inv to foldl_apply
haftmann
parents: 34942
diff changeset
   266
@{lemma "List.insert 2 [0::nat,1,2] = [0,1,2]" by (simp add: List.insert_def)}\\
35295
397295fa8387 lemma distinct_insert
haftmann
parents: 35248
diff changeset
   267
@{lemma "List.insert 3 [0::nat,1,2] = [3,0,1,2]" by (simp add: List.insert_def)}\\
47122
790fb5eb5969 Functions and lemmas by Christian Sternagel
nipkow
parents: 47108
diff changeset
   268
@{lemma "List.find (%i::int. i>0) [0,0] = None" by simp}\\
790fb5eb5969 Functions and lemmas by Christian Sternagel
nipkow
parents: 47108
diff changeset
   269
@{lemma "List.find (%i::int. i>0) [0,1,0,2] = Some 1" by simp}\\
27381
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   270
@{lemma "remove1 2 [2,0,2,1::nat,2] = [0,2,1,2]" by simp}\\
27693
73253a4e3ee2 added removeAll
nipkow
parents: 27381
diff changeset
   271
@{lemma "removeAll 2 [2,0,2,1::nat,2] = [0,1]" by simp}\\
27381
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   272
@{lemma "nth [a,b,c,d] 2 = c" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   273
@{lemma "[a,b,c,d][2 := x] = [a,b,x,d]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   274
@{lemma "sublist [a,b,c,d,e] {0,2,3} = [a,c,d]" by (simp add:sublist_def)}\\
46440
d4994e2e7364 use 'primrec' to define "rotate1", for uniformity (and to help first-order tools that rely on "Spec_Rules")
blanchet
parents: 46439
diff changeset
   275
@{lemma "rotate1 [a,b,c,d] = [b,c,d,a]" by simp}\\
d4994e2e7364 use 'primrec' to define "rotate1", for uniformity (and to help first-order tools that rely on "Spec_Rules")
blanchet
parents: 46439
diff changeset
   276
@{lemma "rotate 3 [a,b,c,d] = [d,a,b,c]" by (simp add:rotate_def eval_nat_numeral)}\\
40077
c8a9eaaa2f59 nat_number -> eval_nat_numeral
nipkow
parents: 39963
diff changeset
   277
@{lemma "replicate 4 a = [a,a,a,a]" by (simp add:eval_nat_numeral)}\\
c8a9eaaa2f59 nat_number -> eval_nat_numeral
nipkow
parents: 39963
diff changeset
   278
@{lemma "[2..<5] = [2,3,4]" by (simp add:eval_nat_numeral)}\\
47397
d654c73e4b12 no preference wrt. fold(l/r); prefer fold rather than foldr for iterating over lists in generated code
haftmann
parents: 47131
diff changeset
   279
@{lemma "listsum [1,2,3::nat] = 6" by (simp add: listsum_def)}
26771
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   280
\end{tabular}}
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   281
\caption{Characteristic examples}
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   282
\label{fig:Characteristic}
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   283
\end{figure}
29927
ae8f42c245b2 Added nitpick attribute, and fixed typo.
blanchet
parents: 29856
diff changeset
   284
Figure~\ref{fig:Characteristic} shows characteristic examples
26771
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   285
that should give an intuitive understanding of the above functions.
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   286
*}
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   287
24616
fac3dd4ade83 sorting
nipkow
parents: 24566
diff changeset
   288
text{* The following simple sort functions are intended for proofs,
fac3dd4ade83 sorting
nipkow
parents: 24566
diff changeset
   289
not for efficient implementations. *}
fac3dd4ade83 sorting
nipkow
parents: 24566
diff changeset
   290
25221
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
   291
context linorder
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
   292
begin
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
   293
39915
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   294
inductive sorted :: "'a list \<Rightarrow> bool" where
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   295
  Nil [iff]: "sorted []"
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   296
| Cons: "\<forall>y\<in>set xs. x \<le> y \<Longrightarrow> sorted xs \<Longrightarrow> sorted (x # xs)"
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   297
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   298
lemma sorted_single [iff]:
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   299
  "sorted [x]"
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   300
  by (rule sorted.Cons) auto
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   301
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   302
lemma sorted_many:
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   303
  "x \<le> y \<Longrightarrow> sorted (y # zs) \<Longrightarrow> sorted (x # y # zs)"
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   304
  by (rule sorted.Cons) (cases "y # zs" rule: sorted.cases, auto)
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   305
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   306
lemma sorted_many_eq [simp, code]:
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   307
  "sorted (x # y # zs) \<longleftrightarrow> x \<le> y \<and> sorted (y # zs)"
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   308
  by (auto intro: sorted_many elim: sorted.cases)
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   309
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   310
lemma [code]:
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   311
  "sorted [] \<longleftrightarrow> True"
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   312
  "sorted [x] \<longleftrightarrow> True"
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   313
  by simp_all
24697
b37d3980da3c fixed haftmann bug
nipkow
parents: 24657
diff changeset
   314
33639
603320b93668 New list theorems; added map_map to simpset, this is the prefered direction; allow sorting by a key
hoelzl
parents: 33593
diff changeset
   315
primrec insort_key :: "('b \<Rightarrow> 'a) \<Rightarrow> 'b \<Rightarrow> 'b list \<Rightarrow> 'b list" where
46133
d9fe85d3d2cd incorporated canonical fold combinator on lists into body of List theory; refactored passages on List.fold(l/r)
haftmann
parents: 46125
diff changeset
   316
  "insort_key f x [] = [x]" |
d9fe85d3d2cd incorporated canonical fold combinator on lists into body of List theory; refactored passages on List.fold(l/r)
haftmann
parents: 46125
diff changeset
   317
  "insort_key f x (y#ys) = (if f x \<le> f y then (x#y#ys) else y#(insort_key f x ys))"
33639
603320b93668 New list theorems; added map_map to simpset, this is the prefered direction; allow sorting by a key
hoelzl
parents: 33593
diff changeset
   318
35195
5163c2d00904 more lemmas about sort(_key)
haftmann
parents: 35115
diff changeset
   319
definition sort_key :: "('b \<Rightarrow> 'a) \<Rightarrow> 'b list \<Rightarrow> 'b list" where
46133
d9fe85d3d2cd incorporated canonical fold combinator on lists into body of List theory; refactored passages on List.fold(l/r)
haftmann
parents: 46125
diff changeset
   320
  "sort_key f xs = foldr (insort_key f) xs []"
33639
603320b93668 New list theorems; added map_map to simpset, this is the prefered direction; allow sorting by a key
hoelzl
parents: 33593
diff changeset
   321
40210
aee7ef725330 sorting: avoid _key suffix if lemma applies both to simple and generalized variant; generalized insort_insert to insort_insert_key; additional lemmas
haftmann
parents: 40195
diff changeset
   322
definition insort_insert_key :: "('b \<Rightarrow> 'a) \<Rightarrow> 'b \<Rightarrow> 'b list \<Rightarrow> 'b list" where
aee7ef725330 sorting: avoid _key suffix if lemma applies both to simple and generalized variant; generalized insort_insert to insort_insert_key; additional lemmas
haftmann
parents: 40195
diff changeset
   323
  "insort_insert_key f x xs = (if f x \<in> f ` set xs then xs else insort_key f x xs)"
aee7ef725330 sorting: avoid _key suffix if lemma applies both to simple and generalized variant; generalized insort_insert to insort_insert_key; additional lemmas
haftmann
parents: 40195
diff changeset
   324
33639
603320b93668 New list theorems; added map_map to simpset, this is the prefered direction; allow sorting by a key
hoelzl
parents: 33593
diff changeset
   325
abbreviation "sort \<equiv> sort_key (\<lambda>x. x)"
603320b93668 New list theorems; added map_map to simpset, this is the prefered direction; allow sorting by a key
hoelzl
parents: 33593
diff changeset
   326
abbreviation "insort \<equiv> insort_key (\<lambda>x. x)"
40210
aee7ef725330 sorting: avoid _key suffix if lemma applies both to simple and generalized variant; generalized insort_insert to insort_insert_key; additional lemmas
haftmann
parents: 40195
diff changeset
   327
abbreviation "insort_insert \<equiv> insort_insert_key (\<lambda>x. x)"
35608
db4045d1406e added insort_insert
haftmann
parents: 35603
diff changeset
   328
25221
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
   329
end
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
   330
24616
fac3dd4ade83 sorting
nipkow
parents: 24566
diff changeset
   331
23388
77645da0db85 tuned proofs: avoid implicit prems;
wenzelm
parents: 23279
diff changeset
   332
subsubsection {* List comprehension *}
23192
ec73b9707d48 Moved list comprehension into List
nipkow
parents: 23096
diff changeset
   333
24349
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   334
text{* Input syntax for Haskell-like list comprehension notation.
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   335
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
   336
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
   337
The syntax is as in Haskell, except that @{text"|"} becomes a dot
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   338
(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
   339
\verb![e| x <- xs, ...]!.
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   340
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   341
The qualifiers after the dot are
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   342
\begin{description}
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   343
\item[generators] @{text"p \<leftarrow> xs"},
24476
f7ad9fbbeeaa turned list comprehension translations into ML to optimize base case
nipkow
parents: 24471
diff changeset
   344
 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
   345
\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
   346
%\item[local bindings] @ {text"let x = e"}.
24349
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   347
\end{description}
23240
7077dc80a14b tuned list comprehension
nipkow
parents: 23235
diff changeset
   348
24476
f7ad9fbbeeaa turned list comprehension translations into ML to optimize base case
nipkow
parents: 24471
diff changeset
   349
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
   350
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
   351
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
   352
optmized to @{term"map (%x. e) xs"}.
23240
7077dc80a14b tuned list comprehension
nipkow
parents: 23235
diff changeset
   353
24349
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   354
It is easy to write short list comprehensions which stand for complex
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   355
expressions. During proofs, they may become unreadable (and
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   356
mangled). In such cases it can be advisable to introduce separate
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   357
definitions for the list comprehensions in question.  *}
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   358
46138
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   359
nonterminal lc_qual and lc_quals
23192
ec73b9707d48 Moved list comprehension into List
nipkow
parents: 23096
diff changeset
   360
ec73b9707d48 Moved list comprehension into List
nipkow
parents: 23096
diff changeset
   361
syntax
46138
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   362
  "_listcompr" :: "'a \<Rightarrow> lc_qual \<Rightarrow> lc_quals \<Rightarrow> 'a list"  ("[_ . __")
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   363
  "_lc_gen" :: "'a \<Rightarrow> 'a list \<Rightarrow> lc_qual"  ("_ <- _")
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   364
  "_lc_test" :: "bool \<Rightarrow> lc_qual" ("_")
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   365
  (*"_lc_let" :: "letbinds => lc_qual"  ("let _")*)
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   366
  "_lc_end" :: "lc_quals" ("]")
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   367
  "_lc_quals" :: "lc_qual \<Rightarrow> lc_quals \<Rightarrow> lc_quals"  (", __")
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   368
  "_lc_abs" :: "'a => 'b list => 'b list"
23192
ec73b9707d48 Moved list comprehension into List
nipkow
parents: 23096
diff changeset
   369
24476
f7ad9fbbeeaa turned list comprehension translations into ML to optimize base case
nipkow
parents: 24471
diff changeset
   370
(* 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
   371
   translation of [e. p<-xs]
23192
ec73b9707d48 Moved list comprehension into List
nipkow
parents: 23096
diff changeset
   372
translations
46138
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   373
  "[e. p<-xs]" => "concat(map (_lc_abs p [e]) xs)"
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   374
  "_listcompr e (_lc_gen p xs) (_lc_quals Q Qs)"
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   375
   => "concat (map (_lc_abs p (_listcompr e Q Qs)) xs)"
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   376
  "[e. P]" => "if P then [e] else []"
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   377
  "_listcompr e (_lc_test P) (_lc_quals Q Qs)"
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   378
   => "if P then (_listcompr e Q Qs) else []"
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   379
  "_listcompr e (_lc_let b) (_lc_quals Q Qs)"
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   380
   => "_Let b (_listcompr e Q Qs)"
24476
f7ad9fbbeeaa turned list comprehension translations into ML to optimize base case
nipkow
parents: 24471
diff changeset
   381
*)
23240
7077dc80a14b tuned list comprehension
nipkow
parents: 23235
diff changeset
   382
23279
e39dd93161d9 tuned list comprehension, changed filter syntax from : to <-
nipkow
parents: 23246
diff changeset
   383
syntax (xsymbols)
46138
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   384
  "_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
   385
syntax (HTML output)
46138
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   386
  "_lc_gen" :: "'a \<Rightarrow> 'a list \<Rightarrow> lc_qual"  ("_ \<leftarrow> _")
24349
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   387
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   388
parse_translation (advanced) {*
46138
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   389
  let
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   390
    val NilC = Syntax.const @{const_syntax Nil};
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   391
    val ConsC = Syntax.const @{const_syntax Cons};
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   392
    val mapC = Syntax.const @{const_syntax map};
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   393
    val concatC = Syntax.const @{const_syntax concat};
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   394
    val IfC = Syntax.const @{const_syntax If};
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   395
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   396
    fun single x = ConsC $ x $ NilC;
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   397
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   398
    fun pat_tr ctxt p e opti = (* %x. case x of p => e | _ => [] *)
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   399
      let
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   400
        (* FIXME proper name context!? *)
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   401
        val x =
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   402
          Free (singleton (Name.variant_list (fold Term.add_free_names [p, e] [])) "x", dummyT);
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   403
        val e = if opti then single e else e;
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   404
        val case1 = Syntax.const @{syntax_const "_case1"} $ p $ e;
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   405
        val case2 =
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   406
          Syntax.const @{syntax_const "_case1"} $
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   407
            Syntax.const @{const_syntax dummy_pattern} $ NilC;
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   408
        val cs = Syntax.const @{syntax_const "_case2"} $ case1 $ case2;
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   409
      in Syntax_Trans.abs_tr [x, Datatype_Case.case_tr false ctxt [x, cs]] end;
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   410
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   411
    fun abs_tr ctxt p e opti =
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   412
      (case Term_Position.strip_positions p of
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   413
        Free (s, T) =>
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   414
          let
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   415
            val thy = Proof_Context.theory_of ctxt;
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   416
            val s' = Proof_Context.intern_const ctxt s;
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   417
          in
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   418
            if Sign.declared_const thy s'
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   419
            then (pat_tr ctxt p e opti, false)
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   420
            else (Syntax_Trans.abs_tr [p, e], true)
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   421
          end
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   422
      | _ => (pat_tr ctxt p e opti, false));
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   423
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   424
    fun lc_tr ctxt [e, Const (@{syntax_const "_lc_test"}, _) $ b, qs] =
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   425
          let
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   426
            val res =
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   427
              (case qs of
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   428
                Const (@{syntax_const "_lc_end"}, _) => single e
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   429
              | Const (@{syntax_const "_lc_quals"}, _) $ q $ qs => lc_tr ctxt [e, q, qs]);
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   430
          in IfC $ b $ res $ NilC end
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   431
      | lc_tr ctxt
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   432
            [e, Const (@{syntax_const "_lc_gen"}, _) $ p $ es,
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   433
              Const(@{syntax_const "_lc_end"}, _)] =
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   434
          (case abs_tr ctxt p e true of
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   435
            (f, true) => mapC $ f $ es
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   436
          | (f, false) => concatC $ (mapC $ f $ es))
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   437
      | lc_tr ctxt
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   438
            [e, Const (@{syntax_const "_lc_gen"}, _) $ p $ es,
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   439
              Const (@{syntax_const "_lc_quals"}, _) $ q $ qs] =
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   440
          let val e' = lc_tr ctxt [e, q, qs];
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   441
          in concatC $ (mapC $ (fst (abs_tr ctxt p e' false)) $ es) end;
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   442
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   443
  in [(@{syntax_const "_listcompr"}, lc_tr)] end
24349
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   444
*}
23279
e39dd93161d9 tuned list comprehension, changed filter syntax from : to <-
nipkow
parents: 23246
diff changeset
   445
42167
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   446
ML {*
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   447
  let
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   448
    val read = Syntax.read_term @{context};
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   449
    fun check s1 s2 = read s1 aconv read s2 orelse error ("Check failed: " ^ quote s1);
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   450
  in
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   451
    check "[(x,y,z). b]" "if b then [(x, y, z)] else []";
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   452
    check "[(x,y,z). x\<leftarrow>xs]" "map (\<lambda>x. (x, y, z)) xs";
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   453
    check "[e x y. x\<leftarrow>xs, y\<leftarrow>ys]" "concat (map (\<lambda>x. map (\<lambda>y. e x y) ys) xs)";
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   454
    check "[(x,y,z). x<a, x>b]" "if x < a then if b < x then [(x, y, z)] else [] else []";
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   455
    check "[(x,y,z). x\<leftarrow>xs, x>b]" "concat (map (\<lambda>x. if b < x then [(x, y, z)] else []) xs)";
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   456
    check "[(x,y,z). x<a, x\<leftarrow>xs]" "if x < a then map (\<lambda>x. (x, y, z)) xs else []";
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   457
    check "[(x,y). Cons True x \<leftarrow> xs]"
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   458
      "concat (map (\<lambda>xa. case xa of [] \<Rightarrow> [] | True # x \<Rightarrow> [(x, y)] | False # x \<Rightarrow> []) xs)";
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   459
    check "[(x,y,z). Cons x [] \<leftarrow> xs]"
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   460
      "concat (map (\<lambda>xa. case xa of [] \<Rightarrow> [] | [x] \<Rightarrow> [(x, y, z)] | x # aa # lista \<Rightarrow> []) xs)";
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   461
    check "[(x,y,z). x<a, x>b, x=d]"
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   462
      "if x < a then if b < x then if x = d then [(x, y, z)] else [] else [] else []";
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   463
    check "[(x,y,z). x<a, x>b, y\<leftarrow>ys]"
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   464
      "if x < a then if b < x then map (\<lambda>y. (x, y, z)) ys else [] else []";
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   465
    check "[(x,y,z). x<a, x\<leftarrow>xs,y>b]"
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   466
      "if x < a then concat (map (\<lambda>x. if b < y then [(x, y, z)] else []) xs) else []";
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   467
    check "[(x,y,z). x<a, x\<leftarrow>xs, y\<leftarrow>ys]"
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   468
      "if x < a then concat (map (\<lambda>x. map (\<lambda>y. (x, y, z)) ys) xs) else []";
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   469
    check "[(x,y,z). x\<leftarrow>xs, x>b, y<a]"
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   470
      "concat (map (\<lambda>x. if b < x then if y < a then [(x, y, z)] else [] else []) xs)";
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   471
    check "[(x,y,z). x\<leftarrow>xs, x>b, y\<leftarrow>ys]"
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   472
      "concat (map (\<lambda>x. if b < x then map (\<lambda>y. (x, y, z)) ys else []) xs)";
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   473
    check "[(x,y,z). x\<leftarrow>xs, y\<leftarrow>ys,y>x]"
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   474
      "concat (map (\<lambda>x. concat (map (\<lambda>y. if x < y then [(x, y, z)] else []) ys)) xs)";
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   475
    check "[(x,y,z). x\<leftarrow>xs, y\<leftarrow>ys,z\<leftarrow>zs]"
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   476
      "concat (map (\<lambda>x. concat (map (\<lambda>y. map (\<lambda>z. (x, y, z)) zs) ys)) xs)"
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   477
  end;
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   478
*}
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   479
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35028
diff changeset
   480
(*
24349
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   481
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
   482
*)
ec73b9707d48 Moved list comprehension into List
nipkow
parents: 23096
diff changeset
   483
42167
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   484
48891
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48828
diff changeset
   485
ML_file "Tools/list_to_set_comprehension.ML"
41463
edbf0a86fb1c adding simproc to rewrite list comprehensions to set comprehensions; adopting proofs
bulwahn
parents: 41372
diff changeset
   486
edbf0a86fb1c adding simproc to rewrite list comprehensions to set comprehensions; adopting proofs
bulwahn
parents: 41372
diff changeset
   487
simproc_setup list_to_set_comprehension ("set xs") = {* K List_to_Set_Comprehension.simproc *}
edbf0a86fb1c adding simproc to rewrite list comprehensions to set comprehensions; adopting proofs
bulwahn
parents: 41372
diff changeset
   488
46133
d9fe85d3d2cd incorporated canonical fold combinator on lists into body of List theory; refactored passages on List.fold(l/r)
haftmann
parents: 46125
diff changeset
   489
code_datatype set coset
d9fe85d3d2cd incorporated canonical fold combinator on lists into body of List theory; refactored passages on List.fold(l/r)
haftmann
parents: 46125
diff changeset
   490
d9fe85d3d2cd incorporated canonical fold combinator on lists into body of List theory; refactored passages on List.fold(l/r)
haftmann
parents: 46125
diff changeset
   491
hide_const (open) coset
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35028
diff changeset
   492
21061
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   493
subsubsection {* @{const Nil} and @{const Cons} *}
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   494
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   495
lemma not_Cons_self [simp]:
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   496
  "xs \<noteq> x # xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   497
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   498
41697
19890332febc explicit is better than implicit;
wenzelm
parents: 41505
diff changeset
   499
lemma not_Cons_self2 [simp]:
19890332febc explicit is better than implicit;
wenzelm
parents: 41505
diff changeset
   500
  "x # xs \<noteq> xs"
19890332febc explicit is better than implicit;
wenzelm
parents: 41505
diff changeset
   501
by (rule not_Cons_self [symmetric])
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   502
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   503
lemma neq_Nil_conv: "(xs \<noteq> []) = (\<exists>y ys. xs = y # 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
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   506
lemma length_induct:
21061
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   507
  "(\<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
   508
by (rule measure_induct [of length]) iprover
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   509
37289
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   510
lemma list_nonempty_induct [consumes 1, case_names single cons]:
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   511
  assumes "xs \<noteq> []"
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   512
  assumes single: "\<And>x. P [x]"
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   513
  assumes cons: "\<And>x xs. xs \<noteq> [] \<Longrightarrow> P xs \<Longrightarrow> P (x # xs)"
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   514
  shows "P xs"
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   515
using `xs \<noteq> []` proof (induct xs)
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   516
  case Nil then show ?case by simp
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   517
next
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   518
  case (Cons x xs) show ?case proof (cases xs)
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   519
    case Nil with single show ?thesis by simp
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   520
  next
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   521
    case Cons then have "xs \<noteq> []" by simp
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   522
    moreover with Cons.hyps have "P xs" .
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   523
    ultimately show ?thesis by (rule cons)
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   524
  qed
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   525
qed
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   526
45714
ad4242285560 cardinality of sets of lists
hoelzl
parents: 45607
diff changeset
   527
lemma inj_split_Cons: "inj_on (\<lambda>(xs, n). n#xs) X"
ad4242285560 cardinality of sets of lists
hoelzl
parents: 45607
diff changeset
   528
  by (auto intro!: inj_onI)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   529
21061
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   530
subsubsection {* @{const length} *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   531
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   532
text {*
21061
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   533
  Needs to come before @{text "@"} because of theorem @{text
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   534
  append_eq_append_conv}.
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   535
*}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   536
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   537
lemma length_append [simp]: "length (xs @ ys) = length xs + length ys"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   538
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   539
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   540
lemma length_map [simp]: "length (map f xs) = length xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   541
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   542
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   543
lemma length_rev [simp]: "length (rev xs) = length xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   544
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   545
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   546
lemma length_tl [simp]: "length (tl xs) = length xs - 1"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   547
by (cases xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   548
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   549
lemma length_0_conv [iff]: "(length xs = 0) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   550
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   551
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   552
lemma length_greater_0_conv [iff]: "(0 < length xs) = (xs \<noteq> [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   553
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   554
23479
10adbdcdc65b new lemmas
nipkow
parents: 23388
diff changeset
   555
lemma length_pos_if_in_set: "x : set xs \<Longrightarrow> length xs > 0"
10adbdcdc65b new lemmas
nipkow
parents: 23388
diff changeset
   556
by auto
10adbdcdc65b new lemmas
nipkow
parents: 23388
diff changeset
   557
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   558
lemma length_Suc_conv:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   559
"(length xs = Suc n) = (\<exists>y ys. xs = y # ys \<and> length ys = n)"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   560
by (induct xs) auto
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   561
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   562
lemma Suc_length_conv:
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   563
"(Suc n = length xs) = (\<exists>y ys. xs = y # ys \<and> length ys = n)"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   564
apply (induct xs, simp, simp)
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   565
apply blast
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   566
done
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   567
25221
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
   568
lemma impossible_Cons: "length xs <= length ys ==> xs = x # ys = False"
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
   569
  by (induct xs) auto
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
   570
26442
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   571
lemma list_induct2 [consumes 1, case_names Nil Cons]:
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   572
  "length xs = length ys \<Longrightarrow> P [] [] \<Longrightarrow>
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   573
   (\<And>x xs y ys. length xs = length ys \<Longrightarrow> P xs ys \<Longrightarrow> P (x#xs) (y#ys))
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   574
   \<Longrightarrow> P xs ys"
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   575
proof (induct xs arbitrary: ys)
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   576
  case Nil then show ?case by simp
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   577
next
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   578
  case (Cons x xs ys) then show ?case by (cases ys) simp_all
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   579
qed
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   580
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   581
lemma list_induct3 [consumes 2, case_names Nil Cons]:
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   582
  "length xs = length ys \<Longrightarrow> length ys = length zs \<Longrightarrow> P [] [] [] \<Longrightarrow>
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   583
   (\<And>x xs y ys z zs. length xs = length ys \<Longrightarrow> length ys = length zs \<Longrightarrow> P xs ys zs \<Longrightarrow> P (x#xs) (y#ys) (z#zs))
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   584
   \<Longrightarrow> P xs ys zs"
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   585
proof (induct xs arbitrary: ys zs)
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   586
  case Nil then show ?case by simp
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   587
next
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   588
  case (Cons x xs ys zs) then show ?case by (cases ys, simp_all)
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   589
    (cases zs, simp_all)
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   590
qed
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   591
36154
11c6106d7787 Respectfullness and preservation of list_rel
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents: 35828
diff changeset
   592
lemma list_induct4 [consumes 3, case_names Nil Cons]:
11c6106d7787 Respectfullness and preservation of list_rel
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents: 35828
diff changeset
   593
  "length xs = length ys \<Longrightarrow> length ys = length zs \<Longrightarrow> length zs = length ws \<Longrightarrow>
11c6106d7787 Respectfullness and preservation of list_rel
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents: 35828
diff changeset
   594
   P [] [] [] [] \<Longrightarrow> (\<And>x xs y ys z zs w ws. length xs = length ys \<Longrightarrow>
11c6106d7787 Respectfullness and preservation of list_rel
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents: 35828
diff changeset
   595
   length ys = length zs \<Longrightarrow> length zs = length ws \<Longrightarrow> P xs ys zs ws \<Longrightarrow>
11c6106d7787 Respectfullness and preservation of list_rel
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents: 35828
diff changeset
   596
   P (x#xs) (y#ys) (z#zs) (w#ws)) \<Longrightarrow> P xs ys zs ws"
11c6106d7787 Respectfullness and preservation of list_rel
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents: 35828
diff changeset
   597
proof (induct xs arbitrary: ys zs ws)
11c6106d7787 Respectfullness and preservation of list_rel
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents: 35828
diff changeset
   598
  case Nil then show ?case by simp
11c6106d7787 Respectfullness and preservation of list_rel
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents: 35828
diff changeset
   599
next
11c6106d7787 Respectfullness and preservation of list_rel
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents: 35828
diff changeset
   600
  case (Cons x xs ys zs ws) then show ?case by ((cases ys, simp_all), (cases zs,simp_all)) (cases ws, simp_all)
11c6106d7787 Respectfullness and preservation of list_rel
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents: 35828
diff changeset
   601
qed
11c6106d7787 Respectfullness and preservation of list_rel
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents: 35828
diff changeset
   602
22493
db930e490fe5 added another rule for simultaneous induction, and lemmas for zip
krauss
parents: 22422
diff changeset
   603
lemma list_induct2': 
db930e490fe5 added another rule for simultaneous induction, and lemmas for zip
krauss
parents: 22422
diff changeset
   604
  "\<lbrakk> P [] [];
db930e490fe5 added another rule for simultaneous induction, and lemmas for zip
krauss
parents: 22422
diff changeset
   605
  \<And>x xs. P (x#xs) [];
db930e490fe5 added another rule for simultaneous induction, and lemmas for zip
krauss
parents: 22422
diff changeset
   606
  \<And>y ys. P [] (y#ys);
db930e490fe5 added another rule for simultaneous induction, and lemmas for zip
krauss
parents: 22422
diff changeset
   607
   \<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
   608
 \<Longrightarrow> P xs ys"
db930e490fe5 added another rule for simultaneous induction, and lemmas for zip
krauss
parents: 22422
diff changeset
   609
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
   610
22143
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   611
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
   612
by (rule Eq_FalseI) auto
24037
0a41d2ebc0cd proper simproc_setup for "list_neq";
wenzelm
parents: 23983
diff changeset
   613
0a41d2ebc0cd proper simproc_setup for "list_neq";
wenzelm
parents: 23983
diff changeset
   614
simproc_setup list_neq ("(xs::'a list) = ys") = {*
22143
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   615
(*
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   616
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
   617
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
   618
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
   619
*)
24037
0a41d2ebc0cd proper simproc_setup for "list_neq";
wenzelm
parents: 23983
diff changeset
   620
0a41d2ebc0cd proper simproc_setup for "list_neq";
wenzelm
parents: 23983
diff changeset
   621
let
22143
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   622
29856
984191be0357 const_name antiquotations
huffman
parents: 29829
diff changeset
   623
fun len (Const(@{const_name Nil},_)) acc = acc
984191be0357 const_name antiquotations
huffman
parents: 29829
diff changeset
   624
  | len (Const(@{const_name Cons},_) $ _ $ xs) (ts,n) = len xs (ts,n+1)
984191be0357 const_name antiquotations
huffman
parents: 29829
diff changeset
   625
  | len (Const(@{const_name append},_) $ xs $ ys) acc = len xs (len ys acc)
984191be0357 const_name antiquotations
huffman
parents: 29829
diff changeset
   626
  | len (Const(@{const_name rev},_) $ xs) acc = len xs acc
984191be0357 const_name antiquotations
huffman
parents: 29829
diff changeset
   627
  | len (Const(@{const_name map},_) $ _ $ xs) acc = len xs acc
22143
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   628
  | len t (ts,n) = (t::ts,n);
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   629
24037
0a41d2ebc0cd proper simproc_setup for "list_neq";
wenzelm
parents: 23983
diff changeset
   630
fun list_neq _ ss ct =
22143
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   631
  let
24037
0a41d2ebc0cd proper simproc_setup for "list_neq";
wenzelm
parents: 23983
diff changeset
   632
    val (Const(_,eqT) $ lhs $ rhs) = Thm.term_of ct;
22143
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   633
    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
   634
    fun prove_neq() =
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   635
      let
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   636
        val Type(_,listT::_) = eqT;
22994
02440636214f abstract size function in hologic.ML
haftmann
parents: 22940
diff changeset
   637
        val size = HOLogic.size_const listT;
22143
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   638
        val eq_len = HOLogic.mk_eq (size $ lhs, size $ rhs);
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   639
        val neq_len = HOLogic.mk_Trueprop (HOLogic.Not $ eq_len);
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   640
        val thm = Goal.prove (Simplifier.the_context ss) [] [] neq_len
22633
haftmann
parents: 22551
diff changeset
   641
          (K (simp_tac (Simplifier.inherit_context ss @{simpset}) 1));
haftmann
parents: 22551
diff changeset
   642
      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
   643
  in
23214
dc23c062b58c renamed gen_submultiset to submultiset;
wenzelm
parents: 23212
diff changeset
   644
    if m < n andalso submultiset (op aconv) (ls,rs) orelse
dc23c062b58c renamed gen_submultiset to submultiset;
wenzelm
parents: 23212
diff changeset
   645
       n < m andalso submultiset (op aconv) (rs,ls)
22143
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   646
    then prove_neq() else NONE
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   647
  end;
24037
0a41d2ebc0cd proper simproc_setup for "list_neq";
wenzelm
parents: 23983
diff changeset
   648
in list_neq end;
22143
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   649
*}
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   650
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   651
15392
290bc97038c7 First step in reorganizing Finite_Set
nipkow
parents: 15307
diff changeset
   652
subsubsection {* @{text "@"} -- append *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   653
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   654
lemma append_assoc [simp]: "(xs @ ys) @ zs = xs @ (ys @ zs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   655
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   656
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   657
lemma append_Nil2 [simp]: "xs @ [] = xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   658
by (induct xs) auto
3507
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   659
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   660
lemma append_is_Nil_conv [iff]: "(xs @ ys = []) = (xs = [] \<and> ys = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   661
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   662
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   663
lemma Nil_is_append_conv [iff]: "([] = xs @ ys) = (xs = [] \<and> ys = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   664
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   665
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   666
lemma append_self_conv [iff]: "(xs @ ys = xs) = (ys = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   667
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   668
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   669
lemma self_append_conv [iff]: "(xs = xs @ ys) = (ys = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   670
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   671
35828
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35827
diff changeset
   672
lemma append_eq_append_conv [simp, no_atp]:
24526
7fa202789bf6 tuned lemma; replaced !! by arbitrary
nipkow
parents: 24476
diff changeset
   673
 "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
   674
 ==> (xs@us = ys@vs) = (xs=ys \<and> us=vs)"
24526
7fa202789bf6 tuned lemma; replaced !! by arbitrary
nipkow
parents: 24476
diff changeset
   675
apply (induct xs arbitrary: ys)
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   676
 apply (case_tac ys, simp, force)
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   677
apply (case_tac ys, force, simp)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   678
done
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   679
24526
7fa202789bf6 tuned lemma; replaced !! by arbitrary
nipkow
parents: 24476
diff changeset
   680
lemma append_eq_append_conv2: "(xs @ ys = zs @ ts) =
7fa202789bf6 tuned lemma; replaced !! by arbitrary
nipkow
parents: 24476
diff changeset
   681
  (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
   682
apply (induct xs arbitrary: ys zs ts)
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 44635
diff changeset
   683
 apply fastforce
14495
e2a1c31cf6d3 Added append_eq_append_conv2
nipkow
parents: 14402
diff changeset
   684
apply(case_tac zs)
e2a1c31cf6d3 Added append_eq_append_conv2
nipkow
parents: 14402
diff changeset
   685
 apply simp
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 44635
diff changeset
   686
apply fastforce
14495
e2a1c31cf6d3 Added append_eq_append_conv2
nipkow
parents: 14402
diff changeset
   687
done
e2a1c31cf6d3 Added append_eq_append_conv2
nipkow
parents: 14402
diff changeset
   688
34910
b23bd3ee4813 same_append_eq / append_same_eq are now used for simplifying induction rules.
berghofe
parents: 34064
diff changeset
   689
lemma same_append_eq [iff, induct_simp]: "(xs @ ys = xs @ zs) = (ys = zs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   690
by simp
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   691
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   692
lemma append1_eq_conv [iff]: "(xs @ [x] = ys @ [y]) = (xs = ys \<and> x = y)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   693
by simp
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   694
34910
b23bd3ee4813 same_append_eq / append_same_eq are now used for simplifying induction rules.
berghofe
parents: 34064
diff changeset
   695
lemma append_same_eq [iff, induct_simp]: "(ys @ xs = zs @ xs) = (ys = zs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   696
by simp
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   697
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   698
lemma append_self_conv2 [iff]: "(xs @ ys = ys) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   699
using append_same_eq [of _ _ "[]"] by auto
3507
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   700
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   701
lemma self_append_conv2 [iff]: "(ys = xs @ ys) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   702
using append_same_eq [of "[]"] by auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   703
35828
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35827
diff changeset
   704
lemma hd_Cons_tl [simp,no_atp]: "xs \<noteq> [] ==> hd xs # tl xs = xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   705
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   706
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   707
lemma hd_append: "hd (xs @ ys) = (if xs = [] then hd ys else hd xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   708
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   709
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   710
lemma hd_append2 [simp]: "xs \<noteq> [] ==> hd (xs @ ys) = hd xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   711
by (simp add: hd_append split: list.split)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   712
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   713
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
   714
by (simp split: list.split)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   715
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   716
lemma tl_append2 [simp]: "xs \<noteq> [] ==> tl (xs @ ys) = tl xs @ ys"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   717
by (simp add: tl_append split: list.split)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   718
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   719
14300
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
   720
lemma Cons_eq_append_conv: "x#xs = ys@zs =
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
   721
 (ys = [] & x#xs = zs | (EX ys'. x#ys' = ys & xs = ys'@zs))"
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
   722
by(cases ys) auto
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
   723
15281
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   724
lemma append_eq_Cons_conv: "(ys@zs = x#xs) =
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   725
 (ys = [] & zs = x#xs | (EX ys'. ys = x#ys' & ys'@zs = xs))"
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   726
by(cases ys) auto
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   727
14300
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
   728
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   729
text {* Trivial rules for solving @{text "@"}-equations automatically. *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   730
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   731
lemma eq_Nil_appendI: "xs = ys ==> xs = [] @ ys"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   732
by simp
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   733
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   734
lemma Cons_eq_appendI:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   735
"[| x # xs1 = ys; xs = xs1 @ zs |] ==> x # xs = ys @ zs"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   736
by (drule sym) simp
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   737
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   738
lemma append_eq_appendI:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   739
"[| xs @ xs1 = zs; ys = xs1 @ us |] ==> xs @ ys = zs @ us"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   740
by (drule sym) simp
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   741
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   742
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   743
text {*
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   744
Simplification procedure for all list equalities.
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   745
Currently only tries to rearrange @{text "@"} to see if
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   746
- both lists end in a singleton list,
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   747
- or both lists end in the same list.
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   748
*}
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   749
43594
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   750
simproc_setup list_eq ("(xs::'a list) = ys")  = {*
13462
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   751
  let
43594
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   752
    fun last (cons as Const (@{const_name Cons}, _) $ _ $ xs) =
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   753
          (case xs of Const (@{const_name Nil}, _) => cons | _ => last xs)
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   754
      | last (Const(@{const_name append},_) $ _ $ ys) = last ys
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   755
      | last t = t;
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   756
    
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   757
    fun list1 (Const(@{const_name Cons},_) $ _ $ Const(@{const_name Nil},_)) = true
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   758
      | list1 _ = false;
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   759
    
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   760
    fun butlast ((cons as Const(@{const_name Cons},_) $ x) $ xs) =
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   761
          (case xs of Const (@{const_name Nil}, _) => xs | _ => cons $ butlast xs)
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   762
      | butlast ((app as Const (@{const_name append}, _) $ xs) $ ys) = app $ butlast ys
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   763
      | butlast xs = Const(@{const_name Nil}, fastype_of xs);
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   764
    
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   765
    val rearr_ss =
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   766
      HOL_basic_ss addsimps [@{thm append_assoc}, @{thm append_Nil}, @{thm append_Cons}];
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   767
    
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   768
    fun list_eq ss (F as (eq as Const(_,eqT)) $ lhs $ rhs) =
13462
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
   769
      let
43594
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   770
        val lastl = last lhs and lastr = last rhs;
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   771
        fun rearr conv =
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   772
          let
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   773
            val lhs1 = butlast lhs and rhs1 = butlast rhs;
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   774
            val Type(_,listT::_) = eqT
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   775
            val appT = [listT,listT] ---> listT
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   776
            val app = Const(@{const_name append},appT)
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   777
            val F2 = eq $ (app$lhs1$lastl) $ (app$rhs1$lastr)
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   778
            val eq = HOLogic.mk_Trueprop (HOLogic.mk_eq (F,F2));
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   779
            val thm = Goal.prove (Simplifier.the_context ss) [] [] eq
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   780
              (K (simp_tac (Simplifier.inherit_context ss rearr_ss) 1));
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   781
          in SOME ((conv RS (thm RS trans)) RS eq_reflection) end;
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   782
      in
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   783
        if list1 lastl andalso list1 lastr then rearr @{thm append1_eq_conv}
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   784
        else if lastl aconv lastr then rearr @{thm append_same_eq}
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   785
        else NONE
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   786
      end;
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
   787
  in fn _ => fn ss => fn ct => list_eq ss (term_of ct) end;
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   788
*}
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   789
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   790
15392
290bc97038c7 First step in reorganizing Finite_Set
nipkow
parents: 15307
diff changeset
   791
subsubsection {* @{text map} *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   792
40210
aee7ef725330 sorting: avoid _key suffix if lemma applies both to simple and generalized variant; generalized insort_insert to insort_insert_key; additional lemmas
haftmann
parents: 40195
diff changeset
   793
lemma hd_map:
aee7ef725330 sorting: avoid _key suffix if lemma applies both to simple and generalized variant; generalized insort_insert to insort_insert_key; additional lemmas
haftmann
parents: 40195
diff changeset
   794
  "xs \<noteq> [] \<Longrightarrow> hd (map f xs) = f (hd xs)"
aee7ef725330 sorting: avoid _key suffix if lemma applies both to simple and generalized variant; generalized insort_insert to insort_insert_key; additional lemmas
haftmann
parents: 40195
diff changeset
   795
  by (cases xs) simp_all
aee7ef725330 sorting: avoid _key suffix if lemma applies both to simple and generalized variant; generalized insort_insert to insort_insert_key; additional lemmas
haftmann
parents: 40195
diff changeset
   796
aee7ef725330 sorting: avoid _key suffix if lemma applies both to simple and generalized variant; generalized insort_insert to insort_insert_key; additional lemmas
haftmann
parents: 40195
diff changeset
   797
lemma map_tl:
aee7ef725330 sorting: avoid _key suffix if lemma applies both to simple and generalized variant; generalized insort_insert to insort_insert_key; additional lemmas
haftmann
parents: 40195
diff changeset
   798
  "map f (tl xs) = tl (map f xs)"
aee7ef725330 sorting: avoid _key suffix if lemma applies both to simple and generalized variant; generalized insort_insert to insort_insert_key; additional lemmas
haftmann
parents: 40195
diff changeset
   799
  by (cases xs) simp_all
aee7ef725330 sorting: avoid _key suffix if lemma applies both to simple and generalized variant; generalized insort_insert to insort_insert_key; additional lemmas
haftmann
parents: 40195
diff changeset
   800
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   801
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
   802
by (induct xs) simp_all
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   803
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   804
lemma map_ident [simp]: "map (\<lambda>x. x) = (\<lambda>xs. xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   805
by (rule ext, induct_tac xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   806
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   807
lemma map_append [simp]: "map f (xs @ ys) = map f xs @ map f ys"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   808
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   809
33639
603320b93668 New list theorems; added map_map to simpset, this is the prefered direction; allow sorting by a key
hoelzl
parents: 33593
diff changeset
   810
lemma map_map [simp]: "map f (map g xs) = map (f \<circ> g) xs"
603320b93668 New list theorems; added map_map to simpset, this is the prefered direction; allow sorting by a key
hoelzl
parents: 33593
diff changeset
   811
by (induct xs) auto
603320b93668 New list theorems; added map_map to simpset, this is the prefered direction; allow sorting by a key
hoelzl
parents: 33593
diff changeset
   812
35208
2b9bce05e84b added lemma
nipkow
parents: 35195
diff changeset
   813
lemma map_comp_map[simp]: "((map f) o (map g)) = map(f o g)"
2b9bce05e84b added lemma
nipkow
parents: 35195
diff changeset
   814
apply(rule ext)
2b9bce05e84b added lemma
nipkow
parents: 35195
diff changeset
   815
apply(simp)
2b9bce05e84b added lemma
nipkow
parents: 35195
diff changeset
   816
done
2b9bce05e84b added lemma
nipkow
parents: 35195
diff changeset
   817
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   818
lemma rev_map: "rev (map f xs) = map f (rev xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   819
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   820
13737
e564c3d2d174 added a few lemmas
nipkow
parents: 13601
diff changeset
   821
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
   822
by (induct xs) auto
e564c3d2d174 added a few lemmas
nipkow
parents: 13601
diff changeset
   823
44013
5cfc1c36ae97 moved recdef package to HOL/Library/Old_Recdef.thy
krauss
parents: 43594
diff changeset
   824
lemma map_cong [fundef_cong]:
40122
1d8ad2ff3e01 dropped (almost) redundant distinct.induct rule; distinct_simps again named distinct.simps
haftmann
parents: 40077
diff changeset
   825
  "xs = ys \<Longrightarrow> (\<And>x. x \<in> set ys \<Longrightarrow> f x = g x) \<Longrightarrow> map f xs = map g ys"
1d8ad2ff3e01 dropped (almost) redundant distinct.induct rule; distinct_simps again named distinct.simps
haftmann
parents: 40077
diff changeset
   826
  by simp
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   827
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   828
lemma map_is_Nil_conv [iff]: "(map f xs = []) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   829
by (cases xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   830
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   831
lemma Nil_is_map_conv [iff]: "([] = map f xs) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   832
by (cases xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   833
18447
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
   834
lemma map_eq_Cons_conv:
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   835
 "(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
   836
by (cases xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   837
18447
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
   838
lemma Cons_eq_map_conv:
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   839
 "(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
   840
by (cases ys) auto
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   841
18447
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
   842
lemmas map_eq_Cons_D = map_eq_Cons_conv [THEN iffD1]
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
   843
lemmas Cons_eq_map_D = Cons_eq_map_conv [THEN iffD1]
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
   844
declare map_eq_Cons_D [dest!]  Cons_eq_map_D [dest!]
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
   845
14111
993471c762b8 Some new thm (ex_map_conv?)
nipkow
parents: 14099
diff changeset
   846
lemma ex_map_conv:
993471c762b8 Some new thm (ex_map_conv?)
nipkow
parents: 14099
diff changeset
   847
  "(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
   848
by(induct ys, auto simp add: Cons_eq_map_conv)
14111
993471c762b8 Some new thm (ex_map_conv?)
nipkow
parents: 14099
diff changeset
   849
15110
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   850
lemma map_eq_imp_length_eq:
35510
64d2d54cbf03 Slightly generalised a theorem
paulson
parents: 35296
diff changeset
   851
  assumes "map f xs = map g ys"
26734
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
   852
  shows "length xs = length ys"
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
   853
using assms proof (induct ys arbitrary: xs)
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
   854
  case Nil then show ?case by simp
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
   855
next
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
   856
  case (Cons y ys) then obtain z zs where xs: "xs = z # zs" by auto
35510
64d2d54cbf03 Slightly generalised a theorem
paulson
parents: 35296
diff changeset
   857
  from Cons xs have "map f zs = map g ys" by simp
26734
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
   858
  moreover with Cons have "length zs = length ys" by blast
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
   859
  with xs show ?case by simp
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
   860
qed
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
   861
  
15110
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   862
lemma map_inj_on:
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   863
 "[| 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
   864
  ==> xs = ys"
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   865
apply(frule map_eq_imp_length_eq)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   866
apply(rotate_tac -1)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   867
apply(induct rule:list_induct2)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   868
 apply simp
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   869
apply(simp)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   870
apply (blast intro:sym)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   871
done
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   872
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   873
lemma inj_on_map_eq_map:
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   874
 "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
   875
by(blast dest:map_inj_on)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   876
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   877
lemma map_injective:
24526
7fa202789bf6 tuned lemma; replaced !! by arbitrary
nipkow
parents: 24476
diff changeset
   878
 "map f xs = map f ys ==> inj f ==> xs = ys"
7fa202789bf6 tuned lemma; replaced !! by arbitrary
nipkow
parents: 24476
diff changeset
   879
by (induct ys arbitrary: xs) (auto dest!:injD)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   880
14339
ec575b7bde7a *** empty log message ***
nipkow
parents: 14338
diff changeset
   881
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
   882
by(blast dest:map_injective)
ec575b7bde7a *** empty log message ***
nipkow
parents: 14338
diff changeset
   883
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   884
lemma inj_mapI: "inj f ==> inj (map f)"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17501
diff changeset
   885
by (iprover dest: map_injective injD intro: inj_onI)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   886
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   887
lemma inj_mapD: "inj (map f) ==> inj f"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   888
apply (unfold inj_on_def, clarify)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   889
apply (erule_tac x = "[x]" in ballE)
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   890
 apply (erule_tac x = "[y]" in ballE, simp, blast)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   891
apply blast
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   892
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   893
14339
ec575b7bde7a *** empty log message ***
nipkow
parents: 14338
diff changeset
   894
lemma inj_map[iff]: "inj (map f) = inj f"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   895
by (blast dest: inj_mapD intro: inj_mapI)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   896
15303
eedbb8d22ca2 added lemmas
nipkow
parents: 15302
diff changeset
   897
lemma inj_on_mapI: "inj_on f (\<Union>(set ` A)) \<Longrightarrow> inj_on (map f) A"
eedbb8d22ca2 added lemmas
nipkow
parents: 15302
diff changeset
   898
apply(rule inj_onI)
eedbb8d22ca2 added lemmas
nipkow
parents: 15302
diff changeset
   899
apply(erule map_inj_on)
eedbb8d22ca2 added lemmas
nipkow
parents: 15302
diff changeset
   900
apply(blast intro:inj_onI dest:inj_onD)
eedbb8d22ca2 added lemmas
nipkow
parents: 15302
diff changeset
   901
done
eedbb8d22ca2 added lemmas
nipkow
parents: 15302
diff changeset
   902
14343
6bc647f472b9 map_idI
kleing
parents: 14339
diff changeset
   903
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
   904
by (induct xs, auto)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   905
14402
4201e1916482 moved lemmas from MicroJava/Comp/AuxLemmas.thy to List.thy
nipkow
parents: 14395
diff changeset
   906
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
   907
by (induct xs) auto
4201e1916482 moved lemmas from MicroJava/Comp/AuxLemmas.thy to List.thy
nipkow
parents: 14395
diff changeset
   908
15110
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   909
lemma map_fst_zip[simp]:
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   910
  "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
   911
by (induct rule:list_induct2, simp_all)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   912
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   913
lemma map_snd_zip[simp]:
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   914
  "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
   915
by (induct rule:list_induct2, simp_all)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   916
41505
6d19301074cf "enriched_type" replaces less specific "type_lifting"
haftmann
parents: 41463
diff changeset
   917
enriched_type map: map
47122
790fb5eb5969 Functions and lemmas by Christian Sternagel
nipkow
parents: 47108
diff changeset
   918
by (simp_all add: id_def)
790fb5eb5969 Functions and lemmas by Christian Sternagel
nipkow
parents: 47108
diff changeset
   919
790fb5eb5969 Functions and lemmas by Christian Sternagel
nipkow
parents: 47108
diff changeset
   920
declare map.id[simp]
15110
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
   921
15392
290bc97038c7 First step in reorganizing Finite_Set
nipkow
parents: 15307
diff changeset
   922
subsubsection {* @{text rev} *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   923
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   924
lemma rev_append [simp]: "rev (xs @ ys) = rev ys @ rev xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   925
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   926
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   927
lemma rev_rev_ident [simp]: "rev (rev xs) = xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   928
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   929
15870
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
   930
lemma rev_swap: "(rev xs = ys) = (xs = rev ys)"
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
   931
by auto
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
   932
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   933
lemma rev_is_Nil_conv [iff]: "(rev xs = []) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   934
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   935
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   936
lemma Nil_is_rev_conv [iff]: "([] = rev xs) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   937
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   938
15870
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
   939
lemma rev_singleton_conv [simp]: "(rev xs = [x]) = (xs = [x])"
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
   940
by (cases xs) auto
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
   941
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
   942
lemma singleton_rev_conv [simp]: "([x] = rev xs) = (xs = [x])"
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
   943
by (cases xs) auto
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
   944
46439
2388be11cb50 removed fact that confuses SPASS -- better rely on "rev_rev_ident", which is stronger and more ATP friendly
blanchet
parents: 46424
diff changeset
   945
lemma rev_is_rev_conv [iff, no_atp]: "(rev xs = rev ys) = (xs = ys)"
21061
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   946
apply (induct xs arbitrary: ys, force)
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   947
apply (case_tac ys, simp, force)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   948
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   949
15439
71c0f98e31f1 made diff_less a simp rule
nipkow
parents: 15426
diff changeset
   950
lemma inj_on_rev[iff]: "inj_on rev A"
71c0f98e31f1 made diff_less a simp rule
nipkow
parents: 15426
diff changeset
   951
by(simp add:inj_on_def)
71c0f98e31f1 made diff_less a simp rule
nipkow
parents: 15426
diff changeset
   952
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   953
lemma rev_induct [case_names Nil snoc]:
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   954
  "[| 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
   955
apply(simplesubst rev_rev_ident[symmetric])
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   956
apply(rule_tac list = "rev xs" in list.induct, simp_all)
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   957
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   958
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   959
lemma rev_exhaust [case_names Nil snoc]:
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   960
  "(xs = [] ==> P) ==>(!!ys y. xs = ys @ [y] ==> P) ==> P"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   961
by (induct xs rule: rev_induct) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   962
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   963
lemmas rev_cases = rev_exhaust
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   964
18423
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
   965
lemma rev_eq_Cons_iff[iff]: "(rev xs = y#ys) = (xs = rev ys @ [y])"
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
   966
by(rule rev_cases[of xs]) auto
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
   967
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   968
15392
290bc97038c7 First step in reorganizing Finite_Set
nipkow
parents: 15307
diff changeset
   969
subsubsection {* @{text set} *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   970
46698
f1dfcf8be88d converting "set [...]" to "{...}" in evaluation results
nipkow
parents: 46669
diff changeset
   971
declare set.simps [code_post]  --"pretty output"
f1dfcf8be88d converting "set [...]" to "{...}" in evaluation results
nipkow
parents: 46669
diff changeset
   972
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   973
lemma finite_set [iff]: "finite (set xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   974
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   975
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   976
lemma set_append [simp]: "set (xs @ ys) = (set xs \<union> set ys)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   977
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   978
17830
695a2365d32f added hd lemma
nipkow
parents: 17765
diff changeset
   979
lemma hd_in_set[simp]: "xs \<noteq> [] \<Longrightarrow> hd xs : set xs"
695a2365d32f added hd lemma
nipkow
parents: 17765
diff changeset
   980
by(cases xs) auto
14099
55d244f3c86d added fold_red, o2l, postfix, some thms
oheimb
parents: 14050
diff changeset
   981
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   982
lemma set_subset_Cons: "set xs \<subseteq> set (x # xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   983
by auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   984
14099
55d244f3c86d added fold_red, o2l, postfix, some thms
oheimb
parents: 14050
diff changeset
   985
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
   986
by auto
55d244f3c86d added fold_red, o2l, postfix, some thms
oheimb
parents: 14050
diff changeset
   987
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   988
lemma set_empty [iff]: "(set xs = {}) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   989
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   990
15245
5a21d9a8f14b Added a few lemmas
nipkow
parents: 15236
diff changeset
   991
lemma set_empty2[iff]: "({} = set xs) = (xs = [])"
5a21d9a8f14b Added a few lemmas
nipkow
parents: 15236
diff changeset
   992
by(induct xs) auto
5a21d9a8f14b Added a few lemmas
nipkow
parents: 15236
diff changeset
   993
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   994
lemma set_rev [simp]: "set (rev xs) = set xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   995
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   996
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   997
lemma set_map [simp]: "set (map f xs) = f`(set xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   998
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   999
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1000
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
  1001
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1002
32417
e87d9c78910c tuned code generation for lists
nipkow
parents: 32415
diff changeset
  1003
lemma set_upt [simp]: "set[i..<j] = {i..<j}"
41463
edbf0a86fb1c adding simproc to rewrite list comprehensions to set comprehensions; adopting proofs
bulwahn
parents: 41372
diff changeset
  1004
by (induct j) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1005
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1006
25221
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
  1007
lemma split_list: "x : set xs \<Longrightarrow> \<exists>ys zs. xs = ys @ x # zs"
18049
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
  1008
proof (induct xs)
26073
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1009
  case Nil thus ?case by simp
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1010
next
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1011
  case Cons thus ?case by (auto intro: Cons_eq_appendI)
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1012
qed
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1013
26734
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1014
lemma in_set_conv_decomp: "x \<in> set xs \<longleftrightarrow> (\<exists>ys zs. xs = ys @ x # zs)"
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1015
  by (auto elim: split_list)
26073
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1016
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1017
lemma split_list_first: "x : set xs \<Longrightarrow> \<exists>ys zs. xs = ys @ x # zs \<and> x \<notin> set ys"
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1018
proof (induct xs)
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1019
  case Nil thus ?case by simp
18049
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
  1020
next
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
  1021
  case (Cons a xs)
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
  1022
  show ?case
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
  1023
  proof cases
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 44635
diff changeset
  1024
    assume "x = a" thus ?case using Cons by fastforce
18049
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
  1025
  next
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 44635
diff changeset
  1026
    assume "x \<noteq> a" thus ?case using Cons by(fastforce intro!: Cons_eq_appendI)
26073
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1027
  qed
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1028
qed
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1029
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1030
lemma in_set_conv_decomp_first:
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1031
  "(x : set xs) = (\<exists>ys zs. xs = ys @ x # zs \<and> x \<notin> set ys)"
26734
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1032
  by (auto dest!: split_list_first)
26073
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1033
40122
1d8ad2ff3e01 dropped (almost) redundant distinct.induct rule; distinct_simps again named distinct.simps
haftmann
parents: 40077
diff changeset
  1034
lemma split_list_last: "x \<in> set xs \<Longrightarrow> \<exists>ys zs. xs = ys @ x # zs \<and> x \<notin> set zs"
1d8ad2ff3e01 dropped (almost) redundant distinct.induct rule; distinct_simps again named distinct.simps
haftmann
parents: 40077
diff changeset
  1035
proof (induct xs rule: rev_induct)
26073
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1036
  case Nil thus ?case by simp
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1037
next
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1038
  case (snoc a xs)
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1039
  show ?case
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1040
  proof cases
40122
1d8ad2ff3e01 dropped (almost) redundant distinct.induct rule; distinct_simps again named distinct.simps
haftmann
parents: 40077
diff changeset
  1041
    assume "x = a" thus ?case using snoc by (metis List.set.simps(1) emptyE)
26073
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1042
  next
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 44635
diff changeset
  1043
    assume "x \<noteq> a" thus ?case using snoc by fastforce
18049
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
  1044
  qed
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
  1045
qed
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
  1046
26073
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1047
lemma in_set_conv_decomp_last:
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1048
  "(x : set xs) = (\<exists>ys zs. xs = ys @ x # zs \<and> x \<notin> set zs)"
26734
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1049
  by (auto dest!: split_list_last)
26073
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1050
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1051
lemma split_list_prop: "\<exists>x \<in> set xs. P x \<Longrightarrow> \<exists>ys x zs. xs = ys @ x # zs & P x"
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1052
proof (induct xs)
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1053
  case Nil thus ?case by simp
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1054
next
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1055
  case Cons thus ?case
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1056
    by(simp add:Bex_def)(metis append_Cons append.simps(1))
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1057
qed
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1058
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1059
lemma split_list_propE:
26734
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1060
  assumes "\<exists>x \<in> set xs. P x"
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1061
  obtains ys x zs where "xs = ys @ x # zs" and "P x"
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1062
using split_list_prop [OF assms] by blast
26073
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1063
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1064
lemma split_list_first_prop:
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1065
  "\<exists>x \<in> set xs. P x \<Longrightarrow>
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1066
   \<exists>ys x zs. xs = ys@x#zs \<and> P x \<and> (\<forall>y \<in> set ys. \<not> P y)"
26734
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1067
proof (induct xs)
26073
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1068
  case Nil thus ?case by simp
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1069
next
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1070
  case (Cons x xs)
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1071
  show ?case
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1072
  proof cases
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1073
    assume "P x"
40122
1d8ad2ff3e01 dropped (almost) redundant distinct.induct rule; distinct_simps again named distinct.simps
haftmann
parents: 40077
diff changeset
  1074
    thus ?thesis by simp (metis Un_upper1 contra_subsetD in_set_conv_decomp_first self_append_conv2 set_append)
26073
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1075
  next
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1076
    assume "\<not> P x"
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1077
    hence "\<exists>x\<in>set xs. P x" using Cons(2) by simp
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1078
    thus ?thesis using `\<not> P x` Cons(1) by (metis append_Cons set_ConsD)
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1079
  qed
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1080
qed
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1081
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1082
lemma split_list_first_propE:
26734
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1083
  assumes "\<exists>x \<in> set xs. P x"
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1084
  obtains ys x zs where "xs = ys @ x # zs" and "P x" and "\<forall>y \<in> set ys. \<not> P y"
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1085
using split_list_first_prop [OF assms] by blast
26073
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1086
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1087
lemma split_list_first_prop_iff:
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1088
  "(\<exists>x \<in> set xs. P x) \<longleftrightarrow>
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1089
   (\<exists>ys x zs. xs = ys@x#zs \<and> P x \<and> (\<forall>y \<in> set ys. \<not> P y))"
26734
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1090
by (rule, erule split_list_first_prop) auto
26073
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1091
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1092
lemma split_list_last_prop:
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1093
  "\<exists>x \<in> set xs. P x \<Longrightarrow>
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1094
   \<exists>ys x zs. xs = ys@x#zs \<and> P x \<and> (\<forall>z \<in> set zs. \<not> P z)"
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1095
proof(induct xs rule:rev_induct)
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1096
  case Nil thus ?case by simp
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1097
next
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1098
  case (snoc x xs)
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1099
  show ?case
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1100
  proof cases
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1101
    assume "P x" thus ?thesis by (metis emptyE set_empty)
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1102
  next
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1103
    assume "\<not> P x"
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1104
    hence "\<exists>x\<in>set xs. P x" using snoc(2) by simp
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 44635
diff changeset
  1105
    thus ?thesis using `\<not> P x` snoc(1) by fastforce
26073
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1106
  qed
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1107
qed
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1108
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1109
lemma split_list_last_propE:
26734
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1110
  assumes "\<exists>x \<in> set xs. P x"
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1111
  obtains ys x zs where "xs = ys @ x # zs" and "P x" and "\<forall>z \<in> set zs. \<not> P z"
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1112
using split_list_last_prop [OF assms] by blast
26073
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1113
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1114
lemma split_list_last_prop_iff:
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1115
  "(\<exists>x \<in> set xs. P x) \<longleftrightarrow>
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1116
   (\<exists>ys x zs. xs = ys@x#zs \<and> P x \<and> (\<forall>z \<in> set zs. \<not> P z))"
26734
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1117
by (metis split_list_last_prop [where P=P] in_set_conv_decomp)
26073
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1118
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1119
lemma finite_list: "finite A ==> EX xs. set xs = A"
26734
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1120
  by (erule finite_induct)
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1121
    (auto simp add: set.simps(2) [symmetric] simp del: set.simps(2))
13508
890d736b93a5 Frederic Blanqui's new "guard" examples
paulson
parents: 13480
diff changeset
  1122
14388
04f04408b99b lemmas about card (set xs)
kleing
parents: 14343
diff changeset
  1123
lemma card_length: "card (set xs) \<le> length xs"
04f04408b99b lemmas about card (set xs)
kleing
parents: 14343
diff changeset
  1124
by (induct xs) (auto simp add: card_insert_if)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1125
26442
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1126
lemma set_minus_filter_out:
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1127
  "set xs - {y} = set (filter (\<lambda>x. \<not> (x = y)) xs)"
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1128
  by (induct xs) auto
15168
33a08cfc3ae5 new functions for sets of lists
paulson
parents: 15140
diff changeset
  1129
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35028
diff changeset
  1130
15392
290bc97038c7 First step in reorganizing Finite_Set
nipkow
parents: 15307
diff changeset
  1131
subsubsection {* @{text filter} *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1132
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1133
lemma filter_append [simp]: "filter P (xs @ ys) = filter P xs @ filter P ys"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1134
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1135
15305
0bd9eedaa301 added lemmas
nipkow
parents: 15304
diff changeset
  1136
lemma rev_filter: "rev (filter P xs) = filter P (rev xs)"
0bd9eedaa301 added lemmas
nipkow
parents: 15304
diff changeset
  1137
by (induct xs) simp_all
0bd9eedaa301 added lemmas
nipkow
parents: 15304
diff changeset
  1138
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1139
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
  1140
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1141
16998
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
  1142
lemma length_filter_le [simp]: "length (filter P xs) \<le> length xs"
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
  1143
by (induct xs) (auto simp add: le_SucI)
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
  1144
18423
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
  1145
lemma sum_length_filter_compl:
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
  1146
  "length(filter P xs) + length(filter (%x. ~P x) xs) = length xs"
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
  1147
by(induct xs) simp_all
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
  1148
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1149
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
  1150
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1151
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1152
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
  1153
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1154
16998
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
  1155
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
  1156
by (induct xs) simp_all
16998
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
  1157
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
  1158
lemma filter_id_conv: "(filter P xs = xs) = (\<forall>x\<in>set xs. P x)"
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
  1159
apply (induct xs)
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
  1160
 apply auto
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
  1161
apply(cut_tac P=P and xs=xs in length_filter_le)
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
  1162
apply simp
e0050191e2d1 Added filter lemma
nipkow
parents: 16973
diff changeset
  1163
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1164
16965
46697fa536ab added map_filter lemmas
nipkow
parents: 16770
diff changeset
  1165
lemma filter_map:
46697fa536ab added map_filter lemmas
nipkow
parents: 16770
diff changeset
  1166
  "filter P (map f xs) = map f (filter (P o f) xs)"
46697fa536ab added map_filter lemmas
nipkow
parents: 16770
diff changeset
  1167
by (induct xs) simp_all
46697fa536ab added map_filter lemmas
nipkow
parents: 16770
diff changeset
  1168
46697fa536ab added map_filter lemmas
nipkow
parents: 16770
diff changeset
  1169
lemma length_filter_map[simp]:
46697fa536ab added map_filter lemmas
nipkow
parents: 16770
diff changeset
  1170
  "length (filter P (map f xs)) = length(filter (P o f) xs)"
46697fa536ab added map_filter lemmas
nipkow
parents: 16770
diff changeset
  1171
by (simp add:filter_map)
46697fa536ab added map_filter lemmas
nipkow
parents: 16770
diff changeset
  1172
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1173
lemma filter_is_subset [simp]: "set (filter P xs) \<le> set xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1174
by auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1175
15246
0984a2c2868b added and renamed
nipkow
parents: 15245
diff changeset
  1176
lemma length_filter_less:
0984a2c2868b added and renamed
nipkow
parents: 15245
diff changeset
  1177
  "\<lbrakk> x : set xs; ~ P x \<rbrakk> \<Longrightarrow> length(filter P xs) < length xs"
0984a2c2868b added and renamed
nipkow
parents: 15245
diff changeset
  1178
proof (induct xs)
0984a2c2868b added and renamed
nipkow
parents: 15245
diff changeset
  1179
  case Nil thus ?case by simp
0984a2c2868b added and renamed
nipkow
parents: 15245
diff changeset
  1180
next
0984a2c2868b added and renamed
nipkow
parents: 15245
diff changeset
  1181
  case (Cons x xs) thus ?case
0984a2c2868b added and renamed
nipkow
parents: 15245
diff changeset
  1182
    apply (auto split:split_if_asm)
0984a2c2868b added and renamed
nipkow
parents: 15245
diff changeset
  1183
    using length_filter_le[of P xs] apply arith
0984a2c2868b added and renamed
nipkow
parents: 15245
diff changeset
  1184
  done
0984a2c2868b added and renamed
nipkow
parents: 15245
diff changeset
  1185
qed
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1186
15281
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1187
lemma length_filter_conv_card:
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1188
 "length(filter p xs) = card{i. i < length xs & p(xs!i)}"
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1189
proof (induct xs)
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1190
  case Nil thus ?case by simp
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1191
next
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1192
  case (Cons x xs)
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1193
  let ?S = "{i. i < length xs & p(xs!i)}"
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1194
  have fin: "finite ?S" by(fast intro: bounded_nat_set_is_finite)
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1195
  show ?case (is "?l = card ?S'")
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1196
  proof (cases)
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1197
    assume "p x"
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1198
    hence eq: "?S' = insert 0 (Suc ` ?S)"
25162
ad4d5365d9d8 went back to >0
nipkow
parents: 25157
diff changeset
  1199
      by(auto simp: image_def split:nat.split dest:gr0_implies_Suc)
15281
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1200
    have "length (filter p (x # xs)) = Suc(card ?S)"
23388
77645da0db85 tuned proofs: avoid implicit prems;
wenzelm
parents: 23279
diff changeset
  1201
      using Cons `p x` by simp
15281
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1202
    also have "\<dots> = Suc(card(Suc ` ?S))" using fin
44921
58eef4843641 tuned proofs
huffman
parents: 44916
diff changeset
  1203
      by (simp add: card_image)
15281
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1204
    also have "\<dots> = card ?S'" using eq fin
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1205
      by (simp add:card_insert_if) (simp add:image_def)
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1206
    finally show ?thesis .
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1207
  next
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1208
    assume "\<not> p x"
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1209
    hence eq: "?S' = Suc ` ?S"
25162
ad4d5365d9d8 went back to >0
nipkow
parents: 25157
diff changeset
  1210
      by(auto simp add: image_def split:nat.split elim:lessE)
15281
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1211
    have "length (filter p (x # xs)) = card ?S"
23388
77645da0db85 tuned proofs: avoid implicit prems;
wenzelm
parents: 23279
diff changeset
  1212
      using Cons `\<not> p x` by simp
15281
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1213
    also have "\<dots> = card(Suc ` ?S)" using fin
44921
58eef4843641 tuned proofs
huffman
parents: 44916
diff changeset
  1214
      by (simp add: card_image)
15281
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1215
    also have "\<dots> = card ?S'" using eq fin
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1216
      by (simp add:card_insert_if)
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1217
    finally show ?thesis .
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1218
  qed
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1219
qed
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1220
17629
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1221
lemma Cons_eq_filterD:
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1222
 "x#xs = filter P ys \<Longrightarrow>
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1223
  \<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
  1224
  (is "_ \<Longrightarrow> \<exists>us vs. ?P ys us vs")
17629
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1225
proof(induct ys)
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1226
  case Nil thus ?case by simp
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1227
next
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1228
  case (Cons y ys)
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1229
  show ?case (is "\<exists>x. ?Q x")
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1230
  proof cases
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1231
    assume Py: "P y"
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1232
    show ?thesis
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1233
    proof cases
25221
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
  1234
      assume "x = y"
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
  1235
      with Py Cons.prems have "?Q []" by simp
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
  1236
      then show ?thesis ..
17629
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1237
    next
25221
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
  1238
      assume "x \<noteq> y"
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
  1239
      with Py Cons.prems show ?thesis by simp
17629
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1240
    qed
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1241
  next
25221
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
  1242
    assume "\<not> P y"
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 44635
diff changeset
  1243
    with Cons obtain us vs where "?P (y#ys) (y#us) vs" by fastforce
25221
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
  1244
    then have "?Q (y#us)" by simp
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
  1245
    then show ?thesis ..
17629
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1246
  qed
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1247
qed
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1248
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1249
lemma filter_eq_ConsD:
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1250
 "filter P ys = x#xs \<Longrightarrow>
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1251
  \<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
  1252
by(rule Cons_eq_filterD) simp
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1253
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1254
lemma filter_eq_Cons_iff:
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1255
 "(filter P ys = x#xs) =
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1256
  (\<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
  1257
by(auto dest:filter_eq_ConsD)
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1258
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1259
lemma Cons_eq_filter_iff:
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1260
 "(x#xs = filter P ys) =
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1261
  (\<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
  1262
by(auto dest:Cons_eq_filterD)
f8ea8068c6d9 a few new filter lemmas
nipkow
parents: 17589
diff changeset
  1263
44013
5cfc1c36ae97 moved recdef package to HOL/Library/Old_Recdef.thy
krauss
parents: 43594
diff changeset
  1264
lemma filter_cong[fundef_cong]:
17501
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1265
 "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
  1266
apply simp
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1267
apply(erule thin_rl)
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1268
by (induct ys) simp_all
acbebb72e85a added a number of lemmas
nipkow
parents: 17090
diff changeset
  1269
15281
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
  1270
26442
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1271
subsubsection {* List partitioning *}
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1272
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1273
primrec partition :: "('a \<Rightarrow> bool) \<Rightarrow>'a list \<Rightarrow> 'a list \<times> 'a list" where
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1274
  "partition P [] = ([], [])"
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1275
  | "partition P (x # xs) = 
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1276
      (let (yes, no) = partition P xs
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1277
      in if P x then (x # yes, no) else (yes, x # no))"
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1278
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1279
lemma partition_filter1:
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1280
    "fst (partition P xs) = filter P xs"
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1281
by (induct xs) (auto simp add: Let_def split_def)
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1282
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1283
lemma partition_filter2:
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1284
    "snd (partition P xs) = filter (Not o P) xs"
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1285
by (induct xs) (auto simp add: Let_def split_def)
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1286
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1287
lemma partition_P:
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1288
  assumes "partition P xs = (yes, no)"
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1289
  shows "(\<forall>p \<in> set yes.  P p) \<and> (\<forall>p  \<in> set no. \<not> P p)"
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1290
proof -
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1291
  from assms have "yes = fst (partition P xs)" and "no = snd (partition P xs)"
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1292
    by simp_all
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1293
  then show ?thesis by (simp_all add: partition_filter1 partition_filter2)
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1294
qed
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1295
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1296
lemma partition_set:
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1297
  assumes "partition P xs = (yes, no)"
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1298
  shows "set yes \<union> set no = set xs"
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1299
proof -
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1300
  from assms have "yes = fst (partition P xs)" and "no = snd (partition P xs)"
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1301
    by simp_all
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1302
  then show ?thesis by (auto simp add: partition_filter1 partition_filter2) 
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1303
qed
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1304
33639
603320b93668 New list theorems; added map_map to simpset, this is the prefered direction; allow sorting by a key
hoelzl
parents: 33593
diff changeset
  1305
lemma partition_filter_conv[simp]:
603320b93668 New list theorems; added map_map to simpset, this is the prefered direction; allow sorting by a key
hoelzl
parents: 33593
diff changeset
  1306
  "partition f xs = (filter f xs,filter (Not o f) xs)"
603320b93668 New list theorems; added map_map to simpset, this is the prefered direction; allow sorting by a key
hoelzl
parents: 33593
diff changeset
  1307
unfolding partition_filter2[symmetric]
603320b93668 New list theorems; added map_map to simpset, this is the prefered direction; allow sorting by a key
hoelzl
parents: 33593
diff changeset
  1308
unfolding partition_filter1[symmetric] by simp
603320b93668 New list theorems; added map_map to simpset, this is the prefered direction; allow sorting by a key
hoelzl
parents: 33593
diff changeset
  1309
603320b93668 New list theorems; added map_map to simpset, this is the prefered direction; allow sorting by a key
hoelzl
parents: 33593
diff changeset
  1310
declare partition.simps[simp del]
26442
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
  1311
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35028
diff changeset
  1312
15392
290bc97038c7 First step in reorganizing Finite_Set
nipkow
parents: 15307
diff changeset
  1313
subsubsection {* @{text concat} *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1314
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1315
lemma concat_append [simp]: "concat (xs @ ys) = concat xs @ concat ys"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1316
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1317
18447
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
  1318
lemma concat_eq_Nil_conv [simp]: "(concat xss = []) = (\<forall>xs \<in> set xss. xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1319
by (induct xss) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1320
18447
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
  1321
lemma Nil_eq_concat_conv [simp]: "([] = concat xss) = (\<forall>xs \<in> set xss. xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1322
by (induct xss) auto