src/HOL/Orderings.thy
author wenzelm
Wed, 29 Oct 2014 19:01:49 +0100
changeset 58826 2ed2eaabe3df
parent 57447 87429bdecad5
child 58889 5b7a9633cfa8
permissions -rw-r--r--
modernized setup;
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
46950
d0181abdbdac declare command keywords via theory header, including strict checking outside Pure;
wenzelm
parents: 46884
diff changeset
     9
keywords "print_orders" :: diag
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    10
begin
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
    11
48891
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 47432
diff changeset
    12
ML_file "~~/src/Provers/order.ML"
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 47432
diff changeset
    13
ML_file "~~/src/Provers/quasi.ML"  (* FIXME unused? *)
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 47432
diff changeset
    14
51487
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    15
subsection {* Abstract ordering *}
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    16
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    17
locale ordering =
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    18
  fixes less_eq :: "'a \<Rightarrow> 'a \<Rightarrow> bool" (infix "\<preceq>" 50)
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    19
   and less :: "'a \<Rightarrow> 'a \<Rightarrow> bool" (infix "\<prec>" 50)
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    20
  assumes strict_iff_order: "a \<prec> b \<longleftrightarrow> a \<preceq> b \<and> a \<noteq> b"
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    21
  assumes refl: "a \<preceq> a" -- {* not @{text iff}: makes problems due to multiple (dual) interpretations *}
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    22
    and antisym: "a \<preceq> b \<Longrightarrow> b \<preceq> a \<Longrightarrow> a = b"
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    23
    and trans: "a \<preceq> b \<Longrightarrow> b \<preceq> c \<Longrightarrow> a \<preceq> c"
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    24
begin
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    25
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    26
lemma strict_implies_order:
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    27
  "a \<prec> b \<Longrightarrow> a \<preceq> b"
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    28
  by (simp add: strict_iff_order)
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    29
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    30
lemma strict_implies_not_eq:
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    31
  "a \<prec> b \<Longrightarrow> a \<noteq> b"
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    32
  by (simp add: strict_iff_order)
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    33
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    34
lemma not_eq_order_implies_strict:
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    35
  "a \<noteq> b \<Longrightarrow> a \<preceq> b \<Longrightarrow> a \<prec> b"
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    36
  by (simp add: strict_iff_order)
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    37
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    38
lemma order_iff_strict:
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    39
  "a \<preceq> b \<longleftrightarrow> a \<prec> b \<or> a = b"
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    40
  by (auto simp add: strict_iff_order refl)
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    41
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    42
lemma irrefl: -- {* not @{text iff}: makes problems due to multiple (dual) interpretations *}
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    43
  "\<not> a \<prec> a"
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    44
  by (simp add: strict_iff_order)
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    45
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    46
lemma asym:
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    47
  "a \<prec> b \<Longrightarrow> b \<prec> a \<Longrightarrow> False"
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    48
  by (auto simp add: strict_iff_order intro: antisym)
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    49
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    50
lemma strict_trans1:
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    51
  "a \<preceq> b \<Longrightarrow> b \<prec> c \<Longrightarrow> a \<prec> c"
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    52
  by (auto simp add: strict_iff_order intro: trans antisym)
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    53
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    54
lemma strict_trans2:
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    55
  "a \<prec> b \<Longrightarrow> b \<preceq> c \<Longrightarrow> a \<prec> c"
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    56
  by (auto simp add: strict_iff_order intro: trans antisym)
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    57
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    58
lemma strict_trans:
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    59
  "a \<prec> b \<Longrightarrow> b \<prec> c \<Longrightarrow> a \<prec> c"
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    60
  by (auto intro: strict_trans1 strict_implies_order)
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    61
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    62
end
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    63
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    64
locale ordering_top = ordering +
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    65
  fixes top :: "'a"
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    66
  assumes extremum [simp]: "a \<preceq> top"
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    67
begin
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    68
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    69
lemma extremum_uniqueI:
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    70
  "top \<preceq> a \<Longrightarrow> a = top"
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    71
  by (rule antisym) auto
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    72
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    73
lemma extremum_unique:
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    74
  "top \<preceq> a \<longleftrightarrow> a = top"
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    75
  by (auto intro: antisym)
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    76
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    77
lemma extremum_strict [simp]:
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    78
  "\<not> (top \<prec> a)"
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    79
  using extremum [of a] by (auto simp add: order_iff_strict intro: asym irrefl)
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    80
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    81
lemma not_eq_extremum:
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    82
  "a \<noteq> top \<longleftrightarrow> a \<prec> top"
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    83
  by (auto simp add: order_iff_strict intro: not_eq_order_implies_strict extremum)
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    84
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    85
end  
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    86
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
    87
35092
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    88
subsection {* Syntactic orders *}
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    89
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    90
class ord =
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    91
  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
    92
    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
    93
begin
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    94
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    95
notation
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    96
  less_eq  ("op <=") and
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    97
  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
    98
  less  ("op <") and
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
    99
  less  ("(_/ < _)"  [51, 51] 50)
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
   100
  
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
   101
notation (xsymbols)
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
   102
  less_eq  ("op \<le>") and
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
   103
  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
   104
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
   105
notation (HTML output)
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
   106
  less_eq  ("op \<le>") and
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
   107
  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
   108
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
   109
abbreviation (input)
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
   110
  greater_eq  (infix ">=" 50) where
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
   111
  "x >= y \<equiv> y <= x"
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
   112
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
   113
notation (input)
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
   114
  greater_eq  (infix "\<ge>" 50)
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
   115
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
   116
abbreviation (input)
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
   117
  greater  (infix ">" 50) where
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
   118
  "x > y \<equiv> y < x"
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
   119
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
   120
end
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
   121
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 35028
diff changeset
   122
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   123
subsection {* Quasi orders *}
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   124
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   125
class preorder = ord +
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   126
  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
   127
  and order_refl [iff]: "x \<le> x"
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   128
  and order_trans: "x \<le> y \<Longrightarrow> y \<le> z \<Longrightarrow> x \<le> z"
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   129
begin
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   130
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   131
text {* Reflexivity. *}
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   132
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   133
lemma eq_refl: "x = y \<Longrightarrow> x \<le> y"
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   134
    -- {* This form is useful with the classical reasoner. *}
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   135
by (erule ssubst) (rule order_refl)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   136
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   137
lemma less_irrefl [iff]: "\<not> x < x"
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   138
by (simp add: less_le_not_le)
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   139
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   140
lemma less_imp_le: "x < y \<Longrightarrow> x \<le> y"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   141
unfolding less_le_not_le by blast
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   142
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   143
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   144
text {* Asymmetry. *}
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   145
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   146
lemma less_not_sym: "x < y \<Longrightarrow> \<not> (y < x)"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   147
by (simp add: less_le_not_le)
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   148
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   149
lemma less_asym: "x < y \<Longrightarrow> (\<not> P \<Longrightarrow> y < x) \<Longrightarrow> P"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   150
by (drule less_not_sym, erule contrapos_np) simp
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   151
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   152
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   153
text {* Transitivity. *}
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   154
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   155
lemma less_trans: "x < y \<Longrightarrow> y < z \<Longrightarrow> x < z"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   156
by (auto simp add: less_le_not_le intro: order_trans) 
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   157
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   158
lemma le_less_trans: "x \<le> y \<Longrightarrow> y < z \<Longrightarrow> x < z"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   159
by (auto simp add: less_le_not_le intro: order_trans) 
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   160
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   161
lemma less_le_trans: "x < y \<Longrightarrow> y \<le> z \<Longrightarrow> x < z"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   162
by (auto simp add: less_le_not_le intro: order_trans) 
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   163
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   164
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   165
text {* Useful for simplification, but too risky to include by default. *}
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   166
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   167
lemma less_imp_not_less: "x < y \<Longrightarrow> (\<not> y < x) \<longleftrightarrow> True"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   168
by (blast elim: less_asym)
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   169
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   170
lemma less_imp_triv: "x < y \<Longrightarrow> (y < x \<longrightarrow> P) \<longleftrightarrow> True"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   171
by (blast elim: less_asym)
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   172
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   173
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   174
text {* Transitivity rules for calculational reasoning *}
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   175
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   176
lemma less_asym': "a < b \<Longrightarrow> b < a \<Longrightarrow> P"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   177
by (rule less_asym)
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   178
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   179
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   180
text {* Dual order *}
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   181
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   182
lemma dual_preorder:
36635
080b755377c0 locale predicates of classes carry a mandatory "class" prefix
haftmann
parents: 35828
diff changeset
   183
  "class.preorder (op \<ge>) (op >)"
28823
dcbef866c9e2 tuned unfold_locales invocation
haftmann
parents: 28685
diff changeset
   184
proof qed (auto simp add: less_le_not_le intro: order_trans)
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   185
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   186
end
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   187
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   188
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   189
subsection {* Partial orders *}
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   190
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   191
class order = preorder +
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   192
  assumes antisym: "x \<le> y \<Longrightarrow> y \<le> x \<Longrightarrow> x = y"
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   193
begin
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   194
51487
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
   195
