src/HOL/Orderings.thy
author haftmann
Fri, 06 Mar 2009 14:33:19 +0100
changeset 30298 abefe1dfadbb
parent 30107 f3b3b0e3d184
child 30510 4120fc59dd85
permissions -rw-r--r--
added strict_mono predicate
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
28685
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
     1
(*  Title:      HOL/Orderings.thy
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
     2
    Author:     Tobias Nipkow, Markus Wenzel, and Larry Paulson
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
     3
*)
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
     4
25614
0b8baa94b866 clarified heading
haftmann
parents: 25510
diff changeset
     5
header {* Abstract orderings *}
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
     6
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
     7
theory Orderings
26796
c554b77061e5 - Now imports Code_Setup, rather than Set and Fun, since the theorems
berghofe
parents: 26496
diff changeset
     8
imports Code_Setup
28516
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
     9
uses "~~/src/Provers/order.ML"
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
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    12
subsection {* Quasi orders *}
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    13
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    14
class preorder = ord +
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    15
  assumes less_le_not_le: "x < y \<longleftrightarrow> x \<le> y \<and> \<not> (y \<le> x)"
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
    16
  and order_refl [iff]: "x \<le> x"
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
    17
  and order_trans: "x \<le> y \<Longrightarrow> y \<le> z \<Longrightarrow> x \<le> z"
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
    18
begin
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
    19
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    20
text {* Reflexivity. *}
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    21
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
    22
lemma eq_refl: "x = y \<Longrightarrow> x \<le> y"
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    23
    -- {* This form is useful with the classical reasoner. *}
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
    24
by (erule ssubst) (rule order_refl)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    25
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
    26
lemma less_irrefl [iff]: "\<not> x < x"
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    27
by (simp add: less_le_not_le)
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    28
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    29
lemma less_imp_le: "x < y \<Longrightarrow> x \<le> y"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    30
unfolding less_le_not_le by blast
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    31
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    32
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    33
text {* Asymmetry. *}
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    34
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    35
lemma less_not_sym: "x < y \<Longrightarrow> \<not> (y < x)"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    36
by (simp add: less_le_not_le)
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    37
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    38
lemma less_asym: "x < y \<Longrightarrow> (\<not> P \<Longrightarrow> y < x) \<Longrightarrow> P"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    39
by (drule less_not_sym, erule contrapos_np) simp
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    40
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    41
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    42
text {* Transitivity. *}
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    43
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    44
lemma less_trans: "x < y \<Longrightarrow> y < z \<Longrightarrow> x < z"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    45
by (auto simp add: less_le_not_le intro: order_trans) 
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    46
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    47
lemma le_less_trans: "x \<le> y \<Longrightarrow> y < z \<Longrightarrow> x < z"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    48
by (auto simp add: less_le_not_le intro: order_trans) 
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    49
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    50
lemma less_le_trans: "x < y \<Longrightarrow> y \<le> z \<Longrightarrow> x < z"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    51
by (auto simp add: less_le_not_le intro: order_trans) 
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    52
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    53
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    54
text {* Useful for simplification, but too risky to include by default. *}
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    55
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    56
lemma less_imp_not_less: "x < y \<Longrightarrow> (\<not> y < x) \<longleftrightarrow> True"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    57
by (blast elim: less_asym)
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    58
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    59
lemma less_imp_triv: "x < y \<Longrightarrow> (y < x \<longrightarrow> P) \<longleftrightarrow> True"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    60
by (blast elim: less_asym)
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    61
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    62
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    63
text {* Transitivity rules for calculational reasoning *}
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    64
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    65
lemma less_asym': "a < b \<Longrightarrow> b < a \<Longrightarrow> P"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    66
by (rule less_asym)
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    67
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    68
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    69
text {* Dual order *}
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    70
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    71
lemma dual_preorder:
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    72
  "preorder (op \<ge>) (op >)"
28823
dcbef866c9e2 tuned unfold_locales invocation
haftmann
parents: 28685
diff changeset
    73
proof qed (auto simp add: less_le_not_le intro: order_trans)
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    74
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    75
end
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    76
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    77
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    78
subsection {* Partial orders *}
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    79
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    80
class order = preorder +
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    81
  assumes antisym: "x \<le> y \<Longrightarrow> y \<le> x \<Longrightarrow> x = y"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    82
begin
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    83
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    84
text {* Reflexivity. *}
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    85
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    86
lemma less_le: "x < y \<longleftrightarrow> x \<le> y \<and> x \<noteq> y"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    87
by (auto simp add: less_le_not_le intro: antisym)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    88
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
    89
lemma le_less: "x \<le> y \<longleftrightarrow> x < y \<or> x = y"
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    90
    -- {* NOT suitable for iff, since it can cause PROOF FAILED. *}
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
    91
by (simp add: less_le) blast
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    92
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
    93
lemma le_imp_less_or_eq: "x \<le> y \<Longrightarrow> x < y \<or> x = y"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
    94
unfolding less_le by blast
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    95
21329
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
    96
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
    97
text {* Useful for simplification, but too risky to include by default. *}
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
    98
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
    99
lemma less_imp_not_eq: "x < y \<Longrightarrow> (x = y) \<longleftrightarrow> False"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   100
by auto
21329
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   101
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   102
lemma less_imp_not_eq2: "x < y \<Longrightarrow> (y = x) \<longleftrightarrow> False"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   103
by auto
21329
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   104
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   105
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   106
text {* Transitivity rules for calculational reasoning *}
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   107
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   108
lemma neq_le_trans: "a \<noteq> b \<Longrightarrow> a \<le> b \<Longrightarrow> a < b"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   109
by (simp add: less_le)
21329
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   110
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   111
lemma le_neq_trans: "a \<le> b \<Longrightarrow> a \<noteq> b \<Longrightarrow> a < b"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   112
by (simp add: less_le)
21329
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   113
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   114
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   115
text {* Asymmetry. *}
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   116
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   117
lemma eq_iff: "x = y \<longleftrightarrow> x \<le> y \<and> y \<le> x"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   118
by (blast intro: antisym)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   119
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   120
lemma antisym_conv: "y \<le> x \<Longrightarrow> x \<le> y \<longleftrightarrow> x = y"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   121
by (blast intro: antisym)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   122
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   123
lemma less_imp_neq: "x < y \<Longrightarrow> x \<noteq> y"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   124
by (erule contrapos_pn, erule subst, rule less_irrefl)
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   125
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   126
27107
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   127
text {* Least value operator *}
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   128
27299
3447cd2e18e8 streamlined definitions
haftmann
parents: 27107
diff changeset
   129
definition (in ord)
27107
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   130
  Least :: "('a \<Rightarrow> bool) \<Rightarrow> 'a" (binder "LEAST " 10) where
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   131
  "Least P = (THE x. P x \<and> (\<forall>y. P y \<longrightarrow> x \<le> y))"
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   132
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   133
lemma Least_equality:
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   134
  assumes "P x"
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   135
    and "\<And>y. P y \<Longrightarrow> x \<le> y"
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   136
  shows "Least P = x"
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   137
unfolding Least_def by (rule the_equality)
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   138
  (blast intro: assms antisym)+
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   139
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   140
lemma LeastI2_order:
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   141
  assumes "P x"
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   142
    and "\<And>y. P y \<Longrightarrow> x \<le> y"
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   143
    and "\<And>x. P x \<Longrightarrow> \<forall>y. P y \<longrightarrow> x \<le> y \<Longrightarrow> Q x"
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   144
  shows "Q (Least P)"
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   145
unfolding Least_def by (rule theI2)
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   146
  (blast intro: assms antisym)+
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   147
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   148
26014
00c2c3525bef dual orders and dual lattices
haftmann
parents: 25614
diff changeset
   149
text {* Dual order *}
22916
haftmann
parents: 22886
diff changeset
   150
26014
00c2c3525bef dual orders and dual lattices
haftmann
parents: 25614
diff changeset
   151
lemma dual_order:
25103
haftmann
parents: 25076
diff changeset
   152
  "order (op \<ge>) (op >)"
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   153
by (intro_locales, rule dual_preorder) (unfold_locales, rule antisym)
22916
haftmann
parents: 22886
diff changeset
   154
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   155
end
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   156
21329
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   157
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   158
subsection {* Linear (total) orders *}
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   159
22316
f662831459de added class "preorder"
haftmann
parents: 22295
diff changeset
   160
