src/HOL/Library/List_lexord.thy
author haftmann
Thu, 25 Jan 2007 09:32:36 +0100
changeset 22177 515021e98684
parent 21458 475b321982f7
child 22316 f662831459de
permissions -rw-r--r--
improved
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
15737
nipkow
parents:
diff changeset
     1
(*  Title:      HOL/Library/List_lexord.thy
nipkow
parents:
diff changeset
     2
    ID:         $Id$
nipkow
parents:
diff changeset
     3
    Author:     Norbert Voelker
nipkow
parents:
diff changeset
     4
*)
nipkow
parents:
diff changeset
     5
17200
3a4d03d1a31b tuned presentation;
wenzelm
parents: 15737
diff changeset
     6
header {* Lexicographic order on lists *}
15737
nipkow
parents:
diff changeset
     7
nipkow
parents:
diff changeset
     8
theory List_lexord
nipkow
parents:
diff changeset
     9
imports Main
nipkow
parents:
diff changeset
    10
begin
nipkow
parents:
diff changeset
    11
21458
475b321982f7 added code lemmas
haftmann
parents: 17200
diff changeset
    12
instance list :: (ord) ord
17200
3a4d03d1a31b tuned presentation;
wenzelm
parents: 15737
diff changeset
    13
  list_le_def:  "(xs::('a::ord) list) \<le> ys \<equiv> (xs < ys \<or> xs = ys)"
21458
475b321982f7 added code lemmas
haftmann
parents: 17200
diff changeset
    14
  list_less_def: "(xs::('a::ord) list) < ys \<equiv> (xs, ys) \<in> lexord {(u,v). u < v}" ..
15737
nipkow
parents:
diff changeset
    15
nipkow
parents:
diff changeset
    16
lemmas list_ord_defs = list_less_def list_le_def
nipkow
parents:
diff changeset
    17
17200
3a4d03d1a31b tuned presentation;
wenzelm
parents: 15737
diff changeset
    18
instance list :: (order) order
15737
nipkow
parents:
diff changeset
    19
  apply (intro_classes, unfold list_ord_defs)
17200
3a4d03d1a31b tuned presentation;
wenzelm
parents: 15737
diff changeset
    20
     apply (rule disjI2, safe)
3a4d03d1a31b tuned presentation;
wenzelm
parents: 15737
diff changeset
    21
    apply (blast intro: lexord_trans transI order_less_trans)
3a4d03d1a31b tuned presentation;
wenzelm
parents: 15737
diff changeset
    22
   apply (rule_tac r1 = "{(a::'a,b). a < b}" in lexord_irreflexive [THEN notE])
3a4d03d1a31b tuned presentation;
wenzelm
parents: 15737
diff changeset
    23
    apply simp
3a4d03d1a31b tuned presentation;
wenzelm
parents: 15737
diff changeset
    24
   apply (blast intro: lexord_trans transI order_less_trans)
15737
nipkow
parents:
diff changeset
    25
  apply (rule_tac r1 = "{(a::'a,b). a < b}" in lexord_irreflexive [THEN notE])
nipkow
parents:
diff changeset
    26
  apply simp
17200
3a4d03d1a31b tuned presentation;
wenzelm
parents: 15737
diff changeset
    27
  apply assumption
3a4d03d1a31b tuned presentation;
wenzelm
parents: 15737
diff changeset
    28
  done
15737
nipkow
parents:
diff changeset
    29
21458
475b321982f7 added code lemmas
haftmann
parents: 17200
diff changeset
    30
instance list :: (linorder) linorder
15737
nipkow
parents:
diff changeset
    31
  apply (intro_classes, unfold list_le_def list_less_def, safe)
17200
3a4d03d1a31b tuned presentation;
wenzelm
parents: 15737
diff changeset
    32
  apply (cut_tac x = x and y = y and  r = "{(a,b). a < b}"  in lexord_linear)
3a4d03d1a31b tuned presentation;
wenzelm
parents: 15737
diff changeset
    33
   apply force
3a4d03d1a31b tuned presentation;
wenzelm
parents: 15737
diff changeset
    34
  apply simp
3a4d03d1a31b tuned presentation;
wenzelm
parents: 15737
diff changeset
    35
  done
15737
nipkow
parents:
diff changeset
    36
