src/HOL/Orderings.thy
author wenzelm
Wed, 25 Aug 2010 18:36:22 +0200
changeset 38715 6513ea67d95d
parent 38705 aaee86c0e237
child 38786 e46e7a9cb622
permissions -rw-r--r--
renamed Simplifier.simproc(_i) to Simplifier.simproc_global(_i) to emphasize that this is not the real thing;
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
35301
90e42f9ba4d1 distributed theory Algebras to theories Groups and Lattices
haftmann
parents: 35115
diff changeset
     8
imports HOL
32215
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31998
diff changeset
     9
uses
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31998
diff changeset
    10
  "~~/src/Provers/order.ML"
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31998
diff changeset
    11
  "~~/src/Provers/quasi.ML"  (* FIXME unused? *)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    12
begin
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    13
35092
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    14
subsection {* Syntactic orders *}
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    15
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    16
class ord =
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    17
  fixes less_eq :: "'a \<Rightarrow> 'a \<Rightarrow> bool"
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    18
    and less :: "'a \<Rightarrow> 'a \<Rightarrow> bool"
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    19
begin
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    20
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    21
notation
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    22
  less_eq  ("op <=") and
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    23
  less_eq  ("(_/ <= _)" [51, 51] 50) and
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    24
  less  ("op <") and
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    25
  less  ("(_/ < _)"  [51, 51] 50)
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    26
  
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    27
notation (xsymbols)
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    28
  less_eq  ("op \<le>") and
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    29
  less_eq  ("(_/ \<le> _)"  [51, 51] 50)
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    30
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    31
notation (HTML output)
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    32
  less_eq  ("op \<le>") and
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    33
  less_eq  ("(_/ \<le> _)"  [51, 51] 50)
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    34
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    35
abbreviation (input)
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    36
  greater_eq  (infix ">=" 50) where
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    37
  "x >= y \<equiv> y <= x"
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    38
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    39
notation (input)
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    40
  greater_eq  (infix "\<ge>" 50)
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    41
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    42
abbreviation (input)
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    43
  greater  (infix ">" 50) where
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    44
  "x > y \<equiv> y < x"
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    45
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    46
end
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    47
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    48
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    49
subsection {* Quasi orders *}
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    50
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    51
class preorder = ord +
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    52
  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
    53
  and order_refl [iff]: "x \<le> x"
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
    54
  and order_trans: "x \<le> y \<Longrightarrow> y \<le> z \<Longrightarrow> x \<le> z"
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
    55
begin
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
    56
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    57
text {* Reflexivity. *}
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    58
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
    59
lemma eq_refl: "x = y \<Longrightarrow> x \<le> y"
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    60
    -- {* This form is useful with the classical reasoner. *}
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
    61
by (erule ssubst) (rule order_refl)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    62
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
    63
lemma less_irrefl [iff]: "\<not> x < x"
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    64
by (simp add: less_le_not_le)
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    65
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    66
lemma less_imp_le: "x < y \<Longrightarrow> x \<le> y"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    67
unfolding less_le_not_le by blast
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    68
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    69
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    70
text {* Asymmetry. *}
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    71
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    72
lemma less_not_sym: "x < y \<Longrightarrow> \<not> (y < x)"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    73
by (simp add: less_le_not_le)
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    74
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    75
lemma less_asym: "x < y \<Longrightarrow> (\<not> P \<Longrightarrow> y < x) \<Longrightarrow> P"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    76
by (drule less_not_sym, erule contrapos_np) simp
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    77
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    78
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    79
text {* Transitivity. *}
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    80
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    81
lemma less_trans: "x < y \<Longrightarrow> y < z \<Longrightarrow> x < z"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    82
by (auto simp add: less_le_not_le intro: order_trans) 
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    83
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    84
lemma le_less_trans: "x \<le> y \<Longrightarrow> y < z \<Longrightarrow> x < z"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    85
by (auto simp add: less_le_not_le intro: order_trans) 
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    86
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    87
lemma less_le_trans: "x < y \<Longrightarrow> y \<le> z \<Longrightarrow> x < z"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    88
by (auto simp add: less_le_not_le intro: order_trans) 
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    89
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    90
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    91
text {* Useful for simplification, but too risky to include by default. *}
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    92
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    93
lemma less_imp_not_less: "x < y \<Longrightarrow> (\<not> y < x) \<longleftrightarrow> True"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    94
by (blast elim: less_asym)
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    95
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    96
lemma less_imp_triv: "x < y \<Longrightarrow> (y < x \<longrightarrow> P) \<longleftrightarrow> True"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    97
by (blast elim: less_asym)
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    98
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
    99
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   100
text {* Transitivity rules for calculational reasoning *}
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   101
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   102
lemma less_asym': "a < b \<Longrightarrow> b < a \<Longrightarrow> P"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   103
by (rule less_asym)
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   104
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   105
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   106
text {* Dual order *}
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   107
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   108
lemma dual_preorder:
36635
080b755377c0 locale predicates of classes carry a mandatory "class" prefix
haftmann
parents: 35828
diff changeset
   109
  "class.preorder (op \<ge>) (op >)"
28823
dcbef866c9e2 tuned unfold_locales invocation
haftmann
parents: 28685
diff changeset
   110
proof qed (auto simp add: less_le_not_le intro: order_trans)
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   111
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   112
end
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   113
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   114
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   115
subsection {* Partial orders *}
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   116
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   117
class order = preorder +
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   118
  assumes antisym: "x \<le> y \<Longrightarrow> y \<le> x \<Longrightarrow> x = y"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   119
begin
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   120
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   121
text {* Reflexivity. *}
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   122
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   123
lemma less_le: "x < y \<longleftrightarrow> x \<le> y \<and> x \<noteq> y"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   124
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
   125
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   126
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
   127
    -- {* NOT suitable for iff, since it can cause PROOF FAILED. *}
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   128
by (simp add: less_le) blast
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   129
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   130
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
   131
unfolding less_le by blast
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   132
21329
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   133
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   134
text {* Useful for simplification, but too risky to include by default. *}
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   135
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   136
lemma less_imp_not_eq: "x < y \<Longrightarrow> (x = y) \<longleftrightarrow> False"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   137
by auto
21329
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   138
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   139
lemma less_imp_not_eq2: "x < y \<Longrightarrow> (y = x) \<longleftrightarrow> False"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   140
by auto
21329
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   141
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   142
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   143
text {* Transitivity rules for calculational reasoning *}
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   144
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   145
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
   146
