src/HOL/Orderings.thy
author wenzelm
Mon Dec 07 10:38:04 2015 +0100 (2015-12-07)
changeset 61799 4cf66f21b764
parent 61762 d50b993b4fb9
child 61824 dcbe9f756ae0
permissions -rw-r--r--
isabelle update_cartouches -c -t;
haftmann@28685
     1
(*  Title:      HOL/Orderings.thy
nipkow@15524
     2
    Author:     Tobias Nipkow, Markus Wenzel, and Larry Paulson
nipkow@15524
     3
*)
nipkow@15524
     4
wenzelm@60758
     5
section \<open>Abstract orderings\<close>
nipkow@15524
     6
nipkow@15524
     7
theory Orderings
haftmann@35301
     8
imports HOL
wenzelm@46950
     9
keywords "print_orders" :: diag
nipkow@15524
    10
begin
nipkow@15524
    11
wenzelm@48891
    12
ML_file "~~/src/Provers/order.ML"
wenzelm@48891
    13
ML_file "~~/src/Provers/quasi.ML"  (* FIXME unused? *)
wenzelm@48891
    14
wenzelm@60758
    15
subsection \<open>Abstract ordering\<close>
haftmann@51487
    16
haftmann@51487
    17
locale ordering =
haftmann@51487
    18
  fixes less_eq :: "'a \<Rightarrow> 'a \<Rightarrow> bool" (infix "\<preceq>" 50)
haftmann@51487
    19
   and less :: "'a \<Rightarrow> 'a \<Rightarrow> bool" (infix "\<prec>" 50)
haftmann@51487
    20
  assumes strict_iff_order: "a \<prec> b \<longleftrightarrow> a \<preceq> b \<and> a \<noteq> b"
wenzelm@61799
    21
  assumes refl: "a \<preceq> a" \<comment> \<open>not \<open>iff\<close>: makes problems due to multiple (dual) interpretations\<close>
haftmann@51487
    22
    and antisym: "a \<preceq> b \<Longrightarrow> b \<preceq> a \<Longrightarrow> a = b"
haftmann@51487
    23
    and trans: "a \<preceq> b \<Longrightarrow> b \<preceq> c \<Longrightarrow> a \<preceq> c"
haftmann@51487
    24
begin
haftmann@51487
    25
haftmann@51487
    26
lemma strict_implies_order:
haftmann@51487
    27
  "a \<prec> b \<Longrightarrow> a \<preceq> b"
haftmann@51487
    28
  by (simp add: strict_iff_order)
haftmann@51487
    29
haftmann@51487
    30
lemma strict_implies_not_eq:
haftmann@51487
    31
  "a \<prec> b \<Longrightarrow> a \<noteq> b"
haftmann@51487
    32
  by (simp add: strict_iff_order)
haftmann@51487
    33
haftmann@51487
    34
lemma not_eq_order_implies_strict:
haftmann@51487
    35
  "a \<noteq> b \<Longrightarrow> a \<preceq> b \<Longrightarrow> a \<prec> b"
haftmann@51487
    36
  by (simp add: strict_iff_order)
haftmann@51487
    37
haftmann@51487
    38
lemma order_iff_strict:
haftmann@51487
    39
  "a \<preceq> b \<longleftrightarrow> a \<prec> b \<or> a = b"
haftmann@51487
    40
  by (auto simp add: strict_iff_order refl)
haftmann@51487
    41
wenzelm@61799
    42
lemma irrefl: \<comment> \<open>not \<open>iff\<close>: makes problems due to multiple (dual) interpretations\<close>
haftmann@51487
    43
  "\<not> a \<prec> a"
haftmann@51487
    44
  by (simp add: strict_iff_order)
haftmann@51487
    45
haftmann@51487
    46
lemma asym:
haftmann@51487
    47
  "a \<prec> b \<Longrightarrow> b \<prec> a \<Longrightarrow> False"
haftmann@51487
    48
  by (auto simp add: strict_iff_order intro: antisym)
haftmann@51487
    49
haftmann@51487
    50
lemma strict_trans1:
haftmann@51487
    51
  "a \<preceq> b \<Longrightarrow> b \<prec> c \<Longrightarrow> a \<prec> c"
haftmann@51487
    52
  by (auto simp add: strict_iff_order intro: trans antisym)
haftmann@51487
    53
haftmann@51487
    54
lemma strict_trans2:
haftmann@51487
    55
  "a \<prec> b \<Longrightarrow> b \<preceq> c \<Longrightarrow> a \<prec> c"
haftmann@51487
    56
  by (auto simp add: strict_iff_order intro: trans antisym)
haftmann@51487
    57
haftmann@51487
    58
lemma strict_trans:
haftmann@51487
    59
  "a \<prec> b \<Longrightarrow> b \<prec> c \<Longrightarrow> a \<prec> c"
haftmann@51487
    60
  by (auto intro: strict_trans1 strict_implies_order)
haftmann@51487
    61
haftmann@51487
    62
end
haftmann@51487
    63
haftmann@51487
    64
locale ordering_top = ordering +
haftmann@51487
    65
  fixes top :: "'a"
haftmann@51487
    66
  assumes extremum [simp]: "a \<preceq> top"
haftmann@51487
    67
begin
haftmann@51487
    68
haftmann@51487
    69
lemma extremum_uniqueI:
haftmann@51487
    70
  "top \<preceq> a \<Longrightarrow> a = top"
haftmann@51487
    71
  by (rule antisym) auto
haftmann@51487
    72
haftmann@51487
    73
lemma extremum_unique:
haftmann@51487
    74
  "top \<preceq> a \<longleftrightarrow> a = top"
haftmann@51487
    75
  by (auto intro: antisym)
haftmann@51487
    76
haftmann@51487
    77
lemma extremum_strict [simp]:
haftmann@51487
    78
  "\<not> (top \<prec> a)"
haftmann@51487
    79
  using extremum [of a] by (auto simp add: order_iff_strict intro: asym irrefl)
haftmann@51487
    80
haftmann@51487
    81
lemma not_eq_extremum:
haftmann@51487
    82
  "a \<noteq> top \<longleftrightarrow> a \<prec> top"
haftmann@51487
    83
  by (auto simp add: order_iff_strict intro: not_eq_order_implies_strict extremum)
haftmann@51487
    84
haftmann@51487
    85
end  
haftmann@51487
    86
haftmann@51487
    87
wenzelm@60758
    88
subsection \<open>Syntactic orders\<close>
haftmann@35092
    89
haftmann@35092
    90
class ord =
haftmann@35092
    91
  fixes less_eq :: "'a \<Rightarrow> 'a \<Rightarrow> bool"
haftmann@35092
    92
    and less :: "'a \<Rightarrow> 'a \<Rightarrow> bool"
haftmann@35092
    93
begin
haftmann@35092
    94
haftmann@35092
    95
notation
haftmann@35092
    96
  less_eq  ("op <=") and
haftmann@35092
    97
  less_eq  ("(_/ <= _)" [51, 51] 50) and
haftmann@35092
    98
  less  ("op <") and
haftmann@35092
    99
  less  ("(_/ < _)"  [51, 51] 50)
haftmann@35092
   100
  
haftmann@35092
   101
notation (xsymbols)
haftmann@35092
   102
  less_eq  ("op \<le>") and
haftmann@35092
   103
  less_eq  ("(_/ \<le> _)"  [51, 51] 50)
haftmann@35092
   104
haftmann@35092
   105
abbreviation (input)
haftmann@35092
   106
  greater_eq  (infix ">=" 50) where
haftmann@35092
   107
  "x >= y \<equiv> y <= x"
haftmann@35092
   108
haftmann@35092
   109
notation (input)
haftmann@35092
   110
  greater_eq  (infix "\<ge>" 50)
haftmann@35092
   111
haftmann@35092
   112
abbreviation (input)
haftmann@35092
   113
  greater  (infix ">" 50) where
haftmann@35092
   114
  "x > y \<equiv> y < x"
haftmann@35092
   115
haftmann@35092
   116
end
haftmann@35092
   117
haftmann@35092
   118
wenzelm@60758
   119
subsection \<open>Quasi orders\<close>
nipkow@15524
   120
haftmann@27682
   121
class preorder = ord +
haftmann@27682
   122
  assumes less_le_not_le: "x < y \<longleftrightarrow> x \<le> y \<and> \<not> (y \<le> x)"
haftmann@25062
   123
  and order_refl [iff]: "x \<le> x"
haftmann@25062
   124
  and order_trans: "x \<le> y \<Longrightarrow> y \<le> z \<Longrightarrow> x \<le> z"
haftmann@21248
   125
begin
haftmann@21248
   126
wenzelm@60758
   127
text \<open>Reflexivity.\<close>
nipkow@15524
   128
haftmann@25062
   129
lemma eq_refl: "x = y \<Longrightarrow> x \<le> y"
wenzelm@61799
   130
    \<comment> \<open>This form is useful with the classical reasoner.\<close>
nipkow@23212
   131
by (erule ssubst) (rule order_refl)
nipkow@15524
   132
haftmann@25062
   133
lemma less_irrefl [iff]: "\<not> x < x"
haftmann@27682
   134
by (simp add: less_le_not_le)
haftmann@27682
   135
haftmann@27682
   136
lemma less_imp_le: "x < y \<Longrightarrow> x \<le> y"
haftmann@27682
   137
unfolding less_le_not_le by blast
haftmann@27682
   138
haftmann@27682
   139
wenzelm@60758
   140
text \<open>Asymmetry.\<close>
haftmann@27682
   141
haftmann@27682
   142
lemma less_not_sym: "x < y \<Longrightarrow> \<not> (y < x)"
haftmann@27682
   143
by (simp add: less_le_not_le)
haftmann@27682
   144
haftmann@27682
   145
lemma less_asym: "x < y \<Longrightarrow> (\<not> P \<Longrightarrow> y < x) \<Longrightarrow> P"
haftmann@27682
   146
by (drule less_not_sym, erule contrapos_np) simp
haftmann@27682
   147
haftmann@27682
   148
wenzelm@60758
   149
text \<open>Transitivity.\<close>
haftmann@27682
   150
haftmann@27682
   151
lemma less_trans: "x < y \<Longrightarrow> y < z \<Longrightarrow> x < z"
haftmann@27682
   152
by (auto simp add: less_le_not_le intro: order_trans) 
haftmann@27682
   153
haftmann@27682
   154
lemma le_less_trans: "x \<le> y \<Longrightarrow> y < z \<Longrightarrow> x < z"
haftmann@27682
   155
by (auto simp add: less_le_not_le intro: order_trans) 
haftmann@27682
   156
haftmann@27682
   157
lemma less_le_trans: "x < y \<Longrightarrow> y \<le> z \<Longrightarrow> x < z"
haftmann@27682
   158
by (auto simp add: less_le_not_le intro: order_trans) 
haftmann@27682
   159
haftmann@27682
   160
wenzelm@60758
   161
text \<open>Useful for simplification, but too risky to include by default.\<close>
haftmann@27682
   162
haftmann@27682
   163
lemma less_imp_not_less: "x < y \<Longrightarrow> (\<not> y < x) \<longleftrightarrow> True"
haftmann@27682
   164
by (blast elim: less_asym)
haftmann@27682
   165
haftmann@27682
   166
lemma less_imp_triv: "x < y \<Longrightarrow> (y < x \<longrightarrow> P) \<longleftrightarrow> True"
haftmann@27682
   167
by (blast elim: less_asym)
haftmann@27682
   168
haftmann@27682
   169
wenzelm@60758
   170
text \<open>Transitivity rules for calculational reasoning\<close>
haftmann@27682
   171
haftmann@27682
   172
lemma less_asym': "a < b \<Longrightarrow> b < a \<Longrightarrow> P"
haftmann@27682
   173
by (rule less_asym)
haftmann@27682
   174
haftmann@27682
   175
wenzelm@60758
   176
text \<open>Dual order\<close>
haftmann@27682
   177
haftmann@27682
   178
lemma dual_preorder:
haftmann@36635
   179
  "class.preorder (op \<ge>) (op >)"
haftmann@28823
   180
proof qed (auto simp add: less_le_not_le intro: order_trans)
haftmann@27682
   181
haftmann@27682
   182
end
haftmann@27682
   183
haftmann@27682
   184
wenzelm@60758
   185
subsection \<open>Partial orders\<close>
haftmann@27682
   186
haftmann@27682
   187
class order = preorder +
haftmann@27682
   188
  assumes antisym: "x \<le> y \<Longrightarrow> y \<le> x \<Longrightarrow> x = y"
haftmann@27682
   189
begin
haftmann@27682
   190
haftmann@51487
   191
lemma less_le: "x < y \<longleftrightarrow> x \<le> y \<and> x \<noteq> y"
haftmann@51487
   192
  by (auto simp add: less_le_not_le intro: antisym)
haftmann@51487
   193
wenzelm@61605
   194
sublocale order: ordering less_eq less +  dual_order: ordering greater_eq greater
wenzelm@61169
   195
  by standard (auto intro: antisym order_trans simp add: less_le)
haftmann@51487
   196
haftmann@51487
   197
wenzelm@60758
   198
text \<open>Reflexivity.\<close>
nipkow@15524
   199
haftmann@25062
   200
lemma le_less: "x \<le> y \<longleftrightarrow> x < y \<or> x = y"
wenzelm@61799
   201
    \<comment> \<open>NOT suitable for iff, since it can cause PROOF FAILED.\<close>
haftmann@51546
   202
