src/HOL/Complete_Lattice.thy
author haftmann
Wed, 22 Jul 2009 18:02:10 +0200
changeset 32139 e271a64f03ff
parent 32135 src/HOL/Set.thy@f645b51e8e54
child 32436 10cd49e0c067
permissions -rw-r--r--
moved complete_lattice &c. into separate theory
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
32139
e271a64f03ff moved complete_lattice &c. into separate theory
haftmann
parents: 32135
diff changeset
     1
(*  Author:     Tobias Nipkow, Lawrence C Paulson and Markus Wenzel; Florian Haftmann, TU Muenchen *)
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
     2
32139
e271a64f03ff moved complete_lattice &c. into separate theory
haftmann
parents: 32135
diff changeset
     3
header {* Complete lattices, with special focus on sets *}
32077
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
     4
32139
e271a64f03ff moved complete_lattice &c. into separate theory
haftmann
parents: 32135
diff changeset
     5
theory Complete_Lattice
e271a64f03ff moved complete_lattice &c. into separate theory
haftmann
parents: 32135
diff changeset
     6
imports Set
e271a64f03ff moved complete_lattice &c. into separate theory
haftmann
parents: 32135
diff changeset
     7
begin
32077
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
     8
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
     9
notation
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    10
  less_eq  (infix "\<sqsubseteq>" 50) and
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    11
  less (infix "\<sqsubset>" 50) and
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    12
  inf  (infixl "\<sqinter>" 70) and
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    13
  sup  (infixl "\<squnion>" 65)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    14
32139
e271a64f03ff moved complete_lattice &c. into separate theory
haftmann
parents: 32135
diff changeset
    15
e271a64f03ff moved complete_lattice &c. into separate theory
haftmann
parents: 32135
diff changeset
    16
subsection {* Abstract complete lattices *}
e271a64f03ff moved complete_lattice &c. into separate theory
haftmann
parents: 32135
diff changeset
    17
32077
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    18
class complete_lattice = lattice + bot + top +
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    19
  fixes Inf :: "'a set \<Rightarrow> 'a" ("\<Sqinter>_" [900] 900)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    20
    and Sup :: "'a set \<Rightarrow> 'a" ("\<Squnion>_" [900] 900)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    21
  assumes Inf_lower: "x \<in> A \<Longrightarrow> \<Sqinter>A \<sqsubseteq> x"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    22
     and Inf_greatest: "(\<And>x. x \<in> A \<Longrightarrow> z \<sqsubseteq> x) \<Longrightarrow> z \<sqsubseteq> \<Sqinter>A"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    23
  assumes Sup_upper: "x \<in> A \<Longrightarrow> x \<sqsubseteq> \<Squnion>A"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    24
     and Sup_least: "(\<And>x. x \<in> A \<Longrightarrow> x \<sqsubseteq> z) \<Longrightarrow> \<Squnion>A \<sqsubseteq> z"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    25
begin
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    26
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    27
lemma Inf_Sup: "\<Sqinter>A = \<Squnion>{b. \<forall>a \<in> A. b \<le> a}"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    28
  by (auto intro: antisym Inf_lower Inf_greatest Sup_upper Sup_least)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    29
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    30
lemma Sup_Inf:  "\<Squnion>A = \<Sqinter>{b. \<forall>a \<in> A. a \<le> b}"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    31
  by (auto intro: antisym Inf_lower Inf_greatest Sup_upper Sup_least)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    32
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    33
lemma Inf_Univ: "\<Sqinter>UNIV = \<Squnion>{}"
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
    34
  unfolding Sup_Inf by auto
32077
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    35
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    36
lemma Sup_Univ: "\<Squnion>UNIV = \<Sqinter>{}"
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
    37
  unfolding Inf_Sup by auto
32077
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    38
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    39
lemma Inf_insert: "\<Sqinter>insert a A = a \<sqinter> \<Sqinter>A"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    40
  by (auto intro: le_infI le_infI1 le_infI2 antisym Inf_greatest Inf_lower)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    41
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    42
lemma Sup_insert: "\<Squnion>insert a A = a \<squnion> \<Squnion>A"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    43
  by (auto intro: le_supI le_supI1 le_supI2 antisym Sup_least Sup_upper)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    44
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    45
lemma Inf_singleton [simp]:
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    46
  "\<Sqinter>{a} = a"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    47
  by (auto intro: antisym Inf_lower Inf_greatest)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    48
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    49
lemma Sup_singleton [simp]:
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    50
  "\<Squnion>{a} = a"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    51
  by (auto intro: antisym Sup_upper Sup_least)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    52
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    53
lemma Inf_insert_simp:
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    54
  "\<Sqinter>insert a A = (if A = {} then a else a \<sqinter> \<Sqinter>A)"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    55
  by (cases "A = {}") (simp_all, simp add: Inf_insert)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    56
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    57
lemma Sup_insert_simp:
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    58
  "\<Squnion>insert a A = (if A = {} then a else a \<squnion> \<Squnion>A)"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    59
  by (cases "A = {}") (simp_all, simp add: Sup_insert)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    60
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    61
lemma Inf_binary:
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    62
  "\<Sqinter>{a, b} = a \<sqinter> b"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    63
  by (auto simp add: Inf_insert_simp)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    64
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    65
lemma Sup_binary:
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    66
  "\<Squnion>{a, b} = a \<squnion> b"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    67
  by (auto simp add: Sup_insert_simp)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    68
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    69
lemma bot_def:
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    70
  "bot = \<Squnion>{}"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    71
  by (auto intro: antisym Sup_least)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    72
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    73
lemma top_def:
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    74
  "top = \<Sqinter>{}"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    75
  by (auto intro: antisym Inf_greatest)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    76
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    77
lemma sup_bot [simp]:
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    78
  "x \<squnion> bot = x"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    79
  using bot_least [of x] by (simp add: le_iff_sup sup_commute)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    80
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    81
lemma inf_top [simp]:
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    82
  "x \<sqinter> top = x"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    83
  using top_greatest [of x] by (simp add: le_iff_inf inf_commute)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    84
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    85
definition SUPR :: "'b set \<Rightarrow> ('b \<Rightarrow> 'a) \<Rightarrow> 'a" where
32117
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
    86
  "SUPR A f = \<Squnion> (f ` A)"
