src/HOL/UNITY/ListOrder.thy
author berghofe
Wed Jul 11 11:46:44 2007 +0200 (2007-07-11)
changeset 23767 7272a839ccd9
parent 16417 9bc16273c2d4
child 27682 25aceefd4786
permissions -rw-r--r--
Adapted to new inductive definition package.
paulson@6708
     1
(*  Title:      HOL/UNITY/ListOrder
paulson@6708
     2
    ID:         $Id$
paulson@6708
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
paulson@6708
     4
    Copyright   1998  University of Cambridge
paulson@6708
     5
paulson@13798
     6
Lists are partially ordered by Charpentier's Generalized Prefix Relation
paulson@13798
     7
   (xs,ys) : genPrefix(r)
paulson@13798
     8
     if ys = xs' @ zs where length xs = length xs'
paulson@13798
     9
     and corresponding elements of xs, xs' are pairwise related by r
paulson@13798
    10
paulson@13798
    11
Also overloads <= and < for lists!
paulson@13798
    12
paulson@13798
    13
Based on Lex/Prefix
paulson@6708
    14
*)
paulson@6708
    15
paulson@13798
    16
header {*The Prefix Ordering on Lists*}
paulson@13798
    17
haftmann@16417
    18
theory ListOrder imports Main begin
paulson@13798
    19
berghofe@23767
    20
inductive_set
paulson@13798
    21
  genPrefix :: "('a * 'a)set => ('a list * 'a list)set"
berghofe@23767
    22
  for r :: "('a * 'a)set"
berghofe@23767
    23
 where
paulson@13798
    24
   Nil:     "([],[]) : genPrefix(r)"
paulson@13798
    25
berghofe@23767
    26
 | prepend: "[| (xs,ys) : genPrefix(r);  (x,y) : r |] ==>