by (fact order.order_iff_strict)
nipkow@15524
   203
haftmann@25062
   204
lemma le_imp_less_or_eq: "x \<le> y \<Longrightarrow> x < y \<or> x = y"
nipkow@23212
   205
unfolding less_le by blast
nipkow@15524
   206
haftmann@21329
   207
wenzelm@60758
   208
text \<open>Useful for simplification, but too risky to include by default.\<close>
haftmann@21329
   209
haftmann@25062
   210
lemma less_imp_not_eq: "x < y \<Longrightarrow> (x = y) \<longleftrightarrow> False"
nipkow@23212
   211
by auto
haftmann@21329
   212
haftmann@25062
   213
lemma less_imp_not_eq2: "x < y \<Longrightarrow> (y = x) \<longleftrightarrow> False"
nipkow@23212
   214
by auto
haftmann@21329
   215
haftmann@21329
   216
wenzelm@60758
   217
text \<open>Transitivity rules for calculational reasoning\<close>
haftmann@21329
   218
haftmann@25062
   219
lemma neq_le_trans: "a \<noteq> b \<Longrightarrow> a \<le> b \<Longrightarrow> a < b"
haftmann@51546
   220
by (fact order.not_eq_order_implies_strict)
haftmann@21329
   221
haftmann@25062
   222
lemma le_neq_trans: "a \<le> b \<Longrightarrow> a \<noteq> b \<Longrightarrow> a < b"
haftmann@51546
   223
by (rule order.not_eq_order_implies_strict)
haftmann@21329
   224
nipkow@15524
   225
wenzelm@60758
   226
text \<open>Asymmetry.\<close>
nipkow@15524
   227
haftmann@25062
   228
lemma eq_iff: "x = y \<longleftrightarrow> x \<le> y \<and> y \<le> x"
nipkow@23212
   229
by (blast intro: antisym)
nipkow@15524
   230
haftmann@25062
   231
lemma antisym_conv: "y \<le> x \<Longrightarrow> x \<le> y \<longleftrightarrow> x = y"
nipkow@23212
   232
by (blast intro: antisym)
nipkow@15524
   233
haftmann@25062
   234
lemma less_imp_neq: "x < y \<Longrightarrow> x \<noteq> y"
haftmann@51546
   235
by (fact order.strict_implies_not_eq)
haftmann@21248
   236
haftmann@21083
   237
wenzelm@60758
   238
text \<open>Least value operator\<close>
haftmann@27107
   239
haftmann@27299
   240
definition (in ord)
haftmann@27107
   241
  Least :: "('a \<Rightarrow> bool) \<Rightarrow> 'a" (binder "LEAST " 10) where
haftmann@27107
   242
  "Least P = (THE x. P x \<and> (\<forall>y. P y \<longrightarrow> x \<le> y))"
haftmann@27107
   243
haftmann@27107
   244
lemma Least_equality:
haftmann@27107
   245
  assumes "P x"
haftmann@27107
   246
    and "\<And>y. P y \<Longrightarrow> x \<le> y"
haftmann@27107
   247
  shows "Least P = x"
haftmann@27107
   248
unfolding Least_def by (rule the_equality)
haftmann@27107
   249
  (blast intro: assms antisym)+
haftmann@27107
   250
haftmann@27107
   251
lemma LeastI2_order:
haftmann@27107
   252
  assumes "P x"
haftmann@27107
   253
    and "\<And>y. P y \<Longrightarrow> x \<le> y"
haftmann@27107
   254
    and "\<And>x. P x \<Longrightarrow> \<forall>y. P y \<longrightarrow> x \<le> y \<Longrightarrow> Q x"
haftmann@27107
   255
  shows "Q (Least P)"
haftmann@27107
   256
unfolding Least_def by (rule theI2)
haftmann@27107
   257
  (blast intro: assms antisym)+
haftmann@27107
   258
wenzelm@60758
   259
text \<open>Dual order\<close>
haftmann@22916
   260
haftmann@26014
   261
lemma dual_order:
haftmann@36635
   262
  "class.order (op \<ge>) (op >)"
haftmann@27682
   263
by (intro_locales, rule dual_preorder) (unfold_locales, rule antisym)
haftmann@22916
   264
haftmann@21248
   265
end
nipkow@15524
   266
haftmann@21329
   267
wenzelm@60758
   268
text \<open>Alternative introduction rule with bias towards strict order\<close>
haftmann@56545
   269
haftmann@56545
   270
lemma order_strictI:
haftmann@56545
   271
  fixes less (infix "\<sqsubset>" 50)
haftmann@56545
   272
    and less_eq (infix "\<sqsubseteq>" 50)
haftmann@56545
   273
  assumes less_eq_less: "\<And>a b. a \<sqsubseteq> b \<longleftrightarrow> a \<sqsubset> b \<or> a = b"
haftmann@56545
   274
    assumes asym: "\<And>a b. a \<sqsubset> b \<Longrightarrow> \<not> b \<sqsubset> a"
haftmann@56545
   275
  assumes irrefl: "\<And>a. \<not> a \<sqsubset> a"
haftmann@56545
   276
  assumes trans: "\<And>a b c. a \<sqsubset> b \<Longrightarrow> b \<sqsubset> c \<Longrightarrow> a \<sqsubset> c"
haftmann@56545
   277
  shows "class.order less_eq less"
haftmann@56545
   278
proof
haftmann@56545
   279
  fix a b
haftmann@56545
   280
  show "a \<sqsubset> b \<longleftrightarrow> a \<sqsubseteq> b \<and> \<not> b \<sqsubseteq> a"
haftmann@56545
   281
    by (auto simp add: less_eq_less asym irrefl)
haftmann@56545
   282
next
haftmann@56545
   283
  fix a
haftmann@56545
   284
  show "a \<sqsubseteq> a"
haftmann@56545
   285
    by (auto simp add: less_eq_less)
haftmann@56545
   286
next
haftmann@56545
   287
  fix a b c
haftmann@56545
   288
  assume "a \<sqsubseteq> b" and "b \<sqsubseteq> c" then show "a \<sqsubseteq> c"
haftmann@56545
   289
    by (auto simp add: less_eq_less intro: trans)
haftmann@56545
   290
next
haftmann@56545
   291
  fix a b
haftmann@56545
   292
  assume "a \<sqsubseteq> b" and "b \<sqsubseteq> a" then show "a = b"
haftmann@56545
   293
    by (auto simp add: less_eq_less asym)
haftmann@56545
   294
qed
haftmann@56545
   295
haftmann@56545
   296
wenzelm@60758
   297
subsection \<open>Linear (total) orders\<close>
haftmann@21329
   298
haftmann@22316
   299
class linorder = order +
haftmann@25207
   300
  assumes linear: "x \<le> y \<or> y \<le> x"
haftmann@21248
   301
begin
haftmann@21248
   302
haftmann@25062
   303
lemma less_linear: "x < y \<or> x = y \<or> y < x"
nipkow@23212
   304
unfolding less_le using less_le linear by blast
haftmann@21248
   305
haftmann@25062
   306
lemma le_less_linear: "x \<le> y \<or> y < x"
nipkow@23212
   307
by (simp add: le_less less_linear)
haftmann@21248
   308
haftmann@21248
   309
lemma le_cases [case_names le ge]:
haftmann@25062
   310
  "(x \<le> y \<Longrightarrow> P) \<Longrightarrow> (y \<le> x \<Longrightarrow> P) \<Longrightarrow> P"
nipkow@23212
   311
using linear by blast
haftmann@21248
   312
lp15@61762
   313
lemma (in linorder) le_cases3:
lp15@61762
   314
  "\<lbrakk>\<lbrakk>x \<le> y; y \<le> z\<rbrakk> \<Longrightarrow> P; \<lbrakk>y \<le> x; x \<le> z\<rbrakk> \<Longrightarrow> P; \<lbrakk>x \<le> z; z \<le> y\<rbrakk> \<Longrightarrow> P;
lp15@61762
   315
    \<lbrakk>z \<le> y; y \<le> x\<rbrakk> \<Longrightarrow> P; \<lbrakk>y \<le> z; z \<le> x\<rbrakk> \<Longrightarrow> P; \<lbrakk>z \<le> x; x \<le> y\<rbrakk> \<Longrightarrow> P\<rbrakk> \<Longrightarrow> P"
lp15@61762
   316
by (blast intro: le_cases)
lp15@61762
   317
haftmann@22384
   318
lemma linorder_cases [case_names less equal greater]:
haftmann@25062
   319
  "(x < y \<Longrightarrow> P) \<Longrightarrow> (x = y \<Longrightarrow> P) \<Longrightarrow> (y < x \<Longrightarrow> P) \<Longrightarrow> P"
nipkow@23212
   320
using less_linear by blast
haftmann@21248
   321
hoelzl@57447
   322
lemma linorder_wlog[case_names le sym]:
hoelzl@57447
   323
  "(\<And>a b. a \<le> b \<Longrightarrow> P a b) \<Longrightarrow> (\<And>a b. P b a \<Longrightarrow> P a b) \<Longrightarrow> P a b"
hoelzl@57447
   324
  by (cases rule: le_cases[of a b]) blast+
hoelzl@57447
   325
haftmann@25062
   326
lemma not_less: "\<not> x < y \<longleftrightarrow> y \<le> x"
nipkow@23212
   327
apply (simp add: less_le)
nipkow@23212
   328
using linear apply (blast intro: antisym)
nipkow@23212
   329
done
nipkow@23212
   330
nipkow@23212
   331
lemma not_less_iff_gr_or_eq:
haftmann@25062
   332
 "\<not>(x < y) \<longleftrightarrow> (x > y | x = y)"
nipkow@23212
   333
apply(simp add:not_less le_less)
nipkow@23212
   334
apply blast
nipkow@23212
   335
done
nipkow@15524
   336
haftmann@25062
   337
lemma not_le: "\<not> x \<le> y \<longleftrightarrow> y < x"
nipkow@23212
   338
apply (simp add: less_le)
nipkow@23212
   339
using linear apply (blast intro: antisym)
nipkow@23212
   340
done
nipkow@15524
   341
haftmann@25062
   342
lemma neq_iff: "x \<noteq> y \<longleftrightarrow> x < y \<or> y < x"
nipkow@23212
   343
by (cut_tac x = x and y = y in less_linear, auto)
nipkow@15524
   344
haftmann@25062
   345
lemma neqE: "x \<noteq> y \<Longrightarrow> (x < y \<Longrightarrow> R) \<Longrightarrow> (y < x \<Longrightarrow> R) \<Longrightarrow> R"
nipkow@23212
   346
by (simp add: neq_iff) blast
nipkow@15524
   347
haftmann@25062
   348
lemma antisym_conv1: "\<not> x < y \<Longrightarrow> x \<le> y \<longleftrightarrow> x = y"
nipkow@23212
   349
by (blast intro: antisym dest: not_less [THEN iffD1])
nipkow@15524
   350
haftmann@25062
   351
lemma antisym_conv2: "x \<le> y \<Longrightarrow> \<not> x < y \<longleftrightarrow> x = y"
nipkow@23212
   352
by (blast intro: antisym dest: not_less [THEN iffD1])
nipkow@15524
   353
haftmann@25062
   354
lemma antisym_conv3: "\<not> y < x \<Longrightarrow> \<not> x < y \<longleftrightarrow> x = y"
nipkow@23212
   355
by (blast intro: antisym dest: not_less [THEN iffD1])
nipkow@15524
   356
haftmann@25062
   357
lemma leI: "\<not> x < y \<Longrightarrow> y \<le> x"
nipkow@23212
   358
unfolding not_less .
paulson@16796
   359
haftmann@25062
   360
lemma leD: "y \<le> x \<Longrightarrow> \<not> x < y"
nipkow@23212
   361
unfolding not_less .
paulson@16796
   362
paulson@16796
   363
(*FIXME inappropriate name (or delete altogether)*)
haftmann@25062
   364
lemma not_leE: "\<not> y \<le> x \<Longrightarrow> x < y"
nipkow@23212
   365
unfolding not_le .
haftmann@21248
   366
wenzelm@60758
   367
text \<open>Dual order\<close>
haftmann@22916
   368
haftmann@26014
   369
lemma dual_linorder:
haftmann@36635
   370
  "class.linorder (op \<ge>) (op >)"
haftmann@36635
   371
by (rule class.linorder.intro, rule dual_order) (unfold_locales, rule linear)
haftmann@22916
   372
haftmann@21248
   373
end
haftmann@21248
   374
haftmann@23948
   375
wenzelm@60758
   376
text \<open>Alternative introduction rule with bias towards strict order\<close>
haftmann@56545
   377
haftmann@56545
   378
lemma linorder_strictI:
haftmann@56545
   379
  fixes less (infix "\<sqsubset>" 50)
haftmann@56545
   380
    and less_eq (infix "\<sqsubseteq>" 50)
haftmann@56545
   381
  assumes "class.order less_eq less"
haftmann@56545
   382
  assumes trichotomy: "\<And>a b. a \<sqsubset> b \<or> a = b \<or> b \<sqsubset> a"
haftmann@56545
   383
  shows "class.linorder less_eq less"
haftmann@56545
   384
proof -
haftmann@56545
   385
  interpret order less_eq less
wenzelm@60758
   386
    by (fact \<open>class.order less_eq less\<close>)
haftmann@56545
   387
  show ?thesis
haftmann@56545
   388
  proof
haftmann@56545
   389
    fix a b
