src/HOL/Set.thy
author nipkow
Mon, 05 Nov 2007 18:18:39 +0100
changeset 25287 094dab519ff5
parent 24730 a87d8d31abc0
child 25360 b8251517f508
permissions -rw-r--r--
added lemmas
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
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     2
    ID:         $Id$
12257
e3f7d6fb55d7 theory Inverse_Image converted and moved to Set;
wenzelm
parents: 12114
diff changeset
     3
    Author:     Tobias Nipkow, Lawrence C Paulson and Markus Wenzel
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     4
*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     5
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
     6
header {* Set theory for higher-order logic *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
     7
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15120
diff changeset
     8
theory Set
24280
c9867bdf2424 updated code generator setup
haftmann
parents: 23878
diff changeset
     9
imports Code_Setup
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15120
diff changeset
    10
begin
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    11
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    12
text {* A set in HOL is simply a predicate. *}
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    13
2261
d926157c0a6a added "op :", "op ~:" syntax;
wenzelm
parents: 2006
diff changeset
    14
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    15
subsection {* Basic syntax *}
2261
d926157c0a6a added "op :", "op ~:" syntax;
wenzelm
parents: 2006
diff changeset
    16
3947
eb707467f8c5 adapted to qualified names;
wenzelm
parents: 3842
diff changeset
    17
global
eb707467f8c5 adapted to qualified names;
wenzelm
parents: 3842
diff changeset
    18
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    19
typedecl 'a set
12338
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12257
diff changeset
    20
arities set :: (type) type
3820
46b255e140dc fixed infix syntax;
wenzelm
parents: 3370
diff changeset
    21
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    22
consts
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    23
  "{}"          :: "'a set"                             ("{}")
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    24
  UNIV          :: "'a set"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    25
  insert        :: "'a => 'a set => 'a set"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    26
  Collect       :: "('a => bool) => 'a set"              -- "comprehension"
22845
5f9138bcb3d7 changed code generator invocation syntax
haftmann
parents: 22744
diff changeset
    27
  "op Int"      :: "'a set => 'a set => 'a set"          (infixl "Int" 70)
5f9138bcb3d7 changed code generator invocation syntax
haftmann
parents: 22744
diff changeset
    28
  "op Un"       :: "'a set => 'a set => 'a set"          (infixl "Un" 65)
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    29
  UNION         :: "'a set => ('a => 'b set) => 'b set"  -- "general union"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    30
  INTER         :: "'a set => ('a => 'b set) => 'b set"  -- "general intersection"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    31
  Union         :: "'a set set => 'a set"                -- "union of a set"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    32
  Inter         :: "'a set set => 'a set"                -- "intersection of a set"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    33
  Pow           :: "'a set => 'a set set"                -- "powerset"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    34
  Ball          :: "'a set => ('a => bool) => bool"      -- "bounded universal quantifiers"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    35
  Bex           :: "'a set => ('a => bool) => bool"      -- "bounded existential quantifiers"
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19870
diff changeset
    36
  Bex1          :: "'a set => ('a => bool) => bool"      -- "bounded unique existential quantifiers"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    37
  image         :: "('a => 'b) => 'a set => 'b set"      (infixr "`" 90)
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    38
  "op :"        :: "'a => 'a set => bool"                -- "membership"
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    39
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 20380
diff changeset
    40
notation
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    41
  "op :"  ("op :") and
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    42
  "op :"  ("(_/ : _)" [50, 51] 50)
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    43
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    44
local
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    45
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    46
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    47
subsection {* Additional concrete syntax *}
2261
d926157c0a6a added "op :", "op ~:" syntax;
wenzelm
parents: 2006
diff changeset
    48
19363
667b5ea637dd refined 'abbreviation';
wenzelm
parents: 19323
diff changeset
    49
abbreviation
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    50
  range :: "('a => 'b) => 'b set" where -- "of function"
19363
667b5ea637dd refined 'abbreviation';
wenzelm
parents: 19323
diff changeset
    51
  "range f == f ` UNIV"
19323
ec5cd5b1804c Converted translations to abbbreviations.
nipkow
parents: 19295
diff changeset
    52
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    53
abbreviation
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    54
  "not_mem x A == ~ (x : A)" -- "non-membership"
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    55
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 20380
diff changeset
    56
notation
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    57
  not_mem  ("op ~:") and
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    58
  not_mem  ("(_/ ~: _)" [50, 51] 50)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    59
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 20380
diff changeset
    60
notation (xsymbols)
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    61
  "op Int"  (infixl "\<inter>" 70) and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    62
  "op Un"  (infixl "\<union>" 65) and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    63
  "op :"  ("op \<in>") and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    64
  "op :"  ("(_/ \<in> _)" [50, 51] 50) and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    65
  not_mem  ("op \<notin>") and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    66
  not_mem  ("(_/ \<notin> _)" [50, 51] 50) and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    67
  Union  ("\<Union>_" [90] 90) and
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    68
  Inter  ("\<Inter>_" [90] 90)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    69
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 20380
diff changeset
    70
notation (HTML output)
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    71
  "op Int"  (infixl "\<inter>" 70) and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    72
  "op Un"  (infixl "\<union>" 65) and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    73
  "op :"  ("op \<in>") and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    74
  "op :"  ("(_/ \<in> _)" [50, 51] 50) and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
    75
  not_mem  ("op \<notin>") and
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    76
  not_mem  ("(_/ \<notin> _)" [50, 51] 50)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
    77
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    78
syntax
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    79
  "@Finset"     :: "args => 'a set"                       ("{(_)}")
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    80
  "@Coll"       :: "pttrn => bool => 'a set"              ("(1{_./ _})")
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    81
  "@SetCompr"   :: "'a => idts => bool => 'a set"         ("(1{_ |/_./ _})")
15535
nipkow
parents: 15524
diff changeset
    82
  "@Collect"    :: "idt => 'a set => bool => 'a set"      ("(1{_ :/ _./ _})")
22439
b709739c69e6 syntax: proper body priorty for derived binders;
wenzelm
parents: 22377
diff changeset
    83
  "@INTER1"     :: "pttrns => 'b set => 'b set"           ("(3INT _./ _)" [0, 10] 10)
b709739c69e6 syntax: proper body priorty for derived binders;
wenzelm
parents: 22377
diff changeset
    84
  "@UNION1"     :: "pttrns => 'b set => 'b set"           ("(3UN _./ _)" [0, 10] 10)
b709739c69e6 syntax: proper body priorty for derived binders;
wenzelm
parents: 22377
diff changeset
    85
  "@INTER"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3INT _:_./ _)" [0, 10] 10)
b709739c69e6 syntax: proper body priorty for derived binders;
wenzelm
parents: 22377
diff changeset
    86
  "@UNION"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3UN _:_./ _)" [0, 10] 10)
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    87
  "_Ball"       :: "pttrn => 'a set => bool => bool"      ("(3ALL _:_./ _)" [0, 0, 10] 10)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    88
  "_Bex"        :: "pttrn => 'a set => bool => bool"      ("(3EX _:_./ _)" [0, 0, 10] 10)
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19870
diff changeset
    89
  "_Bex1"       :: "pttrn => 'a set => bool => bool"      ("(3EX! _:_./ _)" [0, 0, 10] 10)
22478
110f7f6f8a5d fixed typo
haftmann
parents: 22455
diff changeset
    90
  "_Bleast"     :: "id => 'a set => bool => 'a"           ("(3LEAST _:_./ _)" [0, 0, 10] 10)
18674
98d380757893 *** empty log message ***
nipkow
parents: 18447
diff changeset
    91
7238
36e58620ffc8 replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents: 5931
diff changeset
    92
syntax (HOL)
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    93
  "_Ball"       :: "pttrn => 'a set => bool => bool"      ("(3! _:_./ _)" [0, 0, 10] 10)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
    94
  "_Bex"        :: "pttrn => 'a set => bool => bool"      ("(3? _:_./ _)" [0, 0, 10] 10)
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19870
diff changeset
    95
  "_Bex1"       :: "pttrn => 'a set => bool => bool"      ("(3?! _:_./ _)" [0, 0, 10] 10)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    96
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    97
translations
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    98
  "{x, xs}"     == "insert x {xs}"
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    99
  "{x}"         == "insert x {}"
13764
3e180bf68496 removed some problems with print translations
nipkow
parents: 13763
diff changeset
   100
  "{x. P}"      == "Collect (%x. P)"
15535
nipkow
parents: 15524
diff changeset
   101
  "{x:A. P}"    => "{x. x:A & P}"
4159
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4151
diff changeset
   102
  "UN x y. B"   == "UN x. UN y. B"
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4151
diff changeset
   103
  "UN x. B"     == "UNION UNIV (%x. B)"
13858
a077513c9a07 *** empty log message ***
nipkow
parents: 13831
diff changeset
   104
  "UN x. B"     == "UN x:UNIV. B"
7238
36e58620ffc8 replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents: 5931
diff changeset
   105
  "INT x y. B"  == "INT x. INT y. B"
4159
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4151
diff changeset
   106
  "INT x. B"    == "INTER UNIV (%x. B)"
13858
a077513c9a07 *** empty log message ***
nipkow
parents: 13831
diff changeset
   107
  "INT x. B"    == "INT x:UNIV. B"
13764
3e180bf68496 removed some problems with print translations
nipkow
parents: 13763
diff changeset
   108
  "UN x:A. B"   == "UNION A (%x. B)"
3e180bf68496 removed some problems with print translations
nipkow
parents: 13763
diff changeset
   109
  "INT x:A. B"  == "INTER A (%x. B)"
3e180bf68496 removed some problems with print translations
nipkow
parents: 13763
diff changeset
   110
  "ALL x:A. P"  == "Ball A (%x. P)"
3e180bf68496 removed some problems with print translations
nipkow
parents: 13763
diff changeset
   111
  "EX x:A. P"   == "Bex A (%x. P)"
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19870
diff changeset
   112
  "EX! x:A. P"  == "Bex1 A (%x. P)"
18674
98d380757893 *** empty log message ***
nipkow
parents: 18447
diff changeset
   113
  "LEAST x:A. P" => "LEAST x. x:A & P"
98d380757893 *** empty log message ***
nipkow
parents: 18447
diff changeset
   114
12114
a8e860c86252 eliminated old "symbols" syntax, use "xsymbols" instead;
wenzelm
parents: 12023
diff changeset
   115
syntax (xsymbols)
14381
1189a8212a12 Modified UN and INT xsymbol syntax: made index subscript
nipkow
parents: 14335
diff changeset
   116
  "_Ball"       :: "pttrn => 'a set => bool => bool"      ("(3\<forall>_\<in>_./ _)" [0, 0, 10] 10)
