src/HOL/Set.ML
author paulson
Wed, 02 Dec 1998 15:53:05 +0100
changeset 6006 d2e271b8d651
parent 5931 325300576da7
child 6171 cd237a10cbf8
permissions -rw-r--r--
new rule rev_bexI
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1465
5d7a7e439cec expanded tabs
clasohm
parents: 923
diff changeset
     1
(*  Title:      HOL/set
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     2
    ID:         $Id$
1465
5d7a7e439cec expanded tabs
clasohm
parents: 923
diff changeset
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     4
    Copyright   1991  University of Cambridge
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     5
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents: 1937
diff changeset
     6
Set theory for higher-order logic.  A set is simply a predicate.
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     7
*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     8
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     9
open Set;
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    10
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
    11
section "Relating predicates and sets";
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
    12
3469
61d927bd57ec Now Collect_mem_eq is a default simprule (how could it have ever been omitted?
paulson
parents: 3420
diff changeset
    13
Addsimps [Collect_mem_eq];
61d927bd57ec Now Collect_mem_eq is a default simprule (how could it have ever been omitted?
paulson
parents: 3420
diff changeset
    14
AddIffs  [mem_Collect_eq];
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    15
5143
b94cd208f073 Removal of leading "\!\!..." from most Goal commands
paulson
parents: 5069
diff changeset
    16
Goal "P(a) ==> a : {x. P(x)}";
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    17
by (Asm_simp_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    18
qed "CollectI";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    19
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
    20
Goal "a : {x. P(x)} ==> P(a)";
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    21
by (Asm_full_simp_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    22
qed "CollectD";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    23
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
    24
val [prem] = Goal "[| !!x. (x:A) = (x:B) |] ==> A = B";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    25
by (rtac (prem RS ext RS arg_cong RS box_equals) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    26
by (rtac Collect_mem_eq 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    27
by (rtac Collect_mem_eq 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    28
qed "set_ext";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    29
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
    30
val [prem] = Goal "[| !!x. P(x)=Q(x) |] ==> {x. P(x)} = {x. Q(x)}";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    31
by (rtac (prem RS ext RS arg_cong) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    32
qed "Collect_cong";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    33
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    34
val CollectE = make_elim CollectD;
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    35
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    36
AddSIs [CollectI];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    37
AddSEs [CollectE];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    38
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    39
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
    40
section "Bounded quantifiers";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    41
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
    42
val prems = Goalw [Ball_def]
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    43
    "[| !!x. x:A ==> P(x) |] ==> ! x:A. P(x)";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    44
by (REPEAT (ares_tac (prems @ [allI,impI]) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    45
qed "ballI";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    46
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
    47
Goalw [Ball_def] "[| ! x:A. P(x);  x:A |] ==> P(x)";
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
    48
by (Blast_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    49
qed "bspec";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    50
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
    51
val major::prems = Goalw [Ball_def]
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    52
    "[| ! x:A. P(x);  P(x) ==> Q;  x~:A ==> Q |] ==> Q";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    53
by (rtac (major RS spec RS impCE) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    54
by (REPEAT (eresolve_tac prems 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    55
qed "ballE";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    56
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    57
(*Takes assumptions ! x:A.P(x) and a:A; creates assumption P(a)*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    58
fun ball_tac i = etac ballE i THEN contr_tac (i+1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    59
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    60
AddSIs [ballI];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    61
AddEs  [ballE];
5521
7970832271cc added wrapper for bspec
oheimb
parents: 5490
diff changeset
    62
(* gives better instantiation for bound: *)
7970832271cc added wrapper for bspec
oheimb
parents: 5490
diff changeset
    63
claset_ref() := claset() addWrapper ("bspec", fn tac2 =>
7970832271cc added wrapper for bspec
oheimb
parents: 5490
diff changeset
    64
			 (dtac bspec THEN' atac) APPEND' tac2);
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    65
6006
d2e271b8d651 new rule rev_bexI
paulson
parents: 5931
diff changeset
    66
(*Normally the best argument order: P(x) constrains the choice of x:A*)
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
    67
Goalw [Bex_def] "[| P(x);  x:A |] ==> ? x:A. P(x)";
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
    68
by (Blast_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    69
qed "bexI";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    70
6006
d2e271b8d651 new rule rev_bexI
paulson
parents: 5931
diff changeset
    71
(*The best argument order when there is only one x:A*)
d2e271b8d651 new rule rev_bexI
paulson
parents: 5931
diff changeset
    72
Goalw [Bex_def] "[| x:A;  P(x) |] ==> ? x:A. P(x)";
d2e271b8d651 new rule rev_bexI
paulson
parents: 5931
diff changeset
    73
by (Blast_tac 1);
d2e271b8d651 new rule rev_bexI
paulson
parents: 5931
diff changeset
    74
qed "rev_bexI";
d2e271b8d651 new rule rev_bexI
paulson
parents: 5931
diff changeset
    75
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    76
qed_goal "bexCI" Set.thy 
5521
7970832271cc added wrapper for bspec
oheimb
parents: 5490
diff changeset
    77
   "[| ! x:A. ~P(x) ==> P(a);  a:A |] ==> ? x:A. P(x)" (fn prems =>
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    78
  [ (rtac classical 1),
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    79
    (REPEAT (ares_tac (prems@[bexI,ballI,notI,notE]) 1))  ]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    80
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
    81
val major::prems = Goalw [Bex_def]
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    82
    "[| ? x:A. P(x);  !!x. [| x:A; P(x) |] ==> Q  |] ==> Q";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    83
by (rtac (major RS exE) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    84
by (REPEAT (eresolve_tac (prems @ [asm_rl,conjE]) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    85
qed "bexE";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    86
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    87
AddIs  [bexI];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    88
AddSEs [bexE];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    89
3420
02dc9c5b035f New miniscoping rules ball_triv and bex_triv
paulson
parents: 3222
diff changeset
    90
(*Trival rewrite rule*)
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4830
diff changeset
    91
Goal "(! x:A. P) = ((? x. x:A) --> P)";
4089
96fba19bcbe2 isatool fixclasimp;
wenzelm
parents: 4059
diff changeset
    92
by (simp_tac (simpset() addsimps [Ball_def]) 1);
3420
02dc9c5b035f New miniscoping rules ball_triv and bex_triv
paulson
parents: 3222
diff changeset
    93
qed "ball_triv";
1816
b03dba9116d4 New rewrites for vacuous quantification
paulson
parents: 1776
diff changeset
    94
1882
67f49e8c4355 Proved bex_False
paulson
parents: 1841
diff changeset
    95
(*Dual form for existentials*)
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4830
diff changeset
    96
Goal "(? x:A. P) = ((? x. x:A) & P)";
4089
96fba19bcbe2 isatool fixclasimp;
wenzelm
parents: 4059
diff changeset
    97
by (simp_tac (simpset() addsimps [Bex_def]) 1);
3420
02dc9c5b035f New miniscoping rules ball_triv and bex_triv
paulson
parents: 3222
diff changeset
    98
qed "bex_triv";
1882
67f49e8c4355 Proved bex_False
paulson
parents: 1841
diff changeset
    99
3420
02dc9c5b035f New miniscoping rules ball_triv and bex_triv
paulson
parents: 3222
diff changeset
   100
Addsimps [ball_triv, bex_triv];
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   101
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   102
(** Congruence rules **)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   103
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   104
val prems = Goal
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   105
    "[| A=B;  !!x. x:B ==> P(x) = Q(x) |] ==> \
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   106
\    (! x:A. P(x)) = (! x:B. Q(x))";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   107
by (resolve_tac (prems RL [ssubst]) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   108
by (REPEAT (ares_tac [ballI,iffI] 1
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   109
     ORELSE eresolve_tac ([make_elim bspec, mp] @ (prems RL [iffE])) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   110
qed "ball_cong";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   111
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   112
val prems = Goal
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   113
    "[| A=B;  !!x. x:B ==> P(x) = Q(x) |] ==> \
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   114
\    (? x:A. P(x)) = (? x:B. Q(x))";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   115
by (resolve_tac (prems RL [ssubst]) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   116
by (REPEAT (etac bexE 1
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   117
     ORELSE ares_tac ([bexI,iffI] @ (prems RL [iffD1,iffD2])) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   118
qed "bex_cong";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   119
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   120
section "Subsets";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   121
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   122
val prems = Goalw [subset_def] "(!!x. x:A ==> x:B) ==> A <= B";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   123
by (REPEAT (ares_tac (prems @ [ballI]) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   124
qed "subsetI";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   125
5649
1bac26652f45 Uses overload_1st_set to specify overloading
paulson
parents: 5600
diff changeset
   126
(*Map the type ('a set => anything) to just 'a.
1bac26652f45 Uses overload_1st_set to specify overloading
paulson
parents: 5600
diff changeset
   127
  For overloading constants whose first argument has type "'a set" *)
1bac26652f45 Uses overload_1st_set to specify overloading
paulson
parents: 5600
diff changeset
   128
fun overload_1st_set s = Blast.overloaded (s, HOLogic.dest_setT o domain_type);
1bac26652f45 Uses overload_1st_set to specify overloading
paulson
parents: 5600
diff changeset
   129
4059
59c1422c9da5 New Blast_tac (and minor tidying...)
paulson
parents: 3960
diff changeset
   130
(*While (:) is not, its type must be kept
59c1422c9da5 New Blast_tac (and minor tidying...)
paulson
parents: 3960
diff changeset
   131
  for overloading of = to work.*)
4240
8ba60a4cd380 Renamed "overload" to "overloaded" for sml/nj compatibility
paulson
parents: 4231
diff changeset
   132
Blast.overloaded ("op :", domain_type);
5649
1bac26652f45 Uses overload_1st_set to specify overloading
paulson
parents: 5600
diff changeset
   133
1bac26652f45 Uses overload_1st_set to specify overloading
paulson
parents: 5600
diff changeset
   134
overload_1st_set "Ball";		(*need UNION, INTER also?*)
1bac26652f45 Uses overload_1st_set to specify overloading
paulson
parents: 5600
diff changeset
   135
overload_1st_set "Bex";
4059
59c1422c9da5 New Blast_tac (and minor tidying...)
paulson
parents: 3960
diff changeset
   136
4469
399868bf8444 Overloading info for image
paulson
parents: 4434
diff changeset
   137
(*Image: retain the type of the set being expressed*)
5336
721bf1a13f1a fixed overloading of "image"
paulson
parents: 5318
diff changeset
   138
Blast.overloaded ("op ``", domain_type);
2881
62ecde1015ae Declares overloading for set-theoretic constants
paulson
parents: 2858
diff changeset
   139
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   140
(*Rule in Modus Ponens style*)
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   141
Goalw [subset_def] "[| A <= B;  c:A |] ==> c:B";
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   142
by (Blast_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   143
qed "subsetD";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   144
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   145
(*The same, with reversed premises for use with etac -- cf rev_mp*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   146
qed_goal "rev_subsetD" Set.thy "[| c:A;  A <= B |] ==> c:B"
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   147
 (fn prems=>  [ (REPEAT (resolve_tac (prems@[subsetD]) 1)) ]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   148
1920
df683ce7aad8 Added impOfSubs
paulson
parents: 1882
diff changeset
   149
(*Converts A<=B to x:A ==> x:B*)
df683ce7aad8 Added impOfSubs
paulson
parents: 1882
diff changeset
   150
fun impOfSubs th = th RSN (2, rev_subsetD);
df683ce7aad8 Added impOfSubs
paulson
parents: 1882
diff changeset
   151
1841
8e5e2fef6d26 Added contra_subsetD and rev_contra_subsetD
paulson
parents: 1816
diff changeset
   152
qed_goal "contra_subsetD" Set.thy "!!c. [| A <= B; c ~: B |] ==> c ~: A"
8e5e2fef6d26 Added contra_subsetD and rev_contra_subsetD
paulson
parents: 1816
diff changeset
   153
 (fn prems=>  [ (REPEAT (eresolve_tac [asm_rl, contrapos, subsetD] 1)) ]);
8e5e2fef6d26 Added contra_subsetD and rev_contra_subsetD
paulson
parents: 1816
diff changeset
   154
8e5e2fef6d26 Added contra_subsetD and rev_contra_subsetD
paulson
parents: 1816
diff changeset
   155
qed_goal "rev_contra_subsetD" Set.thy "!!c. [| c ~: B;  A <= B |] ==> c ~: A"
8e5e2fef6d26 Added contra_subsetD and rev_contra_subsetD
paulson
parents: 1816
diff changeset
   156
 (fn prems=>  [ (REPEAT (eresolve_tac [asm_rl, contrapos, subsetD] 1)) ]);
8e5e2fef6d26 Added contra_subsetD and rev_contra_subsetD
paulson
parents: 1816
diff changeset
   157
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   158
(*Classical elimination rule*)
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   159
val major::prems = Goalw [subset_def] 
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   160
    "[| A <= B;  c~:A ==> P;  c:B ==> P |] ==> P";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   161
by (rtac (major RS ballE) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   162
by (REPEAT (eresolve_tac prems 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   163
qed "subsetCE";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   164
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   165
(*Takes assumptions A<=B; c:A and creates the assumption c:B *)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   166
fun set_mp_tac i = etac subsetCE i  THEN  mp_tac i;
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   167
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   168
AddSIs [subsetI];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   169
AddEs  [subsetD, subsetCE];
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   170
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   171
qed_goal "subset_refl" Set.thy "A <= (A::'a set)"
4059
59c1422c9da5 New Blast_tac (and minor tidying...)
paulson
parents: 3960
diff changeset
   172
 (fn _=> [Fast_tac 1]);		(*Blast_tac would try order_refl and fail*)
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   173
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   174
Goal "[| A<=B;  B<=C |] ==> A<=(C::'a set)";
2891
d8f254ad1ab9 Calls Blast_tac
paulson
parents: 2881
diff changeset
   175
by (Blast_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   176
qed "subset_trans";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   177
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   178
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   179
section "Equality";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   180
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   181
(*Anti-symmetry of the subset relation*)
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   182
Goal "[| A <= B;  B <= A |] ==> A = (B::'a set)";
5318
72bf8039b53f expandshort
paulson
parents: 5316
diff changeset
   183
by (rtac set_ext 1);
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   184
by (blast_tac (claset() addIs [subsetD]) 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   185
qed "subset_antisym";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   186
val equalityI = subset_antisym;
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   187
1762
6e481897a811 equalityI is now added to default claset
berghofe
parents: 1760
diff changeset
   188
AddSIs [equalityI];
6e481897a811 equalityI is now added to default claset
berghofe
parents: 1760
diff changeset
   189
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   190
(* Equality rules from ZF set theory -- are they appropriate here? *)
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   191
Goal "A = B ==> A<=(B::'a set)";
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   192
by (etac ssubst 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   193
by (rtac subset_refl 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   194
qed "equalityD1";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   195
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   196
Goal "A = B ==> B<=(A::'a set)";
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   197
by (etac ssubst 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   198
by (rtac subset_refl 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   199
qed "equalityD2";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   200
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   201
val prems = Goal
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   202
    "[| A = B;  [| A<=B; B<=(A::'a set) |] ==> P |]  ==>  P";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   203
by (resolve_tac prems 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   204
by (REPEAT (resolve_tac (prems RL [equalityD1,equalityD2]) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   205
qed "equalityE";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   206
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   207
val major::prems = Goal
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   208
    "[| A = B;  [| c:A; c:B |] ==> P;  [| c~:A; c~:B |] ==> P |]  ==>  P";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   209
by (rtac (major RS equalityE) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   210
by (REPEAT (contr_tac 1 ORELSE eresolve_tac ([asm_rl,subsetCE]@prems) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   211
qed "equalityCE";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   212
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   213
(*Lemma for creating induction formulae -- for "pattern matching" on p
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   214
  To make the induction hypotheses usable, apply "spec" or "bspec" to
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   215
  put universal quantifiers over the free variables in p. *)
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   216
val prems = Goal 
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   217
    "[| p:A;  !!z. z:A ==> p=z --> R |] ==> R";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   218
by (rtac mp 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   219
by (REPEAT (resolve_tac (refl::prems) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   220
qed "setup_induction";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   221
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   222
4159
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   223
section "The universal set -- UNIV";
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   224
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   225
qed_goalw "UNIV_I" Set.thy [UNIV_def] "x : UNIV"
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   226
  (fn _ => [rtac CollectI 1, rtac TrueI 1]);
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   227
4434
75f38104ff80 UNIV_I no longer counts as safe
paulson
parents: 4423
diff changeset
   228
Addsimps [UNIV_I];
75f38104ff80 UNIV_I no longer counts as safe
paulson
parents: 4423
diff changeset
   229
AddIs    [UNIV_I];  (*unsafe makes it less likely to cause problems*)
4159
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   230
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   231
qed_goal "subset_UNIV" Set.thy "A <= UNIV"
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   232
  (fn _ => [rtac subsetI 1, rtac UNIV_I 1]);
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   233
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   234
(** Eta-contracting these two rules (to remove P) causes them to be ignored
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   235
    because of their interaction with congruence rules. **)
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   236
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4830
diff changeset
   237
Goalw [Ball_def] "Ball UNIV P = All P";
4159
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   238
by (Simp_tac 1);
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   239
qed "ball_UNIV";
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   240
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4830
diff changeset
   241
Goalw [Bex_def] "Bex UNIV P = Ex P";
4159
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   242
by (Simp_tac 1);
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   243
qed "bex_UNIV";
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   244
Addsimps [ball_UNIV, bex_UNIV];
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   245
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   246
2858
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   247
section "The empty set -- {}";
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   248
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   249
qed_goalw "empty_iff" Set.thy [empty_def] "(c : {}) = False"
2891
d8f254ad1ab9 Calls Blast_tac
paulson
parents: 2881
diff changeset
   250
 (fn _ => [ (Blast_tac 1) ]);
2858
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   251
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   252
Addsimps [empty_iff];
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   253
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   254
qed_goal "emptyE" Set.thy "!!a. a:{} ==> P"
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   255
 (fn _ => [Full_simp_tac 1]);
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   256
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   257
AddSEs [emptyE];
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   258
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   259
qed_goal "empty_subsetI" Set.thy "{} <= A"
2891
d8f254ad1ab9 Calls Blast_tac
paulson
parents: 2881
diff changeset
   260
 (fn _ => [ (Blast_tac 1) ]);
2858
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   261
5256
e6983301ce5e Renamed equals0D to equals0E
paulson
parents: 5237
diff changeset
   262
(*One effect is to delete the ASSUMPTION {} <= A*)
e6983301ce5e Renamed equals0D to equals0E
paulson
parents: 5237
diff changeset
   263
AddIffs [empty_subsetI];
e6983301ce5e Renamed equals0D to equals0E
paulson
parents: 5237
diff changeset
   264
2858
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   265
qed_goal "equals0I" Set.thy "[| !!y. y:A ==> False |] ==> A={}"
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   266
 (fn [prem]=>
4089
96fba19bcbe2 isatool fixclasimp;
wenzelm
parents: 4059
diff changeset
   267
  [ (blast_tac (claset() addIs [prem RS FalseE]) 1) ]);
2858
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   268
5256
e6983301ce5e Renamed equals0D to equals0E
paulson
parents: 5237
diff changeset
   269
(*Use for reasoning about disjointness: A Int B = {} *)
5450
fe9d103464a4 Changed equals0E back to equals0D and gave it the correct destruct form
paulson
parents: 5336
diff changeset
   270
qed_goal "equals0D" Set.thy "!!a. A={} ==> a ~: A"
2891
d8f254ad1ab9 Calls Blast_tac
paulson
parents: 2881
diff changeset
   271
 (fn _ => [ (Blast_tac 1) ]);
2858
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   272
5450
fe9d103464a4 Changed equals0E back to equals0D and gave it the correct destruct form
paulson
parents: 5336
diff changeset
   273
AddDs [equals0D, sym RS equals0D];
5256
e6983301ce5e Renamed equals0D to equals0E
paulson
parents: 5237
diff changeset
   274
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4830
diff changeset
   275
Goalw [Ball_def] "Ball {} P = True";
4159
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   276
by (Simp_tac 1);
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   277
qed "ball_empty";
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   278
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4830
diff changeset
   279
Goalw [Bex_def] "Bex {} P = False";
4159
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   280
by (Simp_tac 1);
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   281
qed "bex_empty";
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   282
Addsimps [ball_empty, bex_empty];
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   283
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4830
diff changeset
   284
Goal "UNIV ~= {}";
4159
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   285
by (blast_tac (claset() addEs [equalityE]) 1);
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   286
qed "UNIV_not_empty";
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   287
AddIffs [UNIV_not_empty];
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   288
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   289
2858
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   290
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   291
section "The Powerset operator -- Pow";
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   292
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   293
qed_goalw "Pow_iff" Set.thy [Pow_def] "(A : Pow(B)) = (A <= B)"
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   294
 (fn _ => [ (Asm_simp_tac 1) ]);
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   295
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   296
AddIffs [Pow_iff]; 
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   297
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   298
qed_goalw "PowI" Set.thy [Pow_def] "!!A B. A <= B ==> A : Pow(B)"
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   299
 (fn _ => [ (etac CollectI 1) ]);
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   300
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   301
qed_goalw "PowD" Set.thy [Pow_def] "!!A B. A : Pow(B)  ==>  A<=B"
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   302
 (fn _=> [ (etac CollectD 1) ]);
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   303
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   304
val Pow_bottom = empty_subsetI RS PowI;        (* {}: Pow(B) *)
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   305
val Pow_top = subset_refl RS PowI;             (* A : Pow(A) *)
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   306
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   307
5931
325300576da7 Finally removing "Compl" from HOL
paulson
parents: 5649
diff changeset
   308
section "Set complement";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   309
5490
85855f65d0c6 From Compl(A) to -A
paulson
parents: 5450
diff changeset
   310
qed_goalw "Compl_iff" Set.thy [Compl_def] "(c : -A) = (c~:A)"
2891
d8f254ad1ab9 Calls Blast_tac
paulson
parents: 2881
diff changeset
   311
 (fn _ => [ (Blast_tac 1) ]);
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   312
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   313
Addsimps [Compl_iff];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   314
5490
85855f65d0c6 From Compl(A) to -A
paulson
parents: 5450
diff changeset
   315
val prems = Goalw [Compl_def] "[| c:A ==> False |] ==> c : -A";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   316
by (REPEAT (ares_tac (prems @ [CollectI,notI]) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   317
qed "ComplI";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   318
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   319
(*This form, with negated conclusion, works well with the Classical prover.
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   320
  Negated assumptions behave like formulae on the right side of the notional
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   321
  turnstile...*)
5490
85855f65d0c6 From Compl(A) to -A
paulson
parents: 5450
diff changeset
   322
Goalw [Compl_def] "c : -A ==> c~:A";
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   323
by (etac CollectD 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   324
qed "ComplD";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   325
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   326
val ComplE = make_elim ComplD;
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   327
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   328
AddSIs [ComplI];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   329
AddSEs [ComplE];
1640
581165679095 Added more _iff rewrites for Compl, Un, Int
paulson
parents: 1618
diff changeset
   330
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   331
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   332
section "Binary union -- Un";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   333
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   334
qed_goalw "Un_iff" Set.thy [Un_def] "(c : A Un B) = (c:A | c:B)"
2891
d8f254ad1ab9 Calls Blast_tac
paulson
parents: 2881
diff changeset
   335
 (fn _ => [ Blast_tac 1 ]);
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   336
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   337
Addsimps [Un_iff];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   338
5143
b94cd208f073 Removal of leading "\!\!..." from most Goal commands
paulson
parents: 5069
diff changeset
   339
Goal "c:A ==> c : A Un B";
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   340
by (Asm_simp_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   341
qed "UnI1";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   342
5143
b94cd208f073 Removal of leading "\!\!..." from most Goal commands
paulson
parents: 5069
diff changeset
   343
Goal "c:B ==> c : A Un B";
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   344
by (Asm_simp_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   345
qed "UnI2";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   346
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   347
(*Classical introduction rule: no commitment to A vs B*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   348
qed_goal "UnCI" Set.thy "(c~:B ==> c:A) ==> c : A Un B"
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   349
 (fn prems=>
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   350
  [ (Simp_tac 1),
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   351
    (REPEAT (ares_tac (prems@[disjCI]) 1)) ]);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   352
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   353
val major::prems = Goalw [Un_def]
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   354
    "[| c : A Un B;  c:A ==> P;  c:B ==> P |] ==> P";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   355
by (rtac (major RS CollectD RS disjE) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   356
by (REPEAT (eresolve_tac prems 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   357
qed "UnE";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   358
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   359
AddSIs [UnCI];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   360
AddSEs [UnE];
1640
581165679095 Added more _iff rewrites for Compl, Un, Int
paulson
parents: 1618
diff changeset
   361
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   362
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   363
section "Binary intersection -- Int";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   364
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   365
qed_goalw "Int_iff" Set.thy [Int_def] "(c : A Int B) = (c:A & c:B)"
2891
d8f254ad1ab9 Calls Blast_tac
paulson
parents: 2881
diff changeset
   366
 (fn _ => [ (Blast_tac 1) ]);
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   367
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   368
Addsimps [Int_iff];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   369
5143
b94cd208f073 Removal of leading "\!\!..." from most Goal commands
paulson
parents: 5069
diff changeset
   370
Goal "[| c:A;  c:B |] ==> c : A Int B";
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   371
by (Asm_simp_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   372
qed "IntI";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   373
5143
b94cd208f073 Removal of leading "\!\!..." from most Goal commands
paulson
parents: 5069
diff changeset
   374
Goal "c : A Int B ==> c:A";
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   375
by (Asm_full_simp_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   376
qed "IntD1";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   377
5143
b94cd208f073 Removal of leading "\!\!..." from most Goal commands
paulson
parents: 5069
diff changeset
   378
Goal "c : A Int B ==> c:B";
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   379
by (Asm_full_simp_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   380
qed "IntD2";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   381
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   382
val [major,minor] = Goal
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   383
    "[| c : A Int B;  [| c:A; c:B |] ==> P |] ==> P";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   384
by (rtac minor 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   385
by (rtac (major RS IntD1) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   386
by (rtac (major RS IntD2) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   387
qed "IntE";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   388
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   389
AddSIs [IntI];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   390
AddSEs [IntE];
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   391
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   392
section "Set difference";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   393
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   394
qed_goalw "Diff_iff" Set.thy [set_diff_def] "(c : A-B) = (c:A & c~:B)"
2891
d8f254ad1ab9 Calls Blast_tac
paulson
parents: 2881
diff changeset
   395
 (fn _ => [ (Blast_tac 1) ]);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   396
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   397
Addsimps [Diff_iff];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   398
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   399
qed_goal "DiffI" Set.thy "!!c. [| c : A;  c ~: B |] ==> c : A - B"
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   400
 (fn _=> [ Asm_simp_tac 1 ]);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   401
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   402
qed_goal "DiffD1" Set.thy "!!c. c : A - B ==> c : A"
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   403
 (fn _=> [ (Asm_full_simp_tac 1) ]);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   404
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   405
qed_goal "DiffD2" Set.thy "!!c. [| c : A - B;  c : B |] ==> P"
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   406
 (fn _=> [ (Asm_full_simp_tac 1) ]);
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   407
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   408
qed_goal "DiffE" Set.thy "[| c : A - B;  [| c:A; c~:B |] ==> P |] ==> P"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   409
 (fn prems=>
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   410
  [ (resolve_tac prems 1),
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   411
    (REPEAT (ares_tac (prems RL [DiffD1, DiffD2 RS notI]) 1)) ]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   412
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   413
AddSIs [DiffI];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   414
AddSEs [DiffE];
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   415
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   416
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   417
section "Augmenting a set -- insert";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   418
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   419
qed_goalw "insert_iff" Set.thy [insert_def] "a : insert b A = (a=b | a:A)"
2891
d8f254ad1ab9 Calls Blast_tac
paulson
parents: 2881
diff changeset
   420
 (fn _ => [Blast_tac 1]);
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   421
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   422
Addsimps [insert_iff];
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   423
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   424
qed_goal "insertI1" Set.thy "a : insert a B"
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   425
 (fn _ => [Simp_tac 1]);
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   426
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   427
qed_goal "insertI2" Set.thy "!!a. a : B ==> a : insert b B"
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   428
 (fn _=> [Asm_simp_tac 1]);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   429
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   430
qed_goalw "insertE" Set.thy [insert_def]
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   431
    "[| a : insert b A;  a=b ==> P;  a:A ==> P |] ==> P"
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   432
 (fn major::prems=>
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   433
  [ (rtac (major RS UnE) 1),
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   434
    (REPEAT (eresolve_tac (prems @ [CollectE]) 1)) ]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   435
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   436
(*Classical introduction rule*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   437
qed_goal "insertCI" Set.thy "(a~:B ==> a=b) ==> a: insert b B"
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   438
 (fn prems=>
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   439
  [ (Simp_tac 1),
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   440
    (REPEAT (ares_tac (prems@[disjCI]) 1)) ]);
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   441
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   442
AddSIs [insertCI]; 
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   443
AddSEs [insertE];
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   444
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   445
section "Singletons, using insert";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   446
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   447
qed_goal "singletonI" Set.thy "a : {a}"
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   448
 (fn _=> [ (rtac insertI1 1) ]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   449
5143
b94cd208f073 Removal of leading "\!\!..." from most Goal commands
paulson
parents: 5069
diff changeset
   450
Goal "b : {a} ==> b=a";
2891
d8f254ad1ab9 Calls Blast_tac
paulson
parents: 2881
diff changeset
   451
by (Blast_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   452
qed "singletonD";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   453
1776
d7e77cb8ce5c moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents: 1762
diff changeset
   454
bind_thm ("singletonE", make_elim singletonD);
d7e77cb8ce5c moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents: 1762
diff changeset
   455
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   456
qed_goal "singleton_iff" thy "(b : {a}) = (b=a)" 
2891
d8f254ad1ab9 Calls Blast_tac
paulson
parents: 2881
diff changeset
   457
(fn _ => [Blast_tac 1]);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   458
5143
b94cd208f073 Removal of leading "\!\!..." from most Goal commands
paulson
parents: 5069
diff changeset
   459
Goal "{a}={b} ==> a=b";
4089
96fba19bcbe2 isatool fixclasimp;
wenzelm
parents: 4059
diff changeset
   460
by (blast_tac (claset() addEs [equalityE]) 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   461
qed "singleton_inject";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   462
2858
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   463
(*Redundant? But unlike insertCI, it proves the subgoal immediately!*)
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   464
AddSIs [singletonI];   
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   465
AddSDs [singleton_inject];
3718
d78cf498a88c Minor tidying to use Clarify_tac, etc.
paulson
parents: 3582
diff changeset
   466
AddSEs [singletonE];
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   467
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4830
diff changeset
   468
Goal "{x. x=a} = {a}";
4423
a129b817b58a expandshort;
wenzelm
parents: 4240
diff changeset
   469
by (Blast_tac 1);
3582
b87c86b6c291 Added {x.x=a} = a to !simpset.
nipkow
parents: 3469
diff changeset
   470
qed "singleton_conv";
b87c86b6c291 Added {x.x=a} = a to !simpset.
nipkow
parents: 3469
diff changeset
   471
Addsimps [singleton_conv];
1531
e5eb247ad13c Added a constant UNIV == {x.True}
nipkow
parents: 1465
diff changeset
   472
5600
34b3366b83ac new singleton_conv2
nipkow
parents: 5521
diff changeset
   473
Goal "{x. a=x} = {a}";
34b3366b83ac new singleton_conv2
nipkow
parents: 5521
diff changeset
   474
by(Blast_tac 1);
34b3366b83ac new singleton_conv2
nipkow
parents: 5521
diff changeset
   475
qed "singleton_conv2";
34b3366b83ac new singleton_conv2
nipkow
parents: 5521
diff changeset
   476
Addsimps [singleton_conv2];
34b3366b83ac new singleton_conv2
nipkow
parents: 5521
diff changeset
   477
1531
e5eb247ad13c Added a constant UNIV == {x.True}
nipkow
parents: 1465
diff changeset
   478
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   479
section "Unions of families -- UNION x:A. B(x) is Union(B``A)";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   480
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4830
diff changeset
   481
Goalw [UNION_def] "(b: (UN x:A. B(x))) = (EX x:A. b: B(x))";
2891
d8f254ad1ab9 Calls Blast_tac
paulson
parents: 2881
diff changeset
   482
by (Blast_tac 1);
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   483
qed "UN_iff";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   484
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   485
Addsimps [UN_iff];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   486
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   487
(*The order of the premises presupposes that A is rigid; b may be flexible*)
5143
b94cd208f073 Removal of leading "\!\!..." from most Goal commands
paulson
parents: 5069
diff changeset
   488
Goal "[| a:A;  b: B(a) |] ==> b: (UN x:A. B(x))";
4477
b3e5857d8d99 New Auto_tac (by Oheimb), and new syntax (without parens), and expandshort
paulson
parents: 4469
diff changeset
   489
by Auto_tac;
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   490
qed "UN_I";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   491
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   492
val major::prems = Goalw [UNION_def]
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   493
    "[| b : (UN x:A. B(x));  !!x.[| x:A;  b: B(x) |] ==> R |] ==> R";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   494
by (rtac (major RS CollectD RS bexE) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   495
by (REPEAT (ares_tac prems 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   496
qed "UN_E";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   497
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   498
AddIs  [UN_I];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   499
AddSEs [UN_E];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   500
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   501
val prems = Goal
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   502
    "[| A=B;  !!x. x:B ==> C(x) = D(x) |] ==> \
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   503
\    (UN x:A. C(x)) = (UN x:B. D(x))";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   504
by (REPEAT (etac UN_E 1
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   505
     ORELSE ares_tac ([UN_I,equalityI,subsetI] @ 
1465
5d7a7e439cec expanded tabs
clasohm
parents: 923
diff changeset
   506
                      (prems RL [equalityD1,equalityD2] RL [subsetD])) 1));
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   507
qed "UN_cong";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   508
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   509
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   510
section "Intersections of families -- INTER x:A. B(x) is Inter(B``A)";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   511
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4830
diff changeset
   512
Goalw [INTER_def] "(b: (INT x:A. B(x))) = (ALL x:A. b: B(x))";
4477
b3e5857d8d99 New Auto_tac (by Oheimb), and new syntax (without parens), and expandshort
paulson
parents: 4469
diff changeset
   513
by Auto_tac;
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   514
qed "INT_iff";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   515
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   516
Addsimps [INT_iff];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   517
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   518
val prems = Goalw [INTER_def]
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   519
    "(!!x. x:A ==> b: B(x)) ==> b : (INT x:A. B(x))";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   520
by (REPEAT (ares_tac ([CollectI,ballI] @ prems) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   521
qed "INT_I";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   522
5143
b94cd208f073 Removal of leading "\!\!..." from most Goal commands
paulson
parents: 5069
diff changeset
   523
Goal "[| b : (INT x:A. B(x));  a:A |] ==> b: B(a)";
4477
b3e5857d8d99 New Auto_tac (by Oheimb), and new syntax (without parens), and expandshort
paulson
parents: 4469
diff changeset
   524
by Auto_tac;
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   525
qed "INT_D";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   526
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   527
(*"Classical" elimination -- by the Excluded Middle on a:A *)
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   528
val major::prems = Goalw [INTER_def]
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   529
    "[| b : (INT x:A. B(x));  b: B(a) ==> R;  a~:A ==> R |] ==> R";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   530
by (rtac (major RS CollectD RS ballE) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   531
by (REPEAT (eresolve_tac prems 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   532
qed "INT_E";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   533
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   534
AddSIs [INT_I];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   535
AddEs  [INT_D, INT_E];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   536
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   537
val prems = Goal
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   538
    "[| A=B;  !!x. x:B ==> C(x) = D(x) |] ==> \
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   539
\    (INT x:A. C(x)) = (INT x:B. D(x))";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   540
by (REPEAT_FIRST (resolve_tac [INT_I,equalityI,subsetI]));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   541
by (REPEAT (dtac INT_D 1
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   542
     ORELSE ares_tac (prems RL [equalityD1,equalityD2] RL [subsetD]) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   543
qed "INT_cong";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   544
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   545
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   546
section "Union";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   547
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4830
diff changeset
   548
Goalw [Union_def] "(A : Union(C)) = (EX X:C. A:X)";
2891
d8f254ad1ab9 Calls Blast_tac
paulson
parents: 2881
diff changeset
   549
by (Blast_tac 1);
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   550
qed "Union_iff";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   551
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   552
Addsimps [Union_iff];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   553
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   554
(*The order of the premises presupposes that C is rigid; A may be flexible*)
5143
b94cd208f073 Removal of leading "\!\!..." from most Goal commands
paulson
parents: 5069
diff changeset
   555
Goal "[| X:C;  A:X |] ==> A : Union(C)";
4477
b3e5857d8d99 New Auto_tac (by Oheimb), and new syntax (without parens), and expandshort
paulson
parents: 4469
diff changeset
   556
by Auto_tac;
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   557
qed "UnionI";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   558
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   559
val major::prems = Goalw [Union_def]
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   560
    "[| A : Union(C);  !!X.[| A:X;  X:C |] ==> R |] ==> R";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   561
by (rtac (major RS UN_E) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   562
by (REPEAT (ares_tac prems 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   563
qed "UnionE";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   564
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   565
AddIs  [UnionI];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   566
AddSEs [UnionE];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   567
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   568
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   569
section "Inter";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   570
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4830
diff changeset
   571
Goalw [Inter_def] "(A : Inter(C)) = (ALL X:C. A:X)";
2891
d8f254ad1ab9 Calls Blast_tac
paulson
parents: 2881
diff changeset
   572
by (Blast_tac 1);
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   573
qed "Inter_iff";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   574
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   575
Addsimps [Inter_iff];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   576
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   577
val prems = Goalw [Inter_def]
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   578
    "[| !!X. X:C ==> A:X |] ==> A : Inter(C)";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   579
by (REPEAT (ares_tac ([INT_I] @ prems) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   580
qed "InterI";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   581
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   582
(*A "destruct" rule -- every X in C contains A as an element, but
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   583
  A:X can hold when X:C does not!  This rule is analogous to "spec". *)
5143
b94cd208f073 Removal of leading "\!\!..." from most Goal commands
paulson
parents: 5069
diff changeset
   584
Goal "[| A : Inter(C);  X:C |] ==> A:X";
4477
b3e5857d8d99 New Auto_tac (by Oheimb), and new syntax (without parens), and expandshort
paulson
parents: 4469
diff changeset
   585
by Auto_tac;
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   586
qed "InterD";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   587
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   588
(*"Classical" elimination rule -- does not require proving X:C *)
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   589
val major::prems = Goalw [Inter_def]
2721
f08042e18c7d New version of InterE, like its ZF counterpart
paulson
parents: 2608
diff changeset
   590
    "[| A : Inter(C);  X~:C ==> R;  A:X ==> R |] ==> R";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   591
by (rtac (major RS INT_E) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   592
by (REPEAT (eresolve_tac prems 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   593
qed "InterE";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   594
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   595
AddSIs [InterI];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   596
AddEs  [InterD, InterE];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   597
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   598
2912
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   599
(*** Image of a set under a function ***)
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   600
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   601
(*Frequently b does not have the syntactic form of f(x).*)
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   602
Goalw [image_def] "[| b=f(x);  x:A |] ==> b : f``A";
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   603
by (Blast_tac 1);
2912
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   604
qed "image_eqI";
3909
e48e2fb8b895 Added image_eqI to simpset.
nipkow
parents: 3905
diff changeset
   605
Addsimps [image_eqI];
2912
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   606
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   607
bind_thm ("imageI", refl RS image_eqI);
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   608
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   609
(*The eta-expansion gives variable-name preservation.*)
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   610
val major::prems = Goalw [image_def]
3842
b55686a7b22c fixed dots;
wenzelm
parents: 3718
diff changeset
   611
    "[| b : (%x. f(x))``A;  !!x.[| b=f(x);  x:A |] ==> P |] ==> P"; 
2912
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   612
by (rtac (major RS CollectD RS bexE) 1);
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   613
by (REPEAT (ares_tac prems 1));
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   614
qed "imageE";
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   615
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   616
AddIs  [image_eqI];
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   617
AddSEs [imageE]; 
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   618
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4830
diff changeset
   619
Goal "f``(A Un B) = f``A Un f``B";
2935
998cb95fdd43 Yet more fast_tac->blast_tac, and other tidying
paulson
parents: 2912
diff changeset
   620
by (Blast_tac 1);
2912
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   621
qed "image_Un";
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   622
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4830
diff changeset
   623
Goal "(z : f``A) = (EX x:A. z = f x)";
3960
7a38fae985f9 New rewrite rules image_iff
paulson
parents: 3919
diff changeset
   624
by (Blast_tac 1);
7a38fae985f9 New rewrite rules image_iff
paulson
parents: 3919
diff changeset
   625
qed "image_iff";
7a38fae985f9 New rewrite rules image_iff
paulson
parents: 3919
diff changeset
   626
4523
16f5efe9812d New rule: image_subset
paulson
parents: 4510
diff changeset
   627
(*This rewrite rule would confuse users if made default.*)
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4830
diff changeset
   628
Goal "(f``A <= B) = (ALL x:A. f(x): B)";
4523
16f5efe9812d New rule: image_subset
paulson
parents: 4510
diff changeset
   629
by (Blast_tac 1);
16f5efe9812d New rule: image_subset
paulson
parents: 4510
diff changeset
   630
qed "image_subset_iff";
16f5efe9812d New rule: image_subset
paulson
parents: 4510
diff changeset
   631
16f5efe9812d New rule: image_subset
paulson
parents: 4510
diff changeset
   632
(*Replaces the three steps subsetI, imageE, hyp_subst_tac, but breaks too
16f5efe9812d New rule: image_subset
paulson
parents: 4510
diff changeset
   633
  many existing proofs.*)
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   634
val prems = Goal "(!!x. x:A ==> f(x) : B) ==> f``A <= B";
4510
a37f515a0b25 New theorem image_subsetI
paulson
parents: 4477
diff changeset
   635
by (blast_tac (claset() addIs prems) 1);
a37f515a0b25 New theorem image_subsetI
paulson
parents: 4477
diff changeset
   636
qed "image_subsetI";
a37f515a0b25 New theorem image_subsetI
paulson
parents: 4477
diff changeset
   637
2912
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   638
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   639
(*** Range of a function -- just a translation for image! ***)
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   640
5143
b94cd208f073 Removal of leading "\!\!..." from most Goal commands
paulson
parents: 5069
diff changeset
   641
Goal "b=f(x) ==> b : range(f)";
2912
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   642
by (EVERY1 [etac image_eqI, rtac UNIV_I]);
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   643
bind_thm ("range_eqI", UNIV_I RSN (2,image_eqI));
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   644
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   645
bind_thm ("rangeI", UNIV_I RS imageI);
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   646
5316
7a8975451a89 even more tidying of Goal commands
paulson
parents: 5305
diff changeset
   647
val [major,minor] = Goal 
3842
b55686a7b22c fixed dots;
wenzelm
parents: 3718
diff changeset
   648
    "[| b : range(%x. f(x));  !!x. b=f(x) ==> P |] ==> P"; 
2912
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   649
by (rtac (major RS imageE) 1);
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   650
by (etac minor 1);
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   651
qed "rangeE";
3fac3e8d5d3e moved inj and surj from Set to Fun and Inv -> inv.
nipkow
parents: 2891
diff changeset
   652
1776
d7e77cb8ce5c moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents: 1762
diff changeset
   653
d7e77cb8ce5c moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents: 1762
diff changeset
   654
(*** Set reasoning tools ***)
d7e77cb8ce5c moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents: 1762
diff changeset
   655
d7e77cb8ce5c moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents: 1762
diff changeset
   656
3912
4ed64ad7fb42 New rewrite rules for simplifying conditionals
paulson
parents: 3909
diff changeset
   657
(** Rewrite rules for boolean case-splitting: faster than 
4830
bd73675adbed Added a few lemmas.
nipkow
parents: 4770
diff changeset
   658
	addsplits[split_if]
3912
4ed64ad7fb42 New rewrite rules for simplifying conditionals
paulson
parents: 3909
diff changeset
   659
**)
4ed64ad7fb42 New rewrite rules for simplifying conditionals
paulson
parents: 3909
diff changeset
   660
4830
bd73675adbed Added a few lemmas.
nipkow
parents: 4770
diff changeset
   661
bind_thm ("split_if_eq1", read_instantiate [("P", "%x. x = ?b")] split_if);
bd73675adbed Added a few lemmas.
nipkow
parents: 4770
diff changeset
   662
bind_thm ("split_if_eq2", read_instantiate [("P", "%x. ?a = x")] split_if);
3912
4ed64ad7fb42 New rewrite rules for simplifying conditionals
paulson
parents: 3909
diff changeset
   663
5237
aebc63048f2d Deleted the redundant rule mem_if
paulson
parents: 5148
diff changeset
   664
(*Split ifs on either side of the membership relation.
aebc63048f2d Deleted the redundant rule mem_if
paulson
parents: 5148
diff changeset
   665
	Not for Addsimps -- can cause goals to blow up!*)
4830
bd73675adbed Added a few lemmas.
nipkow
parents: 4770
diff changeset
   666
bind_thm ("split_if_mem1", 
bd73675adbed Added a few lemmas.
nipkow
parents: 4770
diff changeset
   667
    read_instantiate_sg (sign_of Set.thy) [("P", "%x. x : ?b")] split_if);
bd73675adbed Added a few lemmas.
nipkow
parents: 4770
diff changeset
   668
bind_thm ("split_if_mem2", 
bd73675adbed Added a few lemmas.
nipkow
parents: 4770
diff changeset
   669
    read_instantiate_sg (sign_of Set.thy) [("P", "%x. ?a : x")] split_if);
3912
4ed64ad7fb42 New rewrite rules for simplifying conditionals
paulson
parents: 3909
diff changeset
   670
4830
bd73675adbed Added a few lemmas.
nipkow
parents: 4770
diff changeset
   671
val split_ifs = [if_bool_eq_conj, split_if_eq1, split_if_eq2,
bd73675adbed Added a few lemmas.
nipkow
parents: 4770
diff changeset
   672
		  split_if_mem1, split_if_mem2];
3912
4ed64ad7fb42 New rewrite rules for simplifying conditionals
paulson
parents: 3909
diff changeset
   673
4ed64ad7fb42 New rewrite rules for simplifying conditionals
paulson
parents: 3909
diff changeset
   674
4089
96fba19bcbe2 isatool fixclasimp;
wenzelm
parents: 4059
diff changeset
   675
(*Each of these has ALREADY been added to simpset() above.*)
2024
909153d8318f Rationalized the rewriting of membership for {} and insert
paulson
parents: 1985
diff changeset
   676
val mem_simps = [insert_iff, empty_iff, Un_iff, Int_iff, Compl_iff, Diff_iff, 
4159
4aff9b7e5597 UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents: 4135
diff changeset
   677
                 mem_Collect_eq, UN_iff, Union_iff, INT_iff, Inter_iff];
1776
d7e77cb8ce5c moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents: 1762
diff changeset
   678
d7e77cb8ce5c moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents: 1762
diff changeset
   679
val mksimps_pairs = ("Ball",[bspec]) :: mksimps_pairs;
d7e77cb8ce5c moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents: 1762
diff changeset
   680
4089
96fba19bcbe2 isatool fixclasimp;
wenzelm
parents: 4059
diff changeset
   681
simpset_ref() := simpset() addcongs [ball_cong,bex_cong]
1776
d7e77cb8ce5c moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents: 1762
diff changeset
   682
                    setmksimps (mksimps mksimps_pairs);
3222
726a9b069947 Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents: 2935
diff changeset
   683
5256
e6983301ce5e Renamed equals0D to equals0E
paulson
parents: 5237
diff changeset
   684
Addsimps[subset_UNIV, subset_refl];
3222
726a9b069947 Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents: 2935
diff changeset
   685
726a9b069947 Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents: 2935
diff changeset
   686
726a9b069947 Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents: 2935
diff changeset
   687
(*** < ***)
726a9b069947 Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents: 2935
diff changeset
   688
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4830
diff changeset
   689
Goalw [psubset_def] "!!A::'a set. [| A <= B; A ~= B |] ==> A<B";
3222
726a9b069947 Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents: 2935
diff changeset
   690
by (Blast_tac 1);
726a9b069947 Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents: 2935
diff changeset
   691
qed "psubsetI";
726a9b069947 Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents: 2935
diff changeset
   692
5148
74919e8f221c More tidying and removal of "\!\!... from Goal commands
paulson
parents: 5143
diff changeset
   693
Goalw [psubset_def] "A < insert x B ==> (x ~: A) & A<=B | x:A & A-{x}<B";
4477
b3e5857d8d99 New Auto_tac (by Oheimb), and new syntax (without parens), and expandshort
paulson
parents: 4469
diff changeset
   694
by Auto_tac;
3222
726a9b069947 Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents: 2935
diff changeset
   695
qed "psubset_insertD";
4059
59c1422c9da5 New Blast_tac (and minor tidying...)
paulson
parents: 3960
diff changeset
   696
59c1422c9da5 New Blast_tac (and minor tidying...)
paulson
parents: 3960
diff changeset
   697
bind_thm ("psubset_eq", psubset_def RS meta_eq_to_obj_eq);