by (simp add: less_le)
21329
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   147
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   148
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
   149
by (simp add: less_le)
21329
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   150
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   151
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   152
text {* Asymmetry. *}
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   153
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   154
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
   155
by (blast intro: antisym)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   156
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   157
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
   158
by (blast intro: antisym)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   159
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   160
lemma less_imp_neq: "x < y \<Longrightarrow> x \<noteq> y"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   161
by (erule contrapos_pn, erule subst, rule less_irrefl)
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   162
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   163
27107
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   164
text {* Least value operator *}
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   165
27299
3447cd2e18e8 streamlined definitions
haftmann
parents: 27107
diff changeset
   166
definition (in ord)
27107
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   167
  Least :: "('a \<Rightarrow> bool) \<Rightarrow> 'a" (binder "LEAST " 10) where
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   168
  "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
   169
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   170
lemma Least_equality:
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   171
  assumes "P x"
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   172
    and "\<And>y. P y \<Longrightarrow> x \<le> y"
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   173
  shows "Least P = x"
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   174
unfolding Least_def by (rule the_equality)
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   175
  (blast intro: assms antisym)+
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   176
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   177
lemma LeastI2_order:
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   178
  assumes "P x"
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   179
    and "\<And>y. P y \<Longrightarrow> x \<le> y"
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   180
    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
   181
  shows "Q (Least P)"
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   182
unfolding Least_def by (rule theI2)
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   183
  (blast intro: assms antisym)+
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   184
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   185
26014
00c2c3525bef dual orders and dual lattices
haftmann
parents: 25614
diff changeset
   186
text {* Dual order *}
22916
haftmann
parents: 22886
diff changeset
   187
26014
00c2c3525bef dual orders and dual lattices
haftmann
parents: 25614
diff changeset
   188
lemma dual_order:
36635
080b755377c0 locale predicates of classes carry a mandatory "class" prefix
haftmann
parents: 35828
diff changeset
   189
  "class.order (op \<ge>) (op >)"
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   190
by (intro_locales, rule dual_preorder) (unfold_locales, rule antisym)
22916
haftmann
parents: 22886
diff changeset
   191
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   192
end
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   193
21329
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   194
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   195
subsection {* Linear (total) orders *}
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   196
22316
f662831459de added class "preorder"
haftmann
parents: 22295
diff changeset
   197
class linorder = order +
25207
d58c14280367 dropped square syntax
haftmann
parents: 25193
diff changeset
   198
  assumes linear: "x \<le> y \<or> y \<le> x"
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   199
begin
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   200
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   201
lemma less_linear: "x < y \<or> x = y \<or> y < x"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   202
unfolding less_le using less_le linear by blast
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   203
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   204
lemma le_less_linear: "x \<le> y \<or> y < x"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   205
by (simp add: le_less less_linear)
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   206
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   207
lemma le_cases [case_names le ge]:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   208
  "(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
   209
using linear by blast
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   210
22384
33a46e6c7f04 prefix of class interpretation not mandatory any longer
haftmann
parents: 22377
diff changeset
   211
lemma linorder_cases [case_names less equal greater]:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   212
  "(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
   213
using less_linear by blast
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   214
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   215
lemma not_less: "\<not> x < y \<longleftrightarrow> y \<le> x"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   216
apply (simp add: less_le)
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   217
using linear apply (blast intro: antisym)
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   218
done
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   219
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   220
lemma not_less_iff_gr_or_eq:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   221
 "\<not>(x < y) \<longleftrightarrow> (x > y | x = y)"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   222
apply(simp add:not_less le_less)
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   223
apply blast
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   224
done
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   225
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   226
lemma not_le: "\<not> x \<le> y \<longleftrightarrow> y < x"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   227
apply (simp add: less_le)
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   228
using linear apply (blast intro: antisym)
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   229
done
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   230
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   231
lemma neq_iff: "x \<noteq> y \<longleftrightarrow> x < y \<or> y < x"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   232
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
   233
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   234
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
   235
by (simp add: neq_iff) blast
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   236
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   237
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
   238
by (blast intro: antisym dest: not_less [THEN iffD1])
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   239
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   240
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
   241
by (blast intro: antisym dest: not_less [THEN iffD1])
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   242
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   243
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
   244
by (blast intro: antisym dest: not_less [THEN iffD1])
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   245
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   246
lemma leI: "\<not> x < y \<Longrightarrow> y \<le> x"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   247
unfolding not_less .
16796
140f1e0ea846 generlization of some "nat" theorems
paulson
parents: 16743
diff changeset
   248
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   249
lemma leD: "y \<le> x \<Longrightarrow> \<not> x < y"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   250
unfolding not_less .
16796
140f1e0ea846 generlization of some "nat" theorems
paulson
parents: 16743
diff changeset
   251
140f1e0ea846 generlization of some "nat" theorems
paulson
parents: 16743
diff changeset
   252
(*FIXME inappropriate name (or delete altogether)*)
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   253
lemma not_leE: "\<not> y \<le> x \<Longrightarrow> x < y"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   254
unfolding not_le .
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   255
22916
haftmann
parents: 22886
diff changeset
   256
26014
00c2c3525bef dual orders and dual lattices
haftmann
parents: 25614
diff changeset
   257
text {* Dual order *}
22916
haftmann
parents: 22886
diff changeset
   258
26014
00c2c3525bef dual orders and dual lattices
haftmann
parents: 25614
diff changeset
   259
lemma dual_linorder:
36635
080b755377c0 locale predicates of classes carry a mandatory "class" prefix
haftmann
parents: 35828
diff changeset
   260
  "class.linorder (op \<ge>) (op >)"
080b755377c0 locale predicates of classes carry a mandatory "class" prefix
haftmann
parents: 35828
diff changeset
   261
by (rule class.linorder.intro, rule dual_order) (unfold_locales, rule linear)
22916
haftmann
parents: 22886
diff changeset
   262
haftmann
parents: 22886
diff changeset
   263
23881
851c74f1bb69 moved class ord from Orderings.thy to HOL.thy
haftmann
parents: 23417
diff changeset
   264
text {* min/max *}
851c74f1bb69 moved class ord from Orderings.thy to HOL.thy
haftmann
parents: 23417
diff changeset
   265
27299
3447cd2e18e8 streamlined definitions
haftmann
parents: 27107
diff changeset
   266