1189a8212a12 Modified UN and INT xsymbol syntax: made index subscript
nipkow
parents: 14335
diff changeset
   117
  "_Bex"        :: "pttrn => 'a set => bool => bool"      ("(3\<exists>_\<in>_./ _)" [0, 0, 10] 10)
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19870
diff changeset
   118
  "_Bex1"       :: "pttrn => 'a set => bool => bool"      ("(3\<exists>!_\<in>_./ _)" [0, 0, 10] 10)
18674
98d380757893 *** empty log message ***
nipkow
parents: 18447
diff changeset
   119
  "_Bleast"     :: "id => 'a set => bool => 'a"           ("(3LEAST_\<in>_./ _)" [0, 0, 10] 10)
14381
1189a8212a12 Modified UN and INT xsymbol syntax: made index subscript
nipkow
parents: 14335
diff changeset
   120
14565
c6dc17aab88a use more symbols in HTML output
kleing
parents: 14551
diff changeset
   121
syntax (HTML output)
c6dc17aab88a use more symbols in HTML output
kleing
parents: 14551
diff changeset
   122
  "_Ball"       :: "pttrn => 'a set => bool => bool"      ("(3\<forall>_\<in>_./ _)" [0, 0, 10] 10)
c6dc17aab88a use more symbols in HTML output
kleing
parents: 14551
diff changeset
   123
  "_Bex"        :: "pttrn => 'a set => bool => bool"      ("(3\<exists>_\<in>_./ _)" [0, 0, 10] 10)
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19870
diff changeset
   124
  "_Bex1"       :: "pttrn => 'a set => bool => bool"      ("(3\<exists>!_\<in>_./ _)" [0, 0, 10] 10)
14565
c6dc17aab88a use more symbols in HTML output
kleing
parents: 14551
diff changeset
   125
15120
f0359f75682e undid UN/INT syntax
nipkow
parents: 15102
diff changeset
   126
syntax (xsymbols)
15535
nipkow
parents: 15524
diff changeset
   127
  "@Collect"    :: "idt => 'a set => bool => 'a set"      ("(1{_ \<in>/ _./ _})")
22439
b709739c69e6 syntax: proper body priorty for derived binders;
wenzelm
parents: 22377
diff changeset
   128
  "@UNION1"     :: "pttrns => 'b set => 'b set"           ("(3\<Union>_./ _)" [0, 10] 10)
b709739c69e6 syntax: proper body priorty for derived binders;
wenzelm
parents: 22377
diff changeset
   129
  "@INTER1"     :: "pttrns => 'b set => 'b set"           ("(3\<Inter>_./ _)" [0, 10] 10)
b709739c69e6 syntax: proper body priorty for derived binders;
wenzelm
parents: 22377
diff changeset
   130
  "@UNION"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3\<Union>_\<in>_./ _)" [0, 10] 10)
b709739c69e6 syntax: proper body priorty for derived binders;
wenzelm
parents: 22377
diff changeset
   131
  "@INTER"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3\<Inter>_\<in>_./ _)" [0, 10] 10)
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
   132
15120
f0359f75682e undid UN/INT syntax
nipkow
parents: 15102
diff changeset
   133
syntax (latex output)
22439
b709739c69e6 syntax: proper body priorty for derived binders;
wenzelm
parents: 22377
diff changeset
   134
  "@UNION1"     :: "pttrns => 'b set => 'b set"           ("(3\<Union>(00\<^bsub>_\<^esub>)/ _)" [0, 10] 10)
b709739c69e6 syntax: proper body priorty for derived binders;
wenzelm
parents: 22377
diff changeset
   135
  "@INTER1"     :: "pttrns => 'b set => 'b set"           ("(3\<Inter>(00\<^bsub>_\<^esub>)/ _)" [0, 10] 10)
b709739c69e6 syntax: proper body priorty for derived binders;
wenzelm
parents: 22377
diff changeset
   136
  "@UNION"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3\<Union>(00\<^bsub>_\<in>_\<^esub>)/ _)" [0, 10] 10)
b709739c69e6 syntax: proper body priorty for derived binders;
wenzelm
parents: 22377
diff changeset
   137
  "@INTER"      :: "pttrn => 'a set => 'b set => 'b set"  ("(3\<Inter>(00\<^bsub>_\<in>_\<^esub>)/ _)" [0, 10] 10)
15120
f0359f75682e undid UN/INT syntax
nipkow
parents: 15102
diff changeset
   138
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
   139
text{*
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
   140
  Note the difference between ordinary xsymbol syntax of indexed
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
   141
  unions and intersections (e.g.\ @{text"\<Union>a\<^isub>1\<in>A\<^isub>1. B"})
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
   142
  and their \LaTeX\ rendition: @{term"\<Union>a\<^isub>1\<in>A\<^isub>1. B"}. The
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
   143
  former does not make the index expression a subscript of the
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
   144
  union/intersection symbol because this leads to problems with nested
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
   145
  subscripts in Proof General. *}
2261
d926157c0a6a added "op :", "op ~:" syntax;
wenzelm
parents: 2006
diff changeset
   146
21333
eb291029d6cd dropped LOrder dependency
haftmann
parents: 21316
diff changeset
   147
instance set :: (type) ord
22744
5cbe966d67a2 Isar definitions are now added explicitly to code theorem table
haftmann
parents: 22478
diff changeset
   148
  subset_def:  "A \<le> B \<equiv> \<forall>x\<in>A. x \<in> B"
5cbe966d67a2 Isar definitions are now added explicitly to code theorem table
haftmann
parents: 22478
diff changeset
   149
  psubset_def: "A < B \<equiv> A \<le> B \<and> A \<noteq> B" ..
22845
5f9138bcb3d7 changed code generator invocation syntax
haftmann
parents: 22744
diff changeset
   150
lemmas [code func del] = subset_def psubset_def
21333
eb291029d6cd dropped LOrder dependency
haftmann
parents: 21316
diff changeset
   151
eb291029d6cd dropped LOrder dependency
haftmann
parents: 21316
diff changeset
   152
abbreviation
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
   153
  subset :: "'a set \<Rightarrow> 'a set \<Rightarrow> bool" where
21819
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   154
  "subset \<equiv> less"
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
   155
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
   156
abbreviation
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
   157
  subset_eq :: "'a set \<Rightarrow> 'a set \<Rightarrow> bool" where
21819
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   158
  "subset_eq \<equiv> less_eq"
21333
eb291029d6cd dropped LOrder dependency
haftmann
parents: 21316
diff changeset
   159
eb291029d6cd dropped LOrder dependency
haftmann
parents: 21316
diff changeset
   160
notation (output)
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
   161
  subset  ("op <") and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
   162
  subset  ("(_/ < _)" [50, 51] 50) and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
   163
  subset_eq  ("op <=") and
21333
eb291029d6cd dropped LOrder dependency
haftmann
parents: 21316
diff changeset
   164
  subset_eq  ("(_/ <= _)" [50, 51] 50)
eb291029d6cd dropped LOrder dependency
haftmann
parents: 21316
diff changeset
   165
eb291029d6cd dropped LOrder dependency
haftmann
parents: 21316
diff changeset
   166
notation (xsymbols)
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
   167
  subset  ("op \<subset>") and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
   168
  subset  ("(_/ \<subset> _)" [50, 51] 50) and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
   169
  subset_eq  ("op \<subseteq>") and
21333
eb291029d6cd dropped LOrder dependency
haftmann
parents: 21316
diff changeset
   170
  subset_eq  ("(_/ \<subseteq> _)" [50, 51] 50)
eb291029d6cd dropped LOrder dependency
haftmann
parents: 21316
diff changeset
   171
eb291029d6cd dropped LOrder dependency
haftmann
parents: 21316
diff changeset
   172
notation (HTML output)
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
   173
  subset  ("op \<subset>") and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
   174
  subset  ("(_/ \<subset> _)" [50, 51] 50) and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
   175
  subset_eq  ("op \<subseteq>") and
21333
eb291029d6cd dropped LOrder dependency
haftmann
parents: 21316
diff changeset
   176
  subset_eq  ("(_/ \<subseteq> _)" [50, 51] 50)
eb291029d6cd dropped LOrder dependency
haftmann
parents: 21316
diff changeset
   177
eb291029d6cd dropped LOrder dependency
haftmann
parents: 21316
diff changeset
   178
abbreviation (input)
21819
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   179
  supset :: "'a set \<Rightarrow> 'a set \<Rightarrow> bool" where
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   180
  "supset \<equiv> greater"
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
   181
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21384
diff changeset
   182
abbreviation (input)
21819
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   183
  supset_eq :: "'a set \<Rightarrow> 'a set \<Rightarrow> bool" where
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   184
  "supset_eq \<equiv> greater_eq"
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   185
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   186
notation (xsymbols)
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   187
  supset  ("op \<supset>") and
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   188
  supset  ("(_/ \<supset> _)" [50, 51] 50) and
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   189
  supset_eq  ("op \<supseteq>") and
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   190
  supset_eq  ("(_/ \<supseteq> _)" [50, 51] 50)
21333
eb291029d6cd dropped LOrder dependency
haftmann
parents: 21316
diff changeset
   191
14804
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   192
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   193
subsubsection "Bounded quantifiers"
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   194
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
   195
syntax (output)
14804
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   196
  "_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
   197
  "_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
   198
  "_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
   199
  "_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
   200
  "_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
   201
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   202
syntax (xsymbols)
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   203
  "_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
   204
  "_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
   205
  "_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
   206
  "_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
   207
  "_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
   208
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19637
diff changeset
   209
syntax (HOL output)
14804
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   210
  "_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
   211
  "_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
   212
  "_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
   213
  "_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
   214
  "_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
   215
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   216
syntax (HTML output)
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   217
  "_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
   218
  "_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
   219
  "_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
   220
  "_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
   221
  "_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
   222
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   223
translations
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   224
 "\<forall>A\<subset>B. P"   =>  "ALL A. A \<subset> B --> P"
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19870
diff changeset
   225
 "\<exists>A\<subset>B. P"   =>  "EX A. A \<subset> B & P"
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19870
diff changeset
   226
 "\<forall>A\<subseteq>B. P"   =>  "ALL A. A \<subseteq> B --> P"
