src/HOL/List.thy
author kuncar
Thu, 10 Apr 2014 17:48:32 +0200
changeset 56525 b5b6ad5dc2ae
parent 56520 3373f5d1e074
child 56527 907f04603177
permissions -rw-r--r--
simplify and fix theories thanks to 356a5efdb278
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
54555
e8c5e95d338b rationalize imports
blanchet
parents: 54498
diff changeset
     8
imports Presburger Code_Numeral Quotient Lifting_Set Lifting_Option Lifting_Product
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
55584
a879f14b6f95 merged 'List.set' with BNF-generated 'set'
blanchet
parents: 55564
diff changeset
    11
datatype_new (set: 'a) list (map: map rel: list_all2) =
55405
0a155051bd9d use new selector support to define 'the', 'hd', 'tl'
blanchet
parents: 55404
diff changeset
    12
    =: Nil (defaults tl: "[]")  ("[]")
0a155051bd9d use new selector support to define 'the', 'hd', 'tl'
blanchet
parents: 55404
diff changeset
    13
  | Cons (hd: 'a) (tl: "'a list")  (infixr "#" 65)
55531
601ca8efa000 renamed 'datatype_new_compat' to 'datatype_compat'
blanchet
parents: 55525
diff changeset
    14
datatype_compat list
55404
5cb95b79a51f transformed 'option' and 'list' into new-style datatypes (but register them as old-style as well)
blanchet
parents: 55148
diff changeset
    15
55406
186076d100d3 compatibility names
blanchet
parents: 55405
diff changeset
    16
lemma [case_names Nil Cons, cases type: list]:
186076d100d3 compatibility names
blanchet
parents: 55405
diff changeset
    17
  -- {* for backward compatibility -- names of variables differ *}
186076d100d3 compatibility names
blanchet
parents: 55405
diff changeset
    18
  "(y = [] \<Longrightarrow> P) \<Longrightarrow> (\<And>a list. y = a # list \<Longrightarrow> P) \<Longrightarrow> P"
186076d100d3 compatibility names
blanchet
parents: 55405
diff changeset
    19
by (rule list.exhaust)
186076d100d3 compatibility names
blanchet
parents: 55405
diff changeset
    20
186076d100d3 compatibility names
blanchet
parents: 55405
diff changeset
    21
lemma [case_names Nil Cons, induct type: list]:
186076d100d3 compatibility names
blanchet
parents: 55405
diff changeset
    22
  -- {* for backward compatibility -- names of variables differ *}
186076d100d3 compatibility names
blanchet
parents: 55405
diff changeset
    23
  "P [] \<Longrightarrow> (\<And>a list. P list \<Longrightarrow> P (a # list)) \<Longrightarrow> P list"
186076d100d3 compatibility names
blanchet
parents: 55405
diff changeset
    24
by (rule list.induct)
186076d100d3 compatibility names
blanchet
parents: 55405
diff changeset
    25
55442
blanchet
parents: 55417
diff changeset
    26
text {* Compatibility: *}
blanchet
parents: 55417
diff changeset
    27
55404
5cb95b79a51f transformed 'option' and 'list' into new-style datatypes (but register them as old-style as well)
blanchet
parents: 55148
diff changeset
    28
setup {* Sign.mandatory_path "list" *}
5cb95b79a51f transformed 'option' and 'list' into new-style datatypes (but register them as old-style as well)
blanchet
parents: 55148
diff changeset
    29
5cb95b79a51f transformed 'option' and 'list' into new-style datatypes (but register them as old-style as well)
blanchet
parents: 55148
diff changeset
    30
lemmas inducts = list.induct
5cb95b79a51f transformed 'option' and 'list' into new-style datatypes (but register them as old-style as well)
blanchet
parents: 55148
diff changeset
    31
lemmas recs = list.rec
5cb95b79a51f transformed 'option' and 'list' into new-style datatypes (but register them as old-style as well)
blanchet
parents: 55148
diff changeset
    32
lemmas cases = list.case
5cb95b79a51f transformed 'option' and 'list' into new-style datatypes (but register them as old-style as well)
blanchet
parents: 55148
diff changeset
    33
5cb95b79a51f transformed 'option' and 'list' into new-style datatypes (but register them as old-style as well)
blanchet
parents: 55148
diff changeset
    34
setup {* Sign.parent_path *}
5cb95b79a51f transformed 'option' and 'list' into new-style datatypes (but register them as old-style as well)
blanchet
parents: 55148
diff changeset
    35
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    36
syntax
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    37
  -- {* list Enumeration *}
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35028
diff changeset
    38
  "_list" :: "args => 'a list"    ("[(_)]")
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    39
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    40
translations
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    41
  "[x, xs]" == "x#[xs]"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    42
  "[x]" == "x#[]"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    43
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35028
diff changeset
    44
446c5063e4fd modernized translations;
wenzelm
parents: 35028
diff changeset
    45
subsection {* Basic list processing functions *}
15302
a643fcbc3468 Restructured List and added "rotate"
nipkow
parents: 15281
diff changeset
    46
50548
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    47
primrec last :: "'a list \<Rightarrow> 'a" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    48
"last (x # xs) = (if xs = [] then x else last xs)"
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    49
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    50
primrec butlast :: "'a list \<Rightarrow> 'a list" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    51
"butlast []= []" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    52
"butlast (x # xs) = (if xs = [] then [] else x # butlast xs)"
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    53
55584
a879f14b6f95 merged 'List.set' with BNF-generated 'set'
blanchet
parents: 55564
diff changeset
    54
declare list.set[simp del, code del]
a879f14b6f95 merged 'List.set' with BNF-generated 'set'
blanchet
parents: 55564
diff changeset
    55
a879f14b6f95 merged 'List.set' with BNF-generated 'set'
blanchet
parents: 55564
diff changeset
    56
lemma set_simps[simp, code, code_post]:
a879f14b6f95 merged 'List.set' with BNF-generated 'set'
blanchet
parents: 55564
diff changeset
    57
  "set [] = {}"
a879f14b6f95 merged 'List.set' with BNF-generated 'set'
blanchet
parents: 55564
diff changeset
    58
  "set (x # xs) = insert x (set xs)"
a879f14b6f95 merged 'List.set' with BNF-generated 'set'
blanchet
parents: 55564
diff changeset
    59
by (simp_all add: list.set)
a879f14b6f95 merged 'List.set' with BNF-generated 'set'
blanchet
parents: 55564
diff changeset
    60
a879f14b6f95 merged 'List.set' with BNF-generated 'set'
blanchet
parents: 55564
diff changeset
    61
lemma set_rec: "set xs = rec_list {} (\<lambda>x _. insert x) xs"
a879f14b6f95 merged 'List.set' with BNF-generated 'set'
blanchet
parents: 55564
diff changeset
    62
  by (induct xs) auto
50548
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    63
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    64
definition coset :: "'a list \<Rightarrow> 'a set" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    65
[simp]: "coset xs = - set xs"
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    66
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    67
primrec append :: "'a list \<Rightarrow> 'a list \<Rightarrow> 'a list" (infixr "@" 65) where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    68
append_Nil: "[] @ ys = ys" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    69
append_Cons: "(x#xs) @ ys = x # xs @ ys"
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    70
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    71
primrec rev :: "'a list \<Rightarrow> 'a list" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    72
"rev [] = []" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    73
"rev (x # xs) = rev xs @ [x]"
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    74
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    75
primrec filter:: "('a \<Rightarrow> bool) \<Rightarrow> 'a list \<Rightarrow> 'a list" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    76
"filter P [] = []" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    77
"filter P (x # xs) = (if P x then x # filter P xs else filter P xs)"
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    78
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    79
syntax
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    80
  -- {* Special syntax for filter *}
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35028
diff changeset
    81
  "_filter" :: "[pttrn, 'a list, bool] => 'a list"    ("(1[_<-_./ _])")
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    82
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    83
translations
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    84
  "[x<-xs . P]"== "CONST filter (%x. P) xs"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    85
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    86
syntax (xsymbols)
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35028
diff changeset
    87
  "_filter" :: "[pttrn, 'a list, bool] => 'a list"("(1[_\<leftarrow>_ ./ _])")
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    88
syntax (HTML output)
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35028
diff changeset
    89
  "_filter" :: "[pttrn, 'a list, bool] => 'a list"("(1[_\<leftarrow>_ ./ _])")
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
    90
50548
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    91
primrec fold :: "('a \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'a list \<Rightarrow> 'b \<Rightarrow> 'b" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    92
fold_Nil:  "fold f [] = id" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    93
fold_Cons: "fold f (x # xs) = fold f xs \<circ> f x"
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    94
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    95
primrec foldr :: "('a \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'a list \<Rightarrow> 'b \<Rightarrow> 'b" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    96
foldr_Nil:  "foldr f [] = id" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    97
foldr_Cons: "foldr f (x # xs) = f x \<circ> foldr f xs"
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    98
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
    99
primrec foldl :: "('b \<Rightarrow> 'a \<Rightarrow> 'b) \<Rightarrow> 'b \<Rightarrow> 'a list \<Rightarrow> 'b" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   100
foldl_Nil:  "foldl f a [] = a" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   101
foldl_Cons: "foldl f a (x # xs) = foldl f (f a x) xs"
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   102
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   103
primrec concat:: "'a list list \<Rightarrow> 'a list" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   104
"concat [] = []" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   105
"concat (x # xs) = x @ concat xs"
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   106
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   107
definition (in monoid_add) listsum :: "'a list \<Rightarrow> 'a" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   108
"listsum xs = foldr plus xs 0"
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   109
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   110
primrec drop:: "nat \<Rightarrow> 'a list \<Rightarrow> 'a list" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   111
drop_Nil: "drop n [] = []" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   112
drop_Cons: "drop n (x # xs) = (case n of 0 \<Rightarrow> x # xs | Suc m \<Rightarrow> drop m xs)"
34941
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
50548
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   116
primrec take:: "nat \<Rightarrow> 'a list \<Rightarrow> 'a list" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   117
take_Nil:"take n [] = []" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   118
take_Cons: "take n (x # xs) = (case n of 0 \<Rightarrow> [] | Suc m \<Rightarrow> x # take m xs)"
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   119
  -- {*Warning: simpset does not contain this definition, but separate
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   120
       theorems for @{text "n = 0"} and @{text "n = Suc k"} *}
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   121
50548
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   122
primrec nth :: "'a list => nat => 'a" (infixl "!" 100) where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   123
nth_Cons: "(x # xs) ! n = (case n of 0 \<Rightarrow> x | Suc k \<Rightarrow> xs ! k)"
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   124
  -- {*Warning: simpset does not contain this definition, but separate
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   125
       theorems for @{text "n = 0"} and @{text "n = Suc k"} *}
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   126
50548
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   127
primrec list_update :: "'a list \<Rightarrow> nat \<Rightarrow> 'a \<Rightarrow> 'a list" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   128
"list_update [] i v = []" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   129
"list_update (x # xs) i v =
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   130
  (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
   131
41229
d797baa3d57c replaced command 'nonterminals' by slightly modernized version 'nonterminal';
wenzelm
parents: 41075
diff changeset
   132
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
   133
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   134
syntax
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   135
  "_lupdbind":: "['a, 'a] => lupdbind"    ("(2_ :=/ _)")
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   136
  "" :: "lupdbind => lupdbinds"    ("_")
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   137
  "_lupdbinds" :: "[lupdbind, lupdbinds] => lupdbinds"    ("_,/ _")
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   138
  "_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
   139
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   140
translations
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35028
diff changeset
   141
  "_LUpdate xs (_lupdbinds b bs)" == "_LUpdate (_LUpdate xs b) bs"
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   142
  "xs[i:=x]" == "CONST list_update xs i x"
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   143
50548
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   144
primrec takeWhile :: "('a \<Rightarrow> bool) \<Rightarrow> 'a list \<Rightarrow> 'a list" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   145
"takeWhile P [] = []" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   146
"takeWhile P (x # xs) = (if P x then x # takeWhile P xs else [])"
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   147
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   148
primrec dropWhile :: "('a \<Rightarrow> bool) \<Rightarrow> 'a list \<Rightarrow> 'a list" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   149
"dropWhile P [] = []" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   150
"dropWhile P (x # xs) = (if P x then dropWhile P xs else x # xs)"
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   151
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   152
primrec zip :: "'a list \<Rightarrow> 'b list \<Rightarrow> ('a \<times> 'b) list" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   153
"zip xs [] = []" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   154
zip_Cons: "zip xs (y # ys) =
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   155
  (case xs of [] => [] | z # zs => (z, y) # zip zs ys)"
34941
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   156
  -- {*Warning: simpset does not contain this definition, but separate
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   157
       theorems for @{text "xs = []"} and @{text "xs = z # zs"} *}
156925dd67af dropped some old primrecs and some constdefs
haftmann
parents: 34886
diff changeset
   158
50548
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   159
primrec product :: "'a list \<Rightarrow> 'b list \<Rightarrow> ('a \<times> 'b) list" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   160
"product [] _ = []" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   161
"product (x#xs) ys = map (Pair x) ys @ product xs ys"
49948
744934b818c7 moved quite generic material from theory Enum to more appropriate places
haftmann
parents: 49808
diff changeset
   162
744934b818c7 moved quite generic material from theory Enum to more appropriate places
haftmann
parents: 49808
diff changeset
   163
hide_const (open) product
744934b818c7 moved quite generic material from theory Enum to more appropriate places
haftmann
parents: 49808
diff changeset
   164
53721
ccaceea6c768 added two functions to List (one contributed by Manuel Eberl)
traytel
parents: 53689
diff changeset
   165
primrec product_lists :: "'a list list \<Rightarrow> 'a list list" where
ccaceea6c768 added two functions to List (one contributed by Manuel Eberl)
traytel
parents: 53689
diff changeset
   166
"product_lists [] = [[]]" |
ccaceea6c768 added two functions to List (one contributed by Manuel Eberl)
traytel
parents: 53689
diff changeset
   167
"product_lists (xs # xss) = concat (map (\<lambda>x. map (Cons x) (product_lists xss)) xs)"
ccaceea6c768 added two functions to List (one contributed by Manuel Eberl)
traytel
parents: 53689
diff changeset
   168
50548
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   169
primrec upt :: "nat \<Rightarrow> nat \<Rightarrow> nat list" ("(1[_..</_'])") where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   170
upt_0: "[i..<0] = []" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   171
upt_Suc: "[i..<(Suc j)] = (if i <= j then [i..<j] @ [j] else [])"
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   172
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   173
definition insert :: "'a \<Rightarrow> 'a list \<Rightarrow> 'a list" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   174
"insert x xs = (if x \<in> set xs then xs else x # xs)"
34978
874150ddd50a canonical insert operation; generalized lemma foldl_apply_inv to foldl_apply
haftmann
parents: 34942
diff changeset
   175
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
   176
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
   177
hide_fact (open) insert_def
34978
874150ddd50a canonical insert operation; generalized lemma foldl_apply_inv to foldl_apply
haftmann
parents: 34942
diff changeset
   178
47122
790fb5eb5969 Functions and lemmas by Christian Sternagel
nipkow
parents: 47108
diff changeset
   179
primrec find :: "('a \<Rightarrow> bool) \<Rightarrow> 'a list \<Rightarrow> 'a option" where
50548
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   180
"find _ [] = None" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   181
"find P (x#xs) = (if P x then Some x else find P xs)"
47122
790fb5eb5969 Functions and lemmas by Christian Sternagel
nipkow
parents: 47108
diff changeset
   182
790fb5eb5969 Functions and lemmas by Christian Sternagel
nipkow
parents: 47108
diff changeset
   183
hide_const (open) find
790fb5eb5969 Functions and lemmas by Christian Sternagel
nipkow
parents: 47108
diff changeset
   184
55807
fd31d0e70eb8 added function "List.extract"
nipkow
parents: 55642
diff changeset
   185
definition
fd31d0e70eb8 added function "List.extract"
nipkow
parents: 55642
diff changeset
   186
   "extract" :: "('a \<Rightarrow> bool) \<Rightarrow> 'a list \<Rightarrow> ('a list * 'a * 'a list) option"
fd31d0e70eb8 added function "List.extract"
nipkow
parents: 55642
diff changeset
   187
where "extract P xs =
fd31d0e70eb8 added function "List.extract"
nipkow
parents: 55642
diff changeset
   188
  (case dropWhile (Not o P) xs of
fd31d0e70eb8 added function "List.extract"
nipkow
parents: 55642
diff changeset
   189
     [] \<Rightarrow> None |
fd31d0e70eb8 added function "List.extract"
nipkow
parents: 55642
diff changeset
   190
     y#ys \<Rightarrow> Some(takeWhile (Not o P) xs, y, ys))"
fd31d0e70eb8 added function "List.extract"
nipkow
parents: 55642
diff changeset
   191
fd31d0e70eb8 added function "List.extract"
nipkow
parents: 55642
diff changeset
   192
hide_const (open) "extract"
fd31d0e70eb8 added function "List.extract"
nipkow
parents: 55642
diff changeset
   193
51096
60e4b75fefe1 combinator List.those;
haftmann
parents: 50548
diff changeset
   194
primrec those :: "'a option list \<Rightarrow> 'a list option"
60e4b75fefe1 combinator List.those;
haftmann
parents: 50548
diff changeset
   195
where
60e4b75fefe1 combinator List.those;
haftmann
parents: 50548
diff changeset
   196
"those [] = Some []" |
60e4b75fefe1 combinator List.those;
haftmann
parents: 50548
diff changeset
   197
"those (x # xs) = (case x of
60e4b75fefe1 combinator List.those;
haftmann
parents: 50548
diff changeset
   198
  None \<Rightarrow> None
55466
786edc984c98 merged 'Option.map' and 'Option.map_option'
blanchet
parents: 55465
diff changeset
   199
| Some y \<Rightarrow> map_option (Cons y) (those xs))"
51096
60e4b75fefe1 combinator List.those;
haftmann
parents: 50548
diff changeset
   200
50548
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   201
primrec remove1 :: "'a \<Rightarrow> 'a list \<Rightarrow> 'a list" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   202
"remove1 x [] = []" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   203
"remove1 x (y # xs) = (if x = y then xs else y # remove1 x xs)"
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   204
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   205
primrec removeAll :: "'a \<Rightarrow> 'a list \<Rightarrow> 'a list" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   206
"removeAll x [] = []" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   207
"removeAll x (y # xs) = (if x = y then removeAll x xs else y # removeAll x xs)"
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   208
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   209
primrec distinct :: "'a list \<Rightarrow> bool" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   210
"distinct [] \<longleftrightarrow> True" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   211
"distinct (x # xs) \<longleftrightarrow> x \<notin> set xs \<and> distinct xs"
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   212
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   213
primrec remdups :: "'a list \<Rightarrow> 'a list" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   214
"remdups [] = []" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   215
"remdups (x # xs) = (if x \<in> set xs then remdups xs else x # remdups xs)"
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   216
53721
ccaceea6c768 added two functions to List (one contributed by Manuel Eberl)
traytel
parents: 53689
diff changeset
   217
fun remdups_adj :: "'a list \<Rightarrow> 'a list" where
ccaceea6c768 added two functions to List (one contributed by Manuel Eberl)
traytel
parents: 53689
diff changeset
   218
"remdups_adj [] = []" |
ccaceea6c768 added two functions to List (one contributed by Manuel Eberl)
traytel
parents: 53689
diff changeset
   219
"remdups_adj [x] = [x]" |
ccaceea6c768 added two functions to List (one contributed by Manuel Eberl)
traytel
parents: 53689
diff changeset
   220
"remdups_adj (x # y # xs) = (if x = y then remdups_adj (x # xs) else x # remdups_adj (y # xs))"
ccaceea6c768 added two functions to List (one contributed by Manuel Eberl)
traytel
parents: 53689
diff changeset
   221
50548
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   222
primrec replicate :: "nat \<Rightarrow> 'a \<Rightarrow> 'a list" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   223
replicate_0: "replicate 0 x = []" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   224
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
   225
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   226
text {*
14589
feae7b5fd425 tuned document;
wenzelm
parents: 14565
diff changeset
   227
  Function @{text size} is overloaded for all datatypes. Users may
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
   228
  refer to the list version as @{text length}. *}
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   229
50548
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   230
abbreviation length :: "'a list \<Rightarrow> nat" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   231
"length \<equiv> size"
15307
10dd989282fd indentation
paulson
parents: 15305
diff changeset
   232
51173
3cbb4e95a565 Sieve of Eratosthenes
haftmann
parents: 51170
diff changeset
   233
definition enumerate :: "nat \<Rightarrow> 'a list \<Rightarrow> (nat \<times> 'a) list" where
3cbb4e95a565 Sieve of Eratosthenes
haftmann
parents: 51170
diff changeset
   234
enumerate_eq_zip: "enumerate n xs = zip [n..<n + length xs] xs"
3cbb4e95a565 Sieve of Eratosthenes
haftmann
parents: 51170
diff changeset
   235
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
   236
primrec rotate1 :: "'a list \<Rightarrow> 'a list" where
50548
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   237
"rotate1 [] = []" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   238
"rotate1 (x # xs) = xs @ [x]"
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   239
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   240
definition rotate :: "nat \<Rightarrow> 'a list \<Rightarrow> 'a list" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   241
"rotate n = rotate1 ^^ n"
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   242
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   243
definition sublist :: "'a list => nat set => 'a list" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   244
"sublist xs A = map fst (filter (\<lambda>p. snd p \<in> A) (zip xs [0..<size xs]))"
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   245
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   246
primrec sublists :: "'a list \<Rightarrow> 'a list list" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   247
"sublists [] = [[]]" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   248
"sublists (x#xs) = (let xss = sublists xs in map (Cons x) xss @ xss)"
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   249
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   250
primrec n_lists :: "nat \<Rightarrow> 'a list \<Rightarrow> 'a list list" where
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   251
"n_lists 0 xs = [[]]" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   252
"n_lists (Suc n) xs = concat (map (\<lambda>ys. map (\<lambda>y. y # ys) xs) (n_lists n xs))"
49948
744934b818c7 moved quite generic material from theory Enum to more appropriate places
haftmann
parents: 49808
diff changeset
   253
744934b818c7 moved quite generic material from theory Enum to more appropriate places
haftmann
parents: 49808
diff changeset
   254
hide_const (open) n_lists
744934b818c7 moved quite generic material from theory Enum to more appropriate places
haftmann
parents: 49808
diff changeset
   255
40593
1e57b18d27b1 code eqn for slice was missing; redefined splice with fun
nipkow
parents: 40365
diff changeset
   256
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
   257
"splice [] ys = ys" |
1e57b18d27b1 code eqn for slice was missing; redefined splice with fun
nipkow
parents: 40365
diff changeset
   258
"splice xs [] = xs" |
1e57b18d27b1 code eqn for slice was missing; redefined splice with fun
nipkow
parents: 40365
diff changeset
   259
"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
   260
26771
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   261
text{*
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   262
\begin{figure}[htbp]
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   263
\fbox{
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   264
\begin{tabular}{l}
27381
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   265
@{lemma "[a,b]@[c,d] = [a,b,c,d]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   266
@{lemma "length [a,b,c] = 3" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   267
@{lemma "set [a,b,c] = {a,b,c}" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   268
@{lemma "map f [a,b,c] = [f a, f b, f c]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   269
@{lemma "rev [a,b,c] = [c,b,a]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   270
@{lemma "hd [a,b,c,d] = a" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   271
@{lemma "tl [a,b,c,d] = [b,c,d]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   272
@{lemma "last [a,b,c,d] = d" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   273
@{lemma "butlast [a,b,c,d] = [a,b,c]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   274
@{lemma[source] "filter (\<lambda>n::nat. n<2) [0,2,1] = [0,1]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   275
@{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
   276
@{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
   277
@{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
   278
@{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
   279
@{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
   280
@{lemma "zip [a,b] [x,y,z] = [(a,x),(b,y)]" by simp}\\
51173
3cbb4e95a565 Sieve of Eratosthenes
haftmann
parents: 51170
diff changeset
   281
@{lemma "enumerate 3 [a,b,c] = [(3,a),(4,b),(5,c)]" by normalization}\\
49948
744934b818c7 moved quite generic material from theory Enum to more appropriate places
haftmann
parents: 49808
diff changeset
   282
@{lemma "List.product [a,b] [c,d] = [(a, c), (a, d), (b, c), (b, d)]" by simp}\\
53721
ccaceea6c768 added two functions to List (one contributed by Manuel Eberl)
traytel
parents: 53689
diff changeset
   283
@{lemma "product_lists [[a,b], [c], [d,e]] = [[a,c,d], [a,c,e], [b,c,d], [b,c,e]]" by simp}\\
27381
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   284
@{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
   285
@{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
   286
@{lemma "take 2 [a,b,c,d] = [a,b]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   287
@{lemma "take 6 [a,b,c,d] = [a,b,c,d]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   288
@{lemma "drop 2 [a,b,c,d] = [c,d]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   289
@{lemma "drop 6 [a,b,c,d] = []" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   290
@{lemma "takeWhile (%n::nat. n<3) [1,2,3,0] = [1,2]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   291
@{lemma "dropWhile (%n::nat. n<3) [1,2,3,0] = [3,0]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   292
@{lemma "distinct [2,0,1::nat]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   293
@{lemma "remdups [2,0,2,1::nat,2] = [0,1,2]" by simp}\\
53721
ccaceea6c768 added two functions to List (one contributed by Manuel Eberl)
traytel
parents: 53689
diff changeset
   294
@{lemma "remdups_adj [2,2,3,1,1::nat,2,1] = [2,3,1,2,1]" by simp}\\
34978
874150ddd50a canonical insert operation; generalized lemma foldl_apply_inv to foldl_apply
haftmann
parents: 34942
diff changeset
   295
@{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
   296
@{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
   297
@{lemma "List.find (%i::int. i>0) [0,0] = None" by simp}\\
790fb5eb5969 Functions and lemmas by Christian Sternagel
nipkow
parents: 47108
diff changeset
   298
@{lemma "List.find (%i::int. i>0) [0,1,0,2] = Some 1" by simp}\\
55807
fd31d0e70eb8 added function "List.extract"
nipkow
parents: 55642
diff changeset
   299
@{lemma "List.extract (%i::int. i>0) [0,0] = None" by(simp add: extract_def)}\\
fd31d0e70eb8 added function "List.extract"
nipkow
parents: 55642
diff changeset
   300
@{lemma "List.extract (%i::int. i>0) [0,1,0,2] = Some([0], 1, [0,2])" by(simp add: extract_def)}\\
27381
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   301
@{lemma "remove1 2 [2,0,2,1::nat,2] = [0,2,1,2]" by simp}\\
27693
73253a4e3ee2 added removeAll
nipkow
parents: 27381
diff changeset
   302
@{lemma "removeAll 2 [2,0,2,1::nat,2] = [0,1]" by simp}\\
27381
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   303
@{lemma "nth [a,b,c,d] 2 = c" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   304
@{lemma "[a,b,c,d][2 := x] = [a,b,x,d]" by simp}\\
19ae7064f00f @{lemma}: 'by' keyword;
wenzelm
parents: 27368
diff changeset
   305
@{lemma "sublist [a,b,c,d,e] {0,2,3} = [a,c,d]" by (simp add:sublist_def)}\\
49948
744934b818c7 moved quite generic material from theory Enum to more appropriate places
haftmann
parents: 49808
diff changeset
   306
@{lemma "sublists [a,b] = [[a, b], [a], [b], []]" by simp}\\
744934b818c7 moved quite generic material from theory Enum to more appropriate places
haftmann
parents: 49808
diff changeset
   307
@{lemma "List.n_lists 2 [a,b,c] = [[a, a], [b, a], [c, a], [a, b], [b, b], [c, b], [a, c], [b, c], [c, c]]" by (simp add: eval_nat_numeral)}\\
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
   308
@{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
   309
@{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
   310
@{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
   311
@{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
   312
@{lemma "listsum [1,2,3::nat] = 6" by (simp add: listsum_def)}
26771
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   313
\end{tabular}}
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   314
\caption{Characteristic examples}
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   315
\label{fig:Characteristic}
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   316
\end{figure}
29927
ae8f42c245b2 Added nitpick attribute, and fixed typo.
blanchet
parents: 29856
diff changeset
   317
Figure~\ref{fig:Characteristic} shows characteristic examples
26771
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   318
that should give an intuitive understanding of the above functions.
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   319
*}
1d67ab20f358 Added documentation
nipkow
parents: 26749
diff changeset
   320
24616
fac3dd4ade83 sorting
nipkow
parents: 24566
diff changeset
   321
text{* The following simple sort functions are intended for proofs,
fac3dd4ade83 sorting
nipkow
parents: 24566
diff changeset
   322
not for efficient implementations. *}
fac3dd4ade83 sorting
nipkow
parents: 24566
diff changeset
   323
25221
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
   324
context linorder
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
   325
begin
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
   326
39915
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   327
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
   328
  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
   329
| 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
   330
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   331
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
   332
  "sorted [x]"
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   333
  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
   334
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   335
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
   336
  "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
   337
  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
   338
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   339
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
   340
  "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
   341
  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
   342
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   343
lemma [code]:
ecf97cf3d248 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann
parents: 39774
diff changeset
   344
  "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
   345
  "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
   346
  by simp_all
24697
b37d3980da3c fixed haftmann bug
nipkow
parents: 24657
diff changeset
   347
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
   348
primrec insort_key :: "('b \<Rightarrow> 'a) \<Rightarrow> 'b \<Rightarrow> 'b list \<Rightarrow> 'b list" where
50548
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   349
"insort_key f x [] = [x]" |
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   350
"insort_key f x (y#ys) =
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   351
  (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
   352
35195
5163c2d00904 more lemmas about sort(_key)
haftmann
parents: 35115
diff changeset
   353
definition sort_key :: "('b \<Rightarrow> 'a) \<Rightarrow> 'b list \<Rightarrow> 'b list" where
50548
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   354
"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
   355
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
   356
definition insort_insert_key :: "('b \<Rightarrow> 'a) \<Rightarrow> 'b \<Rightarrow> 'b list \<Rightarrow> 'b list" where
50548
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   357
"insort_insert_key f x xs =
0aec55e63795 unified layout of defs
nipkow
parents: 50422
diff changeset
   358
  (if f x \<in> f ` set xs then xs else insort_key f x xs)"
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
   359
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
   360
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
   361
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
   362
abbreviation "insort_insert \<equiv> insort_insert_key (\<lambda>x. x)"
35608
db4045d1406e added insort_insert
haftmann
parents: 35603
diff changeset
   363
25221
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
   364
end
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
   365
24616
fac3dd4ade83 sorting
nipkow
parents: 24566
diff changeset
   366
23388
77645da0db85 tuned proofs: avoid implicit prems;
wenzelm
parents: 23279
diff changeset
   367
subsubsection {* List comprehension *}
23192
ec73b9707d48 Moved list comprehension into List
nipkow
parents: 23096
diff changeset
   368
24349
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   369
text{* Input syntax for Haskell-like list comprehension notation.
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   370
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
   371
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
   372
The syntax is as in Haskell, except that @{text"|"} becomes a dot
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   373
(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
   374
\verb![e| x <- xs, ...]!.
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   375
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   376
The qualifiers after the dot are
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   377
\begin{description}
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   378
\item[generators] @{text"p \<leftarrow> xs"},
24476
f7ad9fbbeeaa turned list comprehension translations into ML to optimize base case
nipkow
parents: 24471
diff changeset
   379
 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
   380
\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
   381
%\item[local bindings] @ {text"let x = e"}.
24349
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   382
\end{description}
23240
7077dc80a14b tuned list comprehension
nipkow
parents: 23235
diff changeset
   383
24476
f7ad9fbbeeaa turned list comprehension translations into ML to optimize base case
nipkow
parents: 24471
diff changeset
   384
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
   385
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
   386
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
   387
optmized to @{term"map (%x. e) xs"}.
23240
7077dc80a14b tuned list comprehension
nipkow
parents: 23235
diff changeset
   388
24349
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   389
It is easy to write short list comprehensions which stand for complex
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   390
expressions. During proofs, they may become unreadable (and
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   391
mangled). In such cases it can be advisable to introduce separate
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   392
definitions for the list comprehensions in question.  *}
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   393
46138
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   394
nonterminal lc_qual and lc_quals
23192
ec73b9707d48 Moved list comprehension into List
nipkow
parents: 23096
diff changeset
   395
ec73b9707d48 Moved list comprehension into List
nipkow
parents: 23096
diff changeset
   396
syntax
46138
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   397
  "_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
   398
  "_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
   399
  "_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
   400
  (*"_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
   401
  "_lc_end" :: "lc_quals" ("]")
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   402
  "_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
   403
  "_lc_abs" :: "'a => 'b list => 'b list"
23192
ec73b9707d48 Moved list comprehension into List
nipkow
parents: 23096
diff changeset
   404
24476
f7ad9fbbeeaa turned list comprehension translations into ML to optimize base case
nipkow
parents: 24471
diff changeset
   405
(* 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
   406
   translation of [e. p<-xs]
23192
ec73b9707d48 Moved list comprehension into List
nipkow
parents: 23096
diff changeset
   407
translations
46138
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   408
  "[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
   409
  "_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
   410
   => "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
   411
  "[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
   412
  "_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
   413
   => "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
   414
  "_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
   415
   => "_Let b (_listcompr e Q Qs)"
24476
f7ad9fbbeeaa turned list comprehension translations into ML to optimize base case
nipkow
parents: 24471
diff changeset
   416
*)
23240
7077dc80a14b tuned list comprehension
nipkow
parents: 23235
diff changeset
   417
23279
e39dd93161d9 tuned list comprehension, changed filter syntax from : to <-
nipkow
parents: 23246
diff changeset
   418
syntax (xsymbols)
46138
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   419
  "_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
   420
syntax (HTML output)
46138
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   421
  "_lc_gen" :: "'a \<Rightarrow> 'a list \<Rightarrow> lc_qual"  ("_ \<leftarrow> _")
24349
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   422
52143
36ffe23b25f8 syntax translations always depend on context;
wenzelm
parents: 52131
diff changeset
   423
parse_translation {*
46138
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   424
  let
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   425
    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
   426
    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
   427
    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
   428
    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
   429
    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
   430
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   431
    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
   432
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   433
    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
   434
      let
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   435
        (* FIXME proper name context!? *)
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   436
        val x =
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   437
          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
   438
        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
   439
        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
   440
        val case2 =
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   441
          Syntax.const @{syntax_const "_case1"} $
56241
029246729dc0 more qualified names;
wenzelm
parents: 56218
diff changeset
   442
            Syntax.const @{const_syntax Pure.dummy_pattern} $ NilC;
46138
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   443
        val cs = Syntax.const @{syntax_const "_case2"} $ case1 $ case2;
51678
1e33b81c328a allow redundant cases in the list comprehension translation
traytel
parents: 51673
diff changeset
   444
      in Syntax_Trans.abs_tr [x, Case_Translation.case_tr false ctxt [x, cs]] end;
46138
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   445
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   446
    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
   447
      (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
   448
        Free (s, T) =>
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   449
          let
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   450
            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
   451
            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
   452
          in
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   453
            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
   454
            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
   455
            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
   456
          end
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   457
      | _ => (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
   458
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   459
    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
   460
          let
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   461
            val res =
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   462
              (case qs of
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   463
                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
   464
              | 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
   465
          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
   466
      | lc_tr ctxt
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   467
            [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
   468
              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
   469
          (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
   470
            (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
   471
          | (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
   472
      | lc_tr ctxt
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   473
            [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
   474
              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
   475
          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
   476
          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
   477
85f8d8a8c711 improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 46133
diff changeset
   478
  in [(@{syntax_const "_listcompr"}, lc_tr)] end
24349
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   479
*}
23279
e39dd93161d9 tuned list comprehension, changed filter syntax from : to <-
nipkow
parents: 23246
diff changeset
   480
51272
9c8d63b4b6be prefer stateless 'ML_val' for tests;
wenzelm
parents: 51173
diff changeset
   481
ML_val {*
42167
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   482
  let
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   483
    val read = Syntax.read_term @{context};
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   484
    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
   485
  in
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   486
    check "[(x,y,z). b]" "if b then [(x, y, z)] else []";
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   487
    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
   488
    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
   489
    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
   490
    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
   491
    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
   492
    check "[(x,y). Cons True x \<leftarrow> xs]"
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   493
      "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
   494
    check "[(x,y,z). Cons x [] \<leftarrow> xs]"
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   495
      "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
   496
    check "[(x,y,z). x<a, x>b, x=d]"
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   497
      "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
   498
    check "[(x,y,z). x<a, x>b, y\<leftarrow>ys]"
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   499
      "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
   500
    check "[(x,y,z). x<a, x\<leftarrow>xs,y>b]"
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   501
      "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
   502
    check "[(x,y,z). x<a, x\<leftarrow>xs, y\<leftarrow>ys]"
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   503
      "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
   504
    check "[(x,y,z). x\<leftarrow>xs, x>b, y<a]"
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   505
      "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
   506
    check "[(x,y,z). x\<leftarrow>xs, x>b, y\<leftarrow>ys]"
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   507
      "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
   508
    check "[(x,y,z). x\<leftarrow>xs, y\<leftarrow>ys,y>x]"
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   509
      "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
   510
    check "[(x,y,z). x\<leftarrow>xs, y\<leftarrow>ys,z\<leftarrow>zs]"
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   511
      "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
   512
  end;
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   513
*}
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   514
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35028
diff changeset
   515
(*
24349
0dd8782fb02d Final mods for list comprehension
nipkow
parents: 24335
diff changeset
   516
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
   517
*)
ec73b9707d48 Moved list comprehension into List
nipkow
parents: 23096
diff changeset
   518
42167
7d8cb105373c actually check list comprehension examples;
wenzelm
parents: 42144
diff changeset
   519
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   520
ML {*
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   521
(* Simproc for rewriting list comprehensions applied to List.set to set
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   522
   comprehension. *)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   523
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   524
signature LIST_TO_SET_COMPREHENSION =
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   525
sig
51717
9e7d1c139569 simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents: 51678
diff changeset
   526
  val simproc : Proof.context -> cterm -> thm option
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   527
end
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   528
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   529
structure List_to_Set_Comprehension : LIST_TO_SET_COMPREHENSION =
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   530
struct
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   531
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   532
(* conversion *)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   533
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   534
fun all_exists_conv cv ctxt ct =
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   535
  (case Thm.term_of ct of
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   536
    Const (@{const_name HOL.Ex}, _) $ Abs _ =>
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   537
      Conv.arg_conv (Conv.abs_conv (all_exists_conv cv o #2) ctxt) ct
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   538
  | _ => cv ctxt ct)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   539
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   540
fun all_but_last_exists_conv cv ctxt ct =
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   541
  (case Thm.term_of ct of
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   542
    Const (@{const_name HOL.Ex}, _) $ Abs (_, _, Const (@{const_name HOL.Ex}, _) $ _) =>
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   543
      Conv.arg_conv (Conv.abs_conv (all_but_last_exists_conv cv o #2) ctxt) ct
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   544
  | _ => cv ctxt ct)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   545
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   546
fun Collect_conv cv ctxt ct =
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   547
  (case Thm.term_of ct of
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   548
    Const (@{const_name Set.Collect}, _) $ Abs _ => Conv.arg_conv (Conv.abs_conv cv ctxt) ct
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   549
  | _ => raise CTERM ("Collect_conv", [ct]))
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   550
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   551
fun rewr_conv' th = Conv.rewr_conv (mk_meta_eq th)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   552
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   553
fun conjunct_assoc_conv ct =
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   554
  Conv.try_conv
51315
536a5603a138 provide common HOLogic.conj_conv and HOLogic.eq_conv;
wenzelm
parents: 51314
diff changeset
   555
    (rewr_conv' @{thm conj_assoc} then_conv HOLogic.conj_conv Conv.all_conv conjunct_assoc_conv) ct
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   556
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   557
fun right_hand_set_comprehension_conv conv ctxt =
51315
536a5603a138 provide common HOLogic.conj_conv and HOLogic.eq_conv;
wenzelm
parents: 51314
diff changeset
   558
  HOLogic.Trueprop_conv (HOLogic.eq_conv Conv.all_conv
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   559
    (Collect_conv (all_exists_conv conv o #2) ctxt))
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   560
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   561
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   562
(* term abstraction of list comprehension patterns *)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   563
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   564
datatype termlets = If | Case of (typ * int)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   565
51717
9e7d1c139569 simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents: 51678
diff changeset
   566
fun simproc ctxt redex =
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   567
  let
55584
a879f14b6f95 merged 'List.set' with BNF-generated 'set'
blanchet
parents: 55564
diff changeset
   568
    val set_Nil_I = @{thm trans} OF [@{thm set_simps(1)}, @{thm empty_def}]
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   569
    val set_singleton = @{lemma "set [a] = {x. x = a}" by simp}
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   570
    val inst_Collect_mem_eq = @{lemma "set A = {x. x : set A}" by simp}
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   571
    val del_refl_eq = @{lemma "(t = t & P) == P" by simp}
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   572
    fun mk_set T = Const (@{const_name List.set}, HOLogic.listT T --> HOLogic.mk_setT T)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   573
    fun dest_set (Const (@{const_name List.set}, _) $ xs) = xs
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   574
    fun dest_singleton_list (Const (@{const_name List.Cons}, _)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   575
          $ t $ (Const (@{const_name List.Nil}, _))) = t
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   576
      | dest_singleton_list t = raise TERM ("dest_singleton_list", [t])
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   577
    (* We check that one case returns a singleton list and all other cases
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   578
       return [], and return the index of the one singleton list case *)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   579
    fun possible_index_of_singleton_case cases =
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   580
      let
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   581
        fun check (i, case_t) s =
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   582
          (case strip_abs_body case_t of
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   583
            (Const (@{const_name List.Nil}, _)) => s
53412
01b804df0a30 list_to_set_comprehension: don't crash in case distinctions on datatypes with even number of constructors
traytel
parents: 53374
diff changeset
   584
          | _ => (case s of SOME NONE => SOME (SOME i) | _ => NONE))
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   585
      in
53412
01b804df0a30 list_to_set_comprehension: don't crash in case distinctions on datatypes with even number of constructors
traytel
parents: 53374
diff changeset
   586
        fold_index check cases (SOME NONE) |> the_default NONE
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   587
      end
54404
9f0f1152c875 port list comprehension simproc to 'Ctr_Sugar' abstraction
blanchet
parents: 54295
diff changeset
   588
    (* returns (case_expr type index chosen_case constr_name) option  *)
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   589
    fun dest_case case_term =
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   590
      let
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   591
        val (case_const, args) = strip_comb case_term
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   592
      in
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   593
        (case try dest_Const case_const of
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   594
          SOME (c, T) =>
54404
9f0f1152c875 port list comprehension simproc to 'Ctr_Sugar' abstraction
blanchet
parents: 54295
diff changeset
   595
            (case Ctr_Sugar.ctr_sugar_of_case ctxt c of
9f0f1152c875 port list comprehension simproc to 'Ctr_Sugar' abstraction
blanchet
parents: 54295
diff changeset
   596
              SOME {ctrs, ...} =>
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   597
                (case possible_index_of_singleton_case (fst (split_last args)) of
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   598
                  SOME i =>
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   599
                    let
54404
9f0f1152c875 port list comprehension simproc to 'Ctr_Sugar' abstraction
blanchet
parents: 54295
diff changeset
   600
                      val constr_names = map (fst o dest_Const) ctrs
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   601
                      val (Ts, _) = strip_type T
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   602
                      val T' = List.last Ts
54404
9f0f1152c875 port list comprehension simproc to 'Ctr_Sugar' abstraction
blanchet
parents: 54295
diff changeset
   603
                    in SOME (List.last args, T', i, nth args i, nth constr_names i) end
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   604
                | NONE => NONE)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   605
            | NONE => NONE)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   606
        | NONE => NONE)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   607
      end
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   608
    (* returns condition continuing term option *)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   609
    fun dest_if (Const (@{const_name If}, _) $ cond $ then_t $ Const (@{const_name Nil}, _)) =
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   610
          SOME (cond, then_t)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   611
      | dest_if _ = NONE
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   612
    fun tac _ [] = rtac set_singleton 1 ORELSE rtac inst_Collect_mem_eq 1
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   613
      | tac ctxt (If :: cont) =
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   614
          Splitter.split_tac [@{thm split_if}] 1
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   615
          THEN rtac @{thm conjI} 1
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   616
          THEN rtac @{thm impI} 1
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   617
          THEN Subgoal.FOCUS (fn {prems, context, ...} =>
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   618
            CONVERSION (right_hand_set_comprehension_conv (K
51315
536a5603a138 provide common HOLogic.conj_conv and HOLogic.eq_conv;
wenzelm
parents: 51314
diff changeset
   619
              (HOLogic.conj_conv (Conv.rewr_conv (List.last prems RS @{thm Eq_TrueI})) Conv.all_conv
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   620
               then_conv
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   621
               rewr_conv' @{lemma "(True & P) = P" by simp})) context) 1) ctxt 1
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   622
          THEN tac ctxt cont
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   623
          THEN rtac @{thm impI} 1
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   624
          THEN Subgoal.FOCUS (fn {prems, context, ...} =>
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   625
              CONVERSION (right_hand_set_comprehension_conv (K
51315
536a5603a138 provide common HOLogic.conj_conv and HOLogic.eq_conv;
wenzelm
parents: 51314
diff changeset
   626
                (HOLogic.conj_conv (Conv.rewr_conv (List.last prems RS @{thm Eq_FalseI})) Conv.all_conv
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   627
                 then_conv rewr_conv' @{lemma "(False & P) = False" by simp})) context) 1) ctxt 1
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   628
          THEN rtac set_Nil_I 1
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   629
      | tac ctxt (Case (T, i) :: cont) =
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   630
          let
54404
9f0f1152c875 port list comprehension simproc to 'Ctr_Sugar' abstraction
blanchet
parents: 54295
diff changeset
   631
            val SOME {injects, distincts, case_thms, split, ...} =
9f0f1152c875 port list comprehension simproc to 'Ctr_Sugar' abstraction
blanchet
parents: 54295
diff changeset
   632
              Ctr_Sugar.ctr_sugar_of ctxt (fst (dest_Type T))
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   633
          in
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   634
            (* do case distinction *)
54404
9f0f1152c875 port list comprehension simproc to 'Ctr_Sugar' abstraction
blanchet
parents: 54295
diff changeset
   635
            Splitter.split_tac [split] 1
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   636
            THEN EVERY (map_index (fn (i', _) =>
54404
9f0f1152c875 port list comprehension simproc to 'Ctr_Sugar' abstraction
blanchet
parents: 54295
diff changeset
   637
              (if i' < length case_thms - 1 then rtac @{thm conjI} 1 else all_tac)
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   638
              THEN REPEAT_DETERM (rtac @{thm allI} 1)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   639
              THEN rtac @{thm impI} 1
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   640
              THEN (if i' = i then
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   641
                (* continue recursively *)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   642
                Subgoal.FOCUS (fn {prems, context, ...} =>
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   643
                  CONVERSION (Thm.eta_conversion then_conv right_hand_set_comprehension_conv (K
51315
536a5603a138 provide common HOLogic.conj_conv and HOLogic.eq_conv;
wenzelm
parents: 51314
diff changeset
   644
                      ((HOLogic.conj_conv
536a5603a138 provide common HOLogic.conj_conv and HOLogic.eq_conv;
wenzelm
parents: 51314
diff changeset
   645
                        (HOLogic.eq_conv Conv.all_conv (rewr_conv' (List.last prems)) then_conv
54404
9f0f1152c875 port list comprehension simproc to 'Ctr_Sugar' abstraction
blanchet
parents: 54295
diff changeset
   646
                          (Conv.try_conv (Conv.rewrs_conv (map mk_meta_eq injects))))
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   647
                        Conv.all_conv)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   648
                        then_conv (Conv.try_conv (Conv.rewr_conv del_refl_eq))
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   649
                        then_conv conjunct_assoc_conv)) context
51315
536a5603a138 provide common HOLogic.conj_conv and HOLogic.eq_conv;
wenzelm
parents: 51314
diff changeset
   650
                    then_conv (HOLogic.Trueprop_conv (HOLogic.eq_conv Conv.all_conv (Collect_conv (fn (_, ctxt) =>
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   651
                      Conv.repeat_conv
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   652
                        (all_but_last_exists_conv
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   653
                          (K (rewr_conv'
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   654
                            @{lemma "(EX x. x = t & P x) = P t" by simp})) ctxt)) context)))) 1) ctxt 1
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   655
                THEN tac ctxt cont
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   656
              else
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   657
                Subgoal.FOCUS (fn {prems, context, ...} =>
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   658
                  CONVERSION
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   659
                    (right_hand_set_comprehension_conv (K
51315
536a5603a138 provide common HOLogic.conj_conv and HOLogic.eq_conv;
wenzelm
parents: 51314
diff changeset
   660
                      (HOLogic.conj_conv
536a5603a138 provide common HOLogic.conj_conv and HOLogic.eq_conv;
wenzelm
parents: 51314
diff changeset
   661
                        ((HOLogic.eq_conv Conv.all_conv
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   662
                          (rewr_conv' (List.last prems))) then_conv
54404
9f0f1152c875 port list comprehension simproc to 'Ctr_Sugar' abstraction
blanchet
parents: 54295
diff changeset
   663
                          (Conv.rewrs_conv (map (fn th => th RS @{thm Eq_FalseI}) distincts)))
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   664
                        Conv.all_conv then_conv
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   665
                        (rewr_conv' @{lemma "(False & P) = False" by simp}))) context then_conv
51314
eac4bb5adbf9 just one HOLogic.Trueprop_conv, with regular exception CTERM;
wenzelm
parents: 51272
diff changeset
   666
                      HOLogic.Trueprop_conv
51315
536a5603a138 provide common HOLogic.conj_conv and HOLogic.eq_conv;
wenzelm
parents: 51314
diff changeset
   667
                        (HOLogic.eq_conv Conv.all_conv
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   668
                          (Collect_conv (fn (_, ctxt) =>
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   669
                            Conv.repeat_conv
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   670
                              (Conv.bottom_conv
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   671
                                (K (rewr_conv'
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   672
                                  @{lemma "(EX x. P) = P" by simp})) ctxt)) context))) 1) ctxt 1
54404
9f0f1152c875 port list comprehension simproc to 'Ctr_Sugar' abstraction
blanchet
parents: 54295
diff changeset
   673
                THEN rtac set_Nil_I 1)) case_thms)
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   674
          end
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   675
    fun make_inner_eqs bound_vs Tis eqs t =
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   676
      (case dest_case t of
54404
9f0f1152c875 port list comprehension simproc to 'Ctr_Sugar' abstraction
blanchet
parents: 54295
diff changeset
   677
        SOME (x, T, i, cont, constr_name) =>
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   678
          let
52131
366fa32ee2a3 tuned signature;
wenzelm
parents: 52122
diff changeset
   679
            val (vs, body) = strip_abs (Envir.eta_long (map snd bound_vs) cont)
50422
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   680
            val x' = incr_boundvars (length vs) x
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   681
            val eqs' = map (incr_boundvars (length vs)) eqs
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   682
            val constr_t =
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   683
              list_comb
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   684
                (Const (constr_name, map snd vs ---> T), map Bound (((length vs) - 1) downto 0))
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   685
            val constr_eq = Const (@{const_name HOL.eq}, T --> T --> @{typ bool}) $ constr_t $ x'
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   686
          in
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   687
            make_inner_eqs (rev vs @ bound_vs) (Case (T, i) :: Tis) (constr_eq :: eqs') body
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   688
          end
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   689
      | NONE =>
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   690
          (case dest_if t of
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   691
            SOME (condition, cont) => make_inner_eqs bound_vs (If :: Tis) (condition :: eqs) cont
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   692
          | NONE =>
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   693
            if eqs = [] then NONE (* no rewriting, nothing to be done *)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   694
            else
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   695
              let
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   696
                val Type (@{type_name List.list}, [rT]) = fastype_of1 (map snd bound_vs, t)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   697
                val pat_eq =
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   698
                  (case try dest_singleton_list t of
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   699
                    SOME t' =>
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   700
                      Const (@{const_name HOL.eq}, rT --> rT --> @{typ bool}) $
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   701
                        Bound (length bound_vs) $ t'
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   702
                  | NONE =>
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   703
                      Const (@{const_name Set.member}, rT --> HOLogic.mk_setT rT --> @{typ bool}) $
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   704
                        Bound (length bound_vs) $ (mk_set rT $ t))
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   705
                val reverse_bounds = curry subst_bounds
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   706
                  ((map Bound ((length bound_vs - 1) downto 0)) @ [Bound (length bound_vs)])
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   707
                val eqs' = map reverse_bounds eqs
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   708
                val pat_eq' = reverse_bounds pat_eq
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   709
                val inner_t =
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   710
                  fold (fn (_, T) => fn t => HOLogic.exists_const T $ absdummy T t)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   711
                    (rev bound_vs) (fold (curry HOLogic.mk_conj) eqs' pat_eq')
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   712
                val lhs = term_of redex
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   713
                val rhs = HOLogic.mk_Collect ("x", rT, inner_t)
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   714
                val rewrite_rule_t = HOLogic.mk_Trueprop (HOLogic.mk_eq (lhs, rhs))
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   715
              in
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   716
                SOME
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   717
                  ((Goal.prove ctxt [] [] rewrite_rule_t
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   718
                    (fn {context, ...} => tac context (rev Tis))) RS @{thm eq_reflection})
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   719
              end))
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   720
  in
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   721
    make_inner_eqs [] [] [] (dest_set (term_of redex))
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   722
  end
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   723
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   724
end
ee729dbd1b7f avoid ML_file in large theory files to improve performance of dependency discovery of main HOL (approx. 1s CPU time) -- relevant for any application using it, e.g. small paper sessions;
wenzelm
parents: 50134
diff changeset
   725
*}
41463
edbf0a86fb1c adding simproc to rewrite list comprehensions to set comprehensions; adopting proofs
bulwahn
parents: 41372
diff changeset
   726
edbf0a86fb1c adding simproc to rewrite list comprehensions to set comprehensions; adopting proofs
bulwahn
parents: 41372
diff changeset
   727
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
   728
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
   729
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
   730
d9fe85d3d2cd incorporated canonical fold combinator on lists into body of List theory; refactored passages on List.fold(l/r)
haftmann
parents: 46125
diff changeset
   731
hide_const (open) coset
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35028
diff changeset
   732
49948
744934b818c7 moved quite generic material from theory Enum to more appropriate places
haftmann
parents: 49808
diff changeset
   733
21061
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   734
subsubsection {* @{const Nil} and @{const Cons} *}
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   735
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   736
lemma not_Cons_self [simp]:
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   737
  "xs \<noteq> x # xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   738
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   739
41697
19890332febc explicit is better than implicit;
wenzelm
parents: 41505
diff changeset
   740
lemma not_Cons_self2 [simp]:
19890332febc explicit is better than implicit;
wenzelm
parents: 41505
diff changeset
   741
  "x # xs \<noteq> xs"
19890332febc explicit is better than implicit;
wenzelm
parents: 41505
diff changeset
   742
by (rule not_Cons_self [symmetric])
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   743
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   744
lemma neq_Nil_conv: "(xs \<noteq> []) = (\<exists>y ys. xs = y # ys)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   745
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   746
53689
705f0b728b1b added and tuned lemmas
nipkow
parents: 53412
diff changeset
   747
lemma tl_Nil: "tl xs = [] \<longleftrightarrow> xs = [] \<or> (EX x. xs = [x])"
705f0b728b1b added and tuned lemmas
nipkow
parents: 53412
diff changeset
   748
by (cases xs) auto
705f0b728b1b added and tuned lemmas
nipkow
parents: 53412
diff changeset
   749
705f0b728b1b added and tuned lemmas
nipkow
parents: 53412
diff changeset
   750
lemma Nil_tl: "[] = tl xs \<longleftrightarrow> xs = [] \<or> (EX x. xs = [x])"
705f0b728b1b added and tuned lemmas
nipkow
parents: 53412
diff changeset
   751
by (cases xs) auto
705f0b728b1b added and tuned lemmas
nipkow
parents: 53412
diff changeset
   752
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   753
lemma length_induct:
21061
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   754
  "(\<And>xs. \<forall>ys. length ys < length xs \<longrightarrow> P ys \<Longrightarrow> P xs) \<Longrightarrow> P xs"
53689
705f0b728b1b added and tuned lemmas
nipkow
parents: 53412
diff changeset
   755
by (fact measure_induct)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   756
37289
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   757
lemma list_nonempty_induct [consumes 1, case_names single cons]:
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   758
  assumes "xs \<noteq> []"
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   759
  assumes single: "\<And>x. P [x]"
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   760
  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
   761
  shows "P xs"
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   762
using `xs \<noteq> []` proof (induct xs)
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   763
  case Nil then show ?case by simp
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   764
next
53374
a14d2a854c02 tuned proofs -- clarified flow of facts wrt. calculation;
wenzelm
parents: 53017
diff changeset
   765
  case (Cons x xs)
a14d2a854c02 tuned proofs -- clarified flow of facts wrt. calculation;
wenzelm
parents: 53017
diff changeset
   766
  show ?case
a14d2a854c02 tuned proofs -- clarified flow of facts wrt. calculation;
wenzelm
parents: 53017
diff changeset
   767
  proof (cases xs)
a14d2a854c02 tuned proofs -- clarified flow of facts wrt. calculation;
wenzelm
parents: 53017
diff changeset
   768
    case Nil
a14d2a854c02 tuned proofs -- clarified flow of facts wrt. calculation;
wenzelm
parents: 53017
diff changeset
   769
    with single show ?thesis by simp
37289
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   770
  next
53374
a14d2a854c02 tuned proofs -- clarified flow of facts wrt. calculation;
wenzelm
parents: 53017
diff changeset
   771
    case Cons
a14d2a854c02 tuned proofs -- clarified flow of facts wrt. calculation;
wenzelm
parents: 53017
diff changeset
   772
    show ?thesis
a14d2a854c02 tuned proofs -- clarified flow of facts wrt. calculation;
wenzelm
parents: 53017
diff changeset
   773
    proof (rule cons)
a14d2a854c02 tuned proofs -- clarified flow of facts wrt. calculation;
wenzelm
parents: 53017
diff changeset
   774
      from Cons show "xs \<noteq> []" by simp
a14d2a854c02 tuned proofs -- clarified flow of facts wrt. calculation;
wenzelm
parents: 53017
diff changeset
   775
      with Cons.hyps show "P xs" .
a14d2a854c02 tuned proofs -- clarified flow of facts wrt. calculation;
wenzelm
parents: 53017
diff changeset
   776
    qed
37289
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   777
  qed
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   778
qed
881fa5012451 induction over non-empty lists
haftmann
parents: 37123
diff changeset
   779
45714
ad4242285560 cardinality of sets of lists
hoelzl
parents: 45607
diff changeset
   780
lemma inj_split_Cons: "inj_on (\<lambda>(xs, n). n#xs) X"
ad4242285560 cardinality of sets of lists
hoelzl
parents: 45607
diff changeset
   781
  by (auto intro!: inj_onI)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   782
49948
744934b818c7 moved quite generic material from theory Enum to more appropriate places
haftmann
parents: 49808
diff changeset
   783
21061
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   784
subsubsection {* @{const length} *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   785
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   786
text {*
21061
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   787
  Needs to come before @{text "@"} because of theorem @{text
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
   788
  append_eq_append_conv}.
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   789
*}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   790
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   791
lemma length_append [simp]: "length (xs @ ys) = length xs + length ys"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   792
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   793
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   794
lemma length_map [simp]: "length (map f xs) = length xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   795
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   796
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   797
lemma length_rev [simp]: "length (rev xs) = length xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   798
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   799
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   800
lemma length_tl [simp]: "length (tl xs) = length xs - 1"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   801
by (cases xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   802
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   803
lemma length_0_conv [iff]: "(length xs = 0) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   804
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   805
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   806
lemma length_greater_0_conv [iff]: "(0 < length xs) = (xs \<noteq> [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   807
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   808
23479
10adbdcdc65b new lemmas
nipkow
parents: 23388
diff changeset
   809
lemma length_pos_if_in_set: "x : set xs \<Longrightarrow> length xs > 0"
10adbdcdc65b new lemmas
nipkow
parents: 23388
diff changeset
   810
by auto
10adbdcdc65b new lemmas
nipkow
parents: 23388
diff changeset
   811
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   812
lemma length_Suc_conv:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   813
"(length xs = Suc n) = (\<exists>y ys. xs = y # ys \<and> length ys = n)"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   814
by (induct xs) auto
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   815
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   816
lemma Suc_length_conv:
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   817
"(Suc n = length xs) = (\<exists>y ys. xs = y # ys \<and> length ys = n)"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   818
apply (induct xs, simp, simp)
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   819
apply blast
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   820
done
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
   821
25221
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
   822
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
   823
  by (induct xs) auto
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
   824
26442
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   825
lemma list_induct2 [consumes 1, case_names Nil Cons]:
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   826
  "length xs = length ys \<Longrightarrow> P [] [] \<Longrightarrow>
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   827
   (\<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
   828
   \<Longrightarrow> P xs ys"
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   829
proof (induct xs arbitrary: ys)
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   830
  case Nil then show ?case by simp
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   831
next
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   832
  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
   833
qed
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   834
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   835
lemma list_induct3 [consumes 2, case_names Nil Cons]:
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   836
  "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
   837
   (\<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
   838
   \<Longrightarrow> P xs ys zs"
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   839
proof (induct xs arbitrary: ys zs)
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   840
  case Nil then show ?case by simp
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   841
next
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   842
  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
   843
    (cases zs, simp_all)
57fb6a8b099e restructuring; explicit case names for rule list_induct2
haftmann
parents: 26300
diff changeset
   844
qed
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   845
36154
11c6106d7787 Respectfullness and preservation of list_rel
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents: 35828
diff changeset
   846
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
   847
  "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
   848
   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
   849
   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
   850
   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
   851
proof (induct xs arbitrary: ys zs ws)
11c6106d7787 Respectfullness and preservation of list_rel
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents: 35828
diff changeset
   852
  case Nil then show ?case by simp
11c6106d7787 Respectfullness and preservation of list_rel
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents: 35828
diff changeset
   853
next
11c6106d7787 Respectfullness and preservation of list_rel
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents: 35828
diff changeset
   854
  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
   855
qed
11c6106d7787 Respectfullness and preservation of list_rel
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents: 35828
diff changeset
   856
22493
db930e490fe5 added another rule for simultaneous induction, and lemmas for zip
krauss
parents: 22422
diff changeset
   857
lemma list_induct2': 
db930e490fe5 added another rule for simultaneous induction, and lemmas for zip
krauss
parents: 22422
diff changeset
   858
  "\<lbrakk> P [] [];
db930e490fe5 added another rule for simultaneous induction, and lemmas for zip
krauss
parents: 22422
diff changeset
   859
  \<And>x xs. P (x#xs) [];
db930e490fe5 added another rule for simultaneous induction, and lemmas for zip
krauss
parents: 22422
diff changeset
   860
  \<And>y ys. P [] (y#ys);
db930e490fe5 added another rule for simultaneous induction, and lemmas for zip
krauss
parents: 22422
diff changeset
   861
   \<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
   862
 \<Longrightarrow> P xs ys"
db930e490fe5 added another rule for simultaneous induction, and lemmas for zip
krauss
parents: 22422
diff changeset
   863
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
   864
55524
f41ef840f09d folded 'list_all2' with the relator generated by 'datatype_new'
blanchet
parents: 55473
diff changeset
   865
lemma list_all2_iff:
f41ef840f09d folded 'list_all2' with the relator generated by 'datatype_new'
blanchet
parents: 55473
diff changeset
   866
  "list_all2 P xs ys \<longleftrightarrow> length xs = length ys \<and> (\<forall>(x, y) \<in> set (zip xs ys). P x y)"
f41ef840f09d folded 'list_all2' with the relator generated by 'datatype_new'
blanchet
parents: 55473
diff changeset
   867
by (induct xs ys rule: list_induct2') auto
f41ef840f09d folded 'list_all2' with the relator generated by 'datatype_new'
blanchet
parents: 55473
diff changeset
   868
22143
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   869
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
   870
by (rule Eq_FalseI) auto
24037
0a41d2ebc0cd proper simproc_setup for "list_neq";
wenzelm
parents: 23983
diff changeset
   871
0a41d2ebc0cd proper simproc_setup for "list_neq";
wenzelm
parents: 23983
diff changeset
   872
simproc_setup list_neq ("(xs::'a list) = ys") = {*
22143
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   873
(*
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   874
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
   875
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
   876
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
   877
*)
24037
0a41d2ebc0cd proper simproc_setup for "list_neq";
wenzelm
parents: 23983
diff changeset
   878
0a41d2ebc0cd proper simproc_setup for "list_neq";
wenzelm
parents: 23983
diff changeset
   879
let
22143
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   880
29856
984191be0357 const_name antiquotations
huffman
parents: 29829
diff changeset
   881
fun len (Const(@{const_name Nil},_)) acc = acc
984191be0357 const_name antiquotations
huffman
parents: 29829
diff changeset
   882
  | len (Const(@{const_name Cons},_) $ _ $ xs) (ts,n) = len xs (ts,n+1)
984191be0357 const_name antiquotations
huffman
parents: 29829
diff changeset
   883
  | len (Const(@{const_name append},_) $ xs $ ys) acc = len xs (len ys acc)
984191be0357 const_name antiquotations
huffman
parents: 29829
diff changeset
   884
  | len (Const(@{const_name rev},_) $ xs) acc = len xs acc
984191be0357 const_name antiquotations
huffman
parents: 29829
diff changeset
   885
  | 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
   886
  | len t (ts,n) = (t::ts,n);
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   887
51717
9e7d1c139569 simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents: 51678
diff changeset
   888
val ss = simpset_of @{context};
9e7d1c139569 simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents: 51678
diff changeset
   889
9e7d1c139569 simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents: 51678
diff changeset
   890
fun list_neq ctxt ct =
22143
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   891
  let
24037
0a41d2ebc0cd proper simproc_setup for "list_neq";
wenzelm
parents: 23983
diff changeset
   892
    val (Const(_,eqT) $ lhs $ rhs) = Thm.term_of ct;
22143
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   893
    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
   894
    fun prove_neq() =
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   895
      let
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   896
        val Type(_,listT::_) = eqT;
22994
02440636214f abstract size function in hologic.ML
haftmann
parents: 22940
diff changeset
   897
        val size = HOLogic.size_const listT;
22143
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   898
        val eq_len = HOLogic.mk_eq (size $ lhs, size $ rhs);
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   899
        val neq_len = HOLogic.mk_Trueprop (HOLogic.Not $ eq_len);
51717
9e7d1c139569 simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents: 51678
diff changeset
   900
        val thm = Goal.prove ctxt [] [] neq_len
9e7d1c139569 simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents: 51678
diff changeset
   901
          (K (simp_tac (put_simpset ss ctxt) 1));
22633
haftmann
parents: 22551
diff changeset
   902
      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
   903
  in
23214
dc23c062b58c renamed gen_submultiset to submultiset;
wenzelm
parents: 23212
diff changeset
   904
    if m < n andalso submultiset (op aconv) (ls,rs) orelse
dc23c062b58c renamed gen_submultiset to submultiset;
wenzelm
parents: 23212
diff changeset
   905
       n < m andalso submultiset (op aconv) (rs,ls)
22143
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   906
    then prove_neq() else NONE
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   907
  end;
51717
9e7d1c139569 simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents: 51678
diff changeset
   908
in K list_neq end;
22143
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   909
*}
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   910
cf58486ca11b Added simproc list_neq (prompted by an application)
nipkow
parents: 21911
diff changeset
   911
15392
290bc97038c7 First step in reorganizing Finite_Set
nipkow
parents: 15307
diff changeset
   912
subsubsection {* @{text "@"} -- append *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   913
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   914
lemma append_assoc [simp]: "(xs @ ys) @ zs = xs @ (ys @ zs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   915
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   916
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   917
lemma append_Nil2 [simp]: "xs @ [] = xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   918
by (induct xs) auto
3507
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   919
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   920
lemma append_is_Nil_conv [iff]: "(xs @ ys = []) = (xs = [] \<and> ys = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   921
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   922
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   923
lemma Nil_is_append_conv [iff]: "([] = xs @ ys) = (xs = [] \<and> ys = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   924
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   925
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   926
lemma append_self_conv [iff]: "(xs @ ys = xs) = (ys = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   927
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   928
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   929
lemma self_append_conv [iff]: "(xs = xs @ ys) = (ys = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   930
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   931
54147
97a8ff4e4ac9 killed most "no_atp", to make Sledgehammer more complete
blanchet
parents: 53954
diff changeset
   932
lemma append_eq_append_conv [simp]:
24526
7fa202789bf6 tuned lemma; replaced !! by arbitrary
nipkow
parents: 24476
diff changeset
   933
 "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
   934
 ==> (xs@us = ys@vs) = (xs=ys \<and> us=vs)"
24526
7fa202789bf6 tuned lemma; replaced !! by arbitrary
nipkow
parents: 24476
diff changeset
   935
apply (induct xs arbitrary: ys)
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   936
 apply (case_tac ys, simp, force)
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
   937
apply (case_tac ys, force, simp)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   938
done
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   939
24526
7fa202789bf6 tuned lemma; replaced !! by arbitrary
nipkow
parents: 24476
diff changeset
   940
lemma append_eq_append_conv2: "(xs @ ys = zs @ ts) =
7fa202789bf6 tuned lemma; replaced !! by arbitrary
nipkow
parents: 24476
diff changeset
   941
  (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
   942
apply (induct xs arbitrary: ys zs ts)
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 44635
diff changeset
   943
 apply fastforce
14495
e2a1c31cf6d3 Added append_eq_append_conv2
nipkow
parents: 14402
diff changeset
   944
apply(case_tac zs)
e2a1c31cf6d3 Added append_eq_append_conv2
nipkow
parents: 14402
diff changeset
   945
 apply simp
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 44635
diff changeset
   946
apply fastforce
14495
e2a1c31cf6d3 Added append_eq_append_conv2
nipkow
parents: 14402
diff changeset
   947
done
e2a1c31cf6d3 Added append_eq_append_conv2
nipkow
parents: 14402
diff changeset
   948
34910
b23bd3ee4813 same_append_eq / append_same_eq are now used for simplifying induction rules.
berghofe
parents: 34064
diff changeset
   949
lemma same_append_eq [iff, induct_simp]: "(xs @ ys = xs @ zs) = (ys = zs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   950
by simp
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   951
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   952
lemma append1_eq_conv [iff]: "(xs @ [x] = ys @ [y]) = (xs = ys \<and> x = y)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   953
by simp
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   954
34910
b23bd3ee4813 same_append_eq / append_same_eq are now used for simplifying induction rules.
berghofe
parents: 34064
diff changeset
   955
lemma append_same_eq [iff, induct_simp]: "(ys @ xs = zs @ xs) = (ys = zs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   956
by simp
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   957
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   958
lemma append_self_conv2 [iff]: "(xs @ ys = ys) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   959
using append_same_eq [of _ _ "[]"] by auto
3507
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   960
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   961
lemma self_append_conv2 [iff]: "(ys = xs @ ys) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   962
using append_same_eq [of "[]"] by auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   963
54147
97a8ff4e4ac9 killed most "no_atp", to make Sledgehammer more complete
blanchet
parents: 53954
diff changeset
   964
lemma hd_Cons_tl [simp]: "xs \<noteq> [] ==> hd xs # tl xs = xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   965
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   966
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   967
lemma hd_append: "hd (xs @ ys) = (if xs = [] then hd ys else hd xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   968
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   969
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   970
lemma hd_append2 [simp]: "xs \<noteq> [] ==> hd (xs @ ys) = hd xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   971
by (simp add: hd_append split: list.split)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   972
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   973
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
   974
by (simp split: list.split)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   975
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   976
lemma tl_append2 [simp]: "xs \<noteq> [] ==> tl (xs @ ys) = tl xs @ ys"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   977
by (simp add: tl_append split: list.split)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   978
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   979
14300
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
   980
lemma Cons_eq_append_conv: "x#xs = ys@zs =
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
   981
 (ys = [] & x#xs = zs | (EX ys'. x#ys' = ys & xs = ys'@zs))"
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
   982
by(cases ys) auto
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
   983
15281
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   984
lemma append_eq_Cons_conv: "(ys@zs = x#xs) =
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   985
 (ys = [] & zs = x#xs | (EX ys'. ys = x#ys' & ys'@zs = xs))"
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   986
by(cases ys) auto
bd4611956c7b More lemmas
nipkow
parents: 15251
diff changeset
   987
14300
bf8b8c9425c3 *** empty log message ***
nipkow
parents: 14247
diff changeset
   988
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   989
text {* Trivial rules for solving @{text "@"}-equations automatically. *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   990
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   991
lemma eq_Nil_appendI: "xs = ys ==> xs = [] @ ys"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   992
by simp
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   993
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   994
lemma Cons_eq_appendI:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   995
"[| x # xs1 = ys; xs = xs1 @ zs |] ==> x # xs = ys @ zs"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   996
by (drule sym) simp
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
   997
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
   998
lemma append_eq_appendI:
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
   999
"[| xs @ xs1 = zs; ys = xs1 @ us |] ==> xs @ ys = zs @ us"
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1000
by (drule sym) simp
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1001
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1002
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1003
text {*
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1004
Simplification procedure for all list equalities.
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1005
Currently only tries to rearrange @{text "@"} to see if
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1006
- both lists end in a singleton list,
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1007
- or both lists end in the same list.
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1008
*}
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1009
43594
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1010
simproc_setup list_eq ("(xs::'a list) = ys")  = {*
13462
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
  1011
  let
43594
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1012
    fun last (cons as Const (@{const_name Cons}, _) $ _ $ xs) =
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1013
          (case xs of Const (@{const_name Nil}, _) => cons | _ => last xs)
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1014
      | last (Const(@{const_name append},_) $ _ $ ys) = last ys
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1015
      | last t = t;
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1016
    
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1017
    fun list1 (Const(@{const_name Cons},_) $ _ $ Const(@{const_name Nil},_)) = true
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1018
      | list1 _ = false;
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1019
    
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1020
    fun butlast ((cons as Const(@{const_name Cons},_) $ x) $ xs) =
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1021
          (case xs of Const (@{const_name Nil}, _) => xs | _ => cons $ butlast xs)
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1022
      | butlast ((app as Const (@{const_name append}, _) $ xs) $ ys) = app $ butlast ys
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1023
      | butlast xs = Const(@{const_name Nil}, fastype_of xs);
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1024
    
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1025
    val rearr_ss =
51717
9e7d1c139569 simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents: 51678
diff changeset
  1026
      simpset_of (put_simpset HOL_basic_ss @{context}
9e7d1c139569 simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents: 51678
diff changeset
  1027
        addsimps [@{thm append_assoc}, @{thm append_Nil}, @{thm append_Cons}]);
43594
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1028
    
51717
9e7d1c139569 simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents: 51678
diff changeset
  1029
    fun list_eq ctxt (F as (eq as Const(_,eqT)) $ lhs $ rhs) =
13462
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13366
diff changeset
  1030
      let
43594
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1031
        val lastl = last lhs and lastr = last rhs;
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1032
        fun rearr conv =
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1033
          let
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1034
            val lhs1 = butlast lhs and rhs1 = butlast rhs;
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1035
            val Type(_,listT::_) = eqT
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1036
            val appT = [listT,listT] ---> listT
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1037
            val app = Const(@{const_name append},appT)
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1038
            val F2 = eq $ (app$lhs1$lastl) $ (app$rhs1$lastr)
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1039
            val eq = HOLogic.mk_Trueprop (HOLogic.mk_eq (F,F2));
51717
9e7d1c139569 simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents: 51678
diff changeset
  1040
            val thm = Goal.prove ctxt [] [] eq
9e7d1c139569 simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents: 51678
diff changeset
  1041
              (K (simp_tac (put_simpset rearr_ss ctxt) 1));
43594
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1042
          in SOME ((conv RS (thm RS trans)) RS eq_reflection) end;
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1043
      in
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1044
        if list1 lastl andalso list1 lastr then rearr @{thm append1_eq_conv}
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1045
        else if lastl aconv lastr then rearr @{thm append_same_eq}
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1046
        else NONE
ef1ddc59b825 modernized some simproc setup;
wenzelm
parents: 43580
diff changeset
  1047
      end;
51717
9e7d1c139569 simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents: 51678
diff changeset
  1048
  in fn _ => fn ctxt => fn ct => list_eq ctxt (term_of ct) end;
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1049
*}
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1050
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1051
49948
744934b818c7 moved quite generic material from theory Enum to more appropriate places
haftmann
parents: 49808
diff changeset
  1052
subsubsection {* @{const map} *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1053
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
  1054
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
  1055
  "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
  1056
  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
  1057
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
  1058
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
  1059
  "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
  1060
  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
  1061
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1062
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
  1063
by (induct xs) simp_all
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1064
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1065
lemma map_ident [simp]: "map (\<lambda>x. x) = (\<lambda>xs. xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1066
by (rule ext, induct_tac xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1067
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1068
lemma map_append [simp]: "map f (xs @ ys) = map f xs @ map f ys"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1069
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1070
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
  1071
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
  1072
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
  1073
35208
2b9bce05e84b added lemma
nipkow
parents: 35195
diff changeset
  1074
lemma map_comp_map[simp]: "((map f) o (map g)) = map(f o g)"
2b9bce05e84b added lemma
nipkow
parents: 35195
diff changeset
  1075
apply(rule ext)
2b9bce05e84b added lemma
nipkow
parents: 35195
diff changeset
  1076
apply(simp)
2b9bce05e84b added lemma
nipkow
parents: 35195
diff changeset
  1077
done
2b9bce05e84b added lemma
nipkow
parents: 35195
diff changeset
  1078
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1079
lemma rev_map: "rev (map f xs) = map f (rev xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1080
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1081
13737
e564c3d2d174 added a few lemmas
nipkow
parents: 13601
diff changeset
  1082
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
  1083
by (induct xs) auto
e564c3d2d174 added a few lemmas
nipkow
parents: 13601
diff changeset
  1084
44013
5cfc1c36ae97 moved recdef package to HOL/Library/Old_Recdef.thy
krauss
parents: 43594
diff changeset
  1085
lemma map_cong [fundef_cong]:
40122
1d8ad2ff3e01 dropped (almost) redundant distinct.induct rule; distinct_simps again named distinct.simps
haftmann
parents: 40077
diff changeset
  1086
  "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
  1087
  by simp
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1088
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1089
lemma map_is_Nil_conv [iff]: "(map f xs = []) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1090
by (cases xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1091
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1092
lemma Nil_is_map_conv [iff]: "([] = map f xs) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1093
by (cases xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1094
18447
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
  1095
lemma map_eq_Cons_conv:
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
  1096
 "(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
  1097
by (cases xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1098
18447
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
  1099
lemma Cons_eq_map_conv:
14025
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
  1100
 "(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
  1101
by (cases ys) auto
d9b155757dc8 *** empty log message ***
nipkow
parents: 13913
diff changeset
  1102
18447
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
  1103
lemmas map_eq_Cons_D = map_eq_Cons_conv [THEN iffD1]
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
  1104
lemmas Cons_eq_map_D = Cons_eq_map_conv [THEN iffD1]
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
  1105
declare map_eq_Cons_D [dest!]  Cons_eq_map_D [dest!]
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
  1106
14111
993471c762b8 Some new thm (ex_map_conv?)
nipkow
parents: 14099
diff changeset
  1107
lemma ex_map_conv:
993471c762b8 Some new thm (ex_map_conv?)
nipkow
parents: 14099
diff changeset
  1108
  "(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
  1109
by(induct ys, auto simp add: Cons_eq_map_conv)
14111
993471c762b8 Some new thm (ex_map_conv?)
nipkow
parents: 14099
diff changeset
  1110
15110
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1111
lemma map_eq_imp_length_eq:
35510
64d2d54cbf03 Slightly generalised a theorem
paulson
parents: 35296
diff changeset
  1112
  assumes "map f xs = map g ys"
26734
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1113
  shows "length xs = length ys"
53374
a14d2a854c02 tuned proofs -- clarified flow of facts wrt. calculation;
wenzelm
parents: 53017
diff changeset
  1114
  using assms
a14d2a854c02 tuned proofs -- clarified flow of facts wrt. calculation;
wenzelm
parents: 53017
diff changeset
  1115
proof (induct ys arbitrary: xs)
26734
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1116
  case Nil then show ?case by simp
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1117
next
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1118
  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
  1119
  from Cons xs have "map f zs = map g ys" by simp
53374
a14d2a854c02 tuned proofs -- clarified flow of facts wrt. calculation;
wenzelm
parents: 53017
diff changeset
  1120
  with Cons have "length zs = length ys" by blast
26734
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1121
  with xs show ?case by simp
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1122
qed
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1123
  
15110
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1124
lemma map_inj_on:
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1125
 "[| 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
  1126
  ==> xs = ys"
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1127
apply(frule map_eq_imp_length_eq)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1128
apply(rotate_tac -1)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1129
apply(induct rule:list_induct2)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1130
 apply simp
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1131
apply(simp)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1132
apply (blast intro:sym)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1133
done
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1134
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1135
lemma inj_on_map_eq_map:
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1136
 "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
  1137
by(blast dest:map_inj_on)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1138
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1139
lemma map_injective:
24526
7fa202789bf6 tuned lemma; replaced !! by arbitrary
nipkow
parents: 24476
diff changeset
  1140
 "map f xs = map f ys ==> inj f ==> xs = ys"
7fa202789bf6 tuned lemma; replaced !! by arbitrary
nipkow
parents: 24476
diff changeset
  1141
by (induct ys arbitrary: xs) (auto dest!:injD)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1142
14339
ec575b7bde7a *** empty log message ***
nipkow
parents: 14338
diff changeset
  1143
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
  1144
by(blast dest:map_injective)
ec575b7bde7a *** empty log message ***
nipkow
parents: 14338
diff changeset
  1145
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1146
lemma inj_mapI: "inj f ==> inj (map f)"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17501
diff changeset
  1147
by (iprover dest: map_injective injD intro: inj_onI)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1148
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1149
lemma inj_mapD: "inj (map f) ==> inj f"
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1150
apply (unfold inj_on_def, clarify)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1151
apply (erule_tac x = "[x]" in ballE)
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1152
 apply (erule_tac x = "[y]" in ballE, simp, blast)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1153
apply blast
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1154
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1155
14339
ec575b7bde7a *** empty log message ***
nipkow
parents: 14338
diff changeset
  1156
lemma inj_map[iff]: "inj (map f) = inj f"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1157
by (blast dest: inj_mapD intro: inj_mapI)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1158
15303
eedbb8d22ca2 added lemmas
nipkow
parents: 15302
diff changeset
  1159
lemma inj_on_mapI: "inj_on f (\<Union>(set ` A)) \<Longrightarrow> inj_on (map f) A"
eedbb8d22ca2 added lemmas
nipkow
parents: 15302
diff changeset
  1160
apply(rule inj_onI)
eedbb8d22ca2 added lemmas
nipkow
parents: 15302
diff changeset
  1161
apply(erule map_inj_on)
eedbb8d22ca2 added lemmas
nipkow
parents: 15302
diff changeset
  1162
apply(blast intro:inj_onI dest:inj_onD)
eedbb8d22ca2 added lemmas
nipkow
parents: 15302
diff changeset
  1163
done
eedbb8d22ca2 added lemmas
nipkow
parents: 15302
diff changeset
  1164
14343
6bc647f472b9 map_idI
kleing
parents: 14339
diff changeset
  1165
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
  1166
by (induct xs, auto)
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1167
14402
4201e1916482 moved lemmas from MicroJava/Comp/AuxLemmas.thy to List.thy
nipkow
parents: 14395
diff changeset
  1168
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
  1169
by (induct xs) auto
4201e1916482 moved lemmas from MicroJava/Comp/AuxLemmas.thy to List.thy
nipkow
parents: 14395
diff changeset
  1170
15110
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1171
lemma map_fst_zip[simp]:
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1172
  "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
  1173
by (induct rule:list_induct2, simp_all)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1174
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1175
lemma map_snd_zip[simp]:
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1176
  "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
  1177
by (induct rule:list_induct2, simp_all)
78b5636eabc7 Added a number of new thms and the new function remove1
nipkow
parents: 15072
diff changeset
  1178
55467
a5c9002bc54d renamed 'enriched_type' to more informative 'functor' (following the renaming of enriched type constructors to bounded natural functors)
blanchet
parents: 55466
diff changeset
  1179
functor map: map
47122
790fb5eb5969 Functions and lemmas by Christian Sternagel
nipkow
parents: 47108
diff changeset
  1180
by (simp_all add: id_def)
790fb5eb5969 Functions and lemmas by Christian Sternagel
nipkow
parents: 47108
diff changeset
  1181
49948
744934b818c7 moved quite generic material from theory Enum to more appropriate places
haftmann
parents: 49808
diff changeset
  1182
declare map.id [simp]
744934b818c7 moved quite generic material from theory Enum to more appropriate places
haftmann
parents: 49808
diff changeset
  1183
744934b818c7 moved quite generic material from theory Enum to more appropriate places
haftmann
parents: 49808
diff changeset
  1184
744934b818c7 moved quite generic material from theory Enum to more appropriate places
haftmann
parents: 49808
diff changeset
  1185
subsubsection {* @{const rev} *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1186
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1187
lemma rev_append [simp]: "rev (xs @ ys) = rev ys @ rev xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1188
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1189
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1190
lemma rev_rev_ident [simp]: "rev (rev xs) = xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1191
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1192
15870
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
  1193
lemma rev_swap: "(rev xs = ys) = (xs = rev ys)"
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
  1194
by auto
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
  1195
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1196
lemma rev_is_Nil_conv [iff]: "(rev xs = []) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1197
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1198
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1199
lemma Nil_is_rev_conv [iff]: "([] = rev xs) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1200
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1201
15870
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
  1202
lemma rev_singleton_conv [simp]: "(rev xs = [x]) = (xs = [x])"
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
  1203
by (cases xs) auto
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
  1204
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
  1205
lemma singleton_rev_conv [simp]: "([x] = rev xs) = (xs = [x])"
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
  1206
by (cases xs) auto
4320bce5873f more on rev
kleing
parents: 15868
diff changeset
  1207
54147
97a8ff4e4ac9 killed most "no_atp", to make Sledgehammer more complete
blanchet
parents: 53954
diff changeset
  1208
lemma rev_is_rev_conv [iff]: "(rev xs = rev ys) = (xs = ys)"
21061
580dfc999ef6 added normal post setup; cleaned up "execution" constants
haftmann
parents: 21046
diff changeset
  1209
apply (induct xs arbitrary: ys, force)
14208
144f45277d5a misc tidying
paulson
parents: 14187
diff changeset
  1210
apply (case_tac ys, simp, force)
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1211
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1212
15439
71c0f98e31f1 made diff_less a simp rule
nipkow
parents: 15426
diff changeset
  1213
lemma inj_on_rev[iff]: "inj_on rev A"
71c0f98e31f1 made diff_less a simp rule
nipkow
parents: 15426
diff changeset
  1214
by(simp add:inj_on_def)
71c0f98e31f1 made diff_less a simp rule
nipkow
parents: 15426
diff changeset
  1215
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
  1216
lemma rev_induct [case_names Nil snoc]:
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
  1217
  "[| 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
  1218
apply(simplesubst rev_rev_ident[symmetric])
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1219
apply(rule_tac list = "rev xs" in list.induct, simp_all)
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1220
done
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1221
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
  1222
lemma rev_exhaust [case_names Nil snoc]:
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
  1223
  "(xs = [] ==> P) ==>(!!ys y. xs = ys @ [y] ==> P) ==> P"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1224
by (induct xs rule: rev_induct) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1225
13366
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
  1226
lemmas rev_cases = rev_exhaust
114b7c14084a moved stuff from Main.thy;
wenzelm
parents: 13187
diff changeset
  1227
18423
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
  1228
lemma rev_eq_Cons_iff[iff]: "(rev xs = y#ys) = (xs = rev ys @ [y])"
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
  1229
by(rule rev_cases[of xs]) auto
d7859164447f new lemmas
nipkow
parents: 18336
diff changeset
  1230
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1231
49948
744934b818c7 moved quite generic material from theory Enum to more appropriate places
haftmann
parents: 49808
diff changeset
  1232
subsubsection {* @{const set} *}
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1233
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1234
lemma finite_set [iff]: "finite (set xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1235
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1236
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1237
lemma set_append [simp]: "set (xs @ ys) = (set xs \<union> set ys)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1238
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1239
17830
695a2365d32f added hd lemma
nipkow
parents: 17765
diff changeset
  1240
lemma hd_in_set[simp]: "xs \<noteq> [] \<Longrightarrow> hd xs : set xs"
695a2365d32f added hd lemma
nipkow
parents: 17765
diff changeset
  1241
by(cases xs) auto
14099
55d244f3c86d added fold_red, o2l, postfix, some thms
oheimb
parents: 14050
diff changeset
  1242
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1243
lemma set_subset_Cons: "set xs \<subseteq> set (x # xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1244
by auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1245
14099
55d244f3c86d added fold_red, o2l, postfix, some thms
oheimb
parents: 14050
diff changeset
  1246
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
  1247
by auto
55d244f3c86d added fold_red, o2l, postfix, some thms
oheimb
parents: 14050
diff changeset
  1248
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1249
lemma set_empty [iff]: "(set xs = {}) = (xs = [])"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1250
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1251
15245
5a21d9a8f14b Added a few lemmas
nipkow
parents: 15236
diff changeset
  1252
lemma set_empty2[iff]: "({} = set xs) = (xs = [])"
5a21d9a8f14b Added a few lemmas
nipkow
parents: 15236
diff changeset
  1253
by(induct xs) auto
5a21d9a8f14b Added a few lemmas
nipkow
parents: 15236
diff changeset
  1254
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1255
lemma set_rev [simp]: "set (rev xs) = set xs"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1256
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1257
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1258
lemma set_map [simp]: "set (map f xs) = f`(set xs)"
13145
59bc43b51aa2 *** empty log message ***
nipkow
parents: 13142
diff changeset
  1259
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1260
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1261
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
  1262
by (induct xs) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1263
32417
e87d9c78910c tuned code generation for lists
nipkow
parents: 32415
diff changeset
  1264
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
  1265
by (induct j) auto
13114
f2b00262bdfc converted;
wenzelm
parents: 12887
diff changeset
  1266
13142
1ebd8ed5a1a0 tuned document;
wenzelm
parents: 13124
diff changeset
  1267
25221
5ded95dda5df append/member: more light-weight way to declare authentic syntax;
wenzelm
parents: 25215
diff changeset
  1268
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
  1269
proof (induct xs)
26073
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1270
  case Nil thus ?case by simp
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1271
next
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1272
  case Cons thus ?case by (auto intro: Cons_eq_appendI)
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1273
qed
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1274
26734
a92057c1ee21 dropped some metis calls
haftmann
parents: 26584
diff changeset
  1275
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
  1276
  by (auto elim: split_list)
26073
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1277
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1278
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
  1279
proof (induct xs)
0e70d3bd2eb4 more lemmas
nipkow
parents: 25966
diff changeset
  1280
  case Nil thus ?case by simp
18049
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
  1281
next
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
  1282
  case (Cons a xs)
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
  1283
  show ?case
156bba334c12 A few new lemmas
nipkow
parents: 17956
diff changeset
  1284
  proof cases
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 44635
diff changeset
  1285
    assume "x = a" thus ?case using Cons by fastforce
18049