src/HOL/Library/List_Prefix.thy
author nipkow
Wed Aug 18 11:09:40 2004 +0200 (2004-08-18)
changeset 15140 322485b816ac
parent 15131 c69542757a4d
child 15355 0de05d104060
permissions -rw-r--r--
import -> imports
wenzelm@10330
     1
(*  Title:      HOL/Library/List_Prefix.thy
wenzelm@10330
     2
    ID:         $Id$
wenzelm@10330
     3
    Author:     Tobias Nipkow and Markus Wenzel, TU Muenchen
wenzelm@10330
     4
*)
wenzelm@10330
     5
wenzelm@14706
     6
header {* List prefixes and postfixes *}
wenzelm@10330
     7
nipkow@15131
     8
theory List_Prefix
nipkow@15140
     9
imports Main
nipkow@15131
    10
begin
wenzelm@10330
    11
wenzelm@10330
    12
subsection {* Prefix order on lists *}
wenzelm@10330
    13
wenzelm@12338
    14
instance list :: (type) ord ..
wenzelm@10330
    15
wenzelm@10330
    16
defs (overloaded)
wenzelm@10389
    17
  prefix_def: "xs \<le> ys == \<exists>zs. ys = xs @ zs"
wenzelm@10389
    18
  strict_prefix_def: "xs < ys == xs \<le> ys \<and> xs \<noteq> (ys::'a list)"
wenzelm@10330
    19
wenzelm@12338
    20
instance list :: (type) order
wenzelm@10389
    21
  by intro_classes (auto simp add: prefix_def strict_prefix_def)
wenzelm@10330
    22
wenzelm@10389
    23
lemma prefixI [intro?]: "ys = xs @ zs ==> xs \<le> ys"
wenzelm@10389
    24
  by (unfold prefix_def) blast
wenzelm@10330
    25
wenzelm@10389
    26
lemma prefixE [elim?]: "xs \<le> ys ==> (!!zs. ys = xs @ zs ==> C) ==> C"
wenzelm@10389
    27
  by (unfold prefix_def) blast
wenzelm@10330
    28
wenzelm@10870
    29
lemma strict_prefixI' [intro?]: "ys = xs @ z # zs ==> xs < ys"
wenzelm@10870
    30
  by (unfold strict_prefix_def prefix_def) blast
wenzelm@10870
    31
wenzelm@10870
    32
lemma strict_prefixE' [elim?]:
wenzelm@10870
    33
    "xs < ys ==> (!!z zs. ys = xs @ z # zs ==> C) ==> C"
wenzelm@10870
    34
proof -
wenzelm@10870
    35
  assume r: "!!z zs. ys = xs @ z # zs ==> C"
wenzelm@10870
    36
  assume "xs < ys"
wenzelm@10870
    37
  then obtain us where "ys = xs @ us" and "xs \<noteq> ys"
wenzelm@10870
    38
    by (unfold strict_prefix_def prefix_def) blast
wenzelm@10870
    39
  with r show ?thesis by (auto simp add: neq_Nil_conv)
wenzelm@10870
    40
qed
wenzelm@10870
    41
wenzelm@10389
    42
lemma strict_prefixI [intro?]: "xs \<le> ys ==> xs \<noteq> ys ==> xs < (ys::'a list)"
wenzelm@10389
    43
  by (unfold strict_prefix_def) blast
wenzelm@10330
    44
wenzelm@10389
    45
lemma strict_prefixE [elim?]:
wenzelm@10389
    46
    "xs < ys ==> (xs \<le> ys ==> xs \<noteq> (ys::'a list) ==> C) ==> C"
wenzelm@10389
    47
  by (unfold strict_prefix_def) blast
wenzelm@10330
    48
wenzelm@10330
    49
wenzelm@10389
    50
subsection {* Basic properties of prefixes *}
wenzelm@10330
    51
wenzelm@10330
    52
theorem Nil_prefix [iff]: "[] \<le> xs"
wenzelm@10389
    53
  by (simp add: prefix_def)