lemma less_le: "x < y \<longleftrightarrow> x \<le> y \<and> x \<noteq> y"
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
   196
  by (auto simp add: less_le_not_le intro: antisym)
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
   197
54868
bab6cade3cc5 prefer target-style syntaxx for sublocale
haftmann
parents: 54861
diff changeset
   198
sublocale order!: ordering less_eq less +  dual_order!: ordering greater_eq greater
51487
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
   199
  by default (auto intro: antisym order_trans simp add: less_le)
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
   200
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
   201
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
   202
text {* Reflexivity. *}
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   203
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   204
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
   205
    -- {* NOT suitable for iff, since it can cause PROOF FAILED. *}
51546
2e26df807dc7 more uniform style for interpretation and sublocale declarations
haftmann
parents: 51487
diff changeset
   206
by (fact order.order_iff_strict)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   207
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   208
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
   209
unfolding less_le by blast
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   210
21329
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   211
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   212
text {* Useful for simplification, but too risky to include by default. *}
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   213
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   214
lemma less_imp_not_eq: "x < y \<Longrightarrow> (x = y) \<longleftrightarrow> False"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   215
by auto
21329
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   216
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   217
lemma less_imp_not_eq2: "x < y \<Longrightarrow> (y = x) \<longleftrightarrow> False"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   218
by auto
21329
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   219
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   220
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   221
text {* Transitivity rules for calculational reasoning *}
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   222
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   223
lemma neq_le_trans: "a \<noteq> b \<Longrightarrow> a \<le> b \<Longrightarrow> a < b"
51546
2e26df807dc7 more uniform style for interpretation and sublocale declarations
haftmann
parents: 51487
diff changeset
   224
by (fact order.not_eq_order_implies_strict)
21329
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   225
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   226
lemma le_neq_trans: "a \<le> b \<Longrightarrow> a \<noteq> b \<Longrightarrow> a < b"
51546
2e26df807dc7 more uniform style for interpretation and sublocale declarations
haftmann
parents: 51487
diff changeset
   227
by (rule order.not_eq_order_implies_strict)
21329
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   228
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   229
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   230
text {* Asymmetry. *}
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   231
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   232
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
   233
by (blast intro: antisym)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   234
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   235
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
   236
by (blast intro: antisym)
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   237
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   238
lemma less_imp_neq: "x < y \<Longrightarrow> x \<noteq> y"
51546
2e26df807dc7 more uniform style for interpretation and sublocale declarations
haftmann
parents: 51487
diff changeset
   239
by (fact order.strict_implies_not_eq)
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   240
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   241
27107
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   242
text {* Least value operator *}
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   243
27299
3447cd2e18e8 streamlined definitions
haftmann
parents: 27107
diff changeset
   244
definition (in ord)
27107
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   245
  Least :: "('a \<Rightarrow> bool) \<Rightarrow> 'a" (binder "LEAST " 10) where
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   246
  "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
   247
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   248
lemma Least_equality:
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   249
  assumes "P x"
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   250
    and "\<And>y. P y \<Longrightarrow> x \<le> y"
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   251
  shows "Least P = x"
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   252
unfolding Least_def by (rule the_equality)
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   253
  (blast intro: assms antisym)+
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   254
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   255
lemma LeastI2_order:
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   256
  assumes "P x"
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   257
    and "\<And>y. P y \<Longrightarrow> x \<le> y"
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   258
    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
   259
  shows "Q (Least P)"
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   260
unfolding Least_def by (rule theI2)
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   261
  (blast intro: assms antisym)+
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   262
4a7415c67063 localized Least in Orderings.thy
haftmann
parents: 26796
diff changeset
   263
26014
00c2c3525bef dual orders and dual lattices
haftmann
parents: 25614
diff changeset
   264
text {* Dual order *}
22916
haftmann
parents: 22886
diff changeset
   265
26014
00c2c3525bef dual orders and dual lattices
haftmann
parents: 25614
diff changeset
   266
lemma dual_order:
36635
080b755377c0 locale predicates of classes carry a mandatory "class" prefix
haftmann
parents: 35828
diff changeset
   267
  "class.order (op \<ge>) (op >)"
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   268
by (intro_locales, rule dual_preorder) (unfold_locales, rule antisym)
22916
haftmann
parents: 22886
diff changeset
   269
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   270
end
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   271
21329
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   272
56545
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   273
text {* Alternative introduction rule with bias towards strict order *}
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   274
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   275
lemma order_strictI:
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   276
  fixes less (infix "\<sqsubset>" 50)
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   277
    and less_eq (infix "\<sqsubseteq>" 50)
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   278
  assumes less_eq_less: "\<And>a b. a \<sqsubseteq> b \<longleftrightarrow> a \<sqsubset> b \<or> a = b"
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   279
    assumes asym: "\<And>a b. a \<sqsubset> b \<Longrightarrow> \<not> b \<sqsubset> a"
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   280
  assumes irrefl: "\<And>a. \<not> a \<sqsubset> a"
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   281
  assumes trans: "\<And>a b c. a \<sqsubset> b \<Longrightarrow> b \<sqsubset> c \<Longrightarrow> a \<sqsubset> c"
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   282
  shows "class.order less_eq less"
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   283
proof
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   284
  fix a b
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   285
  show "a \<sqsubset> b \<longleftrightarrow> a \<sqsubseteq> b \<and> \<not> b \<sqsubseteq> a"
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   286
    by (auto simp add: less_eq_less asym irrefl)
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   287
next
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   288
  fix a
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   289
  show "a \<sqsubseteq> a"
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   290
    by (auto simp add: less_eq_less)
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   291
next
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   292
  fix a b c
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   293
  assume "a \<sqsubseteq> b" and "b \<sqsubseteq> c" then show "a \<sqsubseteq> c"
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   294
    by (auto simp add: less_eq_less intro: trans)
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   295
next
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   296
  fix a b
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   297
  assume "a \<sqsubseteq> b" and "b \<sqsubseteq> a" then show "a = b"
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   298
    by (auto simp add: less_eq_less asym)
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   299
qed
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   300
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   301
21329
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   302
subsection {* Linear (total) orders *}
7338206d75f1 introduces preorders
haftmann
parents: 21259
diff changeset
   303
22316
f662831459de added class "preorder"
haftmann
parents: 22295
diff changeset
   304
class linorder = order +
25207
d58c14280367 dropped square syntax
haftmann
parents: 25193
diff changeset
   305
  assumes linear: "x \<le> y \<or> y \<le> x"
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   306
begin
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   307
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   308
lemma less_linear: "x < y \<or> x = y \<or> y < x"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   309
unfolding less_le using less_le linear by blast
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   310
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   311
lemma le_less_linear: "x \<le> y \<or> y < x"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   312
by (simp add: le_less less_linear)
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   313
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   314
lemma le_cases [case_names le ge]:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   315
  "(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
   316
using linear by blast
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   317
22384
33a46e6c7f04 prefix of class interpretation not mandatory any longer
haftmann
parents: 22377
diff changeset
   318
lemma linorder_cases [case_names less equal greater]:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   319
  "(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
   320
using less_linear by blast
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   321
57447
87429bdecad5 import more stuff from the CLT proof; base the lborel measure on interval_measure; remove lebesgue measure
hoelzl
parents: 56545
diff changeset
   322
lemma linorder_wlog[case_names le sym]:
87429bdecad5 import more stuff from the CLT proof; base the lborel measure on interval_measure; remove lebesgue measure
hoelzl
parents: 56545
diff changeset
   323
  "(\<And>a b. a \<le> b \<Longrightarrow> P a b) \<Longrightarrow> (\<And>a b. P b a \<Longrightarrow> P a b) \<Longrightarrow> P a b"
87429bdecad5 import more stuff from the CLT proof; base the lborel measure on interval_measure; remove lebesgue measure
hoelzl
parents: 56545
diff changeset
   324
  by (cases rule: le_cases[of a b]) blast+
87429bdecad5 import more stuff from the CLT proof; base the lborel measure on interval_measure; remove lebesgue measure
hoelzl
parents: 56545
diff changeset
   325
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   326
lemma not_less: "\<not> x < y \<longleftrightarrow> y \<le> x"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   327
apply (simp add: less_le)
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   328
using linear apply (blast intro: antisym)
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   329
done
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   330
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   331
lemma not_less_iff_gr_or_eq:
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   332
 "\<not>(x < y) \<longleftrightarrow> (x > y | x = y)"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   333
apply(simp add:not_less le_less)
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   334
apply blast
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   335
done
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   336
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   337
lemma not_le: "\<not> x \<le> y \<longleftrightarrow> y < x"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   338
apply (simp add: less_le)
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   339
using linear apply (blast intro: antisym)
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   340
done
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   341
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   342
lemma neq_iff: "x \<noteq> y \<longleftrightarrow> x < y \<or> y < x"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   343
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
   344
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   345
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
   346
by (simp add: neq_iff) blast
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   347
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   348
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
   349
by (blast intro: antisym dest: not_less [THEN iffD1])
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   350
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   351
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
   352
by (blast intro: antisym dest: not_less [THEN iffD1])
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   353
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   354
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
   355
