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