32077
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    87
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    88
definition INFI :: "'b set \<Rightarrow> ('b \<Rightarrow> 'a) \<Rightarrow> 'a" where
32117
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
    89
  "INFI A f = \<Sqinter> (f ` A)"
32077
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    90
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    91
end
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    92
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    93
syntax
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    94
  "_SUP1"     :: "pttrns => 'b => 'b"           ("(3SUP _./ _)" [0, 10] 10)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    95
  "_SUP"      :: "pttrn => 'a set => 'b => 'b"  ("(3SUP _:_./ _)" [0, 10] 10)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    96
  "_INF1"     :: "pttrns => 'b => 'b"           ("(3INF _./ _)" [0, 10] 10)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    97
  "_INF"      :: "pttrn => 'a set => 'b => 'b"  ("(3INF _:_./ _)" [0, 10] 10)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    98
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
    99
translations
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   100
  "SUP x y. B"   == "SUP x. SUP y. B"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   101
  "SUP x. B"     == "CONST SUPR CONST UNIV (%x. B)"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   102
  "SUP x. B"     == "SUP x:CONST UNIV. B"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   103
  "SUP x:A. B"   == "CONST SUPR A (%x. B)"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   104
  "INF x y. B"   == "INF x. INF y. B"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   105
  "INF x. B"     == "CONST INFI CONST UNIV (%x. B)"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   106
  "INF x. B"     == "INF x:CONST UNIV. B"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   107
  "INF x:A. B"   == "CONST INFI A (%x. B)"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   108
32120
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   109
print_translation {* [
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   110
Syntax.preserve_binder_abs2_tr' @{const_syntax SUPR} "_SUP",
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   111
Syntax.preserve_binder_abs2_tr' @{const_syntax INFI} "_INF"
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   112
] *} -- {* to avoid eta-contraction of body *}
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   113
32077
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   114
context complete_lattice
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   115
begin
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   116
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   117
lemma le_SUPI: "i : A \<Longrightarrow> M i \<le> (SUP i:A. M i)"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   118
  by (auto simp add: SUPR_def intro: Sup_upper)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   119
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   120
lemma SUP_leI: "(\<And>i. i : A \<Longrightarrow> M i \<le> u) \<Longrightarrow> (SUP i:A. M i) \<le> u"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   121
  by (auto simp add: SUPR_def intro: Sup_least)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   122
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   123
lemma INF_leI: "i : A \<Longrightarrow> (INF i:A. M i) \<le> M i"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   124
  by (auto simp add: INFI_def intro: Inf_lower)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   125
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   126
lemma le_INFI: "(\<And>i. i : A \<Longrightarrow> u \<le> M i) \<Longrightarrow> u \<le> (INF i:A. M i)"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   127
  by (auto simp add: INFI_def intro: Inf_greatest)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   128
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   129
lemma SUP_const[simp]: "A \<noteq> {} \<Longrightarrow> (SUP i:A. M) = M"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   130
  by (auto intro: antisym SUP_leI le_SUPI)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   131
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   132
lemma INF_const[simp]: "A \<noteq> {} \<Longrightarrow> (INF i:A. M) = M"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   133
  by (auto intro: antisym INF_leI le_INFI)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   134
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   135
end
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   136
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   137
32139
e271a64f03ff moved complete_lattice &c. into separate theory
haftmann
parents: 32135
diff changeset
   138
subsection {* @{typ bool} and @{typ "_ \<Rightarrow> _"} as complete lattice *}
32077
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   139
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   140
instantiation bool :: complete_lattice
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   141
begin
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   142
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   143
definition
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   144
  Inf_bool_def: "\<Sqinter>A \<longleftrightarrow> (\<forall>x\<in>A. x)"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   145
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   146
definition
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   147
  Sup_bool_def: "\<Squnion>A \<longleftrightarrow> (\<exists>x\<in>A. x)"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   148
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   149
instance proof
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   150
qed (auto simp add: Inf_bool_def Sup_bool_def le_bool_def)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   151
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   152
end
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   153
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   154
lemma Inf_empty_bool [simp]:
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   155
  "\<Sqinter>{}"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   156
  unfolding Inf_bool_def by auto
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   157
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   158
lemma not_Sup_empty_bool [simp]:
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   159
  "\<not> \<Squnion>{}"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   160
  unfolding Sup_bool_def by auto
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   161
32120
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   162
lemma INFI_bool_eq:
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   163
  "INFI = Ball"
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   164
proof (rule ext)+
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   165
  fix A :: "'a set"
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   166
  fix P :: "'a \<Rightarrow> bool"
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   167
  show "(INF x:A. P x) \<longleftrightarrow> (\<forall>x \<in> A. P x)"
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   168
    by (auto simp add: Ball_def INFI_def Inf_bool_def)
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   169
qed
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   170
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   171
lemma SUPR_bool_eq:
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   172
  "SUPR = Bex"
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   173
proof (rule ext)+
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   174
  fix A :: "'a set"
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   175
  fix P :: "'a \<Rightarrow> bool"
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   176
  show "(SUP x:A. P x) \<longleftrightarrow> (\<exists>x \<in> A. P x)"
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   177
    by (auto simp add: Bex_def SUPR_def Sup_bool_def)
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   178
qed
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   179
32077
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   180
instantiation "fun" :: (type, complete_lattice) complete_lattice
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   181
begin
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   182
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   183
definition
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   184
  Inf_fun_def [code del]: "\<Sqinter>A = (\<lambda>x. \<Sqinter>{y. \<exists>f\<in>A. y = f x})"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   185
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   186
definition
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   187
  Sup_fun_def [code del]: "\<Squnion>A = (\<lambda>x. \<Squnion>{y. \<exists>f\<in>A. y = f x})"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   188
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   189
instance proof
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   190
qed (auto simp add: Inf_fun_def Sup_fun_def le_fun_def
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   191
  intro: Inf_lower Sup_upper Inf_greatest Sup_least)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   192
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   193
end
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   194
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   195
lemma Inf_empty_fun:
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   196
  "\<Sqinter>{} = (\<lambda>_. \<Sqinter>{})"
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   197
  by (simp add: Inf_fun_def)