by (blast intro: antisym dest: not_less [THEN iffD1])
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   356
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   357
lemma leI: "\<not> x < y \<Longrightarrow> y \<le> x"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   358
unfolding not_less .
16796
140f1e0ea846 generlization of some "nat" theorems
paulson
parents: 16743
diff changeset
   359
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   360
lemma leD: "y \<le> x \<Longrightarrow> \<not> x < y"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   361
unfolding not_less .
16796
140f1e0ea846 generlization of some "nat" theorems
paulson
parents: 16743
diff changeset
   362
140f1e0ea846 generlization of some "nat" theorems
paulson
parents: 16743
diff changeset
   363
(*FIXME inappropriate name (or delete altogether)*)
25062
af5ef0d4d655 global class syntax
haftmann
parents: 24920
diff changeset
   364
lemma not_leE: "\<not> y \<le> x \<Longrightarrow> x < y"
23212
82881b1ae9c6 tuned list comprehension, added lemma
nipkow
parents: 23182
diff changeset
   365
unfolding not_le .
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   366
26014
00c2c3525bef dual orders and dual lattices
haftmann
parents: 25614
diff changeset
   367
text {* Dual order *}
22916
haftmann
parents: 22886
diff changeset
   368
26014
00c2c3525bef dual orders and dual lattices
haftmann
parents: 25614
diff changeset
   369
lemma dual_linorder:
36635
080b755377c0 locale predicates of classes carry a mandatory "class" prefix
haftmann
parents: 35828
diff changeset
   370
  "class.linorder (op \<ge>) (op >)"
080b755377c0 locale predicates of classes carry a mandatory "class" prefix
haftmann
parents: 35828
diff changeset
   371
by (rule class.linorder.intro, rule dual_order) (unfold_locales, rule linear)
22916
haftmann
parents: 22886
diff changeset
   372
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   373
end
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   374
23948
261bd4678076 using class target
haftmann
parents: 23881
diff changeset
   375