wenzelm@10330
    54
wenzelm@10330
    55
theorem prefix_Nil [simp]: "(xs \<le> []) = (xs = [])"
wenzelm@10389
    56
  by (induct xs) (simp_all add: prefix_def)
wenzelm@10330
    57
wenzelm@10330
    58
lemma prefix_snoc [simp]: "(xs \<le> ys @ [y]) = (xs = ys @ [y] \<or> xs \<le> ys)"
wenzelm@10389
    59
proof
wenzelm@10389
    60
  assume "xs \<le> ys @ [y]"
wenzelm@10389
    61
  then obtain zs where zs: "ys @ [y] = xs @ zs" ..
wenzelm@10389
    62
  show "xs = ys @ [y] \<or> xs \<le> ys"
wenzelm@10389
    63
  proof (cases zs rule: rev_cases)
wenzelm@10389
    64
    assume "zs = []"
wenzelm@10389
    65
    with zs have "xs = ys @ [y]" by simp
wenzelm@10389
    66
    thus ?thesis ..
wenzelm@10389
    67
  next
wenzelm@10389
    68
    fix z zs' assume "zs = zs' @ [z]"
wenzelm@10389
    69
    with zs have "ys = xs @ zs'" by simp
wenzelm@10389
    70
    hence "xs \<le> ys" ..
wenzelm@10389
    71
    thus ?thesis ..
wenzelm@10389
    72
  qed
wenzelm@10389
    73
next
wenzelm@10389
    74
  assume "xs = ys @ [y] \<or> xs \<le> ys"
wenzelm@10389
    75
  thus "xs \<le> ys @ [y]"
wenzelm@10389
    76
  proof
wenzelm@10389
    77
    assume "xs = ys @ [y]"
wenzelm@10389
    78
    thus ?thesis by simp
wenzelm@10389
    79
  next
wenzelm@10389
    80
    assume "xs \<le> ys"
wenzelm@10389
    81
    then obtain zs where "ys = xs @ zs" ..
wenzelm@10389
    82
    hence "ys @ [y] = xs @ (zs @ [y])" by simp
wenzelm@10389
    83
    thus ?thesis ..
wenzelm@10389
    84
  qed
wenzelm@10389
    85
qed
wenzelm@10330
    86
wenzelm@10330
    87
lemma Cons_prefix_Cons [simp]: "(x # xs \<le> y # ys) = (x = y \<and> xs \<le> ys)"
wenzelm@10389
    88
  by (auto simp add: prefix_def)
wenzelm@10330
    89
wenzelm@10330
    90
lemma same_prefix_prefix [simp]: "(xs @ ys \<le> xs @ zs) = (ys \<le> zs)"
wenzelm@10389
    91
  by (induct xs) simp_all
wenzelm@10330
    92
wenzelm@10389
    93
lemma same_prefix_nil [iff]: "(xs @ ys \<le> xs) = (ys = [])"
wenzelm@10389
    94
proof -
wenzelm@10389
    95
  have "(xs @ ys \<le> xs @ []) = (ys \<le> [])" by (rule same_prefix_prefix)
wenzelm@10389
    96
  thus ?thesis by simp
wenzelm@10389
    97
qed
wenzelm@10330
    98
wenzelm@10330
    99
lemma prefix_prefix [simp]: "xs \<le> ys ==> xs \<le> ys @ zs"
wenzelm@10389
   100
proof -
wenzelm@10389
   101
  assume "xs \<le> ys"
wenzelm@10389
   102
  then obtain us where "ys = xs @ us" ..
wenzelm@10389
   103
  hence "ys @ zs = xs @ (us @ zs)" by simp
wenzelm@10389
   104
  thus ?thesis ..
wenzelm@10389
   105
qed
wenzelm@10330
   106
nipkow@14300
   107
lemma append_prefixD: "xs @ ys \<le> zs \<Longrightarrow> xs \<le> zs"
nipkow@14300
   108
