src/HOL/Orderings.thy
author haftmann
Wed, 08 Nov 2006 19:46:10 +0100
changeset 21248 3fd22b0939ff
parent 21216 1c8580913738
child 21259 63ab016c99ca
permissions -rw-r--r--
abstract ordering theories
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
     1
(*  Title:      HOL/Orderings.thy
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
     2
    ID:         $Id$
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
     3
    Author:     Tobias Nipkow, Markus Wenzel, and Larry Paulson
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
     4
*)
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
     5
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
     6
header {* Abstract orderings *}
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
     7
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
     8
theory Orderings
21216
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
     9
imports Code_Generator
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    10
begin
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    11
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
    12
section {* Abstract orderings *}
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
    13
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
    14
subsection {* Order signatures *}
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    15
21194
7e48158e50f6 removed dependency of ord on eq
haftmann
parents: 21180
diff changeset
    16
class ord =
20588
c847c56edf0c added operational equality
haftmann
parents: 19984
diff changeset
    17
  fixes less_eq :: "'a \<Rightarrow> 'a \<Rightarrow> bool"
21204
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    18
    and less :: "'a \<Rightarrow> 'a \<Rightarrow> bool"
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    19
begin
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    20
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    21
notation
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    22
  less_eq  ("op \<^loc><=")
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    23
  less_eq  ("(_/ \<^loc><= _)" [50, 51] 50)
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    24
  less  ("op \<^loc><")
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    25
  less  ("(_/ \<^loc>< _)"  [50, 51] 50)
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    26
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    27
notation (xsymbols)
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    28
  less_eq  ("op \<^loc>\<le>")
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    29
  less_eq  ("(_/ \<^loc>\<le> _)"  [50, 51] 50)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    30
21204
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    31
notation (HTML output)
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    32
  less_eq  ("op \<^loc>\<le>")
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    33
  less_eq  ("(_/ \<^loc>\<le> _)"  [50, 51] 50)
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    34
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    35
abbreviation (input)
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    36
  greater  (infix "\<^loc>>" 50)
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    37
  "x \<^loc>> y \<equiv> y \<^loc>< x"
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    38
  greater_eq  (infix "\<^loc>>=" 50)
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    39
  "x \<^loc>>= y \<equiv> y \<^loc><= x"
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    40
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    41
notation (xsymbols)
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    42
  greater_eq  (infixl "\<^loc>\<ge>" 50)
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    43
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    44
end
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    45
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    46
notation
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    47
  less_eq  ("op <=")
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    48
  less_eq  ("(_/ <= _)" [50, 51] 50)
21204
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    49
  less  ("op <")
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    50
  less  ("(_/ < _)"  [50, 51] 50)
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    51
  
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    52
notation (xsymbols)
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    53
  less_eq  ("op \<le>")
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    54
  less_eq  ("(_/ \<le> _)"  [50, 51] 50)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    55
21204
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    56
notation (HTML output)
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    57
  less_eq  ("op \<le>")
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    58
  less_eq  ("(_/ \<le> _)"  [50, 51] 50)
20714
6a122dba034c tuned syntax for <= <
haftmann
parents: 20588
diff changeset
    59
19536
1a3a3cf8b4fa replaced syntax/translations by abbreviation;
wenzelm
parents: 19527
diff changeset
    60
abbreviation (input)
1a3a3cf8b4fa replaced syntax/translations by abbreviation;
wenzelm
parents: 19527
diff changeset
    61
  greater  (infixl ">" 50)
20714
6a122dba034c tuned syntax for <= <
haftmann
parents: 20588
diff changeset
    62
  "x > y \<equiv> y < x"
19536
1a3a3cf8b4fa replaced syntax/translations by abbreviation;
wenzelm
parents: 19527
diff changeset
    63
  greater_eq  (infixl ">=" 50)
20714
6a122dba034c tuned syntax for <= <
haftmann
parents: 20588
diff changeset
    64
  "x >= y \<equiv> y <= x"
6a122dba034c tuned syntax for <= <
haftmann
parents: 20588
diff changeset
    65
  
21204
1e96553668c6 renamed 'const_syntax' to 'notation';
wenzelm
parents: 21194
diff changeset
    66
notation (xsymbols)
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    67
  greater_eq  (infixl "\<ge>" 50)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    68
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    69
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
    70
subsection {* Partial orderings *}
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    71
21216
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
    72
locale partial_order =
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
    73
  fixes below :: "'a \<Rightarrow> 'a \<Rightarrow> bool" (infixl "\<sqsubseteq>" 50)
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
    74
  fixes less :: "'a \<Rightarrow> 'a \<Rightarrow> bool" (infixl "\<sqsubset>" 50)
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
    75
  assumes refl [iff]: "x \<sqsubseteq> x"
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
    76
  and trans: "x \<sqsubseteq> y \<Longrightarrow> y \<sqsubseteq> z \<Longrightarrow> x \<sqsubseteq> z"
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
    77
  and antisym: "x \<sqsubseteq> y \<Longrightarrow> y \<sqsubseteq> x \<Longrightarrow> x = y"
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
    78
  and less_le: "x \<sqsubset> y \<longleftrightarrow> x \<sqsubseteq> y \<and> x \<noteq> y"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
    79
