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