haftmann@56545
   390
    show "a \<sqsubseteq> b \<or> b \<sqsubseteq> a"
haftmann@56545
   391
      using trichotomy by (auto simp add: le_less)
haftmann@56545
   392
  qed
haftmann@56545
   393
qed
haftmann@56545
   394
haftmann@56545
   395
wenzelm@60758
   396
subsection \<open>Reasoning tools setup\<close>
haftmann@21083
   397
wenzelm@60758
   398
ML \<open>
ballarin@24641
   399
signature ORDERS =
ballarin@24641
   400
sig
ballarin@24641
   401
  val print_structures: Proof.context -> unit
wenzelm@32215
   402
  val order_tac: Proof.context -> thm list -> int -> tactic
wenzelm@58826
   403
  val add_struct: string * term list -> string -> attribute
wenzelm@58826
   404
  val del_struct: string * term list -> attribute
ballarin@24641
   405
end;
haftmann@21091
   406
ballarin@24641
   407
structure Orders: ORDERS =
haftmann@21248
   408
struct
ballarin@24641
   409
wenzelm@56508
   410
(* context data *)
ballarin@24641
   411
ballarin@24641
   412
fun struct_eq ((s1: string, ts1), (s2, ts2)) =
wenzelm@56508
   413
  s1 = s2 andalso eq_list (op aconv) (ts1, ts2);
ballarin@24641
   414
wenzelm@33519
   415
structure Data = Generic_Data
ballarin@24641
   416
(
ballarin@24641
   417
  type T = ((string * term list) * Order_Tac.less_arith) list;
ballarin@24641
   418
    (* Order structures:
ballarin@24641
   419
       identifier of the structure, list of operations and record of theorems
ballarin@24641
   420
       needed to set up the transitivity reasoner,
ballarin@24641
   421
       identifier and operations identify the structure uniquely. *)
ballarin@24641
   422
  val empty = [];
ballarin@24641
   423
  val extend = I;
wenzelm@33519
   424
  fun merge data = AList.join struct_eq (K fst) data;
ballarin@24641
   425
);
ballarin@24641
   426
ballarin@24641
   427
fun print_structures ctxt =
ballarin@24641
   428
  let
ballarin@24641
   429
    val structs = Data.get (Context.Proof ctxt);
ballarin@24641
   430
    fun pretty_term t = Pretty.block
wenzelm@24920
   431
      [Pretty.quote (Syntax.pretty_term ctxt t), Pretty.brk 1,
ballarin@24641
   432
        Pretty.str "::", Pretty.brk 1,
wenzelm@24920
   433
        Pretty.quote (Syntax.pretty_typ ctxt (type_of t))];
ballarin@24641
   434
    fun pretty_struct ((s, ts), _) = Pretty.block
ballarin@24641
   435
      [Pretty.str s, Pretty.str ":", Pretty.brk 1,
ballarin@24641
   436
       Pretty.enclose "(" ")" (Pretty.breaks (map pretty_term ts))];
ballarin@24641
   437
  in
wenzelm@51579
   438
    Pretty.writeln (Pretty.big_list "order structures:" (map pretty_struct structs))
ballarin@24641
   439
  end;
ballarin@24641
   440
wenzelm@56508
   441
val _ =
wenzelm@59936
   442
  Outer_Syntax.command @{command_keyword print_orders}
wenzelm@56508
   443
    "print order structures available to transitivity reasoner"
wenzelm@60097
   444
    (Scan.succeed (Toplevel.keep (print_structures o Toplevel.context_of)));
haftmann@21091
   445
wenzelm@56508
   446
wenzelm@56508
   447
(* tactics *)
wenzelm@56508
   448
wenzelm@56508
   449
fun struct_tac ((s, ops), thms) ctxt facts =
ballarin@24641
   450
  let
wenzelm@56508
   451
    val [eq, le, less] = ops;
berghofe@30107
   452
    fun decomp thy (@{const Trueprop} $ t) =
wenzelm@56508
   453
          let
wenzelm@56508
   454
            fun excluded t =
wenzelm@56508
   455
              (* exclude numeric types: linear arithmetic subsumes transitivity *)
wenzelm@56508
   456
              let val T = type_of t
wenzelm@56508
   457
              in
wenzelm@56508
   458
                T = HOLogic.natT orelse T = HOLogic.intT orelse T = HOLogic.realT
wenzelm@56508
   459
              end;
wenzelm@56508
   460
            fun rel (bin_op $ t1 $ t2) =
wenzelm@56508
   461
                  if excluded t1 then NONE
wenzelm@56508
   462
                  else if Pattern.matches thy (eq, bin_op) then SOME (t1, "=", t2)
wenzelm@56508
   463
                  else if Pattern.matches thy (le, bin_op) then SOME (t1, "<=", t2)
wenzelm@56508
   464
                  else if Pattern.matches thy (less, bin_op) then SOME (t1, "<", t2)
wenzelm@56508
   465
                  else NONE
wenzelm@56508
   466
              | rel _ = NONE;
wenzelm@56508
   467
            fun dec (Const (@{const_name Not}, _) $ t) =
wenzelm@56508
   468
                  (case rel t of NONE =>
wenzelm@56508
   469
                    NONE
wenzelm@56508
   470
                  | SOME (t1, rel, t2) => SOME (t1, "~" ^ rel, t2))
wenzelm@56508
   471
              | dec x = rel x;
wenzelm@56508
   472
          in dec t end
wenzelm@56508
   473
      | decomp _ _ = NONE;
ballarin@24641
   474
  in
wenzelm@56508
   475
    (case s of
wenzelm@56508
   476
      "order" => Order_Tac.partial_tac decomp thms ctxt facts
wenzelm@56508
   477
    | "linorder" => Order_Tac.linear_tac decomp thms ctxt facts
wenzelm@56508
   478
    | _ => error ("Unknown order kind " ^ quote s ^ " encountered in transitivity reasoner"))
ballarin@24641
   479
  end
ballarin@24641
   480
wenzelm@56508
   481
fun order_tac ctxt facts =
wenzelm@56508
   482
  FIRST' (map (fn s => CHANGED o struct_tac s ctxt facts) (Data.get (Context.Proof ctxt)));
ballarin@24641
   483
ballarin@24641
   484
wenzelm@56508
   485
(* attributes *)
ballarin@24641
   486
wenzelm@58826
   487
fun add_struct s tag =
ballarin@24641
   488
  Thm.declaration_attribute
ballarin@24641
   489
    (fn thm => Data.map (AList.map_default struct_eq (s, Order_Tac.empty TrueI) (Order_Tac.update tag thm)));
ballarin@24641
   490
fun del_struct s =
ballarin@24641
   491
  Thm.declaration_attribute
ballarin@24641
   492
    (fn _ => Data.map (AList.delete struct_eq s));
ballarin@24641
   493
haftmann@21091
   494
end;
wenzelm@60758
   495
\<close>
haftmann@21091
   496
wenzelm@60758
   497
attribute_setup order = \<open>
wenzelm@58826
   498
  Scan.lift ((Args.add -- Args.name >> (fn (_, s) => SOME s) || Args.del >> K NONE) --|
wenzelm@58826
   499
    Args.colon (* FIXME || Scan.succeed true *) ) -- Scan.lift Args.name --
wenzelm@58826
   500
    Scan.repeat Args.term
wenzelm@58826
   501
    >> (fn ((SOME tag, n), ts) => Orders.add_struct (n, ts) tag
wenzelm@58826
   502
         | ((NONE, n), ts) => Orders.del_struct (n, ts))
wenzelm@60758
   503
\<close> "theorems controlling transitivity reasoner"
wenzelm@58826
   504
wenzelm@60758
   505