by(simp add:prefix_def) blast
nipkow@14300
   109
wenzelm@10330
   110
theorem prefix_Cons: "(xs \<le> y # ys) = (xs = [] \<or> (\<exists>zs. xs = y # zs \<and> zs \<le> ys))"
wenzelm@10389
   111
  by (cases xs) (auto simp add: prefix_def)
wenzelm@10330
   112
wenzelm@10330
   113
theorem prefix_append:
wenzelm@10330
   114
    "(xs \<le> ys @ zs) = (xs \<le> ys \<or> (\<exists>us. xs = ys @ us \<and> us \<le> zs))"
wenzelm@10330
   115
  apply (induct zs rule: rev_induct)
wenzelm@10330
   116
   apply force
wenzelm@10330
   117
  apply (simp del: append_assoc add: append_assoc [symmetric])
wenzelm@10330
   118
  apply simp
wenzelm@10330
   119
  apply blast
wenzelm@10330
   120
  done
wenzelm@10330
   121
wenzelm@10330
   122
lemma append_one_prefix:
wenzelm@10330
   123
    "xs \<le> ys ==> length xs < length ys ==> xs @ [ys ! length xs] \<le> ys"
wenzelm@10330
   124
  apply (unfold prefix_def)
wenzelm@10330
   125
  apply (auto simp add: nth_append)
wenzelm@10389
   126
  apply (case_tac zs)
wenzelm@10330
   127
   apply auto
wenzelm@10330
   128
  done
wenzelm@10330
   129
wenzelm@10330
   130
theorem prefix_length_le: "xs \<le> ys ==> length xs \<le> length ys"
wenzelm@10389
   131
  by (auto simp add: prefix_def)
wenzelm@10330
   132
wenzelm@10330
   133
nipkow@14300
   134
lemma prefix_same_cases:
nipkow@14300
   135
 "\<lbrakk> (xs\<^isub>1::'a list) \<le> ys; xs\<^isub>2 \<le> ys \<rbrakk> \<Longrightarrow> xs\<^isub>1 \<le> xs\<^isub>2 \<or> xs\<^isub>2 \<le> xs\<^isub>1"
nipkow@14300
   136
apply(simp add:prefix_def)
nipkow@14300
   137
apply(erule exE)+
nipkow@14300
   138
apply(simp add: append_eq_append_conv_if split:if_splits)
nipkow@14300
   139
 apply(rule disjI2)
nipkow@14300
   140
 apply(rule_tac x = "drop (size xs\<^isub>2) xs\<^isub>1" in exI)
nipkow@14300
   141
 apply clarify
nipkow@14300
   142
 apply(drule sym)
nipkow@14300
   143
 apply(insert append_take_drop_id[of "length xs\<^isub>2" xs\<^isub>1])
nipkow@14300
   144
 apply simp
nipkow@14300
   145
apply(rule disjI1)
nipkow@14300
   146
apply(rule_tac x = "drop (size xs\<^isub>1) xs\<^isub>2" in exI)
nipkow@14300
   147
apply clarify
nipkow@14300
   148
apply(insert append_take_drop_id[of "length xs\<^isub>1" xs\<^isub>2])
nipkow@14300
   149
apply simp
nipkow@14300
   150
done
nipkow@14300
   151
nipkow@14300
   152
lemma set_mono_prefix:
nipkow@14300
   153
 "xs \<le> ys \<Longrightarrow> set xs \<subseteq> set ys"
nipkow@14300
   154
by(fastsimp simp add:prefix_def)
nipkow@14300
   155
nipkow@14300
   156
wenzelm@10389
   157
subsection {* Parallel lists *}
wenzelm@10389
   158
wenzelm@10389
   159
constdefs
wenzelm@10389
   160
  parallel :: "'a list => 'a list => bool"    (infixl "\<parallel>" 50)
wenzelm@10389
   161
  "xs \<parallel> ys == \<not> xs \<le> ys \<and> \<not> ys \<le> xs"