14804
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   227
 "\<exists>A\<subseteq>B. P"   =>  "EX A. A \<subseteq> B & P"
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19870
diff changeset
   228
 "\<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
   229
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   230
print_translation {*
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   231
let
22377
61610b1beedf tuned ML setup;
wenzelm
parents: 22172
diff changeset
   232
  val Type (set_type, _) = @{typ "'a set"};
61610b1beedf tuned ML setup;
wenzelm
parents: 22172
diff changeset
   233
  val All_binder = Syntax.binder_name @{const_syntax "All"};
61610b1beedf tuned ML setup;
wenzelm
parents: 22172
diff changeset
   234
  val Ex_binder = Syntax.binder_name @{const_syntax "Ex"};
61610b1beedf tuned ML setup;
wenzelm
parents: 22172
diff changeset
   235
  val impl = @{const_syntax "op -->"};
61610b1beedf tuned ML setup;
wenzelm
parents: 22172
diff changeset
   236
  val conj = @{const_syntax "op &"};
61610b1beedf tuned ML setup;
wenzelm
parents: 22172
diff changeset
   237
  val sbset = @{const_syntax "subset"};
61610b1beedf tuned ML setup;
wenzelm
parents: 22172
diff changeset
   238
  val sbset_eq = @{const_syntax "subset_eq"};
21819
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   239
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   240
  val trans =
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   241
   [((All_binder, impl, sbset), "_setlessAll"),
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   242
    ((All_binder, impl, sbset_eq), "_setleAll"),
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   243
    ((Ex_binder, conj, sbset), "_setlessEx"),
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   244
    ((Ex_binder, conj, sbset_eq), "_setleEx")];
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   245
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   246
  fun mk v v' c n P =
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   247
    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
   248
    then Syntax.const c $ Syntax.mark_bound v' $ n $ P else raise Match;
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   249
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   250
  fun tr' q = (q,
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   251
    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
   252
         if T = (set_type) then case AList.lookup (op =) trans (q, c, d)
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   253
          of NONE => raise Match
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   254
           | SOME l => mk v v' l n P
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   255
         else raise Match
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   256
     | _ => raise Match);
14804
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   257
in
21819
8eb82ffcdd15 fixed syntax for bounded quantification
haftmann
parents: 21669
diff changeset
   258
  [tr' All_binder, tr' Ex_binder]