definition (in ord) min :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" where
37767
a2b7a20d6ea3 dropped superfluous [code del]s
haftmann
parents: 36960
diff changeset
   267
  "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
   268
27299
3447cd2e18e8 streamlined definitions
haftmann
parents: 27107
diff changeset
   269
definition (in ord) max :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" where
37767
a2b7a20d6ea3 dropped superfluous [code del]s
haftmann
parents: 36960
diff changeset
   270
  "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
   271
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   272
lemma min_le_iff_disj:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   273
  "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
   274
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
   275
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   276
lemma le_max_iff_disj:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   277
  "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
   278
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
   279
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   280
lemma min_less_iff_disj:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   281
  "min x y < z \<longleftrightarrow> x < z \<or> y < z"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   282
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
   283
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   284
lemma less_max_iff_disj:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   285
  "z < max x y \<longleftrightarrow> z < x \<or> z < y"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   286
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
   287
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   288
lemma min_less_iff_conj [simp]:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   289
  "z < min x y \<longleftrightarrow> z < x \<and> z < y"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   290
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
   291
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   292
lemma max_less_iff_conj [simp]:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   293
  "max x y < z \<longleftrightarrow> x < z \<and> y < z"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   294
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
   295
35828
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35579
diff changeset
   296
lemma split_min [no_atp]:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   297
  "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
   298
by (simp add: min_def)
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   299
35828
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35579
diff changeset
   300
lemma split_max [no_atp]:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   301
  "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
   302
by (simp add: max_def)
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   303
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   304
end
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   305
28516
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   306
text {* Explicit dictionaries for code generation *}
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   307
31998
2c7a24f74db9 code attributes use common underscore convention
haftmann
parents: 30929
diff changeset
   308
lemma min_ord_min [code, code_unfold, code_inline del]:
28516
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   309
  "min = ord.min (op \<le>)"
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   310
  by (rule ext)+ (simp add: min_def ord.min_def)
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   311
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   312
declare ord.min_def [code]
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   313
31998
2c7a24f74db9 code attributes use common underscore convention
haftmann
parents: 30929
diff changeset
   314
lemma max_ord_max [code, code_unfold, code_inline del]:
28516
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   315
  "max = ord.max (op \<le>)"
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   316
  by (rule ext)+ (simp add: max_def ord.max_def)
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   317
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   318
declare ord.max_def [code]
e6fdcaaadbd3 tuned min/max code generation
haftmann
parents: 27823
diff changeset
   319