wenzelm@10389
   162
wenzelm@10389
   163
lemma parallelI [intro]: "\<not> xs \<le> ys ==> \<not> ys \<le> xs ==> xs \<parallel> ys"
wenzelm@10389
   164
  by (unfold parallel_def) blast
wenzelm@10330
   165
wenzelm@10389
   166
lemma parallelE [elim]:
wenzelm@10389
   167
    "xs \<parallel> ys ==> (\<not> xs \<le> ys ==> \<not> ys \<le> xs ==> C) ==> C"
wenzelm@10389
   168
  by (unfold parallel_def) blast
wenzelm@10330
   169
wenzelm@10389
   170
theorem prefix_cases:
wenzelm@10389
   171
  "(xs \<le> ys ==> C) ==>
wenzelm@10512
   172
    (ys < xs ==> C) ==>
wenzelm@10389
   173
    (xs \<parallel> ys ==> C) ==> C"
wenzelm@10512
   174
  by (unfold parallel_def strict_prefix_def) blast
wenzelm@10330
   175
wenzelm@10389
   176
theorem parallel_decomp:
wenzelm@10389
   177
  "xs \<parallel> ys ==> \<exists>as b bs c cs. b \<noteq> c \<and> xs = as @ b # bs \<and> ys = as @ c # cs"
wenzelm@10408
   178
proof (induct xs rule: rev_induct)
wenzelm@11987
   179
  case Nil
wenzelm@11987
   180
  hence False by auto
wenzelm@11987
   181
  thus ?case ..
wenzelm@10408
   182
next
wenzelm@11987
   183
  case (snoc x xs)
wenzelm@11987
   184
  show ?case
wenzelm@10408
   185
  proof (rule prefix_cases)
wenzelm@10408
   186
    assume le: "xs \<le> ys"
wenzelm@10408
   187
    then obtain ys' where ys: "ys = xs @ ys'" ..
wenzelm@10408
   188
    show ?thesis