32077
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   198
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   199
lemma Sup_empty_fun:
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   200
  "\<Squnion>{} = (\<lambda>_. \<Squnion>{})"
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   201
  by (simp add: Sup_fun_def)
32077
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   202
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   203
32139
e271a64f03ff moved complete_lattice &c. into separate theory
haftmann
parents: 32135
diff changeset
   204
subsection {* Union *}
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   205
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   206
definition Union :: "'a set set \<Rightarrow> 'a set" where
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   207
  Sup_set_eq [symmetric]: "Union S = \<Squnion>S"
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   208
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   209
notation (xsymbols)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   210
  Union  ("\<Union>_" [90] 90)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   211
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   212
lemma Union_eq:
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   213
  "\<Union>A = {x. \<exists>B \<in> A. x \<in> B}"
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   214
proof (rule set_ext)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   215
  fix x
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   216
  have "(\<exists>Q\<in>{P. \<exists>B\<in>A. P \<longleftrightarrow> x \<in> B}. Q) \<longleftrightarrow> (\<exists>B\<in>A. x \<in> B)"
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   217
    by auto
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   218
  then show "x \<in> \<Union>A \<longleftrightarrow> x \<in> {x. \<exists>B\<in>A. x \<in> B}"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   219
    by (simp add: Sup_set_eq [symmetric] Sup_fun_def Sup_bool_def) (simp add: mem_def)
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   220
qed
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   221
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   222
lemma Union_iff [simp, noatp]:
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   223
  "A \<in> \<Union>C \<longleftrightarrow> (\<exists>X\<in>C. A\<in>X)"
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   224
  by (unfold Union_eq) blast
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   225
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   226
lemma UnionI [intro]:
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   227
  "X \<in> C \<Longrightarrow> A \<in> X \<Longrightarrow> A \<in> \<Union>C"
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   228
  -- {* The order of the premises presupposes that @{term C} is rigid;
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   229
    @{term A} may be flexible. *}
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   230
  by auto
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   231
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   232
lemma UnionE [elim!]:
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   233
  "A \<in> \<Union>C \<Longrightarrow> (\<And>X. A\<in>X \<Longrightarrow> X\<in>C \<Longrightarrow> R) \<Longrightarrow> R"
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   234
  by auto
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   235
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   236
lemma Union_upper: "B \<in> A ==> B \<subseteq> Union A"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   237
  by (iprover intro: subsetI UnionI)
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   238
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   239
lemma Union_least: "(!!X. X \<in> A ==> X \<subseteq> C) ==> Union A \<subseteq> C"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   240
  by (iprover intro: subsetI elim: UnionE dest: subsetD)
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   241
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   242
lemma Un_eq_Union: "A \<union> B = \<Union>{A, B}"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   243
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   244
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   245
lemma Union_empty [simp]: "Union({}) = {}"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   246
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   247
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   248
lemma Union_UNIV [simp]: "Union UNIV = UNIV"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   249
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   250
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   251
lemma Union_insert [simp]: "Union (insert a B) = a \<union> \<Union>B"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   252
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   253
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   254
lemma Union_Un_distrib [simp]: "\<Union>(A Un B) = \<Union>A \<union> \<Union>B"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   255
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   256
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   257
lemma Union_Int_subset: "\<Union>(A \<inter> B) \<subseteq> \<Union>A \<inter> \<Union>B"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   258
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   259
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   260
lemma Union_empty_conv [simp,noatp]: "(\<Union>A = {}) = (\<forall>x\<in>A. x = {})"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   261
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   262
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   263
lemma empty_Union_conv [simp,noatp]: "({} = \<Union>A) = (\<forall>x\<in>A. x = {})"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   264
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   265
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   266
lemma Union_disjoint: "(\<Union>C \<inter> A = {}) = (\<forall>B\<in>C. B \<inter> A = {})"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   267
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   268
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   269
lemma subset_Pow_Union: "A \<subseteq> Pow (\<Union>A)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   270
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   271
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   272
lemma Union_Pow_eq [simp]: "\<Union>(Pow A) = A"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   273
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   274
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   275
lemma Union_mono: "A \<subseteq> B ==> \<Union>A \<subseteq> \<Union>B"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   276
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   277
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   278
32139
e271a64f03ff moved complete_lattice &c. into separate theory
haftmann
parents: 32135
diff changeset
   279
subsection {* Unions of families *}
32077
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   280
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   281
definition UNION :: "'a set \<Rightarrow> ('a \<Rightarrow> 'b set) \<Rightarrow> 'b set" where
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   282
  SUPR_set_eq [symmetric]: "UNION S f = (SUP x:S. f x)"
32077
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   283
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   284
syntax
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   285
  "@UNION1"     :: "pttrns => 'b set => 'b set"           ("(3UN _./ _)" [0, 10] 10)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   286
  "@UNION"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3UN _:_./ _)" [0, 10] 10)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   287
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   288
syntax (xsymbols)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   289
  "@UNION1"     :: "pttrns => 'b set => 'b set"           ("(3\<Union>_./ _)" [0, 10] 10)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   290
  "@UNION"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3\<Union>_\<in>_./ _)" [0, 10] 10)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   291
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   292
syntax (latex output)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   293
  "@UNION1"     :: "pttrns => 'b set => 'b set"           ("(3\<Union>(00\<^bsub>_\<^esub>)/ _)" [0, 10] 10)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   294
  "@UNION"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3\<Union>(00\<^bsub>_\<in>_\<^esub>)/ _)" [0, 10] 10)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   295
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   296
translations
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   297
  "UN x y. B"   == "UN x. UN y. B"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   298
  "UN x. B"     == "CONST UNION CONST UNIV (%x. B)"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   299
  "UN x. B"     == "UN x:CONST UNIV. B"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   300
  "UN x:A. B"   == "CONST UNION A (%x. B)"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   301
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   302
text {*
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   303
  Note the difference between ordinary xsymbol syntax of indexed
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   304
  unions and intersections (e.g.\ @{text"\<Union>a\<^isub>1\<in>A\<^isub>1. B"})
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   305
  and their \LaTeX\ rendition: @{term"\<Union>a\<^isub>1\<in>A\<^isub>1. B"}. The
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   306
  former does not make the index expression a subscript of the
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   307
  union/intersection symbol because this leads to problems with nested
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   308
  subscripts in Proof General.
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   309
*}
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   310
32120
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   311
print_translation {* [
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   312
Syntax.preserve_binder_abs2_tr' @{const_syntax UNION} "@UNION"
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   313
] *} -- {* to avoid eta-contraction of body *}
32077
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   314
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   315
lemma UNION_eq_Union_image:
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   316
  "(\<Union>x\<in>A. B x) = \<Union>(B`A)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   317
  by (simp add: SUPR_def SUPR_set_eq [symmetric] Sup_set_eq)
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   318
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   319
lemma Union_def:
32117
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   320
  "\<Union>S = (\<Union>x\<in>S. x)"
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   321
  by (simp add: UNION_eq_Union_image image_def)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   322
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   323
lemma UNION_def [noatp]:
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   324
  "(\<Union>x\<in>A. B x) = {y. \<exists>x\<in>A. y \<in> B x}"