begin
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
    80
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
    81
abbreviation (input)
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
    82
  greater_eq (infixl "\<sqsupseteq>" 50)
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
    83
  "x \<sqsupseteq> y \<equiv> y \<sqsubseteq> x"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
    84
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
    85
abbreviation (input)
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
    86
  greater (infixl "\<sqsupset>" 50)
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
    87
  "x \<sqsupset> y \<equiv> y \<sqsubset> x"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
    88
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
    89
end
21216
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
    90
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    91
axclass order < ord
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    92
  order_refl [iff]: "x <= x"
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    93
  order_trans: "x <= y ==> y <= z ==> x <= z"
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    94
  order_antisym: "x <= y ==> y <= x ==> x = y"
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    95
  order_less_le: "(x < y) = (x <= y & x ~= y)"
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    96
15837
7a567dcd4cda Subsumption of locale interpretations.
ballarin
parents: 15822
diff changeset
    97
interpretation order:
21216
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
    98
  partial_order ["op \<le> \<Colon> 'a\<Colon>order \<Rightarrow> 'a \<Rightarrow> bool" "op < \<Colon> 'a\<Colon>order \<Rightarrow> 'a \<Rightarrow> bool"]
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    99
apply(rule partial_order.intro)
21216
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
   100
apply(rule order_refl, erule (1) order_trans, erule (1) order_antisym, rule order_less_le)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   101
done
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   102
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   103
context partial_order
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   104
begin
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   105
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   106
text {* Reflexivity. *}
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   107
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   108
lemma eq_refl: "x = y \<Longrightarrow> x \<sqsubseteq> y"
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   109
    -- {* This form is useful with the classical reasoner. *}
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   110
  by (erule ssubst) (rule refl)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   111
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   112
lemma less_irrefl [iff]: "\<not> x \<sqsubset> x"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   113
  by (simp add: less_le)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   114
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   115
lemma le_less: "x \<sqsubseteq> y \<longleftrightarrow> x \<sqsubset> y \<or> x = y"
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   116
    -- {* NOT suitable for iff, since it can cause PROOF FAILED. *}
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   117
  by (simp add: less_le) blast
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   118
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   119
lemma le_imp_less_or_eq: "x \<sqsubseteq> y \<Longrightarrow> x \<sqsubset> y \<or> x = y"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   120
  unfolding less_le by blast
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   121
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   122
lemma less_imp_le: "x \<sqsubset> y \<Longrightarrow> x \<sqsubseteq> y"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   123
  unfolding less_le by blast
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   124
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   125
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   126
text {* Asymmetry. *}
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   127
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   128
lemma less_not_sym: "x \<sqsubset> y \<Longrightarrow> \<not> (y \<sqsubset> x)"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   129
  by (simp add: less_le antisym)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   130
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   131
lemma less_asym: "x \<sqsubset> y \<Longrightarrow> (\<not> P \<Longrightarrow> y \<sqsubset> x) \<Longrightarrow> P"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   132
  by (drule less_not_sym, erule contrapos_np) simp
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   133
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   134
lemma eq_iff: "x = y \<longleftrightarrow> x \<sqsubseteq> y \<and> y \<sqsubseteq> x"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   135
  by (blast intro: antisym)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   136
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   137
lemma antisym_conv: "y \<sqsubseteq> x \<Longrightarrow> x \<sqsubseteq> y \<longleftrightarrow> x = y"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   138
  by (blast intro: antisym)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   139
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   140
lemma less_imp_neq: "x \<sqsubset> y \<Longrightarrow> x \<noteq> y"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   141
  by (erule contrapos_pn, erule subst, rule less_irrefl)
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   142
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   143
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   144
text {* Transitivity. *}
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   145
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   146
lemma less_trans: "\<lbrakk> x \<sqsubset> y; y \<sqsubset> z \<rbrakk> \<Longrightarrow> x \<sqsubset> z"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   147
  by (simp add: less_le) (blast intro: trans antisym)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   148
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   149
lemma le_less_trans: "\<lbrakk> x \<sqsubseteq> y; y \<sqsubset> z \<rbrakk> \<Longrightarrow> x \<sqsubset> z"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   150
  by (simp add: less_le) (blast intro: trans antisym)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   151
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   152
lemma less_le_trans: "\<lbrakk> x \<sqsubset> y; y \<sqsubseteq> z \<rbrakk> \<Longrightarrow> x \<sqsubset> z"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   153
  by (simp add: less_le) (blast intro: trans antisym)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   154
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   155
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   156
text {* Useful for simplification, but too risky to include by default. *}
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   157
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   158
lemma less_imp_not_less: "x \<sqsubset> y \<Longrightarrow> (\<not> y \<sqsubset> x) \<longleftrightarrow> True"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   159
  by (blast elim: less_asym)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   160
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   161
lemma less_imp_triv: "x \<sqsubset> y \<Longrightarrow> (y \<sqsubset> x \<longrightarrow> P) \<longleftrightarrow> True"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   162
  by (blast elim: less_asym)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   163
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   164
lemma less_imp_not_eq: "x \<sqsubset> y \<Longrightarrow> (x = y) \<longleftrightarrow> False"
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   165
  by auto
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   166
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   167
lemma less_imp_not_eq2: "x \<sqsubset> y \<Longrightarrow> (y = x) \<longleftrightarrow> False"
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   168
  by auto
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   169
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   170
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   171
text {* Transitivity rules for calculational reasoning *}
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   172
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   173
lemma neq_le_trans: "\<lbrakk> a \<noteq> b; a \<sqsubseteq> b \<rbrakk> \<Longrightarrow> a \<sqsubset> b"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   174
  by (simp add: less_le)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   175
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   176
lemma le_neq_trans: "\<lbrakk> a \<sqsubseteq> b; a \<noteq> b \<rbrakk> \<Longrightarrow> a \<sqsubset> b"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   177
  by (simp add: less_le)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   178
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   179
lemma less_asym': "\<lbrakk> a \<sqsubset> b; b \<sqsubset> a \<rbrakk> \<Longrightarrow> P"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   180
  by (rule less_asym)
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   181
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   182
end
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   183
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   184
21216
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
   185