14804
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   259
end
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   260
*}
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   261
8de39d3e8eb6 Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents: 14752
diff changeset
   262
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   263
text {*
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   264
  \medskip Translate between @{text "{e | x1...xn. P}"} and @{text
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   265
  "{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
   266
  only translated if @{text "[0..n] subset bvs(e)"}.
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   267
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   268
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   269
parse_translation {*
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   270
  let
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   271
    val ex_tr = snd (mk_binder_tr ("EX ", "Ex"));
3947
eb707467f8c5 adapted to qualified names;
wenzelm
parents: 3842
diff changeset
   272
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   273
    fun nvars (Const ("_idts", _) $ _ $ idts) = nvars idts + 1
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   274
      | nvars _ = 1;
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   275
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   276
    fun setcompr_tr [e, idts, b] =
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   277
      let
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   278
        val eq = Syntax.const "op =" $ Bound (nvars idts) $ e;
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   279
        val P = Syntax.const "op &" $ eq $ b;
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   280
        val exP = ex_tr [idts, P];
17784
5cbb52f2c478 Term.absdummy;
wenzelm
parents: 17715
diff changeset
   281
      in Syntax.const "Collect" $ Term.absdummy (dummyT, exP) end;
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   282
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   283
  in [("@SetCompr", setcompr_tr)] end;
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   284
*}
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   285
13763
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   286
(* To avoid eta-contraction of body: *)
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   287
print_translation {*
13763
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   288
let
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   289
  fun btr' syn [A,Abs abs] =
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   290
    let val (x,t) = atomic_abs_tr' abs
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   291
    in Syntax.const syn $ x $ A $ t end
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   292
in
13858
a077513c9a07 *** empty log message ***
nipkow
parents: 13831
diff changeset
   293
[("Ball", btr' "_Ball"),("Bex", btr' "_Bex"),
a077513c9a07 *** empty log message ***
nipkow
parents: 13831
diff changeset
   294
 ("UNION", btr' "@UNION"),("INTER", btr' "@INTER")]
13763
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   295
end
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   296
*}
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   297
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   298
print_translation {*
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   299
let
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   300
  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
   301
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   302
  fun setcompr_tr' [Abs (abs as (_, _, P))] =
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   303
    let
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   304
      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
   305
        | 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
   306
            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
   307
            ((0 upto (n - 1)) subset add_loose_bnos (e, 0, []))
13764
3e180bf68496 removed some problems with print translations
nipkow
parents: 13763
diff changeset
   308
        | check _ = false
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   309
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   310
        fun tr' (_ $ abs) =
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   311
          let val _ $ idts $ (_ $ (_ $ _ $ e) $ Q) = ex_tr' [abs]
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   312
          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
   313
    in if check (P, 0) then tr' P
15535
nipkow
parents: 15524
diff changeset
   314
       else let val (x as _ $ Free(xN,_), t) = atomic_abs_tr' abs
nipkow
parents: 15524
diff changeset
   315
                val M = Syntax.const "@Coll" $ x $ t
nipkow
parents: 15524
diff changeset
   316
            in case t of
nipkow
parents: 15524
diff changeset
   317
                 Const("op &",_)
nipkow
parents: 15524
diff changeset
   318
                   $ (Const("op :",_) $ (Const("_bound",_) $ Free(yN,_)) $ A)
nipkow
parents: 15524
diff changeset
   319
                   $ P =>
nipkow
parents: 15524
diff changeset
   320
                   if xN=yN then Syntax.const "@Collect" $ x $ A $ P else M
nipkow
parents: 15524
diff changeset
   321
               | _ => M
nipkow
parents: 15524
diff changeset
   322
            end
13763
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13653
diff changeset
   323
    end;
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   324
  in [("Collect", setcompr_tr')] end;
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   325
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   326
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   327
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   328
subsection {* Rules and definitions *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   329
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   330
text {* Isomorphisms between predicates and sets. *}
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   331
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   332
axioms
17085
5b57f995a179 more simprules now have names
paulson
parents: 17084
diff changeset
   333
  mem_Collect_eq: "(a : {x. P(x)}) = P(a)"
5b57f995a179 more simprules now have names
paulson
parents: 17084
diff changeset
   334
  Collect_mem_eq: "{x. x:A} = A"
17702
ea88ddeafabe more finalconsts;
wenzelm
parents: 17589
diff changeset
   335
finalconsts
ea88ddeafabe more finalconsts;
wenzelm
parents: 17589
diff changeset
   336
  Collect
ea88ddeafabe more finalconsts;
wenzelm
parents: 17589
diff changeset
   337
  "op :"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   338
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   339
defs
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   340
  Ball_def:     "Ball A P       == ALL x. x:A --> P(x)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   341
  Bex_def:      "Bex A P        == EX x. x:A & P(x)"
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19870
diff changeset
   342
  Bex1_def:     "Bex1 A P       == EX! x. x:A & P(x)"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   343
21333
eb291029d6cd dropped LOrder dependency
haftmann
parents: 21316
diff changeset
   344
instance set :: (type) minus
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   345
  Compl_def:    "- A            == {x. ~x:A}"
21333
eb291029d6cd dropped LOrder dependency
haftmann
parents: 21316
diff changeset
   346
  set_diff_def: "A - B          == {x. x:A & ~x:B}" ..
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   347
22845
5f9138bcb3d7 changed code generator invocation syntax
haftmann
parents: 22744
diff changeset
   348
lemmas [code func del] = Compl_def set_diff_def
22744
5cbe966d67a2 Isar definitions are now added explicitly to code theorem table
haftmann
parents: 22478
diff changeset
   349
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   350
defs
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   351
  Un_def:       "A Un B         == {x. x:A | x:B}"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   352
  Int_def:      "A Int B        == {x. x:A & x:B}"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   353
  INTER_def:    "INTER A B      == {y. ALL x:A. y: B(x)}"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   354
  UNION_def:    "UNION A B      == {y. EX x:A. y: B(x)}"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   355
  Inter_def:    "Inter S        == (INT x:S. x)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   356
  Union_def:    "Union S        == (UN x:S. x)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   357
  Pow_def:      "Pow A          == {B. B <= A}"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   358
  empty_def:    "{}             == {x. False}"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   359
  UNIV_def:     "UNIV           == {x. True}"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   360
  insert_def:   "insert a B     == {x. x=a} Un B"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   361
  image_def:    "f`A            == {y. EX x:A. y = f(x)}"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   362
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   363
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   364
subsection {* Lemmas and proof tool setup *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   365
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   366
subsubsection {* Relating predicates and sets *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   367
17085
5b57f995a179 more simprules now have names
paulson
parents: 17084
diff changeset
   368
declare mem_Collect_eq [iff]  Collect_mem_eq [simp]
5b57f995a179 more simprules now have names
paulson
parents: 17084
diff changeset
   369
12257
e3f7d6fb55d7 theory Inverse_Image converted and moved to Set;
wenzelm
parents: 12114
diff changeset
   370
lemma CollectI: "P(a) ==> a : {x. P(x)}"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   371
  by simp
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   372
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   373
lemma CollectD: "a : {x. P(x)} ==> P(a)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   374
  by simp
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   375
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   376
lemma Collect_cong: "(!!x. P x = Q x) ==> {x. P(x)} = {x. Q(x)}"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   377
  by simp
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   378
12257
e3f7d6fb55d7 theory Inverse_Image converted and moved to Set;
wenzelm
parents: 12114
diff changeset
   379
lemmas CollectE = CollectD [elim_format]
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   380
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   381
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   382
subsubsection {* Bounded quantifiers *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   383
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   384
lemma ballI [intro!]: "(!!x. x:A ==> P x) ==> ALL x:A. P x"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   385
  by (simp add: Ball_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   386
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   387
lemmas strip = impI allI ballI
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   388
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   389
lemma bspec [dest?]: "ALL x:A. P x ==> x:A ==> P x"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   390
  by (simp add: Ball_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   391
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   392
lemma ballE [elim]: "ALL x:A. P x ==> (P x ==> Q) ==> (x ~: A ==> Q) ==> Q"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   393
  by (unfold Ball_def) blast
22139
539a63b98f76 tuned ML setup;
wenzelm
parents: 21833
diff changeset
   394
539a63b98f76 tuned ML setup;
wenzelm
parents: 21833
diff changeset
   395
ML {* bind_thm ("rev_ballE", permute_prems 1 1 @{thm ballE}) *}
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   396
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   397
text {*
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   398
  \medskip This tactic takes assumptions @{prop "ALL x:A. P x"} and
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   399
  @{prop "a:A"}; creates assumption @{prop "P a"}.
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   400
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   401
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   402
ML {*
22139
539a63b98f76 tuned ML setup;
wenzelm
parents: 21833
diff changeset
   403
  fun ball_tac i = etac @{thm ballE} i THEN contr_tac (i + 1)
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   404
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   405
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   406
text {*
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   407
  Gives better instantiation for bound:
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   408
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   409
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   410
ML_setup {*
22139
539a63b98f76 tuned ML setup;
wenzelm
parents: 21833
diff changeset
   411
  change_claset (fn cs => cs addbefore ("bspec", datac @{thm bspec} 1))
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   412
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   413
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   414
lemma bexI [intro]: "P x ==> x:A ==> EX x:A. P x"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   415
  -- {* Normally the best argument order: @{prop "P x"} constrains the
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   416
    choice of @{prop "x:A"}. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   417
  by (unfold Bex_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   418
13113
5eb9be7b72a5 rev_bexI [intro?];
wenzelm
parents: 13103
diff changeset
   419
lemma rev_bexI [intro?]: "x:A ==> P x ==> EX x:A. P x"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   420
  -- {* The best argument order when there is only one @{prop "x:A"}. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   421
  by (unfold Bex_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   422
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   423
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
   424
  by (unfold Bex_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   425
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   426
lemma bexE [elim!]: "EX x:A. P x ==> (!!x. x:A ==> P x ==> Q) ==> Q"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   427
  by (unfold Bex_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   428
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   429
lemma ball_triv [simp]: "(ALL x:A. P) = ((EX x. x:A) --> P)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   430
  -- {* Trival rewrite rule. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   431
  by (simp add: Ball_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   432
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   433
lemma bex_triv [simp]: "(EX x:A. P) = ((EX x. x:A) & P)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   434
  -- {* Dual form for existentials. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   435
  by (simp add: Bex_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   436
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   437
lemma bex_triv_one_point1 [simp]: "(EX x:A. x = a) = (a:A)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   438
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   439
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   440
lemma bex_triv_one_point2 [simp]: "(EX x:A. a = x) = (a:A)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   441
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   442
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   443
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
   444
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   445
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   446
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
   447
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   448
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   449
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
   450
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   451
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   452
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
   453
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   454
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   455
ML_setup {*
13462
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13421
diff changeset
   456
  local
22139
539a63b98f76 tuned ML setup;
wenzelm
parents: 21833
diff changeset
   457
    val unfold_bex_tac = unfold_tac @{thms "Bex_def"};
18328
841261f303a1 simprocs: static evaluation of simpset;
wenzelm
parents: 18315
diff changeset
   458
    fun prove_bex_tac ss = unfold_bex_tac ss THEN Quantifier1.prove_one_point_ex_tac;
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   459
    val rearrange_bex = Quantifier1.rearrange_bex prove_bex_tac;
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   460
22139
539a63b98f76 tuned ML setup;
wenzelm
parents: 21833
diff changeset
   461
    val unfold_ball_tac = unfold_tac @{thms "Ball_def"};
18328
841261f303a1 simprocs: static evaluation of simpset;
wenzelm
parents: 18315
diff changeset
   462
    fun prove_ball_tac ss = unfold_ball_tac ss THEN Quantifier1.prove_one_point_all_tac;
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   463
    val rearrange_ball = Quantifier1.rearrange_ball prove_ball_tac;
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   464
  in
18328
841261f303a1 simprocs: static evaluation of simpset;
wenzelm
parents: 18315
diff changeset
   465
    val defBEX_regroup = Simplifier.simproc (the_context ())
13462
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13421
diff changeset
   466
      "defined BEX" ["EX x:A. P x & Q x"] rearrange_bex;
18328
841261f303a1 simprocs: static evaluation of simpset;
wenzelm
parents: 18315
diff changeset
   467
    val defBALL_regroup = Simplifier.simproc (the_context ())
13462
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13421
diff changeset
   468
      "defined BALL" ["ALL x:A. P x --> Q x"] rearrange_ball;
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   469
  end;
13462
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13421
diff changeset
   470
56610e2ba220 sane interface for simprocs;
wenzelm
parents: 13421
diff changeset
   471
  Addsimprocs [defBALL_regroup, defBEX_regroup];
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   472
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   473
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   474
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   475
subsubsection {* Congruence rules *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   476
16636
1ed737a98198 Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents: 15950
diff changeset
   477
lemma ball_cong:
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   478
  "A = B ==> (!!x. x:B ==> P x = Q x) ==>
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   479
    (ALL x:A. P x) = (ALL x:B. Q x)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   480
  by (simp add: Ball_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   481
16636
1ed737a98198 Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents: 15950
diff changeset
   482
lemma strong_ball_cong [cong]:
1ed737a98198 Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents: 15950
diff changeset
   483
  "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
   484
    (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
   485
  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
   486
1ed737a98198 Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents: 15950
diff changeset
   487
lemma bex_cong:
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   488
  "A = B ==> (!!x. x:B ==> P x = Q x) ==>
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   489
    (EX x:A. P x) = (EX x:B. Q x)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   490
  by (simp add: Bex_def cong: conj_cong)
1273
6960ec882bca added 8bit pragmas
regensbu
parents: 1068
diff changeset
   491
16636
1ed737a98198 Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents: 15950
diff changeset
   492
lemma strong_bex_cong [cong]:
1ed737a98198 Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents: 15950
diff changeset
   493
  "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
   494
    (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
   495
  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
   496
7238
36e58620ffc8 replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents: 5931
diff changeset
   497
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   498
subsubsection {* Subsets *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   499
19295
c5d236fe9668 subsetI is often necessary
paulson
parents: 19277
diff changeset
   500
lemma subsetI [atp,intro!]: "(!!x. x:A ==> x:B) ==> A \<subseteq> B"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   501
  by (simp add: subset_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   502
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   503
text {*
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   504
  \medskip Map the type @{text "'a set => anything"} to just @{typ
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   505
  'a}; for overloading constants whose first argument has type @{typ
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   506
  "'a set"}.
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   507
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   508
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   509
lemma subsetD [elim]: "A \<subseteq> B ==> c \<in> A ==> c \<in> B"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   510
  -- {* Rule in Modus Ponens style. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   511
  by (unfold subset_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   512
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   513
declare subsetD [intro?] -- FIXME
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   514
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   515
lemma rev_subsetD: "c \<in> A ==> A \<subseteq> B ==> c \<in> B"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   516
  -- {* The same, with reversed premises for use with @{text erule} --
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   517
      cf @{text rev_mp}. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   518
  by (rule subsetD)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   519
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   520
declare rev_subsetD [intro?] -- FIXME
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   521
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   522
text {*
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   523
  \medskip Converts @{prop "A \<subseteq> B"} to @{prop "x \<in> A ==> x \<in> B"}.
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   524
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   525
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   526
ML {*
22139
539a63b98f76 tuned ML setup;
wenzelm
parents: 21833
diff changeset
   527
  fun impOfSubs th = th RSN (2, @{thm rev_subsetD})
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   528
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   529
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   530
lemma subsetCE [elim]: "A \<subseteq>  B ==> (c \<notin> A ==> P) ==> (c \<in> B ==> P) ==> P"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   531
  -- {* Classical elimination rule. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   532
  by (unfold subset_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   533
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   534
text {*
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   535
  \medskip Takes assumptions @{prop "A \<subseteq> B"}; @{prop "c \<in> A"} and
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   536
  creates the assumption @{prop "c \<in> B"}.
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   537
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   538
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   539
ML {*
22139
539a63b98f76 tuned ML setup;
wenzelm
parents: 21833
diff changeset
   540
  fun set_mp_tac i = etac @{thm subsetCE} i THEN mp_tac i
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   541
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   542
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   543
lemma contra_subsetD: "A \<subseteq> B ==> c \<notin> B ==> c \<notin> A"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   544
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   545
19175
c6e4b073f6a5 subset_refl now included using the atp attribute
paulson
parents: 18851
diff changeset
   546
lemma subset_refl [simp,atp]: "A \<subseteq> A"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   547
  by fast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   548
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   549
lemma subset_trans: "A \<subseteq> B ==> B \<subseteq> C ==> A \<subseteq> C"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   550
  by blast
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   551
2261
d926157c0a6a added "op :", "op ~:" syntax;
wenzelm
parents: 2006
diff changeset
   552
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   553
subsubsection {* Equality *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   554
13865
0a6bf71955b0 moved one proof, added another
paulson
parents: 13860
diff changeset
   555
lemma set_ext: assumes prem: "(!!x. (x:A) = (x:B))" shows "A = B"
0a6bf71955b0 moved one proof, added another
paulson
parents: 13860
diff changeset
   556
  apply (rule prem [THEN ext, THEN arg_cong, THEN box_equals])
0a6bf71955b0 moved one proof, added another
paulson
parents: 13860
diff changeset
   557
   apply (rule Collect_mem_eq)
0a6bf71955b0 moved one proof, added another
paulson
parents: 13860
diff changeset
   558
  apply (rule Collect_mem_eq)
0a6bf71955b0 moved one proof, added another
paulson
parents: 13860
diff changeset
   559
  done
0a6bf71955b0 moved one proof, added another
paulson
parents: 13860
diff changeset
   560
15554
03d4347b071d integrated Jeremy's FiniteLib
nipkow
parents: 15535
diff changeset
   561
(* Due to Brian Huffman *)
03d4347b071d integrated Jeremy's FiniteLib
nipkow
parents: 15535
diff changeset
   562
lemma expand_set_eq: "(A = B) = (ALL x. (x:A) = (x:B))"
03d4347b071d integrated Jeremy's FiniteLib
nipkow
parents: 15535
diff changeset
   563
by(auto intro:set_ext)
03d4347b071d integrated Jeremy's FiniteLib
nipkow
parents: 15535
diff changeset
   564
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   565
lemma subset_antisym [intro!]: "A \<subseteq> B ==> B \<subseteq> A ==> A = B"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   566
  -- {* Anti-symmetry of the subset relation. *}
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17508
diff changeset
   567
  by (iprover intro: set_ext subsetD)
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   568
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   569
lemmas equalityI [intro!] = subset_antisym
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   570
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   571
text {*
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   572
  \medskip Equality rules from ZF set theory -- are they appropriate
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   573
  here?
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   574
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   575
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   576
lemma equalityD1: "A = B ==> A \<subseteq> B"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   577
  by (simp add: subset_refl)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   578
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   579
lemma equalityD2: "A = B ==> B \<subseteq> A"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   580
  by (simp add: subset_refl)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   581
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   582
text {*
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   583
  \medskip Be careful when adding this to the claset as @{text
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   584
  subset_empty} is in the simpset: @{prop "A = {}"} goes to @{prop "{}
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   585
  \<subseteq> A"} and @{prop "A \<subseteq> {}"} and then back to @{prop "A = {}"}!
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   586
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   587
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   588
lemma equalityE: "A = B ==> (A \<subseteq> B ==> B \<subseteq> A ==> P) ==> P"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   589
  by (simp add: subset_refl)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   590
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   591
lemma equalityCE [elim]:
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   592
    "A = B ==> (c \<in> A ==> c \<in> B ==> P) ==> (c \<notin> A ==> c \<notin> B ==> P) ==> P"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   593
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   594
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   595
lemma eqset_imp_iff: "A = B ==> (x : A) = (x : B)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   596
  by simp
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   597
13865
0a6bf71955b0 moved one proof, added another
paulson
parents: 13860
diff changeset
   598
lemma eqelem_imp_iff: "x = y ==> (x : A) = (y : A)"
0a6bf71955b0 moved one proof, added another
paulson
parents: 13860
diff changeset
   599
  by simp
0a6bf71955b0 moved one proof, added another
paulson
parents: 13860
diff changeset
   600
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   601
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   602
subsubsection {* The universal set -- UNIV *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   603
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   604
lemma UNIV_I [simp]: "x : UNIV"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   605
  by (simp add: UNIV_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   606
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   607
declare UNIV_I [intro]  -- {* unsafe makes it less likely to cause problems *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   608
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   609
lemma UNIV_witness [intro?]: "EX x. x : UNIV"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   610
  by simp
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   611
18144
4edcb5fdc3b0 duplicate axioms in ATP linkup, and general fixes
paulson
parents: 17875
diff changeset
   612
lemma subset_UNIV [simp]: "A \<subseteq> UNIV"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   613
  by (rule subsetI) (rule UNIV_I)
2388
d1f0505fc602 added set inclusion symbol syntax;
wenzelm
parents: 2372
diff changeset
   614
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   615
text {*
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   616
  \medskip Eta-contracting these two rules (to remove @{text P})
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   617
  causes them to be ignored because of their interaction with
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   618
  congruence rules.
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   619
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   620
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   621
lemma ball_UNIV [simp]: "Ball UNIV P = All P"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   622
  by (simp add: Ball_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   623
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   624
lemma bex_UNIV [simp]: "Bex UNIV P = Ex P"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   625
  by (simp add: Bex_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   626
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   627
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   628
subsubsection {* The empty set *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   629
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   630
lemma empty_iff [simp]: "(c : {}) = False"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   631
  by (simp add: empty_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   632
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   633
lemma emptyE [elim!]: "a : {} ==> P"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   634
  by simp
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   635
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   636
lemma empty_subsetI [iff]: "{} \<subseteq> A"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   637
    -- {* One effect is to delete the ASSUMPTION @{prop "{} <= A"} *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   638
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   639
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   640
lemma equals0I: "(!!y. y \<in> A ==> False) ==> A = {}"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   641
  by blast
2388
d1f0505fc602 added set inclusion symbol syntax;
wenzelm
parents: 2372
diff changeset
   642
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   643
lemma equals0D: "A = {} ==> a \<notin> A"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   644
    -- {* Use for reasoning about disjointness: @{prop "A Int B = {}"} *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   645
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   646
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   647
lemma ball_empty [simp]: "Ball {} P = True"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   648
  by (simp add: Ball_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   649
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   650
lemma bex_empty [simp]: "Bex {} P = False"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   651
  by (simp add: Bex_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   652
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   653
lemma UNIV_not_empty [iff]: "UNIV ~= {}"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   654
  by (blast elim: equalityE)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   655
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   656
12023
wenzelm
parents: 12020
diff changeset
   657
subsubsection {* The Powerset operator -- Pow *}
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   658
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   659
lemma Pow_iff [iff]: "(A \<in> Pow B) = (A \<subseteq> B)"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   660
  by (simp add: Pow_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   661
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   662
lemma PowI: "A \<subseteq> B ==> A \<in> Pow B"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   663
  by (simp add: Pow_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   664
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   665
lemma PowD: "A \<in> Pow B ==> A \<subseteq> B"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   666
  by (simp add: Pow_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   667
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   668
lemma Pow_bottom: "{} \<in> Pow B"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   669
  by simp
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   670
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   671
lemma Pow_top: "A \<in> Pow A"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   672
  by (simp add: subset_refl)
2684
9781d63ef063 added proper subset symbols syntax;
wenzelm
parents: 2412
diff changeset
   673
2388
d1f0505fc602 added set inclusion symbol syntax;
wenzelm
parents: 2372
diff changeset
   674
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   675
subsubsection {* Set complement *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   676
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   677
lemma Compl_iff [simp]: "(c \<in> -A) = (c \<notin> A)"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   678
  by (unfold Compl_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   679
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   680
lemma ComplI [intro!]: "(c \<in> A ==> False) ==> c \<in> -A"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   681
  by (unfold Compl_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   682
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   683
text {*
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   684
  \medskip This form, with negated conclusion, works well with the
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   685
  Classical prover.  Negated assumptions behave like formulae on the
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   686
  right side of the notional turnstile ... *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   687
17084
fb0a80aef0be classical rules must have names for ATP integration
paulson
parents: 17002
diff changeset
   688
lemma ComplD [dest!]: "c : -A ==> c~:A"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   689
  by (unfold Compl_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   690
17084
fb0a80aef0be classical rules must have names for ATP integration
paulson
parents: 17002
diff changeset
   691
lemmas ComplE = ComplD [elim_format]
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   692
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   693
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   694
subsubsection {* Binary union -- Un *}
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   695
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   696
lemma Un_iff [simp]: "(c : A Un B) = (c:A | c:B)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   697
  by (unfold Un_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   698
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   699
lemma UnI1 [elim?]: "c:A ==> c : A Un B"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   700
  by simp
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   701
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   702
lemma UnI2 [elim?]: "c:B ==> c : A Un B"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   703
  by simp
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   704
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   705
text {*
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   706
  \medskip Classical introduction rule: no commitment to @{prop A} vs
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   707
  @{prop B}.
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   708
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   709
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   710
lemma UnCI [intro!]: "(c~:B ==> c:A) ==> c : A Un B"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   711
  by auto
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   712
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   713
lemma UnE [elim!]: "c : A Un B ==> (c:A ==> P) ==> (c:B ==> P) ==> P"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   714
  by (unfold Un_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   715
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   716
12023
wenzelm
parents: 12020
diff changeset
   717
subsubsection {* Binary intersection -- Int *}
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   718
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   719
lemma Int_iff [simp]: "(c : A Int B) = (c:A & c:B)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   720
  by (unfold Int_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   721
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   722
lemma IntI [intro!]: "c:A ==> c:B ==> c : A Int B"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   723
  by simp
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   724
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   725
lemma IntD1: "c : A Int B ==> c:A"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   726
  by simp
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   727
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   728
lemma IntD2: "c : A Int B ==> c:B"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   729
  by simp
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   730
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   731
lemma IntE [elim!]: "c : A Int B ==> (c:A ==> c:B ==> P) ==> P"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   732
  by simp
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   733
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   734
12023
wenzelm
parents: 12020
diff changeset
   735
subsubsection {* Set difference *}
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   736
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   737
lemma Diff_iff [simp]: "(c : A - B) = (c:A & c~:B)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   738
  by (unfold set_diff_def) blast
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   739
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   740
lemma DiffI [intro!]: "c : A ==> c ~: B ==> c : A - B"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   741
  by simp
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   742
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   743
lemma DiffD1: "c : A - B ==> c : A"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   744
  by simp
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   745
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   746
lemma DiffD2: "c : A - B ==> c : B ==> P"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   747
  by simp
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   748
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   749
lemma DiffE [elim!]: "c : A - B ==> (c:A ==> c~:B ==> P) ==> P"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   750
  by simp
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   751
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   752
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   753
subsubsection {* Augmenting a set -- insert *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   754
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   755
lemma insert_iff [simp]: "(a : insert b A) = (a = b | a:A)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   756
  by (unfold insert_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   757
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   758
lemma insertI1: "a : insert a B"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   759
  by simp
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   760
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   761
lemma insertI2: "a : B ==> a : insert b B"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   762
  by simp
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   763
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   764
lemma insertE [elim!]: "a : insert b A ==> (a = b ==> P) ==> (a:A ==> P) ==> P"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   765
  by (unfold insert_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   766
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   767
lemma insertCI [intro!]: "(a~:B ==> a = b) ==> a: insert b B"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   768
  -- {* Classical introduction rule. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   769
  by auto
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   770
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   771
lemma subset_insert_iff: "(A \<subseteq> insert x B) = (if x:A then A - {x} \<subseteq> B else A \<subseteq> B)"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   772
  by auto
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   773
24730
a87d8d31abc0 convenient obtain rule for sets
haftmann
parents: 24658
diff changeset
   774
lemma set_insert:
a87d8d31abc0 convenient obtain rule for sets
haftmann
parents: 24658
diff changeset
   775
  assumes "x \<in> A"
a87d8d31abc0 convenient obtain rule for sets
haftmann
parents: 24658
diff changeset
   776
  obtains B where "A = insert x B" and "x \<notin> B"
a87d8d31abc0 convenient obtain rule for sets
haftmann
parents: 24658
diff changeset
   777
proof
a87d8d31abc0 convenient obtain rule for sets
haftmann
parents: 24658
diff changeset
   778
  from assms show "A = insert x (A - {x})" by blast
a87d8d31abc0 convenient obtain rule for sets
haftmann
parents: 24658
diff changeset
   779
next
a87d8d31abc0 convenient obtain rule for sets
haftmann
parents: 24658
diff changeset
   780
  show "x \<notin> A - {x}" by blast
a87d8d31abc0 convenient obtain rule for sets
haftmann
parents: 24658
diff changeset
   781
qed
a87d8d31abc0 convenient obtain rule for sets
haftmann
parents: 24658
diff changeset
   782
25287
094dab519ff5 added lemmas
nipkow
parents: 24730
diff changeset
   783
lemma insert_ident: "x ~: A ==> x ~: B ==> (insert x A = insert x B) = (A = B)"
094dab519ff5 added lemmas
nipkow
parents: 24730
diff changeset
   784
by auto
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   785
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   786
subsubsection {* Singletons, using insert *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   787
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
   788
lemma singletonI [intro!,noatp]: "a : {a}"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   789
    -- {* Redundant? But unlike @{text insertCI}, it proves the subgoal immediately! *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   790
  by (rule insertI1)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   791
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
   792
lemma singletonD [dest!,noatp]: "b : {a} ==> b = a"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   793
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   794
17084
fb0a80aef0be classical rules must have names for ATP integration
paulson
parents: 17002
diff changeset
   795
lemmas singletonE = singletonD [elim_format]
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   796
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   797
lemma singleton_iff: "(b : {a}) = (b = a)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   798
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   799
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   800
lemma singleton_inject [dest!]: "{a} = {b} ==> a = b"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   801
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   802
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
   803
lemma singleton_insert_inj_eq [iff,noatp]:
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
   804
     "({b} = insert a A) = (a = b & A \<subseteq> {b})"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   805
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   806
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
   807
lemma singleton_insert_inj_eq' [iff,noatp]:
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
   808
     "(insert a A = {b}) = (a = b & A \<subseteq> {b})"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   809
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   810
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   811
lemma subset_singletonD: "A \<subseteq> {x} ==> A = {} | A = {x}"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   812
  by fast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   813
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   814
lemma singleton_conv [simp]: "{x. x = a} = {a}"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   815
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   816
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   817
lemma singleton_conv2 [simp]: "{x. a = x} = {a}"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   818
  by blast
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   819
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   820
lemma diff_single_insert: "A - {x} \<subseteq> B ==> x \<in> A ==> A \<subseteq> insert x B"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   821
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   822
19870
ef037d1b32d1 new results
paulson
parents: 19656
diff changeset
   823
lemma doubleton_eq_iff: "({a,b} = {c,d}) = (a=c & b=d | a=d & b=c)"
ef037d1b32d1 new results
paulson
parents: 19656
diff changeset
   824
  by (blast elim: equalityE)
ef037d1b32d1 new results
paulson
parents: 19656
diff changeset
   825
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   826
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   827
subsubsection {* Unions of families *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   828
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   829
text {*
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   830
  @{term [source] "UN x:A. B x"} is @{term "Union (B`A)"}.
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   831
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   832
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
   833
declare UNION_def [noatp]
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
   834
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   835
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
   836
  by (unfold UNION_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   837
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   838
lemma UN_I [intro]: "a:A ==> b: B a ==> b: (UN x:A. B x)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   839
  -- {* The order of the premises presupposes that @{term A} is rigid;
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   840
    @{term b} may be flexible. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   841
  by auto
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   842
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   843
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
   844
  by (unfold UNION_def) blast
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   845
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   846
lemma UN_cong [cong]:
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   847
    "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
   848
  by (simp add: UNION_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   849
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   850
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   851
subsubsection {* Intersections of families *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   852
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   853
text {* @{term [source] "INT x:A. B x"} is @{term "Inter (B`A)"}. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   854
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   855
lemma INT_iff [simp]: "(b: (INT x:A. B x)) = (ALL x:A. b: B x)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   856
  by (unfold INTER_def) blast
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   857
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   858
lemma INT_I [intro!]: "(!!x. x:A ==> b: B x) ==> b : (INT x:A. B x)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   859
  by (unfold INTER_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   860
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   861
lemma INT_D [elim]: "b : (INT x:A. B x) ==> a:A ==> b: B a"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   862
  by auto
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   863
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   864
lemma INT_E [elim]: "b : (INT x:A. B x) ==> (b: B a ==> R) ==> (a~:A ==> R) ==> R"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   865
  -- {* "Classical" elimination -- by the Excluded Middle on @{prop "a:A"}. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   866
  by (unfold INTER_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   867
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   868
lemma INT_cong [cong]:
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   869
    "A = B ==> (!!x. x:B ==> C x = D x) ==> (INT x:A. C x) = (INT x:B. D x)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   870
  by (simp add: INTER_def)
7238
36e58620ffc8 replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents: 5931
diff changeset
   871
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   872
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   873
subsubsection {* Union *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   874
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
   875
lemma Union_iff [simp,noatp]: "(A : Union C) = (EX X:C. A:X)"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   876
  by (unfold Union_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   877
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   878
lemma UnionI [intro]: "X:C ==> A:X ==> A : Union C"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   879
  -- {* The order of the premises presupposes that @{term C} is rigid;
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   880
    @{term A} may be flexible. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   881
  by auto
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   882
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   883
lemma UnionE [elim!]: "A : Union C ==> (!!X. A:X ==> X:C ==> R) ==> R"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   884
  by (unfold Union_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   885
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   886
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   887
subsubsection {* Inter *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   888
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
   889
lemma Inter_iff [simp,noatp]: "(A : Inter C) = (ALL X:C. A:X)"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   890
  by (unfold Inter_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   891
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   892
lemma InterI [intro!]: "(!!X. X:C ==> A:X) ==> A : Inter C"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   893
  by (simp add: Inter_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   894
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   895
text {*
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   896
  \medskip A ``destruct'' rule -- every @{term X} in @{term C}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   897
  contains @{term A} as an element, but @{prop "A:X"} can hold when
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   898
  @{prop "X:C"} does not!  This rule is analogous to @{text spec}.
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   899
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   900
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   901
lemma InterD [elim]: "A : Inter C ==> X:C ==> A:X"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   902
  by auto
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   903
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   904
lemma InterE [elim]: "A : Inter C ==> (X~:C ==> R) ==> (A:X ==> R) ==> R"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   905
  -- {* ``Classical'' elimination rule -- does not require proving
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   906
    @{prop "X:C"}. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   907
  by (unfold Inter_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   908
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   909
text {*
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   910
  \medskip Image of a set under a function.  Frequently @{term b} does
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   911
  not have the syntactic form of @{term "f x"}.
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   912
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   913
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
   914
declare image_def [noatp]
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
   915
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   916
lemma image_eqI [simp, intro]: "b = f x ==> x:A ==> b : f`A"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   917
  by (unfold image_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   918
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   919
lemma imageI: "x : A ==> f x : f ` A"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   920
  by (rule image_eqI) (rule refl)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   921
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   922
lemma rev_image_eqI: "x:A ==> b = f x ==> b : f`A"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   923
  -- {* This version's more effective when we already have the
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   924
    required @{term x}. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   925
  by (unfold image_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   926
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   927
lemma imageE [elim!]:
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   928
  "b : (%x. f x)`A ==> (!!x. b = f x ==> x:A ==> P) ==> P"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   929
  -- {* The eta-expansion gives variable-name preservation. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   930
  by (unfold image_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   931
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   932
lemma image_Un: "f`(A Un B) = f`A Un f`B"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   933
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   934
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   935
lemma image_iff: "(z : f`A) = (EX x:A. z = f x)"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   936
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   937
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   938
lemma image_subset_iff: "(f`A \<subseteq> B) = (\<forall>x\<in>A. f x \<in> B)"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   939
  -- {* This rewrite rule would confuse users if made default. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   940
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   941
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   942
lemma subset_image_iff: "(B \<subseteq> f`A) = (EX AA. AA \<subseteq> A & B = f`AA)"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   943
  apply safe
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   944
   prefer 2 apply fast
14208
144f45277d5a misc tidying
paulson
parents: 14098
diff changeset
   945
  apply (rule_tac x = "{a. a : A & f a : B}" in exI, fast)
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   946
  done
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   947
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   948
lemma image_subsetI: "(!!x. x \<in> A ==> f x \<in> B) ==> f`A \<subseteq> B"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   949
  -- {* Replaces the three steps @{text subsetI}, @{text imageE},
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   950
    @{text hypsubst}, but breaks too many existing proofs. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   951
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   952
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   953
text {*
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   954
  \medskip Range of a function -- just a translation for image!
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   955
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   956
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   957
lemma range_eqI: "b = f x ==> b \<in> range f"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   958
  by simp
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   959
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   960
lemma rangeI: "f x \<in> range f"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   961
  by simp
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   962
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
   963
lemma rangeE [elim?]: "b \<in> range (\<lambda>x. f x) ==> (!!x. b = f x ==> P) ==> P"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   964
  by blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   965
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   966
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   967
subsubsection {* Set reasoning tools *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   968
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   969
text {*
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   970
  Rewrite rules for boolean case-splitting: faster than @{text
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   971
  "split_if [split]"}.
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   972
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   973
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   974
lemma split_if_eq1: "((if Q then x else y) = b) = ((Q --> x = b) & (~ Q --> y = b))"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   975
  by (rule split_if)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   976
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   977
lemma split_if_eq2: "(a = (if Q then x else y)) = ((Q --> a = x) & (~ Q --> a = y))"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   978
  by (rule split_if)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   980
text {*
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   981
  Split ifs on either side of the membership relation.  Not for @{text
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   982
  "[simp]"} -- can cause goals to blow up!
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   983
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   984
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   985
lemma split_if_mem1: "((if Q then x else y) : b) = ((Q --> x : b) & (~ Q --> y : b))"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   986
  by (rule split_if)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   987
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   988
lemma split_if_mem2: "(a : (if Q then x else y)) = ((Q --> a : x) & (~ Q --> a : y))"
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   989
  by (rule split_if)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   990
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   991
lemmas split_ifs = if_bool_eq_conj split_if_eq1 split_if_eq2 split_if_mem1 split_if_mem2
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   992
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   993
lemmas mem_simps =
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   994
  insert_iff empty_iff Un_iff Int_iff Compl_iff Diff_iff
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   995
  mem_Collect_eq UN_iff Union_iff INT_iff Inter_iff
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   996
  -- {* Each of these has ALREADY been added @{text "[simp]"} above. *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   997
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   998
(*Would like to add these, but the existing code only searches for the
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
   999
  outer-level constant, which in this case is just "op :"; we instead need
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1000
  to use term-nets to associate patterns with rules.  Also, if a rule fails to
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1001
  apply, then the formula should be kept.
19233
77ca20b0ed77 renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents: 19175
diff changeset
  1002
  [("HOL.uminus", Compl_iff RS iffD1), ("HOL.minus", [Diff_iff RS iffD1]),
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1003
   ("op Int", [IntD1,IntD2]),
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1004
   ("Collect", [CollectD]), ("Inter", [InterD]), ("INTER", [INT_D])]
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1005
 *)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1006
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1007
ML_setup {*
22139
539a63b98f76 tuned ML setup;
wenzelm
parents: 21833
diff changeset
  1008
  val mksimps_pairs = [("Ball", @{thms bspec})] @ mksimps_pairs;
17875
d81094515061 change_claset/simpset;
wenzelm
parents: 17784
diff changeset
  1009
  change_simpset (fn ss => ss setmksimps (mksimps mksimps_pairs));
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1010
*}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1011
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1012
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1013
subsubsection {* The ``proper subset'' relation *}
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1014
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
  1015
lemma psubsetI [intro!,noatp]: "A \<subseteq> B ==> A \<noteq> B ==> A \<subset> B"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1016
  by (unfold psubset_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1017
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
  1018
lemma psubsetE [elim!,noatp]: 
13624
17684cf64fda added the new elim rule psubsetE
paulson
parents: 13550
diff changeset
  1019
    "[|A \<subset> B;  [|A \<subseteq> B; ~ (B\<subseteq>A)|] ==> R|] ==> R"
17684cf64fda added the new elim rule psubsetE
paulson
parents: 13550
diff changeset
  1020
  by (unfold psubset_def) blast
17684cf64fda added the new elim rule psubsetE
paulson
parents: 13550
diff changeset
  1021
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1022
lemma psubset_insert_iff:
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1023
  "(A \<subset> insert x B) = (if x \<in> B then A \<subset> B else if x \<in> A then A - {x} \<subset> B else A \<subseteq> B)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1024
  by (auto simp add: psubset_def subset_insert_iff)
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1025
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1026
lemma psubset_eq: "(A \<subset> B) = (A \<subseteq> B & A \<noteq> B)"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1027
  by (simp only: psubset_def)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1028
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1029
lemma psubset_imp_subset: "A \<subset> B ==> A \<subseteq> B"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1030
  by (simp add: psubset_eq)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1031
14335
9c0b5e081037 conversion of Real/PReal to Isar script;
paulson
parents: 14302
diff changeset
  1032
lemma psubset_trans: "[| A \<subset> B; B \<subset> C |] ==> A \<subset> C"
9c0b5e081037 conversion of Real/PReal to Isar script;
paulson
parents: 14302
diff changeset
  1033
apply (unfold psubset_def)
9c0b5e081037 conversion of Real/PReal to Isar script;
paulson
parents: 14302
diff changeset
  1034
apply (auto dest: subset_antisym)
9c0b5e081037 conversion of Real/PReal to Isar script;
paulson
parents: 14302
diff changeset
  1035
done
9c0b5e081037 conversion of Real/PReal to Isar script;
paulson
parents: 14302
diff changeset
  1036
9c0b5e081037 conversion of Real/PReal to Isar script;
paulson
parents: 14302
diff changeset
  1037
lemma psubsetD: "[| A \<subset> B; c \<in> A |] ==> c \<in> B"
9c0b5e081037 conversion of Real/PReal to Isar script;
paulson
parents: 14302
diff changeset
  1038
apply (unfold psubset_def)
9c0b5e081037 conversion of Real/PReal to Isar script;
paulson
parents: 14302
diff changeset
  1039
apply (auto dest: subsetD)
9c0b5e081037 conversion of Real/PReal to Isar script;
paulson
parents: 14302
diff changeset
  1040
done
9c0b5e081037 conversion of Real/PReal to Isar script;
paulson
parents: 14302
diff changeset
  1041
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1042
lemma psubset_subset_trans: "A \<subset> B ==> B \<subseteq> C ==> A \<subset> C"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1043
  by (auto simp add: psubset_eq)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1044
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1045
lemma subset_psubset_trans: "A \<subseteq> B ==> B \<subset> C ==> A \<subset> C"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1046
  by (auto simp add: psubset_eq)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1047
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1048
lemma psubset_imp_ex_mem: "A \<subset> B ==> \<exists>b. b \<in> (B - A)"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1049
  by (unfold psubset_def) blast
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1050
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1051
lemma atomize_ball:
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1052
    "(!!x. x \<in> A ==> P x) == Trueprop (\<forall>x\<in>A. P x)"
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1053
  by (simp only: Ball_def atomize_all atomize_imp)
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1054
18832
6ab4de872a70 declare 'defn' rules;
wenzelm
parents: 18674
diff changeset
  1055
lemmas [symmetric, rulify] = atomize_ball
6ab4de872a70 declare 'defn' rules;
wenzelm
parents: 18674
diff changeset
  1056
  and [symmetric, defn] = atomize_ball
11979
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1057
0a3dace545c5 converted theory "Set";
wenzelm
parents: 11752
diff changeset
  1058
22455
f6f22aba2e0e added instance of sets as distributive lattices
haftmann
parents: 22439
diff changeset
  1059
subsection {* Further set-theory lemmas *}
f6f22aba2e0e added instance of sets as distributive lattices
haftmann
parents: 22439
diff changeset
  1060
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1061
subsubsection {* Derived rules involving subsets. *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1062
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1063
text {* @{text insert}. *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1064
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1065
lemma subset_insertI: "B \<subseteq> insert a B"
23878
bd651ecd4b8a simplified HOL bootstrap
haftmann
parents: 23857
diff changeset
  1066
  by (rule subsetI) (erule insertI2)
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1067
14302
6c24235e8d5d *** empty log message ***
nipkow
parents: 14208
diff changeset
  1068
lemma subset_insertI2: "A \<subseteq> B \<Longrightarrow> A \<subseteq> insert b B"
23878
bd651ecd4b8a simplified HOL bootstrap
haftmann
parents: 23857
diff changeset
  1069
  by blast
14302
6c24235e8d5d *** empty log message ***
nipkow
parents: 14208
diff changeset
  1070
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1071
lemma subset_insert: "x \<notin> A ==> (A \<subseteq> insert x B) = (A \<subseteq> B)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1072
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1073
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1074
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1075
text {* \medskip Big Union -- least upper bound of a set. *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1076
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1077
lemma Union_upper: "B \<in> A ==> B \<subseteq> Union A"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17508
diff changeset
  1078
  by (iprover intro: subsetI UnionI)
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1079
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1080
lemma Union_least: "(!!X. X \<in> A ==> X \<subseteq> C) ==> Union A \<subseteq> C"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17508
diff changeset
  1081
  by (iprover intro: subsetI elim: UnionE dest: subsetD)
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1082
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1083
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1084
text {* \medskip General union. *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1085
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1086
lemma UN_upper: "a \<in> A ==> B a \<subseteq> (\<Union>x\<in>A. B x)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1087
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1088
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1089
lemma UN_least: "(!!x. x \<in> A ==> B x \<subseteq> C) ==> (\<Union>x\<in>A. B x) \<subseteq> C"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17508
diff changeset
  1090
  by (iprover intro: subsetI elim: UN_E dest: subsetD)
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1091
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1092
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1093
text {* \medskip Big Intersection -- greatest lower bound of a set. *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1094
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1095
lemma Inter_lower: "B \<in> A ==> Inter A \<subseteq> B"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1096
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1097
14551
2cb6ff394bfb Various changes to HOL-Algebra;
ballarin
parents: 14479
diff changeset
  1098
lemma Inter_subset:
2cb6ff394bfb Various changes to HOL-Algebra;
ballarin
parents: 14479
diff changeset
  1099
  "[| !!X. X \<in> A ==> X \<subseteq> B; A ~= {} |] ==> \<Inter>A \<subseteq> B"
2cb6ff394bfb Various changes to HOL-Algebra;
ballarin
parents: 14479
diff changeset
  1100
  by blast
2cb6ff394bfb Various changes to HOL-Algebra;
ballarin
parents: 14479
diff changeset
  1101
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1102
lemma Inter_greatest: "(!!X. X \<in> A ==> C \<subseteq> X) ==> C \<subseteq> Inter A"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17508
diff changeset
  1103
  by (iprover intro: InterI subsetI dest: subsetD)
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1104
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1105
lemma INT_lower: "a \<in> A ==> (\<Inter>x\<in>A. B x) \<subseteq> B a"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1106
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1107
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1108
lemma INT_greatest: "(!!x. x \<in> A ==> C \<subseteq> B x) ==> C \<subseteq> (\<Inter>x\<in>A. B x)"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17508
diff changeset
  1109
  by (iprover intro: INT_I subsetI dest: subsetD)
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1110
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1111
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1112
text {* \medskip Finite Union -- the least upper bound of two sets. *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1113
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1114
lemma Un_upper1: "A \<subseteq> A \<union> B"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1115
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1116
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1117
lemma Un_upper2: "B \<subseteq> A \<union> B"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1118
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1119
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1120
lemma Un_least: "A \<subseteq> C ==> B \<subseteq> C ==> A \<union> B \<subseteq> C"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1121
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1122
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1123
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1124
text {* \medskip Finite Intersection -- the greatest lower bound of two sets. *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1125
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1126
lemma Int_lower1: "A \<inter> B \<subseteq> A"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1127
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1128
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1129
lemma Int_lower2: "A \<inter> B \<subseteq> B"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1130
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1131
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1132
lemma Int_greatest: "C \<subseteq> A ==> C \<subseteq> B ==> C \<subseteq> A \<inter> B"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1133
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1134
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1135
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1136
text {* \medskip Set difference. *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1137
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1138
lemma Diff_subset: "A - B \<subseteq> A"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1139
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1140
14302
6c24235e8d5d *** empty log message ***
nipkow
parents: 14208
diff changeset
  1141
lemma Diff_subset_conv: "(A - B \<subseteq> C) = (A \<subseteq> B \<union> C)"
6c24235e8d5d *** empty log message ***
nipkow
parents: 14208
diff changeset
  1142
by blast
6c24235e8d5d *** empty log message ***
nipkow
parents: 14208
diff changeset
  1143
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1144
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1145
subsubsection {* Equalities involving union, intersection, inclusion, etc. *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1146
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1147
text {* @{text "{}"}. *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1148
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1149
lemma Collect_const [simp]: "{s. P} = (if P then UNIV else {})"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1150
  -- {* supersedes @{text "Collect_False_empty"} *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1151
  by auto
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1152
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1153
lemma subset_empty [simp]: "(A \<subseteq> {}) = (A = {})"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1154
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1155
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1156
lemma not_psubset_empty [iff]: "\<not> (A < {})"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1157
  by (unfold psubset_def) blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1158
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1159
lemma Collect_empty_eq [simp]: "(Collect P = {}) = (\<forall>x. \<not> P x)"
18423
d7859164447f new lemmas
nipkow
parents: 18413
diff changeset
  1160
by blast
d7859164447f new lemmas
nipkow
parents: 18413
diff changeset
  1161
d7859164447f new lemmas
nipkow
parents: 18413
diff changeset
  1162
lemma empty_Collect_eq [simp]: "({} = Collect P) = (\<forall>x. \<not> P x)"
d7859164447f new lemmas
nipkow
parents: 18413
diff changeset
  1163
by blast
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1164
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1165
lemma Collect_neg_eq: "{x. \<not> P x} = - {x. P x}"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1166
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1167
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1168
lemma Collect_disj_eq: "{x. P x | Q x} = {x. P x} \<union> {x. Q x}"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1169
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1170
14812
4b2c006d0534 new theorem Collect_imp_eq
paulson
parents: 14804
diff changeset
  1171
lemma Collect_imp_eq: "{x. P x --> Q x} = -{x. P x} \<union> {x. Q x}"
4b2c006d0534 new theorem Collect_imp_eq
paulson
parents: 14804
diff changeset
  1172
  by blast
4b2c006d0534 new theorem Collect_imp_eq
paulson
parents: 14804
diff changeset
  1173
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1174
lemma Collect_conj_eq: "{x. P x & Q x} = {x. P x} \<inter> {x. Q x}"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1175
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1176
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1177
lemma Collect_all_eq: "{x. \<forall>y. P x y} = (\<Inter>y. {x. P x y})"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1178
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1179
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1180
lemma Collect_ball_eq: "{x. \<forall>y\<in>A. P x y} = (\<Inter>y\<in>A. {x. P x y})"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1181
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1182
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
  1183
lemma Collect_ex_eq [noatp]: "{x. \<exists>y. P x y} = (\<Union>y. {x. P x y})"
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1184
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1185
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
  1186
lemma Collect_bex_eq [noatp]: "{x. \<exists>y\<in>A. P x y} = (\<Union>y\<in>A. {x. P x y})"
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1187
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1188
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1189
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1190
text {* \medskip @{text insert}. *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1191
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1192
lemma insert_is_Un: "insert a A = {a} Un A"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1193
  -- {* NOT SUITABLE FOR REWRITING since @{text "{a} == insert a {}"} *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1194
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1195
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1196
lemma insert_not_empty [simp]: "insert a A \<noteq> {}"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1197
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1198
17715
68583762ebdb a name for empty_not_insert
paulson
parents: 17702
diff changeset
  1199
lemmas empty_not_insert = insert_not_empty [symmetric, standard]
68583762ebdb a name for empty_not_insert
paulson
parents: 17702
diff changeset
  1200
declare empty_not_insert [simp]
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1201
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1202
lemma insert_absorb: "a \<in> A ==> insert a A = A"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1203
  -- {* @{text "[simp]"} causes recursive calls when there are nested inserts *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1204
  -- {* with \emph{quadratic} running time *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1205
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1206
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1207
lemma insert_absorb2 [simp]: "insert x (insert x A) = insert x A"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1208
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1209
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1210
lemma insert_commute: "insert x (insert y A) = insert y (insert x A)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1211
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1212
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1213
lemma insert_subset [simp]: "(insert x A \<subseteq> B) = (x \<in> B & A \<subseteq> B)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1214
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1215
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1216
lemma mk_disjoint_insert: "a \<in> A ==> \<exists>B. A = insert a B & a \<notin> B"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1217
  -- {* use new @{text B} rather than @{text "A - {a}"} to avoid infinite unfolding *}
14208
144f45277d5a misc tidying
paulson
parents: 14098
diff changeset
  1218
  apply (rule_tac x = "A - {a}" in exI, blast)
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1219
  done
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1220
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1221
lemma insert_Collect: "insert a (Collect P) = {u. u \<noteq> a --> P u}"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1222
  by auto
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1223
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1224
lemma UN_insert_distrib: "u \<in> A ==> (\<Union>x\<in>A. insert a (B x)) = insert a (\<Union>x\<in>A. B x)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1225
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1226
14302
6c24235e8d5d *** empty log message ***
nipkow
parents: 14208
diff changeset
  1227
lemma insert_inter_insert[simp]: "insert a A \<inter> insert a B = insert a (A \<inter> B)"
14742
dde816115d6a New simp rules added:
mehta
parents: 14692
diff changeset
  1228
  by blast
14302
6c24235e8d5d *** empty log message ***
nipkow
parents: 14208
diff changeset
  1229
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
  1230
lemma insert_disjoint [simp,noatp]:
13103
66659a4b16f6 Added insert_disjoint and disjoint_insert [simp], and simplified proofs
nipkow
parents: 12937
diff changeset
  1231
 "(insert a A \<inter> B = {}) = (a \<notin> B \<and> A \<inter> B = {})"
14742
dde816115d6a New simp rules added:
mehta
parents: 14692
diff changeset
  1232
 "({} = insert a A \<inter> B) = (a \<notin> B \<and> {} = A \<inter> B)"
16773
33c4d8fe6f78 tweaked
paulson
parents: 16636
diff changeset
  1233
  by auto
13103
66659a4b16f6 Added insert_disjoint and disjoint_insert [simp], and simplified proofs
nipkow
parents: 12937
diff changeset
  1234
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
  1235
lemma disjoint_insert [simp,noatp]:
13103
66659a4b16f6 Added insert_disjoint and disjoint_insert [simp], and simplified proofs
nipkow
parents: 12937
diff changeset
  1236
 "(B \<inter> insert a A = {}) = (a \<notin> B \<and> B \<inter> A = {})"
14742
dde816115d6a New simp rules added:
mehta
parents: 14692
diff changeset
  1237
 "({} = A \<inter> insert b B) = (b \<notin> A \<and> {} = A \<inter> B)"
16773
33c4d8fe6f78 tweaked
paulson
parents: 16636
diff changeset
  1238
  by auto
14742
dde816115d6a New simp rules added:
mehta
parents: 14692
diff changeset
  1239
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1240
text {* \medskip @{text image}. *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1241
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1242
lemma image_empty [simp]: "f`{} = {}"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1243
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1244
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1245
lemma image_insert [simp]: "f ` insert a B = insert (f a) (f`B)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1246
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1247
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1248
lemma image_constant: "x \<in> A ==> (\<lambda>x. c) ` A = {c}"
16773
33c4d8fe6f78 tweaked
paulson
parents: 16636
diff changeset
  1249
  by auto
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1250
21316
4d913b8bccf1 image_constant_conv no longer [simp]
nipkow
parents: 21312
diff changeset
  1251
lemma image_constant_conv: "(%x. c) ` A = (if A = {} then {} else {c})"
21312
1d39091a3208 started reorgnization of lattice theories
nipkow
parents: 21210
diff changeset
  1252
by auto
1d39091a3208 started reorgnization of lattice theories
nipkow
parents: 21210
diff changeset
  1253
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1254
lemma image_image: "f ` (g ` A) = (\<lambda>x. f (g x)) ` A"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1255
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1256
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1257
lemma insert_image [simp]: "x \<in> A ==> insert (f x) (f`A) = f`A"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1258
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1259
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1260
lemma image_is_empty [iff]: "(f`A = {}) = (A = {})"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1261
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1262
16773
33c4d8fe6f78 tweaked
paulson
parents: 16636
diff changeset
  1263
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
  1264
lemma image_Collect [noatp]: "f ` {x. P x} = {f x | x. P x}"
16773
33c4d8fe6f78 tweaked
paulson
parents: 16636
diff changeset
  1265
  -- {* NOT suitable as a default simprule: the RHS isn't simpler than the LHS,
33c4d8fe6f78 tweaked
paulson
parents: 16636
diff changeset
  1266
      with its implicit quantifier and conjunction.  Also image enjoys better
33c4d8fe6f78 tweaked
paulson
parents: 16636
diff changeset
  1267
      equational properties than does the RHS. *}
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1268
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1269
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1270
lemma if_image_distrib [simp]:
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1271
  "(\<lambda>x. if P x then f x else g x) ` S
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1272
    = (f ` (S \<inter> {x. P x})) \<union> (g ` (S \<inter> {x. \<not> P x}))"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1273
  by (auto simp add: image_def)
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1274
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1275
lemma image_cong: "M = N ==> (!!x. x \<in> N ==> f x = g x) ==> f`M = g`N"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1276
  by (simp add: image_def)
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1277
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1278
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1279
text {* \medskip @{text range}. *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1280
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
  1281
lemma full_SetCompr_eq [noatp]: "{u. \<exists>x. u = f x} = range f"
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1282
  by auto
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1283
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1284
lemma range_composition [simp]: "range (\<lambda>x. f (g x)) = f`range g"
14208
144f45277d5a misc tidying
paulson
parents: 14098
diff changeset
  1285
by (subst image_image, simp)
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1286
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1287
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1288
text {* \medskip @{text Int} *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1289
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1290
lemma Int_absorb [simp]: "A \<inter> A = A"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1291
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1292
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1293
lemma Int_left_absorb: "A \<inter> (A \<inter> B) = A \<inter> B"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1294
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1295
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1296
lemma Int_commute: "A \<inter> B = B \<inter> A"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1297
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1298
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1299
lemma Int_left_commute: "A \<inter> (B \<inter> C) = B \<inter> (A \<inter> C)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1300
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1301
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1302
lemma Int_assoc: "(A \<inter> B) \<inter> C = A \<inter> (B \<inter> C)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1303
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1304
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1305
lemmas Int_ac = Int_assoc Int_left_absorb Int_commute Int_left_commute
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1306
  -- {* Intersection is an AC-operator *}
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1307
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1308
lemma Int_absorb1: "B \<subseteq> A ==> A \<inter> B = B"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1309
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1310
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1311
lemma Int_absorb2: "A \<subseteq> B ==> A \<inter> B = A"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1312
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1313
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1314
lemma Int_empty_left [simp]: "{} \<inter> B = {}"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1315
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1316
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1317
lemma Int_empty_right [simp]: "A \<inter> {} = {}"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1318
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1319
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1320
lemma disjoint_eq_subset_Compl: "(A \<inter> B = {}) = (A \<subseteq> -B)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1321
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1322
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1323
lemma disjoint_iff_not_equal: "(A \<inter> B = {}) = (\<forall>x\<in>A. \<forall>y\<in>B. x \<noteq> y)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1324
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1325
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1326
lemma Int_UNIV_left [simp]: "UNIV \<inter> B = B"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1327
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1328
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1329
lemma Int_UNIV_right [simp]: "A \<inter> UNIV = A"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1330
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1331
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1332
lemma Int_eq_Inter: "A \<inter> B = \<Inter>{A, B}"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1333
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1334
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1335
lemma Int_Un_distrib: "A \<inter> (B \<union> C) = (A \<inter> B) \<union> (A \<inter> C)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1336
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1337
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1338
lemma Int_Un_distrib2: "(B \<union> C) \<inter> A = (B \<inter> A) \<union> (C \<inter> A)"
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1339
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1340
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
  1341
lemma Int_UNIV [simp,noatp]: "(A \<inter> B = UNIV) = (A = UNIV & B = UNIV)"
12897
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1342
  by blast
f4d10ad0ea7b converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents: 12633
diff changeset
  1343
15102
04b0e943fcc9 new simprules Int_subset_iff and Un_subset_iff
paulson
parents: 14981
diff changeset
  1344
lemma Int_subset_iff [simp]: "(C \<subseteq> A \<inter> B) = (C \<subseteq> A & C \<subseteq> B)"
12897