src/HOL/Set.ML
author paulson
Wed, 02 Apr 1997 11:25:04 +0200
changeset 2858 1f3f5c44e159
parent 2721 f08042e18c7d
child 2881 62ecde1015ae
permissions -rw-r--r--
Re-ordering of rules to assist blast_tac Powerset rules must not be the most recent
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
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    13
AddIffs [mem_Collect_eq];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    14
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    15
goal Set.thy "!!a. P(a) ==> a : {x.P(x)}";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    16
by (Asm_simp_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    17
qed "CollectI";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    18
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    19
val prems = goal Set.thy "!!a. a : {x.P(x)} ==> P(a)";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    20
by (Asm_full_simp_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    21
qed "CollectD";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    22
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    23
val [prem] = goal Set.thy "[| !!x. (x:A) = (x:B) |] ==> A = B";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    24
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
    25
by (rtac Collect_mem_eq 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
qed "set_ext";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    28
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    29
val [prem] = goal Set.thy "[| !!x. P(x)=Q(x) |] ==> {x. P(x)} = {x. Q(x)}";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    30
by (rtac (prem RS ext RS arg_cong) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    31
qed "Collect_cong";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    32
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    33
val CollectE = make_elim CollectD;
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    34
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    35
AddSIs [CollectI];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    36
AddSEs [CollectE];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    37
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    38
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
    39
section "Bounded quantifiers";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    40
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    41
val prems = goalw Set.thy [Ball_def]
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    42
    "[| !!x. x:A ==> P(x) |] ==> ! x:A. P(x)";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    43
by (REPEAT (ares_tac (prems @ [allI,impI]) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    44
qed "ballI";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    45
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    46
val [major,minor] = goalw Set.thy [Ball_def]
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    47
    "[| ! x:A. P(x);  x:A |] ==> P(x)";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    48
by (rtac (minor RS (major RS spec RS mp)) 1);
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
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    51
val major::prems = goalw Set.thy [Ball_def]
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];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    62
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    63
val prems = goalw Set.thy [Bex_def]
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    64
    "[| P(x);  x:A |] ==> ? x:A. P(x)";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    65
by (REPEAT (ares_tac (prems @ [exI,conjI]) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    66
qed "bexI";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    67
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    68
qed_goal "bexCI" Set.thy 
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    69
   "[| ! x:A. ~P(x) ==> P(a);  a:A |] ==> ? x:A.P(x)"
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    70
 (fn prems=>
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    71
  [ (rtac classical 1),
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    72
    (REPEAT (ares_tac (prems@[bexI,ballI,notI,notE]) 1))  ]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    73
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    74
val major::prems = goalw Set.thy [Bex_def]
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    75
    "[| ? x:A. P(x);  !!x. [| x:A; P(x) |] ==> Q  |] ==> Q";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    76
by (rtac (major RS exE) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    77
by (REPEAT (eresolve_tac (prems @ [asm_rl,conjE]) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    78
qed "bexE";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    79
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    80
AddIs  [bexI];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    81
AddSEs [bexE];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
    82
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    83
(*Trival rewrite rule;   (! x:A.P)=P holds only if A is nonempty!*)
1882
67f49e8c4355 Proved bex_False
paulson
parents: 1841
diff changeset
    84
goalw Set.thy [Ball_def] "(! x:A. True) = True";
67f49e8c4355 Proved bex_False
paulson
parents: 1841
diff changeset
    85
by (Simp_tac 1);
1816
b03dba9116d4 New rewrites for vacuous quantification
paulson
parents: 1776
diff changeset
    86
qed "ball_True";
b03dba9116d4 New rewrites for vacuous quantification
paulson
parents: 1776
diff changeset
    87
1882
67f49e8c4355 Proved bex_False
paulson
parents: 1841
diff changeset
    88
(*Dual form for existentials*)
67f49e8c4355 Proved bex_False
paulson
parents: 1841
diff changeset
    89
goalw Set.thy [Bex_def] "(? x:A. False) = False";
67f49e8c4355 Proved bex_False
paulson
parents: 1841
diff changeset
    90
by (Simp_tac 1);
67f49e8c4355 Proved bex_False
paulson
parents: 1841
diff changeset
    91
qed "bex_False";
67f49e8c4355 Proved bex_False
paulson
parents: 1841
diff changeset
    92
67f49e8c4355 Proved bex_False
paulson
parents: 1841
diff changeset
    93
Addsimps [ball_True, bex_False];
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    94
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    95
(** Congruence rules **)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    96
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    97
val prems = goal Set.thy
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    98
    "[| A=B;  !!x. x:B ==> P(x) = Q(x) |] ==> \
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    99
\    (! x:A. P(x)) = (! x:B. Q(x))";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   100
by (resolve_tac (prems RL [ssubst]) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   101
by (REPEAT (ares_tac [ballI,iffI] 1
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   102
     ORELSE eresolve_tac ([make_elim bspec, mp] @ (prems RL [iffE])) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   103
qed "ball_cong";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   104
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   105
val prems = goal Set.thy
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   106
    "[| A=B;  !!x. x:B ==> P(x) = Q(x) |] ==> \
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   107
\    (? x:A. P(x)) = (? x:B. Q(x))";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   108
by (resolve_tac (prems RL [ssubst]) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   109
by (REPEAT (etac bexE 1
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   110
     ORELSE ares_tac ([bexI,iffI] @ (prems RL [iffD1,iffD2])) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   111
qed "bex_cong";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   112
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   113
section "Subsets";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   114
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   115
val prems = goalw Set.thy [subset_def] "(!!x.x:A ==> x:B) ==> A <= B";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   116
by (REPEAT (ares_tac (prems @ [ballI]) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   117
qed "subsetI";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   118
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   119
(*Rule in Modus Ponens style*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   120
val major::prems = goalw Set.thy [subset_def] "[| A <= B;  c:A |] ==> c:B";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   121
by (rtac (major RS bspec) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   122
by (resolve_tac prems 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   123
qed "subsetD";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   124
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   125
(*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
   126
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
   127
 (fn prems=>  [ (REPEAT (resolve_tac (prems@[subsetD]) 1)) ]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   128
1920
df683ce7aad8 Added impOfSubs
paulson
parents: 1882
diff changeset
   129
(*Converts A<=B to x:A ==> x:B*)
df683ce7aad8 Added impOfSubs
paulson
parents: 1882
diff changeset
   130
fun impOfSubs th = th RSN (2, rev_subsetD);
df683ce7aad8 Added impOfSubs
paulson
parents: 1882
diff changeset
   131
1841
8e5e2fef6d26 Added contra_subsetD and rev_contra_subsetD
paulson
parents: 1816
diff changeset
   132
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
   133
 (fn prems=>  [ (REPEAT (eresolve_tac [asm_rl, contrapos, subsetD] 1)) ]);
8e5e2fef6d26 Added contra_subsetD and rev_contra_subsetD
paulson
parents: 1816
diff changeset
   134
8e5e2fef6d26 Added contra_subsetD and rev_contra_subsetD
paulson
parents: 1816
diff changeset
   135
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
   136
 (fn prems=>  [ (REPEAT (eresolve_tac [asm_rl, contrapos, subsetD] 1)) ]);
8e5e2fef6d26 Added contra_subsetD and rev_contra_subsetD
paulson
parents: 1816
diff changeset
   137
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   138
(*Classical elimination rule*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   139
val major::prems = goalw Set.thy [subset_def] 
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   140
    "[| A <= B;  c~:A ==> P;  c:B ==> P |] ==> P";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   141
by (rtac (major RS ballE) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   142
by (REPEAT (eresolve_tac prems 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   143
qed "subsetCE";
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
(*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
   146
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
   147
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   148
AddSIs [subsetI];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   149
AddEs  [subsetD, subsetCE];
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   150
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   151
qed_goal "subset_refl" Set.thy "A <= (A::'a set)"
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   152
 (fn _=> [Fast_tac 1]);
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   153
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   154
val prems = goal Set.thy "!!B. [| A<=B;  B<=C |] ==> A<=(C::'a set)";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   155
by (Fast_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   156
qed "subset_trans";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   157
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   158
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   159
section "Equality";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   160
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   161
(*Anti-symmetry of the subset relation*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   162
val prems = goal Set.thy "[| A <= B;  B <= A |] ==> A = (B::'a set)";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   163
by (rtac (iffI RS set_ext) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   164
by (REPEAT (ares_tac (prems RL [subsetD]) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   165
qed "subset_antisym";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   166
val equalityI = subset_antisym;
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   167
1762
6e481897a811 equalityI is now added to default claset
berghofe
parents: 1760
diff changeset
   168
AddSIs [equalityI];
6e481897a811 equalityI is now added to default claset
berghofe
parents: 1760
diff changeset
   169
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   170
(* Equality rules from ZF set theory -- are they appropriate here? *)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   171
val prems = goal Set.thy "A = B ==> A<=(B::'a set)";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   172
by (resolve_tac (prems RL [subst]) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   173
by (rtac subset_refl 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   174
qed "equalityD1";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   175
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   176
val prems = goal Set.thy "A = B ==> B<=(A::'a set)";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   177
by (resolve_tac (prems RL [subst]) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   178
by (rtac subset_refl 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   179
qed "equalityD2";
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
val prems = goal Set.thy
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   182
    "[| A = B;  [| A<=B; B<=(A::'a set) |] ==> P |]  ==>  P";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   183
by (resolve_tac prems 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   184
by (REPEAT (resolve_tac (prems RL [equalityD1,equalityD2]) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   185
qed "equalityE";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   186
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   187
val major::prems = goal Set.thy
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   188
    "[| 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
   189
by (rtac (major RS equalityE) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   190
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
   191
qed "equalityCE";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   192
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   193
(*Lemma for creating induction formulae -- for "pattern matching" on p
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   194
  To make the induction hypotheses usable, apply "spec" or "bspec" to
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   195
  put universal quantifiers over the free variables in p. *)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   196
val prems = goal Set.thy 
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   197
    "[| p:A;  !!z. z:A ==> p=z --> R |] ==> R";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   198
by (rtac mp 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   199
by (REPEAT (resolve_tac (refl::prems) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   200
qed "setup_induction";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   201
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   202
2858
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   203
section "The empty set -- {}";
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   204
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   205
qed_goalw "empty_iff" Set.thy [empty_def] "(c : {}) = False"
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   206
 (fn _ => [ (Fast_tac 1) ]);
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   207
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   208
Addsimps [empty_iff];
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   209
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   210
qed_goal "emptyE" Set.thy "!!a. a:{} ==> P"
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   211
 (fn _ => [Full_simp_tac 1]);
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   212
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   213
AddSEs [emptyE];
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   214
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   215
qed_goal "empty_subsetI" Set.thy "{} <= A"
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   216
 (fn _ => [ (Fast_tac 1) ]);
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   217
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   218
qed_goal "equals0I" Set.thy "[| !!y. y:A ==> False |] ==> A={}"
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   219
 (fn [prem]=>
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   220
  [ (fast_tac (!claset addIs [prem RS FalseE]) 1) ]);
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   221
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   222
qed_goal "equals0D" Set.thy "!!a. [| A={};  a:A |] ==> P"
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   223
 (fn _ => [ (Fast_tac 1) ]);
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   224
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   225
goal Set.thy "Ball {} P = True";
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   226
by (simp_tac (HOL_ss addsimps [mem_Collect_eq, Ball_def, empty_def]) 1);
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   227
qed "ball_empty";
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   228
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   229
goal Set.thy "Bex {} P = False";
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   230
by (simp_tac (HOL_ss addsimps [mem_Collect_eq, Bex_def, empty_def]) 1);
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   231
qed "bex_empty";
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   232
Addsimps [ball_empty, bex_empty];
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   233
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   234
goalw Set.thy [Ball_def] "(!x:A.False) = (A = {})";
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   235
by(Fast_tac 1);
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   236
qed "ball_False";
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   237
Addsimps [ball_False];
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   238
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   239
(* The dual is probably not helpful:
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   240
goal Set.thy "(? x:A.True) = (A ~= {})";
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   241
by(Fast_tac 1);
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   242
qed "bex_True";
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   243
Addsimps [bex_True];
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   244
*)
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   245
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   246
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   247
section "The Powerset operator -- Pow";
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 "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
   250
 (fn _ => [ (Asm_simp_tac 1) ]);
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
AddIffs [Pow_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_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
   255
 (fn _ => [ (etac CollectI 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
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
   258
 (fn _=> [ (etac CollectD 1) ]);
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   259
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   260
val Pow_bottom = empty_subsetI RS PowI;        (* {}: Pow(B) *)
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   261
val Pow_top = subset_refl RS PowI;             (* A : Pow(A) *)
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   262
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   263
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   264
section "Set complement -- Compl";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   265
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   266
qed_goalw "Compl_iff" Set.thy [Compl_def] "(c : Compl(A)) = (c~:A)"
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   267
 (fn _ => [ (Fast_tac 1) ]);
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   268
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   269
Addsimps [Compl_iff];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   270
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   271
val prems = goalw Set.thy [Compl_def]
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   272
    "[| c:A ==> False |] ==> c : Compl(A)";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   273
by (REPEAT (ares_tac (prems @ [CollectI,notI]) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   274
qed "ComplI";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   275
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   276
(*This form, with negated conclusion, works well with the Classical prover.
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   277
  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
   278
  turnstile...*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   279
val major::prems = goalw Set.thy [Compl_def]
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   280
    "c : Compl(A) ==> c~:A";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   281
by (rtac (major RS CollectD) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   282
qed "ComplD";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   283
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   284
val ComplE = make_elim ComplD;
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   285
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   286
AddSIs [ComplI];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   287
AddSEs [ComplE];
1640
581165679095 Added more _iff rewrites for Compl, Un, Int
paulson
parents: 1618
diff changeset
   288
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   289
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   290
section "Binary union -- Un";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   291
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   292
qed_goalw "Un_iff" Set.thy [Un_def] "(c : A Un B) = (c:A | c:B)"
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   293
 (fn _ => [ Fast_tac 1 ]);
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   294
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   295
Addsimps [Un_iff];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   296
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   297
goal Set.thy "!!c. c:A ==> c : A Un B";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   298
by (Asm_simp_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   299
qed "UnI1";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   300
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   301
goal Set.thy "!!c. c:B ==> c : A Un B";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   302
by (Asm_simp_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   303
qed "UnI2";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   304
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   305
(*Classical introduction rule: no commitment to A vs B*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   306
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
   307
 (fn prems=>
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   308
  [ (Simp_tac 1),
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   309
    (REPEAT (ares_tac (prems@[disjCI]) 1)) ]);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   310
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   311
val major::prems = goalw Set.thy [Un_def]
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   312
    "[| c : A Un B;  c:A ==> P;  c:B ==> P |] ==> P";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   313
by (rtac (major RS CollectD RS disjE) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   314
by (REPEAT (eresolve_tac prems 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   315
qed "UnE";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   316
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   317
AddSIs [UnCI];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   318
AddSEs [UnE];
1640
581165679095 Added more _iff rewrites for Compl, Un, Int
paulson
parents: 1618
diff changeset
   319
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   320
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   321
section "Binary intersection -- Int";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   322
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   323
qed_goalw "Int_iff" Set.thy [Int_def] "(c : A Int B) = (c:A & c:B)"
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   324
 (fn _ => [ (Fast_tac 1) ]);
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   325
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   326
Addsimps [Int_iff];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   327
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   328
goal Set.thy "!!c. [| c:A;  c:B |] ==> c : A Int B";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   329
by (Asm_simp_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   330
qed "IntI";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   331
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   332
goal Set.thy "!!c. c : A Int B ==> c:A";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   333
by (Asm_full_simp_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   334
qed "IntD1";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   335
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   336
goal Set.thy "!!c. c : A Int B ==> c:B";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   337
by (Asm_full_simp_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   338
qed "IntD2";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   339
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   340
val [major,minor] = goal Set.thy
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   341
    "[| c : A Int B;  [| c:A; c:B |] ==> P |] ==> P";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   342
by (rtac minor 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   343
by (rtac (major RS IntD1) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   344
by (rtac (major RS IntD2) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   345
qed "IntE";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   346
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   347
AddSIs [IntI];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   348
AddSEs [IntE];
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   349
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   350
section "Set difference";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   351
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   352
qed_goalw "Diff_iff" Set.thy [set_diff_def] "(c : A-B) = (c:A & c~:B)"
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   353
 (fn _ => [ (Fast_tac 1) ]);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   354
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   355
Addsimps [Diff_iff];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   356
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   357
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
   358
 (fn _=> [ Asm_simp_tac 1 ]);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   359
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   360
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
   361
 (fn _=> [ (Asm_full_simp_tac 1) ]);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   362
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   363
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
   364
 (fn _=> [ (Asm_full_simp_tac 1) ]);
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   365
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   366
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
   367
 (fn prems=>
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   368
  [ (resolve_tac prems 1),
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   369
    (REPEAT (ares_tac (prems RL [DiffD1, DiffD2 RS notI]) 1)) ]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   370
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   371
AddSIs [DiffI];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   372
AddSEs [DiffE];
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   373
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   374
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   375
section "Augmenting a set -- insert";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   376
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   377
qed_goalw "insert_iff" Set.thy [insert_def] "a : insert b A = (a=b | a:A)"
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   378
 (fn _ => [Fast_tac 1]);
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   379
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   380
Addsimps [insert_iff];
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   381
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   382
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
   383
 (fn _ => [Simp_tac 1]);
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   384
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   385
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
   386
 (fn _=> [Asm_simp_tac 1]);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   387
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   388
qed_goalw "insertE" Set.thy [insert_def]
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   389
    "[| a : insert b A;  a=b ==> P;  a:A ==> P |] ==> P"
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   390
 (fn major::prems=>
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   391
  [ (rtac (major RS UnE) 1),
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   392
    (REPEAT (eresolve_tac (prems @ [CollectE]) 1)) ]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   393
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   394
(*Classical introduction rule*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   395
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
   396
 (fn prems=>
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   397
  [ (Simp_tac 1),
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   398
    (REPEAT (ares_tac (prems@[disjCI]) 1)) ]);
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   399
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   400
AddSIs [insertCI]; 
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   401
AddSEs [insertE];
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   402
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   403
section "Singletons, using insert";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   404
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   405
qed_goal "singletonI" Set.thy "a : {a}"
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   406
 (fn _=> [ (rtac insertI1 1) ]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   407
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   408
goal Set.thy "!!a. b : {a} ==> b=a";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   409
by (Fast_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   410
qed "singletonD";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   411
1776
d7e77cb8ce5c moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents: 1762
diff changeset
   412
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
   413
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   414
qed_goal "singleton_iff" thy "(b : {a}) = (b=a)" 
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   415
(fn _ => [Fast_tac 1]);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   416
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   417
goal Set.thy "!!a b. {a}={b} ==> a=b";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   418
by (fast_tac (!claset addEs [equalityE]) 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   419
qed "singleton_inject";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   420
2858
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   421
(*Redundant? But unlike insertCI, it proves the subgoal immediately!*)
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   422
AddSIs [singletonI];   
1f3f5c44e159 Re-ordering of rules to assist blast_tac
paulson
parents: 2721
diff changeset
   423
    
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   424
AddSDs [singleton_inject];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   425
1531
e5eb247ad13c Added a constant UNIV == {x.True}
nipkow
parents: 1465
diff changeset
   426
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   427
section "The universal set -- UNIV";
1531
e5eb247ad13c Added a constant UNIV == {x.True}
nipkow
parents: 1465
diff changeset
   428
1882
67f49e8c4355 Proved bex_False
paulson
parents: 1841
diff changeset
   429
qed_goal "UNIV_I" Set.thy "x : UNIV"
67f49e8c4355 Proved bex_False
paulson
parents: 1841
diff changeset
   430
  (fn _ => [rtac ComplI 1, etac emptyE 1]);
67f49e8c4355 Proved bex_False
paulson
parents: 1841
diff changeset
   431
1531
e5eb247ad13c Added a constant UNIV == {x.True}
nipkow
parents: 1465
diff changeset
   432
qed_goal "subset_UNIV" Set.thy "A <= UNIV"
1882
67f49e8c4355 Proved bex_False
paulson
parents: 1841
diff changeset
   433
  (fn _ => [rtac subsetI 1, rtac UNIV_I 1]);
1531
e5eb247ad13c Added a constant UNIV == {x.True}
nipkow
parents: 1465
diff changeset
   434
e5eb247ad13c Added a constant UNIV == {x.True}
nipkow
parents: 1465
diff changeset
   435
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   436
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
   437
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   438
goalw Set.thy [UNION_def] "(b: (UN x:A. B(x))) = (EX x:A. b: B(x))";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   439
by (Fast_tac 1);
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   440
qed "UN_iff";
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
Addsimps [UN_iff];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   443
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   444
(*The order of the premises presupposes that A is rigid; b may be flexible*)
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   445
goal Set.thy "!!b. [| a:A;  b: B(a) |] ==> b: (UN x:A. B(x))";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   446
by (Auto_tac());
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   447
qed "UN_I";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   448
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   449
val major::prems = goalw Set.thy [UNION_def]
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   450
    "[| 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
   451
by (rtac (major RS CollectD RS bexE) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   452
by (REPEAT (ares_tac prems 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   453
qed "UN_E";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   454
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   455
AddIs  [UN_I];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   456
AddSEs [UN_E];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   457
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   458
val prems = goal Set.thy
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   459
    "[| A=B;  !!x. x:B ==> C(x) = D(x) |] ==> \
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   460
\    (UN x:A. C(x)) = (UN x:B. D(x))";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   461
by (REPEAT (etac UN_E 1
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   462
     ORELSE ares_tac ([UN_I,equalityI,subsetI] @ 
1465
5d7a7e439cec expanded tabs
clasohm
parents: 923
diff changeset
   463
                      (prems RL [equalityD1,equalityD2] RL [subsetD])) 1));
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   464
qed "UN_cong";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   465
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   466
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   467
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
   468
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   469
goalw Set.thy [INTER_def] "(b: (INT x:A. B(x))) = (ALL x:A. b: B(x))";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   470
by (Auto_tac());
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   471
qed "INT_iff";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   472
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   473
Addsimps [INT_iff];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   474
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   475
val prems = goalw Set.thy [INTER_def]
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   476
    "(!!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
   477
by (REPEAT (ares_tac ([CollectI,ballI] @ prems) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   478
qed "INT_I";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   479
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   480
goal Set.thy "!!b. [| b : (INT x:A. B(x));  a:A |] ==> b: B(a)";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   481
by (Auto_tac());
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   482
qed "INT_D";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   483
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   484
(*"Classical" elimination -- by the Excluded Middle on a:A *)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   485
val major::prems = goalw Set.thy [INTER_def]
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   486
    "[| 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
   487
by (rtac (major RS CollectD RS ballE) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   488
by (REPEAT (eresolve_tac prems 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   489
qed "INT_E";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   490
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   491
AddSIs [INT_I];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   492
AddEs  [INT_D, INT_E];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   493
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   494
val prems = goal Set.thy
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   495
    "[| A=B;  !!x. x:B ==> C(x) = D(x) |] ==> \
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   496
\    (INT x:A. C(x)) = (INT x:B. D(x))";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   497
by (REPEAT_FIRST (resolve_tac [INT_I,equalityI,subsetI]));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   498
by (REPEAT (dtac INT_D 1
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   499
     ORELSE ares_tac (prems RL [equalityD1,equalityD2] RL [subsetD]) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   500
qed "INT_cong";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   501
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   502
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   503
section "Unions over a type; UNION1(B) = Union(range(B))";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   504
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   505
goalw Set.thy [UNION1_def] "(b: (UN x. B(x))) = (EX x. b: B(x))";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   506
by (Simp_tac 1);
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   507
by (Fast_tac 1);
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   508
qed "UN1_iff";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   509
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   510
Addsimps [UN1_iff];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   511
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   512
(*The order of the premises presupposes that A is rigid; b may be flexible*)
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   513
goal Set.thy "!!b. b: B(x) ==> b: (UN x. B(x))";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   514
by (Auto_tac());
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   515
qed "UN1_I";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   516
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   517
val major::prems = goalw Set.thy [UNION1_def]
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   518
    "[| b : (UN x. B(x));  !!x. b: B(x) ==> R |] ==> R";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   519
by (rtac (major RS UN_E) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   520
by (REPEAT (ares_tac prems 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   521
qed "UN1_E";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   522
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   523
AddIs  [UN1_I];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   524
AddSEs [UN1_E];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   525
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   526
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   527
section "Intersections over a type; INTER1(B) = Inter(range(B))";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   528
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   529
goalw Set.thy [INTER1_def] "(b: (INT x. B(x))) = (ALL x. b: B(x))";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   530
by (Simp_tac 1);
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   531
by (Fast_tac 1);
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   532
qed "INT1_iff";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   533
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   534
Addsimps [INT1_iff];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   535
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   536
val prems = goalw Set.thy [INTER1_def]
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   537
    "(!!x. b: B(x)) ==> b : (INT x. B(x))";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   538
by (REPEAT (ares_tac (INT_I::prems) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   539
qed "INT1_I";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   540
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   541
goal Set.thy "!!b. b : (INT x. B(x)) ==> b: B(a)";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   542
by (Asm_full_simp_tac 1);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   543
qed "INT1_D";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   544
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   545
AddSIs [INT1_I]; 
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   546
AddDs  [INT1_D];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   547
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   548
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   549
section "Union";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   550
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   551
goalw Set.thy [Union_def] "(A : Union(C)) = (EX X:C. A:X)";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   552
by (Fast_tac 1);
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   553
qed "Union_iff";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   554
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   555
Addsimps [Union_iff];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   556
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   557
(*The order of the premises presupposes that C is rigid; A may be flexible*)
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   558
goal Set.thy "!!X. [| X:C;  A:X |] ==> A : Union(C)";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   559
by (Auto_tac());
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   560
qed "UnionI";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   561
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   562
val major::prems = goalw Set.thy [Union_def]
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   563
    "[| A : Union(C);  !!X.[| A:X;  X:C |] ==> R |] ==> R";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   564
by (rtac (major RS UN_E) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   565
by (REPEAT (ares_tac prems 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   566
qed "UnionE";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   567
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   568
AddIs  [UnionI];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   569
AddSEs [UnionE];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   570
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   571
1548
afe750876848 Added 'section' commands
nipkow
parents: 1531
diff changeset
   572
section "Inter";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   573
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   574
goalw Set.thy [Inter_def] "(A : Inter(C)) = (ALL X:C. A:X)";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   575
by (Fast_tac 1);
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   576
qed "Inter_iff";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   577
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   578
Addsimps [Inter_iff];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   579
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   580
val prems = goalw Set.thy [Inter_def]
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   581
    "[| !!X. X:C ==> A:X |] ==> A : Inter(C)";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   582
by (REPEAT (ares_tac ([INT_I] @ prems) 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   583
qed "InterI";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   584
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   585
(*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
   586
  A:X can hold when X:C does not!  This rule is analogous to "spec". *)
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   587
goal Set.thy "!!X. [| A : Inter(C);  X:C |] ==> A:X";
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   588
by (Auto_tac());
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   589
qed "InterD";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   590
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   591
(*"Classical" elimination rule -- does not require proving X:C *)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   592
val major::prems = goalw Set.thy [Inter_def]
2721
f08042e18c7d New version of InterE, like its ZF counterpart
paulson
parents: 2608
diff changeset
   593
    "[| A : Inter(C);  X~:C ==> R;  A:X ==> R |] ==> R";
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   594
by (rtac (major RS INT_E) 1);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   595
by (REPEAT (eresolve_tac prems 1));
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   596
qed "InterE";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   597
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   598
AddSIs [InterI];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   599
AddEs  [InterD, InterE];
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   600
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   601
1776
d7e77cb8ce5c moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents: 1762
diff changeset
   602
d7e77cb8ce5c moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents: 1762
diff changeset
   603
(*** Set reasoning tools ***)
d7e77cb8ce5c moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents: 1762
diff changeset
   604
d7e77cb8ce5c moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents: 1762
diff changeset
   605
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   606
(*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
   607
val mem_simps = [insert_iff, empty_iff, Un_iff, Int_iff, Compl_iff, Diff_iff, 
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   608
                 mem_Collect_eq, 
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   609
		 UN_iff, UN1_iff, Union_iff, 
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   610
		 INT_iff, INT1_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
   611
1937
e59ff0eb1e91 Proved mem_if
paulson
parents: 1920
diff changeset
   612
(*Not for Addsimps -- it can cause goals to blow up!*)
e59ff0eb1e91 Proved mem_if
paulson
parents: 1920
diff changeset
   613
goal Set.thy "(a : (if Q then x else y)) = ((Q --> a:x) & (~Q --> a : y))";
e59ff0eb1e91 Proved mem_if
paulson
parents: 1920
diff changeset
   614
by (simp_tac (!simpset setloop split_tac [expand_if]) 1);
e59ff0eb1e91 Proved mem_if
paulson
parents: 1920
diff changeset
   615
qed "mem_if";
e59ff0eb1e91 Proved mem_if
paulson
parents: 1920
diff changeset
   616
1776
d7e77cb8ce5c moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents: 1762
diff changeset
   617
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
   618
2499
0bc87b063447 Tidying of proofs. New theorems are enterred immediately into the
paulson
parents: 2031
diff changeset
   619
simpset := !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
   620
                    setmksimps (mksimps mksimps_pairs);