subsection {* Linear (total) orderings *}
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
   186
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
   187
locale linear_order = partial_order +
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
   188
  assumes linear: "x \<sqsubseteq> y \<or> y \<sqsubseteq> x"
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   189
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   190
axclass linorder < order
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   191
  linorder_linear: "x <= y | y <= x"
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   192
21216
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
   193
interpretation linorder:
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
   194
  linear_order ["op \<le> \<Colon> 'a\<Colon>linorder \<Rightarrow> 'a \<Rightarrow> bool" "op < \<Colon> 'a\<Colon>linorder \<Rightarrow> 'a \<Rightarrow> bool"]
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
   195
  by unfold_locales (rule linorder_linear)
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
   196
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   197
context linear_order
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   198
begin
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   199
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   200
lemma trichotomy: "x \<sqsubset> y \<or> x = y \<or> y \<sqsubset> x"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   201
  unfolding less_le using less_le linear by blast 
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   202
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   203
lemma le_less_linear: "x \<sqsubseteq> y \<or> y \<sqsubset> x"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   204
  by (simp add: le_less trichotomy)
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   205
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   206
lemma le_cases [case_names le ge]:
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   207
  "\<lbrakk> x \<sqsubseteq> y \<Longrightarrow> P; y \<sqsubseteq> x \<Longrightarrow> P\<rbrakk> \<Longrightarrow> P"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   208
  using linear by blast
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   209
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   210
lemma cases [case_names less equal greater]:
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   211
    "\<lbrakk> x \<sqsubset> y \<Longrightarrow> P; x = y \<Longrightarrow> P; y \<sqsubset> x \<Longrightarrow> P\<rbrakk> \<Longrightarrow> P"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   212
  using trichotomy by blast
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   213
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   214
lemma not_less: "\<not> x \<sqsubset> y \<longleftrightarrow> y \<sqsubseteq> x"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   215
  apply (simp add: less_le)
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   216
  using linear apply (blast intro: antisym)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   217
  done
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   218
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   219
lemma not_le: "\<not> x \<sqsubseteq> y \<longleftrightarrow> y \<sqsubset> x"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   220
  apply (simp add: less_le)
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   221
  using linear apply (blast intro: antisym)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   222
  done
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   223
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   224
lemma neq_iff: "x \<noteq> y \<longleftrightarrow> x \<sqsubset> y \<or> y \<sqsubset> x"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   225
  by (cut_tac x = x and y = y in trichotomy, auto)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   226
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   227
lemma neqE: "\<lbrakk> x \<noteq> y; x \<sqsubset> y \<Longrightarrow> R; y \<sqsubset> x \<Longrightarrow> R\<rbrakk> \<Longrightarrow> R"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   228
  by (simp add: neq_iff) blast
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   229
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   230
lemma antisym_conv1: "\<not> x \<sqsubset> y \<Longrightarrow> x \<sqsubseteq> y \<longleftrightarrow> x = y"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   231
  by (blast intro: antisym dest: not_less [THEN iffD1])
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   232
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   233
lemma antisym_conv2: "x \<sqsubseteq> y \<Longrightarrow> \<not> x \<sqsubset> y \<longleftrightarrow> x = y"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   234
  by (blast intro: antisym dest: not_less [THEN iffD1])
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   235
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   236
lemma antisym_conv3: "\<not> y \<sqsubset> x \<Longrightarrow> \<not> x \<sqsubset> y \<longleftrightarrow> x = y"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   237
  by (blast intro: antisym dest: not_less [THEN iffD1])
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   238
16796
140f1e0ea846 generlization of some "nat" theorems
paulson
parents: 16743
diff changeset
   239