class linorder = order +
25207
d58c14280367 dropped square syntax
haftmann
parents: 25193
diff changeset
   161
  assumes linear: "x \<le> y \<or> y \<le> x"
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   162
begin
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   163
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   164
lemma less_linear: "x < y \<or> x = y \<or> y < x"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   165
unfolding less_le using less_le linear by blast
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   166
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   167
lemma le_less_linear: "x \<le> y \<or> y < x"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   168
by (simp add: le_less less_linear)
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   169
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   170
lemma le_cases [case_names le ge]:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   171
  "(x \<le> y \<Longrightarrow> P) \<Longrightarrow> (y \<le> x \<Longrightarrow> P) \<Longrightarrow> P"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   172
using linear by blast
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   173
22384
33a46e6c7f04 prefix of class interpretation not mandatory any longer
haftmann
parents: 22377
diff changeset
   174
lemma linorder_cases [case_names less equal greater]:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   175
  "(x < y \<Longrightarrow> P) \<Longrightarrow> (x = y \<Longrightarrow> P) \<Longrightarrow> (y < x \<Longrightarrow> P) \<Longrightarrow> P"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   176
using less_linear by blast
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   177
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   178
lemma not_less: "\<not> x < y \<longleftrightarrow> y \<le> x"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   179
apply (simp add: less_le)
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   180
using linear apply (blast intro: antisym)
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   181
done
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   182
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   183
lemma not_less_iff_gr_or_eq:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   184
 "\<not>(x < y) \<longleftrightarrow> (x > y | x = y)"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   185
apply(simp add:not_less le_less)
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   186
apply blast
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   187
done
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   188
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   189
lemma not_le: "\<not> x \<le> y \<longleftrightarrow> y < x"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   190
apply (simp add: less_le)
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   191
using linear apply (blast intro: antisym)
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   192
done
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   193
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   194
lemma neq_iff: "x \<noteq> y \<longleftrightarrow> x < y \<or> y < x"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   195
by (cut_tac x = x and y = y in less_linear, auto)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   196
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   197
lemma neqE: "x \<noteq> y \<Longrightarrow> (x < y \<Longrightarrow> R) \<Longrightarrow> (y < x \<Longrightarrow> R) \<Longrightarrow> R"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   198
by (simp add: neq_iff) blast
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   199
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   200
lemma antisym_conv1: "\<not> x < y \<Longrightarrow> x \<le> y \<longleftrightarrow> x = y"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   201
by (blast intro: antisym dest: not_less [THEN iffD1])
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   202
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   203
lemma antisym_conv2: "x \<le> y \<Longrightarrow> \<not> x < y \<longleftrightarrow> x = y"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   204
by (blast intro: antisym dest: not_less [THEN iffD1])
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   205
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   206
lemma antisym_conv3: "\<not> y < x \<Longrightarrow> \<not> x < y \<longleftrightarrow> x = y"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   207
by (blast intro: antisym dest: not_less [THEN iffD1])
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   208
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   209
lemma leI: "\<not> x < y \<Longrightarrow> y \<le> x"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   210
unfolding not_less .
16796
140f1e0ea846 generlization of some "nat" theorems
paulson
parents: 16743
diff changeset
   211
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   212
lemma leD: "y \<le> x \<Longrightarrow> \<not> x < y"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   213
unfolding not_less .
16796
140f1e0ea846 generlization of some "nat" theorems
paulson
parents: 16743
diff changeset
   214
140f1e0ea846 generlization of some "nat" theorems
paulson
parents: 16743
diff changeset
   215
(*FIXME inappropriate name (or delete altogether)*)
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   216
lemma not_leE: "\<not> y \<le> x \<Longrightarrow> x < y"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   217
unfolding not_le .
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   218
22916
haftmann
parents: 22886
diff changeset
   219
26014
00c2c3525bef dual orders and dual lattices
haftmann
parents: 25614
diff changeset
   220
text {* Dual order *}
22916
haftmann
parents: 22886
diff changeset
   221
26014
00c2c3525bef dual orders and dual lattices
haftmann
parents: 25614
diff changeset
   222
lemma dual_linorder:
25103
haftmann
parents: 25076
diff changeset
   223
  "linorder (op \<ge>) (op >)"
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   224
by (rule linorder.intro, rule dual_order) (unfold_locales, rule linear)
22916
haftmann
parents: 22886
diff changeset
   225
haftmann
parents: 22886
diff changeset
   226
23881
851c74f1bb69 moved class ord from Orderings.thy to HOL.thy
haftmann
parents: 23417
diff changeset
   227
text {* min/max *}
851c74f1bb69 moved class ord from Orderings.thy to HOL.thy
haftmann
parents: 23417
diff changeset
   228
27299
3447cd2e18e8 streamlined definitions
haftmann
parents: 27107
diff changeset
   229
definition (in ord) min :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" where
28516
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   230
  [code del]: "min a b = (if a \<le> b then a else b)"
23881
851c74f1bb69 moved class ord from Orderings.thy to HOL.thy
haftmann
parents: 23417
diff changeset
   231
27299
3447cd2e18e8 streamlined definitions
haftmann
parents: 27107
diff changeset
   232
definition (in ord) max :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" where
28516
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   233
  [code del]: "max a b = (if a \<le> b then b else a)"
22384
33a46e6c7f04 prefix of class interpretation not mandatory any longer
haftmann
parents: 22377
diff changeset
   234
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   235
lemma min_le_iff_disj:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   236
  "min x y \<le> z \<longleftrightarrow> x \<le> z \<or> y \<le> z"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   237
unfolding min_def using linear by (auto intro: order_trans)
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   238
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   239
lemma le_max_iff_disj:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   240
  "z \<le> max x y \<longleftrightarrow> z \<le> x \<or> z \<le> y"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   241
unfolding max_def using linear by (auto intro: order_trans)
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   242
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   243
lemma min_less_iff_disj:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   244
  "min x y < z \<longleftrightarrow> x < z \<or> y < z"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   245
unfolding min_def le_less using less_linear by (auto intro: less_trans)
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   246
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   247
lemma less_max_iff_disj:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   248
  "z < max x y \<longleftrightarrow> z < x \<or> z < y"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   249
unfolding max_def le_less using less_linear by (auto intro: less_trans)
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   250
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   251
lemma min_less_iff_conj [simp]:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   252
  "z < min x y \<longleftrightarrow> z < x \<and> z < y"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   253
unfolding min_def le_less using less_linear by (auto intro: less_trans)
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   254
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   255
lemma max_less_iff_conj [simp]:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   256
  "max x y < z \<longleftrightarrow> x < z \<and> y < z"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   257
unfolding max_def le_less using less_linear by (auto intro: less_trans)
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   258
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 23948
diff changeset
   259
lemma split_min [noatp]:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   260
  "P (min i j) \<longleftrightarrow> (i \<le> j \<longrightarrow> P i) \<and> (\<not> i \<le> j \<longrightarrow> P j)"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   261
by (simp add: min_def)
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   262
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 23948
diff changeset
   263
lemma split_max [noatp]:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   264
  "P (max i j) \<longleftrightarrow> (i \<le> j \<longrightarrow> P j) \<and> (\<not> i \<le> j \<longrightarrow> P i)"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   265
