src/HOL/Lattices.thy
author haftmann
Wed Jan 30 10:57:46 2008 +0100 (2008-01-30)
changeset 26014 00c2c3525bef
parent 25510 38c15efe603b
child 26233 3751b3dbb67c
permissions -rw-r--r--
dual orders and dual lattices
haftmann@21249
     1
(*  Title:      HOL/Lattices.thy
haftmann@21249
     2
    ID:         $Id$
haftmann@21249
     3
    Author:     Tobias Nipkow
haftmann@21249
     4
*)
haftmann@21249
     5
haftmann@22454
     6
header {* Abstract lattices *}
haftmann@21249
     7
haftmann@21249
     8
theory Lattices
haftmann@21249
     9
imports Orderings
haftmann@21249
    10
begin
haftmann@21249
    11
haftmann@21249
    12
subsection{* Lattices *}
haftmann@21249
    13
haftmann@25206
    14
notation
wenzelm@25382
    15
  less_eq  (infix "\<sqsubseteq>" 50) and
wenzelm@25382
    16
  less  (infix "\<sqsubset>" 50)
haftmann@25206
    17
haftmann@22422
    18
class lower_semilattice = order +
haftmann@21249
    19
  fixes inf :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" (infixl "\<sqinter>" 70)
haftmann@22737
    20
  assumes inf_le1 [simp]: "x \<sqinter> y \<sqsubseteq> x"
haftmann@22737
    21
  and inf_le2 [simp]: "x \<sqinter> y \<sqsubseteq> y"
nipkow@21733
    22
  and inf_greatest: "x \<sqsubseteq> y \<Longrightarrow> x \<sqsubseteq> z \<Longrightarrow> x \<sqsubseteq> y \<sqinter> z"
haftmann@21249
    23
haftmann@22422
    24
class upper_semilattice = order +
haftmann@21249
    25
  fixes sup :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" (infixl "\<squnion>" 65)
haftmann@22737
    26
  assumes sup_ge1 [simp]: "x \<sqsubseteq> x \<squnion> y"
haftmann@22737
    27
  and sup_ge2 [simp]: "y \<sqsubseteq> x \<squnion> y"
nipkow@21733
    28
  and sup_least: "y \<sqsubseteq> x \<Longrightarrow> z \<sqsubseteq> x \<Longrightarrow> y \<squnion> z \<sqsubseteq> x"
haftmann@26014
    29
begin
haftmann@26014
    30
haftmann@26014
    31
text {* Dual lattice *}
haftmann@26014
    32
haftmann@26014
    33
lemma dual_lattice:
haftmann@26014
    34
  "lower_semilattice (op \<ge>) (op >) sup"
haftmann@26014
    35
by unfold_locales
haftmann@26014
    36
  (auto simp add: sup_least)
haftmann@26014
    37
haftmann@26014
    38
end
haftmann@21249
    39
haftmann@22422
    40
class lattice = lower_semilattice + upper_semilattice
haftmann@21249
    41
wenzelm@25382
    42
nipkow@21733
    43
subsubsection{* Intro and elim rules*}
nipkow@21733
    44
nipkow@21733
    45
context lower_semilattice
nipkow@21733
    46
begin
haftmann@21249
    47
haftmann@25062
    48
lemma le_infI1[intro]:
haftmann@25062
    49
  assumes "a \<sqsubseteq> x"
haftmann@25062
    50
  shows "a \<sqinter> b \<sqsubseteq> x"
haftmann@25062
    51
proof (rule order_trans)
haftmann@25482
    52
  from assms show "a \<sqsubseteq> x" .
haftmann@25482
    53
  show "a \<sqinter> b \<sqsubseteq> a" by simp 
haftmann@25062
    54
qed
haftmann@22422
    55
lemmas (in -) [rule del] = le_infI1
haftmann@21249
    56
haftmann@25062
    57
lemma le_infI2[intro]:
haftmann@25062
    58
  assumes "b \<sqsubseteq> x"
haftmann@25062
    59
  shows "a \<sqinter> b \<sqsubseteq> x"
haftmann@25062
    60
proof (rule order_trans)
haftmann@25482
    61
  from assms show "b \<sqsubseteq> x" .
haftmann@25482
    62
  show "a \<sqinter> b \<sqsubseteq> b" by simp
haftmann@25062
    63
qed
haftmann@22422
    64
lemmas (in -) [rule del] = le_infI2
nipkow@21733
    65
nipkow@21734
    66
lemma le_infI[intro!]: "x \<sqsubseteq> a \<Longrightarrow> x \<sqsubseteq> b \<Longrightarrow> x \<sqsubseteq> a \<sqinter> b"
nipkow@21733
    67
by(blast intro: inf_greatest)
haftmann@22422
    68
lemmas (in -) [rule del] = le_infI
haftmann@21249
    69
haftmann@22422
    70
lemma le_infE [elim!]: "x \<sqsubseteq> a \<sqinter> b \<Longrightarrow> (x \<sqsubseteq> a \<Longrightarrow> x \<sqsubseteq> b \<Longrightarrow> P) \<Longrightarrow> P"
haftmann@22422
    71
  by (blast intro: order_trans)
haftmann@22422
    72
lemmas (in -) [rule del] = le_infE
haftmann@21249
    73
nipkow@21734
    74
lemma le_inf_iff [simp]:
haftmann@25102
    75
  "x \<sqsubseteq> y \<sqinter> z = (x \<sqsubseteq> y \<and> x \<sqsubseteq> z)"
nipkow@21733
    76
by blast
nipkow@21733
    77
nipkow@21734
    78
lemma le_iff_inf: "(x \<sqsubseteq> y) = (x \<sqinter> y = x)"
haftmann@25102
    79
  by (blast intro: antisym dest: eq_iff [THEN iffD1])
haftmann@21249
    80
