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