wenzelm@10408
   189
    proof (cases ys')
wenzelm@10408
   190
      assume "ys' = []" with ys have "xs = ys" by simp
wenzelm@11987
   191
      with snoc have "[x] \<parallel> []" by auto
wenzelm@10408
   192
      hence False by blast
wenzelm@10389
   193
      thus ?thesis ..
wenzelm@10389
   194
    next
wenzelm@10408
   195
      fix c cs assume ys': "ys' = c # cs"
wenzelm@11987
   196
      with snoc ys have "xs @ [x] \<parallel> xs @ c # cs" by (simp only:)
wenzelm@10408
   197
      hence "x \<noteq> c" by auto
wenzelm@10408
   198
      moreover have "xs @ [x] = xs @ x # []" by simp
wenzelm@10408
   199
      moreover from ys ys' have "ys = xs @ c # cs" by (simp only:)
wenzelm@10408
   200
      ultimately show ?thesis by blast
wenzelm@10389
   201
    qed
wenzelm@10408
   202
  next
wenzelm@10512
   203
    assume "ys < xs" hence "ys \<le> xs @ [x]" by (simp add: strict_prefix_def)
wenzelm@11987
   204
    with snoc have False by blast
wenzelm@10408
   205
    thus ?thesis ..
wenzelm@10408
   206
  next
wenzelm@10408
   207
    assume "xs \<parallel> ys"
wenzelm@11987
   208
    with snoc obtain as b bs c cs where neq: "(b::'a) \<noteq> c"
wenzelm@10408
   209
      and xs: "xs = as @ b # bs" and ys: "ys = as @ c # cs"
wenzelm@10408
   210
      by blast
wenzelm@10408
   211
    from xs have "xs @ [x] = as @ b # (bs @ [x])" by simp
wenzelm@10408
   212
    with neq ys show ?thesis by blast
wenzelm@10389
   213
  qed
wenzelm@10389
   214
qed
wenzelm@10330
   215
oheimb@14538
   216
oheimb@14538
   217
subsection {* Postfix order on lists *}
oheimb@14538
   218
oheimb@14538
   219
constdefs
oheimb@14538
   220
  postfix :: "'a list => 'a list => bool"  ("(_/ >= _)" [51, 50] 50)
oheimb@14538
   221
  "xs >= ys == \<exists>zs. xs = zs @ ys"
oheimb@14538
   222
wenzelm@14706
   223
lemma postfix_refl [simp, intro!]: "xs >= xs"
wenzelm@14706
   224
  by (auto simp add: postfix_def)
wenzelm@14706
   225
lemma postfix_trans: "\<lbrakk>xs >= ys; ys >= zs\<rbrakk> \<Longrightarrow> xs >= zs"
wenzelm@14706
   226
  by (auto simp add: postfix_def)
wenzelm@14706
   227
lemma postfix_antisym: "\<lbrakk>xs >= ys; ys >= xs\<rbrakk> \<Longrightarrow> xs = ys"
wenzelm@14706
   228
  by (auto simp add: postfix_def)
oheimb@14538
   229
wenzelm@14706
   230
lemma Nil_postfix [iff]: "xs >= []"
wenzelm@14706
   231
  by (simp add: postfix_def)
wenzelm@14706
   232
lemma postfix_Nil [simp]: "([] >= xs) = (xs = [])"
wenzelm@14706
   233
  by (auto simp add:postfix_def)
oheimb@14538
   234
wenzelm@14706
   235
lemma postfix_ConsI: "xs >= ys \<Longrightarrow> x#xs >= ys"
wenzelm@14706
   236
  by (auto simp add: postfix_def)
wenzelm@14706
   237
lemma postfix_ConsD: "xs >= y#ys \<Longrightarrow> xs >= ys"
wenzelm@14706
   238
  by (auto simp add: postfix_def)
oheimb@14538
   239
wenzelm@14706
   240
lemma postfix_appendI: "xs >= ys \<Longrightarrow> zs @ xs >= ys"
wenzelm@14706
   241
  by (auto simp add: postfix_def)
wenzelm@14706
   242
lemma postfix_appendD: "xs >= zs @ ys \<Longrightarrow> xs >= ys"
wenzelm@14706
   243
  by(auto simp add: postfix_def)
oheimb@14538
   244
oheimb@14538
   245
lemma postfix_is_subset_lemma: "xs = zs @ ys \<Longrightarrow> set ys \<subseteq> set xs"
wenzelm@14706
   246
  by (induct zs, auto)
oheimb@14538
   247
lemma postfix_is_subset: "xs >= ys \<Longrightarrow> set ys \<subseteq> set xs"
wenzelm@14706
   248
  by (unfold postfix_def, erule exE, erule postfix_is_subset_lemma)
oheimb@14538
   249
oheimb@14538
   250
lemma postfix_ConsD2_lemma [rule_format]: "x#xs = zs @ y#ys \<longrightarrow> xs >= ys"
wenzelm@14706
   251
  by (induct zs, auto intro!: postfix_appendI postfix_ConsI)
oheimb@14538
   252
lemma postfix_ConsD2: "x#xs >= y#ys \<Longrightarrow> xs >= ys"
wenzelm@14706
   253
  by (auto simp add: postfix_def dest!: postfix_ConsD2_lemma)
oheimb@14538
   254
oheimb@14538
   255
lemma postfix2prefix: "(xs >= ys) = (rev ys <= rev xs)"
wenzelm@14706
   256
  apply (unfold prefix_def postfix_def, safe)
wenzelm@14706
   257
  apply (rule_tac x = "rev zs" in exI, simp)
wenzelm@14706
   258
  apply (rule_tac x = "rev zs" in exI)
wenzelm@14706
   259
  apply (rule rev_is_rev_conv [THEN iffD1], simp)
wenzelm@14706
   260
  done
oheimb@14538
   261
wenzelm@10330
   262
end