haftmann@25206
    81
lemma mono_inf:
haftmann@25206
    82
  fixes f :: "'a \<Rightarrow> 'b\<Colon>lower_semilattice"
haftmann@25206
    83
  shows "mono f \<Longrightarrow> f (A \<sqinter> B) \<le> f A \<sqinter> f B"
haftmann@25206
    84
  by (auto simp add: mono_def intro: Lattices.inf_greatest)
nipkow@21733
    85
haftmann@25206
    86
end
nipkow@21733
    87
nipkow@21733
    88
context upper_semilattice
nipkow@21733
    89
begin
haftmann@21249
    90
nipkow@21734
    91
lemma le_supI1[intro]: "x \<sqsubseteq> a \<Longrightarrow> x \<sqsubseteq> a \<squnion> b"
haftmann@25062
    92
  by (rule order_trans) auto
haftmann@22422
    93
lemmas (in -) [rule del] = le_supI1
haftmann@21249
    94
nipkow@21734
    95
lemma le_supI2[intro]: "x \<sqsubseteq> b \<Longrightarrow> x \<sqsubseteq> a \<squnion> b"
haftmann@25062
    96
  by (rule order_trans) auto 
haftmann@22422
    97
lemmas (in -) [rule del] = le_supI2
nipkow@21733
    98
nipkow@21734
    99
lemma le_supI[intro!]: "a \<sqsubseteq> x \<Longrightarrow> b \<sqsubseteq> x \<Longrightarrow> a \<squnion> b \<sqsubseteq> x"
haftmann@26014
   100
  by (blast intro: sup_least)
haftmann@22422
   101
lemmas (in -) [rule del] = le_supI
haftmann@21249
   102
nipkow@21734
   103
lemma le_supE[elim!]: "a \<squnion> b \<sqsubseteq> x \<Longrightarrow> (a \<sqsubseteq> x \<Longrightarrow> b \<sqsubseteq> x \<Longrightarrow> P) \<Longrightarrow> P"
haftmann@22422
   104
  by (blast intro: order_trans)
haftmann@22422
   105
lemmas (in -) [rule del] = le_supE
haftmann@22422
   106
nipkow@21734
   107
lemma ge_sup_conv[simp]:
haftmann@25102
   108
  "x \<squnion> y \<sqsubseteq> z = (x \<sqsubseteq> z \<and> y \<sqsubseteq> z)"
nipkow@21733
   109
by blast
nipkow@21733
   110
nipkow@21734
   111
lemma le_iff_sup: "(x \<sqsubseteq> y) = (x \<squnion> y = y)"
haftmann@25102
   112
  by (blast intro: antisym dest: eq_iff [THEN iffD1])
nipkow@21734
   113
haftmann@25206
   114
lemma mono_sup:
haftmann@25206
   115
  fixes f :: "'a \<Rightarrow> 'b\<Colon>upper_semilattice"
haftmann@25206
   116
  shows "mono f \<Longrightarrow> f A \<squnion> f B \<le> f (A \<squnion> B)"
haftmann@25206
   117
  by (auto simp add: mono_def intro: Lattices.sup_least)
nipkow@21733
   118
haftmann@25206
   119
end
haftmann@23878
   120
nipkow@21733
   121
nipkow@21733
   122
subsubsection{* Equational laws *}
haftmann@21249
   123
nipkow@21733
   124
context lower_semilattice
nipkow@21733
   125
begin
nipkow@21733
   126
nipkow@21733
   127
lemma inf_commute: "(x \<sqinter> y) = (y \<sqinter> x)"
haftmann@25102
   128
  by (blast intro: antisym)
nipkow@21733
   129
nipkow@21733
   130
lemma inf_assoc: "(x \<sqinter> y) \<sqinter> z = x \<sqinter> (y \<sqinter> z)"
haftmann@25102
   131
  by (blast intro: antisym)
nipkow@21733
   132
nipkow@21733
   133
lemma inf_idem[simp]: "x \<sqinter> x = x"
haftmann@25102
   134
  by (blast intro: antisym)
nipkow@21733
   135
nipkow@21733
   136
lemma inf_left_idem[simp]: "x \<sqinter> (x \<sqinter> y) = x \<sqinter> y"
haftmann@25102
   137
  by (blast intro: antisym)
nipkow@21733
   138
nipkow@21733
   139
lemma inf_absorb1: "x \<sqsubseteq> y \<Longrightarrow> x \<sqinter> y = x"
haftmann@25102
   140
  by (blast intro: antisym)
nipkow@21733
   141
nipkow@21733
   142
lemma inf_absorb2: "y \<sqsubseteq> x \<Longrightarrow> x \<sqinter> y = y"
haftmann@25102
   143
  by (blast intro: antisym)
nipkow@21733
   144
nipkow@21733
   145
lemma inf_left_commute: "x \<sqinter> (y \<sqinter> z) = y \<sqinter> (x \<sqinter> z)"
haftmann@25102
   146
  by (blast intro: antisym)
nipkow@21733
   147
nipkow@21733
   148
lemmas inf_ACI = inf_commute inf_assoc inf_left_commute inf_left_idem
nipkow@21733
   149
nipkow@21733
   150
end
nipkow@21733
   151
nipkow@21733
   152
nipkow@21733
   153
context upper_semilattice
nipkow@21733
   154
begin
haftmann@21249
   155
nipkow@21733
   156
lemma sup_commute: "(x \<squnion> y) = (y \<squnion> x)"
haftmann@25102
   157
  by (blast intro: antisym)
nipkow@21733
   158
nipkow@21733
   159
lemma sup_assoc: "(x \<squnion> y) \<squnion> z = x \<squnion> (y \<squnion> z)"
haftmann@25102
   160
  by (blast intro: antisym)
nipkow@21733
   161
nipkow@21733
   162
lemma sup_idem[simp]: "x \<squnion> x = x"
haftmann@25102
   163
  by (blast intro: antisym)
nipkow@21733
   164
nipkow@21733
   165
lemma sup_left_idem[simp]: "x \<squnion> (x \<squnion> y) = x \<squnion> y"
haftmann@25102
   166
  by (blast intro: antisym)
nipkow@21733
   167
nipkow@21733
   168
lemma sup_absorb1: "y \<sqsubseteq> x \<Longrightarrow> x \<squnion> y = x"
haftmann@25102
   169
  by (blast intro: antisym)
nipkow@21733
   170
nipkow@21733
   171
lemma sup_absorb2: "x \<sqsubseteq> y \<Longrightarrow> x \<squnion> y = y"
haftmann@25102
   172
  by (blast intro: antisym)
haftmann@21249
   173
nipkow@21733
   174
lemma sup_left_commute: "x \<squnion> (y \<squnion> z) = y \<squnion> (x \<squnion> z)"
haftmann@25102
   175
  by (blast intro: antisym)
nipkow@21733
   176
nipkow@21733
   177
lemmas sup_ACI = sup_commute sup_assoc sup_left_commute sup_left_idem
nipkow@21733
   178
nipkow@21733
   179
end
haftmann@21249
   180
nipkow@21733
   181
context lattice
nipkow@21733
   182
begin
nipkow@21733
   183
nipkow@21733
   184
lemma inf_sup_absorb: "x \<sqinter> (x \<squnion> y) = x"
haftmann@25102
   185
  by (blast intro: antisym inf_le1 inf_greatest sup_ge1)
nipkow@21733
   186
nipkow@21733
   187
lemma sup_inf_absorb: "x \<squnion> (x \<sqinter> y) = x"
haftmann@25102
   188
  by (blast intro: antisym sup_ge1 sup_least inf_le1)
nipkow@21733
   189
nipkow@21734
   190
lemmas ACI = inf_ACI sup_ACI
nipkow@21734
   191
haftmann@22454
   192
lemmas inf_sup_ord = inf_le1 inf_le2 sup_ge1 sup_ge2
haftmann@22454
   193
nipkow@21734
   194
text{* Towards distributivity *}
haftmann@21249
   195
nipkow@21734
   196
lemma distrib_sup_le: "x \<squnion> (y \<sqinter> z) \<sqsubseteq> (x \<squnion> y) \<sqinter> (x \<squnion> z)"
haftmann@25102
   197
  by blast
nipkow@21734
   198
nipkow@21734
   199
lemma distrib_inf_le: "(x \<sqinter> y) \<squnion> (x \<sqinter> z) \<sqsubseteq> x \<sqinter> (y \<squnion> z)"
haftmann@25102
   200
  by blast
nipkow@21734
   201
nipkow@21734
   202
nipkow@21734
   203
text{* If you have one of them, you have them all. *}
haftmann@21249
   204
nipkow@21733
   205
lemma distrib_imp1:
haftmann@21249
   206
assumes D: "!!x y z. x \<sqinter> (y \<squnion> z) = (x \<sqinter> y) \<squnion> (x \<sqinter> z)"
haftmann@21249
   207
shows "x \<squnion> (y \<sqinter> z) = (x \<squnion> y) \<sqinter> (x \<squnion> z)"
haftmann@21249
   208
proof-
haftmann@21249
   209
  have "x \<squnion> (y \<sqinter> z) = (x \<squnion> (x \<sqinter> z)) \<squnion> (y \<sqinter> z)" by(simp add:sup_inf_absorb)
haftmann@21249
   210
  also have "\<dots> = x \<squnion> (z \<sqinter> (x \<squnion> y))" by(simp add:D inf_commute sup_assoc)
haftmann@21249
   211
  also have "\<dots> = ((x \<squnion> y) \<sqinter> x) \<squnion> ((x \<squnion> y) \<sqinter> z)"
haftmann@21249
   212
    by(simp add:inf_sup_absorb inf_commute)
haftmann@21249
   213
  also have "\<dots> = (x \<squnion> y) \<sqinter> (x \<squnion> z)" by(simp add:D)
haftmann@21249
   214
  finally show ?thesis .
haftmann@21249
   215
qed
haftmann@21249
   216
nipkow@21733
   217
lemma distrib_imp2:
haftmann@21249
   218
assumes D: "!!x y z. x \<squnion> (y \<sqinter> z) = (x \<squnion> y) \<sqinter> (x \<squnion> z)"
haftmann@21249
   219
shows "x \<sqinter> (y \<squnion> z) = (x \<sqinter> y) \<squnion> (x \<sqinter> z)"
haftmann@21249
   220
proof-
haftmann@21249
   221
  have "x \<sqinter> (y \<squnion> z) = (x \<sqinter> (x \<squnion> z)) \<sqinter> (y \<squnion> z)" by(simp add:inf_sup_absorb)
haftmann@21249
   222
  also have "\<dots> = x \<sqinter> (z \<squnion> (x \<sqinter> y))" by(simp add:D sup_commute inf_assoc)
haftmann@21249
   223
  also have "\<dots> = ((x \<sqinter> y) \<squnion> x) \<sqinter> ((x \<sqinter> y) \<squnion> z)"
haftmann@21249
   224
    by(simp add:sup_inf_absorb sup_commute)
haftmann@21249
   225
  also have "\<dots> = (x \<sqinter> y) \<squnion> (x \<sqinter> z)" by(simp add:D)
haftmann@21249
   226
  finally show ?thesis .
haftmann@21249
   227
qed
haftmann@21249
   228
nipkow@21734
   229
(* seems unused *)
nipkow@21734
   230
lemma modular_le: "x \<sqsubseteq> z \<Longrightarrow> x \<squnion> (y \<sqinter> z) \<sqsubseteq> (x \<squnion> y) \<sqinter> z"
nipkow@21734
   231
by blast
nipkow@21734
   232
nipkow@21733
   233
end
haftmann@21249
   234
haftmann@21249
   235
haftmann@24164
   236
subsection {* Distributive lattices *}
haftmann@21249
   237
haftmann@22454
   238
class distrib_lattice = lattice +
haftmann@21249
   239
  assumes sup_inf_distrib1: "x \<squnion> (y \<sqinter> z) = (x \<squnion> y) \<sqinter> (x \<squnion> z)"
haftmann@21249
   240
nipkow@21733
   241
context distrib_lattice
nipkow@21733
   242
begin
nipkow@21733
   243
nipkow@21733
   244
lemma sup_inf_distrib2:
haftmann@21249
   245
 "(y \<sqinter> z) \<squnion> x = (y \<squnion> x) \<sqinter> (z \<squnion> x)"
haftmann@21249
   246
by(simp add:ACI sup_inf_distrib1)
haftmann@21249
   247
nipkow@21733
   248
lemma inf_sup_distrib1:
haftmann@21249
   249
 "x \<sqinter> (y \<squnion> z) = (x \<sqinter> y) \<squnion> (x \<sqinter> z)"
haftmann@21249
   250
by(rule distrib_imp2[OF sup_inf_distrib1])
haftmann@21249
   251
nipkow@21733
   252
lemma inf_sup_distrib2:
haftmann@21249
   253
 "(y \<squnion> z) \<sqinter> x = (y \<sqinter> x) \<squnion> (z \<sqinter> x)"
haftmann@21249
   254
by(simp add:ACI inf_sup_distrib1)
haftmann@21249
   255
nipkow@21733
   256
lemmas distrib =
haftmann@21249
   257
  sup_inf_distrib1 sup_inf_distrib2 inf_sup_distrib1 inf_sup_distrib2
haftmann@21249
   258
nipkow@21733
   259
end
nipkow@21733
   260
haftmann@21249
   261
haftmann@22454
   262
subsection {* Uniqueness of inf and sup *}
haftmann@22454
   263
haftmann@22737
   264
lemma (in lower_semilattice) inf_unique:
haftmann@22454
   265
  fixes f (infixl "\<triangle>" 70)
haftmann@25062
   266
  assumes le1: "\<And>x y. x \<triangle> y \<le> x" and le2: "\<And>x y. x \<triangle> y \<le> y"
haftmann@25062
   267
  and greatest: "\<And>x y z. x \<le> y \<Longrightarrow> x \<le> z \<Longrightarrow> x \<le> y \<triangle> z"
haftmann@22737
   268
  shows "x \<sqinter> y = x \<triangle> y"
haftmann@22454
   269
proof (rule antisym)
haftmann@25062
   270
  show "x \<triangle> y \<le> x \<sqinter> y" by (rule le_infI) (rule le1, rule le2)
haftmann@22454
   271
next
haftmann@25062
   272
  have leI: "\<And>x y z. x \<le> y \<Longrightarrow> x \<le> z \<Longrightarrow> x \<le> y \<triangle> z" by (blast intro: greatest)
haftmann@25062
   273
  show "x \<sqinter> y \<le> x \<triangle> y" by (rule leI) simp_all
haftmann@22454
   274
qed
haftmann@22454
   275
haftmann@22737
   276
lemma (in upper_semilattice) sup_unique:
haftmann@22454
   277
  fixes f (infixl "\<nabla>" 70)
haftmann@25062
   278
  assumes ge1 [simp]: "\<And>x y. x \<le> x \<nabla> y" and ge2: "\<And>x y. y \<le> x \<nabla> y"
haftmann@25062
   279
  and least: "\<And>x y z. y \<le> x \<Longrightarrow> z \<le> x \<Longrightarrow> y \<nabla> z \<le> x"
haftmann@22737
   280
  shows "x \<squnion> y = x \<nabla> y"
haftmann@22454
   281
proof (rule antisym)
haftmann@25062
   282
  show "x \<squnion> y \<le> x \<nabla> y" by (rule le_supI) (rule ge1, rule ge2)
haftmann@22454
   283
next
haftmann@25062
   284
  have leI: "\<And>x y z. x \<le> z \<Longrightarrow> y \<le> z \<Longrightarrow> x \<nabla> y \<le> z" by (blast intro: least)
haftmann@25062
   285
  show "x \<nabla> y \<le> x \<squnion> y" by (rule leI) simp_all
haftmann@22454
   286
qed
haftmann@22454
   287
  
haftmann@22454
   288
haftmann@22916
   289
subsection {* @{const min}/@{const max} on linear orders as
haftmann@22916
   290
  special case of @{const inf}/@{const sup} *}
haftmann@22916
   291
haftmann@22916
   292
lemma (in linorder) distrib_lattice_min_max:
haftmann@25062
   293
  "distrib_lattice (op \<le>) (op <) min max"
haftmann@22916
   294
proof unfold_locales
haftmann@25062
   295
  have aux: "\<And>x y \<Colon> 'a. x < y \<Longrightarrow> y \<le> x \<Longrightarrow> x = y"
haftmann@22916
   296
    by (auto simp add: less_le antisym)
haftmann@22916
   297
  fix x y z
haftmann@22916
   298
  show "max x (min y z) = min (max x y) (max x z)"
haftmann@22916
   299
  unfolding min_def max_def
ballarin@24640
   300
  by auto
haftmann@22916
   301
qed (auto simp add: min_def max_def not_le less_imp_le)
haftmann@21249
   302
haftmann@21249
   303
interpretation min_max:
haftmann@22454
   304
  distrib_lattice ["op \<le> \<Colon> 'a\<Colon>linorder \<Rightarrow> 'a \<Rightarrow> bool" "op <" min max]
haftmann@23948
   305
  by (rule distrib_lattice_min_max)
haftmann@21249
   306
haftmann@22454
   307
lemma inf_min: "inf = (min \<Colon> 'a\<Colon>{lower_semilattice, linorder} \<Rightarrow> 'a \<Rightarrow> 'a)"
haftmann@25102
   308
  by (rule ext)+ (auto intro: antisym)
nipkow@21733
   309
haftmann@22454
   310
lemma sup_max: "sup = (max \<Colon> 'a\<Colon>{upper_semilattice, linorder} \<Rightarrow> 'a \<Rightarrow> 'a)"
haftmann@25102
   311
  by (rule ext)+ (auto intro: antisym)
nipkow@21733
   312
haftmann@21249
   313
lemmas le_maxI1 = min_max.sup_ge1
haftmann@21249
   314
lemmas le_maxI2 = min_max.sup_ge2
haftmann@21381
   315
 
haftmann@21249
   316
lemmas max_ac = min_max.sup_assoc min_max.sup_commute
haftmann@22422
   317
  mk_left_commute [of max, OF min_max.sup_assoc min_max.sup_commute]
haftmann@21249
   318
haftmann@21249
   319
lemmas min_ac = min_max.inf_assoc min_max.inf_commute
haftmann@22422
   320
  mk_left_commute [of min, OF min_max.inf_assoc min_max.inf_commute]
haftmann@21249
   321
haftmann@22454
   322
text {*
haftmann@22454
   323
  Now we have inherited antisymmetry as an intro-rule on all
haftmann@22454
   324
  linear orders. This is a problem because it applies to bool, which is
haftmann@22454
   325
  undesirable.
haftmann@22454
   326
*}
haftmann@22454
   327
haftmann@25102
   328
lemmas [rule del] = min_max.le_infI min_max.le_supI
haftmann@22454
   329
  min_max.le_supE min_max.le_infE min_max.le_supI1 min_max.le_supI2
haftmann@22454
   330
  min_max.le_infI1 min_max.le_infI2
haftmann@22454
   331
haftmann@22454
   332
haftmann@23878
   333
subsection {* Complete lattices *}
haftmann@23878
   334
haftmann@23878
   335
class complete_lattice = lattice +
haftmann@23878
   336
  fixes Inf :: "'a set \<Rightarrow> 'a" ("\<Sqinter>_" [900] 900)
haftmann@24345
   337
    and Sup :: "'a set \<Rightarrow> 'a" ("\<Squnion>_" [900] 900)
haftmann@23878
   338
  assumes Inf_lower: "x \<in> A \<Longrightarrow> \<Sqinter>A \<sqsubseteq> x"
haftmann@24345
   339
     and Inf_greatest: "(\<And>x. x \<in> A \<Longrightarrow> z \<sqsubseteq> x) \<Longrightarrow> z \<sqsubseteq> \<Sqinter>A"
haftmann@24345
   340
  assumes Sup_upper: "x \<in> A \<Longrightarrow> x \<sqsubseteq> \<Squnion>A"
haftmann@24345
   341
     and Sup_least: "(\<And>x. x \<in> A \<Longrightarrow> x \<sqsubseteq> z) \<Longrightarrow> \<Squnion>A \<sqsubseteq> z"
haftmann@23878
   342
begin
haftmann@23878
   343
haftmann@25062
   344
lemma Inf_Sup: "\<Sqinter>A = \<Squnion>{b. \<forall>a \<in> A. b \<le> a}"
haftmann@25102
   345
  by (auto intro: antisym Inf_lower Inf_greatest Sup_upper Sup_least)
haftmann@23878
   346
haftmann@25062
   347
lemma Sup_Inf:  "\<Squnion>A = \<Sqinter>{b. \<forall>a \<in> A. a \<le> b}"
haftmann@25102
   348
  by (auto intro: antisym Inf_lower Inf_greatest Sup_upper Sup_least)
haftmann@23878
   349
haftmann@23878
   350
lemma Inf_Univ: "\<Sqinter>UNIV = \<Squnion>{}"
haftmann@24345
   351
  unfolding Sup_Inf by auto
haftmann@23878
   352
haftmann@23878
   353
lemma Sup_Univ: "\<Squnion>UNIV = \<Sqinter>{}"
haftmann@23878
   354
  unfolding Inf_Sup by auto
haftmann@23878
   355
haftmann@23878
   356
lemma Inf_insert: "\<Sqinter>insert a A = a \<sqinter> \<Sqinter>A"
haftmann@23878
   357
  apply (rule antisym)
haftmann@23878
   358
  apply (rule le_infI)
haftmann@23878
   359
  apply (rule Inf_lower)
haftmann@23878
   360
  apply simp
haftmann@23878
   361
  apply (rule Inf_greatest)
haftmann@23878
   362
  apply (rule Inf_lower)
haftmann@23878
   363
  apply simp
haftmann@23878
   364
  apply (rule Inf_greatest)
haftmann@23878
   365
  apply (erule insertE)
haftmann@23878
   366
  apply (rule le_infI1)
haftmann@23878
   367
  apply simp
haftmann@23878
   368
  apply (rule le_infI2)
haftmann@23878
   369
  apply (erule Inf_lower)
haftmann@23878
   370
  done
haftmann@23878
   371
haftmann@24345
   372
lemma Sup_insert: "\<Squnion>insert a A = a \<squnion> \<Squnion>A"
haftmann@23878
   373
  apply (rule antisym)
haftmann@23878
   374
  apply (rule Sup_least)
haftmann@23878
   375
  apply (erule insertE)
haftmann@23878
   376
  apply (rule le_supI1)
haftmann@23878
   377
  apply simp
haftmann@23878
   378
  apply (rule le_supI2)
haftmann@23878
   379
  apply (erule Sup_upper)
haftmann@23878
   380
  apply (rule le_supI)
haftmann@23878
   381
  apply (rule Sup_upper)
haftmann@23878
   382
  apply simp
haftmann@23878
   383
  apply (rule Sup_least)
haftmann@23878
   384
  apply (rule Sup_upper)
haftmann@23878
   385
  apply simp
haftmann@23878
   386
  done
haftmann@23878
   387
haftmann@23878
   388
lemma Inf_singleton [simp]:
haftmann@23878
   389
  "\<Sqinter>{a} = a"
haftmann@23878
   390
  by (auto intro: antisym Inf_lower Inf_greatest)
haftmann@23878
   391
haftmann@24345
   392
lemma Sup_singleton [simp]:
haftmann@23878
   393
  "\<Squnion>{a} = a"
haftmann@23878
   394
  by (auto intro: antisym Sup_upper Sup_least)
haftmann@23878
   395
haftmann@23878
   396
lemma Inf_insert_simp:
haftmann@23878
   397
  "\<Sqinter>insert a A = (if A = {} then a else a \<sqinter> \<Sqinter>A)"
haftmann@23878
   398
  by (cases "A = {}") (simp_all, simp add: Inf_insert)
haftmann@23878
   399
haftmann@23878
   400
lemma Sup_insert_simp:
haftmann@23878
   401
  "\<Squnion>insert a A = (if A = {} then a else a \<squnion> \<Squnion>A)"
haftmann@23878
   402
  by (cases "A = {}") (simp_all, simp add: Sup_insert)
haftmann@23878
   403
haftmann@23878
   404
lemma Inf_binary:
haftmann@23878
   405
  "\<Sqinter>{a, b} = a \<sqinter> b"
haftmann@23878
   406
  by (simp add: Inf_insert_simp)
haftmann@23878
   407
haftmann@23878
   408
lemma Sup_binary:
haftmann@23878
   409
  "\<Squnion>{a, b} = a \<squnion> b"
haftmann@23878
   410
  by (simp add: Sup_insert_simp)
haftmann@23878
   411
haftmann@23878
   412
definition
wenzelm@25382
   413
  top :: 'a where
haftmann@25206
   414
  "top = \<Sqinter>{}"
haftmann@23878
   415
haftmann@23878
   416
definition
wenzelm@25382
   417
  bot :: 'a where
haftmann@25206
   418
  "bot = \<Squnion>{}"
haftmann@23878
   419
haftmann@25062
   420
lemma top_greatest [simp]: "x \<le> top"
haftmann@23878
   421
  by (unfold top_def, rule Inf_greatest, simp)
haftmann@23878
   422
haftmann@25062
   423
lemma bot_least [simp]: "bot \<le> x"
haftmann@23878
   424
  by (unfold bot_def, rule Sup_least, simp)
haftmann@23878
   425
haftmann@23878
   426
definition
haftmann@24749
   427
  SUPR :: "'b set \<Rightarrow> ('b \<Rightarrow> 'a) \<Rightarrow> 'a"
haftmann@23878
   428
where
haftmann@25206
   429
  "SUPR A f == \<Squnion> (f ` A)"
haftmann@23878
   430
haftmann@23878
   431
definition
haftmann@24749
   432
  INFI :: "'b set \<Rightarrow> ('b \<Rightarrow> 'a) \<Rightarrow> 'a"
haftmann@23878
   433
where
haftmann@25206
   434
  "INFI A f == \<Sqinter> (f ` A)"
haftmann@23878
   435
haftmann@24749
   436
end
haftmann@24749
   437
haftmann@23878
   438
syntax
haftmann@23878
   439
  "_SUP1"     :: "pttrns => 'b => 'b"           ("(3SUP _./ _)" [0, 10] 10)
haftmann@23878
   440
  "_SUP"      :: "pttrn => 'a set => 'b => 'b"  ("(3SUP _:_./ _)" [0, 10] 10)
haftmann@23878
   441
  "_INF1"     :: "pttrns => 'b => 'b"           ("(3INF _./ _)" [0, 10] 10)
haftmann@23878
   442
  "_INF"      :: "pttrn => 'a set => 'b => 'b"  ("(3INF _:_./ _)" [0, 10] 10)
haftmann@23878
   443
haftmann@23878
   444
translations
haftmann@23878
   445
  "SUP x y. B"   == "SUP x. SUP y. B"
haftmann@23878
   446
  "SUP x. B"     == "CONST SUPR UNIV (%x. B)"
haftmann@23878
   447
  "SUP x. B"     == "SUP x:UNIV. B"
haftmann@23878
   448
  "SUP x:A. B"   == "CONST SUPR A (%x. B)"
haftmann@23878
   449
  "INF x y. B"   == "INF x. INF y. B"
haftmann@23878
   450
  "INF x. B"     == "CONST INFI UNIV (%x. B)"
haftmann@23878
   451
  "INF x. B"     == "INF x:UNIV. B"
haftmann@23878
   452
  "INF x:A. B"   == "CONST INFI A (%x. B)"
haftmann@23878
   453
haftmann@23878
   454
(* To avoid eta-contraction of body: *)
haftmann@23878
   455
print_translation {*
haftmann@23878
   456
let
haftmann@23878
   457
  fun btr' syn (A :: Abs abs :: ts) =
haftmann@23878
   458
    let val (x,t) = atomic_abs_tr' abs
haftmann@23878
   459
    in list_comb (Syntax.const syn $ x $ A $ t, ts) end
haftmann@23878
   460
  val const_syntax_name = Sign.const_syntax_name @{theory} o fst o dest_Const
haftmann@23878
   461
in
haftmann@23878
   462
[(const_syntax_name @{term SUPR}, btr' "_SUP"),(const_syntax_name @{term "INFI"}, btr' "_INF")]
haftmann@23878
   463
end
haftmann@23878
   464
*}
haftmann@23878
   465