by (simp add: max_def)
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   266
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   267
end
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   268
28516
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   269
text {* Explicit dictionaries for code generation *}
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   270
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   271
lemma min_ord_min [code, code unfold, code inline del]:
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   272
  "min = ord.min (op \<le>)"
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   273
  by (rule ext)+ (simp add: min_def ord.min_def)
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   274
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   275
declare ord.min_def [code]
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   276
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   277
lemma max_ord_max [code, code unfold, code inline del]:
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   278
  "max = ord.max (op \<le>)"
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   279
  by (rule ext)+ (simp add: max_def ord.max_def)
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   280
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   281
declare ord.max_def [code]
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   282
23948
261bd4678076 using class target
haftmann
parents: 23881
diff changeset
   283
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   284
subsection {* Reasoning tools setup *}
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   285
21091
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   286
ML {*
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   287
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   288
signature ORDERS =
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   289
sig
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   290
  val print_structures: Proof.context -> unit
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   291
  val setup: theory -> theory
24704
9a95634ab135 Transitivity reasoner gets additional argument of premises to improve integration with simplifier.
ballarin
parents: 24641
diff changeset
   292
  val order_tac: thm list -> Proof.context -> int -> tactic
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   293
end;
21091
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   294
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   295
structure Orders: ORDERS =
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   296
struct
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   297
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   298
(** Theory and context data **)
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   299
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   300
fun struct_eq ((s1: string, ts1), (s2, ts2)) =
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   301
  (s1 = s2) andalso eq_list (op aconv) (ts1, ts2);
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   302
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   303
structure Data = GenericDataFun
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   304
(
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   305
  type T = ((string * term list) * Order_Tac.less_arith) list;
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   306
    (* Order structures:
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   307
       identifier of the structure, list of operations and record of theorems
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   308
       needed to set up the transitivity reasoner,
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   309
       identifier and operations identify the structure uniquely. *)
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   310
  val empty = [];
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   311
  val extend = I;
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   312
  fun merge _ = AList.join struct_eq (K fst);
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   313
);
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   314
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   315
fun print_structures ctxt =
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   316
  let
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   317
    val structs = Data.get (Context.Proof ctxt);
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   318
    fun pretty_term t = Pretty.block
24920
2a45e400fdad generic Syntax.pretty/string_of operations;
wenzelm
parents: 24867
diff changeset
   319
      [Pretty.quote (Syntax.pretty_term ctxt t), Pretty.brk 1,
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   320
        Pretty.str "::", Pretty.brk 1,
24920
2a45e400fdad generic Syntax.pretty/string_of operations;
wenzelm
parents: 24867
diff changeset
   321
        Pretty.quote (Syntax.pretty_typ ctxt (type_of t))];
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   322
    fun pretty_struct ((s, ts), _) = Pretty.block
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   323
      [Pretty.str s, Pretty.str ":", Pretty.brk 1,
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   324
       Pretty.enclose "(" ")" (Pretty.breaks (map pretty_term ts))];
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   325
  in
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   326
    Pretty.writeln (Pretty.big_list "Order structures:" (map pretty_struct structs))
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   327
  end;
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   328
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   329
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   330
(** Method **)
21091
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   331
24704
9a95634ab135 Transitivity reasoner gets additional argument of premises to improve integration with simplifier.
ballarin
parents: 24641
diff changeset
   332
fun struct_tac ((s, [eq, le, less]), thms) prems =
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   333
  let
30107
f3b3b0e3d184 Fixed nonexhaustive match problem in decomp, to make it fail more gracefully
berghofe
parents: 29823
diff changeset
   334
    fun decomp thy (@{const Trueprop} $ t) =
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   335
      let
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   336
        fun excluded t =
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   337
          (* exclude numeric types: linear arithmetic subsumes transitivity *)
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   338
          let val T = type_of t
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   339
          in
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   340
	    T = HOLogic.natT orelse T = HOLogic.intT orelse T = HOLogic.realT
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   341
          end;
24741
a53f5db5acbb Fixed setup of transitivity reasoner (function decomp).
ballarin
parents: 24704
diff changeset
   342
	fun rel (bin_op $ t1 $ t2) =
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   343
              if excluded t1 then NONE
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   344
              else if Pattern.matches thy (eq, bin_op) then SOME (t1, "=", t2)
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   345
              else if Pattern.matches thy (le, bin_op) then SOME (t1, "<=", t2)
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   346
              else if Pattern.matches thy (less, bin_op) then SOME (t1, "<", t2)
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   347
              else NONE
24741
a53f5db5acbb Fixed setup of transitivity reasoner (function decomp).
ballarin
parents: 24704
diff changeset
   348
	  | rel _ = NONE;
a53f5db5acbb Fixed setup of transitivity reasoner (function decomp).
ballarin
parents: 24704
diff changeset
   349
	fun dec (Const (@{const_name Not}, _) $ t) = (case rel t
a53f5db5acbb Fixed setup of transitivity reasoner (function decomp).
ballarin
parents: 24704
diff changeset
   350
	      of NONE => NONE
a53f5db5acbb Fixed setup of transitivity reasoner (function decomp).
ballarin
parents: 24704
diff changeset
   351
	       | SOME (t1, rel, t2) => SOME (t1, "~" ^ rel, t2))
a53f5db5acbb Fixed setup of transitivity reasoner (function decomp).
ballarin
parents: 24704
diff changeset
   352
          | dec x = rel x;
30107
f3b3b0e3d184 Fixed nonexhaustive match problem in decomp, to make it fail more gracefully
berghofe
parents: 29823
diff changeset
   353
      in dec t end
f3b3b0e3d184 Fixed nonexhaustive match problem in decomp, to make it fail more gracefully
berghofe
parents: 29823
diff changeset
   354
      | decomp thy _ = NONE;
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   355
  in
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   356
    case s of
24704
9a95634ab135 Transitivity reasoner gets additional argument of premises to improve integration with simplifier.
ballarin
parents: 24641
diff changeset
   357
      "order" => Order_Tac.partial_tac decomp thms prems
9a95634ab135 Transitivity reasoner gets additional argument of premises to improve integration with simplifier.
ballarin
parents: 24641
diff changeset
   358
    | "linorder" => Order_Tac.linear_tac decomp thms prems
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   359
    | _ => error ("Unknown kind of order `" ^ s ^ "' encountered in transitivity reasoner.")
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   360
  end
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   361
24704
9a95634ab135 Transitivity reasoner gets additional argument of premises to improve integration with simplifier.
ballarin
parents: 24641
diff changeset
   362
fun order_tac prems ctxt =
9a95634ab135 Transitivity reasoner gets additional argument of premises to improve integration with simplifier.
ballarin
parents: 24641
diff changeset
   363
  FIRST' (map (fn s => CHANGED o struct_tac s prems) (Data.get (Context.Proof ctxt)));
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   364
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   365
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   366
(** Attribute **)
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   367
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   368
fun add_struct_thm s tag =
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   369
  Thm.declaration_attribute
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   370
    (fn thm => Data.map (AList.map_default struct_eq (s, Order_Tac.empty TrueI) (Order_Tac.update tag thm)));
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   371
fun del_struct s =
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   372
  Thm.declaration_attribute
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   373
    (fn _ => Data.map (AList.delete struct_eq s));
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   374
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   375
val attribute = Attrib.syntax
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   376
     (Scan.lift ((Args.add -- Args.name >> (fn (_, s) => SOME s) ||
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   377
          Args.del >> K NONE) --| Args.colon (* FIXME ||
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   378
        Scan.succeed true *) ) -- Scan.lift Args.name --
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   379
      Scan.repeat Args.term
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   380
      >> (fn ((SOME tag, n), ts) => add_struct_thm (n, ts) tag
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   381
           | ((NONE, n), ts) => del_struct (n, ts)));
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   382
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   383
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   384
(** Diagnostic command **)
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   385
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   386
val print = Toplevel.unknown_context o
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   387
  Toplevel.keep (Toplevel.node_case
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   388
    (Context.cases (print_structures o ProofContext.init) print_structures)
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   389
    (print_structures o Proof.context_of));
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   390
24867
e5b55d7be9bb simplified interfaces for outer syntax;
wenzelm
parents: 24748
diff changeset
   391
val _ =
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   392
  OuterSyntax.improper_command "print_orders"
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   393
    "print order structures available to transitivity reasoner" OuterKeyword.diag
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   394
    (Scan.succeed (Toplevel.no_timing o print));
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   395
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   396
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   397
(** Setup **)
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   398
24867
e5b55d7be9bb simplified interfaces for outer syntax;
wenzelm
parents: 24748
diff changeset
   399
val setup =
e5b55d7be9bb simplified interfaces for outer syntax;
wenzelm
parents: 24748
diff changeset
   400
  Method.add_methods
e5b55d7be9bb simplified interfaces for outer syntax;
wenzelm
parents: 24748
diff changeset
   401
    [("order", Method.ctxt_args (Method.SIMPLE_METHOD' o order_tac []), "transitivity reasoner")] #>
e5b55d7be9bb simplified interfaces for outer syntax;
wenzelm
parents: 24748
diff changeset
   402
  Attrib.add_attributes [("order", attribute, "theorems controlling transitivity reasoner")];
21091
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   403
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   404
end;
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   405
21091
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   406
*}
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   407
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   408
setup Orders.setup
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   409
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   410
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   411
text {* Declarations to set up transitivity reasoner of partial and linear orders. *}
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   412
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   413
context order
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   414
begin
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   415
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   416
(* The type constraint on @{term op =} below is necessary since the operation
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   417
   is not a parameter of the locale. *)
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   418
27689
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   419
declare less_irrefl [THEN notE, order add less_reflE: order "op = :: 'a \<Rightarrow> 'a \<Rightarrow> bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   420
  
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   421
declare order_refl  [order add le_refl: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   422
  
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   423
declare less_imp_le [order add less_imp_le: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   424
  
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   425
declare antisym [order add eqI: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   426
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   427
declare eq_refl [order add eqD1: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   428
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   429
declare sym [THEN eq_refl, order add eqD2: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   430
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   431
declare less_trans [order add less_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   432
  
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   433
declare less_le_trans [order add less_le_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   434
  
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   435
declare le_less_trans [order add le_less_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   436
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   437
declare order_trans [order add le_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   438
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   439
declare le_neq_trans [order add le_neq_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   440
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   441
declare neq_le_trans [order add neq_le_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   442
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   443
declare less_imp_neq [order add less_imp_neq: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   444
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   445
declare eq_neq_eq_imp_neq [order add eq_neq_eq_imp_neq: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   446
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   447
declare not_sym [order add not_sym: order "op = :: 'a => 'a => bool" "op <=" "op <"]
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   448
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   449
end
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   450
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   451
context linorder
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   452
begin
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   453
27689
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   454
declare [[order del: order "op = :: 'a => 'a => bool" "op <=" "op <"]]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   455
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   456
declare less_irrefl [THEN notE, order add less_reflE: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   457
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   458
declare order_refl [order add le_refl: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   459
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   460
declare less_imp_le [order add less_imp_le: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   461
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   462
declare not_less [THEN iffD2, order add not_lessI: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   463
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   464
declare not_le [THEN iffD2, order add not_leI: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   465
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   466
declare not_less [THEN iffD1, order add not_lessD: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   467
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   468
declare not_le [THEN iffD1, order add not_leD: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   469
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   470
declare antisym [order add eqI: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   471
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   472
declare eq_refl [order add eqD1: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   473
27689
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   474
declare sym [THEN eq_refl, order add eqD2: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   475
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   476
declare less_trans [order add less_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   477
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   478
declare less_le_trans [order add less_le_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   479
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   480
declare le_less_trans [order add le_less_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   481
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   482
declare order_trans [order add le_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   483
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   484
declare le_neq_trans [order add le_neq_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   485
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   486
declare neq_le_trans [order add neq_le_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   487
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   488
declare less_imp_neq [order add less_imp_neq: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   489
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   490
declare eq_neq_eq_imp_neq [order add eq_neq_eq_imp_neq: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   491
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   492
declare not_sym [order add not_sym: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   493
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   494
end
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   495
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   496
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   497
setup {*
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   498
let
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   499
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   500
fun prp t thm = (#prop (rep_thm thm) = t);
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   501
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   502
fun prove_antisym_le sg ss ((le as Const(_,T)) $ r $ s) =
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   503
  let val prems = prems_of_ss ss;
22916
haftmann
parents: 22886
diff changeset
   504
      val less = Const (@{const_name less}, T);
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   505
      val t = HOLogic.mk_Trueprop(le $ s $ r);
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   506
  in case find_first (prp t) prems of
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   507
       NONE =>
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   508
         let val t = HOLogic.mk_Trueprop(HOLogic.Not $ (less $ r $ s))
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   509
         in case find_first (prp t) prems of
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   510
              NONE => NONE
24422
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   511
            | SOME thm => SOME(mk_meta_eq(thm RS @{thm linorder_class.antisym_conv1}))
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   512
         end
24422
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   513
     | SOME thm => SOME(mk_meta_eq(thm RS @{thm order_class.antisym_conv}))
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   514
  end
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   515
  handle THM _ => NONE;
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   516
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   517
fun prove_antisym_less sg ss (NotC $ ((less as Const(_,T)) $ r $ s)) =
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   518
  let val prems = prems_of_ss ss;
22916
haftmann
parents: 22886
diff changeset
   519
      val le = Const (@{const_name less_eq}, T);
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   520
      val t = HOLogic.mk_Trueprop(le $ r $ s);
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   521
  in case find_first (prp t) prems of
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   522
       NONE =>
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   523
         let val t = HOLogic.mk_Trueprop(NotC $ (less $ s $ r))
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   524
         in case find_first (prp t) prems of
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   525
              NONE => NONE
24422
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   526
            | SOME thm => SOME(mk_meta_eq(thm RS @{thm linorder_class.antisym_conv3}))
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   527
         end
24422
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   528
     | SOME thm => SOME(mk_meta_eq(thm RS @{thm linorder_class.antisym_conv2}))
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   529
  end
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   530
  handle THM _ => NONE;
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   531
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   532
fun add_simprocs procs thy =
26496
49ae9456eba9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26324
diff changeset
   533
  Simplifier.map_simpset (fn ss => ss
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   534
    addsimprocs (map (fn (name, raw_ts, proc) =>
26496
49ae9456eba9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26324
diff changeset
   535
      Simplifier.simproc thy name raw_ts proc) procs)) thy;
49ae9456eba9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26324
diff changeset
   536
fun add_solver name tac =
49ae9456eba9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26324
diff changeset
   537
  Simplifier.map_simpset (fn ss => ss addSolver
49ae9456eba9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26324
diff changeset
   538
    mk_solver' name (fn ss => tac (Simplifier.prems_of_ss ss) (Simplifier.the_context ss)));
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   539
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   540
in
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   541
  add_simprocs [
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   542
       ("antisym le", ["(x::'a::order) <= y"], prove_antisym_le),
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   543
       ("antisym less", ["~ (x::'a::linorder) < y"], prove_antisym_less)
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   544
     ]
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   545
  #> add_solver "Transitivity" Orders.order_tac
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   546
  (* Adding the transitivity reasoners also as safe solvers showed a slight
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   547
     speed up, but the reasoning strength appears to be not higher (at least
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   548
     no breaking of additional proofs in the entire HOL distribution, as
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   549
     of 5 March 2004, was observed). *)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   550
end
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   551
*}
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   552
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   553
24422
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   554
subsection {* Name duplicates *}
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   555
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   556
lemmas order_less_le = less_le
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   557
lemmas order_eq_refl = preorder_class.eq_refl
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   558
lemmas order_less_irrefl = preorder_class.less_irrefl
24422
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   559
lemmas order_le_less = order_class.le_less
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   560
lemmas order_le_imp_less_or_eq = order_class.le_imp_less_or_eq
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   561
lemmas order_less_imp_le = preorder_class.less_imp_le
24422
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   562
lemmas order_less_imp_not_eq = order_class.less_imp_not_eq
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   563
lemmas order_less_imp_not_eq2 = order_class.less_imp_not_eq2
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   564
lemmas order_neq_le_trans = order_class.neq_le_trans
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   565
lemmas order_le_neq_trans = order_class.le_neq_trans
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   566
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   567
lemmas order_antisym = antisym
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   568
lemmas order_less_not_sym = preorder_class.less_not_sym
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   569
lemmas order_less_asym = preorder_class.less_asym
24422
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   570
lemmas order_eq_iff = order_class.eq_iff
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   571
lemmas order_antisym_conv = order_class.antisym_conv
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   572
lemmas order_less_trans = preorder_class.less_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   573
lemmas order_le_less_trans = preorder_class.le_less_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   574
lemmas order_less_le_trans = preorder_class.less_le_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   575
lemmas order_less_imp_not_less = preorder_class.less_imp_not_less
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   576
lemmas order_less_imp_triv = preorder_class.less_imp_triv
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   577
lemmas order_less_asym' = preorder_class.less_asym'
24422
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   578
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   579
lemmas linorder_linear = linear
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   580
lemmas linorder_less_linear = linorder_class.less_linear
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   581
lemmas linorder_le_less_linear = linorder_class.le_less_linear
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   582
lemmas linorder_le_cases = linorder_class.le_cases
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   583
lemmas linorder_not_less = linorder_class.not_less
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   584
lemmas linorder_not_le = linorder_class.not_le
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   585
lemmas linorder_neq_iff = linorder_class.neq_iff
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   586
lemmas linorder_neqE = linorder_class.neqE
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   587
lemmas linorder_antisym_conv1 = linorder_class.antisym_conv1
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   588
lemmas linorder_antisym_conv2 = linorder_class.antisym_conv2
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   589
lemmas linorder_antisym_conv3 = linorder_class.antisym_conv3
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   590
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   591
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   592
subsection {* Bounded quantifiers *}
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   593
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   594
syntax
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   595
  "_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
   596
  "_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
   597
  "_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
   598
  "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3EX _<=_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   599
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   600
  "_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
   601
  "_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
   602
  "_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
   603
  "_Ex_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3EX _>=_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   604
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   605
syntax (xsymbols)
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   606
  "_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
   607
  "_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
   608
  "_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
   609
  "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<le>_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   610
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   611
  "_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
   612
  "_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
   613
  "_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
   614
  "_Ex_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<ge>_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   615
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   616
syntax (HOL)
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   617
  "_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
   618
  "_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
   619
  "_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
   620
  "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3? _<=_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   621
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   622
syntax (HTML output)
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   623
  "_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
   624
  "_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
   625
  "_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
   626
  "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<le>_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   627
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   628
  "_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
   629
  "_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
   630
  "_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
   631
  "_Ex_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<ge>_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   632
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   633
translations
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   634
  "ALL x<y. P"   =>  "ALL x. x < y \<longrightarrow> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   635
  "EX x<y. P"    =>  "EX x. x < y \<and> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   636
  "ALL x<=y. P"  =>  "ALL x. x <= y \<longrightarrow> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   637
  "EX x<=y. P"   =>  "EX x. x <= y \<and> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   638
  "ALL x>y. P"   =>  "ALL x. x > y \<longrightarrow> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   639
  "EX x>y. P"    =>  "EX x. x > y \<and> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   640
  "ALL x>=y. P"  =>  "ALL x. x >= y \<longrightarrow> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   641
  "EX x>=y. P"   =>  "EX x. x >= y \<and> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   642
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   643
print_translation {*
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   644
let
22916
haftmann
parents: 22886
diff changeset
   645
  val All_binder = Syntax.binder_name @{const_syntax All};
haftmann
parents: 22886
diff changeset
   646
  val Ex_binder = Syntax.binder_name @{const_syntax Ex};
22377
61610b1beedf tuned ML setup;
wenzelm
parents: 22348
diff changeset
   647
  val impl = @{const_syntax "op -->"};
61610b1beedf tuned ML setup;
wenzelm
parents: 22348
diff changeset
   648
  val conj = @{const_syntax "op &"};
22916
haftmann
parents: 22886
diff changeset
   649
  val less = @{const_syntax less};
haftmann
parents: 22886
diff changeset
   650
  val less_eq = @{const_syntax less_eq};
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   651
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   652
  val trans =
21524
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21412
diff changeset
   653
   [((All_binder, impl, less), ("_All_less", "_All_greater")),
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21412
diff changeset
   654
    ((All_binder, impl, less_eq), ("_All_less_eq", "_All_greater_eq")),
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21412
diff changeset
   655
    ((Ex_binder, conj, less), ("_Ex_less", "_Ex_greater")),
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21412
diff changeset
   656
    ((Ex_binder, conj, less_eq), ("_Ex_less_eq", "_Ex_greater_eq"))];
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   657
22344
eddeabf16b5d Fixed print translations for quantifiers a la "ALL x>=t. P x". These used
krauss
parents: 22316
diff changeset
   658
  fun matches_bound v t = 
eddeabf16b5d Fixed print translations for quantifiers a la "ALL x>=t. P x". These used
krauss
parents: 22316
diff changeset
   659
     case t of (Const ("_bound", _) $ Free (v', _)) => (v = v')
eddeabf16b5d Fixed print translations for quantifiers a la "ALL x>=t. P x". These used
krauss
parents: 22316
diff changeset
   660
              | _ => false
eddeabf16b5d Fixed print translations for quantifiers a la "ALL x>=t. P x". These used
krauss
parents: 22316
diff changeset
   661
  fun contains_var v = Term.exists_subterm (fn Free (x, _) => x = v | _ => false)
eddeabf16b5d Fixed print translations for quantifiers a la "ALL x>=t. P x". These used
krauss
parents: 22316
diff changeset
   662
  fun mk v c n P = Syntax.const c $ Syntax.mark_bound v $ n $ P
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   663
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   664
  fun tr' q = (q,
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   665
    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
   666
      (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
   667
        NONE => raise Match
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   668
      | SOME (l, g) =>
22344
eddeabf16b5d Fixed print translations for quantifiers a la "ALL x>=t. P x". These used
krauss
parents: 22316
diff changeset
   669
          if matches_bound v t andalso not (contains_var v u) then mk v l u P
eddeabf16b5d Fixed print translations for quantifiers a la "ALL x>=t. P x". These used
krauss
parents: 22316
diff changeset
   670
          else if matches_bound v u andalso not (contains_var v t) then mk v g t P
eddeabf16b5d Fixed print translations for quantifiers a la "ALL x>=t. P x". These used
krauss
parents: 22316
diff changeset
   671
          else raise Match)
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   672
     | _ => raise Match);
21524
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21412
diff changeset
   673
in [tr' All_binder, tr' Ex_binder] end
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   674
*}
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   675
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   676
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   677
subsection {* Transitivity reasoning *}
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   678
25193
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   679
context ord
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   680
begin
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   681
25193
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   682
lemma ord_le_eq_trans: "a \<le> b \<Longrightarrow> b = c \<Longrightarrow> a \<le> c"
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   683
  by (rule subst)
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   684
25193
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   685
lemma ord_eq_le_trans: "a = b \<Longrightarrow> b \<le> c \<Longrightarrow> a \<le> c"
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   686
  by (rule ssubst)
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   687
25193
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   688
lemma ord_less_eq_trans: "a < b \<Longrightarrow> b = c \<Longrightarrow> a < c"
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   689
  by (rule subst)
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   690
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   691
lemma ord_eq_less_trans: "a = b \<Longrightarrow> b < c \<Longrightarrow> a < c"
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   692
  by (rule ssubst)
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   693
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   694
end
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   695
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   696
lemma order_less_subst2: "(a::'a::order) < b ==> f b < (c::'c::order) ==>
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   697
  (!!x y. x < y ==> f x < f y) ==> f a < c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   698
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   699
  assume r: "!!x y. x < y ==> f x < f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   700
  assume "a < b" hence "f a < f b" by (rule r)
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   701
  also assume "f b < c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   702
  finally (order_less_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   703
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   704
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   705
lemma order_less_subst1: "(a::'a::order) < f b ==> (b::'b::order) < c ==>
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   706
  (!!x y. x < y ==> f x < f y) ==> a < f c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   707
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   708
  assume r: "!!x y. x < y ==> f x < f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   709
  assume "a < f b"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   710
  also assume "b < c" hence "f b < f c" by (rule r)
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   711
  finally (order_less_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   712
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   713
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   714
lemma order_le_less_subst2: "(a::'a::order) <= b ==> f b < (c::'c::order) ==>
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   715
  (!!x y. x <= y ==> f x <= f y) ==> f a < c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   716
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   717
  assume r: "!!x y. x <= y ==> f x <= f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   718
  assume "a <= b" hence "f a <= f b" by (rule r)
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   719
  also assume "f b < c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   720
  finally (order_le_less_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   721
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   722
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   723
lemma order_le_less_subst1: "(a::'a::order) <= f b ==> (b::'b::order) < c ==>
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   724
  (!!x y. x < y ==> f x < f y) ==> a < f c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   725
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   726
  assume r: "!!x y. x < y ==> f x < f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   727
  assume "a <= f b"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   728
  also assume "b < c" hence "f b < f c" by (rule r)
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   729
  finally (order_le_less_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   730
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   731
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   732
lemma order_less_le_subst2: "(a::'a::order) < b ==> f b <= (c::'c::order) ==>
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   733
  (!!x y. x < y ==> f x < f y) ==> f a < c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   734
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   735
  assume r: "!!x y. x < y ==> f x < f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   736
  assume "a < b" hence "f a < f b" by (rule r)
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   737
  also assume "f b <= c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   738
  finally (order_less_le_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   739
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   740
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   741
lemma order_less_le_subst1: "(a::'a::order) < f b ==> (b::'b::order) <= c ==>
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   742
  (!!x y. x <= y ==> f x <= f y) ==> a < f c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   743
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   744
  assume r: "!!x y. x <= y ==> f x <= f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   745
  assume "a < f b"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   746
  also assume "b <= c" hence "f b <= f c" by (rule r)
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   747
  finally (order_less_le_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   748
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   749
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   750
lemma order_subst1: "(a::'a::order) <= f b ==> (b::'b::order) <= c ==>
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   751
  (!!x y. x <= y ==> f x <= f y) ==> a <= f c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   752
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   753
  assume r: "!!x y. x <= y ==> f x <= f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   754
  assume "a <= f b"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   755
  also assume "b <= c" hence "f b <= f c" by (rule r)
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   756
  finally (order_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   757
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   758
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   759
lemma order_subst2: "(a::'a::order) <= b ==> f b <= (c::'c::order) ==>
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   760
  (!!x y. x <= y ==> f x <= f y) ==> f a <= c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   761
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   762
  assume r: "!!x y. x <= y ==> f x <= f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   763
  assume "a <= b" hence "f a <= f b" by (rule r)
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   764
  also assume "f b <= c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   765
  finally (order_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   766
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   767
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   768
lemma ord_le_eq_subst: "a <= b ==> f b = c ==>
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   769
  (!!x y. x <= y ==> f x <= f y) ==> f a <= c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   770
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   771
  assume r: "!!x y. x <= y ==> f x <= f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   772
  assume "a <= b" hence "f a <= f b" by (rule r)
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   773
  also assume "f b = c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   774
  finally (ord_le_eq_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   775
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   776
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   777
lemma ord_eq_le_subst: "a = f b ==> b <= c ==>
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   778
  (!!x y. x <= y ==> f x <= f y) ==> a <= f c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   779
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   780
  assume r: "!!x y. x <= y ==> f x <= f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   781
  assume "a = f b"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   782
  also assume "b <= c" hence "f b <= f c" by (rule r)
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   783
  finally (ord_eq_le_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   784
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   785
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   786
lemma ord_less_eq_subst: "a < b ==> f b = c ==>
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   787
  (!!x y. x < y ==> f x < f y) ==> f a < c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   788
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   789
  assume r: "!!x y. x < y ==> f x < f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   790
  assume "a < b" hence "f a < f b" by (rule r)
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   791
  also assume "f b = c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   792
  finally (ord_less_eq_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   793
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   794
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   795
lemma ord_eq_less_subst: "a = f b ==> b < c ==>
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   796
  (!!x y. x < y ==> f x < f y) ==> a < f c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   797
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   798
  assume r: "!!x y. x < y ==> f x < f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   799
  assume "a = f b"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   800
  also assume "b < c" hence "f b < f c" by (rule r)
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   801
  finally (ord_eq_less_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   802
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   803
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   804
text {*
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   805
  Note that this list of rules is in reverse order of priorities.
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   806
*}
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   807
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   808
lemmas [trans] =
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   809
  order_less_subst2
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   810
  order_less_subst1
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   811
  order_le_less_subst2
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   812
  order_le_less_subst1
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   813
  order_less_le_subst2
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   814
  order_less_le_subst1
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   815
  order_subst2
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   816
  order_subst1
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   817
  ord_le_eq_subst
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   818
  ord_eq_le_subst
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   819
  ord_less_eq_subst
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   820
  ord_eq_less_subst
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   821
  forw_subst
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   822
  back_subst
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   823
  rev_mp
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   824
  mp
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   825
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   826
lemmas (in order) [trans] =
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   827
  neq_le_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   828
  le_neq_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   829
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   830
lemmas (in preorder) [trans] =
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   831
  less_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   832
  less_asym'
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   833
  le_less_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   834
  less_le_trans
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   835
  order_trans
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   836
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   837
lemmas (in order) [trans] =
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   838
  antisym
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   839
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   840
lemmas (in ord) [trans] =
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   841
  ord_le_eq_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   842
  ord_eq_le_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   843
  ord_less_eq_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   844
  ord_eq_less_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   845
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   846
lemmas [trans] =
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   847
  trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   848
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   849
lemmas order_trans_rules =
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   850
  order_less_subst2
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   851
  order_less_subst1
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   852
  order_le_less_subst2
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   853
  order_le_less_subst1
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   854
  order_less_le_subst2
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   855
  order_less_le_subst1
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   856
  order_subst2
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   857
  order_subst1
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   858
  ord_le_eq_subst
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   859
  ord_eq_le_subst
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   860
  ord_less_eq_subst
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   861
  ord_eq_less_subst
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   862
  forw_subst
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   863
  back_subst
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   864
  rev_mp
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   865
  mp
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   866
  neq_le_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   867
  le_neq_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   868
  less_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   869
  less_asym'
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   870
  le_less_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   871
  less_le_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   872
  order_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   873
  antisym
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   874
  ord_le_eq_trans
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   875
  ord_eq_le_trans
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   876
  ord_less_eq_trans
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   877
  ord_eq_less_trans
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   878
  trans
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   879
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   880
(* FIXME cleanup *)
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   881
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   882
text {* These support proving chains of decreasing inequalities
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   883
    a >= b >= c ... in Isar proofs. *}
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   884
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   885
lemma xt1:
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   886
  "a = b ==> b > c ==> a > c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   887
  "a > b ==> b = c ==> a > c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   888
  "a = b ==> b >= c ==> a >= c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   889
  "a >= b ==> b = c ==> a >= c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   890
  "(x::'a::order) >= y ==> y >= x ==> x = y"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   891
  "(x::'a::order) >= y ==> y >= z ==> x >= z"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   892
  "(x::'a::order) > y ==> y >= z ==> x > z"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   893
  "(x::'a::order) >= y ==> y > z ==> x > z"
23417
wenzelm
parents: 23263
diff changeset
   894
  "(a::'a::order) > b ==> b > a ==> P"
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   895
  "(x::'a::order) > y ==> y > z ==> x > z"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   896
  "(a::'a::order) >= b ==> a ~= b ==> a > b"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   897
  "(a::'a::order) ~= b ==> a >= b ==> a > b"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   898
  "a = f b ==> b > c ==> (!!x y. x > y ==> f x > f y) ==> a > f c" 
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   899
  "a > b ==> f b = c ==> (!!x y. x > y ==> f x > f y) ==> f a > c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   900
  "a = f b ==> b >= c ==> (!!x y. x >= y ==> f x >= f y) ==> a >= f c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   901
  "a >= b ==> f b = c ==> (!! x y. x >= y ==> f x >= f y) ==> f a >= c"
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   902
  by auto
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   903
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   904
lemma xt2:
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   905
  "(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
   906
by (subgoal_tac "f b >= f c", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   907
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   908
lemma xt3: "(a::'a::order) >= b ==> (f b::'b::order) >= c ==> 
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   909
    (!!x y. x >= y ==> f x >= f y) ==> f a >= c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   910
by (subgoal_tac "f a >= f b", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   911
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   912
lemma xt4: "(a::'a::order) > f b ==> (b::'b::order) >= c ==>
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   913
  (!!x y. x >= y ==> f x >= f y) ==> a > f c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   914
by (subgoal_tac "f b >= f c", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   915
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   916
lemma xt5: "(a::'a::order) > b ==> (f b::'b::order) >= c==>
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   917
    (!!x y. x > y ==> f x > f y) ==> f a > c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   918
by (subgoal_tac "f a > f b", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   919
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   920
lemma xt6: "(a::'a::order) >= f b ==> b > c ==>
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   921
    (!!x y. x > y ==> f x > f y) ==> a > f c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   922
by (subgoal_tac "f b > f c", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   923
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   924
lemma xt7: "(a::'a::order) >= b ==> (f b::'b::order) > c ==>
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   925
    (!!x y. x >= y ==> f x >= f y) ==> f a > c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   926
by (subgoal_tac "f a >= f b", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   927
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   928
lemma xt8: "(a::'a::order) > f b ==> (b::'b::order) > c ==>
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   929
    (!!x y. x > y ==> f x > f y) ==> a > f c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   930
by (subgoal_tac "f b > f c", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   931
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   932
lemma xt9: "(a::'a::order) > b ==> (f b::'b::order) > c ==>
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   933
    (!!x y. x > y ==> f x > f y) ==> f a > c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   934
by (subgoal_tac "f a > f b", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   935
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   936
lemmas xtrans = xt1 xt2 xt3 xt4 xt5 xt6 xt7 xt8 xt9
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   937
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   938
(* 
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   939
  Since "a >= b" abbreviates "b <= a", the abbreviation "..." stands
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   940
  for the wrong thing in an Isar proof.
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   941
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   942
  The extra transitivity rules can be used as follows: 
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   943
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   944
lemma "(a::'a::order) > z"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   945
proof -
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   946
  have "a >= b" (is "_ >= ?rhs")
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   947
    sorry
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   948
  also have "?rhs >= c" (is "_ >= ?rhs")
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   949
    sorry
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   950
  also (xtrans) have "?rhs = d" (is "_ = ?rhs")
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   951
    sorry
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   952
  also (xtrans) have "?rhs >= e" (is "_ >= ?rhs")
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   953
    sorry
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   954
  also (xtrans) have "?rhs > f" (is "_ > ?rhs")
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   955
    sorry
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   956
  also (xtrans) have "?rhs > z"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   957
    sorry
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   958
  finally (xtrans) show ?thesis .
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   959
qed
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   960
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   961
  Alternatively, one can use "declare xtrans [trans]" and then
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   962
  leave out the "(xtrans)" above.
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   963
*)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   964
23881
851c74f1bb69 moved class ord from Orderings.thy to HOL.thy
haftmann
parents: 23417
diff changeset
   965
851c74f1bb69 moved class ord from Orderings.thy to HOL.thy
haftmann
parents: 23417
diff changeset
   966
subsection {* Monotonicity, least value operator and min/max *}
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   967
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   968
context order
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   969
begin
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   970
30298
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
   971
definition mono :: "('a \<Rightarrow> 'b\<Colon>order) \<Rightarrow> bool" where
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   972
  "mono f \<longleftrightarrow> (\<forall>x y. x \<le> y \<longrightarrow> f x \<le> f y)"
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   973
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   974
lemma monoI [intro?]:
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   975
  fixes f :: "'a \<Rightarrow> 'b\<Colon>order"
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   976
  shows "(\<And>x y. x \<le> y \<Longrightarrow> f x \<le> f y) \<Longrightarrow> mono f"
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   977
  unfolding mono_def by iprover
21216
1c8580913738 made locale partial_order compatible with axclass order; changed import order; consecutive changes
haftmann
parents: 21204
diff changeset
   978
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   979
lemma monoD [dest?]:
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   980
  fixes f :: "'a \<Rightarrow> 'b\<Colon>order"
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   981
  shows "mono f \<Longrightarrow> x \<le> y \<Longrightarrow> f x \<le> f y"
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   982
  unfolding mono_def by iprover
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   983
30298
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
   984
definition strict_mono :: "('a \<Rightarrow> 'b\<Colon>order) \<Rightarrow> bool" where
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
   985
  "strict_mono f \<longleftrightarrow> (\<forall>x y. x < y \<longrightarrow> f x < f y)"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
   986
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
   987
lemma strict_monoI [intro?]:
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
   988
  assumes "\<And>x y. x < y \<Longrightarrow> f x < f y"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
   989
  shows "strict_mono f"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
   990
  using assms unfolding strict_mono_def by auto
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
   991
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
   992
lemma strict_monoD [dest?]:
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
   993
  "strict_mono f \<Longrightarrow> x < y \<Longrightarrow> f x < f y"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
   994
  unfolding strict_mono_def by auto
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
   995
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
   996
lemma strict_mono_mono [dest?]:
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
   997
  assumes "strict_mono f"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
   998
  shows "mono f"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
   999
proof (rule monoI)
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1000
  fix x y
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1001
  assume "x \<le> y"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1002
  show "f x \<le> f y"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1003
  proof (cases "x = y")
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1004
    case True then show ?thesis by simp
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1005
  next
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1006
    case False with `x \<le> y` have "x < y" by simp
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1007
    with assms strict_monoD have "f x < f y" by auto
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1008
    then show ?thesis by simp
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1009
  qed
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1010
qed
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1011
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1012
end
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1013
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1014
context linorder
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1015
begin
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1016
30298
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1017
lemma strict_mono_eq:
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1018
  assumes "strict_mono f"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1019
  shows "f x = f y \<longleftrightarrow> x = y"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1020
proof
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1021
  assume "f x = f y"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1022
  show "x = y" proof (cases x y rule: linorder_cases)
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1023
    case less with assms strict_monoD have "f x < f y" by auto
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1024
    with `f x = f y` show ?thesis by simp
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1025
  next
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1026
    case equal then show ?thesis .
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1027
  next
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1028
    case greater with assms strict_monoD have "f y < f x" by auto
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1029
    with `f x = f y` show ?thesis by simp
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1030
  qed
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1031
qed simp
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1032
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1033
lemma strict_mono_less_eq:
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1034
  assumes "strict_mono f"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1035
  shows "f x \<le> f y \<longleftrightarrow> x \<le> y"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1036
proof
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1037
  assume "x \<le> y"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1038
  with assms strict_mono_mono monoD show "f x \<le> f y" by auto
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1039
next
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1040
  assume "f x \<le> f y"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1041
  show "x \<le> y" proof (rule ccontr)
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1042
    assume "\<not> x \<le> y" then have "y < x" by simp
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1043
    with assms strict_monoD have "f y < f x" by auto
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1044
    with `f x \<le> f y` show False by simp
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1045
  qed
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1046
qed
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1047
  
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1048
lemma strict_mono_less:
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1049
  assumes "strict_mono f"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1050
  shows "f x < f y \<longleftrightarrow> x < y"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1051
  using assms
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1052
    by (auto simp add: less_le Orderings.less_le strict_mono_eq strict_mono_less_eq)
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1053
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1054
lemma min_of_mono:
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1055
  fixes f :: "'a \<Rightarrow> 'b\<Colon>linorder"
25377
dcde128c84a2 Orderings.min/max: no need to qualify consts;
wenzelm
parents: 25207
diff changeset
  1056
  shows "mono f \<Longrightarrow> min (f m) (f n) = f (min m n)"
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1057
  by (auto simp: mono_def Orderings.min_def min_def intro: Orderings.antisym)
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1058
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1059
lemma max_of_mono:
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1060
  fixes f :: "'a \<Rightarrow> 'b\<Colon>linorder"
25377
dcde128c84a2 Orderings.min/max: no need to qualify consts;
wenzelm
parents: 25207
diff changeset
  1061
  shows "mono f \<Longrightarrow> max (f m) (f n) = f (max m n)"
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1062
  by (auto simp: mono_def Orderings.max_def max_def intro: Orderings.antisym)
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1063
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1064
end
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1065
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
  1066
lemma min_leastL: "(!!x. least <= x) ==> min least x = least"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
  1067
by (simp add: min_def)
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
  1068
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
  1069
lemma max_leastL: "(!!x. least <= x) ==> max least x = x"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
  1070
by (simp add: max_def)
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
  1071
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
  1072
lemma min_leastR: "(\<And>x\<Colon>'a\<Colon>order. least \<le> x) \<Longrightarrow> min x least = least"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
  1073
apply (simp add: min_def)
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
  1074
apply (blast intro: order_antisym)
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
  1075
done
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
  1076
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
  1077
lemma max_leastR: "(\<And>x\<Colon>'a\<Colon>order. least \<le> x) \<Longrightarrow> max x least = x"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
  1078
apply (simp add: max_def)
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
  1079
apply (blast intro: order_antisym)
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
  1080
done
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
  1081
27823
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1082
28685
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1083
subsection {* Top and bottom elements *}
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1084
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1085
class top = preorder +
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1086
  fixes top :: 'a
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1087
  assumes top_greatest [simp]: "x \<le> top"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1088
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1089
class bot = preorder +
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1090
  fixes bot :: 'a
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1091
  assumes bot_least [simp]: "bot \<le> x"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1092
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1093
27823
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1094
subsection {* Dense orders *}
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1095
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1096
class dense_linear_order = linorder + 
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1097
  assumes gt_ex: "\<exists>y. x < y" 
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1098
  and lt_ex: "\<exists>y. y < x"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1099
  and dense: "x < y \<Longrightarrow> (\<exists>z. x < z \<and> z < y)"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1100
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1101
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1102
subsection {* Wellorders *}
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1103
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1104
class wellorder = linorder +
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1105
  assumes less_induct [case_names less]: "(\<And>x. (\<And>y. y < x \<Longrightarrow> P y) \<Longrightarrow> P x) \<Longrightarrow> P a"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1106
begin
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1107
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1108
lemma wellorder_Least_lemma:
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1109
  fixes k :: 'a
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1110
  assumes "P k"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1111
  shows "P (LEAST x. P x)" and "(LEAST x. P x) \<le> k"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1112
proof -
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1113
  have "P (LEAST x. P x) \<and> (LEAST x. P x) \<le> k"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1114
  using assms proof (induct k rule: less_induct)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1115
    case (less x) then have "P x" by simp
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1116
    show ?case proof (rule classical)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1117
      assume assm: "\<not> (P (LEAST a. P a) \<and> (LEAST a. P a) \<le> x)"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1118
      have "\<And>y. P y \<Longrightarrow> x \<le> y"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1119
      proof (rule classical)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1120
        fix y
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1121
        assume "P y" and "\<not> x \<le> y" 
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1122
        with less have "P (LEAST a. P a)" and "(LEAST a. P a) \<le> y"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1123
          by (auto simp add: not_le)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1124
        with assm have "x < (LEAST a. P a)" and "(LEAST a. P a) \<le> y"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1125
          by auto
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1126
        then show "x \<le> y" by auto
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1127
      qed
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1128
      with `P x` have Least: "(LEAST a. P a) = x"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1129
        by (rule Least_equality)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1130
      with `P x` show ?thesis by simp
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1131
    qed
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1132
  qed
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1133
  then show "P (LEAST x. P x)" and "(LEAST x. P x) \<le> k" by auto
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1134
qed
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1135
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1136
lemmas LeastI   = wellorder_Least_lemma(1)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1137
lemmas Least_le = wellorder_Least_lemma(2)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1138
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1139
-- "The following 3 lemmas are due to Brian Huffman"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1140
lemma LeastI_ex: "\<exists>x. P x \<Longrightarrow> P (Least P)"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1141
  by (erule exE) (erule LeastI)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1142
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1143
lemma LeastI2:
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1144
  "P a \<Longrightarrow> (\<And>x. P x \<Longrightarrow> Q x) \<Longrightarrow> Q (Least P)"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1145
  by (blast intro: LeastI)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1146
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1147
lemma LeastI2_ex:
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1148
  "\<exists>a. P a \<Longrightarrow> (\<And>x. P x \<Longrightarrow> Q x) \<Longrightarrow> Q (Least P)"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1149
  by (blast intro: LeastI_ex)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1150
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1151
lemma not_less_Least: "k < (LEAST x. P x) \<Longrightarrow> \<not> P k"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1152
apply (simp (no_asm_use) add: not_le [symmetric])
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1153
apply (erule contrapos_nn)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1154
apply (erule Least_le)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1155
done
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1156
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1157
end  
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1158
28685
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1159
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1160
subsection {* Order on bool *}
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1161
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1162
instantiation bool :: "{order, top, bot}"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1163
begin
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1164
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1165
definition
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1166
  le_bool_def [code del]: "P \<le> Q \<longleftrightarrow> P \<longrightarrow> Q"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1167
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1168
definition
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1169
  less_bool_def [code del]: "(P\<Colon>bool) < Q \<longleftrightarrow> \<not> P \<and> Q"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1170
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1171
definition
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1172
  top_bool_eq: "top = True"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1173
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1174
definition
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1175
  bot_bool_eq: "bot = False"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1176
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1177
instance proof
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1178
qed (auto simp add: le_bool_def less_bool_def top_bool_eq bot_bool_eq)
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1179
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
  1180
end
28685
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1181
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1182
lemma le_boolI: "(P \<Longrightarrow> Q) \<Longrightarrow> P \<le> Q"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1183
by (simp add: le_bool_def)
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1184
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1185
lemma le_boolI': "P \<longrightarrow> Q \<Longrightarrow> P \<le> Q"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1186
by (simp add: le_bool_def)
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1187
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1188
lemma le_boolE: "P \<le> Q \<Longrightarrow> P \<Longrightarrow> (Q \<Longrightarrow> R) \<Longrightarrow> R"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1189
by (simp add: le_bool_def)
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1190
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1191
lemma le_boolD: "P \<le> Q \<Longrightarrow> P \<longrightarrow> Q"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1192
by (simp add: le_bool_def)
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1193
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1194
lemma [code]:
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1195
  "False \<le> b \<longleftrightarrow> True"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1196
  "True \<le> b \<longleftrightarrow> b"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1197
  "False < b \<longleftrightarrow> b"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1198
  "True < b \<longleftrightarrow> False"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1199
  unfolding le_bool_def less_bool_def by simp_all
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1200
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1201
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1202
subsection {* Order on functions *}
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1203
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1204
instantiation "fun" :: (type, ord) ord
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1205
begin
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1206
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1207
definition
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1208
  le_fun_def [code del]: "f \<le> g \<longleftrightarrow> (\<forall>x. f x \<le> g x)"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1209
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1210
definition
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1211
  less_fun_def [code del]: "(f\<Colon>'a \<Rightarrow> 'b) < g \<longleftrightarrow> f \<le> g \<and> \<not> (g \<le> f)"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1212
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1213
instance ..
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1214
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1215
end
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1216
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1217
instance "fun" :: (type, preorder) preorder proof
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1218
qed (auto simp add: le_fun_def less_fun_def
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1219
  intro: order_trans order_antisym intro!: ext)
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1220
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1221
instance "fun" :: (type, order) order proof
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1222
qed (auto simp add: le_fun_def intro: order_antisym ext)
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1223
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1224
instantiation "fun" :: (type, top) top
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1225
begin
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1226
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1227
definition
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1228
  top_fun_eq: "top = (\<lambda>x. top)"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1229
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1230
instance proof
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1231
qed (simp add: top_fun_eq le_fun_def)
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1232
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1233
end
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1234
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1235
instantiation "fun" :: (type, bot) bot
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1236
begin
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1237
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1238
definition
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1239
  bot_fun_eq: "bot = (\<lambda>x. bot)"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1240
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1241
instance proof
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1242
qed (simp add: bot_fun_eq le_fun_def)
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1243
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1244
end
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1245
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1246
lemma le_funI: "(\<And>x. f x \<le> g x) \<Longrightarrow> f \<le> g"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1247
  unfolding le_fun_def by simp
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1248
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1249
lemma le_funE: "f \<le> g \<Longrightarrow> (f x \<le> g x \<Longrightarrow> P) \<Longrightarrow> P"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1250
  unfolding le_fun_def by simp
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1251
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1252
lemma le_funD: "f \<le> g \<Longrightarrow> f x \<le> g x"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1253
  unfolding le_fun_def by simp
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1254
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1255
text {*
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1256
  Handy introduction and elimination rules for @{text "\<le>"}
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1257
  on unary and binary predicates
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1258
*}
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1259
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1260
lemma predicate1I:
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1261
  assumes PQ: "\<And>x. P x \<Longrightarrow> Q x"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1262
  shows "P \<le> Q"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1263
  apply (rule le_funI)
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1264
  apply (rule le_boolI)
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1265
  apply (rule PQ)
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1266
  apply assumption
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1267
  done
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1268
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1269
lemma predicate1D [Pure.dest, dest]: "P \<le> Q \<Longrightarrow> P x \<Longrightarrow> Q x"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1270
  apply (erule le_funE)
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1271
  apply (erule le_boolE)
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1272
  apply assumption+
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1273
  done
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1274
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1275
lemma predicate2I [Pure.intro!, intro!]:
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1276
  assumes PQ: "\<And>x y. P x y \<Longrightarrow> Q x y"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1277
  shows "P \<le> Q"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1278
  apply (rule le_funI)+
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1279
  apply (rule le_boolI)
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1280
  apply (rule PQ)
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1281
  apply assumption
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1282
  done
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1283
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1284
lemma predicate2D [Pure.dest, dest]: "P \<le> Q \<Longrightarrow> P x y \<Longrightarrow> Q x y"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1285
  apply (erule le_funE)+
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1286
  apply (erule le_boolE)
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1287
  apply assumption+
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1288
  done
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1289
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1290
lemma rev_predicate1D: "P x ==> P <= Q ==> Q x"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1291
  by (rule predicate1D)
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1292
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1293
lemma rev_predicate2D: "P x y ==> P <= Q ==> Q x y"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1294
  by (rule predicate2D)
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1295
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1296
end