32117
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   325
  by (auto simp add: UNION_eq_Union_image Union_eq)
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   326
  
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   327
lemma Union_image_eq [simp]:
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   328
  "\<Union>(B`A) = (\<Union>x\<in>A. B x)"
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   329
  by (rule sym) (fact UNION_eq_Union_image)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   330
  
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   331
lemma UN_iff [simp]: "(b: (UN x:A. B x)) = (EX x:A. b: B x)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   332
  by (unfold UNION_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   333
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   334
lemma UN_I [intro]: "a:A ==> b: B a ==> b: (UN x:A. B x)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   335
  -- {* The order of the premises presupposes that @{term A} is rigid;
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   336
    @{term b} may be flexible. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   337
  by auto
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   338
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   339
lemma UN_E [elim!]: "b : (UN x:A. B x) ==> (!!x. x:A ==> b: B x ==> R) ==> R"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   340
  by (unfold UNION_def) blast
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   341
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   342
lemma UN_cong [cong]:
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   343
    "A = B ==> (!!x. x:B ==> C x = D x) ==> (UN x:A. C x) = (UN x:B. D x)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   344
  by (simp add: UNION_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   345
29691
9f03b5f847cd Added strong congruence rule for UN.
berghofe
parents: 28562
diff changeset
   346
lemma strong_UN_cong:
9f03b5f847cd Added strong congruence rule for UN.
berghofe
parents: 28562
diff changeset
   347
    "A = B ==> (!!x. x:B =simp=> C x = D x) ==> (UN x:A. C x) = (UN x:B. D x)"
9f03b5f847cd Added strong congruence rule for UN.
berghofe
parents: 28562
diff changeset
   348
  by (simp add: UNION_def simp_implies_def)
9f03b5f847cd Added strong congruence rule for UN.
berghofe
parents: 28562
diff changeset
   349
32077
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   350
lemma image_eq_UN: "f`A = (UN x:A. {f x})"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   351
  by blast
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   352
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   353
lemma UN_upper: "a \<in> A ==> B a \<subseteq> (\<Union>x\<in>A. B x)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   354
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   355
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   356
lemma UN_least: "(!!x. x \<in> A ==> B x \<subseteq> C) ==> (\<Union>x\<in>A. B x) \<subseteq> C"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   357
  by (iprover intro: subsetI elim: UN_E dest: subsetD)
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   358
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   359
lemma Collect_bex_eq [noatp]: "{x. \<exists>y\<in>A. P x y} = (\<Union>y\<in>A. {x. P x y})"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   360
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   361
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   362
lemma UN_insert_distrib: "u \<in> A ==> (\<Union>x\<in>A. insert a (B x)) = insert a (\<Union>x\<in>A. B x)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   363
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   364
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   365
lemma UN_empty [simp,noatp]: "(\<Union>x\<in>{}. B x) = {}"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   366
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   367
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   368
lemma UN_empty2 [simp]: "(\<Union>x\<in>A. {}) = {}"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   369
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   370
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   371
lemma UN_singleton [simp]: "(\<Union>x\<in>A. {x}) = A"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   372
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   373
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   374
lemma UN_absorb: "k \<in> I ==> A k \<union> (\<Union>i\<in>I. A i) = (\<Union>i\<in>I. A i)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   375
  by auto
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   376
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   377
lemma UN_insert [simp]: "(\<Union>x\<in>insert a A. B x) = B a \<union> UNION A B"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   378
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   379
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   380
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)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   381
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   382
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   383
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)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   384
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   385
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   386
lemma UN_subset_iff: "((\<Union>i\<in>I. A i) \<subseteq> B) = (\<forall>i\<in>I. A i \<subseteq> B)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   387
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   388
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   389
lemma image_Union: "f ` \<Union>S = (\<Union>x\<in>S. f ` x)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   390
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   391
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   392
lemma UN_constant [simp]: "(\<Union>y\<in>A. c) = (if A = {} then {} else c)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   393
  by auto
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   394
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   395
lemma UN_eq: "(\<Union>x\<in>A. B x) = \<Union>({Y. \<exists>x\<in>A. Y = B x})"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   396
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   397
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   398
lemma UNION_empty_conv[simp]:
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   399
  "({} = (UN x:A. B x)) = (\<forall>x\<in>A. B x = {})"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   400
  "((UN x:A. B x) = {}) = (\<forall>x\<in>A. B x = {})"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   401
by blast+
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   402
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   403
lemma Collect_ex_eq [noatp]: "{x. \<exists>y. P x y} = (\<Union>y. {x. P x y})"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   404
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   405
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   406
lemma ball_UN: "(\<forall>z \<in> UNION A B. P z) = (\<forall>x\<in>A. \<forall>z \<in> B x. P z)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   407
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   408
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   409
lemma bex_UN: "(\<exists>z \<in> UNION A B. P z) = (\<exists>x\<in>A. \<exists>z\<in>B x. P z)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   410
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   411
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   412
lemma Un_eq_UN: "A \<union> B = (\<Union>b. if b then A else B)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   413
  by (auto simp add: split_if_mem2)
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   414
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   415
lemma UN_bool_eq: "(\<Union>b::bool. A b) = (A True \<union> A False)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   416
  by (auto intro: bool_contrapos)
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   417
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   418
lemma UN_Pow_subset: "(\<Union>x\<in>A. Pow (B x)) \<subseteq> Pow (\<Union>x\<in>A. B x)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   419
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   420
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   421
lemma UN_mono:
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   422
  "A \<subseteq> B ==> (!!x. x \<in> A ==> f x \<subseteq> g x) ==>
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   423
    (\<Union>x\<in>A. f x) \<subseteq> (\<Union>x\<in>B. g x)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   424
  by (blast dest: subsetD)
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   425
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   426
lemma vimage_Union: "f -` (Union A) = (UN X:A. f -` X)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   427
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   428
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   429
lemma vimage_UN: "f-`(UN x:A. B x) = (UN x:A. f -` B x)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   430
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   431
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   432
lemma vimage_eq_UN: "f-`B = (UN y: B. f-`{y})"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   433
  -- {* NOT suitable for rewriting *}
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   434
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   435
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   436
lemma image_UN: "(f ` (UNION A B)) = (UN x:A.(f ` (B x)))"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   437
by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   438
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   439
32139
e271a64f03ff moved complete_lattice &c. into separate theory
haftmann
parents: 32135
diff changeset
   440
subsection {* Inter *}
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   441
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   442
definition Inter :: "'a set set \<Rightarrow> 'a set" where
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   443
  Inf_set_eq [symmetric]: "Inter S = \<Sqinter>S"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   444
  
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   445
notation (xsymbols)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   446
  Inter  ("\<Inter>_" [90] 90)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   447
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   448
lemma Inter_eq [code del]:
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   449
  "\<Inter>A = {x. \<forall>B \<in> A. x \<in> B}"
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   450
proof (rule set_ext)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   451
  fix x
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   452
  have "(\<forall>Q\<in>{P. \<exists>B\<in>A. P \<longleftrightarrow> x \<in> B}. Q) \<longleftrightarrow> (\<forall>B\<in>A. x \<in> B)"
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   453
    by auto
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   454
  then show "x \<in> \<Inter>A \<longleftrightarrow> x \<in> {x. \<forall>B \<in> A. x \<in> B}"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   455
    by (simp add: Inf_fun_def Inf_bool_def Inf_set_eq [symmetric]) (simp add: mem_def)
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   456
qed
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   457
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   458
lemma Inter_iff [simp,noatp]: "(A : Inter C) = (ALL X:C. A:X)"
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   459
  by (unfold Inter_eq) blast
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   460
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   461
lemma InterI [intro!]: "(!!X. X:C ==> A:X) ==> A : Inter C"
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   462
  by (simp add: Inter_eq)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   463
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   464
text {*
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   465
  \medskip A ``destruct'' rule -- every @{term X} in @{term C}
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   466
  contains @{term A} as an element, but @{prop "A:X"} can hold when
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   467
  @{prop "X:C"} does not!  This rule is analogous to @{text spec}.
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   468
*}
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   469
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   470
lemma InterD [elim]: "A : Inter C ==> X:C ==> A:X"
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   471
  by auto
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   472
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   473
lemma InterE [elim]: "A : Inter C ==> (X~:C ==> R) ==> (A:X ==> R) ==> R"
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   474
  -- {* ``Classical'' elimination rule -- does not require proving
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   475
    @{prop "X:C"}. *}
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   476
  by (unfold Inter_eq) blast
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   477
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   478
lemma Inter_lower: "B \<in> A ==> Inter A \<subseteq> B"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   479
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   480
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   481
lemma Inter_subset:
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   482
  "[| !!X. X \<in> A ==> X \<subseteq> B; A ~= {} |] ==> \<Inter>A \<subseteq> B"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   483
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   484
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   485
lemma Inter_greatest: "(!!X. X \<in> A ==> C \<subseteq> X) ==> C \<subseteq> Inter A"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   486
  by (iprover intro: InterI subsetI dest: subsetD)
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   487
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   488
lemma Int_eq_Inter: "A \<inter> B = \<Inter>{A, B}"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   489
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   490
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   491
lemma Inter_empty [simp]: "\<Inter>{} = UNIV"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   492
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   493
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   494
lemma Inter_UNIV [simp]: "\<Inter>UNIV = {}"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   495
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   496
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   497
lemma Inter_insert [simp]: "\<Inter>(insert a B) = a \<inter> \<Inter>B"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   498
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   499
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   500
lemma Inter_Un_subset: "\<Inter>A \<union> \<Inter>B \<subseteq> \<Inter>(A \<inter> B)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   501
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   502
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   503
lemma Inter_Un_distrib: "\<Inter>(A \<union> B) = \<Inter>A \<inter> \<Inter>B"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   504
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   505
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   506
lemma Inter_UNIV_conv [simp,noatp]:
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   507
  "(\<Inter>A = UNIV) = (\<forall>x\<in>A. x = UNIV)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   508
  "(UNIV = \<Inter>A) = (\<forall>x\<in>A. x = UNIV)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   509
  by blast+
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   510
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   511
lemma Inter_anti_mono: "B \<subseteq> A ==> \<Inter>A \<subseteq> \<Inter>B"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   512
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   513
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   514
32139
e271a64f03ff moved complete_lattice &c. into separate theory
haftmann
parents: 32135
diff changeset
   515
subsection {* Intersections of families *}
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   516
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   517
definition INTER :: "'a set \<Rightarrow> ('a \<Rightarrow> 'b set) \<Rightarrow> 'b set" where
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   518
  INFI_set_eq [symmetric]: "INTER S f = (INF x:S. f x)"
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   519
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   520
syntax
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   521
  "@INTER1"     :: "pttrns => 'b set => 'b set"           ("(3INT _./ _)" [0, 10] 10)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   522
  "@INTER"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3INT _:_./ _)" [0, 10] 10)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   523
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   524
syntax (xsymbols)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   525
  "@INTER1"     :: "pttrns => 'b set => 'b set"           ("(3\<Inter>_./ _)" [0, 10] 10)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   526
  "@INTER"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3\<Inter>_\<in>_./ _)" [0, 10] 10)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   527
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   528
syntax (latex output)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   529
  "@INTER1"     :: "pttrns => 'b set => 'b set"           ("(3\<Inter>(00\<^bsub>_\<^esub>)/ _)" [0, 10] 10)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   530
  "@INTER"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3\<Inter>(00\<^bsub>_\<in>_\<^esub>)/ _)" [0, 10] 10)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   531
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   532
translations
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   533
  "INT x y. B"  == "INT x. INT y. B"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   534
  "INT x. B"    == "CONST INTER CONST UNIV (%x. B)"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   535
  "INT x. B"    == "INT x:CONST UNIV. B"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   536
  "INT x:A. B"  == "CONST INTER A (%x. B)"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   537
