src/HOL/Set.thy
author haftmann
Tue, 21 Jul 2009 14:38:07 +0200
changeset 32120 53a21a5e6889
parent 32117 0762b9ad83df
child 32135 f645b51e8e54
permissions -rw-r--r--
attempt for more concise setup of non-etacontracting binders
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     1
(*  Title:      HOL/Set.thy
12257
e3f7d6fb55d7 theory Inverse_Image converted and moved to Set;
wenzelm
parents: 12114
diff changeset
     2
    Author:     Tobias Nipkow, Lawrence C Paulson and Markus Wenzel
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     3
*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     4
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
     5
header {* Set theory for higher-order logic *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
     6
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15120
diff changeset
     7
theory Set
30304
d8e4cd2ac2a1 set operations Int, Un, INTER, UNION, Inter, Union, empty, UNIV are now proper qualified constants with authentic syntax
haftmann
parents: 29901
diff changeset
     8
imports Lattices
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15120
diff changeset
     9
begin
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    10
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    11
subsection {* Sets as predicates *}
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
    12
3947
eb707467f8c5 adapted to qualified names;
wenzelm
parents: 3842
diff changeset
    13
global
eb707467f8c5 adapted to qualified names;
wenzelm
parents: 3842
diff changeset
    14
26800
dcf1dfc915a7 - Now uses Orderings as parent theory
berghofe
parents: 26732
diff changeset
    15
types 'a set = "'a => bool"
3820
46b255e140dc fixed infix syntax;
wenzelm
parents: 3370
diff changeset
    16
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    17
consts
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
    18
  Collect       :: "('a => bool) => 'a set"              -- "comprehension"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
    19
  "op :"        :: "'a => 'a set => bool"                -- "membership"
30304
d8e4cd2ac2a1 set operations Int, Un, INTER, UNION, Inter, Union, empty, UNIV are now proper qualified constants with authentic syntax
haftmann
parents: 29901
diff changeset
    20
d8e4cd2ac2a1 set operations Int, Un, INTER, UNION, Inter, Union, empty, UNIV are now proper qualified constants with authentic syntax
haftmann
parents: 29901
diff changeset
    21
local
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    22
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 20380
diff changeset
    23
notation
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    24
  "op :"  ("op :") and
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    25
  "op :"  ("(_/ : _)" [50, 51] 50)
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    26
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
    27
defs
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
  mem_def [code]: "x : S == S 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
    29
  Collect_def [code]: "Collect P == P"
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
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    31
abbreviation
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    32
  "not_mem x A == ~ (x : A)" -- "non-membership"
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    33
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 20380
diff changeset
    34
notation
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    35
  not_mem  ("op ~:") and
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    36
  not_mem  ("(_/ ~: _)" [50, 51] 50)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    37
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 20380
diff changeset
    38
notation (xsymbols)
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    39
  "op :"  ("op \<in>") and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    40
  "op :"  ("(_/ \<in> _)" [50, 51] 50) and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    41
  not_mem  ("op \<notin>") and
30304
d8e4cd2ac2a1 set operations Int, Un, INTER, UNION, Inter, Union, empty, UNIV are now proper qualified constants with authentic syntax
haftmann
parents: 29901
diff changeset
    42
  not_mem  ("(_/ \<notin> _)" [50, 51] 50)
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    43
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 20380
diff changeset
    44
notation (HTML output)
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    45
  "op :"  ("op \<in>") and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    46
  "op :"  ("(_/ \<in> _)" [50, 51] 50) and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    47
  not_mem  ("op \<notin>") and
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    48
  not_mem  ("(_/ \<notin> _)" [50, 51] 50)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    49
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    50
text {* Set comprehensions *}
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    51
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
    52
syntax
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
    53
  "@Coll"       :: "pttrn => bool => 'a set"              ("(1{_./ _})")
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
    54
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
    55
translations
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
    56
  "{x. P}"      == "Collect (%x. P)"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
    57
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    58
syntax
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    59
  "@SetCompr"   :: "'a => idts => bool => 'a set"         ("(1{_ |/_./ _})")
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    60
  "@Collect"    :: "idt => 'a set => bool => 'a set"      ("(1{_ :/ _./ _})")
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    61
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    62
syntax (xsymbols)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    63
  "@Collect"    :: "idt => 'a set => bool => 'a set"      ("(1{_ \<in>/ _./ _})")
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    64
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    65
translations
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    66
  "{x:A. P}"    => "{x. x:A & P}"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    67
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    68
lemma mem_Collect_eq [iff]: "(a : {x. P(x)}) = P(a)"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    69
  by (simp add: Collect_def mem_def)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    70
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    71
lemma Collect_mem_eq [simp]: "{x. x:A} = A"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    72
  by (simp add: Collect_def mem_def)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    73
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    74
lemma CollectI: "P(a) ==> a : {x. P(x)}"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    75
  by simp
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    76
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    77
lemma CollectD: "a : {x. P(x)} ==> P(a)"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    78
  by simp
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    79
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    80
lemma Collect_cong: "(!!x. P x = Q x) ==> {x. P(x)} = {x. Q(x)}"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    81
  by simp
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
    82
32117
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
    83
text {*
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
    84
Simproc for pulling @{text "x=t"} in @{text "{x. \<dots> & x=t & \<dots>}"}
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
    85
to the front (and similarly for @{text "t=x"}):
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
    86
*}
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
    87
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
    88
setup {*
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
    89
let
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
    90
  val Coll_perm_tac = rtac @{thm Collect_cong} 1 THEN rtac @{thm iffI} 1 THEN
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
    91
    ALLGOALS(EVERY'[REPEAT_DETERM o (etac @{thm conjE}),
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
    92
                    DEPTH_SOLVE_1 o (ares_tac [@{thm conjI}])])
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
    93
  val defColl_regroup = Simplifier.simproc @{theory}
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
    94
    "defined Collect" ["{x. P x & Q x}"]
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
    95
    (Quantifier1.rearrange_Coll Coll_perm_tac)
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
    96
in
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
    97
  Simplifier.map_simpset (fn ss => ss addsimprocs [defColl_regroup])
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
    98
end
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
    99
*}
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   100
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   101
lemmas CollectE = CollectD [elim_format]
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   102
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   103
text {* Set enumerations *}
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   104
31456
55edadbd43d5 insert now qualified and with authentic syntax
haftmann
parents: 31197
diff changeset
   105
definition empty :: "'a set" ("{}") where
32117
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   106
  "empty = {x. False}"
31456
55edadbd43d5 insert now qualified and with authentic syntax
haftmann
parents: 31197
diff changeset
   107
55edadbd43d5 insert now qualified and with authentic syntax
haftmann
parents: 31197
diff changeset
   108
definition insert :: "'a \<Rightarrow> 'a set \<Rightarrow> 'a set" where
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   109
  insert_compr: "insert a B = {x. x = a \<or> x \<in> B}"
31456
55edadbd43d5 insert now qualified and with authentic syntax
haftmann
parents: 31197
diff changeset
   110
55edadbd43d5 insert now qualified and with authentic syntax
haftmann
parents: 31197
diff changeset
   111
syntax
55edadbd43d5 insert now qualified and with authentic syntax
haftmann
parents: 31197
diff changeset
   112
  "@Finset"     :: "args => 'a set"                       ("{(_)}")
55edadbd43d5 insert now qualified and with authentic syntax
haftmann
parents: 31197
diff changeset
   113
55edadbd43d5 insert now qualified and with authentic syntax
haftmann
parents: 31197
diff changeset
   114
translations
55edadbd43d5 insert now qualified and with authentic syntax
haftmann
parents: 31197
diff changeset
   115
  "{x, xs}"     == "CONST insert x {xs}"
55edadbd43d5 insert now qualified and with authentic syntax
haftmann
parents: 31197
diff changeset
   116
  "{x}"         == "CONST insert x {}"
55edadbd43d5 insert now qualified and with authentic syntax
haftmann
parents: 31197
diff changeset
   117
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   118
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   119
subsection {* Subsets and bounded quantifiers *}
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   120
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   121
abbreviation
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   122
  subset :: "'a set \<Rightarrow> 'a set \<Rightarrow> bool" where
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   123
  "subset \<equiv> less"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   124
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   125
abbreviation
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   126
  subset_eq :: "'a set \<Rightarrow> 'a set \<Rightarrow> bool" where
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   127
  "subset_eq \<equiv> less_eq"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   128
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   129
notation (output)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   130
  subset  ("op <") and
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   131
  subset  ("(_/ < _)" [50, 51] 50) and
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   132
  subset_eq  ("op <=") and
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   133
  subset_eq  ("(_/ <= _)" [50, 51] 50)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   134
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   135
notation (xsymbols)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   136
  subset  ("op \<subset>") and
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   137
  subset  ("(_/ \<subset> _)" [50, 51] 50) and
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   138
  subset_eq  ("op \<subseteq>") and
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   139
  subset_eq  ("(_/ \<subseteq> _)" [50, 51] 50)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   140
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   141
notation (HTML output)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   142
  subset  ("op \<subset>") and
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   143
  subset  ("(_/ \<subset> _)" [50, 51] 50) and
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   144
  subset_eq  ("op \<subseteq>") and
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   145
  subset_eq  ("(_/ \<subseteq> _)" [50, 51] 50)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   146
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   147
abbreviation (input)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   148
  supset :: "'a set \<Rightarrow> 'a set \<Rightarrow> bool" where
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   149
  "supset \<equiv> greater"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   150
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   151
abbreviation (input)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   152
  supset_eq :: "'a set \<Rightarrow> 'a set \<Rightarrow> bool" where
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   153
  "supset_eq \<equiv> greater_eq"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   154
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   155
notation (xsymbols)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   156
  supset  ("op \<supset>") and
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   157
  supset  ("(_/ \<supset> _)" [50, 51] 50) and
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   158
  supset_eq  ("op \<supseteq>") and
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   159
  supset_eq  ("(_/ \<supseteq> _)" [50, 51] 50)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   160
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
   161
global
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   162
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   163
consts
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   164
  Ball          :: "'a set => ('a => bool) => bool"      -- "bounded universal quantifiers"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   165
  Bex           :: "'a set => ('a => bool) => bool"      -- "bounded existential quantifiers"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   166
  Bex1          :: "'a set => ('a => bool) => bool"      -- "bounded unique existential quantifiers"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   167
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   168
local
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   169
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   170
defs
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   171
  Ball_def:     "Ball A P       == ALL x. x:A --> P(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
   172
  Bex_def:      "Bex A P        == EX x. x:A & P(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
   173
  Bex1_def:     "Bex1 A P       == EX! x. x:A & P(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
   174
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   175
syntax
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   176
  "_Ball"       :: "pttrn => 'a set => bool => bool"      ("(3ALL _:_./ _)" [0, 0, 10] 10)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   177
  "_Bex"        :: "pttrn => 'a set => bool => bool"      ("(3EX _:_./ _)" [0, 0, 10] 10)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   178
  "_Bex1"       :: "pttrn => 'a set => bool => bool"      ("(3EX! _:_./ _)" [0, 0, 10] 10)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   179
  "_Bleast"     :: "id => 'a set => bool => 'a"           ("(3LEAST _:_./ _)" [0, 0, 10] 10)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   180
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   181
syntax (HOL)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   182
  "_Ball"       :: "pttrn => 'a set => bool => bool"      ("(3! _:_./ _)" [0, 0, 10] 10)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   183
  "_Bex"        :: "pttrn => 'a set => bool => bool"      ("(3? _:_./ _)" [0, 0, 10] 10)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   184
  "_Bex1"       :: "pttrn => 'a set => bool => bool"      ("(3?! _:_./ _)" [0, 0, 10] 10)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   185
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   186
syntax (xsymbols)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   187
  "_Ball"       :: "pttrn => 'a set => bool => bool"      ("(3\<forall>_\<in>_./ _)" [0, 0, 10] 10)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   188
  "_Bex"        :: "pttrn => 'a set => bool => bool"      ("(3\<exists>_\<in>_./ _)" [0, 0, 10] 10)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   189
  "_Bex1"       :: "pttrn => 'a set => bool => bool"      ("(3\<exists>!_\<in>_./ _)" [0, 0, 10] 10)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   190
  "_Bleast"     :: "id => 'a set => bool => 'a"           ("(3LEAST_\<in>_./ _)" [0, 0, 10] 10)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   191
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   192
syntax (HTML output)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   193
  "_Ball"       :: "pttrn => 'a set => bool => bool"      ("(3\<forall>_\<in>_./ _)" [0, 0, 10] 10)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   194
  "_Bex"        :: "pttrn => 'a set => bool => bool"      ("(3\<exists>_\<in>_./ _)" [0, 0, 10] 10)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   195
  "_Bex1"       :: "pttrn => 'a set => bool => bool"      ("(3\<exists>!_\<in>_./ _)" [0, 0, 10] 10)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   196
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   197
translations
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   198
  "ALL x:A. P"  == "Ball A (%x. P)"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   199
  "EX x:A. P"   == "Bex A (%x. P)"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   200
  "EX! x:A. P"  == "Bex1 A (%x. P)"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   201
  "LEAST x:A. P" => "LEAST x. x:A & P"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   202
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
   203
syntax (output)
14804
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   204
  "_setlessAll" :: "[idt, 'a, bool] => bool"  ("(3ALL _<_./ _)"  [0, 0, 10] 10)
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   205
  "_setlessEx"  :: "[idt, 'a, bool] => bool"  ("(3EX _<_./ _)"  [0, 0, 10] 10)
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   206
  "_setleAll"   :: "[idt, 'a, bool] => bool"  ("(3ALL _<=_./ _)" [0, 0, 10] 10)
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   207
  "_setleEx"    :: "[idt, 'a, bool] => bool"  ("(3EX _<=_./ _)" [0, 0, 10] 10)
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19870
diff changeset
   208
  "_setleEx1"   :: "[idt, 'a, bool] => bool"  ("(3EX! _<=_./ _)" [0, 0, 10] 10)
14804
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   209
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   210
syntax (xsymbols)
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   211
  "_setlessAll" :: "[idt, 'a, bool] => bool"   ("(3\<forall>_\<subset>_./ _)"  [0, 0, 10] 10)
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   212
  "_setlessEx"  :: "[idt, 'a, bool] => bool"   ("(3\<exists>_\<subset>_./ _)"  [0, 0, 10] 10)
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   213
  "_setleAll"   :: "[idt, 'a, bool] => bool"   ("(3\<forall>_\<subseteq>_./ _)" [0, 0, 10] 10)
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   214
  "_setleEx"    :: "[idt, 'a, bool] => bool"   ("(3\<exists>_\<subseteq>_./ _)" [0, 0, 10] 10)
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19870
diff changeset
   215
  "_setleEx1"   :: "[idt, 'a, bool] => bool"   ("(3\<exists>!_\<subseteq>_./ _)" [0, 0, 10] 10)
14804
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   216
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
   217
syntax (HOL output)
14804
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   218
  "_setlessAll" :: "[idt, 'a, bool] => bool"   ("(3! _<_./ _)"  [0, 0, 10] 10)
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   219
  "_setlessEx"  :: "[idt, 'a, bool] => bool"   ("(3? _<_./ _)"  [0, 0, 10] 10)
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   220
  "_setleAll"   :: "[idt, 'a, bool] => bool"   ("(3! _<=_./ _)" [0, 0, 10] 10)
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   221
  "_setleEx"    :: "[idt, 'a, bool] => bool"   ("(3? _<=_./ _)" [0, 0, 10] 10)
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19870
diff changeset
   222
  "_setleEx1"   :: "[idt, 'a, bool] => bool"   ("(3?! _<=_./ _)" [0, 0, 10] 10)
14804
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   223
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   224
syntax (HTML output)
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   225
  "_setlessAll" :: "[idt, 'a, bool] => bool"   ("(3\<forall>_\<subset>_./ _)"  [0, 0, 10] 10)
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   226
  "_setlessEx"  :: "[idt, 'a, bool] => bool"   ("(3\<exists>_\<subset>_./ _)"  [0, 0, 10] 10)
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   227
  "_setleAll"   :: "[idt, 'a, bool] => bool"   ("(3\<forall>_\<subseteq>_./ _)" [0, 0, 10] 10)
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   228
  "_setleEx"    :: "[idt, 'a, bool] => bool"   ("(3\<exists>_\<subseteq>_./ _)" [0, 0, 10] 10)
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19870
diff changeset
   229
  "_setleEx1"   :: "[idt, 'a, bool] => bool"   ("(3\<exists>!_\<subseteq>_./ _)" [0, 0, 10] 10)
14804
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   230
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   231
translations
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   232
 "\<forall>A\<subset>B. P"   =>  "ALL A. A \<subset> B --> P"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   233
 "\<exists>A\<subset>B. P"   =>  "EX A. A \<subset> B & P"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   234
 "\<forall>A\<subseteq>B. P"   =>  "ALL A. A \<subseteq> B --> P"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   235
 "\<exists>A\<subseteq>B. P"   =>  "EX A. A \<subseteq> B & P"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   236
 "\<exists>!A\<subseteq>B. P"  =>  "EX! A. A \<subseteq> B & P"
14804
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   237
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   238
print_translation {*
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   239
let
22377
61610b1beedf tuned ML setup;
wenzelm
parents: 22172
diff changeset
   240
  val Type (set_type, _) = @{typ "'a set"};
61610b1beedf tuned ML setup;
wenzelm
parents: 22172
diff changeset
   241
  val All_binder = Syntax.binder_name @{const_syntax "All"};
61610b1beedf tuned ML setup;
wenzelm
parents: 22172
diff changeset
   242
  val Ex_binder = Syntax.binder_name @{const_syntax "Ex"};
61610b1beedf tuned ML setup;
wenzelm
parents: 22172
diff changeset
   243
  val impl = @{const_syntax "op -->"};
61610b1beedf tuned ML setup;
wenzelm
parents: 22172
diff changeset
   244
  val conj = @{const_syntax "op &"};
61610b1beedf tuned ML setup;
wenzelm
parents: 22172
diff changeset
   245
  val sbset = @{const_syntax "subset"};
61610b1beedf tuned ML setup;
wenzelm
parents: 22172
diff changeset
   246
  val sbset_eq = @{const_syntax "subset_eq"};
21819
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   247
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   248
  val trans =
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   249
   [((All_binder, impl, sbset), "_setlessAll"),
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   250
    ((All_binder, impl, sbset_eq), "_setleAll"),
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   251
    ((Ex_binder, conj, sbset), "_setlessEx"),
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   252
    ((Ex_binder, conj, sbset_eq), "_setleEx")];
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   253
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   254
  fun mk v v' c n P =
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   255
    if v = v' andalso not (Term.exists_subterm (fn Free (x, _) => x = v | _ => false) n)
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   256
    then Syntax.const c $ Syntax.mark_bound v' $ n $ P else raise Match;
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   257
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   258
  fun tr' q = (q,
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   259
    fn [Const ("_bound", _) $ Free (v, Type (T, _)), Const (c, _) $ (Const (d, _) $ (Const ("_bound", _) $ Free (v', _)) $ n) $ P] =>
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   260
         if T = (set_type) then case AList.lookup (op =) trans (q, c, d)
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   261
          of NONE => raise Match
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   262
           | SOME l => mk v v' l n P
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   263
         else raise Match
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   264
     | _ => raise Match);
14804
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   265
in
21819
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   266
  [tr' All_binder, tr' Ex_binder]
14804
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   267
end
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   268
*}
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   269
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   270
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   271
text {*
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   272
  \medskip Translate between @{text "{e | x1...xn. P}"} and @{text
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   273
  "{u. EX x1..xn. u = e & P}"}; @{text "{y. EX x1..xn. y = e & P}"} is
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   274
  only translated if @{text "[0..n] subset bvs(e)"}.
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   275
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   276
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   277
parse_translation {*
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   278
  let
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   279
    val ex_tr = snd (mk_binder_tr ("EX ", "Ex"));
3947
eb707467f8c5 adapted to qualified names;
wenzelm
parents: 3842
diff changeset
   280
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   281
    fun nvars (Const ("_idts", _) $ _ $ idts) = nvars idts + 1
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   282
      | nvars _ = 1;
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   283
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   284
    fun setcompr_tr [e, idts, b] =
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   285
      let
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   286
        val eq = Syntax.const "op =" $ Bound (nvars idts) $ e;
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   287
        val P = Syntax.const "op &" $ eq $ b;
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   288
        val exP = ex_tr [idts, P];
17784
5cbb52f2c478 Term.absdummy;
wenzelm
parents: 17715
diff changeset
   289
      in Syntax.const "Collect" $ Term.absdummy (dummyT, exP) end;
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   290
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   291
  in [("@SetCompr", setcompr_tr)] end;
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   292
*}
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   293
32120
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   294
print_translation {* [
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   295
Syntax.preserve_binder_abs2_tr' @{const_syntax Ball} "_Ball",
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   296
Syntax.preserve_binder_abs2_tr' @{const_syntax Bex} "_Bex"
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
   297
] *} -- {* to avoid eta-contraction of body *}
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   298
13763
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   299
print_translation {*
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   300
let
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   301
  val ex_tr' = snd (mk_binder_tr' ("Ex", "DUMMY"));
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   302
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   303
  fun setcompr_tr' [Abs (abs as (_, _, P))] =
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   304
    let
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   305
      fun check (Const ("Ex", _) $ Abs (_, _, P), n) = check (P, n + 1)
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   306
        | check (Const ("op &", _) $ (Const ("op =", _) $ Bound m $ e) $ P, n) =
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   307
            n > 0 andalso m = n andalso not (loose_bvar1 (P, n)) andalso
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   308
            ((0 upto (n - 1)) subset add_loose_bnos (e, 0, []))
13764
3e180bf68496 removed some problems with print translations
nipkow
parents: 13763
diff changeset
   309
        | check _ = false
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   310
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   311
        fun tr' (_ $ abs) =
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   312
          let val _ $ idts $ (_ $ (_ $ _ $ e) $ Q) = ex_tr' [abs]
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   313
          in Syntax.const "@SetCompr" $ e $ idts $ Q end;
13763
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   314
    in if check (P, 0) then tr' P
15535
nipkow
parents: 15524
diff changeset
   315
       else let val (x as _ $ Free(xN,_), t) = atomic_abs_tr' abs
nipkow
parents: 15524
diff changeset
   316
                val M = Syntax.const "@Coll" $ x $ t
nipkow
parents: 15524
diff changeset
   317
            in case t of
nipkow
parents: 15524
diff changeset
   318
                 Const("op &",_)
nipkow
parents: 15524
diff changeset
   319
                   $ (Const("op :",_) $ (Const("_bound",_) $ Free(yN,_)) $ A)
nipkow
parents: 15524
diff changeset
   320
                   $ P =>
nipkow
parents: 15524
diff changeset
   321
                   if xN=yN then Syntax.const "@Collect" $ x $ A $ P else M
nipkow
parents: 15524
diff changeset
   322
               | _ => M
nipkow
parents: 15524
diff changeset
   323
            end
13763
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   324
    end;
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   325
  in [("Collect", setcompr_tr')] end;
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   326
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   327
32117
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   328
setup {*
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   329
let
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   330
  val unfold_bex_tac = unfold_tac @{thms "Bex_def"};
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   331
  fun prove_bex_tac ss = unfold_bex_tac ss THEN Quantifier1.prove_one_point_ex_tac;
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   332
  val rearrange_bex = Quantifier1.rearrange_bex prove_bex_tac;
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   333
  val unfold_ball_tac = unfold_tac @{thms "Ball_def"};
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   334
  fun prove_ball_tac ss = unfold_ball_tac ss THEN Quantifier1.prove_one_point_all_tac;
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   335
  val rearrange_ball = Quantifier1.rearrange_ball prove_ball_tac;
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   336
  val defBEX_regroup = Simplifier.simproc @{theory}
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   337
    "defined BEX" ["EX x:A. P x & Q x"] rearrange_bex;
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   338
  val defBALL_regroup = Simplifier.simproc @{theory}
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   339
    "defined BALL" ["ALL x:A. P x --> Q x"] rearrange_ball;
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   340
in
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   341
  Simplifier.map_simpset (fn ss => ss addsimprocs [defBALL_regroup, defBEX_regroup])
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   342
end
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   343
*}
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   344
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   345
lemma ballI [intro!]: "(!!x. x:A ==> P x) ==> ALL x:A. P x"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   346
  by (simp add: Ball_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   347
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   348
lemmas strip = impI allI ballI
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   349
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   350
lemma bspec [dest?]: "ALL x:A. P x ==> x:A ==> P x"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   351
  by (simp add: Ball_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   352
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   353
text {*
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   354
  Gives better instantiation for bound:
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   355
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   356
26339
7825c83c9eff eliminated change_claset/simpset;
wenzelm
parents: 26150
diff changeset
   357
declaration {* fn _ =>
7825c83c9eff eliminated change_claset/simpset;
wenzelm
parents: 26150
diff changeset
   358
  Classical.map_cs (fn cs => cs addbefore ("bspec", datac @{thm bspec} 1))
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   359
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   360
32117
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   361
ML {*
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   362
structure Simpdata =
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   363
struct
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   364
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   365
open Simpdata;
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   366
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   367
val mksimps_pairs = [(@{const_name Ball}, @{thms bspec})] @ mksimps_pairs;
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   368
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   369
end;
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   370
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   371
open Simpdata;
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   372
*}
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   373
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   374
declaration {* fn _ =>
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   375
  Simplifier.map_ss (fn ss => ss setmksimps (mksimps mksimps_pairs))
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   376
*}
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   377
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   378
lemma ballE [elim]: "ALL x:A. P x ==> (P x ==> Q) ==> (x ~: A ==> Q) ==> Q"
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   379
  by (unfold Ball_def) blast
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   380
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   381
lemma bexI [intro]: "P x ==> x:A ==> EX x:A. P x"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   382
  -- {* Normally the best argument order: @{prop "P x"} constrains the
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   383
    choice of @{prop "x:A"}. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   384
  by (unfold Bex_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   385
13113
5eb9be7b72a5 rev_bexI [intro?];
wenzelm
parents: 13103
diff changeset
   386
lemma rev_bexI [intro?]: "x:A ==> P x ==> EX x:A. P x"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   387
  -- {* The best argument order when there is only one @{prop "x:A"}. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   388
  by (unfold Bex_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   389
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   390
lemma bexCI: "(ALL x:A. ~P x ==> P a) ==> a:A ==> EX x:A. P x"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   391
  by (unfold Bex_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   392
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   393
lemma bexE [elim!]: "EX x:A. P x ==> (!!x. x:A ==> P x ==> Q) ==> Q"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   394
  by (unfold Bex_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   395
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   396
lemma ball_triv [simp]: "(ALL x:A. P) = ((EX x. x:A) --> P)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   397
  -- {* Trival rewrite rule. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   398
  by (simp add: Ball_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   399
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   400
lemma bex_triv [simp]: "(EX x:A. P) = ((EX x. x:A) & P)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   401
  -- {* Dual form for existentials. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   402
  by (simp add: Bex_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   403
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   404
lemma bex_triv_one_point1 [simp]: "(EX x:A. x = a) = (a:A)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   405
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   406
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   407
lemma bex_triv_one_point2 [simp]: "(EX x:A. a = x) = (a:A)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   408
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   409
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   410
lemma bex_one_point1 [simp]: "(EX x:A. x = a & P x) = (a:A & P a)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   411
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   412
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   413
lemma bex_one_point2 [simp]: "(EX x:A. a = x & P x) = (a:A & P a)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   414
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   415
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   416
lemma ball_one_point1 [simp]: "(ALL x:A. x = a --> P x) = (a:A --> P a)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   417
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   418
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   419
lemma ball_one_point2 [simp]: "(ALL x:A. a = x --> P x) = (a:A --> P a)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   420
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   421
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   422
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   423
text {* Congruence rules *}
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   424
16636
1ed737a98198 Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents: 15950
diff changeset
   425
lemma ball_cong:
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   426
  "A = B ==> (!!x. x:B ==> P x = Q x) ==>
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   427
    (ALL x:A. P x) = (ALL x:B. Q x)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   428
  by (simp add: Ball_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   429
16636
1ed737a98198 Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents: 15950
diff changeset
   430
lemma strong_ball_cong [cong]:
1ed737a98198 Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents: 15950
diff changeset
   431
  "A = B ==> (!!x. x:B =simp=> P x = Q x) ==>
1ed737a98198 Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents: 15950
diff changeset
   432
    (ALL x:A. P x) = (ALL x:B. Q x)"
1ed737a98198 Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents: 15950
diff changeset
   433
  by (simp add: simp_implies_def Ball_def)
1ed737a98198 Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents: 15950
diff changeset
   434
1ed737a98198 Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents: 15950
diff changeset
   435
lemma bex_cong:
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   436
  "A = B ==> (!!x. x:B ==> P x = Q x) ==>
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   437
    (EX x:A. P x) = (EX x:B. Q x)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   438
  by (simp add: Bex_def cong: conj_cong)
1273
6960ec882bca added 8bit pragmas
regensbu
parents: 1068
diff changeset
   439
16636
1ed737a98198 Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents: 15950
diff changeset
   440
lemma strong_bex_cong [cong]:
1ed737a98198 Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents: 15950
diff changeset
   441
  "A = B ==> (!!x. x:B =simp=> P x = Q x) ==>
1ed737a98198 Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents: 15950
diff changeset
   442
    (EX x:A. P x) = (EX x:B. Q x)"
1ed737a98198 Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents: 15950
diff changeset
   443
  by (simp add: simp_implies_def Bex_def cong: conj_cong)
1ed737a98198 Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents: 15950
diff changeset
   444
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   445
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   446
subsection {* Basic operations *}
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   447
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   448
subsubsection {* Subsets *}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   449
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   450
lemma subsetI [atp,intro!]: "(!!x. x:A ==> x:B) ==> A \<subseteq> B"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   451
  by (auto simp add: mem_def intro: predicate1I)
30352
047f183c43b0 restructured theory Set.thy
haftmann
parents: 30304
diff changeset
   452
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   453
text {*
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   454
  \medskip Map the type @{text "'a set => anything"} to just @{typ
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   455
  'a}; for overloading constants whose first argument has type @{typ
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   456
  "'a set"}.
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   457
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   458
30596
140b22f22071 tuned some theorem and attribute bindings
haftmann
parents: 30531
diff changeset
   459
lemma subsetD [elim, intro?]: "A \<subseteq> B ==> c \<in> A ==> c \<in> B"
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   460
  -- {* Rule in Modus Ponens style. *}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   461
  by (unfold mem_def) blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   462
30596
140b22f22071 tuned some theorem and attribute bindings
haftmann
parents: 30531
diff changeset
   463
lemma rev_subsetD [intro?]: "c \<in> A ==> A \<subseteq> B ==> c \<in> B"
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   464
  -- {* The same, with reversed premises for use with @{text erule} --
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   465
      cf @{text rev_mp}. *}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   466
  by (rule subsetD)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   467
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   468
text {*
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   469
  \medskip Converts @{prop "A \<subseteq> B"} to @{prop "x \<in> A ==> x \<in> B"}.
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   470
*}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   471
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   472
lemma subsetCE [elim]: "A \<subseteq>  B ==> (c \<notin> A ==> P) ==> (c \<in> B ==> P) ==> P"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   473
  -- {* Classical elimination rule. *}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   474
  by (unfold mem_def) blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   475
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   476
lemma subset_eq: "A \<le> B = (\<forall>x\<in>A. x \<in> B)" by blast
2388
d1f0505fc602 added set inclusion symbol syntax;
wenzelm
parents: 2372
diff changeset
   477
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   478
lemma contra_subsetD: "A \<subseteq> B ==> c \<notin> B ==> c \<notin> A"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   479
  by blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   480
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   481
lemma subset_refl [simp,atp]: "A \<subseteq> A"
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   482
  by (fact order_refl)
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   483
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   484
lemma subset_trans: "A \<subseteq> B ==> B \<subseteq> C ==> A \<subseteq> C"
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   485
  by (fact order_trans)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   486
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   487
lemma set_rev_mp: "x:A ==> A \<subseteq> B ==> x:B"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   488
  by (rule subsetD)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   489
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   490
lemma set_mp: "A \<subseteq> B ==> x:A ==> x:B"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   491
  by (rule subsetD)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   492
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   493
lemmas basic_trans_rules [trans] =
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   494
  order_trans_rules set_rev_mp set_mp
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   495
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   496
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   497
subsubsection {* Equality *}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   498
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   499
lemma set_ext: assumes prem: "(!!x. (x:A) = (x:B))" shows "A = B"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   500
  apply (rule prem [THEN ext, THEN arg_cong, THEN box_equals])
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   501
   apply (rule Collect_mem_eq)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   502
  apply (rule Collect_mem_eq)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   503
  done
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   504
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   505
(* Due to Brian Huffman *)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   506
lemma expand_set_eq: "(A = B) = (ALL x. (x:A) = (x:B))"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   507
by(auto intro:set_ext)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   508
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   509
lemma subset_antisym [intro!]: "A \<subseteq> B ==> B \<subseteq> A ==> A = B"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   510
  -- {* Anti-symmetry of the subset relation. *}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   511
  by (iprover intro: set_ext subsetD)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   512
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   513
text {*
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   514
  \medskip Equality rules from ZF set theory -- are they appropriate
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   515
  here?
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   516
*}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   517
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   518
lemma equalityD1: "A = B ==> A \<subseteq> B"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   519
  by (simp add: subset_refl)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   520
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   521
lemma equalityD2: "A = B ==> B \<subseteq> A"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   522
  by (simp add: subset_refl)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   523
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   524
text {*
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   525
  \medskip Be careful when adding this to the claset as @{text
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   526
  subset_empty} is in the simpset: @{prop "A = {}"} goes to @{prop "{}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   527
  \<subseteq> A"} and @{prop "A \<subseteq> {}"} and then back to @{prop "A = {}"}!
30352
047f183c43b0 restructured theory Set.thy
haftmann
parents: 30304
diff changeset
   528
*}
047f183c43b0 restructured theory Set.thy
haftmann
parents: 30304
diff changeset
   529
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   530
lemma equalityE: "A = B ==> (A \<subseteq> B ==> B \<subseteq> A ==> P) ==> P"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   531
  by (simp add: subset_refl)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   532
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   533
lemma equalityCE [elim]:
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   534
    "A = B ==> (c \<in> A ==> c \<in> B ==> P) ==> (c \<notin> A ==> c \<notin> B ==> P) ==> P"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   535
  by blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   536
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   537
lemma eqset_imp_iff: "A = B ==> (x : A) = (x : B)"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   538
  by simp
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   539
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   540
lemma eqelem_imp_iff: "x = y ==> (x : A) = (y : A)"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   541
  by simp
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   542
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   543
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   544
subsubsection {* The universal set -- UNIV *}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   545
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   546
definition UNIV :: "'a set" where
32117
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   547
  "UNIV = {x. True}"
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   548
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   549
lemma UNIV_I [simp]: "x : UNIV"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   550
  by (simp add: UNIV_def)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   551
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   552
declare UNIV_I [intro]  -- {* unsafe makes it less likely to cause problems *}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   553
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   554
lemma UNIV_witness [intro?]: "EX x. x : UNIV"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   555
  by simp
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   556
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   557
lemma subset_UNIV [simp]: "A \<subseteq> UNIV"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   558
  by (rule subsetI) (rule UNIV_I)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   559
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   560
lemma top_set_eq: "top = UNIV"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   561
  by (iprover intro!: subset_antisym subset_UNIV top_greatest)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   562
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   563
text {*
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   564
  \medskip Eta-contracting these two rules (to remove @{text P})
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   565
  causes them to be ignored because of their interaction with
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   566
  congruence rules.
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   567
*}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   568
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   569
lemma ball_UNIV [simp]: "Ball UNIV P = All P"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   570
  by (simp add: Ball_def)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   571
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   572
lemma bex_UNIV [simp]: "Bex UNIV P = Ex P"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   573
  by (simp add: Bex_def)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   574
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   575
lemma UNIV_eq_I: "(\<And>x. x \<in> A) \<Longrightarrow> UNIV = A"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   576
  by auto
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   577
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   578
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   579
subsubsection {* The empty set *}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   580
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   581
lemma empty_iff [simp]: "(c : {}) = False"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   582
  by (simp add: empty_def)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   583
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   584
lemma emptyE [elim!]: "a : {} ==> P"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   585
  by simp
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   586
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   587
lemma empty_subsetI [iff]: "{} \<subseteq> A"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   588
    -- {* One effect is to delete the ASSUMPTION @{prop "{} <= A"} *}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   589
  by blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   590
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   591
lemma bot_set_eq: "bot = {}"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   592
  by (iprover intro!: subset_antisym empty_subsetI bot_least)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   593
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   594
lemma equals0I: "(!!y. y \<in> A ==> False) ==> A = {}"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   595
  by blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   596
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   597
lemma equals0D: "A = {} ==> a \<notin> A"
32082
90d03908b3d7 less digestible
haftmann
parents: 32081
diff changeset
   598
    -- {* Use for reasoning about disjointness: @{text "A Int B = {}"} *}
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   599
  by blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   600
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   601
lemma ball_empty [simp]: "Ball {} P = True"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   602
  by (simp add: Ball_def)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   603
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   604
lemma bex_empty [simp]: "Bex {} P = False"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   605
  by (simp add: Bex_def)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   606
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   607
lemma UNIV_not_empty [iff]: "UNIV ~= {}"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   608
  by (blast elim: equalityE)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   609
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   610
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   611
subsubsection {* The Powerset operator -- Pow *}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   612
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
   613
definition Pow :: "'a set => 'a set set" where
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   614
  Pow_def: "Pow A = {B. 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
   615
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   616
lemma Pow_iff [iff]: "(A \<in> Pow B) = (A \<subseteq> B)"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   617
  by (simp add: Pow_def)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   618
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   619
lemma PowI: "A \<subseteq> B ==> A \<in> Pow B"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   620
  by (simp add: Pow_def)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   621
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   622
lemma PowD: "A \<in> Pow B ==> A \<subseteq> B"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   623
  by (simp add: Pow_def)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   624
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   625
lemma Pow_bottom: "{} \<in> Pow B"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   626
  by simp
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   627
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   628
lemma Pow_top: "A \<in> Pow A"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   629
  by (simp add: subset_refl)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   630
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   631
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   632
subsubsection {* Set complement *}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   633
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   634
lemma Compl_iff [simp]: "(c \<in> -A) = (c \<notin> A)"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   635
  by (simp add: mem_def fun_Compl_def bool_Compl_def)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   636
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   637
lemma ComplI [intro!]: "(c \<in> A ==> False) ==> c \<in> -A"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   638
  by (unfold mem_def fun_Compl_def bool_Compl_def) blast
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   639
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   640
text {*
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   641
  \medskip This form, with negated conclusion, works well with the
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   642
  Classical prover.  Negated assumptions behave like formulae on the
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   643
  right side of the notional turnstile ... *}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   644
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   645
lemma ComplD [dest!]: "c : -A ==> c~:A"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   646
  by (simp add: mem_def fun_Compl_def bool_Compl_def)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   647
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   648
lemmas ComplE = ComplD [elim_format]
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   649
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   650
lemma Compl_eq: "- A = {x. ~ x : A}" by blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   651
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   652
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   653
subsubsection {* Binary union -- Un *}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   654
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   655
definition Un :: "'a set \<Rightarrow> 'a set \<Rightarrow> 'a set" (infixl "Un" 65) where
32117
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   656
  "A Un B = {x. x \<in> A \<or> x \<in> B}"
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   657
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   658
notation (xsymbols)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   659
  "Un"  (infixl "\<union>" 65)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   660
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   661
notation (HTML output)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   662
  "Un"  (infixl "\<union>" 65)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   663
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   664
lemma sup_set_eq: "sup A B = A \<union> B"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   665
  by (simp add: sup_fun_eq sup_bool_eq Un_def Collect_def mem_def)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   666
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   667
lemma Un_iff [simp]: "(c : A Un B) = (c:A | c:B)"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   668
  by (unfold Un_def) blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   669
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   670
lemma UnI1 [elim?]: "c:A ==> c : A Un B"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   671
  by simp
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   672
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   673
lemma UnI2 [elim?]: "c:B ==> c : A Un B"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   674
  by simp
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   675
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   676
text {*
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   677
  \medskip Classical introduction rule: no commitment to @{prop A} vs
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   678
  @{prop B}.
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   679
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   680
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   681
lemma UnCI [intro!]: "(c~:B ==> c:A) ==> c : A Un B"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   682
  by auto
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   683
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   684
lemma UnE [elim!]: "c : A Un B ==> (c:A ==> P) ==> (c:B ==> P) ==> P"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   685
  by (unfold Un_def) blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   686
32117
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   687
lemma insert_def: "insert a B = {x. x = a} \<union> B"
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   688
  by (simp add: Collect_def mem_def insert_compr Un_def)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   689
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   690
lemma mono_Un: "mono f \<Longrightarrow> f A \<union> f B \<subseteq> f (A \<union> B)"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   691
  apply (fold sup_set_eq)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   692
  apply (erule mono_sup)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   693
  done
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   694
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   695
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   696
subsubsection {* Binary intersection -- Int *}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   697
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   698
definition Int :: "'a set \<Rightarrow> 'a set \<Rightarrow> 'a set" (infixl "Int" 70) where
32117
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   699
  "A Int B = {x. x \<in> A \<and> x \<in> B}"
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   700
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   701
notation (xsymbols)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   702
  "Int"  (infixl "\<inter>" 70)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   703
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   704
notation (HTML output)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   705
  "Int"  (infixl "\<inter>" 70)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   706
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   707
lemma inf_set_eq: "inf A B = A \<inter> B"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   708
  by (simp add: inf_fun_eq inf_bool_eq Int_def Collect_def mem_def)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   709
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   710
lemma Int_iff [simp]: "(c : A Int B) = (c:A & c:B)"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   711
  by (unfold Int_def) blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   712
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   713
lemma IntI [intro!]: "c:A ==> c:B ==> c : A Int B"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   714
  by simp
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   715
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   716
lemma IntD1: "c : A Int B ==> c:A"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   717
  by simp
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   718
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   719
lemma IntD2: "c : A Int B ==> c:B"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   720
  by simp
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   721
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   722
lemma IntE [elim!]: "c : A Int B ==> (c:A ==> c:B ==> P) ==> P"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   723
  by simp
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   724
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   725
lemma mono_Int: "mono f \<Longrightarrow> f (A \<inter> B) \<subseteq> f A \<inter> f B"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   726
  apply (fold inf_set_eq)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   727
  apply (erule mono_inf)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   728
  done
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   729
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   730
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   731
subsubsection {* Set difference *}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   732
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   733
lemma Diff_iff [simp]: "(c : A - B) = (c:A & c~:B)"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   734
  by (simp add: mem_def fun_diff_def bool_diff_def)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   735
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   736
lemma DiffI [intro!]: "c : A ==> c ~: B ==> c : A - B"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   737
  by simp
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   738
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   739
lemma DiffD1: "c : A - B ==> c : A"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   740
  by simp
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   741
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   742
lemma DiffD2: "c : A - B ==> c : B ==> P"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   743
  by simp
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   744
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   745
lemma DiffE [elim!]: "c : A - B ==> (c:A ==> c~:B ==> P) ==> P"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   746
  by simp
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   747
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   748
lemma set_diff_eq: "A - B = {x. x : A & ~ x : B}" by blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   749
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   750
lemma Compl_eq_Diff_UNIV: "-A = (UNIV - A)"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   751
by blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   752
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   753
31456
55edadbd43d5 insert now qualified and with authentic syntax
haftmann
parents: 31197
diff changeset
   754
subsubsection {* Augmenting a set -- @{const insert} *}
30531
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   755
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   756
lemma insert_iff [simp]: "(a : insert b A) = (a = b | a:A)"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   757
  by (unfold insert_def) blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   758
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   759
lemma insertI1: "a : insert a B"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   760
  by simp
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   761
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   762
lemma insertI2: "a : B ==> a : insert b B"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   763
  by simp
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   764
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   765
lemma insertE [elim!]: "a : insert b A ==> (a = b ==> P) ==> (a:A ==> P) ==> P"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   766
  by (unfold insert_def) blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   767
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   768
lemma insertCI [intro!]: "(a~:B ==> a = b) ==> a: insert b B"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   769
  -- {* Classical introduction rule. *}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   770
  by auto
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   771
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   772
lemma subset_insert_iff: "(A \<subseteq> insert x B) = (if x:A then A - {x} \<subseteq> B else A \<subseteq> B)"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   773
  by auto
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   774
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   775
lemma set_insert:
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   776
  assumes "x \<in> A"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   777
  obtains B where "A = insert x B" and "x \<notin> B"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   778
proof
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   779
  from assms show "A = insert x (A - {x})" by blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   780
next
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   781
  show "x \<notin> A - {x}" by blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   782
qed
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   783
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   784
lemma insert_ident: "x ~: A ==> x ~: B ==> (insert x A = insert x B) = (A = B)"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   785
by auto
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   786
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   787
subsubsection {* Singletons, using insert *}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   788
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   789
lemma singletonI [intro!,noatp]: "a : {a}"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   790
    -- {* Redundant? But unlike @{text insertCI}, it proves the subgoal immediately! *}
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   791
  by (rule insertI1)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   792
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   793
lemma singletonD [dest!,noatp]: "b : {a} ==> b = a"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   794
  by blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   795
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   796
lemmas singletonE = singletonD [elim_format]
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   797
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   798
lemma singleton_iff: "(b : {a}) = (b = a)"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   799
  by blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   800
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   801
lemma singleton_inject [dest!]: "{a} = {b} ==> a = b"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   802
  by blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   803
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   804
lemma singleton_insert_inj_eq [iff,noatp]:
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   805
     "({b} = insert a A) = (a = b & A \<subseteq> {b})"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   806
  by blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   807
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   808
lemma singleton_insert_inj_eq' [iff,noatp]:
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   809
     "(insert a A = {b}) = (a = b & A \<subseteq> {b})"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   810
  by blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   811
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   812
lemma subset_singletonD: "A \<subseteq> {x} ==> A = {} | A = {x}"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   813
  by fast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   814
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   815
lemma singleton_conv [simp]: "{x. x = a} = {a}"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   816
  by blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   817
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   818
lemma singleton_conv2 [simp]: "{x. a = x} = {a}"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   819
  by blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   820
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   821
lemma diff_single_insert: "A - {x} \<subseteq> B ==> x \<in> A ==> A \<subseteq> insert x B"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   822
  by blast
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   823
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   824
lemma doubleton_eq_iff: "({a,b} = {c,d}) = (a=c & b=d | a=d & b=c)"
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   825
  by (blast elim: equalityE)
ab3d61baf66a reverted to old version of Set.thy -- strange effects have to be traced first
haftmann
parents: 30352
diff changeset
   826
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   827
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
   828
subsubsection {* Image of a set under a function *}
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   829
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   830
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
   831
  Frequently @{term b} does not have the syntactic form of @{term "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
   832
*}
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   833
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   834
definition image :: "('a => 'b) => 'a set => 'b set" (infixr "`" 90) where
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   835
  image_def [noatp]: "f ` A = {y. EX x: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
   836
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   837
abbreviation
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   838
  range :: "('a => 'b) => 'b set" where -- "of function"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   839
  "range f == f ` UNIV"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   840
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   841
lemma image_eqI [simp, intro]: "b = f x ==> x:A ==> b : f`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
   842
  by (unfold image_def) 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
   843
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   844
lemma imageI: "x : A ==> f x : f ` 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
   845
  by (rule image_eqI) (rule refl)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   846
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   847
lemma rev_image_eqI: "x:A ==> b = f x ==> b : f`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
   848
  -- {* This version's more effective when we already have 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
   849
    required @{term 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
   850
  by (unfold image_def) 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
   851
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   852
lemma imageE [elim!]:
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   853
  "b : (%x. f x)`A ==> (!!x. b = f x ==> x:A ==> P) ==> P"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   854
  -- {* The eta-expansion gives variable-name preservation. *}
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   855
  by (unfold image_def) 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
   856
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   857
lemma image_Un: "f`(A Un B) = f`A Un f`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
   858
  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
   859
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   860
lemma image_iff: "(z : f`A) = (EX x:A. z = 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
   861
  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
   862
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   863
lemma image_subset_iff: "(f`A \<subseteq> B) = (\<forall>x\<in>A. f x \<in> 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
   864
  -- {* This rewrite rule would confuse users if made default. *}
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   865
  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
   866
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   867
lemma subset_image_iff: "(B \<subseteq> f`A) = (EX AA. AA \<subseteq> A & B = f`AA)"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   868
  apply safe
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   869
   prefer 2 apply fast
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   870
  apply (rule_tac x = "{a. a : A & f a : B}" in exI, fast)
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   871
  done
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   872
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   873
lemma image_subsetI: "(!!x. x \<in> A ==> f x \<in> B) ==> f`A \<subseteq> 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
   874
  -- {* Replaces the three steps @{text subsetI}, @{text imageE},
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   875
    @{text hypsubst}, but breaks too many existing proofs. *}
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   876
  by blast
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   877
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   878
text {*
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
   879
  \medskip Range of a function -- just a translation for image!
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   880
*}
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   881
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   882
lemma range_eqI: "b = f x ==> b \<in> range f"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   883
  by 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
   884
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   885
lemma rangeI: "f x \<in> range f"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   886
  by 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
   887
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   888
lemma rangeE [elim?]: "b \<in> range (\<lambda>x. f x) ==> (!!x. b = f x ==> P) ==> P"
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   889
  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
   890
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   891
32117
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   892
subsubsection {* Some rules with @{text "if"} *}
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   893
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   894
text{* Elimination of @{text"{x. \<dots> & x=t & \<dots>}"}. *}
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   895
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   896
lemma Collect_conv_if: "{x. x=a & P x} = (if P a then {a} else {})"
32117
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   897
  by auto
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   898
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   899
lemma Collect_conv_if2: "{x. a=x & P x} = (if P a then {a} else {})"
32117
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
   900
  by auto
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   901
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   902
text {*
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   903
  Rewrite rules for boolean case-splitting: faster than @{text
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   904
  "split_if [split]"}.
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   905
*}
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   906
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   907
lemma split_if_eq1: "((if Q then x else y) = b) = ((Q --> x = b) & (~ Q --> y = b))"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   908
  by (rule split_if)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   909
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   910
lemma split_if_eq2: "(a = (if Q then x else y)) = ((Q --> a = x) & (~ Q --> a = y))"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   911
  by (rule split_if)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   912
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   913
text {*
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   914
  Split ifs on either side of the membership relation.  Not for @{text
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   915
  "[simp]"} -- can cause goals to blow up!
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   916
*}
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   917
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   918
lemma split_if_mem1: "((if Q then x else y) : b) = ((Q --> x : b) & (~ Q --> y : b))"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   919
  by (rule split_if)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   920
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   921
lemma split_if_mem2: "(a : (if Q then x else y)) = ((Q --> a : x) & (~ Q --> a : y))"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   922
  by (rule split_if [where P="%S. a : S"])
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   923
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   924
lemmas split_ifs = if_bool_eq_conj split_if_eq1 split_if_eq2 split_if_mem1 split_if_mem2
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   925
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   926
(*Would like to add these, but the existing code only searches for the
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   927
  outer-level constant, which in this case is just "op :"; we instead need
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   928
  to use term-nets to associate patterns with rules.  Also, if a rule fails to
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   929
  apply, then the formula should be kept.
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   930
  [("HOL.uminus", Compl_iff RS iffD1), ("HOL.minus", [Diff_iff RS iffD1]),
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   931
   ("Int", [IntD1,IntD2]),
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   932
   ("Collect", [CollectD]), ("Inter", [InterD]), ("INTER", [INT_D])]
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   933
 *)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   934
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
   935
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
   936
subsection {* Complete lattices *}
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   937
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   938
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
   939
  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
   940
  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
   941
  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
   942
  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
   943
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   944
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
   945
  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
   946
    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
   947
  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
   948
     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
   949
  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
   950
     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
   951
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
   952
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   953
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
   954
  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
   955
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   956
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
   957
  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
   958
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   959
lemma Inf_Univ: "\<Sqinter>UNIV = \<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
   960
  unfolding Sup_Inf by (auto simp add: UNIV_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
   961
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   962
lemma Sup_Univ: "\<Squnion>UNIV = \<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
   963
  unfolding Inf_Sup by (auto simp add: UNIV_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
   964
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   965
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
   966
  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
   967
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   968
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
   969
  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
   970
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   971
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
   972
  "\<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
   973
  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
   974
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   975
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
   976
  "\<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
   977
  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
   978
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   979
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
   980
  "\<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
   981
  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
   982
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   983
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
   984
  "\<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
   985
  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
   986
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   987
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
   988
  "\<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
   989
  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
   990
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   991
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
   992
  "\<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
   993
  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
   994
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   995
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
   996
  "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
   997
  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
   998
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
   999
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
  1000
  "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
  1001
  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
  1002
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1003
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
  1004
  "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
  1005
  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
  1006
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1007
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
  1008
  "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
  1009
  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
  1010
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1011
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
  1012
  "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
  1013
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1014
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
  1015
  "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
  1016
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1017
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
  1018
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1019
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
  1020
  "_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
  1021
  "_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
  1022
  "_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
  1023
  "_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
  1024
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1025
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
  1026
  "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
  1027
  "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
  1028
  "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
  1029
  "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
  1030
  "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
  1031
  "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
  1032
  "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
  1033
  "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
  1034
32120
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1035
print_translation {* [
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1036
Syntax.preserve_binder_abs2_tr' @{const_syntax SUPR} "_SUP",
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1037
Syntax.preserve_binder_abs2_tr' @{const_syntax INFI} "_INF"
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1038
] *} -- {* to avoid eta-contraction of body *}
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1039
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
  1040
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
  1041
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
  1042
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1043
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
  1044
  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
  1045
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1046
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
  1047
  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
  1048
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1049
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
  1050
  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
  1051
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1052
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
  1053
  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
  1054
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1055
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
  1056
  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
  1057
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1058
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
  1059
  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
  1060
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1061
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
  1062
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1063
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1064
subsubsection {* @{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
  1065
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1066
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
  1067
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
  1068
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1069
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
  1070
  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
  1071
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1072
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
  1073
  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
  1074
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1075
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
  1076
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
  1077
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1078
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
  1079
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1080
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
  1081
  "\<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
  1082
  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
  1083
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1084
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
  1085
  "\<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
  1086
  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
  1087
32120
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1088
lemma INFI_bool_eq:
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1089
  "INFI = Ball"
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1090
proof (rule ext)+
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1091
  fix A :: "'a set"
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1092
  fix P :: "'a \<Rightarrow> bool"
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1093
  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
  1094
    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
  1095
qed
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1096
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1097
lemma SUPR_bool_eq:
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1098
  "SUPR = Bex"
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1099
proof (rule ext)+
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1100
  fix A :: "'a set"
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1101
  fix P :: "'a \<Rightarrow> bool"
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1102
  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
  1103
    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
  1104
qed
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1105
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
  1106
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
  1107
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
  1108
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1109
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
  1110
  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
  1111
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1112
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
  1113
  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
  1114
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1115
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
  1116
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
  1117
  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
  1118
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1119
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
  1120
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1121
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
  1122
  "\<Sqinter>{} = (\<lambda>_. \<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
  1123
  by rule (simp add: Inf_fun_def, simp add: empty_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
  1124
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1125
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
  1126
  "\<Squnion>{} = (\<lambda>_. \<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
  1127
  by rule (simp add: Sup_fun_def, simp add: empty_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
  1128
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1129
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1130
subsubsection {* Union *}
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1131
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1132
definition Union :: "'a set set \<Rightarrow> 'a set" where
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1133
  Union_eq [code del]: "Union A = {x. \<exists>B \<in> A. x \<in> B}"
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1134
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1135
notation (xsymbols)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1136
  Union  ("\<Union>_" [90] 90)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1137
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1138
lemma Sup_set_eq:
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1139
  "\<Squnion>S = \<Union>S"
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1140
proof (rule set_ext)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1141
  fix x
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1142
  have "(\<exists>Q\<in>{P. \<exists>A\<in>S. P \<longleftrightarrow> x \<in> A}. Q) \<longleftrightarrow> (\<exists>A\<in>S. x \<in> A)"
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1143
    by auto
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1144
  then show "x \<in> \<Squnion>S \<longleftrightarrow> x \<in> \<Union>S"
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1145
    by (simp add: Sup_fun_def Sup_bool_def Union_eq) (simp add: mem_def)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1146
qed
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1147
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1148
lemma Union_iff [simp, noatp]:
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1149
  "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
  1150
  by (unfold Union_eq) blast
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1151
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1152
lemma UnionI [intro]:
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1153
  "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
  1154
  -- {* 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
  1155
    @{term A} may be flexible. *}
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1156
  by auto
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1157
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1158
lemma UnionE [elim!]:
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1159
  "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
  1160
  by auto
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1161
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1162
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1163
subsubsection {* 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
  1164
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1165
definition UNION :: "'a set \<Rightarrow> ('a \<Rightarrow> 'b set) \<Rightarrow> 'b set" where
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1166
  UNION_eq_Union_image: "UNION A B = \<Union>(B`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
  1167
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1168
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
  1169
  "@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
  1170
  "@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
  1171
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1172
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
  1173
  "@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
  1174
  "@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
  1175
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1176
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
  1177
  "@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
  1178
  "@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
  1179
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1180
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
  1181
  "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
  1182
  "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
  1183
  "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
  1184
  "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
  1185
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1186
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
  1187
  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
  1188
  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
  1189
  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
  1190
  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
  1191
  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
  1192
  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
  1193
*}
3698947146b2 closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents: 32064
diff changeset
  1194
32120
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1195
print_translation {* [
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1196
Syntax.preserve_binder_abs2_tr' @{const_syntax UNION} "@UNION"
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1197
] *} -- {* 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
  1198
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1199
lemma SUPR_set_eq:
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1200
  "(SUP x:S. f x) = (\<Union>x\<in>S. f x)"
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1201
  by (simp add: SUPR_def UNION_eq_Union_image Sup_set_eq)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1202
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1203
lemma Union_def:
32117
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
  1204
  "\<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
  1205
  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
  1206
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1207
lemma UNION_def [noatp]:
32117
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
  1208
  "UNION A B = {y. \<exists>x\<in>A. y \<in> B x}"
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
  1209
  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
  1210
  
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1211
lemma Union_image_eq [simp]:
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1212
  "\<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
  1213
  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
  1214
  
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1215
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
  1216
  by (unfold UNION_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1217
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1218
lemma UN_I [intro]: "a:A ==> b: B a ==> b: (UN x:A. B x)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1219
  -- {* The order of the premises presupposes that @{term A} is rigid;
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1220
    @{term b} may be flexible. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1221
  by auto
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1222
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1223
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
  1224
  by (unfold UNION_def) blast
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
  1225
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1226
lemma UN_cong [cong]:
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1227
    "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
  1228
  by (simp add: UNION_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1229
29691
9f03b5f847cd Added strong congruence rule for UN.
berghofe
parents: 28562
diff changeset
  1230
lemma strong_UN_cong:
9f03b5f847cd Added strong congruence rule for UN.
berghofe
parents: 28562
diff changeset
  1231
    "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
  1232
  by (simp add: UNION_def simp_implies_def)
9f03b5f847cd Added strong congruence rule for UN.
berghofe
parents: 28562
diff changeset
  1233
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
  1234
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
  1235
  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
  1236
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1237
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1238
subsubsection {* Inter *}
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1239
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1240
definition Inter :: "'a set set \<Rightarrow> 'a set" where
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1241
  Inter_eq [code del]: "Inter A = {x. \<forall>B \<in> A. x \<in> B}"
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1242
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1243
notation (xsymbols)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1244
  Inter  ("\<Inter>_" [90] 90)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1245
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1246
lemma Inf_set_eq:
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1247
  "\<Sqinter>S = \<Inter>S"
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1248
proof (rule set_ext)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1249
  fix x
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1250
  have "(\<forall>Q\<in>{P. \<exists>A\<in>S. P \<longleftrightarrow> x \<in> A}. Q) \<longleftrightarrow> (\<forall>A\<in>S. x \<in> A)"
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1251
    by auto
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1252
  then show "x \<in> \<Sqinter>S \<longleftrightarrow> x \<in> \<Inter>S"
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1253
    by (simp add: Inter_eq Inf_fun_def Inf_bool_def) (simp add: mem_def)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1254
qed
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1255
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1256
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
  1257
  by (unfold Inter_eq) blast
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1258
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1259
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
  1260
  by (simp add: Inter_eq)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1261
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1262
text {*
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1263
  \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
  1264
  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
  1265
  @{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
  1266
*}
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1267
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1268
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
  1269
  by auto
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1270
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1271
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
  1272
  -- {* ``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
  1273
    @{prop "X:C"}. *}
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1274
  by (unfold Inter_eq) blast
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1275
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1276
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1277
subsubsection {* Intersections of families *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1278
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1279
definition INTER :: "'a set \<Rightarrow> ('a \<Rightarrow> 'b set) \<Rightarrow> 'b set" where
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1280
  INTER_eq_Inter_image: "INTER A B = \<Inter>(B`A)"
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1281
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1282
syntax
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1283
  "@INTER1"     :: "pttrns => 'b set => 'b set"           ("(3INT _./ _)" [0, 10] 10)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1284
  "@INTER"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3INT _:_./ _)" [0, 10] 10)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1285
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1286
syntax (xsymbols)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1287
  "@INTER1"     :: "pttrns => 'b set => 'b set"           ("(3\<Inter>_./ _)" [0, 10] 10)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1288
  "@INTER"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3\<Inter>_\<in>_./ _)" [0, 10] 10)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1289
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1290
syntax (latex output)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1291
  "@INTER1"     :: "pttrns => 'b set => 'b set"           ("(3\<Inter>(00\<^bsub>_\<^esub>)/ _)" [0, 10] 10)
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1292
  "@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
  1293
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1294
translations
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1295
  "INT x y. B"  == "INT x. INT y. B"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1296
  "INT x. B"    == "CONST INTER CONST UNIV (%x. B)"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1297
  "INT x. B"    == "INT x:CONST UNIV. B"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1298
  "INT x:A. B"  == "CONST INTER A (%x. B)"
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1299
32120
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1300
print_translation {* [
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1301
Syntax.preserve_binder_abs2_tr' @{const_syntax INTER} "@INTER"
53a21a5e6889 attempt for more concise setup of non-etacontracting binders
haftmann
parents: 32117
diff changeset
  1302
] *} -- {* to avoid eta-contraction of body *}
32081
1b7a901e2edc refined outline structure
haftmann
parents: 32078
diff changeset
  1303
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1304
lemma INFI_set_eq:
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1305
  "(INF x:S. f x) = (\<Inter>x\<in>S. f x)"
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1306
  by (simp add: INFI_def INTER_eq_Inter_image Inf_set_eq)
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1307
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1308
lemma Inter_def:
32117
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: 32115
diff changeset
  1309
  "Inter S = INTER S (\<lambda>x. x)"
32115
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1310
  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
  1311
8f10fb3bb46e swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents: 32082
diff changeset
  1312
lemma INTER_def:
32117
0762b9ad83df Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents: