src/HOL/Complete_Lattice.thy
 author haftmann Thu Jul 14 00:20:43 2011 +0200 (2011-07-14) changeset 43818 fcc5d3ffb6f5 parent 43817 d53350bc65a4 child 43831 e323be6b02a5 permissions -rw-r--r--
tuned lemma positions and proofs
     1 (*  Author:     Tobias Nipkow, Lawrence C Paulson and Markus Wenzel; Florian Haftmann, TU Muenchen *)

     2

     3 header {* Complete lattices, with special focus on sets *}

     4

     5 theory Complete_Lattice

     6 imports Set

     7 begin

     8

     9 notation

    10   less_eq (infix "\<sqsubseteq>" 50) and

    11   less (infix "\<sqsubset>" 50) and

    12   inf (infixl "\<sqinter>" 70) and

    13   sup (infixl "\<squnion>" 65) and

    14   top ("\<top>") and

    15   bot ("\<bottom>")

    16

    17

    18 subsection {* Syntactic infimum and supremum operations *}

    19

    20 class Inf =

    21   fixes Inf :: "'a set \<Rightarrow> 'a" ("\<Sqinter>_" [900] 900)

    22

    23 class Sup =

    24   fixes Sup :: "'a set \<Rightarrow> 'a" ("\<Squnion>_" [900] 900)

    25

    26 subsection {* Abstract complete lattices *}

    27

    28 class complete_lattice = bounded_lattice + Inf + Sup +

    29   assumes Inf_lower: "x \<in> A \<Longrightarrow> \<Sqinter>A \<sqsubseteq> x"

    30      and Inf_greatest: "(\<And>x. x \<in> A \<Longrightarrow> z \<sqsubseteq> x) \<Longrightarrow> z \<sqsubseteq> \<Sqinter>A"

    31   assumes Sup_upper: "x \<in> A \<Longrightarrow> x \<sqsubseteq> \<Squnion>A"

    32      and Sup_least: "(\<And>x. x \<in> A \<Longrightarrow> x \<sqsubseteq> z) \<Longrightarrow> \<Squnion>A \<sqsubseteq> z"

    33 begin

    34

    35 lemma dual_complete_lattice:

    36   "class.complete_lattice Sup Inf (op \<ge>) (op >) (op \<squnion>) (op \<sqinter>) \<top> \<bottom>"

    37   by (auto intro!: class.complete_lattice.intro dual_bounded_lattice)

    38     (unfold_locales, (fact bot_least top_greatest

    39         Sup_upper Sup_least Inf_lower Inf_greatest)+)

    40

    41 lemma Inf_Sup: "\<Sqinter>A = \<Squnion>{b. \<forall>a \<in> A. b \<sqsubseteq> a}"

    42   by (auto intro: antisym Inf_lower Inf_greatest Sup_upper Sup_least)

    43

    44 lemma Sup_Inf:  "\<Squnion>A = \<Sqinter>{b. \<forall>a \<in> A. a \<sqsubseteq> b}"

    45   by (auto intro: antisym Inf_lower Inf_greatest Sup_upper Sup_least)

    46

    47 lemma Inf_empty [simp]:

    48   "\<Sqinter>{} = \<top>"

    49   by (auto intro: antisym Inf_greatest)

    50

    51 lemma Sup_empty [simp]:

    52   "\<Squnion>{} = \<bottom>"

    53   by (auto intro: antisym Sup_least)

    54

    55 lemma Inf_UNIV [simp]:

    56   "\<Sqinter>UNIV = \<bottom>"

    57   by (simp add: Sup_Inf Sup_empty [symmetric])

    58

    59 lemma Sup_UNIV [simp]:

    60   "\<Squnion>UNIV = \<top>"

    61   by (simp add: Inf_Sup Inf_empty [symmetric])

    62

    63 lemma Inf_insert: "\<Sqinter>insert a A = a \<sqinter> \<Sqinter>A"

    64   by (auto intro: le_infI le_infI1 le_infI2 antisym Inf_greatest Inf_lower)

    65

    66 lemma Sup_insert: "\<Squnion>insert a A = a \<squnion> \<Squnion>A"

    67   by (auto intro: le_supI le_supI1 le_supI2 antisym Sup_least Sup_upper)

    68

    69 lemma Inf_singleton [simp]:

    70   "\<Sqinter>{a} = a"

    71   by (auto intro: antisym Inf_lower Inf_greatest)

    72

    73 lemma Sup_singleton [simp]:

    74   "\<Squnion>{a} = a"

    75   by (auto intro: antisym Sup_upper Sup_least)

    76

    77 lemma Inf_binary:

    78   "\<Sqinter>{a, b} = a \<sqinter> b"

    79   by (simp add: Inf_empty Inf_insert)

    80

    81 lemma Sup_binary:

    82   "\<Squnion>{a, b} = a \<squnion> b"

    83   by (simp add: Sup_empty Sup_insert)

    84

    85 lemma le_Inf_iff: "b \<sqsubseteq> \<Sqinter>A \<longleftrightarrow> (\<forall>a\<in>A. b \<sqsubseteq> a)"

    86   by (auto intro: Inf_greatest dest: Inf_lower)

    87

    88 lemma Sup_le_iff: "\<Squnion>A \<sqsubseteq> b \<longleftrightarrow> (\<forall>a\<in>A. a \<sqsubseteq> b)"

    89   by (auto intro: Sup_least dest: Sup_upper)

    90

    91 lemma Inf_mono:

    92   assumes "\<And>b. b \<in> B \<Longrightarrow> \<exists>a\<in>A. a \<sqsubseteq> b"

    93   shows "\<Sqinter>A \<sqsubseteq> \<Sqinter>B"

    94 proof (rule Inf_greatest)

    95   fix b assume "b \<in> B"

    96   with assms obtain a where "a \<in> A" and "a \<sqsubseteq> b" by blast

    97   from a \<in> A have "\<Sqinter>A \<sqsubseteq> a" by (rule Inf_lower)

    98   with a \<sqsubseteq> b show "\<Sqinter>A \<sqsubseteq> b" by auto

    99 qed

   100

   101 lemma Sup_mono:

   102   assumes "\<And>a. a \<in> A \<Longrightarrow> \<exists>b\<in>B. a \<sqsubseteq> b"

   103   shows "\<Squnion>A \<sqsubseteq> \<Squnion>B"

   104 proof (rule Sup_least)

   105   fix a assume "a \<in> A"

   106   with assms obtain b where "b \<in> B" and "a \<sqsubseteq> b" by blast

   107   from b \<in> B have "b \<sqsubseteq> \<Squnion>B" by (rule Sup_upper)

   108   with a \<sqsubseteq> b show "a \<sqsubseteq> \<Squnion>B" by auto

   109 qed

   110

   111 lemma top_le:

   112   "\<top> \<sqsubseteq> x \<Longrightarrow> x = \<top>"

   113   by (rule antisym) auto

   114

   115 lemma le_bot:

   116   "x \<sqsubseteq> \<bottom> \<Longrightarrow> x = \<bottom>"

   117   by (rule antisym) auto

   118

   119 lemma not_less_bot[simp]: "\<not> (x \<sqsubset> \<bottom>)"

   120   using bot_least[of x] by (auto simp: le_less)

   121

   122 lemma not_top_less[simp]: "\<not> (\<top> \<sqsubset> x)"

   123   using top_greatest[of x] by (auto simp: le_less)

   124

   125 lemma Sup_upper2: "u \<in> A \<Longrightarrow> v \<sqsubseteq> u \<Longrightarrow> v \<sqsubseteq> \<Squnion>A"

   126   using Sup_upper[of u A] by auto

   127

   128 lemma Inf_lower2: "u \<in> A \<Longrightarrow> u \<sqsubseteq> v \<Longrightarrow> \<Sqinter>A \<sqsubseteq> v"

   129   using Inf_lower[of u A] by auto

   130

   131 definition INFI :: "'b set \<Rightarrow> ('b \<Rightarrow> 'a) \<Rightarrow> 'a" where

   132   "INFI A f = \<Sqinter> (f  A)"

   133

   134 definition SUPR :: "'b set \<Rightarrow> ('b \<Rightarrow> 'a) \<Rightarrow> 'a" where

   135   "SUPR A f = \<Squnion> (f  A)"

   136

   137 end

   138

   139 syntax

   140   "_INF1"     :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b"           ("(3INF _./ _)" [0, 10] 10)

   141   "_INF"      :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b"  ("(3INF _:_./ _)" [0, 0, 10] 10)

   142   "_SUP1"     :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b"           ("(3SUP _./ _)" [0, 10] 10)

   143   "_SUP"      :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b"  ("(3SUP _:_./ _)" [0, 0, 10] 10)

   144

   145 syntax (xsymbols)

   146   "_INF1"     :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b"           ("(3\<Sqinter>_./ _)" [0, 10] 10)

   147   "_INF"      :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b"  ("(3\<Sqinter>_\<in>_./ _)" [0, 0, 10] 10)

   148   "_SUP1"     :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b"           ("(3\<Squnion>_./ _)" [0, 10] 10)

   149   "_SUP"      :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b"  ("(3\<Squnion>_\<in>_./ _)" [0, 0, 10] 10)

   150

   151 translations

   152   "INF x y. B"   == "INF x. INF y. B"

   153   "INF x. B"     == "CONST INFI CONST UNIV (%x. B)"

   154   "INF x. B"     == "INF x:CONST UNIV. B"

   155   "INF x:A. B"   == "CONST INFI A (%x. B)"

   156   "SUP x y. B"   == "SUP x. SUP y. B"

   157   "SUP x. B"     == "CONST SUPR CONST UNIV (%x. B)"

   158   "SUP x. B"     == "SUP x:CONST UNIV. B"

   159   "SUP x:A. B"   == "CONST SUPR A (%x. B)"

   160

   161 print_translation {*

   162   [Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax INFI} @{syntax_const "_INF"},

   163     Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax SUPR} @{syntax_const "_SUP"}]

   164 *} -- {* to avoid eta-contraction of body *}

   165

   166 context complete_lattice

   167 begin

   168

   169 lemma SUP_cong: "(\<And>x. x \<in> A \<Longrightarrow> f x = g x) \<Longrightarrow> SUPR A f = SUPR A g"

   170   by (simp add: SUPR_def cong: image_cong)

   171

   172 lemma INF_cong: "(\<And>x. x \<in> A \<Longrightarrow> f x = g x) \<Longrightarrow> INFI A f = INFI A g"

   173   by (simp add: INFI_def cong: image_cong)

   174

   175 lemma le_SUPI: "i \<in> A \<Longrightarrow> M i \<sqsubseteq> (\<Squnion>i\<in>A. M i)"

   176   by (auto simp add: SUPR_def intro: Sup_upper)

   177

   178 lemma le_SUPI2: "i \<in> A \<Longrightarrow> u \<sqsubseteq> M i \<Longrightarrow> u \<sqsubseteq> (\<Squnion>i\<in>A. M i)"

   179   using le_SUPI[of i A M] by auto

   180

   181 lemma SUP_leI: "(\<And>i. i \<in> A \<Longrightarrow> M i \<sqsubseteq> u) \<Longrightarrow> (\<Squnion>i\<in>A. M i) \<sqsubseteq> u"

   182   by (auto simp add: SUPR_def intro: Sup_least)

   183

   184 lemma INF_leI: "i \<in> A \<Longrightarrow> (\<Sqinter>i\<in>A. M i) \<sqsubseteq> M i"

   185   by (auto simp add: INFI_def intro: Inf_lower)

   186

   187 lemma INF_leI2: "i \<in> A \<Longrightarrow> M i \<sqsubseteq> u \<Longrightarrow> (\<Sqinter>i\<in>A. M i) \<sqsubseteq> u"

   188   using INF_leI[of i A M] by auto

   189

   190 lemma le_INFI: "(\<And>i. i \<in> A \<Longrightarrow> u \<sqsubseteq> M i) \<Longrightarrow> u \<sqsubseteq> (\<Sqinter>i\<in>A. M i)"

   191   by (auto simp add: INFI_def intro: Inf_greatest)

   192

   193 lemma SUP_le_iff: "(\<Squnion>i\<in>A. M i) \<sqsubseteq> u \<longleftrightarrow> (\<forall>i \<in> A. M i \<sqsubseteq> u)"

   194   unfolding SUPR_def by (auto simp add: Sup_le_iff)

   195

   196 lemma le_INF_iff: "u \<sqsubseteq> (\<Sqinter>i\<in>A. M i) \<longleftrightarrow> (\<forall>i \<in> A. u \<sqsubseteq> M i)"

   197   unfolding INFI_def by (auto simp add: le_Inf_iff)

   198

   199 lemma INF_const[simp]: "A \<noteq> {} \<Longrightarrow> (\<Sqinter>i\<in>A. M) = M"

   200   by (auto intro: antisym INF_leI le_INFI)

   201

   202 lemma SUP_const[simp]: "A \<noteq> {} \<Longrightarrow> (\<Squnion>i\<in>A. M) = M"

   203   by (auto intro: antisym SUP_leI le_SUPI)

   204

   205 lemma INF_mono:

   206   "(\<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)"

   207   by (force intro!: Inf_mono simp: INFI_def)

   208

   209 lemma SUP_mono:

   210   "(\<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)"

   211   by (force intro!: Sup_mono simp: SUPR_def)

   212

   213 lemma INF_subset:  "A \<subseteq> B \<Longrightarrow> INFI B f \<sqsubseteq> INFI A f"

   214   by (intro INF_mono) auto

   215

   216 lemma SUP_subset:  "A \<subseteq> B \<Longrightarrow> SUPR A f \<sqsubseteq> SUPR B f"

   217   by (intro SUP_mono) auto

   218

   219 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)"

   220   by (iprover intro: INF_leI le_INFI order_trans antisym)

   221

   222 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)"

   223   by (iprover intro: SUP_leI le_SUPI order_trans antisym)

   224

   225 end

   226

   227 lemma Inf_less_iff:

   228   fixes a :: "'a\<Colon>{complete_lattice,linorder}"

   229   shows "\<Sqinter>S \<sqsubset> a \<longleftrightarrow> (\<exists>x\<in>S. x \<sqsubset> a)"

   230   unfolding not_le [symmetric] le_Inf_iff by auto

   231

   232 lemma less_Sup_iff:

   233   fixes a :: "'a\<Colon>{complete_lattice,linorder}"

   234   shows "a \<sqsubset> \<Squnion>S \<longleftrightarrow> (\<exists>x\<in>S. a \<sqsubset> x)"

   235   unfolding not_le [symmetric] Sup_le_iff by auto

   236

   237 lemma INF_less_iff:

   238   fixes a :: "'a::{complete_lattice,linorder}"

   239   shows "(\<Sqinter>i\<in>A. f i) \<sqsubset> a \<longleftrightarrow> (\<exists>x\<in>A. f x \<sqsubset> a)"

   240   unfolding INFI_def Inf_less_iff by auto

   241

   242 lemma less_SUP_iff:

   243   fixes a :: "'a::{complete_lattice,linorder}"

   244   shows "a \<sqsubset> (\<Squnion>i\<in>A. f i) \<longleftrightarrow> (\<exists>x\<in>A. a \<sqsubset> f x)"

   245   unfolding SUPR_def less_Sup_iff by auto

   246

   247 subsection {* @{typ bool} and @{typ "_ \<Rightarrow> _"} as complete lattice *}

   248

   249 instantiation bool :: complete_lattice

   250 begin

   251

   252 definition

   253   "\<Sqinter>A \<longleftrightarrow> (\<forall>x\<in>A. x)"

   254

   255 definition

   256   "\<Squnion>A \<longleftrightarrow> (\<exists>x\<in>A. x)"

   257

   258 instance proof

   259 qed (auto simp add: Inf_bool_def Sup_bool_def le_bool_def)

   260

   261 end

   262

   263 lemma INFI_bool_eq [simp]:

   264   "INFI = Ball"

   265 proof (rule ext)+

   266   fix A :: "'a set"

   267   fix P :: "'a \<Rightarrow> bool"

   268   show "(\<Sqinter>x\<in>A. P x) \<longleftrightarrow> (\<forall>x\<in>A. P x)"

   269     by (auto simp add: Ball_def INFI_def Inf_bool_def)

   270 qed

   271

   272 lemma SUPR_bool_eq [simp]:

   273   "SUPR = Bex"

   274 proof (rule ext)+

   275   fix A :: "'a set"

   276   fix P :: "'a \<Rightarrow> bool"

   277   show "(\<Squnion>x\<in>A. P x) \<longleftrightarrow> (\<exists>x\<in>A. P x)"

   278     by (auto simp add: Bex_def SUPR_def Sup_bool_def)

   279 qed

   280

   281 instantiation "fun" :: (type, complete_lattice) complete_lattice

   282 begin

   283

   284 definition

   285   "\<Sqinter>A = (\<lambda>x. \<Sqinter>{y. \<exists>f\<in>A. y = f x})"

   286

   287 lemma Inf_apply:

   288   "(\<Sqinter>A) x = \<Sqinter>{y. \<exists>f\<in>A. y = f x}"

   289   by (simp add: Inf_fun_def)

   290

   291 definition

   292   "\<Squnion>A = (\<lambda>x. \<Squnion>{y. \<exists>f\<in>A. y = f x})"

   293

   294 lemma Sup_apply:

   295   "(\<Squnion>A) x = \<Squnion>{y. \<exists>f\<in>A. y = f x}"

   296   by (simp add: Sup_fun_def)

   297

   298 instance proof

   299 qed (auto simp add: le_fun_def Inf_apply Sup_apply

   300   intro: Inf_lower Sup_upper Inf_greatest Sup_least)

   301

   302 end

   303

   304 lemma INFI_apply:

   305   "(\<Sqinter>y\<in>A. f y) x = (\<Sqinter>y\<in>A. f y x)"

   306   by (auto intro: arg_cong [of _ _ Inf] simp add: INFI_def Inf_apply)

   307

   308 lemma SUPR_apply:

   309   "(\<Squnion>y\<in>A. f y) x = (\<Squnion>y\<in>A. f y x)"

   310   by (auto intro: arg_cong [of _ _ Sup] simp add: SUPR_def Sup_apply)

   311

   312

   313 subsection {* Inter *}

   314

   315 abbreviation Inter :: "'a set set \<Rightarrow> 'a set" where

   316   "Inter S \<equiv> \<Sqinter>S"

   317

   318 notation (xsymbols)

   319   Inter  ("\<Inter>_" [90] 90)

   320

   321 lemma Inter_eq:

   322   "\<Inter>A = {x. \<forall>B \<in> A. x \<in> B}"

   323 proof (rule set_eqI)

   324   fix x

   325   have "(\<forall>Q\<in>{P. \<exists>B\<in>A. P \<longleftrightarrow> x \<in> B}. Q) \<longleftrightarrow> (\<forall>B\<in>A. x \<in> B)"

   326     by auto

   327   then show "x \<in> \<Inter>A \<longleftrightarrow> x \<in> {x. \<forall>B \<in> A. x \<in> B}"

   328     by (simp add: Inf_fun_def Inf_bool_def) (simp add: mem_def)

   329 qed

   330

   331 lemma Inter_iff [simp,no_atp]: "A \<in> \<Inter>C \<longleftrightarrow> (\<forall>X\<in>C. A \<in> X)"

   332   by (unfold Inter_eq) blast

   333

   334 lemma InterI [intro!]: "(\<And>X. X \<in> C \<Longrightarrow> A \<in> X) \<Longrightarrow> A \<in> \<Inter>C"

   335   by (simp add: Inter_eq)

   336

   337 text {*

   338   \medskip A destruct'' rule -- every @{term X} in @{term C}

   339   contains @{term A} as an element, but @{prop "A \<in> X"} can hold when

   340   @{prop "X \<in> C"} does not!  This rule is analogous to @{text spec}.

   341 *}

   342

   343 lemma InterD [elim, Pure.elim]: "A \<in> \<Inter>C \<Longrightarrow> X \<in> C \<Longrightarrow> A \<in> X"

   344   by auto

   345

   346 lemma InterE [elim]: "A \<in> \<Inter>C \<Longrightarrow> (X \<notin> C \<Longrightarrow> R) \<Longrightarrow> (A \<in> X \<Longrightarrow> R) \<Longrightarrow> R"

   347   -- {* Classical'' elimination rule -- does not require proving

   348     @{prop "X \<in> C"}. *}

   349   by (unfold Inter_eq) blast

   350

   351 lemma Inter_lower: "B \<in> A \<Longrightarrow> \<Inter>A \<subseteq> B"

   352   by (fact Inf_lower)

   353

   354 lemma (in complete_lattice) Inf_less_eq:

   355   assumes "\<And>v. v \<in> A \<Longrightarrow> v \<sqsubseteq> u"

   356     and "A \<noteq> {}"

   357   shows "\<Sqinter>A \<sqsubseteq> u"

   358 proof -

   359   from A \<noteq> {} obtain v where "v \<in> A" by blast

   360   moreover with assms have "v \<sqsubseteq> u" by blast

   361   ultimately show ?thesis by (rule Inf_lower2)

   362 qed

   363

   364 lemma Inter_subset:

   365   "(\<And>X. X \<in> A \<Longrightarrow> X \<subseteq> B) \<Longrightarrow> A \<noteq> {} \<Longrightarrow> \<Inter>A \<subseteq> B"

   366   by (fact Inf_less_eq)

   367

   368 lemma Inter_greatest: "(\<And>X. X \<in> A \<Longrightarrow> C \<subseteq> X) \<Longrightarrow> C \<subseteq> Inter A"

   369   by (fact Inf_greatest)

   370

   371 lemma Int_eq_Inter: "A \<inter> B = \<Inter>{A, B}"

   372   by (fact Inf_binary [symmetric])

   373

   374 lemma Inter_empty [simp]: "\<Inter>{} = UNIV"

   375   by (fact Inf_empty)

   376

   377 lemma Inter_UNIV [simp]: "\<Inter>UNIV = {}"

   378   by (fact Inf_UNIV)

   379

   380 lemma Inter_insert [simp]: "\<Inter>(insert a B) = a \<inter> \<Inter>B"

   381   by (fact Inf_insert)

   382

   383 lemma (in complete_lattice) Inf_inter_less: "\<Sqinter>A \<squnion> \<Sqinter>B \<sqsubseteq> \<Sqinter>(A \<inter> B)"

   384   by (auto intro: Inf_greatest Inf_lower)

   385

   386 lemma Inter_Un_subset: "\<Inter>A \<union> \<Inter>B \<subseteq> \<Inter>(A \<inter> B)"

   387   by (fact Inf_inter_less)

   388

   389 lemma (in complete_lattice) Inf_union_distrib: "\<Sqinter>(A \<union> B) = \<Sqinter>A \<sqinter> \<Sqinter>B"

   390   by (rule antisym) (auto intro: Inf_greatest Inf_lower le_infI1 le_infI2)

   391

   392 lemma Inter_Un_distrib: "\<Inter>(A \<union> B) = \<Inter>A \<inter> \<Inter>B"

   393   by (fact Inf_union_distrib)

   394

   395 lemma (in complete_lattice) Inf_top_conv [no_atp]:

   396   "\<Sqinter>A = \<top> \<longleftrightarrow> (\<forall>x\<in>A. x = \<top>)"

   397   "\<top> = \<Sqinter>A \<longleftrightarrow> (\<forall>x\<in>A. x = \<top>)"

   398 proof -

   399   show "\<Sqinter>A = \<top> \<longleftrightarrow> (\<forall>x\<in>A. x = \<top>)"

   400   proof

   401     assume "\<forall>x\<in>A. x = \<top>"

   402     then have "A = {} \<or> A = {\<top>}" by auto

   403     then show "\<Sqinter>A = \<top>" by auto

   404   next

   405     assume "\<Sqinter>A = \<top>"

   406     show "\<forall>x\<in>A. x = \<top>"

   407     proof (rule ccontr)

   408       assume "\<not> (\<forall>x\<in>A. x = \<top>)"

   409       then obtain x where "x \<in> A" and "x \<noteq> \<top>" by blast

   410       then obtain B where "A = insert x B" by blast

   411       with \<Sqinter>A = \<top> x \<noteq> \<top> show False by (simp add: Inf_insert)

   412     qed

   413   qed

   414   then show "\<top> = \<Sqinter>A \<longleftrightarrow> (\<forall>x\<in>A. x = \<top>)" by auto

   415 qed

   416

   417 lemma Inter_UNIV_conv [simp,no_atp]:

   418   "\<Inter>A = UNIV \<longleftrightarrow> (\<forall>x\<in>A. x = UNIV)"

   419   "UNIV = \<Inter>A \<longleftrightarrow> (\<forall>x\<in>A. x = UNIV)"

   420   by (fact Inf_top_conv)+

   421

   422 lemma (in complete_lattice) Inf_anti_mono: "B \<subseteq> A \<Longrightarrow> \<Sqinter>A \<sqsubseteq> \<Sqinter>B"

   423   by (auto intro: Inf_greatest Inf_lower)

   424

   425 lemma Inter_anti_mono: "B \<subseteq> A \<Longrightarrow> \<Inter>A \<subseteq> \<Inter>B"

   426   by (fact Inf_anti_mono)

   427

   428

   429 subsection {* Intersections of families *}

   430

   431 abbreviation INTER :: "'a set \<Rightarrow> ('a \<Rightarrow> 'b set) \<Rightarrow> 'b set" where

   432   "INTER \<equiv> INFI"

   433

   434 syntax

   435   "_INTER1"     :: "pttrns => 'b set => 'b set"           ("(3INT _./ _)" [0, 10] 10)

   436   "_INTER"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3INT _:_./ _)" [0, 0, 10] 10)

   437

   438 syntax (xsymbols)

   439   "_INTER1"     :: "pttrns => 'b set => 'b set"           ("(3\<Inter>_./ _)" [0, 10] 10)

   440   "_INTER"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3\<Inter>_\<in>_./ _)" [0, 0, 10] 10)

   441

   442 syntax (latex output)

   443   "_INTER1"     :: "pttrns => 'b set => 'b set"           ("(3\<Inter>(00\<^bsub>_\<^esub>)/ _)" [0, 10] 10)

   444   "_INTER"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3\<Inter>(00\<^bsub>_\<in>_\<^esub>)/ _)" [0, 0, 10] 10)

   445

   446 translations

   447   "INT x y. B"  == "INT x. INT y. B"

   448   "INT x. B"    == "CONST INTER CONST UNIV (%x. B)"

   449   "INT x. B"    == "INT x:CONST UNIV. B"

   450   "INT x:A. B"  == "CONST INTER A (%x. B)"

   451

   452 print_translation {*

   453   [Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax INTER} @{syntax_const "_INTER"}]

   454 *} -- {* to avoid eta-contraction of body *}

   455

   456 lemma INTER_eq_Inter_image:

   457   "(\<Inter>x\<in>A. B x) = \<Inter>(BA)"

   458   by (fact INFI_def)

   459

   460 lemma Inter_def:

   461   "\<Inter>S = (\<Inter>x\<in>S. x)"

   462   by (simp add: INTER_eq_Inter_image image_def)

   463

   464 lemma INTER_def:

   465   "(\<Inter>x\<in>A. B x) = {y. \<forall>x\<in>A. y \<in> B x}"

   466   by (auto simp add: INTER_eq_Inter_image Inter_eq)

   467

   468 lemma Inter_image_eq [simp]:

   469   "\<Inter>(BA) = (\<Inter>x\<in>A. B x)"

   470   by (rule sym) (fact INFI_def)

   471

   472 lemma INT_iff [simp]: "b \<in> (\<Inter>x\<in>A. B x) \<longleftrightarrow> (\<forall>x\<in>A. b \<in> B x)"

   473   by (unfold INTER_def) blast

   474

   475 lemma INT_I [intro!]: "(\<And>x. x \<in> A \<Longrightarrow> b \<in> B x) \<Longrightarrow> b \<in> (\<Inter>x\<in>A. B x)"

   476   by (unfold INTER_def) blast

   477

   478 lemma INT_D [elim, Pure.elim]: "b : (\<Inter>x\<in>A. B x) \<Longrightarrow> a:A \<Longrightarrow> b: B a"

   479   by auto

   480

   481 lemma INT_E [elim]: "b : (\<Inter>x\<in>A. B x) \<Longrightarrow> (b: B a \<Longrightarrow> R) \<Longrightarrow> (a~:A \<Longrightarrow> R) \<Longrightarrow> R"

   482   -- {* "Classical" elimination -- by the Excluded Middle on @{prop "a:A"}. *}

   483   by (unfold INTER_def) blast

   484

   485 lemma INT_cong [cong]:

   486     "A = B \<Longrightarrow> (\<And>x. x:B \<Longrightarrow> C x = D x) \<Longrightarrow> (\<Inter>x\<in>A. C x) = (\<Inter>x\<in>B. D x)"

   487   by (simp add: INTER_def)

   488

   489 lemma Collect_ball_eq: "{x. \<forall>y\<in>A. P x y} = (\<Inter>y\<in>A. {x. P x y})"

   490   by blast

   491

   492 lemma Collect_all_eq: "{x. \<forall>y. P x y} = (\<Inter>y. {x. P x y})"

   493   by blast

   494

   495 lemma INT_lower: "a \<in> A \<Longrightarrow> (\<Inter>x\<in>A. B x) \<subseteq> B a"

   496   by (fact INF_leI)

   497

   498 lemma INT_greatest: "(\<And>x. x \<in> A \<Longrightarrow> C \<subseteq> B x) \<Longrightarrow> C \<subseteq> (\<Inter>x\<in>A. B x)"

   499   by (fact le_INFI)

   500

   501 lemma INT_empty [simp]: "(\<Inter>x\<in>{}. B x) = UNIV"

   502   by blast

   503

   504 lemma INT_absorb: "k \<in> I \<Longrightarrow> A k \<inter> (\<Inter>i\<in>I. A i) = (\<Inter>i\<in>I. A i)"

   505   by blast

   506

   507 lemma INT_subset_iff: "(B \<subseteq> (\<Inter>i\<in>I. A i)) = (\<forall>i\<in>I. B \<subseteq> A i)"

   508   by (fact le_INF_iff)

   509

   510 lemma INT_insert [simp]: "(\<Inter>x \<in> insert a A. B x) = B a \<inter> INTER A B"

   511   by blast

   512

   513 lemma INT_Un: "(\<Inter>i \<in> A \<union> B. M i) = (\<Inter>i \<in> A. M i) \<inter> (\<Inter>i\<in>B. M i)"

   514   by blast

   515

   516 lemma INT_insert_distrib:

   517     "u \<in> A \<Longrightarrow> (\<Inter>x\<in>A. insert a (B x)) = insert a (\<Inter>x\<in>A. B x)"

   518   by blast

   519

   520 lemma INT_constant [simp]: "(\<Inter>y\<in>A. c) = (if A = {} then UNIV else c)"

   521   by auto

   522

   523 lemma INT_eq: "(\<Inter>x\<in>A. B x) = \<Inter>({Y. \<exists>x\<in>A. Y = B x})"

   524   -- {* Look: it has an \emph{existential} quantifier *}

   525   by blast

   526

   527 lemma INTER_UNIV_conv[simp]:

   528  "(UNIV = (\<Inter>x\<in>A. B x)) = (\<forall>x\<in>A. B x = UNIV)"

   529  "((\<Inter>x\<in>A. B x) = UNIV) = (\<forall>x\<in>A. B x = UNIV)"

   530 by blast+

   531

   532 lemma INT_bool_eq: "(\<Inter>b. A b) = (A True \<inter> A False)"

   533   by (auto intro: bool_induct)

   534

   535 lemma Pow_INT_eq: "Pow (\<Inter>x\<in>A. B x) = (\<Inter>x\<in>A. Pow (B x))"

   536   by blast

   537

   538 lemma INT_anti_mono:

   539   "B \<subseteq> A \<Longrightarrow> (\<And>x. x \<in> A \<Longrightarrow> f x \<subseteq> g x) \<Longrightarrow>

   540     (\<Inter>x\<in>A. f x) \<subseteq> (\<Inter>x\<in>A. g x)"

   541   -- {* The last inclusion is POSITIVE! *}

   542   by (blast dest: subsetD)

   543

   544 lemma vimage_INT: "f - (\<Inter>x\<in>A. B x) = (\<Inter>x\<in>A. f - B x)"

   545   by blast

   546

   547

   548 subsection {* Union *}

   549

   550 abbreviation Union :: "'a set set \<Rightarrow> 'a set" where

   551   "Union S \<equiv> \<Squnion>S"

   552

   553 notation (xsymbols)

   554   Union  ("\<Union>_" [90] 90)

   555

   556 lemma Union_eq:

   557   "\<Union>A = {x. \<exists>B \<in> A. x \<in> B}"

   558 proof (rule set_eqI)

   559   fix x

   560   have "(\<exists>Q\<in>{P. \<exists>B\<in>A. P \<longleftrightarrow> x \<in> B}. Q) \<longleftrightarrow> (\<exists>B\<in>A. x \<in> B)"

   561     by auto

   562   then show "x \<in> \<Union>A \<longleftrightarrow> x \<in> {x. \<exists>B\<in>A. x \<in> B}"

   563     by (simp add: Sup_fun_def Sup_bool_def) (simp add: mem_def)

   564 qed

   565

   566 lemma Union_iff [simp, no_atp]:

   567   "A \<in> \<Union>C \<longleftrightarrow> (\<exists>X\<in>C. A\<in>X)"

   568   by (unfold Union_eq) blast

   569

   570 lemma UnionI [intro]:

   571   "X \<in> C \<Longrightarrow> A \<in> X \<Longrightarrow> A \<in> \<Union>C"

   572   -- {* The order of the premises presupposes that @{term C} is rigid;

   573     @{term A} may be flexible. *}

   574   by auto

   575

   576 lemma UnionE [elim!]:

   577   "A \<in> \<Union>C \<Longrightarrow> (\<And>X. A \<in> X \<Longrightarrow> X \<in> C \<Longrightarrow> R) \<Longrightarrow> R"

   578   by auto

   579

   580 lemma Union_upper: "B \<in> A \<Longrightarrow> B \<subseteq> \<Union>A"

   581   by (iprover intro: subsetI UnionI)

   582

   583 lemma Union_least: "(\<And>X. X \<in> A \<Longrightarrow> X \<subseteq> C) \<Longrightarrow> \<Union>A \<subseteq> C"

   584   by (iprover intro: subsetI elim: UnionE dest: subsetD)

   585

   586 lemma Un_eq_Union: "A \<union> B = \<Union>{A, B}"

   587   by blast

   588

   589 lemma Union_empty [simp]: "\<Union>{} = {}"

   590   by blast

   591

   592 lemma Union_UNIV [simp]: "\<Union>UNIV = UNIV"

   593   by blast

   594

   595 lemma Union_insert [simp]: "\<Union>insert a B = a \<union> \<Union>B"

   596   by blast

   597

   598 lemma Union_Un_distrib [simp]: "\<Union>(A \<union> B) = \<Union>A \<union> \<Union>B"

   599   by blast

   600

   601 lemma Union_Int_subset: "\<Union>(A \<inter> B) \<subseteq> \<Union>A \<inter> \<Union>B"

   602   by blast

   603

   604 lemma Union_empty_conv [simp,no_atp]: "(\<Union>A = {}) \<longleftrightarrow> (\<forall>x\<in>A. x = {})"

   605   by blast

   606

   607 lemma empty_Union_conv [simp,no_atp]: "({} = \<Union>A) \<longleftrightarrow> (\<forall>x\<in>A. x = {})"

   608   by blast

   609

   610 lemma Union_disjoint: "(\<Union>C \<inter> A = {}) \<longleftrightarrow> (\<forall>B\<in>C. B \<inter> A = {})"

   611   by blast

   612

   613 lemma subset_Pow_Union: "A \<subseteq> Pow (\<Union>A)"

   614   by blast

   615

   616 lemma Union_Pow_eq [simp]: "\<Union>(Pow A) = A"

   617   by blast

   618

   619 lemma Union_mono: "A \<subseteq> B \<Longrightarrow> \<Union>A \<subseteq> \<Union>B"

   620   by blast

   621

   622

   623 subsection {* Unions of families *}

   624

   625 abbreviation UNION :: "'a set \<Rightarrow> ('a \<Rightarrow> 'b set) \<Rightarrow> 'b set" where

   626   "UNION \<equiv> SUPR"

   627

   628 syntax

   629   "_UNION1"     :: "pttrns => 'b set => 'b set"           ("(3UN _./ _)" [0, 10] 10)

   630   "_UNION"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3UN _:_./ _)" [0, 0, 10] 10)

   631

   632 syntax (xsymbols)

   633   "_UNION1"     :: "pttrns => 'b set => 'b set"           ("(3\<Union>_./ _)" [0, 10] 10)

   634   "_UNION"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3\<Union>_\<in>_./ _)" [0, 0, 10] 10)

   635

   636 syntax (latex output)

   637   "_UNION1"     :: "pttrns => 'b set => 'b set"           ("(3\<Union>(00\<^bsub>_\<^esub>)/ _)" [0, 10] 10)

   638   "_UNION"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3\<Union>(00\<^bsub>_\<in>_\<^esub>)/ _)" [0, 0, 10] 10)

   639

   640 translations

   641   "UN x y. B"   == "UN x. UN y. B"

   642   "UN x. B"     == "CONST UNION CONST UNIV (%x. B)"

   643   "UN x. B"     == "UN x:CONST UNIV. B"

   644   "UN x:A. B"   == "CONST UNION A (%x. B)"

   645

   646 text {*

   647   Note the difference between ordinary xsymbol syntax of indexed

   648   unions and intersections (e.g.\ @{text"\<Union>a\<^isub>1\<in>A\<^isub>1. B"})

   649   and their \LaTeX\ rendition: @{term"\<Union>a\<^isub>1\<in>A\<^isub>1. B"}. The

   650   former does not make the index expression a subscript of the

   651   union/intersection symbol because this leads to problems with nested

   652   subscripts in Proof General.

   653 *}

   654

   655 print_translation {*

   656   [Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax UNION} @{syntax_const "_UNION"}]

   657 *} -- {* to avoid eta-contraction of body *}

   658

   659 lemma UNION_eq_Union_image:

   660   "(\<Union>x\<in>A. B x) = \<Union>(B  A)"

   661   by (fact SUPR_def)

   662

   663 lemma Union_def:

   664   "\<Union>S = (\<Union>x\<in>S. x)"

   665   by (simp add: UNION_eq_Union_image image_def)

   666

   667 lemma UNION_def [no_atp]:

   668   "(\<Union>x\<in>A. B x) = {y. \<exists>x\<in>A. y \<in> B x}"

   669   by (auto simp add: UNION_eq_Union_image Union_eq)

   670

   671 lemma Union_image_eq [simp]:

   672   "\<Union>(B  A) = (\<Union>x\<in>A. B x)"

   673   by (rule sym) (fact UNION_eq_Union_image)

   674

   675 lemma UN_iff [simp]: "(b: (\<Union>x\<in>A. B x)) = (\<exists>x\<in>A. b: B x)"

   676   by (unfold UNION_def) blast

   677

   678 lemma UN_I [intro]: "a:A \<Longrightarrow> b: B a \<Longrightarrow> b: (\<Union>x\<in>A. B x)"

   679   -- {* The order of the premises presupposes that @{term A} is rigid;

   680     @{term b} may be flexible. *}

   681   by auto

   682

   683 lemma UN_E [elim!]: "b : (\<Union>x\<in>A. B x) \<Longrightarrow> (\<And>x. x:A \<Longrightarrow> b: B x \<Longrightarrow> R) \<Longrightarrow> R"

   684   by (unfold UNION_def) blast

   685

   686 lemma UN_cong [cong]:

   687     "A = B \<Longrightarrow> (\<And>x. x:B \<Longrightarrow> C x = D x) \<Longrightarrow> (\<Union>x\<in>A. C x) = (\<Union>x\<in>B. D x)"

   688   by (simp add: UNION_def)

   689

   690 lemma strong_UN_cong:

   691     "A = B \<Longrightarrow> (\<And>x. x:B =simp=> C x = D x) \<Longrightarrow> (\<Union>x\<in>A. C x) = (\<Union>x\<in>B. D x)"

   692   by (simp add: UNION_def simp_implies_def)

   693

   694 lemma image_eq_UN: "f  A = (\<Union>x\<in>A. {f x})"

   695   by blast

   696

   697 lemma UN_upper: "a \<in> A \<Longrightarrow> B a \<subseteq> (\<Union>x\<in>A. B x)"

   698   by (fact le_SUPI)

   699

   700 lemma UN_least: "(\<And>x. x \<in> A \<Longrightarrow> B x \<subseteq> C) \<Longrightarrow> (\<Union>x\<in>A. B x) \<subseteq> C"

   701   by (iprover intro: subsetI elim: UN_E dest: subsetD)

   702

   703 lemma Collect_bex_eq [no_atp]: "{x. \<exists>y\<in>A. P x y} = (\<Union>y\<in>A. {x. P x y})"

   704   by blast

   705

   706 lemma UN_insert_distrib: "u \<in> A \<Longrightarrow> (\<Union>x\<in>A. insert a (B x)) = insert a (\<Union>x\<in>A. B x)"

   707   by blast

   708

   709 lemma UN_empty [simp,no_atp]: "(\<Union>x\<in>{}. B x) = {}"

   710   by blast

   711

   712 lemma UN_empty2 [simp]: "(\<Union>x\<in>A. {}) = {}"

   713   by blast

   714

   715 lemma UN_singleton [simp]: "(\<Union>x\<in>A. {x}) = A"

   716   by blast

   717

   718 lemma UN_absorb: "k \<in> I \<Longrightarrow> A k \<union> (\<Union>i\<in>I. A i) = (\<Union>i\<in>I. A i)"

   719   by auto

   720

   721 lemma UN_insert [simp]: "(\<Union>x\<in>insert a A. B x) = B a \<union> UNION A B"

   722   by blast

   723

   724 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)"

   725   by blast

   726

   727 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)"

   728   by blast

   729

   730 lemma UN_subset_iff: "((\<Union>i\<in>I. A i) \<subseteq> B) = (\<forall>i\<in>I. A i \<subseteq> B)"

   731   by (fact SUP_le_iff)

   732

   733 lemma image_Union: "f  \<Union>S = (\<Union>x\<in>S. f  x)"

   734   by blast

   735

   736 lemma UN_constant [simp]: "(\<Union>y\<in>A. c) = (if A = {} then {} else c)"

   737   by auto

   738

   739 lemma UN_eq: "(\<Union>x\<in>A. B x) = \<Union>({Y. \<exists>x\<in>A. Y = B x})"

   740   by blast

   741

   742 lemma UNION_empty_conv[simp]:

   743   "{} = (\<Union>x\<in>A. B x) \<longleftrightarrow> (\<forall>x\<in>A. B x = {})"

   744   "(\<Union>x\<in>A. B x) = {} \<longleftrightarrow> (\<forall>x\<in>A. B x = {})"

   745 by blast+

   746

   747 lemma Collect_ex_eq [no_atp]: "{x. \<exists>y. P x y} = (\<Union>y. {x. P x y})"

   748   by blast

   749

   750 lemma ball_UN: "(\<forall>z \<in> UNION A B. P z) = (\<forall>x\<in>A. \<forall>z \<in> B x. P z)"

   751   by blast

   752

   753 lemma bex_UN: "(\<exists>z \<in> UNION A B. P z) = (\<exists>x\<in>A. \<exists>z\<in>B x. P z)"

   754   by blast

   755

   756 lemma Un_eq_UN: "A \<union> B = (\<Union>b. if b then A else B)"

   757   by (auto simp add: split_if_mem2)

   758

   759 lemma UN_bool_eq: "(\<Union>b. A b) = (A True \<union> A False)"

   760   by (auto intro: bool_contrapos)

   761

   762 lemma UN_Pow_subset: "(\<Union>x\<in>A. Pow (B x)) \<subseteq> Pow (\<Union>x\<in>A. B x)"

   763   by blast

   764

   765 lemma UN_mono:

   766   "A \<subseteq> B \<Longrightarrow> (\<And>x. x \<in> A \<Longrightarrow> f x \<subseteq> g x) \<Longrightarrow>

   767     (\<Union>x\<in>A. f x) \<subseteq> (\<Union>x\<in>B. g x)"

   768   by (blast dest: subsetD)

   769

   770 lemma vimage_Union: "f - (\<Union>A) = (\<Union>X\<in>A. f - X)"

   771   by blast

   772

   773 lemma vimage_UN: "f - (\<Union>x\<in>A. B x) = (\<Union>x\<in>A. f - B x)"

   774   by blast

   775

   776 lemma vimage_eq_UN: "f - B = (\<Union>y\<in>B. f - {y})"

   777   -- {* NOT suitable for rewriting *}

   778   by blast

   779

   780 lemma image_UN: "f  UNION A B = (\<Union>x\<in>A. f  B x)"

   781   by blast

   782

   783

   784 subsection {* Distributive laws *}

   785

   786 lemma Int_Union: "A \<inter> \<Union>B = (\<Union>C\<in>B. A \<inter> C)"

   787   by blast

   788

   789 lemma Int_Union2: "\<Union>B \<inter> A = (\<Union>C\<in>B. C \<inter> A)"

   790   by blast

   791

   792 lemma Un_Union_image: "(\<Union>x\<in>C. A x \<union> B x) = \<Union>(A  C) \<union> \<Union>(B  C)"

   793   -- {* Devlin, Fundamentals of Contemporary Set Theory, page 12, exercise 5: *}

   794   -- {* Union of a family of unions *}

   795   by blast

   796

   797 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)"

   798   -- {* Equivalent version *}

   799   by blast

   800

   801 lemma Un_Inter: "A \<union> \<Inter>B = (\<Inter>C\<in>B. A \<union> C)"

   802   by blast

   803

   804 lemma Int_Inter_image: "(\<Inter>x\<in>C. A x \<inter> B x) = \<Inter>(A  C) \<inter> \<Inter>(B  C)"

   805   by blast

   806

   807 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)"

   808   -- {* Equivalent version *}

   809   by blast

   810

   811 lemma Int_UN_distrib: "B \<inter> (\<Union>i\<in>I. A i) = (\<Union>i\<in>I. B \<inter> A i)"

   812   -- {* Halmos, Naive Set Theory, page 35. *}

   813   by blast

   814

   815 lemma Un_INT_distrib: "B \<union> (\<Inter>i\<in>I. A i) = (\<Inter>i\<in>I. B \<union> A i)"

   816   by blast

   817

   818 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)"

   819   by blast

   820

   821 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)"

   822   by blast

   823

   824

   825 subsection {* Complement *}

   826

   827 lemma Compl_UN [simp]: "- (\<Union>x\<in>A. B x) = (\<Inter>x\<in>A. -B x)"

   828   by blast

   829

   830 lemma Compl_INT [simp]: "- (\<Inter>x\<in>A. B x) = (\<Union>x\<in>A. -B x)"

   831   by blast

   832

   833

   834 subsection {* Miniscoping and maxiscoping *}

   835

   836 text {* \medskip Miniscoping: pushing in quantifiers and big Unions

   837            and Intersections. *}

   838

   839 lemma UN_simps [simp]:

   840   "\<And>a B C. (\<Union>x\<in>C. insert a (B x)) = (if C={} then {} else insert a (\<Union>x\<in>C. B x))"

   841   "\<And>A B C. (\<Union>x\<in>C. A x Un B)   = ((if C={} then {} else (\<Union>x\<in>C. A x) Un B))"

   842   "\<And>A B C. (\<Union>x\<in>C. A Un B x)   = ((if C={} then {} else A Un (\<Union>x\<in>C. B x)))"

   843   "\<And>A B C. (\<Union>x\<in>C. A x Int B)  = ((\<Union>x\<in>C. A x) Int B)"

   844   "\<And>A B C. (\<Union>x\<in>C. A Int B x)  = (A Int (\<Union>x\<in>C. B x))"

   845   "\<And>A B C. (\<Union>x\<in>C. A x - B)    = ((\<Union>x\<in>C. A x) - B)"

   846   "\<And>A B C. (\<Union>x\<in>C. A - B x)    = (A - (\<Inter>x\<in>C. B x))"

   847   "\<And>A B. (UN x: \<Union>A. B x) = (UN y:A. UN x:y. B x)"

   848   "\<And>A B C. (UN z: UNION A B. C z) = (UN  x:A. UN z: B(x). C z)"

   849   "\<And>A B f. (UN x:fA. B x)     = (UN a:A. B (f a))"

   850   by auto

   851

   852 lemma INT_simps [simp]:

   853   "\<And>A B C. (\<Inter>x\<in>C. A x Int B) = (if C={} then UNIV else (\<Inter>x\<in>C. A x) Int B)"

   854   "\<And>A B C. (\<Inter>x\<in>C. A Int B x) = (if C={} then UNIV else A Int (\<Inter>x\<in>C. B x))"

   855   "\<And>A B C. (\<Inter>x\<in>C. A x - B)   = (if C={} then UNIV else (\<Inter>x\<in>C. A x) - B)"

   856   "\<And>A B C. (\<Inter>x\<in>C. A - B x)   = (if C={} then UNIV else A - (\<Union>x\<in>C. B x))"

   857   "\<And>a B C. (\<Inter>x\<in>C. insert a (B x)) = insert a (\<Inter>x\<in>C. B x)"

   858   "\<And>A B C. (\<Inter>x\<in>C. A x Un B)  = ((\<Inter>x\<in>C. A x) Un B)"

   859   "\<And>A B C. (\<Inter>x\<in>C. A Un B x)  = (A Un (\<Inter>x\<in>C. B x))"

   860   "\<And>A B. (INT x: \<Union>A. B x) = (\<Inter>y\<in>A. INT x:y. B x)"

   861   "\<And>A B C. (INT z: UNION A B. C z) = (\<Inter>x\<in>A. INT z: B(x). C z)"

   862   "\<And>A B f. (INT x:fA. B x)    = (INT a:A. B (f a))"

   863   by auto

   864

   865 lemma ball_simps [simp,no_atp]:

   866   "\<And>A P Q. (\<forall>x\<in>A. P x | Q) = ((\<forall>x\<in>A. P x) | Q)"

   867   "\<And>A P Q. (\<forall>x\<in>A. P | Q x) = (P | (\<forall>x\<in>A. Q x))"

   868   "\<And>A P Q. (\<forall>x\<in>A. P --> Q x) = (P --> (\<forall>x\<in>A. Q x))"

   869   "\<And>A P Q. (\<forall>x\<in>A. P x --> Q) = ((\<exists>x\<in>A. P x) --> Q)"

   870   "\<And>P. (ALL x:{}. P x) = True"

   871   "\<And>P. (ALL x:UNIV. P x) = (ALL x. P x)"

   872   "\<And>a B P. (ALL x:insert a B. P x) = (P a & (ALL x:B. P x))"

   873   "\<And>A P. (ALL x:\<Union>A. P x) = (ALL y:A. ALL x:y. P x)"

   874   "\<And>A B P. (ALL x: UNION A B. P x) = (ALL a:A. ALL x: B a. P x)"

   875   "\<And>P Q. (ALL x:Collect Q. P x) = (ALL x. Q x --> P x)"

   876   "\<And>A P f. (ALL x:fA. P x) = (\<forall>x\<in>A. P (f x))"

   877   "\<And>A P. (~(\<forall>x\<in>A. P x)) = (\<exists>x\<in>A. ~P x)"

   878   by auto

   879

   880 lemma bex_simps [simp,no_atp]:

   881   "\<And>A P Q. (\<exists>x\<in>A. P x & Q) = ((\<exists>x\<in>A. P x) & Q)"

   882   "\<And>A P Q. (\<exists>x\<in>A. P & Q x) = (P & (\<exists>x\<in>A. Q x))"

   883   "\<And>P. (EX x:{}. P x) = False"

   884   "\<And>P. (EX x:UNIV. P x) = (EX x. P x)"

   885   "\<And>a B P. (EX x:insert a B. P x) = (P(a) | (EX x:B. P x))"

   886   "\<And>A P. (EX x:\<Union>A. P x) = (EX y:A. EX x:y. P x)"

   887   "\<And>A B P. (EX x: UNION A B. P x) = (EX a:A. EX x:B a. P x)"

   888   "\<And>P Q. (EX x:Collect Q. P x) = (EX x. Q x & P x)"

   889   "\<And>A P f. (EX x:fA. P x) = (\<exists>x\<in>A. P (f x))"

   890   "\<And>A P. (~(\<exists>x\<in>A. P x)) = (\<forall>x\<in>A. ~P x)"

   891   by auto

   892

   893 text {* \medskip Maxiscoping: pulling out big Unions and Intersections. *}

   894

   895 lemma UN_extend_simps:

   896   "\<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)))"

   897   "\<And>A B C. (\<Union>x\<in>C. A x) Un B    = (if C={} then B else (\<Union>x\<in>C. A x Un B))"

   898   "\<And>A B C. A Un (\<Union>x\<in>C. B x)   = (if C={} then A else (\<Union>x\<in>C. A Un B x))"

   899   "\<And>A B C. ((\<Union>x\<in>C. A x) Int B) = (\<Union>x\<in>C. A x Int B)"

   900   "\<And>A B C. (A Int (\<Union>x\<in>C. B x)) = (\<Union>x\<in>C. A Int B x)"

   901   "\<And>A B C. ((\<Union>x\<in>C. A x) - B) = (\<Union>x\<in>C. A x - B)"

   902   "\<And>A B C. (A - (\<Inter>x\<in>C. B x)) = (\<Union>x\<in>C. A - B x)"

   903   "\<And>A B. (UN y:A. UN x:y. B x) = (UN x: \<Union>A. B x)"

   904   "\<And>A B C. (UN  x:A. UN z: B(x). C z) = (UN z: UNION A B. C z)"

   905   "\<And>A B f. (UN a:A. B (f a)) = (UN x:fA. B x)"

   906   by auto

   907

   908 lemma INT_extend_simps:

   909   "\<And>A B C. (\<Inter>x\<in>C. A x) Int B = (if C={} then B else (\<Inter>x\<in>C. A x Int B))"

   910   "\<And>A B C. A Int (\<Inter>x\<in>C. B x) = (if C={} then A else (\<Inter>x\<in>C. A Int B x))"

   911   "\<And>A B C. (\<Inter>x\<in>C. A x) - B   = (if C={} then UNIV-B else (\<Inter>x\<in>C. A x - B))"

   912   "\<And>A B C. A - (\<Union>x\<in>C. B x)   = (if C={} then A else (\<Inter>x\<in>C. A - B x))"

   913   "\<And>a B C. insert a (\<Inter>x\<in>C. B x) = (\<Inter>x\<in>C. insert a (B x))"

   914   "\<And>A B C. ((\<Inter>x\<in>C. A x) Un B)  = (\<Inter>x\<in>C. A x Un B)"

   915   "\<And>A B C. A Un (\<Inter>x\<in>C. B x)  = (\<Inter>x\<in>C. A Un B x)"

   916   "\<And>A B. (\<Inter>y\<in>A. INT x:y. B x) = (INT x: \<Union>A. B x)"

   917   "\<And>A B C. (\<Inter>x\<in>A. INT z: B(x). C z) = (INT z: UNION A B. C z)"

   918   "\<And>A B f. (INT a:A. B (f a))    = (INT x:fA. B x)"

   919   by auto

   920

   921

   922 no_notation

   923   less_eq  (infix "\<sqsubseteq>" 50) and

   924   less (infix "\<sqsubset>" 50) and

   925   bot ("\<bottom>") and

   926   top ("\<top>") and

   927   inf  (infixl "\<sqinter>" 70) and

   928   sup  (infixl "\<squnion>" 65) and

   929   Inf  ("\<Sqinter>_" [900] 900) and

   930   Sup  ("\<Squnion>_" [900] 900)

   931

   932 no_syntax (xsymbols)

   933   "_INF1"     :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b"           ("(3\<Sqinter>_./ _)" [0, 10] 10)

   934   "_INF"      :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b"  ("(3\<Sqinter>_\<in>_./ _)" [0, 0, 10] 10)

   935   "_SUP1"     :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b"           ("(3\<Squnion>_./ _)" [0, 10] 10)

   936   "_SUP"      :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b"  ("(3\<Squnion>_\<in>_./ _)" [0, 0, 10] 10)

   937

   938 lemmas mem_simps =

   939   insert_iff empty_iff Un_iff Int_iff Compl_iff Diff_iff

   940   mem_Collect_eq UN_iff Union_iff INT_iff Inter_iff

   941   -- {* Each of these has ALREADY been added @{text "[simp]"} above. *}

   942

   943 end
`