23948
261bd4678076 using class target
haftmann
parents: 23881
diff changeset
   320
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   321
subsection {* Reasoning tools setup *}
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   322
21091
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   323
ML {*
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   324
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   325
signature ORDERS =
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   326
sig
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   327
  val print_structures: Proof.context -> unit
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   328
  val setup: theory -> theory
32215
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31998
diff changeset
   329
  val order_tac: Proof.context -> thm list -> int -> tactic
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   330
end;
21091
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   331
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   332
structure Orders: ORDERS =
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   333
struct
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   334
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   335
(** Theory and context data **)
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   336
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   337
fun struct_eq ((s1: string, ts1), (s2, ts2)) =
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   338
  (s1 = s2) andalso eq_list (op aconv) (ts1, ts2);
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   339
33519
e31a85f92ce9 adapted Generic_Data, Proof_Data;
wenzelm
parents: 32960
diff changeset
   340
structure Data = Generic_Data
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   341
(
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   342
  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
   343
    (* Order structures:
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   344
       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
   345
       needed to set up the transitivity reasoner,
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   346
       identifier and operations identify the structure uniquely. *)
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   347
  val empty = [];
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   348
  val extend = I;
33519
e31a85f92ce9 adapted Generic_Data, Proof_Data;
wenzelm
parents: 32960
diff changeset
   349
  fun merge data = AList.join struct_eq (K fst) data;
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   350
);
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   351
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   352
fun print_structures ctxt =
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   353
  let
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   354
    val structs = Data.get (Context.Proof ctxt);
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   355
    fun pretty_term t = Pretty.block
24920
2a45e400fdad generic Syntax.pretty/string_of operations;
wenzelm
parents: 24867
diff changeset
   356
      [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
   357
        Pretty.str "::", Pretty.brk 1,
24920
2a45e400fdad generic Syntax.pretty/string_of operations;
wenzelm
parents: 24867
diff changeset
   358
        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
   359
    fun pretty_struct ((s, ts), _) = Pretty.block
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   360
      [Pretty.str s, Pretty.str ":", Pretty.brk 1,
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   361
       Pretty.enclose "(" ")" (Pretty.breaks (map pretty_term ts))];
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   362
  in
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   363
    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
   364
  end;
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
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   367
(** Method **)
21091
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   368
32215
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31998
diff changeset
   369
fun struct_tac ((s, [eq, le, less]), thms) ctxt prems =
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   370
  let
30107
f3b3b0e3d184 Fixed nonexhaustive match problem in decomp, to make it fail more gracefully
berghofe
parents: 29823
diff changeset
   371
    fun decomp thy (@{const Trueprop} $ t) =
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   372
      let
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   373
        fun excluded t =
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   374
          (* exclude numeric types: linear arithmetic subsumes transitivity *)
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   375
          let val T = type_of t
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   376
          in
32960
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32899
diff changeset
   377
            T = HOLogic.natT orelse T = HOLogic.intT orelse T = HOLogic.realT
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   378
          end;
32960
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32899
diff changeset
   379
        fun rel (bin_op $ t1 $ t2) =
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   380
              if excluded t1 then NONE
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   381
              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
   382
              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
   383
              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
   384
              else NONE
32960
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32899
diff changeset
   385
          | rel _ = NONE;
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32899
diff changeset
   386
        fun dec (Const (@{const_name Not}, _) $ t) = (case rel t
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32899
diff changeset
   387
              of NONE => NONE
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32899
diff changeset
   388
               | SOME (t1, rel, t2) => SOME (t1, "~" ^ rel, t2))
24741
a53f5db5acbb Fixed setup of transitivity reasoner (function decomp).
ballarin
parents: 24704
diff changeset
   389
          | dec x = rel x;
30107
f3b3b0e3d184 Fixed nonexhaustive match problem in decomp, to make it fail more gracefully
berghofe
parents: 29823
diff changeset
   390
      in dec t end
f3b3b0e3d184 Fixed nonexhaustive match problem in decomp, to make it fail more gracefully
berghofe
parents: 29823
diff changeset
   391
      | decomp thy _ = NONE;
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   392
  in
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   393
    case s of
32215
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31998
diff changeset
   394
      "order" => Order_Tac.partial_tac decomp thms ctxt prems
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31998
diff changeset
   395
    | "linorder" => Order_Tac.linear_tac decomp thms ctxt prems
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   396
    | _ => 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
   397
  end
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   398
32215
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31998
diff changeset
   399
fun order_tac ctxt prems =
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31998
diff changeset
   400
  FIRST' (map (fn s => CHANGED o struct_tac s ctxt prems) (Data.get (Context.Proof ctxt)));
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   401
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   402
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   403
(** Attribute **)
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   404
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   405
fun add_struct_thm s tag =
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   406
  Thm.declaration_attribute
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   407
    (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
   408
fun del_struct s =
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   409
  Thm.declaration_attribute
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   410
    (fn _ => Data.map (AList.delete struct_eq s));
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   411
30722
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30528
diff changeset
   412
val attrib_setup =
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30528
diff changeset
   413
  Attrib.setup @{binding order}
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30528
diff changeset
   414
    (Scan.lift ((Args.add -- Args.name >> (fn (_, s) => SOME s) || Args.del >> K NONE) --|
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30528
diff changeset
   415
      Args.colon (* FIXME || Scan.succeed true *) ) -- Scan.lift Args.name --
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30528
diff changeset
   416
      Scan.repeat Args.term
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30528
diff changeset
   417
      >> (fn ((SOME tag, n), ts) => add_struct_thm (n, ts) tag
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30528
diff changeset
   418
           | ((NONE, n), ts) => del_struct (n, ts)))
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30528
diff changeset
   419
    "theorems controlling transitivity reasoner";
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   420
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   421
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   422
(** Diagnostic command **)
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   423
24867
e5b55d7be9bb simplified interfaces for outer syntax;
wenzelm
parents: 24748
diff changeset
   424
val _ =
36960
01594f816e3a prefer structure Keyword, Parse, Parse_Spec, Outer_Syntax;
wenzelm
parents: 36635
diff changeset
   425
  Outer_Syntax.improper_command "print_orders"
01594f816e3a prefer structure Keyword, Parse, Parse_Spec, Outer_Syntax;
wenzelm
parents: 36635
diff changeset
   426
    "print order structures available to transitivity reasoner" Keyword.diag
30806
342c73345237 simplified 'print_orders' command;
wenzelm
parents: 30722
diff changeset
   427
    (Scan.succeed (Toplevel.no_timing o Toplevel.unknown_context o
342c73345237 simplified 'print_orders' command;
wenzelm
parents: 30722
diff changeset
   428
        Toplevel.keep (print_structures o Toplevel.context_of)));
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   429
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   430
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   431
(** Setup **)
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   432
24867
e5b55d7be9bb simplified interfaces for outer syntax;
wenzelm
parents: 24748
diff changeset
   433
val setup =
32215
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31998
diff changeset
   434
  Method.setup @{binding order} (Scan.succeed (fn ctxt => SIMPLE_METHOD' (order_tac ctxt [])))
30722
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30528
diff changeset
   435
    "transitivity reasoner" #>
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30528
diff changeset
   436
  attrib_setup;
21091
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   437
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   438
end;
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   439
21091
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   440
*}
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   441
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   442
setup Orders.setup
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   443
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   444
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   445
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
   446
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   447
context order
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   448
begin
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   449
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   450
(* 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
   451
   is not a parameter of the locale. *)
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   452
27689
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   453
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
   454
  
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   455
declare order_refl  [order add le_refl: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   456
  
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   457
declare less_imp_le [order add less_imp_le: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   458
  
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   459
declare antisym [order add eqI: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   460
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   461
declare eq_refl [order add eqD1: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   462
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   463
declare sym [THEN eq_refl, order add eqD2: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   464
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   465
declare less_trans [order add less_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   466
  
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   467
declare less_le_trans [order add less_le_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   468
  
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   469
declare le_less_trans [order add le_less_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   470
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   471
declare order_trans [order add le_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   472
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   473
declare le_neq_trans [order add le_neq_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   474
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   475
declare neq_le_trans [order add neq_le_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   476
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   477
declare less_imp_neq [order add less_imp_neq: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   478
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   479
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
   480
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   481
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
   482
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   483
end
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   484
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   485
context linorder
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   486
begin
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   487
27689
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   488
declare [[order del: order "op = :: 'a => 'a => bool" "op <=" "op <"]]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   489
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   490
declare less_irrefl [THEN notE, order add less_reflE: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   491
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   492
declare order_refl [order add le_refl: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   493
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   494
declare less_imp_le [order add less_imp_le: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   495
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   496
declare not_less [THEN iffD2, order add not_lessI: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   497
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   498
declare not_le [THEN iffD2, order add not_leI: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   499
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   500
declare not_less [THEN iffD1, order add not_lessD: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   501
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   502
declare not_le [THEN iffD1, order add not_leD: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   503
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   504
declare antisym [order add eqI: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   505
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   506
declare eq_refl [order add eqD1: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   507
27689
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   508
declare sym [THEN eq_refl, order add eqD2: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   509
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   510
declare less_trans [order add less_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   511
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   512
declare less_le_trans [order add less_le_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   513
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   514
declare le_less_trans [order add le_less_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   515
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   516
declare order_trans [order add le_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   517
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   518
declare le_neq_trans [order add le_neq_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   519
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   520
declare neq_le_trans [order add neq_le_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   521
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   522
declare less_imp_neq [order add less_imp_neq: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   523
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   524
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
   525
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   526
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
   527
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   528
end
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   529
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   530
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   531
setup {*
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   532
let
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   533
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   534
fun prp t thm = (#prop (rep_thm thm) = t);
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   535
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   536
fun prove_antisym_le sg ss ((le as Const(_,T)) $ r $ s) =
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   537
  let val prems = prems_of_ss ss;
22916
haftmann
parents: 22886
diff changeset
   538
      val less = Const (@{const_name less}, T);
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   539
      val t = HOLogic.mk_Trueprop(le $ s $ r);
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   540
  in case find_first (prp t) prems of
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   541
       NONE =>
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   542
         let val t = HOLogic.mk_Trueprop(HOLogic.Not $ (less $ r $ s))
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   543
         in case find_first (prp t) prems of
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   544
              NONE => NONE
24422
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   545
            | SOME thm => SOME(mk_meta_eq(thm RS @{thm linorder_class.antisym_conv1}))
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   546
         end
24422
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   547
     | SOME thm => SOME(mk_meta_eq(thm RS @{thm order_class.antisym_conv}))
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   548
  end
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   549
  handle THM _ => NONE;
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   550
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   551
fun prove_antisym_less sg ss (NotC $ ((less as Const(_,T)) $ r $ s)) =
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   552
  let val prems = prems_of_ss ss;
22916
haftmann
parents: 22886
diff changeset
   553
      val le = Const (@{const_name less_eq}, T);
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   554
      val t = HOLogic.mk_Trueprop(le $ r $ s);
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   555
  in case find_first (prp t) prems of
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   556
       NONE =>
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   557
         let val t = HOLogic.mk_Trueprop(NotC $ (less $ s $ r))
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   558
         in case find_first (prp t) prems of
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   559
              NONE => NONE
24422
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   560
            | SOME thm => SOME(mk_meta_eq(thm RS @{thm linorder_class.antisym_conv3}))
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   561
         end
24422
c0b5ff9e9e4d moved class dense_linear_order to Orderings.thy
haftmann
parents: 24286
diff changeset
   562
     | SOME thm => SOME(mk_meta_eq(thm RS @{thm linorder_class.antisym_conv2}))
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   563
  end
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   564
  handle THM _ => NONE;
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   565
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   566
fun add_simprocs procs thy =
26496
49ae9456eba9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26324
diff changeset
   567
  Simplifier.map_simpset (fn ss => ss
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   568
    addsimprocs (map (fn (name, raw_ts, proc) =>
38715
6513ea67d95d renamed Simplifier.simproc(_i) to Simplifier.simproc_global(_i) to emphasize that this is not the real thing;
wenzelm
parents: 38705
diff changeset
   569
      Simplifier.simproc_global thy name raw_ts proc) procs)) thy;
26496
49ae9456eba9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26324
diff changeset
   570
fun add_solver name tac =
49ae9456eba9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26324
diff changeset
   571
  Simplifier.map_simpset (fn ss => ss addSolver
32215
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31998
diff changeset
   572
    mk_solver' name (fn ss => tac (Simplifier.the_context ss) (Simplifier.prems_of_ss ss)));
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   573
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   574
in
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   575
  add_simprocs [
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   576
       ("antisym le", ["(x::'a::order) <= y"], prove_antisym_le),
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   577
       ("antisym less", ["~ (x::'a::linorder) < y"], prove_antisym_less)
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   578
     ]
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   579
  #> add_solver "Transitivity" Orders.order_tac
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   580
  (* Adding the transitivity reasoners also as safe solvers showed a slight
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   581
     speed up, but the reasoning strength appears to be not higher (at least
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   582
     no breaking of additional proofs in the entire HOL distribution, as
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   583
     of 5 March 2004, was observed). *)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   584
end
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   585
*}
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   586
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   587
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   588
subsection {* Bounded quantifiers *}
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   589
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   590
syntax
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   591
  "_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
   592
  "_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
   593
  "_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
   594
  "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3EX _<=_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   595
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   596
  "_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
   597
  "_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
   598
  "_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
   599
  "_Ex_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3EX _>=_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   600
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   601
syntax (xsymbols)
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   602
  "_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
   603
  "_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
   604
  "_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
   605
  "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<le>_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   606
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   607
  "_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
   608
  "_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
   609
  "_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
   610
  "_Ex_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<ge>_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   611
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   612
syntax (HOL)
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   613
  "_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
   614
  "_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
   615
  "_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
   616
  "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3? _<=_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   617
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   618
syntax (HTML output)
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   619
  "_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
   620
  "_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
   621
  "_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
   622
  "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<le>_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   623
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   624
  "_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
   625
  "_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
   626
  "_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
   627
  "_Ex_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<ge>_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   628
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   629
translations
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   630
  "ALL x<y. P"   =>  "ALL x. x < y \<longrightarrow> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   631
  "EX x<y. P"    =>  "EX x. x < y \<and> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   632
  "ALL x<=y. P"  =>  "ALL x. x <= y \<longrightarrow> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   633
  "EX x<=y. P"   =>  "EX x. x <= y \<and> P"
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
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   639
print_translation {*
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   640
let
22916
haftmann
parents: 22886
diff changeset
   641
  val All_binder = Syntax.binder_name @{const_syntax All};
haftmann
parents: 22886
diff changeset
   642
  val Ex_binder = Syntax.binder_name @{const_syntax Ex};
22377
61610b1beedf tuned ML setup;
wenzelm
parents: 22348
diff changeset
   643
  val impl = @{const_syntax "op -->"};
61610b1beedf tuned ML setup;
wenzelm
parents: 22348
diff changeset
   644
  val conj = @{const_syntax "op &"};
22916
haftmann
parents: 22886
diff changeset
   645
  val less = @{const_syntax less};
haftmann
parents: 22886
diff changeset
   646
  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
   647
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   648
  val trans =
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   649
   [((All_binder, impl, less),
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   650
    (@{syntax_const "_All_less"}, @{syntax_const "_All_greater"})),
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   651
    ((All_binder, impl, less_eq),
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   652
    (@{syntax_const "_All_less_eq"}, @{syntax_const "_All_greater_eq"})),
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   653
    ((Ex_binder, conj, less),
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   654
    (@{syntax_const "_Ex_less"}, @{syntax_const "_Ex_greater"})),
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   655
    ((Ex_binder, conj, less_eq),
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   656
    (@{syntax_const "_Ex_less_eq"}, @{syntax_const "_Ex_greater_eq"}))];
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   657
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   658
  fun matches_bound v t =
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   659
    (case t of
35364
b8c62d60195c more antiquotations;
wenzelm
parents: 35301
diff changeset
   660
      Const (@{syntax_const "_bound"}, _) $ Free (v', _) => v = v'
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   661
    | _ => false);
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   662
  fun contains_var v = Term.exists_subterm (fn Free (x, _) => x = v | _ => false);
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   663
  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
   664
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   665
  fun tr' q = (q,
35364
b8c62d60195c more antiquotations;
wenzelm
parents: 35301
diff changeset
   666
    fn [Const (@{syntax_const "_bound"}, _) $ Free (v, _),
b8c62d60195c more antiquotations;
wenzelm
parents: 35301
diff changeset
   667
        Const (c, _) $ (Const (d, _) $ t $ u) $ P] =>
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   668
        (case AList.lookup (op =) trans (q, c, d) of
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   669
          NONE => raise Match
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   670
        | SOME (l, g) =>
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   671
            if matches_bound v t andalso not (contains_var v u) then mk v l u P
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   672
            else if matches_bound v u andalso not (contains_var v t) then mk v g t P
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   673
            else raise Match)
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   674
     | _ => raise Match);
21524
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21412
diff changeset
   675
in [tr' All_binder, tr' Ex_binder] end
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   676
*}
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   677
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   678
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   679
subsection {* Transitivity reasoning *}
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   680
25193
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   681
context ord
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   682
begin
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   683
25193
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   684
lemma ord_le_eq_trans: "a \<le> b \<Longrightarrow> b = c \<Longrightarrow> a \<le> c"
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   685
  by (rule subst)
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   686
25193
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   687
lemma ord_eq_le_trans: "a = b \<Longrightarrow> b \<le> c \<Longrightarrow> a \<le> c"
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   688
  by (rule ssubst)
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   689
25193
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   690
lemma ord_less_eq_trans: "a < b \<Longrightarrow> b = c \<Longrightarrow> a < c"
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   691
  by (rule subst)
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   692
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   693
lemma ord_eq_less_trans: "a = b \<Longrightarrow> b < c \<Longrightarrow> a < c"
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   694
  by (rule ssubst)
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   695
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   696
end
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   697
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   698
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
   699
  (!!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
   700
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   701
  assume r: "!!x y. x < y ==> f x < f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   702
  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
   703
  also assume "f b < c"
34250
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
   704
  finally (less_trans) show ?thesis .
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   705
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   706
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   707
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
   708
  (!!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
   709
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   710
  assume r: "!!x y. x < y ==> f x < f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   711
  assume "a < f b"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   712
  also assume "b < c" hence "f b < f c" by (rule r)
34250
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
   713
  finally (less_trans) show ?thesis .
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   714
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   715
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   716
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
   717
  (!!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
   718
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   719
  assume r: "!!x y. x <= y ==> f x <= f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   720
  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
   721
  also assume "f b < c"
34250
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
   722
  finally (le_less_trans) show ?thesis .
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   723
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   724
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   725
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
   726
  (!!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
   727
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   728
  assume r: "!!x y. x < y ==> f x < f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   729
  assume "a <= f b"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   730
  also assume "b < c" hence "f b < f c" by (rule r)
34250
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
   731
  finally (le_less_trans) show ?thesis .
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   732
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   733
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   734
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
   735
  (!!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
   736
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   737
  assume r: "!!x y. x < y ==> f x < f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   738
  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
   739
  also assume "f b <= c"
34250
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
   740
  finally (less_le_trans) show ?thesis .
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   741
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   742
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   743
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
   744
  (!!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
   745
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   746
  assume r: "!!x y. x <= y ==> f x <= f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   747
  assume "a < f b"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   748
  also assume "b <= c" hence "f b <= f c" by (rule r)
34250
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
   749
  finally (less_le_trans) show ?thesis .
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   750
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   751
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   752
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
   753
  (!!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
   754
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   755
  assume r: "!!x y. x <= y ==> f x <= f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   756
  assume "a <= f b"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   757
  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
   758
  finally (order_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   759
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   760
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   761
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
   762
  (!!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
   763
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   764
  assume r: "!!x y. x <= y ==> f x <= f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   765
  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
   766
  also assume "f b <= c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   767
  finally (order_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   768
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   769
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   770
lemma ord_le_eq_subst: "a <= b ==> f b = c ==>
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   771
  (!!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
   772
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   773
  assume r: "!!x y. x <= y ==> f x <= f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   774
  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
   775
  also assume "f b = c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   776
  finally (ord_le_eq_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   777
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   778
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   779
lemma ord_eq_le_subst: "a = f b ==> b <= c ==>
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   780
  (!!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
   781
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   782
  assume r: "!!x y. x <= y ==> f x <= f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   783
  assume "a = f b"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   784
  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
   785
  finally (ord_eq_le_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   786
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   787
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   788
lemma ord_less_eq_subst: "a < b ==> f b = c ==>
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   789
  (!!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
   790
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   791
  assume r: "!!x y. x < y ==> f x < f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   792
  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
   793
  also assume "f b = c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   794
  finally (ord_less_eq_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   795
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   796
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   797
lemma ord_eq_less_subst: "a = f b ==> b < c ==>
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   798
  (!!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
   799
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   800
  assume r: "!!x y. x < y ==> f x < f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   801
  assume "a = f b"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   802
  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
   803
  finally (ord_eq_less_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   804
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   805
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   806
text {*
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   807
  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
   808
*}
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   809
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   810
lemmas [trans] =
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   811
  order_less_subst2
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   812
  order_less_subst1
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   813
  order_le_less_subst2
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   814
  order_le_less_subst1
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   815
  order_less_le_subst2
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   816
  order_less_le_subst1
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   817
  order_subst2
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   818
  order_subst1
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   819
  ord_le_eq_subst
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   820
  ord_eq_le_subst
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   821
  ord_less_eq_subst
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   822
  ord_eq_less_subst
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   823
  forw_subst
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   824
  back_subst
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   825
  rev_mp
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   826
  mp
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   827
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   828
lemmas (in order) [trans] =
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   829
  neq_le_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   830
  le_neq_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   831
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   832
lemmas (in preorder) [trans] =
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   833
  less_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   834
  less_asym'
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   835
  le_less_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   836
  less_le_trans
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   837
  order_trans
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   838
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   839
lemmas (in order) [trans] =
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   840
  antisym
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   841
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   842
lemmas (in ord) [trans] =
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   843
  ord_le_eq_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   844
  ord_eq_le_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   845
  ord_less_eq_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   846
  ord_eq_less_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   847
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   848
lemmas [trans] =
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   849
  trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   850
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   851
lemmas order_trans_rules =
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   852
  order_less_subst2
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   853
  order_less_subst1
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   854
  order_le_less_subst2
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   855
  order_le_less_subst1
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   856
  order_less_le_subst2
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   857
  order_less_le_subst1
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   858
  order_subst2
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   859
  order_subst1
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   860
  ord_le_eq_subst
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   861
  ord_eq_le_subst
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   862
  ord_less_eq_subst
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   863
  ord_eq_less_subst
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   864
  forw_subst
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   865
  back_subst
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   866
  rev_mp
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   867
  mp
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   868
  neq_le_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   869
  le_neq_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   870
  less_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   871
  less_asym'
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   872
  le_less_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   873
  less_le_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   874
  order_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   875
  antisym
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   876
  ord_le_eq_trans
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   877
  ord_eq_le_trans
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   878
  ord_less_eq_trans
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   879
  ord_eq_less_trans
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   880
  trans
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
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)
34250
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
  1074
apply (blast intro: antisym)
23212
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)
34250
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
  1079
apply (blast intro: antisym)
23212
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
35028
108662d50512 more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents: 34974
diff changeset
  1096
class dense_linorder = linorder + 
27823
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)"
35579
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1100
begin
27823
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1101
35579
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1102
lemma dense_le:
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1103
  fixes y z :: 'a
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1104
  assumes "\<And>x. x < y \<Longrightarrow> x \<le> z"
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1105
  shows "y \<le> z"
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1106
proof (rule ccontr)
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1107
  assume "\<not> ?thesis"
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1108
  hence "z < y" by simp
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1109
  from dense[OF this]
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1110
  obtain x where "x < y" and "z < x" by safe
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1111
  moreover have "x \<le> z" using assms[OF `x < y`] .
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1112
  ultimately show False by auto
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1113
qed
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1114
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1115
lemma dense_le_bounded:
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1116
  fixes x y z :: 'a
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1117
  assumes "x < y"
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1118
  assumes *: "\<And>w. \<lbrakk> x < w ; w < y \<rbrakk> \<Longrightarrow> w \<le> z"
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1119
  shows "y \<le> z"
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1120
proof (rule dense_le)
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1121
  fix w assume "w < y"
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1122
  from dense[OF `x < y`] obtain u where "x < u" "u < y" by safe
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1123
  from linear[of u w]
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1124
  show "w \<le> z"
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1125
  proof (rule disjE)
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1126
    assume "u \<le> w"
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1127
    from less_le_trans[OF `x < u` `u \<le> w`] `w < y`
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1128
    show "w \<le> z" by (rule *)
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1129
  next
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1130
    assume "w \<le> u"
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1131
    from `w \<le> u` *[OF `x < u` `u < y`]
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1132
    show "w \<le> z" by (rule order_trans)
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1133
  qed
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1134
qed
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1135
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1136
end
27823
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1137
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1138
subsection {* Wellorders *}
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1139
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1140
class wellorder = linorder +
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1141
  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
  1142
begin
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1143
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1144
lemma wellorder_Least_lemma:
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1145
  fixes k :: 'a
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1146
  assumes "P k"
34250
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
  1147
  shows LeastI: "P (LEAST x. P x)" and Least_le: "(LEAST x. P x) \<le> k"
27823
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1148
proof -
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1149
  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
  1150
  using assms proof (induct k rule: less_induct)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1151
    case (less x) then have "P x" by simp
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1152
    show ?case proof (rule classical)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1153
      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
  1154
      have "\<And>y. P y \<Longrightarrow> x \<le> y"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1155
      proof (rule classical)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1156
        fix y
38705
aaee86c0e237 moved generic lemmas in Probability to HOL
hoelzl
parents: 38650
diff changeset
  1157
        assume "P y" and "\<not> x \<le> y"
27823
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1158
        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
  1159
          by (auto simp add: not_le)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1160
        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
  1161
          by auto
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1162
        then show "x \<le> y" by auto
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1163
      qed
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1164
      with `P x` have Least: "(LEAST a. P a) = x"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1165
        by (rule Least_equality)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1166
      with `P x` show ?thesis by simp
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1167
    qed
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1168
  qed
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1169
  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
  1170
qed
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1171
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1172
-- "The following 3 lemmas are due to Brian Huffman"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1173
lemma LeastI_ex: "\<exists>x. P x \<Longrightarrow> P (Least P)"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1174
  by (erule exE) (erule LeastI)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1175
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1176
lemma LeastI2:
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1177
  "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
  1178
  by (blast intro: LeastI)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1179
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1180
lemma LeastI2_ex:
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1181
  "\<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
  1182
  by (blast intro: LeastI_ex)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1183
38705
aaee86c0e237 moved generic lemmas in Probability to HOL
hoelzl
parents: 38650
diff changeset
  1184
lemma LeastI2_wellorder:
aaee86c0e237 moved generic lemmas in Probability to HOL
hoelzl
parents: 38650
diff changeset
  1185
  assumes "P a"
aaee86c0e237 moved generic lemmas in Probability to HOL
hoelzl
parents: 38650
diff changeset
  1186
  and "\<And>a. \<lbrakk> P a; \<forall>b. P b \<longrightarrow> a \<le> b \<rbrakk> \<Longrightarrow> Q a"
aaee86c0e237 moved generic lemmas in Probability to HOL
hoelzl
parents: 38650
diff changeset
  1187
  shows "Q (Least P)"
aaee86c0e237 moved generic lemmas in Probability to HOL
hoelzl
parents: 38650
diff changeset
  1188
proof (rule LeastI2_order)
aaee86c0e237 moved generic lemmas in Probability to HOL
hoelzl
parents: 38650
diff changeset
  1189
  show "P (Least P)" using `P a` by (rule LeastI)
aaee86c0e237 moved generic lemmas in Probability to HOL
hoelzl
parents: 38650
diff changeset
  1190
next
aaee86c0e237 moved generic lemmas in Probability to HOL
hoelzl
parents: 38650
diff changeset
  1191
  fix y assume "P y" thus "Least P \<le> y" by (rule Least_le)
aaee86c0e237 moved generic lemmas in Probability to HOL
hoelzl
parents: 38650
diff changeset
  1192
next
aaee86c0e237 moved generic lemmas in Probability to HOL
hoelzl
parents: 38650
diff changeset
  1193
  fix x assume "P x" "\<forall>y. P y \<longrightarrow> x \<le> y" thus "Q x" by (rule assms(2))
aaee86c0e237 moved generic lemmas in Probability to HOL
hoelzl
parents: 38650
diff changeset
  1194
qed
aaee86c0e237 moved generic lemmas in Probability to HOL
hoelzl
parents: 38650
diff changeset
  1195
27823
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1196
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
  1197
apply (simp (no_asm_use) add: not_le [symmetric])
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1198
apply (erule contrapos_nn)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1199
apply (erule Least_le)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1200
done
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1201
38705
aaee86c0e237 moved generic lemmas in Probability to HOL
hoelzl
parents: 38650
diff changeset
  1202
end
27823
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1203
28685
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1204
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1205
subsection {* Order on bool *}
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1206
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1207
instantiation bool :: "{order, top, bot}"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1208
begin
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
37767
a2b7a20d6ea3 dropped superfluous [code del]s
haftmann
parents: 36960
diff changeset
  1211
  le_bool_def: "P \<le> Q \<longleftrightarrow> P \<longrightarrow> Q"
28685
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1212
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1213
definition
37767
a2b7a20d6ea3 dropped superfluous [code del]s
haftmann
parents: 36960
diff changeset
  1214
  less_bool_def: "(P\<Colon>bool) < Q \<longleftrightarrow> \<not> P \<and> Q"
28685
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1215
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1216
definition
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1217
  top_bool_eq: "top = True"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1218
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1219
definition
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1220
  bot_bool_eq: "bot = False"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1221
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1222
instance proof
34250
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
  1223
qed (auto simp add: bot_bool_eq top_bool_eq less_bool_def, auto simp add: le_bool_def)
28685
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1224
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
  1225
end
28685
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1226
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1227
lemma le_boolI: "(P \<Longrightarrow> Q) \<Longrightarrow> P \<le> Q"
32899
c913cc831630 tuned order of lemmas
haftmann
parents: 32887
diff changeset
  1228
  by (simp add: le_bool_def)
28685
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1229
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1230
lemma le_boolI': "P \<longrightarrow> Q \<Longrightarrow> P \<le> Q"
32899
c913cc831630 tuned order of lemmas
haftmann
parents: 32887
diff changeset
  1231
  by (simp add: le_bool_def)
28685
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1232
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1233
lemma le_boolE: "P \<le> Q \<Longrightarrow> P \<Longrightarrow> (Q \<Longrightarrow> R) \<Longrightarrow> R"
32899
c913cc831630 tuned order of lemmas
haftmann
parents: 32887
diff changeset
  1234
  by (simp add: le_bool_def)
28685
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1235
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1236
lemma le_boolD: "P \<le> Q \<Longrightarrow> P \<longrightarrow> Q"
32899
c913cc831630 tuned order of lemmas
haftmann
parents: 32887
diff changeset
  1237
  by (simp add: le_bool_def)
c913cc831630 tuned order of lemmas
haftmann
parents: 32887
diff changeset
  1238
c913cc831630 tuned order of lemmas
haftmann
parents: 32887
diff changeset
  1239
lemma bot_boolE: "bot \<Longrightarrow> P"
c913cc831630 tuned order of lemmas
haftmann
parents: 32887
diff changeset
  1240
  by (simp add: bot_bool_eq)
c913cc831630 tuned order of lemmas
haftmann
parents: 32887
diff changeset
  1241
c913cc831630 tuned order of lemmas
haftmann
parents: 32887
diff changeset
  1242
lemma top_boolI: top
c913cc831630 tuned order of lemmas
haftmann
parents: 32887
diff changeset
  1243
  by (simp add: top_bool_eq)
28685
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1244
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1245
lemma [code]:
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1246
  "False \<le> b \<longleftrightarrow> True"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1247
  "True \<le> b \<longleftrightarrow> b"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1248
  "False < b \<longleftrightarrow> b"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1249
  "True < b \<longleftrightarrow> False"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1250
  unfolding le_bool_def less_bool_def by simp_all
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1251
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1252
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1253
subsection {* Order on functions *}
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1254
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1255
instantiation "fun" :: (type, ord) ord
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1256
begin
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1257
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1258
definition
37767
a2b7a20d6ea3 dropped superfluous [code del]s
haftmann
parents: 36960
diff changeset
  1259
  le_fun_def: "f \<le> g \<longleftrightarrow> (\<forall>x. f x \<le> g x)"
28685
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1260
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1261
definition
37767
a2b7a20d6ea3 dropped superfluous [code del]s
haftmann
parents: 36960
diff changeset
  1262
  less_fun_def: "(f\<Colon>'a \<Rightarrow> 'b) < g \<longleftrightarrow> f \<le> g \<and> \<not> (g \<le> f)"
28685
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1263
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1264
instance ..
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1265
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1266
end
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1267
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1268
instance "fun" :: (type, preorder) preorder proof
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1269
qed (auto simp add: le_fun_def less_fun_def
34250
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
  1270
  intro: order_trans antisym intro!: ext)
28685
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1271
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1272
instance "fun" :: (type, order) order proof
34250
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
  1273
qed (auto simp add: le_fun_def intro: antisym ext)
28685
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1274
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1275
instantiation "fun" :: (type, top) top
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1276
begin
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1277
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1278
definition
38650
f22a564ac820 "no_atp" fact that leads to unsound proofs in Sledgehammer
blanchet
parents: 37767
diff changeset
  1279
  top_fun_eq [no_atp]: "top = (\<lambda>x. top)"
f22a564ac820 "no_atp" fact that leads to unsound proofs in Sledgehammer
blanchet
parents: 37767
diff changeset
  1280
declare top_fun_eq_raw [no_atp]
28685
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1281
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1282
instance proof
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1283
qed (simp add: top_fun_eq le_fun_def)
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1284
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1285
end
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1286
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1287
instantiation "fun" :: (type, bot) bot
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1288
begin
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1289
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1290
definition
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1291
  bot_fun_eq: "bot = (\<lambda>x. bot)"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1292
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1293
instance proof
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1294
qed (simp add: bot_fun_eq le_fun_def)
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
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1297
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1298
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
  1299
  unfolding le_fun_def by simp
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1300
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1301
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
  1302
  unfolding le_fun_def by simp
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1303
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1304
lemma le_funD: "f \<le> g \<Longrightarrow> f x \<le> g x"
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1305
  unfolding le_fun_def by simp
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1306
34250
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
  1307
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
  1308
subsection {* Name duplicates *}
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
  1309
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
  1310
lemmas order_eq_refl = preorder_class.eq_refl
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
  1311
lemmas order_less_irrefl = preorder_class.less_irrefl
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
  1312
lemmas order_less_imp_le = preorder_class.less_imp_le
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
  1313
lemmas order_less_not_sym = preorder_class.less_not_sym
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
  1314
lemmas order_less_asym = preorder_class.less_asym
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
  1315
lemmas order_less_trans = preorder_class.less_trans
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
  1316
lemmas order_le_less_trans = preorder_class.le_less_trans
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
  1317
lemmas order_less_le_trans = preorder_class.less_le_trans
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: