src/HOL/Complete_Lattices.thy
author noschinl
Tue Sep 13 16:21:48 2011 +0200 (2011-09-13)
changeset 44918 6a80fbc4e72c
parent 44860 56101fa00193
child 44919 482f1807976e
permissions -rw-r--r--
tune simpset for Complete_Lattices
haftmann@44103
     1
 (*  Author:     Tobias Nipkow, Lawrence C Paulson and Markus Wenzel; Florian Haftmann, TU Muenchen *)
wenzelm@11979
     2
haftmann@44104
     3
header {* Complete lattices *}
haftmann@32077
     4
haftmann@44860
     5
theory Complete_Lattices
haftmann@32139
     6
imports Set
haftmann@32139
     7
begin
haftmann@32077
     8
haftmann@32077
     9
notation
haftmann@34007
    10
  less_eq (infix "\<sqsubseteq>" 50) and
haftmann@32077
    11
  less (infix "\<sqsubset>" 50) and
haftmann@34007
    12
  inf (infixl "\<sqinter>" 70) and
haftmann@34007
    13
  sup (infixl "\<squnion>" 65) and
haftmann@32678
    14
  top ("\<top>") and
haftmann@32678
    15
  bot ("\<bottom>")
haftmann@32077
    16
haftmann@32139
    17
haftmann@32879
    18
subsection {* Syntactic infimum and supremum operations *}
haftmann@32879
    19
haftmann@32879
    20
class Inf =
haftmann@32879
    21
  fixes Inf :: "'a set \<Rightarrow> 'a" ("\<Sqinter>_" [900] 900)
haftmann@32879
    22
haftmann@32879
    23
class Sup =
haftmann@32879
    24
  fixes Sup :: "'a set \<Rightarrow> 'a" ("\<Squnion>_" [900] 900)
haftmann@32879
    25
haftmann@32139
    26
subsection {* Abstract complete lattices *}
haftmann@32139
    27
haftmann@34007
    28
class complete_lattice = bounded_lattice + Inf + Sup +
haftmann@32077
    29
  assumes Inf_lower: "x \<in> A \<Longrightarrow> \<Sqinter>A \<sqsubseteq> x"
haftmann@32077
    30
     and Inf_greatest: "(\<And>x. x \<in> A \<Longrightarrow> z \<sqsubseteq> x) \<Longrightarrow> z \<sqsubseteq> \<Sqinter>A"
haftmann@32077
    31
  assumes Sup_upper: "x \<in> A \<Longrightarrow> x \<sqsubseteq> \<Squnion>A"
haftmann@32077
    32
     and Sup_least: "(\<And>x. x \<in> A \<Longrightarrow> x \<sqsubseteq> z) \<Longrightarrow> \<Squnion>A \<sqsubseteq> z"
haftmann@32077
    33
begin
haftmann@32077
    34
haftmann@32678
    35
lemma dual_complete_lattice:
krauss@44845
    36
  "class.complete_lattice Sup Inf sup (op \<ge>) (op >) inf \<top> \<bottom>"
haftmann@36635
    37
  by (auto intro!: class.complete_lattice.intro dual_bounded_lattice)
haftmann@34007
    38
    (unfold_locales, (fact bot_least top_greatest
haftmann@34007
    39
        Sup_upper Sup_least Inf_lower Inf_greatest)+)
haftmann@32678
    40
haftmann@44040
    41
definition INFI :: "'b set \<Rightarrow> ('b \<Rightarrow> 'a) \<Rightarrow> 'a" where
haftmann@44040
    42
  INF_def: "INFI A f = \<Sqinter>(f ` A)"
haftmann@44040
    43
haftmann@44040
    44
definition SUPR :: "'b set \<Rightarrow> ('b \<Rightarrow> 'a) \<Rightarrow> 'a" where
haftmann@44040
    45
  SUP_def: "SUPR A f = \<Squnion>(f ` A)"
haftmann@44040
    46
haftmann@44040
    47
text {*
haftmann@44040
    48
  Note: must use names @{const INFI} and @{const SUPR} here instead of
haftmann@44040
    49
  @{text INF} and @{text SUP} to allow the following syntax coexist
haftmann@44040
    50
  with the plain constant names.
haftmann@44040
    51
*}
haftmann@44040
    52
haftmann@44040
    53
end
haftmann@44040
    54
haftmann@44040
    55
syntax
haftmann@44040
    56
  "_INF1"     :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b"           ("(3INF _./ _)" [0, 10] 10)
haftmann@44040
    57
  "_INF"      :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b"  ("(3INF _:_./ _)" [0, 0, 10] 10)
haftmann@44040
    58
  "_SUP1"     :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b"           ("(3SUP _./ _)" [0, 10] 10)
haftmann@44040
    59
  "_SUP"      :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b"  ("(3SUP _:_./ _)" [0, 0, 10] 10)
haftmann@44040
    60
haftmann@44040
    61
syntax (xsymbols)
haftmann@44040
    62
  "_INF1"     :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b"           ("(3\<Sqinter>_./ _)" [0, 10] 10)
haftmann@44040
    63
  "_INF"      :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b"  ("(3\<Sqinter>_\<in>_./ _)" [0, 0, 10] 10)
haftmann@44040
    64
  "_SUP1"     :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b"           ("(3\<Squnion>_./ _)" [0, 10] 10)
haftmann@44040
    65
  "_SUP"      :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b"  ("(3\<Squnion>_\<in>_./ _)" [0, 0, 10] 10)
haftmann@44040
    66
haftmann@44040
    67
translations
haftmann@44040
    68
  "INF x y. B"   == "INF x. INF y. B"
haftmann@44040
    69
  "INF x. B"     == "CONST INFI CONST UNIV (%x. B)"
haftmann@44040
    70
  "INF x. B"     == "INF x:CONST UNIV. B"
haftmann@44040
    71
  "INF x:A. B"   == "CONST INFI A (%x. B)"
haftmann@44040
    72
  "SUP x y. B"   == "SUP x. SUP y. B"
haftmann@44040
    73
  "SUP x. B"     == "CONST SUPR CONST UNIV (%x. B)"
haftmann@44040
    74
  "SUP x. B"     == "SUP x:CONST UNIV. B"
haftmann@44040
    75
  "SUP x:A. B"   == "CONST SUPR A (%x. B)"
haftmann@44040
    76
haftmann@44040
    77
print_translation {*
haftmann@44040
    78
  [Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax INFI} @{syntax_const "_INF"},
haftmann@44040
    79
    Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax SUPR} @{syntax_const "_SUP"}]
haftmann@44040
    80
*} -- {* to avoid eta-contraction of body *}
haftmann@44040
    81
haftmann@44040
    82
context complete_lattice
haftmann@44040
    83
begin
haftmann@32077
    84
haftmann@44040
    85
lemma INF_foundation_dual [no_atp]:
haftmann@44040
    86
  "complete_lattice.SUPR Inf = INFI"
haftmann@44040
    87
proof (rule ext)+
krauss@44845
    88
  interpret dual: complete_lattice Sup Inf sup "op \<ge>" "op >" inf \<top> \<bottom>
haftmann@44040
    89
    by (fact dual_complete_lattice)
haftmann@44040
    90
  fix f :: "'b \<Rightarrow> 'a" and A
haftmann@44040
    91
  show "complete_lattice.SUPR Inf A f = (\<Sqinter>a\<in>A. f a)"
haftmann@44040
    92
    by (simp only: dual.SUP_def INF_def)
haftmann@44040
    93
qed
haftmann@44040
    94
haftmann@44040
    95
lemma SUP_foundation_dual [no_atp]:
haftmann@44040
    96
  "complete_lattice.INFI Sup = SUPR"
haftmann@44040
    97
proof (rule ext)+
krauss@44845
    98
  interpret dual: complete_lattice Sup Inf sup "op \<ge>" "op >" inf \<top> \<bottom>
haftmann@44040
    99
    by (fact dual_complete_lattice)
haftmann@44040
   100
  fix f :: "'b \<Rightarrow> 'a" and A
haftmann@44040
   101
  show "complete_lattice.INFI Sup A f = (\<Squnion>a\<in>A. f a)"
haftmann@44040
   102
    by (simp only: dual.INF_def SUP_def)
haftmann@44040
   103
qed
haftmann@44040
   104
haftmann@44103
   105
lemma INF_lower: "i \<in> A \<Longrightarrow> (\<Sqinter>i\<in>A. f i) \<sqsubseteq> f i"
haftmann@44040
   106
  by (auto simp add: INF_def intro: Inf_lower)
haftmann@44040
   107
haftmann@44103
   108
lemma INF_greatest: "(\<And>i. i \<in> A \<Longrightarrow> u \<sqsubseteq> f i) \<Longrightarrow> u \<sqsubseteq> (\<Sqinter>i\<in>A. f i)"
haftmann@44103
   109
  by (auto simp add: INF_def intro: Inf_greatest)
haftmann@44103
   110
haftmann@44103
   111
lemma SUP_upper: "i \<in> A \<Longrightarrow> f i \<sqsubseteq> (\<Squnion>i\<in>A. f i)"
haftmann@44040
   112
  by (auto simp add: SUP_def intro: Sup_upper)
haftmann@44040
   113
haftmann@44103
   114
lemma SUP_least: "(\<And>i. i \<in> A \<Longrightarrow> f i \<sqsubseteq> u) \<Longrightarrow> (\<Squnion>i\<in>A. f i) \<sqsubseteq> u"
haftmann@44040
   115
  by (auto simp add: SUP_def intro: Sup_least)
haftmann@44040
   116
haftmann@44040
   117
lemma Inf_lower2: "u \<in> A \<Longrightarrow> u \<sqsubseteq> v \<Longrightarrow> \<Sqinter>A \<sqsubseteq> v"
haftmann@44040
   118
  using Inf_lower [of u A] by auto
haftmann@44040
   119
haftmann@44103
   120
lemma INF_lower2: "i \<in> A \<Longrightarrow> f i \<sqsubseteq> u \<Longrightarrow> (\<Sqinter>i\<in>A. f i) \<sqsubseteq> u"
haftmann@44103
   121
  using INF_lower [of i A f] by auto
haftmann@44040
   122
haftmann@44040
   123
lemma Sup_upper2: "u \<in> A \<Longrightarrow> v \<sqsubseteq> u \<Longrightarrow> v \<sqsubseteq> \<Squnion>A"
haftmann@44040
   124
  using Sup_upper [of u A] by auto
haftmann@44040
   125
haftmann@44103
   126
lemma SUP_upper2: "i \<in> A \<Longrightarrow> u \<sqsubseteq> f i \<Longrightarrow> u \<sqsubseteq> (\<Squnion>i\<in>A. f i)"
haftmann@44103
   127
  using SUP_upper [of i A f] by auto
haftmann@44040
   128
noschinl@44918
   129
lemma le_Inf_iff: "b \<sqsubseteq> \<Sqinter>A \<longleftrightarrow> (\<forall>a\<in>A. b \<sqsubseteq> a)"
haftmann@44040
   130
  by (auto intro: Inf_greatest dest: Inf_lower)
haftmann@44040
   131
noschinl@44918
   132
lemma le_INF_iff: "u \<sqsubseteq> (\<Sqinter>i\<in>A. f i) \<longleftrightarrow> (\<forall>i\<in>A. u \<sqsubseteq> f i)"
haftmann@44040
   133
  by (auto simp add: INF_def le_Inf_iff)
haftmann@44040
   134
noschinl@44918
   135
lemma Sup_le_iff: "\<Squnion>A \<sqsubseteq> b \<longleftrightarrow> (\<forall>a\<in>A. a \<sqsubseteq> b)"
haftmann@44040
   136
  by (auto intro: Sup_least dest: Sup_upper)
haftmann@44040
   137
noschinl@44918
   138
lemma SUP_le_iff: "(\<Squnion>i\<in>A. f i) \<sqsubseteq> u \<longleftrightarrow> (\<forall>i\<in>A. f i \<sqsubseteq> u)"
haftmann@44040
   139
  by (auto simp add: SUP_def Sup_le_iff)
haftmann@32077
   140
haftmann@41080
   141
lemma Inf_empty [simp]:
haftmann@34007
   142
  "\<Sqinter>{} = \<top>"
haftmann@34007
   143
  by (auto intro: antisym Inf_greatest)
haftmann@32077
   144
huffman@44067
   145
lemma INF_empty [simp]: "(\<Sqinter>x\<in>{}. f x) = \<top>"
haftmann@44040
   146
  by (simp add: INF_def)
haftmann@44040
   147
haftmann@41080
   148
lemma Sup_empty [simp]:
haftmann@34007
   149
  "\<Squnion>{} = \<bottom>"
haftmann@34007
   150
  by (auto intro: antisym Sup_least)
haftmann@32077
   151
huffman@44067
   152
lemma SUP_empty [simp]: "(\<Squnion>x\<in>{}. f x) = \<bottom>"
haftmann@44040
   153
  by (simp add: SUP_def)
haftmann@44040
   154
haftmann@41080
   155
lemma Inf_UNIV [simp]:
haftmann@41080
   156
  "\<Sqinter>UNIV = \<bottom>"
haftmann@44040
   157
  by (auto intro!: antisym Inf_lower)
haftmann@41080
   158
haftmann@41080
   159
lemma Sup_UNIV [simp]:
haftmann@41080
   160
  "\<Squnion>UNIV = \<top>"
haftmann@44040
   161
  by (auto intro!: antisym Sup_upper)
haftmann@41080
   162
noschinl@44918
   163
lemma Inf_insert [simp]: "\<Sqinter>insert a A = a \<sqinter> \<Sqinter>A"
haftmann@32077
   164
  by (auto intro: le_infI le_infI1 le_infI2 antisym Inf_greatest Inf_lower)
haftmann@32077
   165
haftmann@44040
   166
lemma INF_insert: "(\<Sqinter>x\<in>insert a A. f x) = f a \<sqinter> INFI A f"
haftmann@44040
   167
  by (simp add: INF_def Inf_insert)
haftmann@44040
   168
noschinl@44918
   169
lemma Sup_insert [simp]: "\<Squnion>insert a A = a \<squnion> \<Squnion>A"
haftmann@32077
   170
  by (auto intro: le_supI le_supI1 le_supI2 antisym Sup_least Sup_upper)
haftmann@32077
   171
haftmann@44040
   172
lemma SUP_insert: "(\<Squnion>x\<in>insert a A. f x) = f a \<squnion> SUPR A f"
haftmann@44040
   173
  by (simp add: SUP_def Sup_insert)
haftmann@44040
   174
noschinl@44918
   175
lemma INF_image [simp]: "(\<Sqinter>x\<in>f`A. g x) = (\<Sqinter>x\<in>A. g (f x))"
huffman@44068
   176
  by (simp add: INF_def image_image)
huffman@44068
   177
noschinl@44918
   178
lemma SUP_image [simp]: "(\<Squnion>x\<in>f`A. g x) = (\<Squnion>x\<in>A. g (f x))"
huffman@44068
   179
  by (simp add: SUP_def image_image)
huffman@44068
   180
haftmann@44040
   181
lemma Inf_Sup: "\<Sqinter>A = \<Squnion>{b. \<forall>a \<in> A. b \<sqsubseteq> a}"
haftmann@44040
   182
  by (auto intro: antisym Inf_lower Inf_greatest Sup_upper Sup_least)
haftmann@44040
   183
haftmann@44040
   184
lemma Sup_Inf:  "\<Squnion>A = \<Sqinter>{b. \<forall>a \<in> A. a \<sqsubseteq> b}"
haftmann@44040
   185
  by (auto intro: antisym Inf_lower Inf_greatest Sup_upper Sup_least)
haftmann@44040
   186
haftmann@43899
   187
lemma Inf_superset_mono: "B \<subseteq> A \<Longrightarrow> \<Sqinter>A \<sqsubseteq> \<Sqinter>B"
haftmann@43899
   188
  by (auto intro: Inf_greatest Inf_lower)
haftmann@43899
   189
haftmann@43899
   190
lemma Sup_subset_mono: "A \<subseteq> B \<Longrightarrow> \<Squnion>A \<sqsubseteq> \<Squnion>B"
haftmann@43899
   191
  by (auto intro: Sup_least Sup_upper)
haftmann@43899
   192
haftmann@44041
   193
lemma INF_cong:
haftmann@44041
   194
  "A = B \<Longrightarrow> (\<And>x. x \<in> B \<Longrightarrow> C x = D x) \<Longrightarrow> (\<Sqinter>x\<in>A. C x) = (\<Sqinter>x\<in>B. D x)"
haftmann@44041
   195
  by (simp add: INF_def image_def)
haftmann@44041
   196
haftmann@44041
   197
lemma SUP_cong:
haftmann@44041
   198
  "A = B \<Longrightarrow> (\<And>x. x \<in> B \<Longrightarrow> C x = D x) \<Longrightarrow> (\<Squnion>x\<in>A. C x) = (\<Squnion>x\<in>B. D x)"
haftmann@44041
   199
  by (simp add: SUP_def image_def)
haftmann@44041
   200
hoelzl@38705
   201
lemma Inf_mono:
hoelzl@41971
   202
  assumes "\<And>b. b \<in> B \<Longrightarrow> \<exists>a\<in>A. a \<sqsubseteq> b"
haftmann@43741
   203
  shows "\<Sqinter>A \<sqsubseteq> \<Sqinter>B"
hoelzl@38705
   204
proof (rule Inf_greatest)
hoelzl@38705
   205
  fix b assume "b \<in> B"
hoelzl@41971
   206
  with assms obtain a where "a \<in> A" and "a \<sqsubseteq> b" by blast
haftmann@43741
   207
  from `a \<in> A` have "\<Sqinter>A \<sqsubseteq> a" by (rule Inf_lower)
haftmann@43741
   208
  with `a \<sqsubseteq> b` show "\<Sqinter>A \<sqsubseteq> b" by auto
hoelzl@38705
   209
qed
hoelzl@38705
   210
haftmann@44041
   211
lemma INF_mono:
haftmann@44041
   212
  "(\<And>m. m \<in> B \<Longrightarrow> \<exists>n\<in>A. f n \<sqsubseteq> g m) \<Longrightarrow> (\<Sqinter>n\<in>A. f n) \<sqsubseteq> (\<Sqinter>n\<in>B. g n)"
noschinl@44918
   213
  unfolding INF_def by (rule Inf_mono) fast
haftmann@44041
   214
haftmann@41082
   215
lemma Sup_mono:
hoelzl@41971
   216
  assumes "\<And>a. a \<in> A \<Longrightarrow> \<exists>b\<in>B. a \<sqsubseteq> b"
haftmann@43741
   217
  shows "\<Squnion>A \<sqsubseteq> \<Squnion>B"
haftmann@41082
   218
proof (rule Sup_least)
haftmann@41082
   219
  fix a assume "a \<in> A"
hoelzl@41971
   220
  with assms obtain b where "b \<in> B" and "a \<sqsubseteq> b" by blast
haftmann@43741
   221
  from `b \<in> B` have "b \<sqsubseteq> \<Squnion>B" by (rule Sup_upper)
haftmann@43741
   222
  with `a \<sqsubseteq> b` show "a \<sqsubseteq> \<Squnion>B" by auto
haftmann@41082
   223
qed
haftmann@32077
   224
haftmann@44041
   225
lemma SUP_mono:
haftmann@44041
   226
  "(\<And>n. n \<in> A \<Longrightarrow> \<exists>m\<in>B. f n \<sqsubseteq> g m) \<Longrightarrow> (\<Squnion>n\<in>A. f n) \<sqsubseteq> (\<Squnion>n\<in>B. g n)"
noschinl@44918
   227
  unfolding SUP_def by (rule Sup_mono) fast
haftmann@44041
   228
haftmann@44041
   229
lemma INF_superset_mono:
haftmann@44041
   230
  "B \<subseteq> A \<Longrightarrow> (\<And>x. x \<in> B \<Longrightarrow> f x \<sqsubseteq> g x) \<Longrightarrow> (\<Sqinter>x\<in>A. f x) \<sqsubseteq> (\<Sqinter>x\<in>B. g x)"
haftmann@44041
   231
  -- {* The last inclusion is POSITIVE! *}
haftmann@44041
   232
  by (blast intro: INF_mono dest: subsetD)
haftmann@44041
   233
haftmann@44041
   234
lemma SUP_subset_mono:
haftmann@44041
   235
  "A \<subseteq> B \<Longrightarrow> (\<And>x. x \<in> A \<Longrightarrow> f x \<sqsubseteq> g x) \<Longrightarrow> (\<Squnion>x\<in>A. f x) \<sqsubseteq> (\<Squnion>x\<in>B. g x)"
haftmann@44041
   236
  by (blast intro: SUP_mono dest: subsetD)
haftmann@44041
   237
haftmann@43868
   238
lemma Inf_less_eq:
haftmann@43868
   239
  assumes "\<And>v. v \<in> A \<Longrightarrow> v \<sqsubseteq> u"
haftmann@43868
   240
    and "A \<noteq> {}"
haftmann@43868
   241
  shows "\<Sqinter>A \<sqsubseteq> u"
haftmann@43868
   242
proof -
haftmann@43868
   243
  from `A \<noteq> {}` obtain v where "v \<in> A" by blast
haftmann@43868
   244
  moreover with assms have "v \<sqsubseteq> u" by blast
haftmann@43868
   245
  ultimately show ?thesis by (rule Inf_lower2)
haftmann@43868
   246
qed
haftmann@43868
   247
haftmann@43868
   248
lemma less_eq_Sup:
haftmann@43868
   249
  assumes "\<And>v. v \<in> A \<Longrightarrow> u \<sqsubseteq> v"
haftmann@43868
   250
    and "A \<noteq> {}"
haftmann@43868
   251
  shows "u \<sqsubseteq> \<Squnion>A"
haftmann@43868
   252
proof -
haftmann@43868
   253
  from `A \<noteq> {}` obtain v where "v \<in> A" by blast
haftmann@43868
   254
  moreover with assms have "u \<sqsubseteq> v" by blast
haftmann@43868
   255
  ultimately show ?thesis by (rule Sup_upper2)
haftmann@43868
   256
qed
haftmann@43868
   257
haftmann@43899
   258
lemma less_eq_Inf_inter: "\<Sqinter>A \<squnion> \<Sqinter>B \<sqsubseteq> \<Sqinter>(A \<inter> B)"
haftmann@43868
   259
  by (auto intro: Inf_greatest Inf_lower)
haftmann@43868
   260
haftmann@43899
   261
lemma Sup_inter_less_eq: "\<Squnion>(A \<inter> B) \<sqsubseteq> \<Squnion>A \<sqinter> \<Squnion>B "
haftmann@43868
   262
  by (auto intro: Sup_least Sup_upper)
haftmann@43868
   263
haftmann@43868
   264
lemma Inf_union_distrib: "\<Sqinter>(A \<union> B) = \<Sqinter>A \<sqinter> \<Sqinter>B"
haftmann@43868
   265
  by (rule antisym) (auto intro: Inf_greatest Inf_lower le_infI1 le_infI2)
haftmann@43868
   266
haftmann@44041
   267
lemma INF_union:
haftmann@44041
   268
  "(\<Sqinter>i \<in> A \<union> B. M i) = (\<Sqinter>i \<in> A. M i) \<sqinter> (\<Sqinter>i\<in>B. M i)"
haftmann@44103
   269
  by (auto intro!: antisym INF_mono intro: le_infI1 le_infI2 INF_greatest INF_lower)
haftmann@44041
   270
haftmann@43868
   271
lemma Sup_union_distrib: "\<Squnion>(A \<union> B) = \<Squnion>A \<squnion> \<Squnion>B"
haftmann@43868
   272
  by (rule antisym) (auto intro: Sup_least Sup_upper le_supI1 le_supI2)
haftmann@43868
   273
haftmann@44041
   274
lemma SUP_union:
haftmann@44041
   275
  "(\<Squnion>i \<in> A \<union> B. M i) = (\<Squnion>i \<in> A. M i) \<squnion> (\<Squnion>i\<in>B. M i)"
haftmann@44103
   276
  by (auto intro!: antisym SUP_mono intro: le_supI1 le_supI2 SUP_least SUP_upper)
haftmann@44041
   277
haftmann@44041
   278
lemma INF_inf_distrib: "(\<Sqinter>a\<in>A. f a) \<sqinter> (\<Sqinter>a\<in>A. g a) = (\<Sqinter>a\<in>A. f a \<sqinter> g a)"
haftmann@44103
   279
  by (rule antisym) (rule INF_greatest, auto intro: le_infI1 le_infI2 INF_lower INF_mono)
haftmann@44041
   280
noschinl@44918
   281
lemma SUP_sup_distrib: "(\<Squnion>a\<in>A. f a) \<squnion> (\<Squnion>a\<in>A. g a) = (\<Squnion>a\<in>A. f a \<squnion> g a)" (is "?L = ?R")
noschinl@44918
   282
proof (rule antisym)
noschinl@44918
   283
  show "?L \<le> ?R" by (auto intro: le_supI1 le_supI2 SUP_upper SUP_mono)
noschinl@44918
   284
next
noschinl@44918
   285
  show "?R \<le> ?L" by (rule SUP_least) (auto intro: le_supI1 le_supI2 SUP_upper)
noschinl@44918
   286
qed
haftmann@44041
   287
noschinl@44918
   288
lemma Inf_top_conv [simp, no_atp]:
haftmann@43868
   289
  "\<Sqinter>A = \<top> \<longleftrightarrow> (\<forall>x\<in>A. x = \<top>)"
haftmann@43868
   290
  "\<top> = \<Sqinter>A \<longleftrightarrow> (\<forall>x\<in>A. x = \<top>)"
haftmann@43868
   291
proof -
haftmann@43868
   292
  show "\<Sqinter>A = \<top> \<longleftrightarrow> (\<forall>x\<in>A. x = \<top>)"
haftmann@43868
   293
  proof
haftmann@43868
   294
    assume "\<forall>x\<in>A. x = \<top>"
haftmann@43868
   295
    then have "A = {} \<or> A = {\<top>}" by auto
haftmann@44083
   296
    then show "\<Sqinter>A = \<top>" by (auto simp add: Inf_insert)
haftmann@43868
   297
  next
haftmann@43868
   298
    assume "\<Sqinter>A = \<top>"
haftmann@43868
   299
    show "\<forall>x\<in>A. x = \<top>"