22177
515021e98684 improved
haftmann
parents: 21458
diff changeset
    37
lemma not_less_Nil [simp]: "\<not> (x < [])"
17200
3a4d03d1a31b tuned presentation;
wenzelm
parents: 15737
diff changeset
    38
  by (unfold list_less_def) simp
15737
nipkow
parents:
diff changeset
    39
22177
515021e98684 improved
haftmann
parents: 21458
diff changeset
    40
lemma Nil_less_Cons [simp]: "[] < a # x"
17200
3a4d03d1a31b tuned presentation;
wenzelm
parents: 15737
diff changeset
    41
  by (unfold list_less_def) simp
15737
nipkow
parents:
diff changeset
    42
22177
515021e98684 improved
haftmann
parents: 21458
diff changeset
    43
lemma Cons_less_Cons [simp]: "a # x < b # y \<longleftrightarrow> a < b \<or> a = b \<and> x < y"
17200
3a4d03d1a31b tuned presentation;
wenzelm
parents: 15737
diff changeset
    44
  by (unfold list_less_def) simp
15737
nipkow
parents:
diff changeset
    45
22177
515021e98684 improved
haftmann
parents: 21458
diff changeset
    46
lemma le_Nil [simp]: "x \<le> [] \<longleftrightarrow> x = []"
515021e98684 improved
haftmann
parents: 21458
diff changeset
    47
  by (unfold list_ord_defs, cases x) auto
515021e98684 improved
haftmann
parents: 21458
diff changeset
    48
515021e98684 improved
haftmann
parents: 21458
diff changeset
    49
lemma Nil_le_Cons [simp]: "[] \<le> x"
17200
3a4d03d1a31b tuned presentation;
wenzelm
parents: 15737
diff changeset
    50
  by (unfold list_ord_defs, cases x) auto
15737
nipkow
parents:
diff changeset
    51
22177
515021e98684 improved
haftmann
parents: 21458
diff changeset
    52
lemma Cons_le_Cons [simp]: "a # x \<le> b # y \<longleftrightarrow> a < b \<or> a = b \<and> x \<le> y"
17200
3a4d03d1a31b tuned presentation;
wenzelm
parents: 15737
diff changeset
    53
  by (unfold list_ord_defs) auto
15737
nipkow
parents:
diff changeset
    54
22177
515021e98684 improved
haftmann
parents: 21458
diff changeset
    55
lemma less_code [code func]:
515021e98684 improved
haftmann
parents: 21458
diff changeset
    56
  "xs < ([]\<Colon>'a\<Colon>{eq, order} list) \<longleftrightarrow> False"
515021e98684 improved
haftmann
parents: 21458
diff changeset
    57
  "[] < (x\<Colon>'a\<Colon>{eq, order}) # xs \<longleftrightarrow> True"
515021e98684 improved
haftmann
parents: 21458
diff changeset
    58
  "(x\<Colon>'a\<Colon>{eq, order}) # xs < y # ys \<longleftrightarrow> x < y \<or> x = y \<and> xs < ys"
515021e98684 improved
haftmann
parents: 21458
diff changeset
    59
  by simp_all
515021e98684 improved
haftmann
parents: 21458
diff changeset
    60
515021e98684 improved
haftmann
parents: 21458
diff changeset
    61
lemma less_eq_code [code func]:
515021e98684 improved
haftmann
parents: 21458
diff changeset
    62
  "x # xs \<le> ([]\<Colon>'a\<Colon>{eq, order} list) \<longleftrightarrow> False"
515021e98684 improved
haftmann
parents: 21458
diff changeset
    63
  "[] \<le> (xs\<Colon>'a\<Colon>{eq, order} list) \<longleftrightarrow> True"
515021e98684 improved
haftmann
parents: 21458
diff changeset
    64
  "(x\<Colon>'a\<Colon>{eq, order}) # xs \<le> y # ys \<longleftrightarrow> x < y \<or> x = y \<and> xs \<le> ys"
515021e98684 improved
haftmann
parents: 21458
diff changeset
    65
  by simp_all
515021e98684 improved
haftmann
parents: 21458
diff changeset
    66
17200
3a4d03d1a31b tuned presentation;
wenzelm
parents: 15737
diff changeset
    67
end