56545
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   376
text {* Alternative introduction rule with bias towards strict order *}
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   377
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   378
lemma linorder_strictI:
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   379
  fixes less (infix "\<sqsubset>" 50)
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   380
    and less_eq (infix "\<sqsubseteq>" 50)
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   381
  assumes "class.order less_eq less"
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   382
  assumes trichotomy: "\<And>a b. a \<sqsubset> b \<or> a = b \<or> b \<sqsubset> a"
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   383
  shows "class.linorder less_eq less"
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   384
proof -
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   385
  interpret order less_eq less
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   386
    by (fact `class.order less_eq less`)
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   387
  show ?thesis
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   388
  proof
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   389
    fix a b
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   390
    show "a \<sqsubseteq> b \<or> b \<sqsubseteq> a"
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   391
      using trichotomy by (auto simp add: le_less)
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   392
  qed
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   393
qed
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   394
8f1e7596deb7 more operations and lemmas
haftmann
parents: 56509
diff changeset
   395
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   396
subsection {* Reasoning tools setup *}
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   397
21091
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   398
ML {*
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   399
signature ORDERS =
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   400
sig
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   401
  val print_structures: Proof.context -> unit
32215
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31998
diff changeset
   402
  val order_tac: Proof.context -> thm list -> int -> tactic
58826
2ed2eaabe3df modernized setup;
wenzelm
parents: 57447
diff changeset
   403
  val add_struct: string * term list -> string -> attribute
2ed2eaabe3df modernized setup;
wenzelm
parents: 57447
diff changeset
   404
  val del_struct: string * term list -> attribute
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   405
end;
21091
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   406
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   407
structure Orders: ORDERS =
21248
3fd22b0939ff abstract ordering theories
haftmann
parents: 21216
diff changeset
   408
struct
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   409
56508
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   410
(* context data *)
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   411
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   412
fun struct_eq ((s1: string, ts1), (s2, ts2)) =
56508
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   413
  s1 = s2 andalso eq_list (op aconv) (ts1, ts2);
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   414
33519
e31a85f92ce9 adapted Generic_Data, Proof_Data;
wenzelm
parents: 32960
diff changeset
   415
structure Data = Generic_Data
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   416
(
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   417
  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
   418
    (* Order structures:
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   419
       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
   420
       needed to set up the transitivity reasoner,
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   421
       identifier and operations identify the structure uniquely. *)
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   422
  val empty = [];
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   423
  val extend = I;
33519
e31a85f92ce9 adapted Generic_Data, Proof_Data;
wenzelm
parents: 32960
diff changeset
   424
  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
   425
);
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   426
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   427
fun print_structures ctxt =
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   428
  let
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   429
    val structs = Data.get (Context.Proof ctxt);
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   430
    fun pretty_term t = Pretty.block
24920
2a45e400fdad generic Syntax.pretty/string_of operations;
wenzelm
parents: 24867
diff changeset
   431
      [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
   432
        Pretty.str "::", Pretty.brk 1,
24920
2a45e400fdad generic Syntax.pretty/string_of operations;
wenzelm
parents: 24867
diff changeset
   433
        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
   434
    fun pretty_struct ((s, ts), _) = Pretty.block
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   435
      [Pretty.str s, Pretty.str ":", Pretty.brk 1,
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   436
       Pretty.enclose "(" ")" (Pretty.breaks (map pretty_term ts))];
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   437
  in
51579
ec3b78ce0758 tuned message;
wenzelm
parents: 51546
diff changeset
   438
    Pretty.writeln (Pretty.big_list "order structures:" (map pretty_struct structs))
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   439
  end;
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   440
56508
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   441
val _ =
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   442
  Outer_Syntax.improper_command @{command_spec "print_orders"}
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   443
    "print order structures available to transitivity reasoner"
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   444
    (Scan.succeed (Toplevel.unknown_context o
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   445
      Toplevel.keep (print_structures o Toplevel.context_of)));
21091
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   446
56508
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   447
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   448
(* tactics *)
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   449
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   450
fun struct_tac ((s, ops), thms) ctxt facts =
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   451
  let
56508
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   452
    val [eq, le, less] = ops;
30107
f3b3b0e3d184 Fixed nonexhaustive match problem in decomp, to make it fail more gracefully
berghofe
parents: 29823
diff changeset
   453
    fun decomp thy (@{const Trueprop} $ t) =
56508
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   454
          let
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   455
            fun excluded t =
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   456
              (* exclude numeric types: linear arithmetic subsumes transitivity *)
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   457
              let val T = type_of t
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   458
              in
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   459
                T = HOLogic.natT orelse T = HOLogic.intT orelse T = HOLogic.realT
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   460
              end;
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   461
            fun rel (bin_op $ t1 $ t2) =
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   462
                  if excluded t1 then NONE
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   463
                  else if Pattern.matches thy (eq, bin_op) then SOME (t1, "=", t2)
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   464
                  else if Pattern.matches thy (le, bin_op) then SOME (t1, "<=", t2)
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   465
                  else if Pattern.matches thy (less, bin_op) then SOME (t1, "<", t2)
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   466
                  else NONE
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   467
              | rel _ = NONE;
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   468
            fun dec (Const (@{const_name Not}, _) $ t) =
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   469
                  (case rel t of NONE =>
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   470
                    NONE
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   471
                  | SOME (t1, rel, t2) => SOME (t1, "~" ^ rel, t2))
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   472
              | dec x = rel x;
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   473
          in dec t end
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   474
      | decomp _ _ = NONE;
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   475
  in
56508
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   476
    (case s of
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   477
      "order" => Order_Tac.partial_tac decomp thms ctxt facts
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   478
    | "linorder" => Order_Tac.linear_tac decomp thms ctxt facts
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   479
    | _ => error ("Unknown order kind " ^ quote s ^ " encountered in transitivity reasoner"))
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   480
  end
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   481
56508
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   482
fun order_tac ctxt facts =
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   483
  FIRST' (map (fn s => CHANGED o struct_tac s ctxt facts) (Data.get (Context.Proof ctxt)));
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   484
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   485
56508
af08160c5a4c misc tuning;
wenzelm
parents: 56020
diff changeset
   486
(* attributes *)
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   487
58826
2ed2eaabe3df modernized setup;
wenzelm
parents: 57447
diff changeset
   488
fun add_struct s tag =
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   489
  Thm.declaration_attribute
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   490
    (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
   491
fun del_struct s =
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   492
  Thm.declaration_attribute
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   493
    (fn _ => Data.map (AList.delete struct_eq s));
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   494
21091
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   495
end;
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   496
*}
5061e3e56484 cleanup in ML setup code
haftmann
parents: 21083
diff changeset
   497
58826
2ed2eaabe3df modernized setup;
wenzelm
parents: 57447
diff changeset
   498
attribute_setup order = {*
2ed2eaabe3df modernized setup;
wenzelm
parents: 57447
diff changeset
   499
  Scan.lift ((Args.add -- Args.name >> (fn (_, s) => SOME s) || Args.del >> K NONE) --|
2ed2eaabe3df modernized setup;
wenzelm
parents: 57447
diff changeset
   500
    Args.colon (* FIXME || Scan.succeed true *) ) -- Scan.lift Args.name --
2ed2eaabe3df modernized setup;
wenzelm
parents: 57447
diff changeset
   501
    Scan.repeat Args.term
2ed2eaabe3df modernized setup;
wenzelm
parents: 57447
diff changeset
   502
    >> (fn ((SOME tag, n), ts) => Orders.add_struct (n, ts) tag
2ed2eaabe3df modernized setup;
wenzelm
parents: 57447
diff changeset
   503
         | ((NONE, n), ts) => Orders.del_struct (n, ts))
2ed2eaabe3df modernized setup;
wenzelm
parents: 57447
diff changeset
   504
*} "theorems controlling transitivity reasoner"
2ed2eaabe3df modernized setup;
wenzelm
parents: 57447
diff changeset
   505
47432
e1576d13e933 more standard method setup;
wenzelm
parents: 46976
diff changeset
   506
method_setup order = {*
e1576d13e933 more standard method setup;
wenzelm
parents: 46976
diff changeset
   507
  Scan.succeed (fn ctxt => SIMPLE_METHOD' (Orders.order_tac ctxt []))
e1576d13e933 more standard method setup;
wenzelm
parents: 46976
diff changeset
   508
*} "transitivity reasoner"
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   509
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   510
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   511
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
   512
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   513
context order
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   514
begin
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   515
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   516
(* 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
   517
   is not a parameter of the locale. *)
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   518
27689
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   519
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
   520
  
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   521
declare order_refl  [order add le_refl: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   522
  
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   523
declare less_imp_le [order add less_imp_le: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   524
  
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   525
declare antisym [order add eqI: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   526
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   527
declare eq_refl [order add eqD1: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   528
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   529
declare sym [THEN eq_refl, order add eqD2: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   530
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   531
declare less_trans [order add less_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   532
  
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   533
declare less_le_trans [order add less_le_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   534
  
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   535
declare le_less_trans [order add le_less_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   536
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   537
declare order_trans [order add le_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   538
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   539
declare le_neq_trans [order add le_neq_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   540
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   541
declare neq_le_trans [order add neq_le_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   542
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   543
declare less_imp_neq [order add less_imp_neq: order "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   544
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   545
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
   546
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   547
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
   548
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   549
end
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   550
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   551
context linorder
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   552
begin
24641
448edc627ee4 Transitivity reasoner set up for locales order and linorder.
ballarin
parents: 24422
diff changeset
   553
27689
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   554
declare [[order del: order "op = :: 'a => 'a => bool" "op <=" "op <"]]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   555
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   556
declare less_irrefl [THEN notE, order add less_reflE: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   557
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   558
declare order_refl [order add le_refl: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   559
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   560
declare less_imp_le [order add less_imp_le: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   561
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   562
declare not_less [THEN iffD2, order add not_lessI: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   563
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   564
declare not_le [THEN iffD2, order add not_leI: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   565
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   566
declare not_less [THEN iffD1, order add not_lessD: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   567
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   568
declare not_le [THEN iffD1, order add not_leD: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   569
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   570
declare antisym [order add eqI: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   571
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   572
declare eq_refl [order add eqD1: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   573
27689
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   574
declare sym [THEN eq_refl, order add eqD2: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   575
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   576
declare less_trans [order add less_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   577
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   578
declare less_le_trans [order add less_le_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   579
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   580
declare le_less_trans [order add le_less_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   581
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   582
declare order_trans [order add le_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   583
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   584
declare le_neq_trans [order add le_neq_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   585
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   586
declare neq_le_trans [order add neq_le_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   587
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   588
declare less_imp_neq [order add less_imp_neq: linorder "op = :: 'a => 'a => bool" "op <=" "op <"]
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   589
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   590
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
   591
268a7d02cf7a declare
haftmann
parents: 27682
diff changeset
   592
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
   593
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   594
end
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
   595
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   596
setup {*
56509
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   597
  map_theory_simpset (fn ctxt0 => ctxt0 addSolver
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   598
    mk_solver "Transitivity" (fn ctxt => Orders.order_tac ctxt (Simplifier.prems_of ctxt)))
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   599
  (*Adding the transitivity reasoners also as safe solvers showed a slight
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   600
    speed up, but the reasoning strength appears to be not higher (at least
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   601
    no breaking of additional proofs in the entire HOL distribution, as
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   602
    of 5 March 2004, was observed).*)
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   603
*}
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   604
56509
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   605
ML {*
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   606
local
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   607
  fun prp t thm = Thm.prop_of thm = t;  (* FIXME proper aconv!? *)
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   608
in
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   609
56509
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   610
fun antisym_le_simproc ctxt ct =
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   611
  (case term_of ct of
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   612
    (le as Const (_, T)) $ r $ s =>
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   613
     (let
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   614
        val prems = Simplifier.prems_of ctxt;
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   615
        val less = Const (@{const_name less}, T);
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   616
        val t = HOLogic.mk_Trueprop(le $ s $ r);
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   617
      in
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   618
        (case find_first (prp t) prems of
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   619
          NONE =>
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   620
            let val t = HOLogic.mk_Trueprop(HOLogic.Not $ (less $ r $ s)) in
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   621
              (case find_first (prp t) prems of
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   622
                NONE => NONE
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   623
              | SOME thm => SOME(mk_meta_eq(thm RS @{thm linorder_class.antisym_conv1})))
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   624
             end
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   625
         | SOME thm => SOME (mk_meta_eq (thm RS @{thm order_class.antisym_conv})))
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   626
      end handle THM _ => NONE)
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   627
  | _ => NONE);
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   628
56509
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   629
fun antisym_less_simproc ctxt ct =
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   630
  (case term_of ct of
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   631
    NotC $ ((less as Const(_,T)) $ r $ s) =>
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   632
     (let
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   633
       val prems = Simplifier.prems_of ctxt;
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   634
       val le = Const (@{const_name less_eq}, T);
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   635
       val t = HOLogic.mk_Trueprop(le $ r $ s);
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   636
      in
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   637
        (case find_first (prp t) prems of
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   638
          NONE =>
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   639
            let val t = HOLogic.mk_Trueprop (NotC $ (less $ s $ r)) in
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   640
              (case find_first (prp t) prems of
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   641
                NONE => NONE
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   642
              | SOME thm => SOME (mk_meta_eq(thm RS @{thm linorder_class.antisym_conv3})))
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   643
            end
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   644
        | SOME thm => SOME (mk_meta_eq (thm RS @{thm linorder_class.antisym_conv2})))
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   645
      end handle THM _ => NONE)
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   646
  | _ => NONE);
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   647
56509
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   648
end;
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   649
*}
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   650
56509
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   651
simproc_setup antisym_le ("(x::'a::order) \<le> y") = "K antisym_le_simproc"
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   652
simproc_setup antisym_less ("\<not> (x::'a::linorder) < y") = "K antisym_less_simproc"
e050d42dc21d modernized simproc_setup;
wenzelm
parents: 56508
diff changeset
   653
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
diff changeset
   654
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   655
subsection {* Bounded quantifiers *}
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   656
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   657
syntax
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   658
  "_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
   659
  "_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
   660
  "_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
   661
  "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3EX _<=_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   662
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   663
  "_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
   664
  "_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
   665
  "_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
   666
  "_Ex_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3EX _>=_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   667
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   668
syntax (xsymbols)
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   669
  "_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
   670
  "_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
   671
  "_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
   672
  "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<le>_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   673
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   674
  "_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
   675
  "_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
   676
  "_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
   677
  "_Ex_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<ge>_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   678
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   679
syntax (HOL)
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   680
  "_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
   681
  "_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
   682
  "_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
   683
  "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3? _<=_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   684
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   685
syntax (HTML output)
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   686
  "_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
   687
  "_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
   688
  "_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
   689
  "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<le>_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   690
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   691
  "_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
   692
  "_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
   693
  "_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
   694
  "_Ex_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<ge>_./ _)" [0, 0, 10] 10)
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   695
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   696
translations
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   697
  "ALL x<y. P"   =>  "ALL x. x < y \<longrightarrow> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   698
  "EX x<y. P"    =>  "EX x. x < y \<and> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   699
  "ALL x<=y. P"  =>  "ALL x. x <= y \<longrightarrow> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   700
  "EX x<=y. P"   =>  "EX x. x <= y \<and> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   701
  "ALL x>y. P"   =>  "ALL x. x > y \<longrightarrow> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   702
  "EX x>y. P"    =>  "EX x. x > y \<and> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   703
  "ALL x>=y. P"  =>  "ALL x. x >= y \<longrightarrow> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   704
  "EX x>=y. P"   =>  "EX x. x >= y \<and> P"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   705
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   706
print_translation {*
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   707
let
42287
d98eb048a2e4 discontinued special treatment of structure Mixfix;
wenzelm
parents: 42284
diff changeset
   708
  val All_binder = Mixfix.binder_name @{const_syntax All};
d98eb048a2e4 discontinued special treatment of structure Mixfix;
wenzelm
parents: 42284
diff changeset
   709
  val Ex_binder = Mixfix.binder_name @{const_syntax Ex};
38786
e46e7a9cb622 formerly unnamed infix impliciation now named HOL.implies
haftmann
parents: 38715
diff changeset
   710
  val impl = @{const_syntax HOL.implies};
38795
848be46708dc formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents: 38786
diff changeset
   711
  val conj = @{const_syntax HOL.conj};
22916
haftmann
parents: 22886
diff changeset
   712
  val less = @{const_syntax less};
haftmann
parents: 22886
diff changeset
   713
  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
   714
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   715
  val trans =
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   716
   [((All_binder, impl, less),
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   717
    (@{syntax_const "_All_less"}, @{syntax_const "_All_greater"})),
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   718
    ((All_binder, impl, less_eq),
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   719
    (@{syntax_const "_All_less_eq"}, @{syntax_const "_All_greater_eq"})),
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   720
    ((Ex_binder, conj, less),
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   721
    (@{syntax_const "_Ex_less"}, @{syntax_const "_Ex_greater"})),
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   722
    ((Ex_binder, conj, less_eq),
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   723
    (@{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
   724
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   725
  fun matches_bound v t =
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   726
    (case t of
35364
b8c62d60195c more antiquotations;
wenzelm
parents: 35301
diff changeset
   727
      Const (@{syntax_const "_bound"}, _) $ Free (v', _) => v = v'
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   728
    | _ => false);
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   729
  fun contains_var v = Term.exists_subterm (fn Free (x, _) => x = v | _ => false);
49660
de49d9b4d7bc more explicit Syntax_Trans.mark_bound_abs/mark_bound_body: preserve type information for show_markup;
wenzelm
parents: 48891
diff changeset
   730
  fun mk x c n P = Syntax.const c $ Syntax_Trans.mark_bound_body x $ n $ P;
21180
f27f12bcafb8 fixed print_translation for ALL/EX and <, <=, etc.; tuned syntax names;
wenzelm
parents: 21091
diff changeset
   731
52143
36ffe23b25f8 syntax translations always depend on context;
wenzelm
parents: 51717
diff changeset
   732
  fun tr' q = (q, fn _ =>
36ffe23b25f8 syntax translations always depend on context;
wenzelm
parents: 51717
diff changeset
   733
    (fn [Const (@{syntax_const "_bound"}, _) $ Free (v, T),
35364
b8c62d60195c more antiquotations;
wenzelm
parents: 35301
diff changeset
   734
        Const (c, _) $ (Const (d, _) $ t $ u) $ P] =>
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   735
        (case AList.lookup (op =) trans (q, c, d) of
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   736
          NONE => raise Match
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   737
        | SOME (l, g) =>
49660
de49d9b4d7bc more explicit Syntax_Trans.mark_bound_abs/mark_bound_body: preserve type information for show_markup;
wenzelm
parents: 48891
diff changeset
   738
            if matches_bound v t andalso not (contains_var v u) then mk (v, T) l u P
de49d9b4d7bc more explicit Syntax_Trans.mark_bound_abs/mark_bound_body: preserve type information for show_markup;
wenzelm
parents: 48891
diff changeset
   739
            else if matches_bound v u andalso not (contains_var v t) then mk (v, T) g t P
35115
446c5063e4fd modernized translations;
wenzelm
parents: 35092
diff changeset
   740
            else raise Match)
52143
36ffe23b25f8 syntax translations always depend on context;
wenzelm
parents: 51717
diff changeset
   741
      | _ => raise Match));
21524
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21412
diff changeset
   742
in [tr' All_binder, tr' Ex_binder] end
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   743
*}
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   744
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   745
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   746
subsection {* Transitivity reasoning *}
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   747
25193
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   748
context ord
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   749
begin
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   750
25193
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   751
lemma ord_le_eq_trans: "a \<le> b \<Longrightarrow> b = c \<Longrightarrow> a \<le> c"
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   752
  by (rule subst)
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   753
25193
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   754
lemma ord_eq_le_trans: "a = b \<Longrightarrow> b \<le> c \<Longrightarrow> a \<le> c"
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   755
  by (rule ssubst)
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   756
25193
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   757
lemma ord_less_eq_trans: "a < b \<Longrightarrow> b = c \<Longrightarrow> a < c"
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   758
  by (rule subst)
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   759
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   760
lemma ord_eq_less_trans: "a = b \<Longrightarrow> b < c \<Longrightarrow> a < c"
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   761
  by (rule ssubst)
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   762
e2e1a4b00de3 various localizations
haftmann
parents: 25103
diff changeset
   763
end
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   764
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   765
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
   766
  (!!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
   767
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   768
  assume r: "!!x y. x < y ==> f x < f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   769
  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
   770
  also assume "f b < c"
34250
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
   771
  finally (less_trans) show ?thesis .
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   772
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   773
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   774
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
   775
  (!!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
   776
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   777
  assume r: "!!x y. x < y ==> f x < f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   778
  assume "a < f b"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   779
  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
   780
  finally (less_trans) show ?thesis .
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   781
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   782
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   783
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
   784
  (!!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
   785
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   786
  assume r: "!!x y. x <= y ==> f x <= f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   787
  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
   788
  also assume "f b < c"
34250
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
   789
  finally (le_less_trans) show ?thesis .
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   790
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   791
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   792
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
   793
  (!!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
   794
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   795
  assume r: "!!x y. x < y ==> f x < f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   796
  assume "a <= f b"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   797
  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
   798
  finally (le_less_trans) show ?thesis .
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   799
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   800
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   801
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
   802
  (!!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
   803
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   804
  assume r: "!!x y. x < y ==> f x < f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   805
  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
   806
  also assume "f b <= c"
34250
3b619abaa67a moved name duplicates to end of theory; reduced warning noise
haftmann
parents: 34065
diff changeset
   807
  finally (less_le_trans) show ?thesis .
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   808
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   809
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   810
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
   811
  (!!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
   812
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   813
  assume r: "!!x y. x <= y ==> f x <= f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   814
  assume "a < f b"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   815
  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
   816
  finally (less_le_trans) show ?thesis .
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   817
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   818
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   819
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
   820
  (!!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
   821
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   822
  assume r: "!!x y. x <= y ==> f x <= f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   823
  assume "a <= f b"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   824
  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
   825
  finally (order_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   826
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   827
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   828
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
   829
  (!!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
   830
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   831
  assume r: "!!x y. x <= y ==> f x <= f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   832
  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
   833
  also assume "f b <= c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   834
  finally (order_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   835
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   836
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   837
lemma ord_le_eq_subst: "a <= b ==> f b = c ==>
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   838
  (!!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
   839
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   840
  assume r: "!!x y. x <= y ==> f x <= f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   841
  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
   842
  also assume "f b = c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   843
  finally (ord_le_eq_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   844
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   845
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   846
lemma ord_eq_le_subst: "a = f b ==> b <= c ==>
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   847
  (!!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
   848
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   849
  assume r: "!!x y. x <= y ==> f x <= f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   850
  assume "a = f b"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   851
  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
   852
  finally (ord_eq_le_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   853
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   854
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   855
lemma ord_less_eq_subst: "a < b ==> f b = c ==>
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   856
  (!!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
   857
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   858
  assume r: "!!x y. x < y ==> f x < f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   859
  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
   860
  also assume "f b = c"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   861
  finally (ord_less_eq_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   862
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   863
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   864
lemma ord_eq_less_subst: "a = f b ==> b < c ==>
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   865
  (!!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
   866
proof -
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   867
  assume r: "!!x y. x < y ==> f x < f y"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   868
  assume "a = f b"
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   869
  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
   870
  finally (ord_eq_less_trans) show ?thesis .
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   871
qed
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   872
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   873
text {*
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   874
  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
   875
*}
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   876
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   877
lemmas [trans] =
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   878
  order_less_subst2
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   879
  order_less_subst1
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   880
  order_le_less_subst2
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   881
  order_le_less_subst1
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   882
  order_less_le_subst2
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   883
  order_less_le_subst1
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   884
  order_subst2
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   885
  order_subst1
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   886
  ord_le_eq_subst
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   887
  ord_eq_le_subst
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   888
  ord_less_eq_subst
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   889
  ord_eq_less_subst
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   890
  forw_subst
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   891
  back_subst
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   892
  rev_mp
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   893
  mp
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   894
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   895
lemmas (in order) [trans] =
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   896
  neq_le_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   897
  le_neq_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   898
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   899
lemmas (in preorder) [trans] =
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   900
  less_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   901
  less_asym'
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   902
  le_less_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   903
  less_le_trans
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   904
  order_trans
27682
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   905
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   906
lemmas (in order) [trans] =
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   907
  antisym
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   908
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   909
lemmas (in ord) [trans] =
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   910
  ord_le_eq_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   911
  ord_eq_le_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   912
  ord_less_eq_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   913
  ord_eq_less_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   914
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   915
lemmas [trans] =
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   916
  trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   917
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   918
lemmas order_trans_rules =
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   919
  order_less_subst2
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   920
  order_less_subst1
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   921
  order_le_less_subst2
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   922
  order_le_less_subst1
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   923
  order_less_le_subst2
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   924
  order_less_le_subst1
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   925
  order_subst2
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   926
  order_subst1
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   927
  ord_le_eq_subst
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   928
  ord_eq_le_subst
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   929
  ord_less_eq_subst
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   930
  ord_eq_less_subst
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   931
  forw_subst
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   932
  back_subst
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   933
  rev_mp
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   934
  mp
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   935
  neq_le_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   936
  le_neq_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   937
  less_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   938
  less_asym'
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   939
  le_less_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   940
  less_le_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   941
  order_trans
25aceefd4786 added class preorder
haftmann
parents: 27299
diff changeset
   942
  antisym
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   943
  ord_le_eq_trans
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   944
  ord_eq_le_trans
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   945
  ord_less_eq_trans
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   946
  ord_eq_less_trans
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   947
  trans
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
   948
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   949
text {* These support proving chains of decreasing inequalities
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   950
    a >= b >= c ... in Isar proofs. *}
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   951
45221
3eadb9b6a055 mark "xt..." rules as "no_atp", since they are easy consequences of other better named properties
blanchet
parents: 44921
diff changeset
   952
lemma xt1 [no_atp]:
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   953
  "a = b ==> b > c ==> a > c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   954
  "a > b ==> b = c ==> a > c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   955
  "a = b ==> b >= c ==> a >= c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   956
  "a >= b ==> b = c ==> a >= c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   957
  "(x::'a::order) >= y ==> y >= x ==> x = y"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   958
  "(x::'a::order) >= y ==> y >= z ==> x >= z"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   959
  "(x::'a::order) > y ==> y >= z ==> x > z"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   960
  "(x::'a::order) >= y ==> y > z ==> x > z"
23417
wenzelm
parents: 23263
diff changeset
   961
  "(a::'a::order) > b ==> b > a ==> P"
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   962
  "(x::'a::order) > y ==> y > z ==> x > z"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   963
  "(a::'a::order) >= b ==> a ~= b ==> a > b"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   964
  "(a::'a::order) ~= b ==> a >= b ==> a > b"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   965
  "a = f b ==> b > c ==> (!!x y. x > y ==> f x > f y) ==> a > f c" 
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   966
  "a > b ==> f b = c ==> (!!x y. x > y ==> f x > f y) ==> f a > c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   967
  "a = f b ==> b >= c ==> (!!x y. x >= y ==> f x >= f y) ==> a >= f c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   968
  "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
   969
  by auto
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   970
45221
3eadb9b6a055 mark "xt..." rules as "no_atp", since they are easy consequences of other better named properties
blanchet
parents: 44921
diff changeset
   971
lemma xt2 [no_atp]:
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   972
  "(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
   973
by (subgoal_tac "f b >= f c", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   974
45221
3eadb9b6a055 mark "xt..." rules as "no_atp", since they are easy consequences of other better named properties
blanchet
parents: 44921
diff changeset
   975
lemma xt3 [no_atp]: "(a::'a::order) >= b ==> (f b::'b::order) >= c ==>
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   976
    (!!x y. x >= y ==> f x >= f y) ==> f a >= c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   977
by (subgoal_tac "f a >= f b", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   978
45221
3eadb9b6a055 mark "xt..." rules as "no_atp", since they are easy consequences of other better named properties
blanchet
parents: 44921
diff changeset
   979
lemma xt4 [no_atp]: "(a::'a::order) > f b ==> (b::'b::order) >= c ==>
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   980
  (!!x y. x >= y ==> f x >= f y) ==> a > f c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   981
by (subgoal_tac "f b >= f c", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   982
45221
3eadb9b6a055 mark "xt..." rules as "no_atp", since they are easy consequences of other better named properties
blanchet
parents: 44921
diff changeset
   983
lemma xt5 [no_atp]: "(a::'a::order) > b ==> (f b::'b::order) >= c==>
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   984
    (!!x y. x > y ==> f x > f y) ==> f a > c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   985
by (subgoal_tac "f a > f b", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   986
45221
3eadb9b6a055 mark "xt..." rules as "no_atp", since they are easy consequences of other better named properties
blanchet
parents: 44921
diff changeset
   987
lemma xt6 [no_atp]: "(a::'a::order) >= f b ==> b > c ==>
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   988
    (!!x y. x > y ==> f x > f y) ==> a > f c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   989
by (subgoal_tac "f b > f c", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   990
45221
3eadb9b6a055 mark "xt..." rules as "no_atp", since they are easy consequences of other better named properties
blanchet
parents: 44921
diff changeset
   991
lemma xt7 [no_atp]: "(a::'a::order) >= b ==> (f b::'b::order) > c ==>
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   992
    (!!x y. x >= y ==> f x >= f y) ==> f a > c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   993
by (subgoal_tac "f a >= f b", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   994
45221
3eadb9b6a055 mark "xt..." rules as "no_atp", since they are easy consequences of other better named properties
blanchet
parents: 44921
diff changeset
   995
lemma xt8 [no_atp]: "(a::'a::order) > f b ==> (b::'b::order) > c ==>
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   996
    (!!x y. x > y ==> f x > f y) ==> a > f c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   997
by (subgoal_tac "f b > f c", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
   998
45221
3eadb9b6a055 mark "xt..." rules as "no_atp", since they are easy consequences of other better named properties
blanchet
parents: 44921
diff changeset
   999
lemma xt9 [no_atp]: "(a::'a::order) > b ==> (f b::'b::order) > c ==>
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1000
    (!!x y. x > y ==> f x > f y) ==> f a > c"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1001
by (subgoal_tac "f a > f b", force, force)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1002
54147
97a8ff4e4ac9 killed most "no_atp", to make Sledgehammer more complete
blanchet
parents: 53216
diff changeset
  1003
lemmas xtrans = xt1 xt2 xt3 xt4 xt5 xt6 xt7 xt8 xt9
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1004
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1005
(* 
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1006
  Since "a >= b" abbreviates "b <= a", the abbreviation "..." stands
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1007
  for the wrong thing in an Isar proof.
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1008
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1009
  The extra transitivity rules can be used as follows: 
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1010
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1011
lemma "(a::'a::order) > z"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1012
proof -
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1013
  have "a >= b" (is "_ >= ?rhs")
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1014
    sorry
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1015
  also have "?rhs >= c" (is "_ >= ?rhs")
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1016
    sorry
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1017
  also (xtrans) have "?rhs = d" (is "_ = ?rhs")
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1018
    sorry
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1019
  also (xtrans) have "?rhs >= e" (is "_ >= ?rhs")
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1020
    sorry
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1021
  also (xtrans) have "?rhs > f" (is "_ > ?rhs")
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1022
    sorry
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1023
  also (xtrans) have "?rhs > z"
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1024
    sorry
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1025
  finally (xtrans) show ?thesis .
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1026
qed
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1027
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1028
  Alternatively, one can use "declare xtrans [trans]" and then
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1029
  leave out the "(xtrans)" above.
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1030
*)
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1031
23881
851c74f1bb69 moved class ord from Orderings.thy to HOL.thy
haftmann
parents: 23417
diff changeset
  1032
54860
69b3e46d8fbe tuned structure of min/max lemmas
haftmann
parents: 54857
diff changeset
  1033
subsection {* Monotonicity *}
21083
a1de02f047d0 cleaned up
haftmann
parents: 21044
diff changeset
  1034
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1035
context order
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1036
begin
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1037
30298
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1038
definition mono :: "('a \<Rightarrow> 'b\<Colon>order) \<Rightarrow> bool" where
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1039
  "mono f \<longleftrightarrow> (\<forall>x y. x \<le> y \<longrightarrow> f x \<le> f y)"
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1040
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1041
lemma monoI [intro?]:
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1042
  fixes f :: "'a \<Rightarrow> 'b\<Colon>order"
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1043
  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
  1044
  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
  1045
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1046
lemma monoD [dest?]:
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1047
  fixes f :: "'a \<Rightarrow> 'b\<Colon>order"
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1048
  shows "mono f \<Longrightarrow> x \<le> y \<Longrightarrow> f x \<le> f y"
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1049
  unfolding mono_def by iprover
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1050
51263
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1051
lemma monoE:
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1052
  fixes f :: "'a \<Rightarrow> 'b\<Colon>order"
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1053
  assumes "mono f"
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1054
  assumes "x \<le> y"
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1055
  obtains "f x \<le> f y"
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1056
proof
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1057
  from assms show "f x \<le> f y" by (simp add: mono_def)
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1058
qed
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1059
56020
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1060
definition antimono :: "('a \<Rightarrow> 'b\<Colon>order) \<Rightarrow> bool" where
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1061
  "antimono f \<longleftrightarrow> (\<forall>x y. x \<le> y \<longrightarrow> f x \<ge> f y)"
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1062
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1063
lemma antimonoI [intro?]:
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1064
  fixes f :: "'a \<Rightarrow> 'b\<Colon>order"
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1065
  shows "(\<And>x y. x \<le> y \<Longrightarrow> f x \<ge> f y) \<Longrightarrow> antimono f"
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1066
  unfolding antimono_def by iprover
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1067
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1068
lemma antimonoD [dest?]:
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1069
  fixes f :: "'a \<Rightarrow> 'b\<Colon>order"
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1070
  shows "antimono f \<Longrightarrow> x \<le> y \<Longrightarrow> f x \<ge> f y"
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1071
  unfolding antimono_def by iprover
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1072
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1073
lemma antimonoE:
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1074
  fixes f :: "'a \<Rightarrow> 'b\<Colon>order"
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1075
  assumes "antimono f"
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1076
  assumes "x \<le> y"
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1077
  obtains "f x \<ge> f y"
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1078
proof
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1079
  from assms show "f x \<ge> f y" by (simp add: antimono_def)
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1080
qed
f92479477c52 introduced antimono; incseq, decseq are now abbreviations for mono and antimono; renamed Library/Continuity to Library/Order_Continuity; removed up_cont; renamed down_cont to down_continuity and generalized to complete_lattices
hoelzl
parents: 54868
diff changeset
  1081
30298
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1082
definition strict_mono :: "('a \<Rightarrow> 'b\<Colon>order) \<Rightarrow> bool" where
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1083
  "strict_mono f \<longleftrightarrow> (\<forall>x y. x < y \<longrightarrow> f x < f y)"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1084
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1085
lemma strict_monoI [intro?]:
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1086
  assumes "\<And>x y. x < y \<Longrightarrow> f x < f y"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1087
  shows "strict_mono f"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1088
  using assms unfolding strict_mono_def by auto
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1089
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1090
lemma strict_monoD [dest?]:
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1091
  "strict_mono f \<Longrightarrow> x < y \<Longrightarrow> f x < f y"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1092
  unfolding strict_mono_def by auto
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1093
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1094
lemma strict_mono_mono [dest?]:
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1095
  assumes "strict_mono f"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1096
  shows "mono f"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1097
proof (rule monoI)
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1098
  fix x y
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1099
  assume "x \<le> y"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1100
  show "f x \<le> f y"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1101
  proof (cases "x = y")
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1102
    case True then show ?thesis by simp
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1103
  next
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1104
    case False with `x \<le> y` have "x < y" by simp
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1105
    with assms strict_monoD have "f x < f y" by auto
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1106
    then show ?thesis by simp
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1107
  qed
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1108
qed
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1109
25076
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1110
end
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1111
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1112
context linorder
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1113
begin
a50b36401c61 localized mono predicate
haftmann
parents: 25062
diff changeset
  1114
51263
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1115
lemma mono_invE:
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1116
  fixes f :: "'a \<Rightarrow> 'b\<Colon>order"
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1117
  assumes "mono f"
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1118
  assumes "f x < f y"
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1119
  obtains "x \<le> y"
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1120
proof
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1121
  show "x \<le> y"
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1122
  proof (rule ccontr)
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1123
    assume "\<not> x \<le> y"
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1124
    then have "y \<le> x" by simp
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1125
    with `mono f` obtain "f y \<le> f x" by (rule monoE)
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1126
    with `f x < f y` show False by simp
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1127
  qed
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1128
qed
31e786e0e6a7 turned example into library for comparing growth of functions
haftmann
parents: 49769
diff changeset
  1129
30298
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1130
lemma strict_mono_eq:
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1131
  assumes "strict_mono f"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1132
  shows "f x = f y \<longleftrightarrow> x = y"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1133
proof
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1134
  assume "f x = f y"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1135
  show "x = y" proof (cases x y rule: linorder_cases)
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1136
    case less with assms strict_monoD have "f x < f y" by auto
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1137
    with `f x = f y` show ?thesis by simp
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1138
  next
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1139
    case equal then show ?thesis .
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1140
  next
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1141
    case greater with assms strict_monoD have "f y < f x" by auto
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1142
    with `f x = f y` show ?thesis by simp
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1143
  qed
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1144
qed simp
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1145
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1146
lemma strict_mono_less_eq:
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1147
  assumes "strict_mono f"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1148
  shows "f x \<le> f y \<longleftrightarrow> x \<le> y"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1149
proof
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1150
  assume "x \<le> y"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1151
  with assms strict_mono_mono monoD show "f x \<le> f y" by auto
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1152
next
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1153
  assume "f x \<le> f y"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1154
  show "x \<le> y" proof (rule ccontr)
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1155
    assume "\<not> x \<le> y" then have "y < x" by simp
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1156
    with assms strict_monoD have "f y < f x" by auto
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1157
    with `f x \<le> f y` show False by simp
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1158
  qed
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1159
qed
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1160
  
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1161
lemma strict_mono_less:
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1162
  assumes "strict_mono f"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1163
  shows "f x < f y \<longleftrightarrow> x < y"
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1164
  using assms
abefe1dfadbb added strict_mono predicate
haftmann
parents: 30107
diff changeset
  1165
    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
  1166
54860
69b3e46d8fbe tuned structure of min/max lemmas
haftmann
parents: 54857
diff changeset
  1167
end
69b3e46d8fbe tuned structure of min/max lemmas
haftmann
parents: 54857
diff changeset
  1168
69b3e46d8fbe tuned structure of min/max lemmas
haftmann
parents: 54857
diff changeset
  1169
54861
00d551179872 postponed min/max lemmas until abstract lattice is available
haftmann
parents: 54860
diff changeset
  1170
subsection {* min and max -- fundamental *}
54860
69b3e46d8fbe tuned structure of min/max lemmas
haftmann
parents: 54857
diff changeset
  1171
69b3e46d8fbe tuned structure of min/max lemmas
haftmann
parents: 54857
diff changeset
  1172
definition (in ord) min :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" where
69b3e46d8fbe tuned structure of min/max lemmas
haftmann
parents: 54857
diff changeset
  1173
  "min a b = (if a \<le> b then a else b)"
69b3e46d8fbe tuned structure of min/max lemmas
haftmann
parents: 54857
diff changeset
  1174
69b3e46d8fbe tuned structure of min/max lemmas
haftmann
parents: 54857
diff changeset
  1175
definition (in ord) max :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" where
69b3e46d8fbe tuned structure of min/max lemmas
haftmann
parents: 54857
diff changeset
  1176
  "max a b = (if a \<le> b then b else a)"
69b3e46d8fbe tuned structure of min/max lemmas
haftmann
parents: 54857
diff changeset
  1177
45931
99cf6e470816 weaken preconditions on lemmas
noschinl
parents: 45893
diff changeset
  1178
lemma min_absorb1: "x \<le> y \<Longrightarrow> min x y = x"
54861
00d551179872 postponed min/max lemmas until abstract lattice is available
haftmann
parents: 54860
diff changeset
  1179
  by (simp add: min_def)
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
  1180
54857
5c05f7c5f8ae tuning and augmentation of min/max lemmas;
haftmann
parents: 54147
diff changeset
  1181
lemma max_absorb2: "x \<le> y \<Longrightarrow> max x y = y"
54861
00d551179872 postponed min/max lemmas until abstract lattice is available
haftmann
parents: 54860
diff changeset
  1182
  by (simp add: max_def)
21383
17e6275e13f5 added transitivity rules, reworking of min/max lemmas
haftmann
parents: 21329
diff changeset
  1183
45931
99cf6e470816 weaken preconditions on lemmas
noschinl
parents: 45893
diff changeset
  1184
lemma min_absorb2: "(y\<Colon>'a\<Colon>order) \<le> x \<Longrightarrow> min x y = y"
54861
00d551179872 postponed min/max lemmas until abstract lattice is available
haftmann
parents: 54860
diff changeset
  1185
  by (simp add:min_def)
45893
e7dbb27c1308 add complementary lemmas for {min,max}_least
noschinl
parents: 45262
diff changeset
  1186
45931
99cf6e470816 weaken preconditions on lemmas
noschinl
parents: 45893
diff changeset
  1187
lemma max_absorb1: "(y\<Colon>'a\<Colon>order) \<le> x \<Longrightarrow> max x y = x"
54861
00d551179872 postponed min/max lemmas until abstract lattice is available
haftmann
parents: 54860
diff changeset
  1188
  by (simp add: max_def)
45893
e7dbb27c1308 add complementary lemmas for {min,max}_least
noschinl
parents: 45262
diff changeset
  1189
e7dbb27c1308 add complementary lemmas for {min,max}_least
noschinl
parents: 45262
diff changeset
  1190
43813
07f0650146f2 tightened specification of classes bot and top: uniqueness of top and bot elements
haftmann
parents: 43597
diff changeset
  1191
subsection {* (Unique) top and bottom elements *}
28685
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1192
52729
412c9e0381a1 factored syntactic type classes for bot and top (by Alessandro Coglio)
haftmann
parents: 52143
diff changeset
  1193
class bot =
43853
020ddc6a9508 consolidated bot and top classes, tuned notation
haftmann
parents: 43816
diff changeset
  1194
  fixes bot :: 'a ("\<bottom>")
52729
412c9e0381a1 factored syntactic type classes for bot and top (by Alessandro Coglio)
haftmann
parents: 52143
diff changeset
  1195
412c9e0381a1 factored syntactic type classes for bot and top (by Alessandro Coglio)
haftmann
parents: 52143
diff changeset
  1196
class order_bot = order + bot +
51487
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
  1197
  assumes bot_least: "\<bottom> \<le> a"
54868
bab6cade3cc5 prefer target-style syntaxx for sublocale
haftmann
parents: 54861
diff changeset
  1198
begin
51487
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
  1199
54868
bab6cade3cc5 prefer target-style syntaxx for sublocale
haftmann
parents: 54861
diff changeset
  1200
sublocale bot!: ordering_top greater_eq greater bot
51546
2e26df807dc7 more uniform style for interpretation and sublocale declarations
haftmann
parents: 51487
diff changeset
  1201
  by default (fact bot_least)
51487
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
  1202
43853
020ddc6a9508 consolidated bot and top classes, tuned notation
haftmann
parents: 43816
diff changeset
  1203
lemma le_bot:
020ddc6a9508 consolidated bot and top classes, tuned notation
haftmann
parents: 43816
diff changeset
  1204
  "a \<le> \<bottom> \<Longrightarrow> a = \<bottom>"
51487
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
  1205
  by (fact bot.extremum_uniqueI)
43853
020ddc6a9508 consolidated bot and top classes, tuned notation
haftmann
parents: 43816
diff changeset
  1206
43816
05ab37be94ed uniqueness lemmas for bot and top
haftmann
parents: 43814
diff changeset
  1207
lemma bot_unique:
43853
020ddc6a9508 consolidated bot and top classes, tuned notation
haftmann
parents: 43816
diff changeset
  1208
  "a \<le> \<bottom> \<longleftrightarrow> a = \<bottom>"
51487
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
  1209
  by (fact bot.extremum_unique)
43853
020ddc6a9508 consolidated bot and top classes, tuned notation
haftmann
parents: 43816
diff changeset
  1210
51487
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
  1211
lemma not_less_bot:
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
  1212
  "\<not> a < \<bottom>"
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
  1213
  by (fact bot.extremum_strict)
43816
05ab37be94ed uniqueness lemmas for bot and top
haftmann
parents: 43814
diff changeset
  1214
43814
58791b75cf1f moved lemmas bot_less and less_top to classes bot and top respectively
haftmann
parents: 43813
diff changeset
  1215
lemma bot_less:
43853
020ddc6a9508 consolidated bot and top classes, tuned notation
haftmann
parents: 43816
diff changeset
  1216
  "a \<noteq> \<bottom> \<longleftrightarrow> \<bottom> < a"
51487
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
  1217
  by (fact bot.not_eq_extremum)
43814
58791b75cf1f moved lemmas bot_less and less_top to classes bot and top respectively
haftmann
parents: 43813
diff changeset
  1218
58791b75cf1f moved lemmas bot_less and less_top to classes bot and top respectively
haftmann
parents: 43813
diff changeset
  1219
end
41082
9ff94e7cc3b3 bot comes before top, inf before sup etc.
haftmann
parents: 41080
diff changeset
  1220
52729
412c9e0381a1 factored syntactic type classes for bot and top (by Alessandro Coglio)
haftmann
parents: 52143
diff changeset
  1221
class top =
43853
020ddc6a9508 consolidated bot and top classes, tuned notation
haftmann
parents: 43816
diff changeset
  1222
  fixes top :: 'a ("\<top>")
52729
412c9e0381a1 factored syntactic type classes for bot and top (by Alessandro Coglio)
haftmann
parents: 52143
diff changeset
  1223
412c9e0381a1 factored syntactic type classes for bot and top (by Alessandro Coglio)
haftmann
parents: 52143
diff changeset
  1224
class order_top = order + top +
51487
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
  1225
  assumes top_greatest: "a \<le> \<top>"
54868
bab6cade3cc5 prefer target-style syntaxx for sublocale
haftmann
parents: 54861
diff changeset
  1226
begin
51487
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
  1227
54868
bab6cade3cc5 prefer target-style syntaxx for sublocale
haftmann
parents: 54861
diff changeset
  1228
sublocale top!: ordering_top less_eq less top
51546
2e26df807dc7 more uniform style for interpretation and sublocale declarations
haftmann
parents: 51487
diff changeset
  1229
  by default (fact top_greatest)
51487
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
  1230
43853
020ddc6a9508 consolidated bot and top classes, tuned notation
haftmann
parents: 43816
diff changeset
  1231
lemma top_le:
020ddc6a9508 consolidated bot and top classes, tuned notation
haftmann
parents: 43816
diff changeset
  1232
  "\<top> \<le> a \<Longrightarrow> a = \<top>"
51487
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
  1233
  by (fact top.extremum_uniqueI)
43853
020ddc6a9508 consolidated bot and top classes, tuned notation
haftmann
parents: 43816
diff changeset
  1234
43816
05ab37be94ed uniqueness lemmas for bot and top
haftmann
parents: 43814
diff changeset
  1235
lemma top_unique:
43853
020ddc6a9508 consolidated bot and top classes, tuned notation
haftmann
parents: 43816
diff changeset
  1236
  "\<top> \<le> a \<longleftrightarrow> a = \<top>"
51487
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
  1237
  by (fact top.extremum_unique)
43853
020ddc6a9508 consolidated bot and top classes, tuned notation
haftmann
parents: 43816
diff changeset
  1238
51487
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
  1239
lemma not_top_less:
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
  1240
  "\<not> \<top> < a"
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
  1241
  by (fact top.extremum_strict)
43816
05ab37be94ed uniqueness lemmas for bot and top
haftmann
parents: 43814
diff changeset
  1242
43814
58791b75cf1f moved lemmas bot_less and less_top to classes bot and top respectively
haftmann
parents: 43813
diff changeset
  1243
lemma less_top:
43853
020ddc6a9508 consolidated bot and top classes, tuned notation
haftmann
parents: 43816
diff changeset
  1244
  "a \<noteq> \<top> \<longleftrightarrow> a < \<top>"
51487
f4bfdee99304 locales for abstract orders
haftmann
parents: 51329
diff changeset
  1245
  by (fact top.not_eq_extremum)
43814
58791b75cf1f moved lemmas bot_less and less_top to classes bot and top respectively
haftmann
parents: 43813
diff changeset
  1246
58791b75cf1f moved lemmas bot_less and less_top to classes bot and top respectively
haftmann
parents: 43813
diff changeset
  1247
end
28685
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1248
275122631271 new classes "top" and "bot"
haftmann
parents: 28562
diff changeset
  1249
27823
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1250
subsection {* Dense orders *}
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1251
53216
ad2e09c30aa8 renamed inner_dense_linorder to dense_linorder
hoelzl
parents: 53215
diff changeset
  1252
class dense_order = order +
51329
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1253
  assumes dense: "x < y \<Longrightarrow> (\<exists>z. x < z \<and> z < y)"
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1254
53216
ad2e09c30aa8 renamed inner_dense_linorder to dense_linorder
hoelzl
parents: 53215
diff changeset
  1255
class dense_linorder = linorder + dense_order
35579
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1256
begin
27823
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 27689
diff changeset
  1257
35579
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1258
lemma dense_le:
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1259
  fixes y z :: 'a
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1260
  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
  1261
  shows "y \<le> z"
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1262
proof (rule ccontr)
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1263
  assume "\<not> ?thesis"
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1264
  hence "z < y" by simp
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1265
  from dense[OF this]
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1266
  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
  1267
  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
  1268
  ultimately show False by auto
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1269
qed
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1270
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1271
lemma dense_le_bounded:
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1272
  fixes x y z :: 'a
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1273
  assumes "x < y"
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1274
  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
  1275
  shows "y \<le> z"
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1276
proof (rule dense_le)
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1277
  fix w assume "w < y"
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1278
  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
  1279
  from linear[of u w]
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1280
  show "w \<le> z"
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1281
  proof (rule disjE)
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1282
    assume "u \<le> w"
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1283
    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
  1284
    show "w \<le> z" by (rule *)
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1285
  next
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1286
    assume "w \<le> u"
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1287
    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
  1288
    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
  1289
  qed
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1290
qed
cc9a5a0ab5ea Add dense_le, dense_le_bounded, field_le_mult_one_interval.
hoelzl
parents: 35364
diff changeset
  1291
51329
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1292
lemma dense_ge:
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1293
  fixes y z :: 'a
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1294
  assumes "\<And>x. z < x \<Longrightarrow> y \<le> x"
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1295
  shows "y \<le> z"
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1296
proof (rule ccontr)
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1297
  assume "\<not> ?thesis"
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1298
  hence "z < y" by simp
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1299
  from dense[OF this]
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1300
  obtain x where "x < y" and "z < x" by safe
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1301
  moreover have "y \<le> x" using assms[OF `z < x`] .
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1302
  ultimately show False by auto
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1303
qed
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1304
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1305
lemma dense_ge_bounded:
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1306
  fixes x y z :: 'a
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1307
  assumes "z < x"
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1308
  assumes *: "\<And>w. \<lbrakk> z < w ; w < x \<rbrakk> \<Longrightarrow> y \<le> w"
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1309
  shows "y \<le> z"
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1310
proof (rule dense_ge)
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1311
  fix w assume "z < w"
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1312
  from dense[OF `z < x`] obtain u where "z < u" "u < x" by safe
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1313
  from linear[of u w]
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1314
  show "y \<le> w"
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1315
  proof (rule disjE)
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263
diff changeset
  1316
    assume "w \<le> u"
4a3c453f99a1 split dense into inner_dense_order and no_top/no_bot
hoelzl
parents: 51263