haftmann@43868
   300
    proof (rule ccontr)
haftmann@43868
   301
      assume "\<not> (\<forall>x\<in>A. x = \<top>)"
haftmann@43868
   302
      then obtain x where "x \<in> A" and "x \<noteq> \<top>" by blast
haftmann@43868
   303
      then obtain B where "A = insert x B" by blast
haftmann@43868
   304
      with `\<Sqinter>A = \<top>` `x \<noteq> \<top>` show False by (simp add: Inf_insert)
haftmann@43868
   305
    qed
haftmann@43868
   306
  qed
haftmann@43868
   307
  then show "\<top> = \<Sqinter>A \<longleftrightarrow> (\<forall>x\<in>A. x = \<top>)" by auto
haftmann@43868
   308
qed
haftmann@43868
   309
noschinl@44918
   310
lemma INF_top_conv [simp]:
haftmann@44041
   311
 "(\<Sqinter>x\<in>A. B x) = \<top> \<longleftrightarrow> (\<forall>x\<in>A. B x = \<top>)"
haftmann@44041
   312
 "\<top> = (\<Sqinter>x\<in>A. B x) \<longleftrightarrow> (\<forall>x\<in>A. B x = \<top>)"
haftmann@44041
   313
  by (auto simp add: INF_def Inf_top_conv)
haftmann@44041
   314
noschinl@44918
   315
lemma Sup_bot_conv [simp, no_atp]:
haftmann@43868
   316
  "\<Squnion>A = \<bottom> \<longleftrightarrow> (\<forall>x\<in>A. x = \<bottom>)" (is ?P)
haftmann@43868
   317
  "\<bottom> = \<Squnion>A \<longleftrightarrow> (\<forall>x\<in>A. x = \<bottom>)" (is ?Q)
haftmann@43868
   318
proof -
krauss@44845
   319
  interpret dual: complete_lattice Sup Inf sup "op \<ge>" "op >" inf \<top> \<bottom>
haftmann@43868
   320
    by (fact dual_complete_lattice)
haftmann@43868
   321
  from dual.Inf_top_conv show ?P and ?Q by simp_all
haftmann@43868
   322
qed
haftmann@43868
   323
noschinl@44918
   324
lemma SUP_bot_conv [simp]:
haftmann@44041
   325
 "(\<Squnion>x\<in>A. B x) = \<bottom> \<longleftrightarrow> (\<forall>x\<in>A. B x = \<bottom>)"
haftmann@44041
   326
 "\<bottom> = (\<Squnion>x\<in>A. B x) \<longleftrightarrow> (\<forall>x\<in>A. B x = \<bottom>)"
haftmann@44041
   327
  by (auto simp add: SUP_def Sup_bot_conv)
haftmann@44041
   328
haftmann@43865
   329
lemma INF_const [simp]: "A \<noteq> {} \<Longrightarrow> (\<Sqinter>i\<in>A. f) = f"
haftmann@44103
   330
  by (auto intro: antisym INF_lower INF_greatest)
haftmann@32077
   331
haftmann@43870
   332
lemma SUP_const [simp]: "A \<noteq> {} \<Longrightarrow> (\<Squnion>i\<in>A. f) = f"
haftmann@44103
   333
  by (auto intro: antisym SUP_upper SUP_least)
haftmann@43870
   334
noschinl@44918
   335
lemma INF_top [simp]: "(\<Sqinter>x\<in>A. \<top>) = \<top>"
haftmann@43900
   336
  by (cases "A = {}") (simp_all add: INF_empty)
haftmann@43900
   337
noschinl@44918
   338
lemma SUP_bot [simp]: "(\<Squnion>x\<in>A. \<bottom>) = \<bottom>"
haftmann@43900
   339
  by (cases "A = {}") (simp_all add: SUP_empty)
haftmann@43900
   340
haftmann@43865
   341
lemma INF_commute: "(\<Sqinter>i\<in>A. \<Sqinter>j\<in>B. f i j) = (\<Sqinter>j\<in>B. \<Sqinter>i\<in>A. f i j)"
haftmann@44103
   342
  by (iprover intro: INF_lower INF_greatest order_trans antisym)
haftmann@43865
   343
haftmann@43870
   344
lemma SUP_commute: "(\<Squnion>i\<in>A. \<Squnion>j\<in>B. f i j) = (\<Squnion>j\<in>B. \<Squnion>i\<in>A. f i j)"
haftmann@44103
   345
  by (iprover intro: SUP_upper SUP_least order_trans antisym)
haftmann@43870
   346
haftmann@43871
   347
lemma INF_absorb:
haftmann@43868
   348
  assumes "k \<in> I"
haftmann@43868
   349
  shows "A k \<sqinter> (\<Sqinter>i\<in>I. A i) = (\<Sqinter>i\<in>I. A i)"
haftmann@43868
   350
proof -
haftmann@43868
   351
  from assms obtain J where "I = insert k J" by blast
haftmann@43868
   352
  then show ?thesis by (simp add: INF_insert)
haftmann@43868
   353
qed
haftmann@43868
   354
haftmann@43871
   355
lemma SUP_absorb:
haftmann@43871
   356
  assumes "k \<in> I"
haftmann@43871
   357
  shows "A k \<squnion> (\<Squnion>i\<in>I. A i) = (\<Squnion>i\<in>I. A i)"
haftmann@43871
   358
proof -
haftmann@43871
   359
  from assms obtain J where "I = insert k J" by blast
haftmann@43871
   360
  then show ?thesis by (simp add: SUP_insert)
haftmann@43871
   361
qed
haftmann@43871
   362
haftmann@43871
   363
lemma INF_constant:
haftmann@43868
   364
  "(\<Sqinter>y\<in>A. c) = (if A = {} then \<top> else c)"
haftmann@43868
   365
  by (simp add: INF_empty)
haftmann@43868
   366
haftmann@43871
   367
lemma SUP_constant:
haftmann@43871
   368
  "(\<Squnion>y\<in>A. c) = (if A = {} then \<bottom> else c)"
haftmann@43871
   369
  by (simp add: SUP_empty)
haftmann@43871
   370
haftmann@43943
   371
lemma less_INF_D:
haftmann@43943
   372
  assumes "y < (\<Sqinter>i\<in>A. f i)" "i \<in> A" shows "y < f i"
haftmann@43943
   373
proof -
haftmann@43943
   374
  note `y < (\<Sqinter>i\<in>A. f i)`
haftmann@43943
   375
  also have "(\<Sqinter>i\<in>A. f i) \<le> f i" using `i \<in> A`
haftmann@44103
   376
    by (rule INF_lower)
haftmann@43943
   377
  finally show "y < f i" .
haftmann@43943
   378
qed
haftmann@43943
   379
haftmann@43943
   380
lemma SUP_lessD:
haftmann@43943
   381
  assumes "(\<Squnion>i\<in>A. f i) < y" "i \<in> A" shows "f i < y"
haftmann@43943
   382
proof -
haftmann@43943
   383
  have "f i \<le> (\<Squnion>i\<in>A. f i)" using `i \<in> A`
haftmann@44103
   384
    by (rule SUP_upper)
haftmann@43943
   385
  also note `(\<Squnion>i\<in>A. f i) < y`
haftmann@43943
   386
  finally show "f i < y" .
haftmann@43943
   387
qed
haftmann@43943
   388
haftmann@43873
   389
lemma INF_UNIV_bool_expand:
haftmann@43868
   390
  "(\<Sqinter>b. A b) = A True \<sqinter> A False"
haftmann@43868
   391
  by (simp add: UNIV_bool INF_empty INF_insert inf_commute)
haftmann@43868
   392
haftmann@43873
   393
lemma SUP_UNIV_bool_expand:
haftmann@43871
   394
  "(\<Squnion>b. A b) = A True \<squnion> A False"
haftmann@43871
   395
  by (simp add: UNIV_bool SUP_empty SUP_insert sup_commute)
haftmann@43871
   396
haftmann@32077
   397
end
haftmann@32077
   398
haftmann@44024
   399
class complete_distrib_lattice = complete_lattice +
haftmann@44039
   400
  assumes sup_Inf: "a \<squnion> \<Sqinter>B = (\<Sqinter>b\<in>B. a \<squnion> b)"
haftmann@44024
   401
  assumes inf_Sup: "a \<sqinter> \<Squnion>B = (\<Squnion>b\<in>B. a \<sqinter> b)"
haftmann@44024
   402
begin
haftmann@44024
   403
haftmann@44039
   404
lemma sup_INF:
haftmann@44039
   405
  "a \<squnion> (\<Sqinter>b\<in>B. f b) = (\<Sqinter>b\<in>B. a \<squnion> f b)"
haftmann@44039
   406
  by (simp add: INF_def sup_Inf image_image)
haftmann@44039
   407
haftmann@44039
   408
lemma inf_SUP:
haftmann@44039
   409
  "a \<sqinter> (\<Squnion>b\<in>B. f b) = (\<Squnion>b\<in>B. a \<sqinter> f b)"
haftmann@44039
   410
  by (simp add: SUP_def inf_Sup image_image)
haftmann@44039
   411
haftmann@44032
   412
lemma dual_complete_distrib_lattice:
krauss@44845
   413
  "class.complete_distrib_lattice Sup Inf sup (op \<ge>) (op >) inf \<top> \<bottom>"
haftmann@44024
   414
  apply (rule class.complete_distrib_lattice.intro)
haftmann@44024
   415
  apply (fact dual_complete_lattice)
haftmann@44024
   416
  apply (rule class.complete_distrib_lattice_axioms.intro)
haftmann@44032
   417
  apply (simp_all only: INF_foundation_dual SUP_foundation_dual inf_Sup sup_Inf)
haftmann@44032
   418
  done
haftmann@44024
   419
haftmann@44322
   420
subclass distrib_lattice proof
haftmann@44024
   421
  fix a b c
haftmann@44024
   422
  from sup_Inf have "a \<squnion> \<Sqinter>{b, c} = (\<Sqinter>d\<in>{b, c}. a \<squnion> d)" .
haftmann@44082
   423
  then show "a \<squnion> b \<sqinter> c = (a \<squnion> b) \<sqinter> (a \<squnion> c)" by (simp add: INF_def Inf_insert)
haftmann@44024
   424
qed
haftmann@44024
   425
haftmann@44039
   426
lemma Inf_sup:
haftmann@44039
   427
  "\<Sqinter>B \<squnion> a = (\<Sqinter>b\<in>B. b \<squnion> a)"
haftmann@44039
   428
  by (simp add: sup_Inf sup_commute)
haftmann@44039
   429
haftmann@44039
   430
lemma Sup_inf:
haftmann@44039
   431
  "\<Squnion>B \<sqinter> a = (\<Squnion>b\<in>B. b \<sqinter> a)"
haftmann@44039
   432
  by (simp add: inf_Sup inf_commute)
haftmann@44039
   433
haftmann@44039
   434
lemma INF_sup: 
haftmann@44039
   435
  "(\<Sqinter>b\<in>B. f b) \<squnion> a = (\<Sqinter>b\<in>B. f b \<squnion> a)"
haftmann@44039
   436
  by (simp add: sup_INF sup_commute)
haftmann@44039
   437
haftmann@44039
   438
lemma SUP_inf:
haftmann@44039
   439
  "(\<Squnion>b\<in>B. f b) \<sqinter> a = (\<Squnion>b\<in>B. f b \<sqinter> a)"
haftmann@44039
   440
  by (simp add: inf_SUP inf_commute)
haftmann@44039
   441
haftmann@44039
   442
lemma Inf_sup_eq_top_iff:
haftmann@44039
   443
  "(\<Sqinter>B \<squnion> a = \<top>) \<longleftrightarrow> (\<forall>b\<in>B. b \<squnion> a = \<top>)"
haftmann@44039
   444
  by (simp only: Inf_sup INF_top_conv)
haftmann@44039
   445
haftmann@44039
   446
lemma Sup_inf_eq_bot_iff:
haftmann@44039
   447
  "(\<Squnion>B \<sqinter> a = \<bottom>) \<longleftrightarrow> (\<forall>b\<in>B. b \<sqinter> a = \<bottom>)"
haftmann@44039
   448
  by (simp only: Sup_inf SUP_bot_conv)
haftmann@44039
   449
haftmann@44039
   450
lemma INF_sup_distrib2:
haftmann@44039
   451
  "(\<Sqinter>a\<in>A. f a) \<squnion> (\<Sqinter>b\<in>B. g b) = (\<Sqinter>a\<in>A. \<Sqinter>b\<in>B. f a \<squnion> g b)"
haftmann@44039
   452
  by (subst INF_commute) (simp add: sup_INF INF_sup)
haftmann@44039
   453
haftmann@44039
   454
lemma SUP_inf_distrib2:
haftmann@44039
   455
  "(\<Squnion>a\<in>A. f a) \<sqinter> (\<Squnion>b\<in>B. g b) = (\<Squnion>a\<in>A. \<Squnion>b\<in>B. f a \<sqinter> g b)"
haftmann@44039
   456
  by (subst SUP_commute) (simp add: inf_SUP SUP_inf)
haftmann@44039
   457
haftmann@44024
   458
end
haftmann@44024
   459
haftmann@44032
   460
class complete_boolean_algebra = boolean_algebra + complete_distrib_lattice
haftmann@43873
   461
begin
haftmann@43873
   462
haftmann@43943
   463
lemma dual_complete_boolean_algebra:
krauss@44845
   464
  "class.complete_boolean_algebra Sup Inf sup (op \<ge>) (op >) inf \<top> \<bottom> (\<lambda>x y. x \<squnion> - y) uminus"
haftmann@44032
   465
  by (rule class.complete_boolean_algebra.intro, rule dual_complete_distrib_lattice, rule dual_boolean_algebra)
haftmann@43943
   466
haftmann@43873
   467
lemma uminus_Inf:
haftmann@43873
   468
  "- (\<Sqinter>A) = \<Squnion>(uminus ` A)"
haftmann@43873
   469
proof (rule antisym)
haftmann@43873
   470
  show "- \<Sqinter>A \<le> \<Squnion>(uminus ` A)"
haftmann@43873
   471
    by (rule compl_le_swap2, rule Inf_greatest, rule compl_le_swap2, rule Sup_upper) simp
haftmann@43873
   472
  show "\<Squnion>(uminus ` A) \<le> - \<Sqinter>A"
haftmann@43873
   473
    by (rule Sup_least, rule compl_le_swap1, rule Inf_lower) auto
haftmann@43873
   474
qed
haftmann@43873
   475
haftmann@44041
   476
lemma uminus_INF: "- (\<Sqinter>x\<in>A. B x) = (\<Squnion>x\<in>A. - B x)"
haftmann@44041
   477
  by (simp add: INF_def SUP_def uminus_Inf image_image)
haftmann@44041
   478
haftmann@43873
   479
lemma uminus_Sup:
haftmann@43873
   480
  "- (\<Squnion>A) = \<Sqinter>(uminus ` A)"
haftmann@43873
   481
proof -
haftmann@43873
   482
  have "\<Squnion>A = - \<Sqinter>(uminus ` A)" by (simp add: image_image uminus_Inf)
haftmann@43873
   483
  then show ?thesis by simp
haftmann@43873
   484
qed
haftmann@43873
   485
  
haftmann@43873
   486
lemma uminus_SUP: "- (\<Squnion>x\<in>A. B x) = (\<Sqinter>x\<in>A. - B x)"
haftmann@43873
   487
  by (simp add: INF_def SUP_def uminus_Sup image_image)
haftmann@43873
   488
haftmann@43873
   489
end
haftmann@43873
   490
haftmann@43940
   491
class complete_linorder = linorder + complete_lattice
haftmann@43940
   492
begin
haftmann@43940
   493
haftmann@43943
   494
lemma dual_complete_linorder:
krauss@44845
   495
  "class.complete_linorder Sup Inf sup (op \<ge>) (op >) inf \<top> \<bottom>"
haftmann@43943
   496
  by (rule class.complete_linorder.intro, rule dual_complete_lattice, rule dual_linorder)
haftmann@43943
   497
noschinl@44918
   498
lemma Inf_less_iff:
haftmann@43940
   499
  "\<Sqinter>S \<sqsubset> a \<longleftrightarrow> (\<exists>x\<in>S. x \<sqsubset> a)"
haftmann@43940
   500
  unfolding not_le [symmetric] le_Inf_iff by auto
haftmann@43940
   501
noschinl@44918
   502
lemma INF_less_iff:
haftmann@44041
   503
  "(\<Sqinter>i\<in>A. f i) \<sqsubset> a \<longleftrightarrow> (\<exists>x\<in>A. f x \<sqsubset> a)"
haftmann@44041
   504
  unfolding INF_def Inf_less_iff by auto
haftmann@44041
   505
noschinl@44918
   506
lemma less_Sup_iff:
haftmann@43940
   507
  "a \<sqsubset> \<Squnion>S \<longleftrightarrow> (\<exists>x\<in>S. a \<sqsubset> x)"
haftmann@43940
   508
  unfolding not_le [symmetric] Sup_le_iff by auto
haftmann@43940
   509
noschinl@44918
   510
lemma less_SUP_iff:
haftmann@43940
   511
  "a \<sqsubset> (\<Squnion>i\<in>A. f i) \<longleftrightarrow> (\<exists>x\<in>A. a \<sqsubset> f x)"
haftmann@43940
   512
  unfolding SUP_def less_Sup_iff by auto
haftmann@43940
   513
noschinl@44918
   514
lemma Sup_eq_top_iff [simp]:
haftmann@43943
   515
  "\<Squnion>A = \<top> \<longleftrightarrow> (\<forall>x<\<top>. \<exists>i\<in>A. x < i)"
haftmann@43943
   516
proof
haftmann@43943
   517
  assume *: "\<Squnion>A = \<top>"
haftmann@43943
   518
  show "(\<forall>x<\<top>. \<exists>i\<in>A. x < i)" unfolding * [symmetric]
haftmann@43943
   519
  proof (intro allI impI)
haftmann@43943
   520
    fix x assume "x < \<Squnion>A" then show "\<exists>i\<in>A. x < i"
haftmann@43943
   521
      unfolding less_Sup_iff by auto
haftmann@43943
   522
  qed
haftmann@43943
   523
next
haftmann@43943
   524
  assume *: "\<forall>x<\<top>. \<exists>i\<in>A. x < i"
haftmann@43943
   525
  show "\<Squnion>A = \<top>"
haftmann@43943
   526
  proof (rule ccontr)
haftmann@43943
   527
    assume "\<Squnion>A \<noteq> \<top>"
haftmann@43943
   528
    with top_greatest [of "\<Squnion>A"]
haftmann@43943
   529
    have "\<Squnion>A < \<top>" unfolding le_less by auto
haftmann@43943
   530
    then have "\<Squnion>A < \<Squnion>A"
haftmann@43943
   531
      using * unfolding less_Sup_iff by auto
haftmann@43943
   532
    then show False by auto
haftmann@43943
   533
  qed
haftmann@43943
   534
qed
haftmann@43943
   535
noschinl@44918
   536
lemma SUP_eq_top_iff [simp]:
haftmann@44041
   537
  "(\<Squnion>i\<in>A. f i) = \<top> \<longleftrightarrow> (\<forall>x<\<top>. \<exists>i\<in>A. x < f i)"
haftmann@44041
   538
  unfolding SUP_def Sup_eq_top_iff by auto
haftmann@44041
   539
noschinl@44918
   540
lemma Inf_eq_bot_iff [simp]:
haftmann@43943
   541
  "\<Sqinter>A = \<bottom> \<longleftrightarrow> (\<forall>x>\<bottom>. \<exists>i\<in>A. i < x)"
haftmann@43943
   542
proof -
krauss@44845
   543
  interpret dual: complete_linorder Sup Inf sup "op \<ge>" "op >" inf \<top> \<bottom>
haftmann@43943
   544
    by (fact dual_complete_linorder)
haftmann@43943
   545
  from dual.Sup_eq_top_iff show ?thesis .
haftmann@43943
   546
qed
haftmann@43943
   547
noschinl@44918
   548
lemma INF_eq_bot_iff [simp]:
haftmann@43967
   549
  "(\<Sqinter>i\<in>A. f i) = \<bottom> \<longleftrightarrow> (\<forall>x>\<bottom>. \<exists>i\<in>A. f i < x)"
haftmann@43967
   550
  unfolding INF_def Inf_eq_bot_iff by auto
haftmann@43967
   551
haftmann@43940
   552
end
haftmann@43940
   553
haftmann@43873
   554
haftmann@32139
   555
subsection {* @{typ bool} and @{typ "_ \<Rightarrow> _"} as complete lattice *}
haftmann@32077
   556
haftmann@44024
   557
instantiation bool :: complete_lattice
haftmann@32077
   558
begin
haftmann@32077
   559
haftmann@32077
   560
definition
haftmann@44322
   561
  [simp]: "\<Sqinter>A \<longleftrightarrow> False \<notin> A"
haftmann@32077
   562
haftmann@32077
   563
definition
haftmann@44322
   564
  [simp]: "\<Squnion>A \<longleftrightarrow> True \<in> A"
haftmann@32077
   565
haftmann@32077
   566
instance proof
haftmann@44322
   567
qed (auto intro: bool_induct)
haftmann@32077
   568
haftmann@32077
   569
end
haftmann@32077
   570
haftmann@43873
   571
lemma INF_bool_eq [simp]:
haftmann@32120
   572
  "INFI = Ball"
haftmann@32120
   573
proof (rule ext)+
haftmann@32120
   574
  fix A :: "'a set"
haftmann@32120
   575
  fix P :: "'a \<Rightarrow> bool"
haftmann@43753
   576
  show "(\<Sqinter>x\<in>A. P x) \<longleftrightarrow> (\<forall>x\<in>A. P x)"
haftmann@44322
   577
    by (auto simp add: INF_def)
haftmann@32120
   578
qed
haftmann@32120
   579
haftmann@43873
   580
lemma SUP_bool_eq [simp]:
haftmann@32120
   581
  "SUPR = Bex"
haftmann@32120
   582
proof (rule ext)+
haftmann@32120
   583
  fix A :: "'a set"
haftmann@32120
   584
  fix P :: "'a \<Rightarrow> bool"
haftmann@43753
   585
  show "(\<Squnion>x\<in>A. P x) \<longleftrightarrow> (\<exists>x\<in>A. P x)"
haftmann@44322
   586
    by (auto simp add: SUP_def)
haftmann@32120
   587
qed
haftmann@32120
   588
haftmann@44032
   589
instance bool :: complete_boolean_algebra proof
haftmann@44322
   590
qed (auto intro: bool_induct)
haftmann@44024
   591
haftmann@32077
   592
instantiation "fun" :: (type, complete_lattice) complete_lattice
haftmann@32077
   593
begin
haftmann@32077
   594
haftmann@32077
   595
definition
haftmann@44024
   596
  "\<Sqinter>A = (\<lambda>x. \<Sqinter>f\<in>A. f x)"
haftmann@41080
   597
haftmann@41080
   598
lemma Inf_apply:
haftmann@44024
   599
  "(\<Sqinter>A) x = (\<Sqinter>f\<in>A. f x)"
haftmann@41080
   600
  by (simp add: Inf_fun_def)
haftmann@32077
   601
haftmann@32077
   602
definition
haftmann@44024
   603
  "\<Squnion>A = (\<lambda>x. \<Squnion>f\<in>A. f x)"
haftmann@41080
   604
haftmann@41080
   605
lemma Sup_apply:
haftmann@44024
   606
  "(\<Squnion>A) x = (\<Squnion>f\<in>A. f x)"
haftmann@41080
   607
  by (simp add: Sup_fun_def)
haftmann@32077
   608
haftmann@32077
   609
instance proof
haftmann@44103
   610
qed (auto simp add: le_fun_def Inf_apply Sup_apply intro: INF_lower INF_greatest SUP_upper SUP_least)
haftmann@32077
   611
haftmann@32077
   612
end
haftmann@32077
   613
haftmann@43873
   614
lemma INF_apply:
haftmann@41080
   615
  "(\<Sqinter>y\<in>A. f y) x = (\<Sqinter>y\<in>A. f y x)"
haftmann@43872
   616
  by (auto intro: arg_cong [of _ _ Inf] simp add: INF_def Inf_apply)
hoelzl@38705
   617
haftmann@43873
   618
lemma SUP_apply:
haftmann@41080
   619
  "(\<Squnion>y\<in>A. f y) x = (\<Squnion>y\<in>A. f y x)"
haftmann@43872
   620
  by (auto intro: arg_cong [of _ _ Sup] simp add: SUP_def Sup_apply)
haftmann@32077
   621
haftmann@44024
   622
instance "fun" :: (type, complete_distrib_lattice) complete_distrib_lattice proof
haftmann@44024
   623
qed (auto simp add: inf_apply sup_apply Inf_apply Sup_apply INF_def SUP_def inf_Sup sup_Inf image_image)
haftmann@44024
   624
haftmann@43873
   625
instance "fun" :: (type, complete_boolean_algebra) complete_boolean_algebra ..
haftmann@43873
   626
haftmann@32077
   627
haftmann@41082
   628
subsection {* Inter *}
haftmann@41082
   629
haftmann@41082
   630
abbreviation Inter :: "'a set set \<Rightarrow> 'a set" where
haftmann@41082
   631
  "Inter S \<equiv> \<Sqinter>S"
haftmann@41082
   632
  
haftmann@41082
   633
notation (xsymbols)
haftmann@41082
   634
  Inter  ("\<Inter>_" [90] 90)
haftmann@41082
   635
haftmann@41082
   636
lemma Inter_eq:
haftmann@41082
   637
  "\<Inter>A = {x. \<forall>B \<in> A. x \<in> B}"
haftmann@41082
   638
proof (rule set_eqI)
haftmann@41082
   639
  fix x
haftmann@41082
   640
  have "(\<forall>Q\<in>{P. \<exists>B\<in>A. P \<longleftrightarrow> x \<in> B}. Q) \<longleftrightarrow> (\<forall>B\<in>A. x \<in> B)"
haftmann@41082
   641
    by auto
haftmann@41082
   642
  then show "x \<in> \<Inter>A \<longleftrightarrow> x \<in> {x. \<forall>B \<in> A. x \<in> B}"
haftmann@44322
   643
    by (simp add: Inf_fun_def) (simp add: mem_def)
haftmann@41082
   644
qed
haftmann@41082
   645
haftmann@43741
   646
lemma Inter_iff [simp,no_atp]: "A \<in> \<Inter>C \<longleftrightarrow> (\<forall>X\<in>C. A \<in> X)"
haftmann@41082
   647
  by (unfold Inter_eq) blast
haftmann@41082
   648
haftmann@43741
   649
lemma InterI [intro!]: "(\<And>X. X \<in> C \<Longrightarrow> A \<in> X) \<Longrightarrow> A \<in> \<Inter>C"
haftmann@41082
   650
  by (simp add: Inter_eq)
haftmann@41082
   651
haftmann@41082
   652
text {*
haftmann@41082
   653
  \medskip A ``destruct'' rule -- every @{term X} in @{term C}
haftmann@43741
   654
  contains @{term A} as an element, but @{prop "A \<in> X"} can hold when
haftmann@43741
   655
  @{prop "X \<in> C"} does not!  This rule is analogous to @{text spec}.
haftmann@41082
   656
*}
haftmann@41082
   657
haftmann@43741
   658
lemma InterD [elim, Pure.elim]: "A \<in> \<Inter>C \<Longrightarrow> X \<in> C \<Longrightarrow> A \<in> X"
haftmann@41082
   659
  by auto
haftmann@41082
   660
haftmann@43741
   661
lemma InterE [elim]: "A \<in> \<Inter>C \<Longrightarrow> (X \<notin> C \<Longrightarrow> R) \<Longrightarrow> (A \<in> X \<Longrightarrow> R) \<Longrightarrow> R"
haftmann@41082
   662
  -- {* ``Classical'' elimination rule -- does not require proving
haftmann@43741
   663
    @{prop "X \<in> C"}. *}
haftmann@41082
   664
  by (unfold Inter_eq) blast
haftmann@41082
   665
haftmann@43741
   666
lemma Inter_lower: "B \<in> A \<Longrightarrow> \<Inter>A \<subseteq> B"
haftmann@43740
   667
  by (fact Inf_lower)
haftmann@43740
   668
haftmann@41082
   669
lemma Inter_subset:
haftmann@43755
   670
  "(\<And>X. X \<in> A \<Longrightarrow> X \<subseteq> B) \<Longrightarrow> A \<noteq> {} \<Longrightarrow> \<Inter>A \<subseteq> B"
haftmann@43740
   671
  by (fact Inf_less_eq)
haftmann@41082
   672
haftmann@43755
   673
lemma Inter_greatest: "(\<And>X. X \<in> A \<Longrightarrow> C \<subseteq> X) \<Longrightarrow> C \<subseteq> Inter A"
haftmann@43740
   674
  by (fact Inf_greatest)
haftmann@41082
   675
huffman@44067
   676
lemma Inter_empty: "\<Inter>{} = UNIV"
huffman@44067
   677
  by (fact Inf_empty) (* already simp *)
haftmann@41082
   678
huffman@44067
   679
lemma Inter_UNIV: "\<Inter>UNIV = {}"
huffman@44067
   680
  by (fact Inf_UNIV) (* already simp *)
haftmann@41082
   681
haftmann@41082
   682
lemma Inter_insert [simp]: "\<Inter>(insert a B) = a \<inter> \<Inter>B"
haftmann@43739
   683
  by (fact Inf_insert)
haftmann@41082
   684
haftmann@41082
   685
lemma Inter_Un_subset: "\<Inter>A \<union> \<Inter>B \<subseteq> \<Inter>(A \<inter> B)"
haftmann@43899
   686
  by (fact less_eq_Inf_inter)
haftmann@41082
   687
haftmann@41082
   688
lemma Inter_Un_distrib: "\<Inter>(A \<union> B) = \<Inter>A \<inter> \<Inter>B"
haftmann@43756
   689
  by (fact Inf_union_distrib)
haftmann@43756
   690
haftmann@43868
   691
lemma Inter_UNIV_conv [simp, no_atp]:
haftmann@43741
   692
  "\<Inter>A = UNIV \<longleftrightarrow> (\<forall>x\<in>A. x = UNIV)"
haftmann@43741
   693
  "UNIV = \<Inter>A \<longleftrightarrow> (\<forall>x\<in>A. x = UNIV)"
haftmann@43801
   694
  by (fact Inf_top_conv)+
haftmann@41082
   695
haftmann@43741
   696
lemma Inter_anti_mono: "B \<subseteq> A \<Longrightarrow> \<Inter>A \<subseteq> \<Inter>B"
haftmann@43899
   697
  by (fact Inf_superset_mono)
haftmann@41082
   698
haftmann@41082
   699
haftmann@41082
   700
subsection {* Intersections of families *}
haftmann@41082
   701
haftmann@41082
   702
abbreviation INTER :: "'a set \<Rightarrow> ('a \<Rightarrow> 'b set) \<Rightarrow> 'b set" where
haftmann@41082
   703
  "INTER \<equiv> INFI"
haftmann@41082
   704
haftmann@43872
   705
text {*
haftmann@43872
   706
  Note: must use name @{const INTER} here instead of @{text INT}
haftmann@43872
   707
  to allow the following syntax coexist with the plain constant name.
haftmann@43872
   708
*}
haftmann@43872
   709
haftmann@41082
   710
syntax
haftmann@41082
   711
  "_INTER1"     :: "pttrns => 'b set => 'b set"           ("(3INT _./ _)" [0, 10] 10)
haftmann@41082
   712
  "_INTER"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3INT _:_./ _)" [0, 0, 10] 10)
haftmann@41082
   713
haftmann@41082
   714
syntax (xsymbols)
haftmann@41082
   715
  "_INTER1"     :: "pttrns => 'b set => 'b set"           ("(3\<Inter>_./ _)" [0, 10] 10)
haftmann@41082
   716
  "_INTER"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3\<Inter>_\<in>_./ _)" [0, 0, 10] 10)
haftmann@41082
   717
haftmann@41082
   718
syntax (latex output)
haftmann@41082
   719
  "_INTER1"     :: "pttrns => 'b set => 'b set"           ("(3\<Inter>(00\<^bsub>_\<^esub>)/ _)" [0, 10] 10)
haftmann@41082
   720
  "_INTER"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3\<Inter>(00\<^bsub>_\<in>_\<^esub>)/ _)" [0, 0, 10] 10)
haftmann@41082
   721
haftmann@41082
   722
translations
haftmann@41082
   723
  "INT x y. B"  == "INT x. INT y. B"
haftmann@41082
   724
  "INT x. B"    == "CONST INTER CONST UNIV (%x. B)"
haftmann@41082
   725
  "INT x. B"    == "INT x:CONST UNIV. B"
haftmann@41082
   726
  "INT x:A. B"  == "CONST INTER A (%x. B)"
haftmann@41082
   727
haftmann@41082
   728
print_translation {*
wenzelm@42284
   729
  [Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax INTER} @{syntax_const "_INTER"}]
haftmann@41082
   730
*} -- {* to avoid eta-contraction of body *}
haftmann@41082
   731
haftmann@44085
   732
lemma INTER_eq:
haftmann@41082
   733
  "(\<Inter>x\<in>A. B x) = {y. \<forall>x\<in>A. y \<in> B x}"
haftmann@44085
   734
  by (auto simp add: INF_def)
haftmann@41082
   735
haftmann@41082
   736
lemma Inter_image_eq [simp]:
haftmann@41082
   737
  "\<Inter>(B`A) = (\<Inter>x\<in>A. B x)"
haftmann@43872
   738
  by (rule sym) (fact INF_def)
haftmann@41082
   739
haftmann@43817
   740
lemma INT_iff [simp]: "b \<in> (\<Inter>x\<in>A. B x) \<longleftrightarrow> (\<forall>x\<in>A. b \<in> B x)"
haftmann@44085
   741
  by (auto simp add: INF_def image_def)
haftmann@41082
   742
haftmann@43817
   743
lemma INT_I [intro!]: "(\<And>x. x \<in> A \<Longrightarrow> b \<in> B x) \<Longrightarrow> b \<in> (\<Inter>x\<in>A. B x)"
haftmann@44085
   744
  by (auto simp add: INF_def image_def)
haftmann@41082
   745
haftmann@43852
   746
lemma INT_D [elim, Pure.elim]: "b \<in> (\<Inter>x\<in>A. B x) \<Longrightarrow> a \<in> A \<Longrightarrow> b \<in> B a"
haftmann@41082
   747
  by auto
haftmann@41082
   748
haftmann@43852
   749
lemma INT_E [elim]: "b \<in> (\<Inter>x\<in>A. B x) \<Longrightarrow> (b \<in> B a \<Longrightarrow> R) \<Longrightarrow> (a \<notin> A \<Longrightarrow> R) \<Longrightarrow> R"
haftmann@43852
   750
  -- {* "Classical" elimination -- by the Excluded Middle on @{prop "a\<in>A"}. *}
haftmann@44085
   751
  by (auto simp add: INF_def image_def)
haftmann@41082
   752
haftmann@41082
   753
lemma INT_cong [cong]:
haftmann@43854
   754
  "A = B \<Longrightarrow> (\<And>x. x \<in> B \<Longrightarrow> C x = D x) \<Longrightarrow> (\<Inter>x\<in>A. C x) = (\<Inter>x\<in>B. D x)"
haftmann@43865
   755
  by (fact INF_cong)
haftmann@41082
   756
haftmann@41082
   757
lemma Collect_ball_eq: "{x. \<forall>y\<in>A. P x y} = (\<Inter>y\<in>A. {x. P x y})"
haftmann@41082
   758
  by blast
haftmann@41082
   759
haftmann@41082
   760
lemma Collect_all_eq: "{x. \<forall>y. P x y} = (\<Inter>y. {x. P x y})"
haftmann@41082
   761
  by blast
haftmann@41082
   762
haftmann@43817
   763
lemma INT_lower: "a \<in> A \<Longrightarrow> (\<Inter>x\<in>A. B x) \<subseteq> B a"
haftmann@44103
   764
  by (fact INF_lower)
haftmann@41082
   765
haftmann@43817
   766
lemma INT_greatest: "(\<And>x. x \<in> A \<Longrightarrow> C \<subseteq> B x) \<Longrightarrow> C \<subseteq> (\<Inter>x\<in>A. B x)"
haftmann@44103
   767
  by (fact INF_greatest)
haftmann@41082
   768
huffman@44067
   769
lemma INT_empty: "(\<Inter>x\<in>{}. B x) = UNIV"
haftmann@44085
   770
  by (fact INF_empty)
haftmann@43854
   771
haftmann@43817
   772
lemma INT_absorb: "k \<in> I \<Longrightarrow> A k \<inter> (\<Inter>i\<in>I. A i) = (\<Inter>i\<in>I. A i)"
haftmann@43872
   773
  by (fact INF_absorb)
haftmann@41082
   774
haftmann@43854
   775
lemma INT_subset_iff: "B \<subseteq> (\<Inter>i\<in>I. A i) \<longleftrightarrow> (\<forall>i\<in>I. B \<subseteq> A i)"
haftmann@41082
   776
  by (fact le_INF_iff)
haftmann@41082
   777
haftmann@41082
   778
lemma INT_insert [simp]: "(\<Inter>x \<in> insert a A. B x) = B a \<inter> INTER A B"
haftmann@43865
   779
  by (fact INF_insert)
haftmann@43865
   780
haftmann@43865
   781
lemma INT_Un: "(\<Inter>i \<in> A \<union> B. M i) = (\<Inter>i \<in> A. M i) \<inter> (\<Inter>i\<in>B. M i)"
haftmann@43865
   782
  by (fact INF_union)
haftmann@43865
   783
haftmann@43865
   784
lemma INT_insert_distrib:
haftmann@43865
   785
  "u \<in> A \<Longrightarrow> (\<Inter>x\<in>A. insert a (B x)) = insert a (\<Inter>x\<in>A. B x)"
haftmann@43865
   786
  by blast
haftmann@43854
   787
haftmann@41082
   788
lemma INT_constant [simp]: "(\<Inter>y\<in>A. c) = (if A = {} then UNIV else c)"
haftmann@43865
   789
  by (fact INF_constant)
haftmann@43865
   790
haftmann@43854
   791
lemma INTER_UNIV_conv [simp]:
haftmann@43817
   792
 "(UNIV = (\<Inter>x\<in>A. B x)) = (\<forall>x\<in>A. B x = UNIV)"
haftmann@43817
   793
 "((\<Inter>x\<in>A. B x) = UNIV) = (\<forall>x\<in>A. B x = UNIV)"
haftmann@43865
   794
  by (fact INF_top_conv)+
haftmann@43865
   795
haftmann@43865
   796
lemma INT_bool_eq: "(\<Inter>b. A b) = A True \<inter> A False"
haftmann@43873
   797
  by (fact INF_UNIV_bool_expand)
haftmann@43865
   798
haftmann@43865
   799
lemma INT_anti_mono:
haftmann@43900
   800
  "A \<subseteq> B \<Longrightarrow> (\<And>x. x \<in> A \<Longrightarrow> f x \<subseteq> g x) \<Longrightarrow> (\<Inter>x\<in>B. f x) \<subseteq> (\<Inter>x\<in>A. g x)"
haftmann@43865
   801
  -- {* The last inclusion is POSITIVE! *}
haftmann@43940
   802
  by (fact INF_superset_mono)
haftmann@41082
   803
haftmann@41082
   804
lemma Pow_INT_eq: "Pow (\<Inter>x\<in>A. B x) = (\<Inter>x\<in>A. Pow (B x))"
haftmann@41082
   805
  by blast
haftmann@41082
   806
haftmann@43817
   807
lemma vimage_INT: "f -` (\<Inter>x\<in>A. B x) = (\<Inter>x\<in>A. f -` B x)"
haftmann@41082
   808
  by blast
haftmann@41082
   809
haftmann@41082
   810
haftmann@32139
   811
subsection {* Union *}
haftmann@32115
   812
haftmann@32587
   813
abbreviation Union :: "'a set set \<Rightarrow> 'a set" where
haftmann@32587
   814
  "Union S \<equiv> \<Squnion>S"
haftmann@32115
   815
haftmann@32115
   816
notation (xsymbols)
haftmann@32115
   817
  Union  ("\<Union>_" [90] 90)
haftmann@32115
   818
haftmann@32135
   819
lemma Union_eq:
haftmann@32135
   820
  "\<Union>A = {x. \<exists>B \<in> A. x \<in> B}"
nipkow@39302
   821
proof (rule set_eqI)
haftmann@32115
   822
  fix x
haftmann@32135
   823
  have "(\<exists>Q\<in>{P. \<exists>B\<in>A. P \<longleftrightarrow> x \<in> B}. Q) \<longleftrightarrow> (\<exists>B\<in>A. x \<in> B)"
haftmann@32115
   824
    by auto
haftmann@32135
   825
  then show "x \<in> \<Union>A \<longleftrightarrow> x \<in> {x. \<exists>B\<in>A. x \<in> B}"
haftmann@44322
   826
    by (simp add: Sup_fun_def) (simp add: mem_def)
haftmann@32115
   827
qed
haftmann@32115
   828
blanchet@35828
   829
lemma Union_iff [simp, no_atp]:
haftmann@32115
   830
  "A \<in> \<Union>C \<longleftrightarrow> (\<exists>X\<in>C. A\<in>X)"
haftmann@32115
   831
  by (unfold Union_eq) blast
haftmann@32115
   832
haftmann@32115
   833
lemma UnionI [intro]:
haftmann@32115
   834
  "X \<in> C \<Longrightarrow> A \<in> X \<Longrightarrow> A \<in> \<Union>C"
haftmann@32115
   835
  -- {* The order of the premises presupposes that @{term C} is rigid;
haftmann@32115
   836
    @{term A} may be flexible. *}
haftmann@32115
   837
  by auto
haftmann@32115
   838
haftmann@32115
   839
lemma UnionE [elim!]:
haftmann@43817
   840
  "A \<in> \<Union>C \<Longrightarrow> (\<And>X. A \<in> X \<Longrightarrow> X \<in> C \<Longrightarrow> R) \<Longrightarrow> R"
haftmann@32115
   841
  by auto
haftmann@32115
   842
haftmann@43817
   843
lemma Union_upper: "B \<in> A \<Longrightarrow> B \<subseteq> \<Union>A"
haftmann@43901
   844
  by (fact Sup_upper)
haftmann@32135
   845
haftmann@43817
   846
lemma Union_least: "(\<And>X. X \<in> A \<Longrightarrow> X \<subseteq> C) \<Longrightarrow> \<Union>A \<subseteq> C"
haftmann@43901
   847
  by (fact Sup_least)
haftmann@32135
   848
haftmann@43817
   849
lemma Union_empty [simp]: "\<Union>{} = {}"
haftmann@43901
   850
  by (fact Sup_empty)
haftmann@32135
   851
haftmann@43817
   852
lemma Union_UNIV [simp]: "\<Union>UNIV = UNIV"
haftmann@43901
   853
  by (fact Sup_UNIV)
haftmann@32135
   854
haftmann@43817
   855
lemma Union_insert [simp]: "\<Union>insert a B = a \<union> \<Union>B"
haftmann@43901
   856
  by (fact Sup_insert)
haftmann@32135
   857
haftmann@43817
   858
lemma Union_Un_distrib [simp]: "\<Union>(A \<union> B) = \<Union>A \<union> \<Union>B"
haftmann@43901
   859
  by (fact Sup_union_distrib)
haftmann@32135
   860
haftmann@32135
   861
lemma Union_Int_subset: "\<Union>(A \<inter> B) \<subseteq> \<Union>A \<inter> \<Union>B"
haftmann@43901
   862
  by (fact Sup_inter_less_eq)
haftmann@32135
   863
haftmann@43817
   864
lemma Union_empty_conv [simp,no_atp]: "(\<Union>A = {}) \<longleftrightarrow> (\<forall>x\<in>A. x = {})"
haftmann@43901
   865
  by (fact Sup_bot_conv)
haftmann@32135
   866
haftmann@43817
   867
lemma empty_Union_conv [simp,no_atp]: "({} = \<Union>A) \<longleftrightarrow> (\<forall>x\<in>A. x = {})"
haftmann@43901
   868
  by (fact Sup_bot_conv)
haftmann@32135
   869
haftmann@32135
   870
lemma subset_Pow_Union: "A \<subseteq> Pow (\<Union>A)"
haftmann@32135
   871
  by blast
haftmann@32135
   872
haftmann@32135
   873
lemma Union_Pow_eq [simp]: "\<Union>(Pow A) = A"
haftmann@32135
   874
  by blast
haftmann@32135
   875
haftmann@43817
   876
lemma Union_mono: "A \<subseteq> B \<Longrightarrow> \<Union>A \<subseteq> \<Union>B"
haftmann@43901
   877
  by (fact Sup_subset_mono)
haftmann@32135
   878
haftmann@32115
   879
haftmann@32139
   880
subsection {* Unions of families *}
haftmann@32077
   881
haftmann@32606
   882
abbreviation UNION :: "'a set \<Rightarrow> ('a \<Rightarrow> 'b set) \<Rightarrow> 'b set" where
haftmann@32606
   883
  "UNION \<equiv> SUPR"
haftmann@32077
   884
haftmann@43872
   885
text {*
haftmann@43872
   886
  Note: must use name @{const UNION} here instead of @{text UN}
haftmann@43872
   887
  to allow the following syntax coexist with the plain constant name.
haftmann@43872
   888
*}
haftmann@43872
   889
haftmann@32077
   890
syntax
wenzelm@35115
   891
  "_UNION1"     :: "pttrns => 'b set => 'b set"           ("(3UN _./ _)" [0, 10] 10)
huffman@36364
   892
  "_UNION"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3UN _:_./ _)" [0, 0, 10] 10)
haftmann@32077
   893
haftmann@32077
   894
syntax (xsymbols)
wenzelm@35115
   895
  "_UNION1"     :: "pttrns => 'b set => 'b set"           ("(3\<Union>_./ _)" [0, 10] 10)
huffman@36364
   896
  "_UNION"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3\<Union>_\<in>_./ _)" [0, 0, 10] 10)
haftmann@32077
   897
haftmann@32077
   898
syntax (latex output)
wenzelm@35115
   899
  "_UNION1"     :: "pttrns => 'b set => 'b set"           ("(3\<Union>(00\<^bsub>_\<^esub>)/ _)" [0, 10] 10)
huffman@36364
   900
  "_UNION"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3\<Union>(00\<^bsub>_\<in>_\<^esub>)/ _)" [0, 0, 10] 10)
haftmann@32077
   901
haftmann@32077
   902
translations
haftmann@32077
   903
  "UN x y. B"   == "UN x. UN y. B"
haftmann@32077
   904
  "UN x. B"     == "CONST UNION CONST UNIV (%x. B)"
haftmann@32077
   905
  "UN x. B"     == "UN x:CONST UNIV. B"
haftmann@32077
   906
  "UN x:A. B"   == "CONST UNION A (%x. B)"
haftmann@32077
   907
haftmann@32077
   908
text {*
haftmann@32077
   909
  Note the difference between ordinary xsymbol syntax of indexed
haftmann@32077
   910
  unions and intersections (e.g.\ @{text"\<Union>a\<^isub>1\<in>A\<^isub>1. B"})
haftmann@32077
   911
  and their \LaTeX\ rendition: @{term"\<Union>a\<^isub>1\<in>A\<^isub>1. B"}. The
haftmann@32077
   912
  former does not make the index expression a subscript of the
haftmann@32077
   913
  union/intersection symbol because this leads to problems with nested
haftmann@32077
   914
  subscripts in Proof General.
haftmann@32077
   915
*}
haftmann@32077
   916
wenzelm@35115
   917
print_translation {*
wenzelm@42284
   918
  [Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax UNION} @{syntax_const "_UNION"}]
wenzelm@35115
   919
*} -- {* to avoid eta-contraction of body *}
haftmann@32077
   920
haftmann@44085
   921
lemma UNION_eq [no_atp]:
haftmann@32135
   922
  "(\<Union>x\<in>A. B x) = {y. \<exists>x\<in>A. y \<in> B x}"
haftmann@44085
   923
  by (auto simp add: SUP_def)
haftmann@32115
   924
  
haftmann@32115
   925
lemma Union_image_eq [simp]:
haftmann@43817
   926
  "\<Union>(B ` A) = (\<Union>x\<in>A. B x)"
haftmann@44085
   927
  by (auto simp add: UNION_eq)
haftmann@32115
   928
  
haftmann@43852
   929
lemma UN_iff [simp]: "(b \<in> (\<Union>x\<in>A. B x)) = (\<exists>x\<in>A. b \<in> B x)"
haftmann@44085
   930
  by (auto simp add: SUP_def image_def)
wenzelm@11979
   931
haftmann@43852
   932
lemma UN_I [intro]: "a \<in> A \<Longrightarrow> b \<in> B a \<Longrightarrow> b \<in> (\<Union>x\<in>A. B x)"
wenzelm@11979
   933
  -- {* The order of the premises presupposes that @{term A} is rigid;
wenzelm@11979
   934
    @{term b} may be flexible. *}
wenzelm@11979
   935
  by auto
wenzelm@11979
   936
haftmann@43852
   937
lemma UN_E [elim!]: "b \<in> (\<Union>x\<in>A. B x) \<Longrightarrow> (\<And>x. x\<in>A \<Longrightarrow> b \<in> B x \<Longrightarrow> R) \<Longrightarrow> R"
haftmann@44085
   938
  by (auto simp add: SUP_def image_def)
clasohm@923
   939
wenzelm@11979
   940
lemma UN_cong [cong]:
haftmann@43900
   941
  "A = B \<Longrightarrow> (\<And>x. x \<in> B \<Longrightarrow> C x = D x) \<Longrightarrow> (\<Union>x\<in>A. C x) = (\<Union>x\<in>B. D x)"
haftmann@43900
   942
  by (fact SUP_cong)
wenzelm@11979
   943
berghofe@29691
   944
lemma strong_UN_cong:
haftmann@43900
   945
  "A = B \<Longrightarrow> (\<And>x. x \<in> B =simp=> C x = D x) \<Longrightarrow> (\<Union>x\<in>A. C x) = (\<Union>x\<in>B. D x)"
haftmann@43900
   946
  by (unfold simp_implies_def) (fact UN_cong)
berghofe@29691
   947
haftmann@43817
   948
lemma image_eq_UN: "f ` A = (\<Union>x\<in>A. {f x})"
haftmann@32077
   949
  by blast
haftmann@32077
   950
haftmann@43817
   951
lemma UN_upper: "a \<in> A \<Longrightarrow> B a \<subseteq> (\<Union>x\<in>A. B x)"
haftmann@44103
   952
  by (fact SUP_upper)
haftmann@32135
   953
haftmann@43817
   954
lemma UN_least: "(\<And>x. x \<in> A \<Longrightarrow> B x \<subseteq> C) \<Longrightarrow> (\<Union>x\<in>A. B x) \<subseteq> C"
haftmann@44103
   955
  by (fact SUP_least)
haftmann@32135
   956
blanchet@35828
   957
lemma Collect_bex_eq [no_atp]: "{x. \<exists>y\<in>A. P x y} = (\<Union>y\<in>A. {x. P x y})"
haftmann@32135
   958
  by blast
haftmann@32135
   959
haftmann@43817
   960
lemma UN_insert_distrib: "u \<in> A \<Longrightarrow> (\<Union>x\<in>A. insert a (B x)) = insert a (\<Union>x\<in>A. B x)"
haftmann@32135
   961
  by blast
haftmann@32135
   962
huffman@44067
   963
lemma UN_empty [no_atp]: "(\<Union>x\<in>{}. B x) = {}"
haftmann@44085
   964
  by (fact SUP_empty)
haftmann@32135
   965
haftmann@32135
   966
lemma UN_empty2 [simp]: "(\<Union>x\<in>A. {}) = {}"
haftmann@43900
   967
  by (fact SUP_bot)
haftmann@32135
   968
haftmann@43817
   969
lemma UN_absorb: "k \<in> I \<Longrightarrow> A k \<union> (\<Union>i\<in>I. A i) = (\<Union>i\<in>I. A i)"
haftmann@43900
   970
  by (fact SUP_absorb)
haftmann@32135
   971
haftmann@32135
   972
lemma UN_insert [simp]: "(\<Union>x\<in>insert a A. B x) = B a \<union> UNION A B"
haftmann@43900
   973
  by (fact SUP_insert)
haftmann@32135
   974
haftmann@44085
   975
lemma UN_Un [simp]: "(\<Union>i \<in> A \<union> B. M i) = (\<Union>i\<in>A. M i) \<union> (\<Union>i\<in>B. M i)"
haftmann@43900
   976
  by (fact SUP_union)
haftmann@32135
   977
haftmann@43967
   978
lemma UN_UN_flatten: "(\<Union>x \<in> (\<Union>y\<in>A. B y). C x) = (\<Union>y\<in>A. \<Union>x\<in>B y. C x)"
haftmann@32135
   979
  by blast
haftmann@32135
   980
haftmann@32135
   981
lemma UN_subset_iff: "((\<Union>i\<in>I. A i) \<subseteq> B) = (\<forall>i\<in>I. A i \<subseteq> B)"
huffman@35629
   982
  by (fact SUP_le_iff)
haftmann@32135
   983
haftmann@32135
   984
lemma UN_constant [simp]: "(\<Union>y\<in>A. c) = (if A = {} then {} else c)"
haftmann@43900
   985
  by (fact SUP_constant)
haftmann@32135
   986
haftmann@43944
   987
lemma image_Union: "f ` \<Union>S = (\<Union>x\<in>S. f ` x)"
haftmann@32135
   988
  by blast
haftmann@32135
   989
haftmann@32135
   990
lemma UNION_empty_conv[simp]:
haftmann@43817
   991
  "{} = (\<Union>x\<in>A. B x) \<longleftrightarrow> (\<forall>x\<in>A. B x = {})"
haftmann@43817
   992
  "(\<Union>x\<in>A. B x) = {} \<longleftrightarrow> (\<forall>x\<in>A. B x = {})"
haftmann@43900
   993
  by (fact SUP_bot_conv)+
haftmann@32135
   994
blanchet@35828
   995
lemma Collect_ex_eq [no_atp]: "{x. \<exists>y. P x y} = (\<Union>y. {x. P x y})"
haftmann@32135
   996
  by blast
haftmann@32135
   997
haftmann@43900
   998
lemma ball_UN: "(\<forall>z \<in> UNION A B. P z) \<longleftrightarrow> (\<forall>x\<in>A. \<forall>z \<in> B x. P z)"
haftmann@32135
   999
  by blast
haftmann@32135
  1000
haftmann@43900
  1001
lemma bex_UN: "(\<exists>z \<in> UNION A B. P z) \<longleftrightarrow> (\<exists>x\<in>A. \<exists>z\<in>B x. P z)"
haftmann@32135
  1002
  by blast
haftmann@32135
  1003
haftmann@32135
  1004
lemma Un_eq_UN: "A \<union> B = (\<Union>b. if b then A else B)"
haftmann@32135
  1005
  by (auto simp add: split_if_mem2)
haftmann@32135
  1006
haftmann@43817
  1007
lemma UN_bool_eq: "(\<Union>b. A b) = (A True \<union> A False)"
haftmann@43900
  1008
  by (fact SUP_UNIV_bool_expand)
haftmann@32135
  1009
haftmann@32135
  1010
lemma UN_Pow_subset: "(\<Union>x\<in>A. Pow (B x)) \<subseteq> Pow (\<Union>x\<in>A. B x)"
haftmann@32135
  1011
  by blast
haftmann@32135
  1012
haftmann@32135
  1013
lemma UN_mono:
haftmann@43817
  1014
  "A \<subseteq> B \<Longrightarrow> (\<And>x. x \<in> A \<Longrightarrow> f x \<subseteq> g x) \<Longrightarrow>
haftmann@32135
  1015
    (\<Union>x\<in>A. f x) \<subseteq> (\<Union>x\<in>B. g x)"
haftmann@43940
  1016
  by (fact SUP_subset_mono)
haftmann@32135
  1017
haftmann@43817
  1018
lemma vimage_Union: "f -` (\<Union>A) = (\<Union>X\<in>A. f -` X)"
haftmann@32135
  1019
  by blast
haftmann@32135
  1020
haftmann@43817
  1021
lemma vimage_UN: "f -` (\<Union>x\<in>A. B x) = (\<Union>x\<in>A. f -` B x)"
haftmann@32135
  1022
  by blast
haftmann@32135
  1023
haftmann@43817
  1024
lemma vimage_eq_UN: "f -` B = (\<Union>y\<in>B. f -` {y})"
haftmann@32135
  1025
  -- {* NOT suitable for rewriting *}
haftmann@32135
  1026
  by blast
haftmann@32135
  1027
haftmann@43817
  1028
lemma image_UN: "f ` UNION A B = (\<Union>x\<in>A. f ` B x)"
haftmann@43817
  1029
  by blast
haftmann@32135
  1030
wenzelm@11979
  1031
haftmann@32139
  1032
subsection {* Distributive laws *}
wenzelm@12897
  1033
wenzelm@12897
  1034
lemma Int_Union: "A \<inter> \<Union>B = (\<Union>C\<in>B. A \<inter> C)"
haftmann@44032
  1035
  by (fact inf_Sup)
wenzelm@12897
  1036
haftmann@44039
  1037
lemma Un_Inter: "A \<union> \<Inter>B = (\<Inter>C\<in>B. A \<union> C)"
haftmann@44039
  1038
  by (fact sup_Inf)
haftmann@44039
  1039
wenzelm@12897
  1040
lemma Int_Union2: "\<Union>B \<inter> A = (\<Union>C\<in>B. C \<inter> A)"
haftmann@44039
  1041
  by (fact Sup_inf)
haftmann@44039
  1042
haftmann@44039
  1043
lemma INT_Int_distrib: "(\<Inter>i\<in>I. A i \<inter> B i) = (\<Inter>i\<in>I. A i) \<inter> (\<Inter>i\<in>I. B i)"
haftmann@44039
  1044
  by (rule sym) (rule INF_inf_distrib)
haftmann@44039
  1045
haftmann@44039
  1046
lemma UN_Un_distrib: "(\<Union>i\<in>I. A i \<union> B i) = (\<Union>i\<in>I. A i) \<union> (\<Union>i\<in>I. B i)"
haftmann@44039
  1047
  by (rule sym) (rule SUP_sup_distrib)
haftmann@44039
  1048
haftmann@44039
  1049
lemma Int_Inter_image: "(\<Inter>x\<in>C. A x \<inter> B x) = \<Inter>(A ` C) \<inter> \<Inter>(B ` C)"
haftmann@44039
  1050
  by (simp only: INT_Int_distrib INF_def)
wenzelm@12897
  1051
haftmann@43817
  1052
lemma Un_Union_image: "(\<Union>x\<in>C. A x \<union> B x) = \<Union>(A ` C) \<union> \<Union>(B ` C)"
wenzelm@12897
  1053
  -- {* Devlin, Fundamentals of Contemporary Set Theory, page 12, exercise 5: *}
wenzelm@12897
  1054
  -- {* Union of a family of unions *}
haftmann@44039
  1055
  by (simp only: UN_Un_distrib SUP_def)
wenzelm@12897
  1056
haftmann@44039
  1057
lemma Un_INT_distrib: "B \<union> (\<Inter>i\<in>I. A i) = (\<Inter>i\<in>I. B \<union> A i)"
haftmann@44039
  1058
  by (fact sup_INF)
wenzelm@12897
  1059
wenzelm@12897
  1060
lemma Int_UN_distrib: "B \<inter> (\<Union>i\<in>I. A i) = (\<Union>i\<in>I. B \<inter> A i)"
wenzelm@12897
  1061
  -- {* Halmos, Naive Set Theory, page 35. *}
haftmann@44039
  1062
  by (fact inf_SUP)
wenzelm@12897
  1063
wenzelm@12897
  1064
lemma Int_UN_distrib2: "(\<Union>i\<in>I. A i) \<inter> (\<Union>j\<in>J. B j) = (\<Union>i\<in>I. \<Union>j\<in>J. A i \<inter> B j)"
haftmann@44039
  1065
  by (fact SUP_inf_distrib2)
wenzelm@12897
  1066
wenzelm@12897
  1067
lemma Un_INT_distrib2: "(\<Inter>i\<in>I. A i) \<union> (\<Inter>j\<in>J. B j) = (\<Inter>i\<in>I. \<Inter>j\<in>J. A i \<union> B j)"
haftmann@44039
  1068
  by (fact INF_sup_distrib2)
haftmann@44039
  1069
haftmann@44039
  1070
lemma Union_disjoint: "(\<Union>C \<inter> A = {}) \<longleftrightarrow> (\<forall>B\<in>C. B \<inter> A = {})"
haftmann@44039
  1071
  by (fact Sup_inf_eq_bot_iff)
wenzelm@12897
  1072
wenzelm@12897
  1073
haftmann@32139
  1074
subsection {* Complement *}
haftmann@32135
  1075
haftmann@43873
  1076
lemma Compl_INT [simp]: "- (\<Inter>x\<in>A. B x) = (\<Union>x\<in>A. -B x)"
haftmann@43873
  1077
  by (fact uminus_INF)
wenzelm@12897
  1078
haftmann@43873
  1079
lemma Compl_UN [simp]: "- (\<Union>x\<in>A. B x) = (\<Inter>x\<in>A. -B x)"
haftmann@43873
  1080
  by (fact uminus_SUP)
wenzelm@12897
  1081
wenzelm@12897
  1082
haftmann@32139
  1083
subsection {* Miniscoping and maxiscoping *}
wenzelm@12897
  1084
paulson@13860
  1085
text {* \medskip Miniscoping: pushing in quantifiers and big Unions
paulson@13860
  1086
           and Intersections. *}
wenzelm@12897
  1087
wenzelm@12897
  1088
lemma UN_simps [simp]:
haftmann@43817
  1089
  "\<And>a B C. (\<Union>x\<in>C. insert a (B x)) = (if C={} then {} else insert a (\<Union>x\<in>C. B x))"
haftmann@44032
  1090
  "\<And>A B C. (\<Union>x\<in>C. A x \<union> B) = ((if C={} then {} else (\<Union>x\<in>C. A x) \<union> B))"
haftmann@43852
  1091
  "\<And>A B C. (\<Union>x\<in>C. A \<union> B x) = ((if C={} then {} else A \<union> (\<Union>x\<in>C. B x)))"
haftmann@44032
  1092
  "\<And>A B C. (\<Union>x\<in>C. A x \<inter> B) = ((\<Union>x\<in>C. A x) \<inter> B)"
haftmann@43852
  1093
  "\<And>A B C. (\<Union>x\<in>C. A \<inter> B x) = (A \<inter>(\<Union>x\<in>C. B x))"
haftmann@43852
  1094
  "\<And>A B C. (\<Union>x\<in>C. A x - B) = ((\<Union>x\<in>C. A x) - B)"
haftmann@43852
  1095
  "\<And>A B C. (\<Union>x\<in>C. A - B x) = (A - (\<Inter>x\<in>C. B x))"
haftmann@43852
  1096
  "\<And>A B. (\<Union>x\<in>\<Union>A. B x) = (\<Union>y\<in>A. \<Union>x\<in>y. B x)"
haftmann@43852
  1097
  "\<And>A B C. (\<Union>z\<in>UNION A B. C z) = (\<Union>x\<in>A. \<Union>z\<in>B x. C z)"
haftmann@43831
  1098
  "\<And>A B f. (\<Union>x\<in>f`A. B x) = (\<Union>a\<in>A. B (f a))"
wenzelm@12897
  1099
  by auto
wenzelm@12897
  1100
wenzelm@12897
  1101
lemma INT_simps [simp]:
haftmann@44032
  1102
  "\<And>A B C. (\<Inter>x\<in>C. A x \<inter> B) = (if C={} then UNIV else (\<Inter>x\<in>C. A x) \<inter> B)"
haftmann@43831
  1103
  "\<And>A B C. (\<Inter>x\<in>C. A \<inter> B x) = (if C={} then UNIV else A \<inter>(\<Inter>x\<in>C. B x))"
haftmann@43852
  1104
  "\<And>A B C. (\<Inter>x\<in>C. A x - B) = (if C={} then UNIV else (\<Inter>x\<in>C. A x) - B)"
haftmann@43852
  1105
  "\<And>A B C. (\<Inter>x\<in>C. A - B x) = (if C={} then UNIV else A - (\<Union>x\<in>C. B x))"
haftmann@43817
  1106
  "\<And>a B C. (\<Inter>x\<in>C. insert a (B x)) = insert a (\<Inter>x\<in>C. B x)"
haftmann@43852
  1107
  "\<And>A B C. (\<Inter>x\<in>C. A x \<union> B) = ((\<Inter>x\<in>C. A x) \<union> B)"
haftmann@43852
  1108
  "\<And>A B C. (\<Inter>x\<in>C. A \<union> B x) = (A \<union> (\<Inter>x\<in>C. B x))"
haftmann@43852
  1109
  "\<And>A B. (\<Inter>x\<in>\<Union>A. B x) = (\<Inter>y\<in>A. \<Inter>x\<in>y. B x)"
haftmann@43852
  1110
  "\<And>A B C. (\<Inter>z\<in>UNION A B. C z) = (\<Inter>x\<in>A. \<Inter>z\<in>B x. C z)"