method_setup order = \<open>
wenzelm@47432
   506
  Scan.succeed (fn ctxt => SIMPLE_METHOD' (Orders.order_tac ctxt []))
wenzelm@60758
   507
\<close> "transitivity reasoner"
ballarin@24641
   508
ballarin@24641
   509
wenzelm@60758
   510
text \<open>Declarations to set up transitivity reasoner of partial and linear orders.\<close>
ballarin@24641
   511
haftmann@25076
   512
context order
haftmann@25076
   513
begin
haftmann@25076
   514
ballarin@24641
   515
(* The type constraint on @{term op =} below is necessary since the operation
ballarin@24641
   516
   is not a parameter of the locale. *)
haftmann@25076
   517
haftmann@27689
   518
declare less_irrefl [THEN notE, order add less_reflE: order "op = :: 'a \<Rightarrow> 'a \<Rightarrow> bool" "op <=" "op <"]
haftmann@27689
   519
  
haftmann@27689
   520
declare order_refl  [order add le_refl: order "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   521
  
haftmann@27689
   522
declare less_imp_le [order add less_imp_le: order "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   523
  
haftmann@27689
   524
declare antisym [order add eqI: order "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   525
haftmann@27689
   526
declare eq_refl [order add eqD1: order "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   527
haftmann@27689
   528
declare sym [THEN eq_refl, order add eqD2: order "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   529
haftmann@27689
   530
declare less_trans [order add less_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   531
  
haftmann@27689
   532
declare less_le_trans [order add less_le_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   533
  
haftmann@27689
   534
declare le_less_trans [order add le_less_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   535
haftmann@27689
   536
declare order_trans [order add le_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   537
haftmann@27689
   538
declare le_neq_trans [order add le_neq_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   539
haftmann@27689
   540
declare neq_le_trans [order add neq_le_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   541
haftmann@27689
   542
declare less_imp_neq [order add less_imp_neq: order "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   543
haftmann@27689
   544
declare eq_neq_eq_imp_neq [order add eq_neq_eq_imp_neq: order "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   545
haftmann@27689
   546
declare not_sym [order add not_sym: order "op = :: 'a => 'a => bool" "op <=" "op <"]
ballarin@24641
   547
haftmann@25076
   548
end
haftmann@25076
   549
haftmann@25076
   550
context linorder
haftmann@25076
   551
begin
ballarin@24641
   552
haftmann@27689
   553
declare [[order del: order "op = :: 'a => 'a => bool" "op <=" "op <"]]
haftmann@27689
   554
haftmann@27689
   555
declare less_irrefl [THEN notE, order add less_reflE: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   556
haftmann@27689
   557
declare order_refl [order add le_refl: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   558
haftmann@27689
   559
declare less_imp_le [order add less_imp_le: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   560
haftmann@27689
   561
declare not_less [THEN iffD2, order add not_lessI: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   562
haftmann@27689
   563
declare not_le [THEN iffD2, order add not_leI: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   564
haftmann@27689
   565
declare not_less [THEN iffD1, order add not_lessD: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   566
haftmann@27689
   567
declare not_le [THEN iffD1, order add not_leD: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   568
haftmann@27689
   569
declare antisym [order add eqI: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   570
haftmann@27689
   571
declare eq_refl [order add eqD1: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@25076
   572
haftmann@27689
   573
declare sym [THEN eq_refl, order add eqD2: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   574
haftmann@27689
   575
declare less_trans [order add less_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   576
haftmann@27689
   577
declare less_le_trans [order add less_le_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   578
haftmann@27689
   579
declare le_less_trans [order add le_less_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   580
haftmann@27689
   581
declare order_trans [order add le_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   582
haftmann@27689
   583
declare le_neq_trans [order add le_neq_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   584
haftmann@27689
   585
declare neq_le_trans [order add neq_le_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   586
haftmann@27689
   587
declare less_imp_neq [order add less_imp_neq: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   588
haftmann@27689
   589
declare eq_neq_eq_imp_neq [order add eq_neq_eq_imp_neq: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
haftmann@27689
   590
haftmann@27689
   591
declare not_sym [order add not_sym: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
ballarin@24641
   592
haftmann@25076
   593
end
haftmann@25076
   594
wenzelm@60758
   595
setup \<open>
wenzelm@56509
   596
  map_theory_simpset (fn ctxt0 => ctxt0 addSolver
wenzelm@56509
   597
    mk_solver "Transitivity" (fn ctxt => Orders.order_tac ctxt (Simplifier.prems_of ctxt)))
wenzelm@56509
   598
  (*Adding the transitivity reasoners also as safe solvers showed a slight
wenzelm@56509
   599
    speed up, but the reasoning strength appears to be not higher (at least
wenzelm@56509
   600
    no breaking of additional proofs in the entire HOL distribution, as
wenzelm@56509
   601
    of 5 March 2004, was observed).*)
wenzelm@60758
   602
\<close>
nipkow@15524
   603
wenzelm@60758
   604
ML \<open>
wenzelm@56509
   605
local
wenzelm@56509
   606
  fun prp t thm = Thm.prop_of thm = t;  (* FIXME proper aconv!? *)
wenzelm@56509
   607
in
nipkow@15524
   608
wenzelm@56509
   609
fun antisym_le_simproc ctxt ct =
wenzelm@59582
   610
  (case Thm.term_of ct of
wenzelm@56509
   611
    (le as Const (_, T)) $ r $ s =>
wenzelm@56509
   612
     (let
wenzelm@56509
   613
        val prems = Simplifier.prems_of ctxt;
wenzelm@56509
   614
        val less = Const (@{const_name less}, T);
wenzelm@56509
   615
        val t = HOLogic.mk_Trueprop(le $ s $ r);
wenzelm@56509
   616
      in
wenzelm@56509
   617
        (case find_first (prp t) prems of
wenzelm@56509
   618
          NONE =>
wenzelm@56509
   619
            let val t = HOLogic.mk_Trueprop(HOLogic.Not $ (less $ r $ s)) in
wenzelm@56509
   620
              (case find_first (prp t) prems of
wenzelm@56509
   621
                NONE => NONE
wenzelm@56509
   622
              | SOME thm => SOME(mk_meta_eq(thm RS @{thm linorder_class.antisym_conv1})))
wenzelm@56509
   623
             end
wenzelm@56509
   624
         | SOME thm => SOME (mk_meta_eq (thm RS @{thm order_class.antisym_conv})))
wenzelm@56509
   625
      end handle THM _ => NONE)
wenzelm@56509
   626
  | _ => NONE);
nipkow@15524
   627
wenzelm@56509
   628
fun antisym_less_simproc ctxt ct =
wenzelm@59582
   629
  (case Thm.term_of ct of
wenzelm@56509
   630
    NotC $ ((less as Const(_,T)) $ r $ s) =>
wenzelm@56509
   631
     (let
wenzelm@56509
   632
       val prems = Simplifier.prems_of ctxt;
wenzelm@56509
   633
       val le = Const (@{const_name less_eq}, T);
wenzelm@56509
   634
       val t = HOLogic.mk_Trueprop(le $ r $ s);
wenzelm@56509
   635
      in
wenzelm@56509
   636
        (case find_first (prp t) prems of
wenzelm@56509
   637
          NONE =>
wenzelm@56509
   638
            let val t = HOLogic.mk_Trueprop (NotC $ (less $ s $ r)) in
wenzelm@56509
   639
              (case find_first (prp t) prems of
wenzelm@56509
   640
                NONE => NONE
wenzelm@56509
   641
              | SOME thm => SOME (mk_meta_eq(thm RS @{thm linorder_class.antisym_conv3})))
wenzelm@56509
   642
            end
wenzelm@56509
   643
        | SOME thm => SOME (mk_meta_eq (thm RS @{thm linorder_class.antisym_conv2})))
wenzelm@56509
   644
      end handle THM _ => NONE)
wenzelm@56509
   645
  | _ => NONE);
haftmann@21083
   646
wenzelm@56509
   647
end;
wenzelm@60758
   648
\<close>
nipkow@15524
   649
wenzelm@56509
   650
simproc_setup antisym_le ("(x::'a::order) \<le> y") = "K antisym_le_simproc"
wenzelm@56509
   651
simproc_setup antisym_less ("\<not> (x::'a::linorder) < y") = "K antisym_less_simproc"
wenzelm@56509
   652
nipkow@15524
   653
wenzelm@60758
   654
subsection \<open>Bounded quantifiers\<close>
haftmann@21083
   655
haftmann@21083
   656
syntax
wenzelm@21180
   657
  "_All_less" :: "[idt, 'a, bool] => bool"    ("(3ALL _<_./ _)"  [0, 0, 10] 10)
wenzelm@21180
   658
  "_Ex_less" :: "[idt, 'a, bool] => bool"    ("(3EX _<_./ _)"  [0, 0, 10] 10)
wenzelm@21180
   659
  "_All_less_eq" :: "[idt, 'a, bool] => bool"    ("(3ALL _<=_./ _)" [0, 0, 10] 10)
wenzelm@21180
   660
  "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3EX _<=_./ _)" [0, 0, 10] 10)
haftmann@21083
   661
wenzelm@21180
   662
  "_All_greater" :: "[idt, 'a, bool] => bool"    ("(3ALL _>_./ _)"  [0, 0, 10] 10)
wenzelm@21180
   663
  "_Ex_greater" :: "[idt, 'a, bool] => bool"    ("(3EX _>_./ _)"  [0, 0, 10] 10)
wenzelm@21180
   664
  "_All_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3ALL _>=_./ _)" [0, 0, 10] 10)
wenzelm@21180
   665
  "_Ex_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3EX _>=_./ _)" [0, 0, 10] 10)
haftmann@21083
   666
haftmann@21083
   667
syntax (xsymbols)
wenzelm@21180
   668
  "_All_less" :: "[idt, 'a, bool] => bool"    ("(3\<forall>_<_./ _)"  [0, 0, 10] 10)
wenzelm@21180
   669
  "_Ex_less" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_<_./ _)"  [0, 0, 10] 10)
wenzelm@21180
   670
  "_All_less_eq" :: "[idt, 'a, bool] => bool"    ("(3\<forall>_\<le>_./ _)" [0, 0, 10] 10)
wenzelm@21180
   671
  "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<le>_./ _)" [0, 0, 10] 10)
haftmann@21083
   672
wenzelm@21180
   673
  "_All_greater" :: "[idt, 'a, bool] => bool"    ("(3\<forall>_>_./ _)"  [0, 0, 10] 10)
wenzelm@21180
   674
  "_Ex_greater" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_>_./ _)"  [0, 0, 10] 10)
wenzelm@21180
   675
  "_All_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3\<forall>_\<ge>_./ _)" [0, 0, 10] 10)
wenzelm@21180
   676
  "_Ex_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<ge>_./ _)" [0, 0, 10] 10)
haftmann@21083
   677
haftmann@21083
   678
syntax (HOL)
wenzelm@21180
   679
  "_All_less" :: "[idt, 'a, bool] => bool"    ("(3! _<_./ _)"  [0, 0, 10] 10)
wenzelm@21180
   680
  "_Ex_less" :: "[idt, 'a, bool] => bool"    ("(3? _<_./ _)"  [0, 0, 10] 10)
wenzelm@21180
   681
  "_All_less_eq" :: "[idt, 'a, bool] => bool"    ("(3! _<=_./ _)" [0, 0, 10] 10)
wenzelm@21180
   682
  "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3? _<=_./ _)" [0, 0, 10] 10)
haftmann@21083
   683
haftmann@21083
   684
translations
haftmann@21083
   685
  "ALL x<y. P"   =>  "ALL x. x < y \<longrightarrow> P"
haftmann@21083
   686
  "EX x<y. P"    =>  "EX x. x < y \<and> P"
haftmann@21083
   687
  "ALL x<=y. P"  =>  "ALL x. x <= y \<longrightarrow> P"
haftmann@21083
   688
  "EX x<=y. P"   =>  "EX x. x <= y \<and> P"
haftmann@21083
   689
  "ALL x>y. P"   =>  "ALL x. x > y \<longrightarrow> P"
haftmann@21083
   690
  "EX x>y. P"    =>  "EX x. x > y \<and> P"
haftmann@21083
   691
  "ALL x>=y. P"  =>  "ALL x. x >= y \<longrightarrow> P"
haftmann@21083
   692
  "EX x>=y. P"   =>  "EX x. x >= y \<and> P"
haftmann@21083
   693
wenzelm@60758
   694
print_translation \<open>
haftmann@21083
   695
let
wenzelm@42287
   696
  val All_binder = Mixfix.binder_name @{const_syntax All};
wenzelm@42287
   697
  val Ex_binder = Mixfix.binder_name @{const_syntax Ex};
haftmann@38786
   698
  val impl = @{const_syntax HOL.implies};
haftmann@38795
   699
  val conj = @{const_syntax HOL.conj};
haftmann@22916
   700
  val less = @{const_syntax less};
haftmann@22916
   701
  val less_eq = @{const_syntax less_eq};
wenzelm@21180
   702
wenzelm@21180
   703
  val trans =
wenzelm@35115
   704
   [((All_binder, impl, less),
wenzelm@35115
   705
    (@{syntax_const "_All_less"}, @{syntax_const "_All_greater"})),
wenzelm@35115
   706
    ((All_binder, impl, less_eq),
wenzelm@35115
   707
    (@{syntax_const "_All_less_eq"}, @{syntax_const "_All_greater_eq"})),
wenzelm@35115
   708
    ((Ex_binder, conj, less),
wenzelm@35115
   709
    (@{syntax_const "_Ex_less"}, @{syntax_const "_Ex_greater"})),
wenzelm@35115
   710
    ((Ex_binder, conj, less_eq),
wenzelm@35115
   711
    (@{syntax_const "_Ex_less_eq"}, @{syntax_const "_Ex_greater_eq"}))];
wenzelm@21180
   712
wenzelm@35115
   713
  fun matches_bound v t =
wenzelm@35115
   714
    (case t of
wenzelm@35364
   715
      Const (@{syntax_const "_bound"}, _) $ Free (v', _) => v = v'
wenzelm@35115
   716
    | _ => false);
wenzelm@35115
   717
  fun contains_var v = Term.exists_subterm (fn Free (x, _) => x = v | _ => false);
wenzelm@49660
   718
  fun mk x c n P = Syntax.const c $ Syntax_Trans.mark_bound_body x $ n $ P;
wenzelm@21180
   719
wenzelm@52143
   720
  fun tr' q = (q, fn _ =>
wenzelm@52143
   721
    (fn [Const (@{syntax_const "_bound"}, _) $ Free (v, T),
wenzelm@35364
   722
        Const (c, _) $ (Const (d, _) $ t $ u) $ P] =>
wenzelm@35115
   723
        (case AList.lookup (op =) trans (q, c, d) of
wenzelm@35115
   724
          NONE => raise Match
wenzelm@35115
   725
        | SOME (l, g) =>
wenzelm@49660
   726
            if matches_bound v t andalso not (contains_var v u) then mk (v, T) l u P
wenzelm@49660
   727
            else if matches_bound v u andalso not (contains_var v t) then mk (v, T) g t P
wenzelm@35115
   728
            else raise Match)
wenzelm@52143
   729
      | _ => raise Match));
wenzelm@21524
   730
in [tr' All_binder, tr' Ex_binder] end
wenzelm@60758
   731
\<close>
haftmann@21083
   732
haftmann@21083
   733
wenzelm@60758
   734
subsection \<open>Transitivity reasoning\<close>
haftmann@21383
   735
haftmann@25193
   736
context ord
haftmann@25193
   737
begin
haftmann@21383
   738
haftmann@25193
   739
lemma ord_le_eq_trans: "a \<le> b \<Longrightarrow> b = c \<Longrightarrow> a \<le> c"
haftmann@25193
   740
  by (rule subst)
haftmann@21383
   741
haftmann@25193
   742
lemma ord_eq_le_trans: "a = b \<Longrightarrow> b \<le> c \<Longrightarrow> a \<le> c"
haftmann@25193
   743
  by (rule ssubst)
haftmann@21383
   744
haftmann@25193
   745
lemma ord_less_eq_trans: "a < b \<Longrightarrow> b = c \<Longrightarrow> a < c"
haftmann@25193
   746
  by (rule subst)
haftmann@25193
   747
haftmann@25193
   748
lemma ord_eq_less_trans: "a = b \<Longrightarrow> b < c \<Longrightarrow> a < c"
haftmann@25193
   749
  by (rule ssubst)
haftmann@25193
   750
haftmann@25193
   751
end
haftmann@21383
   752
haftmann@21383
   753
lemma order_less_subst2: "(a::'a::order) < b ==> f b < (c::'c::order) ==>
haftmann@21383
   754
  (!!x y. x < y ==> f x < f y) ==> f a < c"
haftmann@21383
   755
proof -
haftmann@21383
   756
  assume r: "!!x y. x < y ==> f x < f y"
haftmann@21383
   757
  assume "a < b" hence "f a < f b" by (rule r)
haftmann@21383
   758
  also assume "f b < c"
haftmann@34250
   759
  finally (less_trans) show ?thesis .
haftmann@21383
   760
qed
haftmann@21383
   761
haftmann@21383
   762
lemma order_less_subst1: "(a::'a::order) < f b ==> (b::'b::order) < c ==>
haftmann@21383
   763
  (!!x y. x < y ==> f x < f y) ==> a < f c"
haftmann@21383
   764
proof -
haftmann@21383
   765
  assume r: "!!x y. x < y ==> f x < f y"
haftmann@21383
   766
  assume "a < f b"
haftmann@21383
   767
  also assume "b < c" hence "f b < f c" by (rule r)
haftmann@34250
   768
  finally (less_trans) show ?thesis .
haftmann@21383
   769
qed
haftmann@21383
   770
haftmann@21383
   771
lemma order_le_less_subst2: "(a::'a::order) <= b ==> f b < (c::'c::order) ==>
haftmann@21383
   772
  (!!x y. x <= y ==> f x <= f y) ==> f a < c"
haftmann@21383
   773
proof -
haftmann@21383
   774
  assume r: "!!x y. x <= y ==> f x <= f y"
haftmann@21383
   775
  assume "a <= b" hence "f a <= f b" by (rule r)
haftmann@21383
   776
  also assume "f b < c"
haftmann@34250
   777
  finally (le_less_trans) show ?thesis .
haftmann@21383
   778
qed
haftmann@21383
   779
haftmann@21383
   780
lemma order_le_less_subst1: "(a::'a::order) <= f b ==> (b::'b::order) < c ==>
haftmann@21383
   781
  (!!x y. x < y ==> f x < f y) ==> a < f c"
haftmann@21383
   782
proof -
haftmann@21383
   783
  assume r: "!!x y. x < y ==> f x < f y"
haftmann@21383
   784
  assume "a <= f b"
haftmann@21383
   785
  also assume "b < c" hence "f b < f c" by (rule r)
haftmann@34250
   786
  finally (le_less_trans) show ?thesis .
haftmann@21383
   787
qed
haftmann@21383
   788
haftmann@21383
   789
lemma order_less_le_subst2: "(a::'a::order) < b ==> f b <= (c::'c::order) ==>
haftmann@21383
   790
  (!!x y. x < y ==> f x < f y) ==> f a < c"
haftmann@21383
   791
proof -
haftmann@21383
   792
  assume r: "!!x y. x < y ==> f x < f y"
haftmann@21383
   793
  assume "a < b" hence "f a < f b" by (rule r)
haftmann@21383
   794
  also assume "f b <= c"
haftmann@34250
   795
  finally (less_le_trans) show ?thesis .
haftmann@21383
   796
qed
haftmann@21383
   797
haftmann@21383
   798
lemma order_less_le_subst1: "(a::'a::order) < f b ==> (b::'b::order) <= c ==>
haftmann@21383
   799
  (!!x y. x <= y ==> f x <= f y) ==> a < f c"
haftmann@21383
   800
proof -
haftmann@21383
   801
  assume r: "!!x y. x <= y ==> f x <= f y"
haftmann@21383
   802
  assume "a < f b"
haftmann@21383
   803
  also assume "b <= c" hence "f b <= f c" by (rule r)
haftmann@34250
   804
  finally (less_le_trans) show ?thesis .
haftmann@21383
   805
qed
haftmann@21383
   806
haftmann@21383
   807
lemma order_subst1: "(a::'a::order) <= f b ==> (b::'b::order) <= c ==>
haftmann@21383
   808
  (!!x y. x <= y ==> f x <= f y) ==> a <= f c"
haftmann@21383
   809
proof -
haftmann@21383
   810
  assume r: "!!x y. x <= y ==> f x <= f y"
haftmann@21383
   811
  assume "a <= f b"
haftmann@21383
   812
  also assume "b <= c" hence "f b <= f c" by (rule r)
haftmann@21383
   813
  finally (order_trans) show ?thesis .
haftmann@21383
   814
qed
haftmann@21383
   815
haftmann@21383
   816
lemma order_subst2: "(a::'a::order) <= b ==> f b <= (c::'c::order) ==>
haftmann@21383
   817
  (!!x y. x <= y ==> f x <= f y) ==> f a <= c"
haftmann@21383
   818
proof -
haftmann@21383
   819
  assume r: "!!x y. x <= y ==> f x <= f y"
haftmann@21383
   820
  assume "a <= b" hence "f a <= f b" by (rule r)
haftmann@21383
   821
  also assume "f b <= c"
haftmann@21383
   822
  finally (order_trans) show ?thesis .
haftmann@21383
   823
qed
haftmann@21383
   824
haftmann@21383
   825
lemma ord_le_eq_subst: "a <= b ==> f b = c ==>
haftmann@21383
   826
  (!!x y. x <= y ==> f x <= f y) ==> f a <= c"
haftmann@21383
   827
proof -
haftmann@21383
   828
  assume r: "!!x y. x <= y ==> f x <= f y"
haftmann@21383
   829
  assume "a <= b" hence "f a <= f b" by (rule r)
haftmann@21383
   830
  also assume "f b = c"
haftmann@21383
   831
  finally (ord_le_eq_trans) show ?thesis .
haftmann@21383
   832
qed
haftmann@21383
   833
haftmann@21383
   834
lemma ord_eq_le_subst: "a = f b ==> b <= c ==>
haftmann@21383
   835
  (!!x y. x <= y ==> f x <= f y) ==> a <= f c"
haftmann@21383
   836
proof -
haftmann@21383
   837
  assume r: "!!x y. x <= y ==> f x <= f y"
haftmann@21383
   838
  assume "a = f b"
haftmann@21383
   839
  also assume "b <= c" hence "f b <= f c" by (rule r)
haftmann@21383
   840
  finally (ord_eq_le_trans) show ?thesis .
haftmann@21383
   841
qed
haftmann@21383
   842
haftmann@21383
   843
lemma ord_less_eq_subst: "a < b ==> f b = c ==>
haftmann@21383
   844
  (!!x y. x < y ==> f x < f y) ==> f a < c"
haftmann@21383
   845
proof -
haftmann@21383
   846
  assume r: "!!x y. x < y ==> f x < f y"
haftmann@21383
   847
  assume "a < b" hence "f a < f b" by (rule r)
haftmann@21383
   848
  also assume "f b = c"
haftmann@21383
   849
  finally (ord_less_eq_trans) show ?thesis .
haftmann@21383
   850
qed
haftmann@21383
   851
haftmann@21383
   852
lemma ord_eq_less_subst: "a = f b ==> b < c ==>
haftmann@21383
   853
  (!!x y. x < y ==> f x < f y) ==> a < f c"
haftmann@21383
   854
proof -
haftmann@21383
   855
  assume r: "!!x y. x < y ==> f x < f y"
haftmann@21383
   856
  assume "a = f b"
haftmann@21383
   857
  also assume "b < c" hence "f b < f c" by (rule r)
haftmann@21383
   858
  finally (ord_eq_less_trans) show ?thesis .
haftmann@21383
   859
qed
haftmann@21383
   860
wenzelm@60758
   861
text \<open>
haftmann@21383
   862
  Note that this list of rules is in reverse order of priorities.
wenzelm@60758
   863
\<close>
haftmann@21383
   864
haftmann@27682
   865
lemmas [trans] =
haftmann@21383
   866
  order_less_subst2
haftmann@21383
   867
  order_less_subst1
haftmann@21383
   868
  order_le_less_subst2
haftmann@21383
   869
  order_le_less_subst1
haftmann@21383
   870
  order_less_le_subst2
haftmann@21383
   871
  order_less_le_subst1
haftmann@21383
   872
  order_subst2
haftmann@21383
   873
  order_subst1
haftmann@21383
   874
  ord_le_eq_subst
haftmann@21383
   875
  ord_eq_le_subst
haftmann@21383
   876
  ord_less_eq_subst
haftmann@21383
   877
  ord_eq_less_subst
haftmann@21383
   878
  forw_subst
haftmann@21383
   879
  back_subst
haftmann@21383
   880
  rev_mp
haftmann@21383
   881
  mp
haftmann@27682
   882
haftmann@27682
   883
lemmas (in order) [trans] =
haftmann@27682
   884
  neq_le_trans
haftmann@27682
   885
  le_neq_trans
haftmann@27682
   886
haftmann@27682
   887
lemmas (in preorder) [trans] =
haftmann@27682
   888
  less_trans
haftmann@27682
   889
  less_asym'
haftmann@27682
   890
  le_less_trans
haftmann@27682
   891
  less_le_trans
haftmann@21383
   892
  order_trans
haftmann@27682
   893
haftmann@27682
   894
lemmas (in order) [trans] =
haftmann@27682
   895
  antisym
haftmann@27682
   896
haftmann@27682
   897
lemmas (in ord) [trans] =
haftmann@27682
   898
  ord_le_eq_trans
haftmann@27682
   899
  ord_eq_le_trans
haftmann@27682
   900
  ord_less_eq_trans
haftmann@27682
   901
  ord_eq_less_trans
haftmann@27682
   902
haftmann@27682
   903
lemmas [trans] =
haftmann@27682
   904
  trans
haftmann@27682
   905
haftmann@27682
   906
lemmas order_trans_rules =
haftmann@27682
   907
  order_less_subst2
haftmann@27682
   908
  order_less_subst1
haftmann@27682
   909
  order_le_less_subst2
haftmann@27682
   910
  order_le_less_subst1
haftmann@27682
   911
  order_less_le_subst2
haftmann@27682
   912
  order_less_le_subst1
haftmann@27682
   913
  order_subst2
haftmann@27682
   914
  order_subst1
haftmann@27682
   915
  ord_le_eq_subst
haftmann@27682
   916
  ord_eq_le_subst
haftmann@27682
   917
  ord_less_eq_subst
haftmann@27682
   918
  ord_eq_less_subst
haftmann@27682
   919
  forw_subst
haftmann@27682
   920
  back_subst
haftmann@27682
   921
  rev_mp
haftmann@27682
   922
  mp
haftmann@27682
   923
  neq_le_trans
haftmann@27682
   924
  le_neq_trans
haftmann@27682
   925
  less_trans
haftmann@27682
   926
  less_asym'
haftmann@27682
   927
  le_less_trans
haftmann@27682
   928
  less_le_trans
haftmann@27682
   929
  order_trans
haftmann@27682
   930
  antisym
haftmann@21383
   931
  ord_le_eq_trans
haftmann@21383
   932
  ord_eq_le_trans
haftmann@21383
   933
  ord_less_eq_trans
haftmann@21383
   934
  ord_eq_less_trans
haftmann@21383
   935
  trans
haftmann@21383
   936
wenzelm@60758
   937
text \<open>These support proving chains of decreasing inequalities
wenzelm@60758
   938
    a >= b >= c ... in Isar proofs.\<close>
haftmann@21083
   939
blanchet@45221
   940
lemma xt1 [no_atp]:
haftmann@21083
   941
  "a = b ==> b > c ==> a > c"
haftmann@21083
   942
  "a > b ==> b = c ==> a > c"
haftmann@21083
   943
  "a = b ==> b >= c ==> a >= c"
haftmann@21083
   944
  "a >= b ==> b = c ==> a >= c"
haftmann@21083
   945
  "(x::'a::order) >= y ==> y >= x ==> x = y"
haftmann@21083
   946
  "(x::'a::order) >= y ==> y >= z ==> x >= z"
haftmann@21083
   947
  "(x::'a::order) > y ==> y >= z ==> x > z"
haftmann@21083
   948
  "(x::'a::order) >= y ==> y > z ==> x > z"
wenzelm@23417
   949
  "(a::'a::order) > b ==> b > a ==> P"
haftmann@21083
   950
  "(x::'a::order) > y ==> y > z ==> x > z"
haftmann@21083
   951
  "(a::'a::order) >= b ==> a ~= b ==> a > b"
haftmann@21083
   952
  "(a::'a::order) ~= b ==> a >= b ==> a > b"
haftmann@21083
   953
  "a = f b ==> b > c ==> (!!x y. x > y ==> f x > f y) ==> a > f c" 
haftmann@21083
   954
  "a > b ==> f b = c ==> (!!x y. x > y ==> f x > f y) ==> f a > c"
haftmann@21083
   955
  "a = f b ==> b >= c ==> (!!x y. x >= y ==> f x >= f y) ==> a >= f c"
haftmann@21083
   956
  "a >= b ==> f b = c ==> (!! x y. x >= y ==> f x >= f y) ==> f a >= c"
haftmann@25076
   957
  by auto
haftmann@21083
   958
blanchet@45221
   959
lemma xt2 [no_atp]:
haftmann@21083
   960
  "(a::'a::order) >= f b ==> b >= c ==> (!!x y. x >= y ==> f x >= f y) ==> a >= f c"
haftmann@21083
   961
by (subgoal_tac "f b >= f c", force, force)
haftmann@21083
   962
blanchet@45221
   963
lemma xt3 [no_atp]: "(a::'a::order) >= b ==> (f b::'b::order) >= c ==>
haftmann@21083
   964
    (!!x y. x >= y ==> f x >= f y) ==> f a >= c"
haftmann@21083
   965
by (subgoal_tac "f a >= f b", force, force)
haftmann@21083
   966
blanchet@45221
   967
lemma xt4 [no_atp]: "(a::'a::order) > f b ==> (b::'b::order) >= c ==>
haftmann@21083
   968
  (!!x y. x >= y ==> f x >= f y) ==> a > f c"
haftmann@21083
   969
by (subgoal_tac "f b >= f c", force, force)
haftmann@21083
   970
blanchet@45221
   971
lemma xt5 [no_atp]: "(a::'a::order) > b ==> (f b::'b::order) >= c==>
haftmann@21083
   972
    (!!x y. x > y ==> f x > f y) ==> f a > c"
haftmann@21083
   973
by (subgoal_tac "f a > f b", force, force)
haftmann@21083
   974
blanchet@45221
   975
lemma xt6 [no_atp]: "(a::'a::order) >= f b ==> b > c ==>
haftmann@21083
   976
    (!!x y. x > y ==> f x > f y) ==> a > f c"
haftmann@21083
   977
by (subgoal_tac "f b > f c", force, force)
haftmann@21083
   978
blanchet@45221
   979
lemma xt7 [no_atp]: "(a::'a::order) >= b ==> (f b::'b::order) > c ==>
haftmann@21083
   980
    (!!x y. x >= y ==> f x >= f y) ==> f a > c"
haftmann@21083
   981
by (subgoal_tac "f a >= f b", force, force)
haftmann@21083
   982
blanchet@45221
   983
lemma xt8 [no_atp]: "(a::'a::order) > f b ==> (b::'b::order) > c ==>
haftmann@21083
   984
    (!!x y. x > y ==> f x > f y) ==> a > f c"
haftmann@21083
   985
by (subgoal_tac "f b > f c", force, force)
haftmann@21083
   986
blanchet@45221
   987
lemma xt9 [no_atp]: "(a::'a::order) > b ==> (f b::'b::order) > c ==>
haftmann@21083
   988
    (!!x y. x > y ==> f x > f y) ==> f a > c"
haftmann@21083
   989
by (subgoal_tac "f a > f b", force, force)
haftmann@21083
   990
blanchet@54147
   991
lemmas xtrans = xt1 xt2 xt3 xt4 xt5 xt6 xt7 xt8 xt9
haftmann@21083
   992
haftmann@21083
   993
(* 
haftmann@21083
   994
  Since "a >= b" abbreviates "b <= a", the abbreviation "..." stands
haftmann@21083
   995
  for the wrong thing in an Isar proof.
haftmann@21083
   996
haftmann@21083
   997
  The extra transitivity rules can be used as follows: 
haftmann@21083
   998
haftmann@21083
   999
lemma "(a::'a::order) > z"
haftmann@21083
  1000
proof -
haftmann@21083
  1001
  have "a >= b" (is "_ >= ?rhs")
haftmann@21083
  1002
    sorry
haftmann@21083
  1003
  also have "?rhs >= c" (is "_ >= ?rhs")
haftmann@21083
  1004
    sorry
haftmann@21083
  1005
  also (xtrans) have "?rhs = d" (is "_ = ?rhs")
haftmann@21083
  1006
    sorry
haftmann@21083
  1007
  also (xtrans) have "?rhs >= e" (is "_ >= ?rhs")
haftmann@21083
  1008
    sorry
haftmann@21083
  1009
  also (xtrans) have "?rhs > f" (is "_ > ?rhs")
haftmann@21083
  1010
    sorry
haftmann@21083
  1011
  also (xtrans) have "?rhs > z"
haftmann@21083
  1012
    sorry
haftmann@21083
  1013
  finally (xtrans) show ?thesis .
haftmann@21083
  1014
qed
haftmann@21083
  1015
haftmann@21083
  1016
  Alternatively, one can use "declare xtrans [trans]" and then
haftmann@21083
  1017
  leave out the "(xtrans)" above.
haftmann@21083
  1018
*)
haftmann@21083
  1019
haftmann@23881
  1020
wenzelm@60758
  1021
subsection \<open>Monotonicity\<close>
haftmann@21083
  1022
haftmann@25076
  1023
context order
haftmann@25076
  1024
begin
haftmann@25076
  1025
wenzelm@61076
  1026
definition mono :: "('a \<Rightarrow> 'b::order) \<Rightarrow> bool" where
haftmann@25076
  1027
  "mono f \<longleftrightarrow> (\<forall>x y. x \<le> y \<longrightarrow> f x \<le> f y)"
haftmann@25076
  1028
haftmann@25076
  1029
lemma monoI [intro?]:
wenzelm@61076
  1030
  fixes f :: "'a \<Rightarrow> 'b::order"
haftmann@25076
  1031
  shows "(\<And>x y. x \<le> y \<Longrightarrow> f x \<le> f y) \<Longrightarrow> mono f"
haftmann@25076
  1032
  unfolding mono_def by iprover
haftmann@21216
  1033
haftmann@25076
  1034
lemma monoD [dest?]:
wenzelm@61076
  1035
  fixes f :: "'a \<Rightarrow> 'b::order"
haftmann@25076
  1036
  shows "mono f \<Longrightarrow> x \<le> y \<Longrightarrow> f x \<le> f y"
haftmann@25076
  1037
  unfolding mono_def by iprover
haftmann@25076
  1038
haftmann@51263
  1039
lemma monoE:
wenzelm@61076
  1040
  fixes f :: "'a \<Rightarrow> 'b::order"
haftmann@51263
  1041
  assumes "mono f"
haftmann@51263
  1042
  assumes "x \<le> y"
haftmann@51263
  1043
  obtains "f x \<le> f y"
haftmann@51263
  1044
proof
haftmann@51263
  1045
  from assms show "f x \<le> f y" by (simp add: mono_def)
haftmann@51263
  1046
qed
haftmann@51263
  1047
wenzelm@61076
  1048
definition antimono :: "('a \<Rightarrow> 'b::order) \<Rightarrow> bool" where
hoelzl@56020
  1049
  "antimono f \<longleftrightarrow> (\<forall>x y. x \<le> y \<longrightarrow> f x \<ge> f y)"
hoelzl@56020
  1050
hoelzl@56020
  1051
lemma antimonoI [intro?]:
wenzelm@61076
  1052
  fixes f :: "'a \<Rightarrow> 'b::order"
hoelzl@56020
  1053
  shows "(\<And>x y. x \<le> y \<Longrightarrow> f x \<ge> f y) \<Longrightarrow> antimono f"
hoelzl@56020
  1054
  unfolding antimono_def by iprover
hoelzl@56020
  1055
hoelzl@56020
  1056
lemma antimonoD [dest?]:
wenzelm@61076
  1057
  fixes f :: "'a \<Rightarrow> 'b::order"
hoelzl@56020
  1058
  shows "antimono f \<Longrightarrow> x \<le> y \<Longrightarrow> f x \<ge> f y"
hoelzl@56020
  1059
  unfolding antimono_def by iprover
hoelzl@56020
  1060
hoelzl@56020
  1061
lemma antimonoE:
wenzelm@61076
  1062
  fixes f :: "'a \<Rightarrow> 'b::order"
hoelzl@56020
  1063
  assumes "antimono f"
hoelzl@56020
  1064
  assumes "x \<le> y"
hoelzl@56020
  1065
  obtains "f x \<ge> f y"
hoelzl@56020
  1066
proof
hoelzl@56020
  1067
  from assms show "f x \<ge> f y" by (simp add: antimono_def)
hoelzl@56020
  1068
qed
hoelzl@56020
  1069
wenzelm@61076
  1070
definition strict_mono :: "('a \<Rightarrow> 'b::order) \<Rightarrow> bool" where
haftmann@30298
  1071
  "strict_mono f \<longleftrightarrow> (\<forall>x y. x < y \<longrightarrow> f x < f y)"
haftmann@30298
  1072
haftmann@30298
  1073
lemma strict_monoI [intro?]:
haftmann@30298
  1074
  assumes "\<And>x y. x < y \<Longrightarrow> f x < f y"
haftmann@30298
  1075
  shows "strict_mono f"
haftmann@30298
  1076
  using assms unfolding strict_mono_def by auto
haftmann@30298
  1077
haftmann@30298
  1078
lemma strict_monoD [dest?]:
haftmann@30298
  1079
  "strict_mono f \<Longrightarrow> x < y \<Longrightarrow> f x < f y"
haftmann@30298
  1080
  unfolding strict_mono_def by auto
haftmann@30298
  1081
haftmann@30298
  1082
lemma strict_mono_mono [dest?]:
haftmann@30298
  1083
  assumes "strict_mono f"
haftmann@30298
  1084
  shows "mono f"
haftmann@30298
  1085
proof (rule monoI)
haftmann@30298
  1086
  fix x y
haftmann@30298
  1087
  assume "x \<le> y"
haftmann@30298
  1088
  show "f x \<le> f y"
haftmann@30298
  1089
  proof (cases "x = y")
haftmann@30298
  1090
    case True then show ?thesis by simp
haftmann@30298
  1091
  next
wenzelm@60758
  1092
    case False with \<open>x \<le> y\<close> have "x < y" by simp
haftmann@30298
  1093
    with assms strict_monoD have "f x < f y" by auto
haftmann@30298
  1094
    then show ?thesis by simp
haftmann@30298
  1095
  qed
haftmann@30298
  1096
qed
haftmann@30298
  1097
haftmann@25076
  1098
end
haftmann@25076
  1099
haftmann@25076
  1100
context linorder
haftmann@25076
  1101
begin
haftmann@25076
  1102
haftmann@51263
  1103
lemma mono_invE:
wenzelm@61076
  1104
  fixes f :: "'a \<Rightarrow> 'b::order"
haftmann@51263
  1105
  assumes "mono f"
haftmann@51263
  1106
  assumes "f x < f y"
haftmann@51263
  1107
  obtains "x \<le> y"
haftmann@51263
  1108
proof
haftmann@51263
  1109
  show "x \<le> y"
haftmann@51263
  1110
  proof (rule ccontr)
haftmann@51263
  1111
    assume "\<not> x \<le> y"
haftmann@51263
  1112
    then have "y \<le> x" by simp
wenzelm@60758
  1113
    with \<open>mono f\<close> obtain "f y \<le> f x" by (rule monoE)
wenzelm@60758
  1114
    with \<open>f x < f y\<close> show False by simp
haftmann@51263
  1115
  qed
haftmann@51263
  1116
qed
haftmann@51263
  1117
haftmann@30298
  1118
lemma strict_mono_eq:
haftmann@30298
  1119
  assumes "strict_mono f"
haftmann@30298
  1120
  shows "f x = f y \<longleftrightarrow> x = y"
haftmann@30298
  1121
proof
haftmann@30298
  1122
  assume "f x = f y"
haftmann@30298
  1123
  show "x = y" proof (cases x y rule: linorder_cases)
haftmann@30298
  1124
    case less with assms strict_monoD have "f x < f y" by auto
wenzelm@60758
  1125
    with \<open>f x = f y\<close> show ?thesis by simp
haftmann@30298
  1126
  next
haftmann@30298
  1127
    case equal then show ?thesis .
haftmann@30298
  1128
  next
haftmann@30298
  1129
    case greater with assms strict_monoD have "f y < f x" by auto
wenzelm@60758
  1130
    with \<open>f x = f y\<close> show ?thesis by simp
haftmann@30298
  1131
  qed
haftmann@30298
  1132
qed simp
haftmann@30298
  1133
haftmann@30298
  1134
lemma strict_mono_less_eq:
haftmann@30298
  1135
  assumes "strict_mono f"
haftmann@30298
  1136
  shows "f x \<le> f y \<longleftrightarrow> x \<le> y"
haftmann@30298
  1137
proof
haftmann@30298
  1138
  assume "x \<le> y"
haftmann@30298
  1139
  with assms strict_mono_mono monoD show "f x \<le> f y" by auto
haftmann@30298
  1140
next
haftmann@30298
  1141
  assume "f x \<le> f y"
haftmann@30298
  1142
  show "x \<le> y" proof (rule ccontr)
haftmann@30298
  1143
    assume "\<not> x \<le> y" then have "y < x" by simp
haftmann@30298
  1144
    with assms strict_monoD have "f y < f x" by auto
wenzelm@60758
  1145
    with \<open>f x \<le> f y\<close> show False by simp
haftmann@30298
  1146
  qed
haftmann@30298
  1147
qed
haftmann@30298
  1148
  
haftmann@30298
  1149
lemma strict_mono_less:
haftmann@30298
  1150
  assumes "strict_mono f"
haftmann@30298
  1151
  shows "f x < f y \<longleftrightarrow> x < y"
haftmann@30298
  1152
  using assms
haftmann@30298
  1153
    by (auto simp add: less_le Orderings.less_le strict_mono_eq strict_mono_less_eq)
haftmann@30298
  1154
haftmann@54860
  1155
end
haftmann@54860
  1156
haftmann@54860
  1157
wenzelm@60758
  1158
subsection \<open>min and max -- fundamental\<close>
haftmann@54860
  1159
haftmann@54860
  1160
definition (in ord) min :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" where
haftmann@54860
  1161
  "min a b = (if a \<le> b then a else b)"
haftmann@54860
  1162
haftmann@54860
  1163
definition (in ord) max :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" where
haftmann@54860
  1164
  "max a b = (if a \<le> b then b else a)"
haftmann@54860
  1165
noschinl@45931
  1166
lemma min_absorb1: "x \<le> y \<Longrightarrow> min x y = x"
haftmann@54861
  1167
  by (simp add: min_def)
haftmann@21383
  1168
haftmann@54857
  1169
lemma max_absorb2: "x \<le> y \<Longrightarrow> max x y = y"
haftmann@54861
  1170
  by (simp add: max_def)
haftmann@21383
  1171
wenzelm@61076
  1172
lemma min_absorb2: "(y::'a::order) \<le> x \<Longrightarrow> min x y = y"
haftmann@54861
  1173
  by (simp add:min_def)
noschinl@45893
  1174
wenzelm@61076
  1175
lemma max_absorb1: "(y::'a::order) \<le> x \<Longrightarrow> max x y = x"
haftmann@54861
  1176
  by (simp add: max_def)
noschinl@45893
  1177
Andreas@61630
  1178
lemma max_min_same [simp]:
Andreas@61630
  1179
  fixes x y :: "'a :: linorder"
Andreas@61630
  1180
  shows "max x (min x y) = x" "max (min x y) x = x" "max (min x y) y = y" "max y (min x y) = y"
Andreas@61630
  1181
by(auto simp add: max_def min_def)
noschinl@45893
  1182
wenzelm@60758
  1183
subsection \<open>(Unique) top and bottom elements\<close>
haftmann@28685
  1184
haftmann@52729
  1185
class bot =
haftmann@43853
  1186
  fixes bot :: 'a ("\<bottom>")
haftmann@52729
  1187
haftmann@52729
  1188
class order_bot = order + bot +
haftmann@51487
  1189
  assumes bot_least: "\<bottom> \<le> a"
haftmann@54868
  1190
begin
haftmann@51487
  1191
wenzelm@61605
  1192
sublocale bot: ordering_top greater_eq greater bot
wenzelm@61169
  1193
  by standard (fact bot_least)
haftmann@51487
  1194
haftmann@43853
  1195
lemma le_bot:
haftmann@43853
  1196
  "a \<le> \<bottom> \<Longrightarrow> a = \<bottom>"
haftmann@51487
  1197
  by (fact bot.extremum_uniqueI)
haftmann@43853
  1198
haftmann@43816
  1199
lemma bot_unique:
haftmann@43853
  1200
  "a \<le> \<bottom> \<longleftrightarrow> a = \<bottom>"
haftmann@51487
  1201
  by (fact bot.extremum_unique)
haftmann@43853
  1202
haftmann@51487
  1203
lemma not_less_bot:
haftmann@51487
  1204
  "\<not> a < \<bottom>"
haftmann@51487
  1205
  by (fact bot.extremum_strict)
haftmann@43816
  1206
haftmann@43814
  1207
lemma bot_less:
haftmann@43853
  1208
  "a \<noteq> \<bottom> \<longleftrightarrow> \<bottom> < a"
haftmann@51487
  1209
  by (fact bot.not_eq_extremum)
haftmann@43814
  1210
haftmann@43814
  1211
end
haftmann@41082
  1212
haftmann@52729
  1213
class top =
haftmann@43853
  1214
  fixes top :: 'a ("\<top>")
haftmann@52729
  1215
haftmann@52729
  1216
class order_top = order + top +
haftmann@51487
  1217
  assumes top_greatest: "a \<le> \<top>"
haftmann@54868
  1218
begin
haftmann@51487
  1219
wenzelm@61605
  1220
sublocale top: ordering_top less_eq less top
wenzelm@61169
  1221
  by standard (fact top_greatest)
haftmann@51487
  1222
haftmann@43853
  1223
lemma top_le:
haftmann@43853
  1224
  "\<top> \<le> a \<Longrightarrow> a = \<top>"
haftmann@51487
  1225
  by (fact top.extremum_uniqueI)
haftmann@43853
  1226
haftmann@43816
  1227
lemma top_unique:
haftmann@43853
  1228
  "\<top> \<le> a \<longleftrightarrow> a = \<top>"
haftmann@51487
  1229
  by (fact top.extremum_unique)
haftmann@43853
  1230
haftmann@51487
  1231
lemma not_top_less:
haftmann@51487
  1232
  "\<not> \<top> < a"
haftmann@51487
  1233
  by (fact top.extremum_strict)
haftmann@43816
  1234
haftmann@43814
  1235
lemma less_top:
haftmann@43853
  1236
  "a \<noteq> \<top> \<longleftrightarrow> a < \<top>"
haftmann@51487
  1237
  by (fact top.not_eq_extremum)
haftmann@43814
  1238
haftmann@43814
  1239
end
haftmann@28685
  1240
haftmann@28685
  1241
wenzelm@60758
  1242
subsection \<open>Dense orders\<close>
haftmann@27823
  1243
hoelzl@53216
  1244
class dense_order = order +
hoelzl@51329
  1245
  assumes dense: "x < y \<Longrightarrow> (\<exists>z. x < z \<and> z < y)"
hoelzl@51329
  1246
hoelzl@53216
  1247
class dense_linorder = linorder + dense_order
hoelzl@35579
  1248
begin
haftmann@27823
  1249
hoelzl@35579
  1250
lemma dense_le:
hoelzl@35579
  1251
  fixes y z :: 'a
hoelzl@35579
  1252
  assumes "\<And>x. x < y \<Longrightarrow> x \<le> z"
hoelzl@35579
  1253
  shows "y \<le> z"
hoelzl@35579
  1254
proof (rule ccontr)
hoelzl@35579
  1255
  assume "\<not> ?thesis"
hoelzl@35579
  1256
  hence "z < y" by simp
hoelzl@35579
  1257
  from dense[OF this]
hoelzl@35579
  1258
  obtain x where "x < y" and "z < x" by safe
wenzelm@60758
  1259
  moreover have "x \<le> z" using assms[OF \<open>x < y\<close>] .
hoelzl@35579
  1260
  ultimately show False by auto
hoelzl@35579
  1261
qed
hoelzl@35579
  1262
hoelzl@35579
  1263
lemma dense_le_bounded:
hoelzl@35579
  1264
  fixes x y z :: 'a
hoelzl@35579
  1265
  assumes "x < y"
hoelzl@35579
  1266
  assumes *: "\<And>w. \<lbrakk> x < w ; w < y \<rbrakk> \<Longrightarrow> w \<le> z"
hoelzl@35579
  1267
  shows "y \<le> z"
hoelzl@35579
  1268
proof (rule dense_le)
hoelzl@35579
  1269
  fix w assume "w < y"
wenzelm@60758
  1270
  from dense[OF \<open>x < y\<close>] obtain u where "x < u" "u < y" by safe
hoelzl@35579
  1271
  from linear[of u w]
hoelzl@35579
  1272
  show "w \<le> z"
hoelzl@35579
  1273
  proof (rule disjE)
hoelzl@35579
  1274
    assume "u \<le> w"
wenzelm@60758
  1275
    from less_le_trans[OF \<open>x < u\<close> \<open>u \<le> w\<close>] \<open>w < y\<close>
hoelzl@35579
  1276
    show "w \<le> z" by (rule *)
hoelzl@35579
  1277
  next
hoelzl@35579
  1278
    assume "w \<le> u"
wenzelm@60758
  1279
    from \<open>w \<le> u\<close> *[OF \<open>x < u\<close> \<open>u < y\<close>]
hoelzl@35579
  1280
    show "w \<le> z" by (rule order_trans)
hoelzl@35579
  1281
  qed
hoelzl@35579
  1282
qed
hoelzl@35579
  1283
hoelzl@51329
  1284
lemma dense_ge:
hoelzl@51329
  1285
  fixes y z :: 'a
hoelzl@51329
  1286
  assumes "\<And>x. z < x \<Longrightarrow> y \<le> x"
hoelzl@51329
  1287
  shows "y \<le> z"
hoelzl@51329
  1288
proof (rule ccontr)
hoelzl@51329
  1289
  assume "\<not> ?thesis"
hoelzl@51329
  1290
  hence "z < y" by simp
hoelzl@51329
  1291
  from dense[OF this]
hoelzl@51329
  1292
  obtain x where "x < y" and "z < x" by safe
wenzelm@60758
  1293
  moreover have "y \<le> x" using assms[OF \<open>z < x\<close>] .
hoelzl@51329
  1294
  ultimately show False by auto
hoelzl@51329
  1295
qed
hoelzl@51329
  1296
hoelzl@51329
  1297
lemma dense_ge_bounded:
hoelzl@51329
  1298
  fixes x y z :: 'a
hoelzl@51329
  1299
  assumes "z < x"
hoelzl@51329
  1300
  assumes *: "\<And>w. \<lbrakk> z < w ; w < x \<rbrakk> \<Longrightarrow> y \<le> w"
hoelzl@51329
  1301
  shows "y \<le> z"
hoelzl@51329
  1302
proof (rule dense_ge)
hoelzl@51329
  1303
  fix w assume "z < w"
wenzelm@60758
  1304
  from dense[OF \<open>z < x\<close>] obtain u where "z < u" "u < x" by safe
hoelzl@51329
  1305
  from linear[of u w]
hoelzl@51329
  1306
  show "y \<le> w"
hoelzl@51329
  1307
  proof (rule disjE)
hoelzl@51329
  1308
    assume "w \<le> u"
wenzelm@60758
  1309
    from \<open>z < w\<close> le_less_trans[OF \<open>w \<le> u\<close> \<open>u < x\<close>]
hoelzl@51329
  1310
    show "y \<le> w" by (rule *)
hoelzl@51329
  1311
  next
hoelzl@51329
  1312
    assume "u \<le> w"
wenzelm@60758
  1313
    from *[OF \<open>z < u\<close> \<open>u < x\<close>] \<open>u \<le> w\<close>
hoelzl@51329
  1314
    show "y \<le> w" by (rule order_trans)
hoelzl@51329
  1315
  qed
hoelzl@51329
  1316
qed
hoelzl@51329
  1317
hoelzl@35579
  1318
end
haftmann@27823
  1319
hoelzl@51329
  1320
class no_top = order + 
hoelzl@51329
  1321
  assumes gt_ex: "\<exists>y. x < y"
hoelzl@51329
  1322
hoelzl@51329
  1323
class no_bot = order + 
hoelzl@51329
  1324
  assumes lt_ex: "\<exists>y. y < x"
hoelzl@51329
  1325
hoelzl@53216
  1326
class unbounded_dense_linorder = dense_linorder + no_top + no_bot
hoelzl@51329
  1327
haftmann@51546
  1328
wenzelm@60758
  1329
subsection \<open>Wellorders\<close>
haftmann@27823
  1330
haftmann@27823
  1331
class wellorder = linorder +
haftmann@27823
  1332
  assumes less_induct [case_names less]: "(\<And>x. (\<And>y. y < x \<Longrightarrow> P y) \<Longrightarrow> P x) \<Longrightarrow> P a"
haftmann@27823
  1333
begin
haftmann@27823
  1334
haftmann@27823
  1335
lemma wellorder_Least_lemma:
haftmann@27823
  1336
  fixes k :: 'a
haftmann@27823
  1337
  assumes "P k"
haftmann@34250
  1338
  shows LeastI: "P (LEAST x. P x)" and Least_le: "(LEAST x. P x) \<le> k"
haftmann@27823
  1339
proof -
haftmann@27823
  1340
  have "P (LEAST x. P x) \<and> (LEAST x. P x) \<le> k"
haftmann@27823
  1341
  using assms proof (induct k rule: less_induct)
haftmann@27823
  1342
    case (less x) then have "P x" by simp
haftmann@27823
  1343
    show ?case proof (rule classical)
haftmann@27823
  1344
      assume assm: "\<not> (P (LEAST a. P a) \<and> (LEAST a. P a) \<le> x)"
haftmann@27823
  1345
      have "\<And>y. P y \<Longrightarrow> x \<le> y"
haftmann@27823
  1346
      proof (rule classical)
haftmann@27823
  1347
        fix y
hoelzl@38705
  1348
        assume "P y" and "\<not> x \<le> y"
haftmann@27823
  1349
        with less have "P (LEAST a. P a)" and "(LEAST a. P a) \<le> y"
haftmann@27823
  1350
          by (auto simp add: not_le)
haftmann@27823
  1351
        with assm have "x < (LEAST a. P a)" and "(LEAST a. P a) \<le> y"
haftmann@27823
  1352
          by auto
haftmann@27823
  1353
        then show "x \<le> y" by auto
haftmann@27823
  1354
      qed
wenzelm@60758
  1355
      with \<open>P x\<close> have Least: "(LEAST a. P a) = x"
haftmann@27823
  1356
        by (rule Least_equality)
wenzelm@60758
  1357
      with \<open>P x\<close> show ?thesis by simp
haftmann@27823
  1358
    qed
haftmann@27823
  1359
  qed
haftmann@27823
  1360
  then show "P (LEAST x. P x)" and "(LEAST x. P x) \<le> k" by auto
haftmann@27823
  1361
qed
haftmann@27823
  1362
wenzelm@61799
  1363
\<comment> "The following 3 lemmas are due to Brian Huffman"
haftmann@27823
  1364
lemma LeastI_ex: "\<exists>x. P x \<Longrightarrow> P (Least P)"
haftmann@27823
  1365
  by (erule exE) (erule LeastI)
haftmann@27823
  1366
haftmann@27823
  1367
lemma LeastI2:
haftmann@27823
  1368
  "P a \<Longrightarrow> (\<And>x. P x \<Longrightarrow> Q x) \<Longrightarrow> Q (Least P)"
haftmann@27823
  1369
  by (blast intro: LeastI)
haftmann@27823
  1370
haftmann@27823
  1371
lemma LeastI2_ex:
haftmann@27823
  1372
  "\<exists>a. P a \<Longrightarrow> (\<And>x. P x \<Longrightarrow> Q x) \<Longrightarrow> Q (Least P)"
haftmann@27823
  1373
  by (blast intro: LeastI_ex)
haftmann@27823
  1374
hoelzl@38705
  1375
lemma LeastI2_wellorder:
hoelzl@38705
  1376
  assumes "P a"
hoelzl@38705
  1377
  and "\<And>a. \<lbrakk> P a; \<forall>b. P b \<longrightarrow> a \<le> b \<rbrakk> \<Longrightarrow> Q a"
hoelzl@38705
  1378
  shows "Q (Least P)"
hoelzl@38705
  1379
proof (rule LeastI2_order)
wenzelm@60758
  1380
  show "P (Least P)" using \<open>P a\<close> by (rule LeastI)
hoelzl@38705
  1381
next
hoelzl@38705
  1382
  fix y assume "P y" thus "Least P \<le> y" by (rule Least_le)
hoelzl@38705
  1383
next
hoelzl@38705
  1384
  fix x assume "P x" "\<forall>y. P y \<longrightarrow> x \<le> y" thus "Q x" by (rule assms(2))
hoelzl@38705
  1385
qed
hoelzl@38705
  1386
lp15@61699
  1387
lemma LeastI2_wellorder_ex:
lp15@61699
  1388
  assumes "\<exists>x. P x"
lp15@61699
  1389
  and "\<And>a. \<lbrakk> P a; \<forall>b. P b \<longrightarrow> a \<le> b \<rbrakk> \<Longrightarrow> Q a"
lp15@61699
  1390
  shows "Q (Least P)"
lp15@61699
  1391
using assms by clarify (blast intro!: LeastI2_wellorder)
lp15@61699
  1392
haftmann@27823
  1393
lemma not_less_Least: "k < (LEAST x. P x) \<Longrightarrow> \<not> P k"
lp15@61699
  1394
apply (simp add: not_le [symmetric])
haftmann@27823
  1395
apply (erule contrapos_nn)
haftmann@27823
  1396
apply (erule Least_le)
haftmann@27823
  1397
done
haftmann@27823
  1398
hoelzl@38705
  1399
end
haftmann@27823
  1400
haftmann@28685
  1401
wenzelm@60758
  1402
subsection \<open>Order on @{typ bool}\<close>
haftmann@28685
  1403
haftmann@52729
  1404
instantiation bool :: "{order_bot, order_top, linorder}"
haftmann@28685
  1405
begin
haftmann@28685
  1406
haftmann@28685
  1407
definition
haftmann@41080
  1408
  le_bool_def [simp]: "P \<le> Q \<longleftrightarrow> P \<longrightarrow> Q"
haftmann@28685
  1409
haftmann@28685
  1410
definition
wenzelm@61076
  1411
  [simp]: "(P::bool) < Q \<longleftrightarrow> \<not> P \<and> Q"
haftmann@28685
  1412
haftmann@28685
  1413
definition
haftmann@46631
  1414
  [simp]: "\<bottom> \<longleftrightarrow> False"
haftmann@28685
  1415
haftmann@28685
  1416
definition
haftmann@46631
  1417
  [simp]: "\<top> \<longleftrightarrow> True"
haftmann@28685
  1418
haftmann@28685
  1419
instance proof
haftmann@41080
  1420
qed auto
haftmann@28685
  1421
nipkow@15524
  1422
end
haftmann@28685
  1423
haftmann@28685
  1424
lemma le_boolI: "(P \<Longrightarrow> Q) \<Longrightarrow> P \<le> Q"
haftmann@41080
  1425
  by simp
haftmann@28685
  1426
haftmann@28685
  1427
lemma le_boolI': "P \<longrightarrow> Q \<Longrightarrow> P \<le> Q"
haftmann@41080
  1428
  by simp
haftmann@28685
  1429
haftmann@28685
  1430
lemma le_boolE: "P \<le> Q \<Longrightarrow> P \<Longrightarrow> (Q \<Longrightarrow> R) \<Longrightarrow> R"
haftmann@41080
  1431
  by simp
haftmann@28685
  1432
haftmann@28685
  1433
lemma le_boolD: "P \<le> Q \<Longrightarrow> P \<longrightarrow> Q"
haftmann@41080
  1434
  by simp
haftmann@32899
  1435
haftmann@46631
  1436
lemma bot_boolE: "\<bottom> \<Longrightarrow> P"
haftmann@41080
  1437
  by simp
haftmann@32899
  1438
haftmann@46631
  1439
lemma top_boolI: \<top>
haftmann@41080
  1440
  by simp
haftmann@28685
  1441
haftmann@28685
  1442
lemma [code]:
haftmann@28685
  1443
  "False \<le> b \<longleftrightarrow> True"
haftmann@28685
  1444
  "True \<le> b \<longleftrightarrow> b"
haftmann@28685
  1445
  "False < b \<longleftrightarrow> b"
haftmann@28685
  1446
  "True < b \<longleftrightarrow> False"
haftmann@41080
  1447
  by simp_all
haftmann@28685
  1448
haftmann@28685
  1449
wenzelm@60758
  1450
subsection \<open>Order on @{typ "_ \<Rightarrow> _"}\<close>
haftmann@28685
  1451
haftmann@28685
  1452
instantiation "fun" :: (type, ord) ord
haftmann@28685
  1453
begin
haftmann@28685
  1454
haftmann@28685
  1455
definition
haftmann@37767
  1456
  le_fun_def: "f \<le> g \<longleftrightarrow> (\<forall>x. f x \<le> g x)"
haftmann@28685
  1457
haftmann@28685
  1458
definition
wenzelm@61076
  1459
  "(f::'a \<Rightarrow> 'b) < g \<longleftrightarrow> f \<le> g \<and> \<not> (g \<le> f)"
haftmann@28685
  1460
haftmann@28685
  1461
instance ..
haftmann@28685
  1462
haftmann@28685
  1463
end
haftmann@28685
  1464
haftmann@28685
  1465
instance "fun" :: (type, preorder) preorder proof
haftmann@28685
  1466
qed (auto simp add: le_fun_def less_fun_def
huffman@44921
  1467
  intro: order_trans antisym)
haftmann@28685
  1468
haftmann@28685
  1469
instance "fun" :: (type, order) order proof
huffman@44921
  1470
qed (auto simp add: le_fun_def intro: antisym)
haftmann@28685
  1471
haftmann@41082
  1472
instantiation "fun" :: (type, bot) bot
haftmann@41082
  1473
begin
haftmann@41082
  1474
haftmann@41082
  1475
definition
haftmann@46631
  1476
  "\<bottom> = (\<lambda>x. \<bottom>)"
haftmann@41082
  1477
haftmann@52729
  1478
instance ..
haftmann@52729
  1479
haftmann@52729
  1480
end
haftmann@52729
  1481
haftmann@52729
  1482
instantiation "fun" :: (type, order_bot) order_bot
haftmann@52729
  1483
begin
haftmann@52729
  1484
haftmann@49769
  1485
lemma bot_apply [simp, code]:
haftmann@46631
  1486
  "\<bottom> x = \<bottom>"
haftmann@41082
  1487
  by (simp add: bot_fun_def)
haftmann@41082
  1488
haftmann@41082
  1489
instance proof
noschinl@46884
  1490
qed (simp add: le_fun_def)
haftmann@41082
  1491
haftmann@41082
  1492
end
haftmann@41082
  1493
haftmann@28685
  1494
instantiation "fun" :: (type, top) top
haftmann@28685
  1495
begin
haftmann@28685
  1496
haftmann@28685
  1497
definition
haftmann@46631
  1498
  [no_atp]: "\<top> = (\<lambda>x. \<top>)"
haftmann@28685
  1499
haftmann@52729
  1500
instance ..
haftmann@52729
  1501
haftmann@52729
  1502
end
haftmann@52729
  1503
haftmann@52729
  1504
instantiation "fun" :: (type, order_top) order_top
haftmann@52729
  1505
begin
haftmann@52729
  1506
haftmann@49769
  1507
lemma top_apply [simp, code]:
haftmann@46631
  1508
  "\<top> x = \<top>"
haftmann@41080
  1509
  by (simp add: top_fun_def)
haftmann@41080
  1510
haftmann@28685
  1511
instance proof
noschinl@46884
  1512
qed (simp add: le_fun_def)
haftmann@28685
  1513
haftmann@28685
  1514
end
haftmann@28685
  1515
haftmann@28685
  1516
lemma le_funI: "(\<And>x. f x \<le> g x) \<Longrightarrow> f \<le> g"
haftmann@28685
  1517
  unfolding le_fun_def by simp
haftmann@28685
  1518
haftmann@28685
  1519
lemma le_funE: "f \<le> g \<Longrightarrow> (f x \<le> g x \<Longrightarrow> P) \<Longrightarrow> P"
haftmann@28685
  1520
  unfolding le_fun_def by simp
haftmann@28685
  1521
haftmann@28685
  1522
lemma le_funD: "f \<le> g \<Longrightarrow> f x \<le> g x"
haftmann@54860
  1523
  by (rule le_funE)
haftmann@28685
  1524
hoelzl@59000
  1525
lemma mono_compose: "mono Q \<Longrightarrow> mono (\<lambda>i x. Q i (f x))"
hoelzl@59000
  1526
  unfolding mono_def le_fun_def by auto
hoelzl@59000
  1527
haftmann@34250
  1528
wenzelm@60758
  1529
subsection \<open>Order on unary and binary predicates\<close>
haftmann@46631
  1530
haftmann@46631
  1531
lemma predicate1I:
haftmann@46631
  1532
  assumes PQ: "\<And>x. P x \<Longrightarrow> Q x"
haftmann@46631
  1533
  shows "P \<le> Q"
haftmann@46631
  1534
  apply (rule le_funI)
haftmann@46631
  1535
  apply (rule le_boolI)
haftmann@46631
  1536
  apply (rule PQ)
haftmann@46631
  1537
  apply assumption
haftmann@46631
  1538
  done
haftmann@46631
  1539
haftmann@46631
  1540
lemma predicate1D:
haftmann@46631
  1541
  "P \<le> Q \<Longrightarrow> P x \<Longrightarrow> Q x"
haftmann@46631
  1542
  apply (erule le_funE)
haftmann@46631
  1543
  apply (erule le_boolE)
haftmann@46631
  1544
  apply assumption+
haftmann@46631
  1545
  done
haftmann@46631
  1546
haftmann@46631
  1547
lemma rev_predicate1D:
haftmann@46631
  1548
  "P x \<Longrightarrow> P \<le> Q \<Longrightarrow> Q x"
haftmann@46631
  1549
  by (rule predicate1D)
haftmann@46631
  1550
haftmann@46631
  1551
lemma predicate2I:
haftmann@46631
  1552
  assumes PQ: "\<And>x y. P x y \<Longrightarrow> Q x y"
haftmann@46631
  1553
  shows "P \<le> Q"
haftmann@46631
  1554
  apply (rule le_funI)+
haftmann@46631
  1555
  apply (rule le_boolI)
haftmann@46631
  1556
  apply (rule PQ)
haftmann@46631
  1557
  apply assumption
haftmann@46631
  1558
  done
haftmann@46631
  1559
haftmann@46631
  1560
lemma predicate2D:
haftmann@46631
  1561
  "P \<le> Q \<Longrightarrow> P x y \<Longrightarrow> Q x y"
haftmann@46631
  1562
  apply (erule le_funE)+
haftmann@46631
  1563
  apply (erule le_boolE)
haftmann@46631
  1564
  apply assumption+
haftmann@46631
  1565
  done
haftmann@46631
  1566
haftmann@46631
  1567
lemma rev_predicate2D:
haftmann@46631
  1568
  "P x y \<Longrightarrow> P \<le> Q \<Longrightarrow> Q x y"
haftmann@46631
  1569
  by (rule predicate2D)
haftmann@46631
  1570
haftmann@46631
  1571
lemma bot1E [no_atp]: "\<bottom> x \<Longrightarrow> P"
haftmann@46631
  1572
  by (simp add: bot_fun_def)
haftmann@46631
  1573
haftmann@46631
  1574
lemma bot2E: "\<bottom> x y \<Longrightarrow> P"
haftmann@46631
  1575
  by (simp add: bot_fun_def)
haftmann@46631
  1576
haftmann@46631
  1577
lemma top1I: "\<top> x"
haftmann@46631
  1578
  by (simp add: top_fun_def)
haftmann@46631
  1579
haftmann@46631
  1580
lemma top2I: "\<top> x y"
haftmann@46631
  1581
  by (simp add: top_fun_def)
haftmann@46631
  1582
haftmann@46631
  1583
wenzelm@60758
  1584
subsection \<open>Name duplicates\<close>
haftmann@34250
  1585
haftmann@34250
  1586
lemmas order_eq_refl = preorder_class.eq_refl
haftmann@34250
  1587
lemmas order_less_irrefl = preorder_class.less_irrefl
haftmann@34250
  1588
lemmas order_less_imp_le = preorder_class.less_imp_le
haftmann@34250
  1589
lemmas order_less_not_sym = preorder_class.less_not_sym
haftmann@34250
  1590
lemmas order_less_asym = preorder_class.less_asym
haftmann@34250
  1591
lemmas order_less_trans = preorder_class.less_trans
haftmann@34250
  1592
lemmas order_le_less_trans = preorder_class.le_less_trans
haftmann@34250
  1593
lemmas order_less_le_trans = preorder_class.less_le_trans
haftmann@34250
  1594
lemmas order_less_imp_not_less = preorder_class.less_imp_not_less
haftmann@34250
  1595
lemmas order_less_imp_triv = preorder_class.less_imp_triv
haftmann@34250
  1596
lemmas order_less_asym' = preorder_class.less_asym'
haftmann@34250
  1597
haftmann@34250
  1598
lemmas order_less_le = order_class.less_le
haftmann@34250
  1599
lemmas order_le_less = order_class.le_less
haftmann@34250
  1600
lemmas order_le_imp_less_or_eq = order_class.le_imp_less_or_eq
haftmann@34250
  1601
lemmas order_less_imp_not_eq = order_class.less_imp_not_eq
haftmann@34250
  1602
lemmas order_less_imp_not_eq2 = order_class.less_imp_not_eq2
haftmann@34250
  1603
lemmas order_neq_le_trans = order_class.neq_le_trans
haftmann@34250
  1604
lemmas order_le_neq_trans = order_class.le_neq_trans
haftmann@34250
  1605
lemmas order_antisym = order_class.antisym
haftmann@34250
  1606
lemmas order_eq_iff = order_class.eq_iff
haftmann@34250
  1607
lemmas order_antisym_conv = order_class.antisym_conv
haftmann@34250
  1608
haftmann@34250
  1609
lemmas linorder_linear = linorder_class.linear
haftmann@34250
  1610
lemmas linorder_less_linear = linorder_class.less_linear
haftmann@34250
  1611
lemmas linorder_le_less_linear = linorder_class.le_less_linear
haftmann@34250
  1612
lemmas linorder_le_cases = linorder_class.le_cases
haftmann@34250
  1613
lemmas linorder_not_less = linorder_class.not_less
haftmann@34250
  1614
lemmas linorder_not_le = linorder_class.not_le
haftmann@34250
  1615
lemmas linorder_neq_iff = linorder_class.neq_iff
haftmann@34250
  1616
lemmas linorder_neqE = linorder_class.neqE
haftmann@34250
  1617
lemmas linorder_antisym_conv1 = linorder_class.antisym_conv1
haftmann@34250
  1618
lemmas linorder_antisym_conv2 = linorder_class.antisym_conv2
haftmann@34250
  1619
lemmas linorder_antisym_conv3 = linorder_class.antisym_conv3
haftmann@34250
  1620
haftmann@28685
  1621
end