haftmann@25102
   466
context complete_lattice
haftmann@25102
   467
begin
haftmann@25102
   468
haftmann@23878
   469
lemma le_SUPI: "i : A \<Longrightarrow> M i \<le> (SUP i:A. M i)"
haftmann@23878
   470
  by (auto simp add: SUPR_def intro: Sup_upper)
haftmann@23878
   471
haftmann@23878
   472
lemma SUP_leI: "(\<And>i. i : A \<Longrightarrow> M i \<le> u) \<Longrightarrow> (SUP i:A. M i) \<le> u"
haftmann@23878
   473
  by (auto simp add: SUPR_def intro: Sup_least)
haftmann@23878
   474
haftmann@23878
   475
lemma INF_leI: "i : A \<Longrightarrow> (INF i:A. M i) \<le> M i"
haftmann@23878
   476
  by (auto simp add: INFI_def intro: Inf_lower)
haftmann@23878
   477
haftmann@23878
   478
lemma le_INFI: "(\<And>i. i : A \<Longrightarrow> u \<le> M i) \<Longrightarrow> u \<le> (INF i:A. M i)"
haftmann@23878
   479
  by (auto simp add: INFI_def intro: Inf_greatest)
haftmann@23878
   480
haftmann@23878
   481
lemma SUP_const[simp]: "A \<noteq> {} \<Longrightarrow> (SUP i:A. M) = M"
haftmann@25102
   482
  by (auto intro: antisym SUP_leI le_SUPI)
haftmann@23878
   483
haftmann@23878
   484
lemma INF_const[simp]: "A \<noteq> {} \<Longrightarrow> (INF i:A. M) = M"
haftmann@25102
   485
  by (auto intro: antisym INF_leI le_INFI)
haftmann@25102
   486
haftmann@25102
   487
end
haftmann@23878
   488
haftmann@23878
   489
haftmann@22454
   490
subsection {* Bool as lattice *}
haftmann@22454
   491
haftmann@25510
   492
instantiation bool :: distrib_lattice
haftmann@25510
   493
begin
haftmann@25510
   494
haftmann@25510
   495
definition
haftmann@25510
   496
  inf_bool_eq: "P \<sqinter> Q \<longleftrightarrow> P \<and> Q"
haftmann@25510
   497
haftmann@25510
   498
definition
haftmann@25510
   499
  sup_bool_eq: "P \<squnion> Q \<longleftrightarrow> P \<or> Q"
haftmann@25510
   500
haftmann@25510
   501
instance
haftmann@22454
   502
  by intro_classes (auto simp add: inf_bool_eq sup_bool_eq le_bool_def)
haftmann@22454
   503
haftmann@25510
   504
end
haftmann@25510
   505
haftmann@25510
   506
instantiation bool :: complete_lattice
haftmann@25510
   507
begin
haftmann@25510
   508
haftmann@25510
   509
definition
haftmann@25510
   510
  Inf_bool_def: "\<Sqinter>A \<longleftrightarrow> (\<forall>x\<in>A. x)"
haftmann@25510
   511
haftmann@25510
   512
definition
haftmann@25510
   513
  Sup_bool_def: "\<Squnion>A \<longleftrightarrow> (\<exists>x\<in>A. x)"
haftmann@25510
   514
haftmann@25510
   515
instance
haftmann@24345
   516
  by intro_classes (auto simp add: Inf_bool_def Sup_bool_def le_bool_def)
haftmann@23878
   517
haftmann@25510
   518
end
haftmann@25510
   519
haftmann@23878
   520
lemma Inf_empty_bool [simp]:
haftmann@25206
   521
  "\<Sqinter>{}"
haftmann@23878
   522
  unfolding Inf_bool_def by auto
haftmann@23878
   523
haftmann@23878
   524
lemma not_Sup_empty_bool [simp]:
haftmann@23878
   525
  "\<not> Sup {}"
haftmann@24345
   526
  unfolding Sup_bool_def by auto
haftmann@23878
   527
haftmann@23878
   528
lemma top_bool_eq: "top = True"
haftmann@23878
   529
  by (iprover intro!: order_antisym le_boolI top_greatest)
haftmann@23878
   530
haftmann@23878
   531
lemma bot_bool_eq: "bot = False"
haftmann@23878
   532
  by (iprover intro!: order_antisym le_boolI bot_least)
haftmann@23878
   533
haftmann@23878
   534
haftmann@23878
   535
subsection {* Set as lattice *}
haftmann@23878
   536
haftmann@25510
   537
instantiation set :: (type) distrib_lattice
haftmann@25510
   538
begin
haftmann@25510
   539
haftmann@25510
   540
definition
haftmann@25510
   541
  inf_set_eq [code func del]: "A \<sqinter> B = A \<inter> B"
haftmann@25510
   542
haftmann@25510
   543
definition
haftmann@25510
   544
  sup_set_eq [code func del]: "A \<squnion> B = A \<union> B"
haftmann@25510
   545
haftmann@25510
   546
instance
haftmann@23878
   547
  by intro_classes (auto simp add: inf_set_eq sup_set_eq)
haftmann@23878
   548
haftmann@25510
   549
end
haftmann@23878
   550
wenzelm@24514
   551
lemma mono_Int: "mono f \<Longrightarrow> f (A \<inter> B) \<subseteq> f A \<inter> f B"
wenzelm@24514
   552
  apply (fold inf_set_eq sup_set_eq)
wenzelm@24514
   553
  apply (erule mono_inf)
wenzelm@24514
   554
  done
haftmann@23878
   555
wenzelm@24514
   556
lemma mono_Un: "mono f \<Longrightarrow> f A \<union> f B \<subseteq> f (A \<union> B)"
wenzelm@24514
   557
  apply (fold inf_set_eq sup_set_eq)