text{*Replacing the old Nat.leI*}
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   240
lemma leI: "\<not> x \<sqsubset> y \<Longrightarrow> y \<sqsubseteq> x"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   241
  unfolding not_less .
16796
140f1e0ea846 generlization of some "nat" theorems
paulson
parents: 16743
diff changeset
   242
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   243
lemma leD: "y \<sqsubseteq> x \<Longrightarrow> \<not> x \<sqsubset> y"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   244
  unfolding not_less .
16796
140f1e0ea846 generlization of some "nat" theorems
paulson
parents: 16743
diff changeset
   245
140f1e0ea846 generlization of some "nat" theorems
paulson
parents: 16743
diff changeset
   246
(*FIXME inappropriate name (or delete altogether)*)
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   247
lemma not_leE: "\<not> y \<sqsubseteq> x \<Longrightarrow> x \<sqsubset> y"
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   248
  unfolding not_le .
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   249
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   250
end
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   251
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   252
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   253
subsection {* Name duplicates *}
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   254
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   255
lemmas order_eq_refl [where 'b = "?'a::order"] = order.eq_refl
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   256
lemmas order_less_irrefl [where 'b = "?'a::order"] = order.less_irrefl
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   257
lemmas order_le_less [where 'b = "?'a::order"] = order.le_less
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   258
lemmas order_le_imp_less_or_eq [where 'b = "?'a::order"] = order.le_imp_less_or_eq
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   259
lemmas order_less_imp_le [where 'b = "?'a::order"] = order.less_imp_le
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   260
lemmas order_less_not_sym [where 'b = "?'a::order"] = order.less_not_sym
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   261
lemmas order_less_asym [where 'b = "?'a::order"] = order.less_asym
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   262
lemmas order_eq_iff [where 'b = "?'a::order"] = order.eq_iff
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   263
lemmas order_antisym_conv [where 'b = "?'a::order"] = order.antisym_conv
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   264
lemmas less_imp_neq [where 'b = "?'a::order"] = order.less_imp_neq
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   265
lemmas order_less_trans [where 'b = "?'a::order"] = order.less_trans
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   266
lemmas order_le_less_trans [where 'b = "?'a::order"] = order.le_less_trans
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   267
lemmas order_less_le_trans [where 'b = "?'a::order"] = order.less_le_trans
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   268
lemmas order_less_imp_not_less [where 'b = "?'a::order"] = order.less_imp_not_less
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   269
lemmas order_less_imp_triv [where 'b = "?'a::order"] = order.less_imp_triv
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   270
lemmas order_less_imp_not_eq [where 'b = "?'a::order"] = order.less_imp_not_eq
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   271
lemmas order_less_imp_not_eq2 [where 'b = "?'a::order"] = order.less_imp_not_eq2
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   272
lemmas order_neq_le_trans [where 'b = "?'a::order"] = order.neq_le_trans
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   273
lemmas order_le_neq_trans [where 'b = "?'a::order"] = order.le_neq_trans
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   274
lemmas order_less_asym' [where 'b = "?'a::order"] = order.less_asym'
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   275
lemmas linorder_less_linear [where 'b = "?'a::linorder"] = linorder.trichotomy
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   276
lemmas linorder_le_less_linear [where 'b = "?'a::linorder"] = linorder.le_less_linear
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   277
lemmas linorder_le_cases [where 'b = "?'a::linorder"] = linorder.le_cases
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   278
lemmas linorder_cases [where 'b = "?'a::linorder"] = linorder.cases
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   279
lemmas linorder_not_less [where 'b = "?'a::linorder"] = linorder.not_less
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   280
lemmas linorder_not_le [where 'b = "?'a::linorder"] = linorder.not_le
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   281
lemmas linorder_neq_iff [where 'b = "?'a::linorder"] = linorder.neq_iff
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   282
lemmas linorder_neqE [where 'b = "?'a::linorder"] = linorder.neqE
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   283
lemmas linorder_antisym_conv1 [where 'b = "?'a::linorder"] = linorder.antisym_conv1
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   284
lemmas linorder_antisym_conv2 [where 'b = "?'a::linorder"] = linorder.antisym_conv2
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   285
lemmas linorder_antisym_conv3 [where 'b = "?'a::linorder"] = linorder.antisym_conv3
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   286
lemmas leI [where 'b = "?'a::linorder"] = linorder.leI
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   287
lemmas leD [where 'b = "?'a::linorder"] = linorder.leD
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   288
lemmas not_leE [where 'b = "?'a::linorder"] = linorder.not_leE
16796
140f1e0ea846 generlization of some "nat" theorems
paulson
parents: 16743
diff changeset
   289
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   290
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   291
subsection {* Reasoning tools setup *}
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   292
21091
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   293
ML {*
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   294
local
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   295
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   296
fun decomp_gen sort thy (Trueprop $ t) =
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   297
  let
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   298
    fun of_sort t =
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   299
      let
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   300
        val T = type_of t
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   301
      in
21091
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   302
        (* exclude numeric types: linear arithmetic subsumes transitivity *)
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   303
        T <> HOLogic.natT andalso T <> HOLogic.intT
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   304
          andalso T <> HOLogic.realT andalso Sign.of_sort thy (T, sort)
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   305
      end;
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   306
    fun dec (Const ("Not", _) $ t) = (case dec t
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   307
          of NONE => NONE
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   308
           | SOME (t1, rel, t2) => SOME (t1, "~" ^ rel, t2))
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   309
      | dec (Const ("op =",  _) $ t1 $ t2) =
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   310
          if of_sort t1
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   311
          then SOME (t1, "=", t2)
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   312
          else NONE
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   313
      | dec (Const ("Orderings.less_eq",  _) $ t1 $ t2) =
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   314
          if of_sort t1
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   315
          then SOME (t1, "<=", t2)
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   316
          else NONE
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   317
      | dec (Const ("Orderings.less",  _) $ t1 $ t2) =
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   318
          if of_sort t1
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   319
          then SOME (t1, "<", t2)
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   320
          else NONE
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   321
      | dec _ = NONE;
21091
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   322
  in dec t end;
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   323
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   324
in
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   325
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   326
(* The setting up of Quasi_Tac serves as a demo.  Since there is no
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   327
   class for quasi orders, the tactics Quasi_Tac.trans_tac and
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   328
   Quasi_Tac.quasi_tac are not of much use. *)
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   329
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   330
structure Quasi_Tac = Quasi_Tac_Fun (
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   331
struct
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   332
  val le_trans = thm "order_trans";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   333
  val le_refl = thm "order_refl";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   334
  val eqD1 = thm "order_eq_refl";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   335
  val eqD2 = thm "sym" RS thm "order_eq_refl";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   336
  val less_reflE = thm "order_less_irrefl" RS thm "notE";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   337
  val less_imp_le = thm "order_less_imp_le";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   338
  val le_neq_trans = thm "order_le_neq_trans";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   339
  val neq_le_trans = thm "order_neq_le_trans";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   340
  val less_imp_neq = thm "less_imp_neq";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   341
  val decomp_trans = decomp_gen ["Orderings.order"];
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   342
  val decomp_quasi = decomp_gen ["Orderings.order"];
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   343
end);
21091
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   344
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   345
structure Order_Tac = Order_Tac_Fun (
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   346
struct
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   347
  val less_reflE = thm "order_less_irrefl" RS thm "notE";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   348
  val le_refl = thm "order_refl";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   349
  val less_imp_le = thm "order_less_imp_le";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   350
  val not_lessI = thm "linorder_not_less" RS thm "iffD2";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   351
  val not_leI = thm "linorder_not_le" RS thm "iffD2";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   352
  val not_lessD = thm "linorder_not_less" RS thm "iffD1";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   353
  val not_leD = thm "linorder_not_le" RS thm "iffD1";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   354
  val eqI = thm "order_antisym";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   355
  val eqD1 = thm "order_eq_refl";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   356
  val eqD2 = thm "sym" RS thm "order_eq_refl";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   357
  val less_trans = thm "order_less_trans";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   358
  val less_le_trans = thm "order_less_le_trans";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   359
  val le_less_trans = thm "order_le_less_trans";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   360
  val le_trans = thm "order_trans";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   361
  val le_neq_trans = thm "order_le_neq_trans";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   362
  val neq_le_trans = thm "order_neq_le_trans";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   363
  val less_imp_neq = thm "less_imp_neq";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   364
  val eq_neq_eq_imp_neq = thm "eq_neq_eq_imp_neq";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   365
  val not_sym = thm "not_sym";
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   366
  val decomp_part = decomp_gen ["Orderings.order"];
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   367
  val decomp_lin = decomp_gen ["Orderings.linorder"];
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   368
end);
21091
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   369
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   370
end;
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   371
*}
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   372
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   373
setup {*
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   374
let
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   375
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   376
val order_antisym_conv = thm "order_antisym_conv"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   377
val linorder_antisym_conv1 = thm "linorder_antisym_conv1"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   378
val linorder_antisym_conv2 = thm "linorder_antisym_conv2"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   379
val linorder_antisym_conv3 = thm "linorder_antisym_conv3"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   380
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   381
fun prp t thm = (#prop (rep_thm thm) = t);
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   382
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   383
fun prove_antisym_le sg ss ((le as Const(_,T)) $ r $ s) =
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   384
  let val prems = prems_of_ss ss;
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   385
      val less = Const("Orderings.less",T);
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   386
      val t = HOLogic.mk_Trueprop(le $ s $ r);
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   387
  in case find_first (prp t) prems of
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   388
       NONE =>
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   389
         let val t = HOLogic.mk_Trueprop(HOLogic.Not $ (less $ r $ s))
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   390
         in case find_first (prp t) prems of
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   391
              NONE => NONE
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   392
            | SOME thm => SOME(mk_meta_eq(thm RS linorder_antisym_conv1))
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   393
         end
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   394
     | SOME thm => SOME(mk_meta_eq(thm RS order_antisym_conv))
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   395
  end
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   396
  handle THM _ => NONE;
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   397
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   398
fun prove_antisym_less sg ss (NotC $ ((less as Const(_,T)) $ r $ s)) =
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   399
  let val prems = prems_of_ss ss;
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   400
      val le = Const("Orderings.less_eq",T);
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   401
      val t = HOLogic.mk_Trueprop(le $ r $ s);
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   402
  in case find_first (prp t) prems of
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   403
       NONE =>
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   404
         let val t = HOLogic.mk_Trueprop(NotC $ (less $ s $ r))
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   405
         in case find_first (prp t) prems of
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   406
              NONE => NONE
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   407
            | SOME thm => SOME(mk_meta_eq(thm RS linorder_antisym_conv3))
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   408
         end
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   409
     | SOME thm => SOME(mk_meta_eq(thm RS linorder_antisym_conv2))
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   410
  end
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   411
  handle THM _ => NONE;
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   412
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   413
fun add_simprocs procs thy =
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   414
  (Simplifier.change_simpset_of thy (fn ss => ss
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   415
    addsimprocs (map (fn (name, raw_ts, proc) =>
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   416
      Simplifier.simproc thy name raw_ts proc)) procs); thy);
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   417
fun add_solver name tac thy =
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   418
  (Simplifier.change_simpset_of thy (fn ss => ss addSolver
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   419
    (mk_solver name (K tac))); thy);
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   420
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   421
in
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   422
  add_simprocs [
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   423
       ("antisym le", ["(x::'a::order) <= y"], prove_antisym_le),
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   424
       ("antisym less", ["~ (x::'a::linorder) < y"], prove_antisym_less)
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   425
     ]
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   426
  #> add_solver "Trans_linear" Order_Tac.linear_tac
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   427
  #> add_solver "Trans_partial" Order_Tac.partial_tac
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   428
  (* Adding the transitivity reasoners also as safe solvers showed a slight
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   429
     speed up, but the reasoning strength appears to be not higher (at least
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   430
     no breaking of additional proofs in the entire HOL distribution, as
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   431
     of 5 March 2004, was observed). *)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   432
end
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   433
*}
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   434
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   435
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   436
subsection {* Bounded quantifiers *}
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   437
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   438
syntax
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   439
  "_All_less" :: "[idt, 'a, bool] => bool"    ("(3ALL _<_./ _)"  [0, 0, 10] 10)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   440
  "_Ex_less" :: "[idt, 'a, bool] => bool"    ("(3EX _<_./ _)"  [0, 0, 10] 10)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   441
  "_All_less_eq" :: "[idt, 'a, bool] => bool"    ("(3ALL _<=_./ _)" [0, 0, 10] 10)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   442
  "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3EX _<=_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   443
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   444
  "_All_greater" :: "[idt, 'a, bool] => bool"    ("(3ALL _>_./ _)"  [0, 0, 10] 10)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   445
  "_Ex_greater" :: "[idt, 'a, bool] => bool"    ("(3EX _>_./ _)"  [0, 0, 10] 10)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   446
  "_All_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3ALL _>=_./ _)" [0, 0, 10] 10)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   447
  "_Ex_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3EX _>=_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   448
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   449
syntax (xsymbols)
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   450
  "_All_less" :: "[idt, 'a, bool] => bool"    ("(3\<forall>_<_./ _)"  [0, 0, 10] 10)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   451
  "_Ex_less" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_<_./ _)"  [0, 0, 10] 10)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   452
  "_All_less_eq" :: "[idt, 'a, bool] => bool"    ("(3\<forall>_\<le>_./ _)" [0, 0, 10] 10)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   453
  "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<le>_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   454
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   455
  "_All_greater" :: "[idt, 'a, bool] => bool"    ("(3\<forall>_>_./ _)"  [0, 0, 10] 10)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   456
  "_Ex_greater" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_>_./ _)"  [0, 0, 10] 10)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   457
  "_All_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3\<forall>_\<ge>_./ _)" [0, 0, 10] 10)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   458
  "_Ex_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<ge>_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   459
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   460
syntax (HOL)
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   461
  "_All_less" :: "[idt, 'a, bool] => bool"    ("(3! _<_./ _)"  [0, 0, 10] 10)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   462
  "_Ex_less" :: "[idt, 'a, bool] => bool"    ("(3? _<_./ _)"  [0, 0, 10] 10)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   463
  "_All_less_eq" :: "[idt, 'a, bool] => bool"    ("(3! _<=_./ _)" [0, 0, 10] 10)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   464
  "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3? _<=_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   465
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   466
syntax (HTML output)
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   467
  "_All_less" :: "[idt, 'a, bool] => bool"    ("(3\<forall>_<_./ _)"  [0, 0, 10] 10)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   468
  "_Ex_less" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_<_./ _)"  [0, 0, 10] 10)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   469
  "_All_less_eq" :: "[idt, 'a, bool] => bool"    ("(3\<forall>_\<le>_./ _)" [0, 0, 10] 10)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   470
  "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<le>_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   471
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   472
  "_All_greater" :: "[idt, 'a, bool] => bool"    ("(3\<forall>_>_./ _)"  [0, 0, 10] 10)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   473
  "_Ex_greater" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_>_./ _)"  [0, 0, 10] 10)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   474
  "_All_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3\<forall>_\<ge>_./ _)" [0, 0, 10] 10)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   475
  "_Ex_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<ge>_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   476
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   477
translations
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   478
  "ALL x<y. P"   =>  "ALL x. x < y \<longrightarrow> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   479
  "EX x<y. P"    =>  "EX x. x < y \<and> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   480
  "ALL x<=y. P"  =>  "ALL x. x <= y \<longrightarrow> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   481
  "EX x<=y. P"   =>  "EX x. x <= y \<and> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   482
  "ALL x>y. P"   =>  "ALL x. x > y \<longrightarrow> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   483
  "EX x>y. P"    =>  "EX x. x > y \<and> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   484
  "ALL x>=y. P"  =>  "ALL x. x >= y \<longrightarrow> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   485
  "EX x>=y. P"   =>  "EX x. x >= y \<and> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   486
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   487
print_translation {*
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   488
let
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   489
  val syntax_name = Sign.const_syntax_name (the_context ());
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   490
  val impl = syntax_name "op -->";
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   491
  val conj = syntax_name "op &";
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   492
  val less = syntax_name "Orderings.less";
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   493
  val less_eq = syntax_name "Orderings.less_eq";
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   494
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   495
  val trans =
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   496
   [(("ALL ", impl, less), ("_All_less", "_All_greater")),
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   497
    (("ALL ", impl, less_eq), ("_All_less_eq", "_All_greater_eq")),
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   498
    (("EX ", conj, less), ("_Ex_less", "_Ex_greater")),
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   499
    (("EX ", conj, less_eq), ("_Ex_less_eq", "_Ex_greater_eq"))];
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   500
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   501
  fun mk v v' c n P =
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   502
    if v = v' andalso not (Term.exists_subterm (fn Free (x, _) => x = v | _ => false) n)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   503
    then Syntax.const c $ Syntax.mark_bound v' $ n $ P else raise Match;
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   504
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   505
  fun tr' q = (q,
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   506
    fn [Const ("_bound", _) $ Free (v, _), Const (c, _) $ (Const (d, _) $ t $ u) $ P] =>
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   507
      (case AList.lookup (op =) trans (q, c, d) of
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   508
        NONE => raise Match
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   509
      | SOME (l, g) =>
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   510
          (case (t, u) of
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   511
            (Const ("_bound", _) $ Free (v', _), n) => mk v v' l n P
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   512
          | (n, Const ("_bound", _) $ Free (v', _)) => mk v v' g n P
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   513
          | _ => raise Match))
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   514
     | _ => raise Match);
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   515
in [tr' "ALL ", tr' "EX "] end
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   516
*}
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   517
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   518
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   519
subsection {* Transitivity reasoning on decreasing inequalities *}
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   520
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   521
(* FIXME cleanup *)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   522
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   523
text {* These support proving chains of decreasing inequalities
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   524
    a >= b >= c ... in Isar proofs. *}
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   525
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   526
lemma xt1:
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   527
  "a = b ==> b > c ==> a > c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   528
  "a > b ==> b = c ==> a > c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   529
  "a = b ==> b >= c ==> a >= c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   530
  "a >= b ==> b = c ==> a >= c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   531
  "(x::'a::order) >= y ==> y >= x ==> x = y"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   532
  "(x::'a::order) >= y ==> y >= z ==> x >= z"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   533
  "(x::'a::order) > y ==> y >= z ==> x > z"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   534
  "(x::'a::order) >= y ==> y > z ==> x > z"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   535
  "(a::'a::order) > b ==> b > a ==> ?P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   536
  "(x::'a::order) > y ==> y > z ==> x > z"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   537
  "(a::'a::order) >= b ==> a ~= b ==> a > b"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   538
  "(a::'a::order) ~= b ==> a >= b ==> a > b"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   539
  "a = f b ==> b > c ==> (!!x y. x > y ==> f x > f y) ==> a > f c" 
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   540
  "a > b ==> f b = c ==> (!!x y. x > y ==> f x > f y) ==> f a > c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   541
  "a = f b ==> b >= c ==> (!!x y. x >= y ==> f x >= f y) ==> a >= f c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   542
  "a >= b ==> f b = c ==> (!! x y. x >= y ==> f x >= f y) ==> f a >= c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   543
by auto
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   544
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   545
lemma xt2:
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   546
  "(a::'a::order) >= f b ==> b >= c ==> (!!x y. x >= y ==> f x >= f y) ==> a >= f c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   547
by (subgoal_tac "f b >= f c", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   548
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   549
lemma xt3: "(a::'a::order) >= b ==> (f b::'b::order) >= c ==> 
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   550
    (!!x y. x >= y ==> f x >= f y) ==> f a >= c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   551
by (subgoal_tac "f a >= f b", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   552
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   553
lemma xt4: "(a::'a::order) > f b ==> (b::'b::order) >= c ==>
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   554
  (!!x y. x >= y ==> f x >= f y) ==> a > f c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   555
by (subgoal_tac "f b >= f c", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   556
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   557
lemma xt5: "(a::'a::order) > b ==> (f b::'b::order) >= c==>
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   558
    (!!x y. x > y ==> f x > f y) ==> f a > c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   559
by (subgoal_tac "f a > f b", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   560
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   561
lemma xt6: "(a::'a::order) >= f b ==> b > c ==>
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   562
    (!!x y. x > y ==> f x > f y) ==> a > f c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   563
by (subgoal_tac "f b > f c", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   564
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   565
lemma xt7: "(a::'a::order) >= b ==> (f b::'b::order) > c ==>
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   566
    (!!x y. x >= y ==> f x >= f y) ==> f a > c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   567
by (subgoal_tac "f a >= f b", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   568
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   569
lemma xt8: "(a::'a::order) > f b ==> (b::'b::order) > c ==>
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   570
    (!!x y. x > y ==> f x > f y) ==> a > f c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   571
by (subgoal_tac "f b > f c", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   572
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   573
lemma xt9: "(a::'a::order) > b ==> (f b::'b::order) > c ==>
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   574
    (!!x y. x > y ==> f x > f y) ==> f a > c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   575
by (subgoal_tac "f a > f b", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   576
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   577
lemmas xtrans = xt1 xt2 xt3 xt4 xt5 xt6 xt7 xt8 xt9
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   578
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   579
(* 
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   580
  Since "a >= b" abbreviates "b <= a", the abbreviation "..." stands
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   581
  for the wrong thing in an Isar proof.
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   582
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   583
  The extra transitivity rules can be used as follows: 
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   584
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   585
lemma "(a::'a::order) > z"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   586
proof -
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   587
  have "a >= b" (is "_ >= ?rhs")
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   588
    sorry
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   589
  also have "?rhs >= c" (is "_ >= ?rhs")
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   590
    sorry
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   591
  also (xtrans) have "?rhs = d" (is "_ = ?rhs")
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   592
    sorry
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   593
  also (xtrans) have "?rhs >= e" (is "_ >= ?rhs")
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   594
    sorry
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   595
  also (xtrans) have "?rhs > f" (is "_ > ?rhs")
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   596
    sorry
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   597
  also (xtrans) have "?rhs > z"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   598
    sorry
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   599
  finally (xtrans) show ?thesis .
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   600
qed
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   601
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   602
  Alternatively, one can use "declare xtrans [trans]" and then
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   603
  leave out the "(xtrans)" above.
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   604
*)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   605
21216
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
   606
subsection {* Monotonicity, syntactic least value operator and syntactic min/max *}
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   607
21216
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
   608
locale mono =
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
   609
  fixes f
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
   610
  assumes mono: "A \<le> B \<Longrightarrow> f A \<le> f B"
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
   611
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
   612
lemmas monoI [intro?] = mono.intro
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
   613
  and monoD [dest?] = mono.mono
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   614
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   615
constdefs
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   616
  Least :: "('a::ord => bool) => 'a"               (binder "LEAST " 10)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   617
  "Least P == THE x. P x & (ALL y. P y --> x <= y)"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   618
    -- {* We can no longer use LeastM because the latter requires Hilbert-AC. *}
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   619
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   620
constdefs
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   621
  min :: "['a::ord, 'a] => 'a"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   622
  "min a b == (if a <= b then a else b)"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   623
  max :: "['a::ord, 'a] => 'a"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   624
  "max a b == (if a <= b then b else a)"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   625
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   626
end