32120
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   538
print_translation {* [
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   539
Syntax.preserve_binder_abs2_tr' @{const_syntax INTER} "@INTER"
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   540
] *} -- {* to avoid eta-contraction of body *}
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   541
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   542
lemma INTER_eq_Inter_image:
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   543
  "(\<Inter>x\<in>A. B x) = \<Inter>(B`A)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   544
  by (simp add: INFI_def INFI_set_eq [symmetric] Inf_set_eq)
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   545
  
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   546
lemma Inter_def:
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   547
  "\<Inter>S = (\<Inter>x\<in>S. x)"
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   548
  by (simp add: INTER_eq_Inter_image image_def)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   549
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   550
lemma INTER_def:
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   551
  "(\<Inter>x\<in>A. B x) = {y. \<forall>x\<in>A. y \<in> B x}"
32117
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   552
  by (auto simp add: INTER_eq_Inter_image Inter_eq)
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   553
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   554
lemma Inter_image_eq [simp]:
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   555
  "\<Inter>(B`A) = (\<Inter>x\<in>A. B x)"
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   556
  by (rule sym) (fact INTER_eq_Inter_image)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
   557
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   558
lemma INT_iff [simp]: "(b: (INT x:A. B x)) = (ALL x:A. b: B x)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   559
  by (unfold INTER_def) blast
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   560
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   561
lemma INT_I [intro!]: "(!!x. x:A ==> b: B x) ==> b : (INT x:A. B x)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   562
  by (unfold INTER_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   563
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   564
lemma INT_D [elim]: "b : (INT x:A. B x) ==> a:A ==> b: B a"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   565
  by auto
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   566
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   567
lemma INT_E [elim]: "b : (INT x:A. B x) ==> (b: B a ==> R) ==> (a~:A ==> R) ==> R"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   568
  -- {* "Classical" elimination -- by the Excluded Middle on @{prop "a:A"}. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   569
  by (unfold INTER_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   570
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   571
lemma INT_cong [cong]:
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   572
    "A = B ==> (!!x. x:B ==> C x = D x) ==> (INT x:A. C x) = (INT x:B. D x)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   573
  by (simp add: INTER_def)
7238
36e58620ffc8 replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents: 5931
diff changeset
   574
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   575
lemma Collect_ball_eq: "{x. \<forall>y\<in>A. P x y} = (\<Inter>y\<in>A. {x. P x y})"
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   576
  by blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   577
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   578
lemma Collect_all_eq: "{x. \<forall>y. P x y} = (\<Inter>y. {x. P x y})"
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   579
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   580
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   581
lemma INT_lower: "a \<in> A ==> (\<Inter>x\<in>A. B x) \<subseteq> B a"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   582
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   583
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   584
lemma INT_greatest: "(!!x. x \<in> A ==> C \<subseteq> B x) ==> C \<subseteq> (\<Inter>x\<in>A. B x)"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17508
diff changeset
   585
  by (iprover intro: INT_I subsetI dest: subsetD)
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   586
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   587
lemma INT_empty [simp]: "(\<Inter>x\<in>{}. B x) = UNIV"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   588
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   589
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   590
lemma INT_absorb: "k \<in> I ==> A k \<inter> (\<Inter>i\<in>I. A i) = (\<Inter>i\<in>I. A i)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   591
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   592
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   593
lemma INT_subset_iff: "(B \<subseteq> (\<Inter>i\<in>I. A i)) = (\<forall>i\<in>I. B \<subseteq> A i)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   594
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   595
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   596
lemma INT_insert [simp]: "(\<Inter>x \<in> insert a A. B x) = B a \<inter> INTER A B"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   597
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   598
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   599
lemma INT_Un: "(\<Inter>i \<in> A \<union> B. M i) = (\<Inter>i \<in> A. M i) \<inter> (\<Inter>i\<in>B. M i)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   600
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   601
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   602
lemma INT_insert_distrib:
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   603
    "u \<in> A ==> (\<Inter>x\<in>A. insert a (B x)) = insert a (\<Inter>x\<in>A. B x)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   604
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   605
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   606
lemma INT_constant [simp]: "(\<Inter>y\<in>A. c) = (if A = {} then UNIV else c)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   607
  by auto
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   608
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   609
lemma INT_eq: "(\<Inter>x\<in>A. B x) = \<Inter>({Y. \<exists>x\<in>A. Y = B x})"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   610
  -- {* Look: it has an \emph{existential} quantifier *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   611
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   612
18447
da548623916a removed or modified some instances of [iff]
paulson
parents: 18423
diff changeset
   613
lemma INTER_UNIV_conv[simp]:
13653
ef123b9e8089 Added a few thms about UN/INT/{}/UNIV
nipkow
parents: 13624
diff changeset
   614
 "(UNIV = (INT x:A. B x)) = (\<forall>x\<in>A. B x = UNIV)"
ef123b9e8089 Added a few thms about UN/INT/{}/UNIV
nipkow
parents: 13624
diff changeset
   615
 "((INT x:A. B x) = UNIV) = (\<forall>x\<in>A. B x = UNIV)"
ef123b9e8089 Added a few thms about UN/INT/{}/UNIV
nipkow
parents: 13624
diff changeset
   616
by blast+
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   617
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   618
lemma INT_bool_eq: "(\<Inter>b::bool. A b) = (A True \<inter> A False)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   619
  by (auto intro: bool_induct)
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   620
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   621
lemma Pow_INT_eq: "Pow (\<Inter>x\<in>A. B x) = (\<Inter>x\<in>A. Pow (B x))"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   622
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   623
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   624
lemma INT_anti_mono:
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   625
  "B \<subseteq> A ==> (!!x. x \<in> A ==> f x \<subseteq> g x) ==>
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   626
    (\<Inter>x\<in>A. f x) \<subseteq> (\<Inter>x\<in>A. g x)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   627
  -- {* The last inclusion is POSITIVE! *}
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   628
  by (blast dest: subsetD)
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   629
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   630
lemma vimage_INT: "f-`(INT x:A. B x) = (INT x:A. f -` B x)"
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   631
  by blast
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   632
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   633
32139
e271a64f03ff moved complete_lattice &c. into separate theory
haftmann
parents: 32135
diff changeset
   634
subsection {* Distributive laws *}
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   635
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   636
lemma Int_Union: "A \<inter> \<Union>B = (\<Union>C\<in>B. A \<inter> C)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   637
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   638
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   639
lemma Int_Union2: "\<Union>B \<inter> A = (\<Union>C\<in>B. C \<inter> A)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   640
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   641
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   642
lemma Un_Union_image: "(\<Union>x\<in>C. A x \<union> B x) = \<Union>(A`C) \<union> \<Union>(B`C)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   643
  -- {* Devlin, Fundamentals of Contemporary Set Theory, page 12, exercise 5: *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   644
  -- {* Union of a family of unions *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   645
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   646
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   647
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)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   648
  -- {* Equivalent version *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   649
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   650
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   651
lemma Un_Inter: "A \<union> \<Inter>B = (\<Inter>C\<in>B. A \<union> C)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   652
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   653
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   654
lemma Int_Inter_image: "(\<Inter>x\<in>C. A x \<inter> B x) = \<Inter>(A`C) \<inter> \<Inter>(B`C)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   655
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   656
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   657
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)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   658
  -- {* Equivalent version *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   659
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   660
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   661
lemma Int_UN_distrib: "B \<inter> (\<Union>i\<in>I. A i) = (\<Union>i\<in>I. B \<inter> A i)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   662
  -- {* Halmos, Naive Set Theory, page 35. *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   663
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   664
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   665
lemma Un_INT_distrib: "B \<union> (\<Inter>i\<in>I. A i) = (\<Inter>i\<in>I. B \<union> A i)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   666
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   667
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   668
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)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   669
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   670
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   671
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)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   672
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   673
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   674
32139
e271a64f03ff moved complete_lattice &c. into separate theory
haftmann
parents: 32135
diff changeset
   675
subsection {* Complement *}
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   676
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   677
lemma Compl_UN [simp]: "-(\<Union>x\<in>A. B x) = (\<Inter>x\<in>A. -B x)"
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   678
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   679
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   680
lemma Compl_INT [simp]: "-(\<Inter>x\<in>A. B x) = (\<Union>x\<in>A. -B x)"
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   681
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   682
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   683
32139
e271a64f03ff moved complete_lattice &c. into separate theory
haftmann
parents: 32135
diff changeset
   684
subsection {* Miniscoping and maxiscoping *}
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   685
13860
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   686
text {* \medskip Miniscoping: pushing in quantifiers and big Unions
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   687
           and Intersections. *}
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   688
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   689
lemma UN_simps [simp]:
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   690
  "!!a B C. (UN x:C. insert a (B x)) = (if C={} then {} else insert a (UN x:C. B x))"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   691
  "!!A B C. (UN x:C. A x Un B)   = ((if C={} then {} else (UN x:C. A x) Un B))"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   692
  "!!A B C. (UN x:C. A Un B x)   = ((if C={} then {} else A Un (UN x:C. B x)))"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   693
  "!!A B C. (UN x:C. A x Int B)  = ((UN x:C. A x) Int B)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   694
  "!!A B C. (UN x:C. A Int B x)  = (A Int (UN x:C. B x))"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   695
  "!!A B C. (UN x:C. A x - B)    = ((UN x:C. A x) - B)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   696
  "!!A B C. (UN x:C. A - B x)    = (A - (INT x:C. B x))"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   697
  "!!A B. (UN x: Union A. B x) = (UN y:A. UN x:y. B x)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   698
  "!!A B C. (UN z: UNION A B. C z) = (UN  x:A. UN z: B(x). C z)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   699
  "!!A B f. (UN x:f`A. B x)     = (UN a:A. B (f a))"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   700
  by auto
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   701
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   702
lemma INT_simps [simp]:
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   703
  "!!A B C. (INT x:C. A x Int B) = (if C={} then UNIV else (INT x:C. A x) Int B)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   704
  "!!A B C. (INT x:C. A Int B x) = (if C={} then UNIV else A Int (INT x:C. B x))"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   705
  "!!A B C. (INT x:C. A x - B)   = (if C={} then UNIV else (INT x:C. A x) - B)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   706
  "!!A B C. (INT x:C. A - B x)   = (if C={} then UNIV else A - (UN x:C. B x))"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   707
  "!!a B C. (INT x:C. insert a (B x)) = insert a (INT x:C. B x)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   708
  "!!A B C. (INT x:C. A x Un B)  = ((INT x:C. A x) Un B)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   709
  "!!A B C. (INT x:C. A Un B x)  = (A Un (INT x:C. B x))"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   710
  "!!A B. (INT x: Union A. B x) = (INT y:A. INT x:y. B x)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   711
  "!!A B C. (INT z: UNION A B. C z) = (INT x:A. INT z: B(x). C z)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   712
  "!!A B f. (INT x:f`A. B x)    = (INT a:A. B (f a))"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   713
  by auto
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   714
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
   715
lemma ball_simps [simp,noatp]:
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   716
  "!!A P Q. (ALL x:A. P x | Q) = ((ALL x:A. P x) | Q)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   717
  "!!A P Q. (ALL x:A. P | Q x) = (P | (ALL x:A. Q x))"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   718
  "!!A P Q. (ALL x:A. P --> Q x) = (P --> (ALL x:A. Q x))"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   719
  "!!A P Q. (ALL x:A. P x --> Q) = ((EX x:A. P x) --> Q)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   720
  "!!P. (ALL x:{}. P x) = True"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   721
  "!!P. (ALL x:UNIV. P x) = (ALL x. P x)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   722
  "!!a B P. (ALL x:insert a B. P x) = (P a & (ALL x:B. P x))"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   723
  "!!A P. (ALL x:Union A. P x) = (ALL y:A. ALL x:y. P x)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   724
  "!!A B P. (ALL x: UNION A B. P x) = (ALL a:A. ALL x: B a. P x)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   725
  "!!P Q. (ALL x:Collect Q. P x) = (ALL x. Q x --> P x)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   726
  "!!A P f. (ALL x:f`A. P x) = (ALL x:A. P (f x))"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   727
  "!!A P. (~(ALL x:A. P x)) = (EX x:A. ~P x)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   728
  by auto
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   729
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
   730
lemma bex_simps [simp,noatp]:
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   731
  "!!A P Q. (EX x:A. P x & Q) = ((EX x:A. P x) & Q)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   732
  "!!A P Q. (EX x:A. P & Q x) = (P & (EX x:A. Q x))"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   733
  "!!P. (EX x:{}. P x) = False"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   734
  "!!P. (EX x:UNIV. P x) = (EX x. P x)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   735
  "!!a B P. (EX x:insert a B. P x) = (P(a) | (EX x:B. P x))"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   736
  "!!A P. (EX x:Union A. P x) = (EX y:A. EX x:y. P x)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   737
  "!!A B P. (EX x: UNION A B. P x) = (EX a:A. EX x:B a. P x)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   738
  "!!P Q. (EX x:Collect Q. P x) = (EX x. Q x & P x)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   739
  "!!A P f. (EX x:f`A. P x) = (EX x:A. P (f x))"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   740
  "!!A P. (~(EX x:A. P x)) = (ALL x:A. ~P x)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   741
  by auto
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   742
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   743
lemma ball_conj_distrib:
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   744
  "(ALL x:A. P x & Q x) = ((ALL x:A. P x) & (ALL x:A. Q x))"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   745
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   746
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   747
lemma bex_disj_distrib:
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   748
  "(EX x:A. P x | Q x) = ((EX x:A. P x) | (EX x:A. Q x))"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   749
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   750
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   751
13860
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   752
text {* \medskip Maxiscoping: pulling out big Unions and Intersections. *}
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   753
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   754
lemma UN_extend_simps:
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   755
  "!!a B C. insert a (UN x:C. B x) = (if C={} then {a} else (UN x:C. insert a (B x)))"
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   756
  "!!A B C. (UN x:C. A x) Un B    = (if C={} then B else (UN x:C. A x Un B))"
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   757
  "!!A B C. A Un (UN x:C. B x)   = (if C={} then A else (UN x:C. A Un B x))"
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   758
  "!!A B C. ((UN x:C. A x) Int B) = (UN x:C. A x Int B)"
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   759
  "!!A B C. (A Int (UN x:C. B x)) = (UN x:C. A Int B x)"
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   760
  "!!A B C. ((UN x:C. A x) - B) = (UN x:C. A x - B)"
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   761
  "!!A B C. (A - (INT x:C. B x)) = (UN x:C. A - B x)"
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   762
  "!!A B. (UN y:A. UN x:y. B x) = (UN x: Union A. B x)"
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   763
  "!!A B C. (UN  x:A. UN z: B(x). C z) = (UN z: UNION A B. C z)"
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   764
  "!!A B f. (UN a:A. B (f a)) = (UN x:f`A. B x)"
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   765
  by auto
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   766
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   767
lemma INT_extend_simps:
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   768
  "!!A B C. (INT x:C. A x) Int B = (if C={} then B else (INT x:C. A x Int B))"
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   769
  "!!A B C. A Int (INT x:C. B x) = (if C={} then A else (INT x:C. A Int B x))"
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   770
  "!!A B C. (INT x:C. A x) - B   = (if C={} then UNIV-B else (INT x:C. A x - B))"
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   771
  "!!A B C. A - (UN x:C. B x)   = (if C={} then A else (INT x:C. A - B x))"
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   772
  "!!a B C. insert a (INT x:C. B x) = (INT x:C. insert a (B x))"
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   773
  "!!A B C. ((INT x:C. A x) Un B)  = (INT x:C. A x Un B)"
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   774
  "!!A B C. A Un (INT x:C. B x)  = (INT x:C. A Un B x)"
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   775
  "!!A B. (INT y:A. INT x:y. B x) = (INT x: Union A. B x)"
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   776
  "!!A B C. (INT x:A. INT z: B(x). C z) = (INT z: UNION A B. C z)"
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   777
  "!!A B f. (INT a:A. B (f a))    = (INT x:f`A. B x)"
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   778
  by auto
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   779
b681a3cb0beb new UN/INT simprules
paulson
parents: 13858
diff changeset
   780
32135
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   781
no_notation
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   782
  less_eq  (infix "\<sqsubseteq>" 50) and
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   783
  less (infix "\<sqsubset>" 50) and
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   784
  inf  (infixl "\<sqinter>" 70) and
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   785
  sup  (infixl "\<squnion>" 65) and
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   786
  Inf  ("\<Sqinter>_" [900] 900) and
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   787
  Sup  ("\<Squnion>_" [900] 900)
f645b51e8e54 set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents: 32120
diff changeset
   788
30596
140b22f22071 tuned some theorem and attribute bindings
haftmann
parents: 30531
diff changeset
   789
lemmas mem_simps =
140b22f22071 tuned some theorem and attribute bindings
haftmann
parents: 30531
diff changeset
   790
  insert_iff empty_iff Un_iff Int_iff Compl_iff Diff_iff
140b22f22071 tuned some theorem and attribute bindings
haftmann
parents: 30531
diff changeset
   791
  mem_Collect_eq UN_iff Union_iff INT_iff Inter_iff
140b22f22071 tuned some theorem and attribute bindings
haftmann
parents: 30531
diff changeset
   792
  -- {* Each of these has ALREADY been added @{text "[simp]"} above. *}
21669
c68717c16013 removed legacy ML bindings;
wenzelm
parents: 21549
diff changeset
   793
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   794
end