wenzelm@24514
   558
  apply (erule mono_sup)
wenzelm@24514
   559
  done
haftmann@23878
   560
haftmann@25510
   561
instantiation set :: (type) complete_lattice
haftmann@25510
   562
begin
haftmann@25510
   563
haftmann@25510
   564
definition
haftmann@25510
   565
  Inf_set_def [code func del]: "\<Sqinter>S \<equiv> \<Inter>S"
haftmann@25510
   566
haftmann@25510
   567
definition
haftmann@25510
   568
  Sup_set_def [code func del]: "\<Squnion>S \<equiv> \<Union>S"
haftmann@25510
   569
haftmann@25510
   570
instance
haftmann@24345
   571
  by intro_classes (auto simp add: Inf_set_def Sup_set_def)
haftmann@23878
   572
haftmann@25510
   573
end
haftmann@23878
   574
haftmann@23878
   575
lemma top_set_eq: "top = UNIV"
haftmann@23878
   576
  by (iprover intro!: subset_antisym subset_UNIV top_greatest)
haftmann@23878
   577
haftmann@23878
   578
lemma bot_set_eq: "bot = {}"
haftmann@23878
   579
  by (iprover intro!: subset_antisym empty_subsetI bot_least)
haftmann@23878
   580
haftmann@23878
   581
haftmann@23878
   582
subsection {* Fun as lattice *}
haftmann@23878
   583
haftmann@25510
   584
instantiation "fun" :: (type, lattice) lattice
haftmann@25510
   585
begin
haftmann@25510
   586
haftmann@25510
   587
definition
haftmann@25510
   588
  inf_fun_eq [code func del]: "f \<sqinter> g = (\<lambda>x. f x \<sqinter> g x)"
haftmann@25510
   589
haftmann@25510
   590
definition
haftmann@25510
   591
  sup_fun_eq [code func del]: "f \<squnion> g = (\<lambda>x. f x \<squnion> g x)"
haftmann@25510
   592
haftmann@25510
   593
instance
haftmann@23878
   594
apply intro_classes
haftmann@23878
   595
unfolding inf_fun_eq sup_fun_eq
haftmann@23878
   596
apply (auto intro: le_funI)
haftmann@23878
   597
apply (rule le_funI)
haftmann@23878
   598
apply (auto dest: le_funD)
haftmann@23878
   599
apply (rule le_funI)
haftmann@23878
   600
apply (auto dest: le_funD)
haftmann@23878
   601
done
haftmann@23878
   602
haftmann@25510
   603
end
haftmann@23878
   604
haftmann@23878
   605
instance "fun" :: (type, distrib_lattice) distrib_lattice
haftmann@23878
   606
  by default (auto simp add: inf_fun_eq sup_fun_eq sup_inf_distrib1)
haftmann@23878
   607
haftmann@25510
   608
instantiation "fun" :: (type, complete_lattice) complete_lattice
haftmann@25510
   609
begin
haftmann@25510
   610
haftmann@25510
   611
definition
haftmann@25510
   612
  Inf_fun_def [code func del]: "\<Sqinter>A = (\<lambda>x. \<Sqinter>{y. \<exists>f\<in>A. y = f x})"
haftmann@25510
   613
haftmann@25510
   614
definition
haftmann@25510
   615
  Sup_fun_def [code func del]: "\<Squnion>A = (\<lambda>x. \<Squnion>{y. \<exists>f\<in>A. y = f x})"
haftmann@25510
   616
haftmann@25510
   617
instance
haftmann@24345
   618
  by intro_classes
haftmann@24345
   619
    (auto simp add: Inf_fun_def Sup_fun_def le_fun_def
haftmann@24345
   620
      intro: Inf_lower Sup_upper Inf_greatest Sup_least)
haftmann@23878
   621
haftmann@25510
   622
end
haftmann@23878
   623
haftmann@23878
   624
lemma Inf_empty_fun:
haftmann@25206
   625
  "\<Sqinter>{} = (\<lambda>_. \<Sqinter>{})"
haftmann@23878
   626
  by rule (auto simp add: Inf_fun_def)
haftmann@23878
   627
haftmann@23878
   628
lemma Sup_empty_fun:
haftmann@25206
   629
  "\<Squnion>{} = (\<lambda>_. \<Squnion>{})"
haftmann@24345
   630
  by rule (auto simp add: Sup_fun_def)
haftmann@23878
   631
haftmann@23878
   632
lemma top_fun_eq: "top = (\<lambda>x. top)"
haftmann@23878
   633
  by (iprover intro!: order_antisym le_funI top_greatest)
haftmann@23878
   634
haftmann@23878
   635
lemma bot_fun_eq: "bot = (\<lambda>x. bot)"
haftmann@23878
   636
  by (iprover intro!: order_antisym le_funI bot_least)
haftmann@23878
   637
haftmann@23878
   638
haftmann@23878
   639
text {* redundant bindings *}
haftmann@22454
   640
haftmann@22454
   641
lemmas inf_aci = inf_ACI
haftmann@22454
   642
lemmas sup_aci = sup_ACI
haftmann@22454
   643
haftmann@25062
   644
no_notation
wenzelm@25382
   645
  less_eq  (infix "\<sqsubseteq>" 50) and
wenzelm@25382
   646
  less (infix "\<sqsubset>" 50) and
wenzelm@25382
   647
  inf  (infixl "\<sqinter>" 70) and
wenzelm@25382
   648
  sup  (infixl "\<squnion>" 65) and
wenzelm@25382
   649
  Inf  ("\<Sqinter>_" [900] 900) and
wenzelm@25382
   650
  Sup  ("\<Squnion>_" [900] 900)
haftmann@25062
   651
haftmann@21249
   652
end