paulson@13798
    27
	     (x#xs, y#ys) : genPrefix(r)"
paulson@13798
    28
berghofe@23767
    29
 | append:  "(xs,ys) : genPrefix(r) ==> (xs, ys@zs) : genPrefix(r)"
paulson@13798
    30
paulson@13798
    31
instance list :: (type)ord ..
paulson@13798
    32
paulson@13798
    33
defs
paulson@13798
    34
  prefix_def:        "xs <= zs  ==  (xs,zs) : genPrefix Id"
paulson@13798
    35
paulson@13798
    36
  strict_prefix_def: "xs < zs  ==  xs <= zs & xs ~= (zs::'a list)"
paulson@13798
    37
  
paulson@13798
    38
paulson@13798
    39
(*Constants for the <= and >= relations, used below in translations*)
paulson@13798
    40
constdefs
paulson@13798
    41
  Le :: "(nat*nat) set"
paulson@13798
    42
    "Le == {(x,y). x <= y}"
paulson@13798
    43
paulson@13798
    44
  Ge :: "(nat*nat) set"
paulson@13798
    45
    "Ge == {(x,y). y <= x}"
paulson@13798
    46
berghofe@23767
    47
abbreviation
berghofe@23767
    48
  pfixLe :: "[nat list, nat list] => bool"  (infixl "pfixLe" 50)  where
berghofe@23767
    49
  "xs pfixLe ys == (xs,ys) : genPrefix Le"
paulson@13798
    50
berghofe@23767
    51
abbreviation
berghofe@23767
    52
  pfixGe :: "[nat list, nat list] => bool"  (infixl "pfixGe" 50)  where
berghofe@23767
    53
  "xs pfixGe ys == (xs,ys) : genPrefix Ge"
paulson@13798
    54
paulson@13798
    55
paulson@13798
    56
subsection{*preliminary lemmas*}
paulson@13798
    57
paulson@13798
    58
lemma Nil_genPrefix [iff]: "([], xs) : genPrefix r"
paulson@13798
    59
by (cut_tac genPrefix.Nil [THEN genPrefix.append], auto)
paulson@13798
    60
paulson@13798
    61
lemma genPrefix_length_le: "(xs,ys) : genPrefix r ==> length xs <= length ys"
paulson@13798
    62
by (erule genPrefix.induct, auto)
paulson@13798
    63
paulson@13798
    64
lemma cdlemma:
paulson@13798
    65
     "[| (xs', ys'): genPrefix r |]  
paulson@13798
    66
      ==> (ALL x xs. xs' = x#xs --> (EX y ys. ys' = y#ys & (x,y) : r & (xs, ys) : genPrefix r))"
paulson@13798
    67
apply (erule genPrefix.induct, blast, blast)
paulson@13798
    68
apply (force intro: genPrefix.append)
paulson@13798
    69
done
paulson@13798
    70
paulson@13798
    71
(*As usual converting it to an elimination rule is tiresome*)
paulson@13798
    72
lemma cons_genPrefixE [elim!]: 
paulson@13798
    73
     "[| (x#xs, zs): genPrefix r;   
paulson@13798
    74
         !!y ys. [| zs = y#ys;  (x,y) : r;  (xs, ys) : genPrefix r |] ==> P  
paulson@13798
    75
      |] ==> P"
paulson@13798
    76
by (drule cdlemma, simp, blast)
paulson@13798
    77
paulson@13798
    78
lemma Cons_genPrefix_Cons [iff]:
paulson@13798
    79
     "((x#xs,y#ys) : genPrefix r) = ((x,y) : r & (xs,ys) : genPrefix r)"
paulson@13798
    80
by (blast intro: genPrefix.prepend)
paulson@13798
    81
paulson@13798
    82
paulson@13798
    83
subsection{*genPrefix is a partial order*}
paulson@13798
    84
paulson@13798
    85
lemma refl_genPrefix: "reflexive r ==> reflexive (genPrefix r)"
paulson@13798
    86
paulson@13798
    87
apply (unfold refl_def, auto)
paulson@13798
    88
apply (induct_tac "x")
paulson@13798
    89
prefer 2 apply (blast intro: genPrefix.prepend)
paulson@13798
    90
apply (blast intro: genPrefix.Nil)
paulson@13798
    91
done
paulson@13798
    92
paulson@13798
    93
lemma genPrefix_refl [simp]: "reflexive r ==> (l,l) : genPrefix r"
paulson@13798
    94
by (erule reflD [OF refl_genPrefix UNIV_I])
paulson@13798
    95
paulson@13798
    96
lemma genPrefix_mono: "r<=s ==> genPrefix r <= genPrefix s"
paulson@13798
    97
apply clarify
paulson@13798
    98
apply (erule genPrefix.induct)
paulson@13798
    99
apply (auto intro: genPrefix.append)
paulson@13798
   100
done
paulson@13798
   101
paulson@13798
   102
paulson@13798
   103
(** Transitivity **)
paulson@13798
   104
paulson@13798
   105
(*A lemma for proving genPrefix_trans_O*)
paulson@13798
   106
lemma append_genPrefix [rule_format]:
paulson@13798
   107
     "ALL zs. (xs @ ys, zs) : genPrefix r --> (xs, zs) : genPrefix r"
paulson@13798
   108
by (induct_tac "xs", auto)
paulson@13798
   109
paulson@13798
   110
(*Lemma proving transitivity and more*)
paulson@13798
   111
lemma genPrefix_trans_O [rule_format]: 
paulson@13798
   112
     "(x, y) : genPrefix r  
paulson@13798
   113
      ==> ALL z. (y,z) : genPrefix s --> (x, z) : genPrefix (s O r)"
paulson@13798
   114
apply (erule genPrefix.induct)
paulson@13798
   115
  prefer 3 apply (blast dest: append_genPrefix)
paulson@13798
   116
 prefer 2 apply (blast intro: genPrefix.prepend, blast)
paulson@13798
   117
done
paulson@13798
   118
paulson@13798
   119
lemma genPrefix_trans [rule_format]:
paulson@13798
   120
     "[| (x,y) : genPrefix r;  (y,z) : genPrefix r;  trans r |]  
paulson@13798
   121
      ==> (x,z) : genPrefix r"
paulson@13798
   122
apply (rule trans_O_subset [THEN genPrefix_mono, THEN subsetD])
paulson@13798
   123
 apply assumption
paulson@13798
   124
apply (blast intro: genPrefix_trans_O)
paulson@13798
   125
done
paulson@13798
   126
paulson@13798
   127
lemma prefix_genPrefix_trans [rule_format]: 
paulson@13798
   128
     "[| x<=y;  (y,z) : genPrefix r |] ==> (x, z) : genPrefix r"
paulson@13798
   129
apply (unfold prefix_def)
paulson@13798
   130
apply (subst R_O_Id [symmetric], erule genPrefix_trans_O, assumption)
paulson@13798
   131
done
paulson@13798
   132
paulson@13798
   133
lemma genPrefix_prefix_trans [rule_format]: 
paulson@13798
   134
     "[| (x,y) : genPrefix r;  y<=z |] ==> (x,z) : genPrefix r"
paulson@13798
   135
apply (unfold prefix_def)
paulson@13798
   136
apply (subst Id_O_R [symmetric], erule genPrefix_trans_O, assumption)
paulson@13798
   137
done
paulson@13798
   138
paulson@13798
   139
lemma trans_genPrefix: "trans r ==> trans (genPrefix r)"
paulson@13798
   140
by (blast intro: transI genPrefix_trans)
paulson@13798
   141
paulson@13798
   142
paulson@13798
   143
(** Antisymmetry **)
paulson@13798
   144
paulson@13798
   145
lemma genPrefix_antisym [rule_format]:
paulson@13798
   146
     "[| (xs,ys) : genPrefix r;  antisym r |]  
paulson@13798
   147
      ==> (ys,xs) : genPrefix r --> xs = ys"
paulson@13798
   148
apply (erule genPrefix.induct)
paulson@13798
   149
  txt{*Base case*}
paulson@13798
   150
  apply blast
paulson@13798
   151
 txt{*prepend case*}
paulson@13798
   152
 apply (simp add: antisym_def)
paulson@13798
   153
txt{*append case is the hardest*}
paulson@13798
   154
apply clarify
paulson@13798
   155
apply (subgoal_tac "length zs = 0", force)
paulson@13798
   156
apply (drule genPrefix_length_le)+
paulson@13798
   157
apply (simp del: length_0_conv)
paulson@13798
   158
done
paulson@13798
   159
paulson@13798
   160
lemma antisym_genPrefix: "antisym r ==> antisym (genPrefix r)"
paulson@13798
   161
by (blast intro: antisymI genPrefix_antisym)
paulson@13798
   162
paulson@13798
   163
paulson@13798
   164
subsection{*recursion equations*}
paulson@13798
   165
paulson@13798
   166
lemma genPrefix_Nil [simp]: "((xs, []) : genPrefix r) = (xs = [])"
paulson@13798
   167
apply (induct_tac "xs")
paulson@13798
   168
prefer 2 apply blast
paulson@13798
   169
apply simp
paulson@13798
   170
done
paulson@13798
   171
paulson@13798
   172
lemma same_genPrefix_genPrefix [simp]: 
paulson@13798
   173
    "reflexive r ==> ((xs@ys, xs@zs) : genPrefix r) = ((ys,zs) : genPrefix r)"
paulson@13798
   174
apply (unfold refl_def)
paulson@13798
   175
apply (induct_tac "xs")
paulson@13798
   176
apply (simp_all (no_asm_simp))
paulson@13798
   177
done
paulson@13798
   178
paulson@13798
   179
lemma genPrefix_Cons:
paulson@13798
   180
     "((xs, y#ys) : genPrefix r) =  
paulson@13798
   181
      (xs=[] | (EX z zs. xs=z#zs & (z,y) : r & (zs,ys) : genPrefix r))"
paulson@13798
   182
by (case_tac "xs", auto)
paulson@13798
   183
paulson@13798
   184
lemma genPrefix_take_append:
paulson@13798
   185
     "[| reflexive r;  (xs,ys) : genPrefix r |]  
paulson@13798
   186
      ==>  (xs@zs, take (length xs) ys @ zs) : genPrefix r"
paulson@13798
   187
apply (erule genPrefix.induct)
paulson@13798
   188
apply (frule_tac [3] genPrefix_length_le)
paulson@13798
   189
apply (simp_all (no_asm_simp) add: diff_is_0_eq [THEN iffD2])
paulson@13798
   190
done
paulson@13798
   191
paulson@13798
   192
lemma genPrefix_append_both:
paulson@13798
   193
     "[| reflexive r;  (xs,ys) : genPrefix r;  length xs = length ys |]  
paulson@13798
   194
      ==>  (xs@zs, ys @ zs) : genPrefix r"
paulson@13798
   195
apply (drule genPrefix_take_append, assumption)
paulson@13798
   196
apply (simp add: take_all)
paulson@13798
   197
done
paulson@13798
   198
paulson@13798
   199
paulson@13798
   200
(*NOT suitable for rewriting since [y] has the form y#ys*)
paulson@13798
   201
lemma append_cons_eq: "xs @ y # ys = (xs @ [y]) @ ys"
paulson@13798
   202
by auto
paulson@13798
   203
paulson@13798
   204
lemma aolemma:
paulson@13798
   205
     "[| (xs,ys) : genPrefix r;  reflexive r |]  
paulson@13798
   206
      ==> length xs < length ys --> (xs @ [ys ! length xs], ys) : genPrefix r"
paulson@13798
   207
apply (erule genPrefix.induct)
paulson@13798
   208
  apply blast
paulson@13798
   209
 apply simp
paulson@13798
   210
txt{*Append case is hardest*}
paulson@13798
   211
apply simp
paulson@13798
   212
apply (frule genPrefix_length_le [THEN le_imp_less_or_eq])
paulson@13798
   213
apply (erule disjE)
paulson@13798
   214
apply (simp_all (no_asm_simp) add: neq_Nil_conv nth_append)
paulson@13798
   215
apply (blast intro: genPrefix.append, auto)
paulson@15481
   216
apply (subst append_cons_eq, fast intro: genPrefix_append_both genPrefix.append)
paulson@13798
   217
done
paulson@13798
   218
paulson@13798
   219
lemma append_one_genPrefix:
paulson@13798
   220
     "[| (xs,ys) : genPrefix r;  length xs < length ys;  reflexive r |]  
paulson@13798
   221
      ==> (xs @ [ys ! length xs], ys) : genPrefix r"
paulson@13798
   222
by (blast intro: aolemma [THEN mp])
paulson@13798
   223
paulson@13798
   224
paulson@13798
   225
(** Proving the equivalence with Charpentier's definition **)
paulson@13798
   226
paulson@13798
   227
lemma genPrefix_imp_nth [rule_format]:
paulson@13798
   228
     "ALL i ys. i < length xs  
paulson@13798
   229
                --> (xs, ys) : genPrefix r --> (xs ! i, ys ! i) : r"
paulson@13798
   230
apply (induct_tac "xs", auto)
paulson@13798
   231
apply (case_tac "i", auto)
paulson@13798
   232
done
paulson@13798
   233
paulson@13798
   234
lemma nth_imp_genPrefix [rule_format]:
paulson@13798
   235
     "ALL ys. length xs <= length ys   
paulson@13798
   236
      --> (ALL i. i < length xs --> (xs ! i, ys ! i) : r)   
paulson@13798
   237
      --> (xs, ys) : genPrefix r"
paulson@13798
   238
apply (induct_tac "xs")
paulson@13798
   239
apply (simp_all (no_asm_simp) add: less_Suc_eq_0_disj all_conj_distrib)
paulson@13798
   240
apply clarify
paulson@13798
   241
apply (case_tac "ys")
paulson@13798
   242
apply (force+)
paulson@13798
   243
done
paulson@13798
   244
paulson@13798
   245
lemma genPrefix_iff_nth:
paulson@13798
   246
     "((xs,ys) : genPrefix r) =  
paulson@13798
   247
      (length xs <= length ys & (ALL i. i < length xs --> (xs!i, ys!i) : r))"
paulson@13798
   248
apply (blast intro: genPrefix_length_le genPrefix_imp_nth nth_imp_genPrefix)
paulson@13798
   249
done
paulson@13798
   250
paulson@13798
   251
paulson@13798
   252
subsection{*The type of lists is partially ordered*}
paulson@13798
   253
paulson@13798
   254
declare reflexive_Id [iff] 
paulson@13798
   255
        antisym_Id [iff] 
paulson@13798
   256
        trans_Id [iff]
paulson@13798
   257
paulson@13798
   258
lemma prefix_refl [iff]: "xs <= (xs::'a list)"
paulson@13798
   259
by (simp add: prefix_def)
paulson@13798
   260
paulson@13798
   261
lemma prefix_trans: "!!xs::'a list. [| xs <= ys; ys <= zs |] ==> xs <= zs"
paulson@13798
   262
apply (unfold prefix_def)
paulson@13798
   263
apply (blast intro: genPrefix_trans)
paulson@13798
   264
done
paulson@13798
   265
paulson@13798
   266
lemma prefix_antisym: "!!xs::'a list. [| xs <= ys; ys <= xs |] ==> xs = ys"
paulson@13798
   267
apply (unfold prefix_def)
paulson@13798
   268
apply (blast intro: genPrefix_antisym)
paulson@13798
   269
done
paulson@13798
   270
paulson@13798
   271
lemma prefix_less_le: "!!xs::'a list. (xs < zs) = (xs <= zs & xs ~= zs)"
paulson@13798
   272
by (unfold strict_prefix_def, auto)
paulson@6708
   273
wenzelm@12338
   274
instance list :: (type) order
paulson@13798
   275
  by (intro_classes,
paulson@13798
   276
      (assumption | rule prefix_refl prefix_trans prefix_antisym
paulson@13798
   277
                     prefix_less_le)+)
paulson@13798
   278
paulson@13798
   279
(*Monotonicity of "set" operator WRT prefix*)
paulson@13798
   280
lemma set_mono: "xs <= ys ==> set xs <= set ys"
paulson@13798
   281
apply (unfold prefix_def)
paulson@13798
   282
apply (erule genPrefix.induct, auto)
paulson@13798
   283
done
paulson@13798
   284
paulson@13798
   285
paulson@13798
   286
(** recursion equations **)
paulson@13798
   287
paulson@13798
   288
lemma Nil_prefix [iff]: "[] <= xs"
paulson@13798
   289
apply (unfold prefix_def)
paulson@13798
   290
apply (simp add: Nil_genPrefix)
paulson@13798
   291
done
paulson@13798
   292
paulson@13798
   293
lemma prefix_Nil [simp]: "(xs <= []) = (xs = [])"
paulson@13798
   294
apply (unfold prefix_def)
paulson@13798
   295
apply (simp add: genPrefix_Nil)
paulson@13798
   296
done
paulson@13798
   297
paulson@13798
   298
lemma Cons_prefix_Cons [simp]: "(x#xs <= y#ys) = (x=y & xs<=ys)"
paulson@13798
   299
by (simp add: prefix_def)
paulson@13798
   300
paulson@13798
   301
lemma same_prefix_prefix [simp]: "(xs@ys <= xs@zs) = (ys <= zs)"
paulson@13798
   302
by (simp add: prefix_def)
paulson@13798
   303
paulson@13798
   304
lemma append_prefix [iff]: "(xs@ys <= xs) = (ys <= [])"
paulson@13798
   305
by (insert same_prefix_prefix [of xs ys "[]"], simp)
paulson@13798
   306
paulson@13798
   307
lemma prefix_appendI [simp]: "xs <= ys ==> xs <= ys@zs"
paulson@13798
   308
apply (unfold prefix_def)
paulson@13798
   309
apply (erule genPrefix.append)
paulson@13798
   310
done
paulson@13798
   311
paulson@13798
   312
lemma prefix_Cons: 
paulson@13798
   313
   "(xs <= y#ys) = (xs=[] | (? zs. xs=y#zs & zs <= ys))"
paulson@13798
   314
by (simp add: prefix_def genPrefix_Cons)
paulson@13798
   315
paulson@13798
   316
lemma append_one_prefix: 
paulson@13798
   317
  "[| xs <= ys; length xs < length ys |] ==> xs @ [ys ! length xs] <= ys"
paulson@13798
   318
apply (unfold prefix_def)
paulson@13798
   319
apply (simp add: append_one_genPrefix)
paulson@13798
   320
done
paulson@13798
   321
paulson@13798
   322
lemma prefix_length_le: "xs <= ys ==> length xs <= length ys"
paulson@13798
   323
apply (unfold prefix_def)
paulson@13798
   324
apply (erule genPrefix_length_le)
paulson@13798
   325
done
paulson@13798
   326
paulson@13798
   327
lemma splemma: "xs<=ys ==> xs~=ys --> length xs < length ys"
paulson@13798
   328
apply (unfold prefix_def)
paulson@13798
   329
apply (erule genPrefix.induct, auto)
paulson@13798
   330
done
paulson@13798
   331
paulson@13798
   332
lemma strict_prefix_length_less: "xs < ys ==> length xs < length ys"
paulson@13798
   333
apply (unfold strict_prefix_def)
paulson@13798
   334
apply (blast intro: splemma [THEN mp])
paulson@13798
   335
done
paulson@13798
   336
paulson@13798
   337
lemma mono_length: "mono length"
paulson@13798
   338
by (blast intro: monoI prefix_length_le)
paulson@13798
   339
paulson@13798
   340
(*Equivalence to the definition used in Lex/Prefix.thy*)
paulson@13798
   341
lemma prefix_iff: "(xs <= zs) = (EX ys. zs = xs@ys)"
paulson@13798
   342
apply (unfold prefix_def)
paulson@13798
   343
apply (auto simp add: genPrefix_iff_nth nth_append)
paulson@13798
   344
apply (rule_tac x = "drop (length xs) zs" in exI)
paulson@13798
   345
apply (rule nth_equalityI)
paulson@13798
   346
apply (simp_all (no_asm_simp) add: nth_append)
paulson@13798
   347
done
paulson@13798
   348
paulson@13798
   349
lemma prefix_snoc [simp]: "(xs <= ys@[y]) = (xs = ys@[y] | xs <= ys)"
paulson@13798
   350
apply (simp add: prefix_iff)
paulson@13798
   351
apply (rule iffI)
paulson@13798
   352
 apply (erule exE)
paulson@13798
   353
 apply (rename_tac "zs")
paulson@13798
   354
 apply (rule_tac xs = zs in rev_exhaust)
paulson@13798
   355
  apply simp
paulson@13798
   356
 apply clarify
paulson@13798
   357
 apply (simp del: append_assoc add: append_assoc [symmetric], force)
paulson@13798
   358
done
paulson@13798
   359
paulson@13798
   360
lemma prefix_append_iff:
paulson@13798
   361
     "(xs <= ys@zs) = (xs <= ys | (? us. xs = ys@us & us <= zs))"
paulson@13798
   362
apply (rule_tac xs = zs in rev_induct)
paulson@13798
   363
 apply force
paulson@13798
   364
apply (simp del: append_assoc add: append_assoc [symmetric], force)
paulson@13798
   365
done
paulson@13798
   366
paulson@13798
   367
(*Although the prefix ordering is not linear, the prefixes of a list
paulson@13798
   368
  are linearly ordered.*)
paulson@13798
   369
lemma common_prefix_linear [rule_format]:
paulson@13798
   370
     "!!zs::'a list. xs <= zs --> ys <= zs --> xs <= ys | ys <= xs"
paulson@13798
   371
by (rule_tac xs = zs in rev_induct, auto)
paulson@13798
   372
paulson@13798
   373
paulson@13798
   374
subsection{*pfixLe, pfixGe: properties inherited from the translations*}
paulson@13798
   375
paulson@13798
   376
(** pfixLe **)
paulson@13798
   377
paulson@13798
   378
lemma reflexive_Le [iff]: "reflexive Le"
paulson@13798
   379
by (unfold refl_def Le_def, auto)
paulson@13798
   380
paulson@13798
   381
lemma antisym_Le [iff]: "antisym Le"
paulson@13798
   382
by (unfold antisym_def Le_def, auto)
paulson@13798
   383
paulson@13798
   384
lemma trans_Le [iff]: "trans Le"
paulson@13798
   385
by (unfold trans_def Le_def, auto)
paulson@13798
   386
paulson@13798
   387
lemma pfixLe_refl [iff]: "x pfixLe x"
paulson@13798
   388
by simp
paulson@13798
   389
paulson@13798
   390
lemma pfixLe_trans: "[| x pfixLe y; y pfixLe z |] ==> x pfixLe z"
paulson@13798
   391
by (blast intro: genPrefix_trans)
paulson@13798
   392
paulson@13798
   393
lemma pfixLe_antisym: "[| x pfixLe y; y pfixLe x |] ==> x = y"
paulson@13798
   394
by (blast intro: genPrefix_antisym)
paulson@13798
   395
paulson@13798
   396
lemma prefix_imp_pfixLe: "xs<=ys ==> xs pfixLe ys"
paulson@13798
   397
apply (unfold prefix_def Le_def)
paulson@13798
   398
apply (blast intro: genPrefix_mono [THEN [2] rev_subsetD])
paulson@13798
   399
done
paulson@13798
   400
paulson@13798
   401
lemma reflexive_Ge [iff]: "reflexive Ge"
paulson@13798
   402
by (unfold refl_def Ge_def, auto)
paulson@13798
   403
paulson@13798
   404
lemma antisym_Ge [iff]: "antisym Ge"
paulson@13798
   405
by (unfold antisym_def Ge_def, auto)
paulson@13798
   406
paulson@13798
   407
lemma trans_Ge [iff]: "trans Ge"
paulson@13798
   408
by (unfold trans_def Ge_def, auto)
paulson@13798
   409
paulson@13798
   410
lemma pfixGe_refl [iff]: "x pfixGe x"
paulson@13798
   411
by simp
paulson@13798
   412
paulson@13798
   413
lemma pfixGe_trans: "[| x pfixGe y; y pfixGe z |] ==> x pfixGe z"
paulson@13798
   414
by (blast intro: genPrefix_trans)
paulson@13798
   415
paulson@13798
   416
lemma pfixGe_antisym: "[| x pfixGe y; y pfixGe x |] ==> x = y"
paulson@13798
   417
by (blast intro: genPrefix_antisym)
paulson@13798
   418
paulson@13798
   419
lemma prefix_imp_pfixGe: "xs<=ys ==> xs pfixGe ys"
paulson@13798
   420
apply (unfold prefix_def Ge_def)
paulson@13798
   421
apply (blast intro: genPrefix_mono [THEN [2] rev_subsetD])
paulson@13798
   422
done
paulson@6708
   423
paulson@6708
   424
end