haftmann@43852
  1111
  "\<And>A B f. (\<Inter>x\<in>f`A. B x) = (\<Inter>a\<in>A. B (f a))"
wenzelm@12897
  1112
  by auto
wenzelm@12897
  1113
haftmann@43967
  1114
lemma UN_ball_bex_simps [simp, no_atp]:
haftmann@43852
  1115
  "\<And>A P. (\<forall>x\<in>\<Union>A. P x) \<longleftrightarrow> (\<forall>y\<in>A. \<forall>x\<in>y. P x)"
haftmann@43967
  1116
  "\<And>A B P. (\<forall>x\<in>UNION A B. P x) = (\<forall>a\<in>A. \<forall>x\<in> B a. P x)"
haftmann@43852
  1117
  "\<And>A P. (\<exists>x\<in>\<Union>A. P x) \<longleftrightarrow> (\<exists>y\<in>A. \<exists>x\<in>y. P x)"
haftmann@43852
  1118
  "\<And>A B P. (\<exists>x\<in>UNION A B. P x) \<longleftrightarrow> (\<exists>a\<in>A. \<exists>x\<in>B a. P x)"
wenzelm@12897
  1119
  by auto
wenzelm@12897
  1120
haftmann@43943
  1121
paulson@13860
  1122
text {* \medskip Maxiscoping: pulling out big Unions and Intersections. *}
paulson@13860
  1123
paulson@13860
  1124
lemma UN_extend_simps:
haftmann@43817
  1125
  "\<And>a B C. insert a (\<Union>x\<in>C. B x) = (if C={} then {a} else (\<Union>x\<in>C. insert a (B x)))"
haftmann@44032
  1126
  "\<And>A B C. (\<Union>x\<in>C. A x) \<union> B = (if C={} then B else (\<Union>x\<in>C. A x \<union> B))"
haftmann@43852
  1127
  "\<And>A B C. A \<union> (\<Union>x\<in>C. B x) = (if C={} then A else (\<Union>x\<in>C. A \<union> B x))"
haftmann@43852
  1128
  "\<And>A B C. ((\<Union>x\<in>C. A x) \<inter> B) = (\<Union>x\<in>C. A x \<inter> B)"
haftmann@43852
  1129
  "\<And>A B C. (A \<inter> (\<Union>x\<in>C. B x)) = (\<Union>x\<in>C. A \<inter> B x)"
haftmann@43817
  1130
  "\<And>A B C. ((\<Union>x\<in>C. A x) - B) = (\<Union>x\<in>C. A x - B)"
haftmann@43817
  1131
  "\<And>A B C. (A - (\<Inter>x\<in>C. B x)) = (\<Union>x\<in>C. A - B x)"
haftmann@43852
  1132
  "\<And>A B. (\<Union>y\<in>A. \<Union>x\<in>y. B x) = (\<Union>x\<in>\<Union>A. B x)"
haftmann@43852
  1133
  "\<And>A B C. (\<Union>x\<in>A. \<Union>z\<in>B x. C z) = (\<Union>z\<in>UNION A B. C z)"
haftmann@43831
  1134
  "\<And>A B f. (\<Union>a\<in>A. B (f a)) = (\<Union>x\<in>f`A. B x)"
paulson@13860
  1135
  by auto
paulson@13860
  1136
paulson@13860
  1137
lemma INT_extend_simps:
haftmann@43852
  1138
  "\<And>A B C. (\<Inter>x\<in>C. A x) \<inter> B = (if C={} then B else (\<Inter>x\<in>C. A x \<inter> B))"
haftmann@43852
  1139
  "\<And>A B C. A \<inter> (\<Inter>x\<in>C. B x) = (if C={} then A else (\<Inter>x\<in>C. A \<inter> B x))"
haftmann@43852
  1140
  "\<And>A B C. (\<Inter>x\<in>C. A x) - B = (if C={} then UNIV - B else (\<Inter>x\<in>C. A x - B))"
haftmann@43852
  1141
  "\<And>A B C. A - (\<Union>x\<in>C. B x) = (if C={} then A else (\<Inter>x\<in>C. A - B x))"
haftmann@43817
  1142
  "\<And>a B C. insert a (\<Inter>x\<in>C. B x) = (\<Inter>x\<in>C. insert a (B x))"
haftmann@43852
  1143
  "\<And>A B C. ((\<Inter>x\<in>C. A x) \<union> B) = (\<Inter>x\<in>C. A x \<union> B)"
haftmann@43852
  1144
  "\<And>A B C. A \<union> (\<Inter>x\<in>C. B x) = (\<Inter>x\<in>C. A \<union> B x)"
haftmann@43852
  1145
  "\<And>A B. (\<Inter>y\<in>A. \<Inter>x\<in>y. B x) = (\<Inter>x\<in>\<Union>A. B x)"
haftmann@43852
  1146
  "\<And>A B C. (\<Inter>x\<in>A. \<Inter>z\<in>B x. C z) = (\<Inter>z\<in>UNION A B. C z)"
haftmann@43852
  1147
  "\<And>A B f. (\<Inter>a\<in>A. B (f a)) = (\<Inter>x\<in>f`A. B x)"
paulson@13860
  1148
  by auto
paulson@13860
  1149
paulson@13860
  1150
haftmann@43872
  1151
text {* Legacy names *}
haftmann@43872
  1152
haftmann@44083
  1153
lemma (in complete_lattice) Inf_singleton [simp]:
haftmann@44082
  1154
  "\<Sqinter>{a} = a"
haftmann@44083
  1155
  by (simp add: Inf_insert)
haftmann@44082
  1156
haftmann@44083
  1157
lemma (in complete_lattice) Sup_singleton [simp]:
haftmann@44082
  1158
  "\<Squnion>{a} = a"
haftmann@44083
  1159
  by (simp add: Sup_insert)
haftmann@44082
  1160
haftmann@44083
  1161
lemma (in complete_lattice) Inf_binary:
haftmann@44082
  1162
  "\<Sqinter>{a, b} = a \<sqinter> b"
haftmann@44082
  1163
  by (simp add: Inf_insert)
haftmann@44082
  1164
haftmann@44083
  1165
lemma (in complete_lattice) Sup_binary:
haftmann@44082
  1166
  "\<Squnion>{a, b} = a \<squnion> b"
haftmann@44082
  1167
  by (simp add: Sup_insert)
haftmann@44082
  1168
haftmann@43872
  1169
lemmas (in complete_lattice) INFI_def = INF_def
haftmann@43872
  1170
lemmas (in complete_lattice) SUPR_def = SUP_def
haftmann@44103
  1171
lemmas (in complete_lattice) INF_leI = INF_lower
haftmann@44103
  1172
lemmas (in complete_lattice) INF_leI2 = INF_lower2
haftmann@44103
  1173
lemmas (in complete_lattice) le_INFI = INF_greatest
haftmann@44103
  1174
lemmas (in complete_lattice) le_SUPI = SUP_upper
haftmann@44103
  1175
lemmas (in complete_lattice) le_SUPI2 = SUP_upper2
haftmann@44103
  1176
lemmas (in complete_lattice) SUP_leI = SUP_least
haftmann@43943
  1177
lemmas (in complete_lattice) less_INFD = less_INF_D
haftmann@43940
  1178
haftmann@44085
  1179
lemmas INFI_apply = INF_apply
haftmann@44085
  1180
lemmas SUPR_apply = SUP_apply
haftmann@44085
  1181
haftmann@44085
  1182
text {* Grep and put to news from here *}
haftmann@44085
  1183
haftmann@44085
  1184
lemma (in complete_lattice) INF_eq:
haftmann@44085
  1185
  "(\<Sqinter>x\<in>A. B x) = \<Sqinter>({Y. \<exists>x\<in>A. Y = B x})"
haftmann@44085
  1186
  by (simp add: INF_def image_def)
haftmann@44085
  1187
haftmann@44085
  1188
lemma (in complete_lattice) SUP_eq:
haftmann@44085
  1189
  "(\<Squnion>x\<in>A. B x) = \<Squnion>({Y. \<exists>x\<in>A. Y = B x})"
haftmann@44085
  1190
  by (simp add: SUP_def image_def)
haftmann@44085
  1191
haftmann@43940
  1192
lemma (in complete_lattice) INF_subset:
haftmann@43940
  1193
  "B \<subseteq> A \<Longrightarrow> INFI A f \<sqsubseteq> INFI B f"
haftmann@43940
  1194
  by (rule INF_superset_mono) auto
haftmann@43940
  1195
haftmann@44085
  1196
lemma (in complete_lattice) INF_UNIV_range:
haftmann@44085
  1197
  "(\<Sqinter>x. f x) = \<Sqinter>range f"
haftmann@44085
  1198
  by (fact INF_def)
haftmann@44085
  1199
haftmann@44085
  1200
lemma (in complete_lattice) SUP_UNIV_range:
haftmann@44085
  1201
  "(\<Squnion>x. f x) = \<Squnion>range f"
haftmann@44085
  1202
  by (fact SUP_def)
haftmann@44085
  1203
haftmann@44085
  1204
lemma Int_eq_Inter: "A \<inter> B = \<Inter>{A, B}"
haftmann@44085
  1205
  by (simp add: Inf_insert)
haftmann@44085
  1206
haftmann@44085
  1207
lemma INTER_eq_Inter_image:
haftmann@44085
  1208
  "(\<Inter>x\<in>A. B x) = \<Inter>(B`A)"
haftmann@44085
  1209
  by (fact INF_def)
haftmann@44085
  1210
  
haftmann@44085
  1211
lemma Inter_def:
haftmann@44085
  1212
  "\<Inter>S = (\<Inter>x\<in>S. x)"
haftmann@44085
  1213
  by (simp add: INTER_eq_Inter_image image_def)
haftmann@44085
  1214
haftmann@44085
  1215
lemmas INTER_def = INTER_eq
haftmann@44085
  1216
lemmas UNION_def = UNION_eq
haftmann@44085
  1217
haftmann@44085
  1218
lemma INT_eq: "(\<Inter>x\<in>A. B x) = \<Inter>({Y. \<exists>x\<in>A. Y = B x})"
haftmann@44085
  1219
  by (fact INF_eq)
haftmann@44085
  1220
haftmann@44085
  1221
lemma Un_eq_Union: "A \<union> B = \<Union>{A, B}"
haftmann@44085
  1222
  by blast
haftmann@44085
  1223
haftmann@44085
  1224
lemma UNION_eq_Union_image:
haftmann@44085
  1225
  "(\<Union>x\<in>A. B x) = \<Union>(B ` A)"
haftmann@44085
  1226
  by (fact SUP_def)
haftmann@44085
  1227
haftmann@44085
  1228
lemma Union_def:
haftmann@44085
  1229
  "\<Union>S = (\<Union>x\<in>S. x)"
haftmann@44085
  1230
  by (simp add: UNION_eq_Union_image image_def)
haftmann@44085
  1231
haftmann@44085
  1232
lemma UN_singleton [simp]: "(\<Union>x\<in>A. {x}) = A"
haftmann@44085
  1233
  by blast
haftmann@44085
  1234
haftmann@44085
  1235
lemma UN_eq: "(\<Union>x\<in>A. B x) = \<Union>({Y. \<exists>x\<in>A. Y = B x})"
haftmann@44085
  1236
  by (fact SUP_eq)
haftmann@44085
  1237
haftmann@43872
  1238
haftmann@43872
  1239
text {* Finally *}
haftmann@43872
  1240
haftmann@32135
  1241
no_notation
haftmann@32135
  1242
  less_eq  (infix "\<sqsubseteq>" 50) and
haftmann@32135
  1243
  less (infix "\<sqsubset>" 50) and
haftmann@41082
  1244
  bot ("\<bottom>") and
haftmann@41082
  1245
  top ("\<top>") and
haftmann@32135
  1246
  inf  (infixl "\<sqinter>" 70) and
haftmann@32135
  1247
  sup  (infixl "\<squnion>" 65) and
haftmann@32135
  1248
  Inf  ("\<Sqinter>_" [900] 900) and
haftmann@41082
  1249
  Sup  ("\<Squnion>_" [900] 900)
haftmann@32135
  1250
haftmann@41080
  1251
no_syntax (xsymbols)
haftmann@41082
  1252
  "_INF1"     :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b"           ("(3\<Sqinter>_./ _)" [0, 10] 10)
haftmann@41082
  1253
  "_INF"      :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b"  ("(3\<Sqinter>_\<in>_./ _)" [0, 0, 10] 10)
haftmann@41080
  1254
  "_SUP1"     :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b"           ("(3\<Squnion>_./ _)" [0, 10] 10)
haftmann@41080
  1255
  "_SUP"      :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b"  ("(3\<Squnion>_\<in>_./ _)" [0, 0, 10] 10)
haftmann@41080
  1256
haftmann@30596
  1257
lemmas mem_simps =
haftmann@30596
  1258
  insert_iff empty_iff Un_iff Int_iff Compl_iff Diff_iff
haftmann@30596
  1259
  mem_Collect_eq UN_iff Union_iff INT_iff Inter_iff
haftmann@30596
  1260
  -- {* Each of these has ALREADY been added @{text "[simp]"} above. *}
wenzelm@21669
  1261
wenzelm@11979
  1262
end