author | clasohm |
Wed, 07 Dec 1994 13:12:04 +0100 | |
changeset 760 | f0200e91b272 |
parent 533 | 7357160bc56a |
child 782 | 200a16083201 |
permissions | -rw-r--r-- |
0 | 1 |
(* Title: ZF/pair |
2 |
ID: $Id$ |
|
3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
|
4 |
Copyright 1992 University of Cambridge |
|
5 |
||
6 |
Ordered pairs in Zermelo-Fraenkel Set Theory |
|
7 |
*) |
|
8 |
||
9 |
(** Lemmas for showing that <a,b> uniquely determines a and b **) |
|
10 |
||
760 | 11 |
qed_goal "doubleton_iff" ZF.thy |
0 | 12 |
"{a,b} = {c,d} <-> (a=c & b=d) | (a=d & b=c)" |
13 |
(fn _=> [ (resolve_tac [extension RS iff_trans] 1), |
|
14 |
(fast_tac upair_cs 1) ]); |
|
15 |
||
760 | 16 |
qed_goalw "Pair_iff" ZF.thy [Pair_def] |
0 | 17 |
"<a,b> = <c,d> <-> a=c & b=d" |
6
8ce8c4d13d4d
Installation of new simplifier for ZF. Deleted all congruence rules not
lcp
parents:
0
diff
changeset
|
18 |
(fn _=> [ (simp_tac (FOL_ss addsimps [doubleton_iff]) 1), |
0 | 19 |
(fast_tac FOL_cs 1) ]); |
20 |
||
21 |
val Pair_inject = standard (Pair_iff RS iffD1 RS conjE); |
|
22 |
||
760 | 23 |
qed_goal "Pair_inject1" ZF.thy "<a,b> = <c,d> ==> a=c" |
0 | 24 |
(fn [major]=> |
25 |
[ (rtac (major RS Pair_inject) 1), (assume_tac 1) ]); |
|
26 |
||
760 | 27 |
qed_goal "Pair_inject2" ZF.thy "<a,b> = <c,d> ==> b=d" |
0 | 28 |
(fn [major]=> |
29 |
[ (rtac (major RS Pair_inject) 1), (assume_tac 1) ]); |
|
30 |
||
760 | 31 |
qed_goalw "Pair_neq_0" ZF.thy [Pair_def] "<a,b>=0 ==> P" |
0 | 32 |
(fn [major]=> |
33 |
[ (rtac (major RS equalityD1 RS subsetD RS emptyE) 1), |
|
34 |
(rtac consI1 1) ]); |
|
35 |
||
760 | 36 |
qed_goalw "Pair_neq_fst" ZF.thy [Pair_def] "<a,b>=a ==> P" |
0 | 37 |
(fn [major]=> |
437 | 38 |
[ (rtac (consI1 RS mem_asym RS FalseE) 1), |
0 | 39 |
(rtac (major RS subst) 1), |
40 |
(rtac consI1 1) ]); |
|
41 |
||
760 | 42 |
qed_goalw "Pair_neq_snd" ZF.thy [Pair_def] "<a,b>=b ==> P" |
0 | 43 |
(fn [major]=> |
437 | 44 |
[ (rtac (consI1 RS consI2 RS mem_asym RS FalseE) 1), |
0 | 45 |
(rtac (major RS subst) 1), |
46 |
(rtac (consI1 RS consI2) 1) ]); |
|
47 |
||
48 |
||
49 |
(*** Sigma: Disjoint union of a family of sets |
|
50 |
Generalizes Cartesian product ***) |
|
51 |
||
760 | 52 |
qed_goalw "SigmaI" ZF.thy [Sigma_def] |
0 | 53 |
"[| a:A; b:B(a) |] ==> <a,b> : Sigma(A,B)" |
54 |
(fn prems=> [ (REPEAT (resolve_tac (prems@[singletonI,UN_I]) 1)) ]); |
|
55 |
||
56 |
(*The general elimination rule*) |
|
760 | 57 |
qed_goalw "SigmaE" ZF.thy [Sigma_def] |
0 | 58 |
"[| c: Sigma(A,B); \ |
59 |
\ !!x y.[| x:A; y:B(x); c=<x,y> |] ==> P \ |
|
60 |
\ |] ==> P" |
|
61 |
(fn major::prems=> |
|
62 |
[ (cut_facts_tac [major] 1), |
|
63 |
(REPEAT (eresolve_tac [UN_E, singletonE] 1 ORELSE ares_tac prems 1)) ]); |
|
64 |
||
65 |
(** Elimination of <a,b>:A*B -- introduces no eigenvariables **) |
|
760 | 66 |
qed_goal "SigmaD1" ZF.thy "<a,b> : Sigma(A,B) ==> a : A" |
0 | 67 |
(fn [major]=> |
68 |
[ (rtac (major RS SigmaE) 1), |
|
69 |
(REPEAT (eresolve_tac [asm_rl,Pair_inject,ssubst] 1)) ]); |
|
70 |
||
760 | 71 |
qed_goal "SigmaD2" ZF.thy "<a,b> : Sigma(A,B) ==> b : B(a)" |
0 | 72 |
(fn [major]=> |
73 |
[ (rtac (major RS SigmaE) 1), |
|
74 |
(REPEAT (eresolve_tac [asm_rl,Pair_inject,ssubst] 1)) ]); |
|
75 |
||
76 |
(*Also provable via |
|
77 |
rule_by_tactic (REPEAT_FIRST (etac Pair_inject ORELSE' bound_hyp_subst_tac) |
|
78 |
THEN prune_params_tac) |
|
79 |
(read_instantiate [("c","<a,b>")] SigmaE); *) |
|
760 | 80 |
qed_goal "SigmaE2" ZF.thy |
0 | 81 |
"[| <a,b> : Sigma(A,B); \ |
82 |
\ [| a:A; b:B(a) |] ==> P \ |
|
83 |
\ |] ==> P" |
|
84 |
(fn [major,minor]=> |
|
85 |
[ (rtac minor 1), |
|
86 |
(rtac (major RS SigmaD1) 1), |
|
87 |
(rtac (major RS SigmaD2) 1) ]); |
|
88 |
||
760 | 89 |
qed_goalw "Sigma_cong" ZF.thy [Sigma_def] |
0 | 90 |
"[| A=A'; !!x. x:A' ==> B(x)=B'(x) |] ==> \ |
91 |
\ Sigma(A,B) = Sigma(A',B')" |
|
6
8ce8c4d13d4d
Installation of new simplifier for ZF. Deleted all congruence rules not
lcp
parents:
0
diff
changeset
|
92 |
(fn prems=> [ (simp_tac (FOL_ss addsimps prems addcongs [RepFun_cong]) 1) ]); |
0 | 93 |
|
760 | 94 |
qed_goal "Sigma_empty1" ZF.thy "Sigma(0,B) = 0" |
0 | 95 |
(fn _ => [ (fast_tac (lemmas_cs addIs [equalityI] addSEs [SigmaE]) 1) ]); |
96 |
||
760 | 97 |
qed_goal "Sigma_empty2" ZF.thy "A*0 = 0" |
0 | 98 |
(fn _ => [ (fast_tac (lemmas_cs addIs [equalityI] addSEs [SigmaE]) 1) ]); |
99 |
||
100 |
||
101 |
(*** Eliminator - split ***) |
|
102 |
||
760 | 103 |
qed_goalw "split" ZF.thy [split_def] |
0 | 104 |
"split(%x y.c(x,y), <a,b>) = c(a,b)" |
105 |
(fn _ => |
|
435 | 106 |
[ (fast_tac (upair_cs addIs [the_equality] addSEs [Pair_inject]) 1) ]); |
0 | 107 |
|
760 | 108 |
qed_goal "split_type" ZF.thy |
0 | 109 |
"[| p:Sigma(A,B); \ |
110 |
\ !!x y.[| x:A; y:B(x) |] ==> c(x,y):C(<x,y>) \ |
|
111 |
\ |] ==> split(%x y.c(x,y), p) : C(p)" |
|
112 |
(fn major::prems=> |
|
113 |
[ (rtac (major RS SigmaE) 1), |
|
114 |
(etac ssubst 1), |
|
115 |
(REPEAT (ares_tac (prems @ [split RS ssubst]) 1)) ]); |
|
116 |
||
435 | 117 |
|
118 |
goal ZF.thy |
|
119 |
"!!u. u: A*B ==> \ |
|
120 |
\ R(split(c,u)) <-> (ALL x:A. ALL y:B. u = <x,y> --> R(c(x,y)))"; |
|
121 |
by (etac SigmaE 1); |
|
122 |
by (asm_simp_tac (FOL_ss addsimps [split]) 1); |
|
123 |
by (fast_tac (upair_cs addSEs [Pair_inject]) 1); |
|
760 | 124 |
qed "expand_split"; |
435 | 125 |
|
126 |
||
0 | 127 |
(*** conversions for fst and snd ***) |
128 |
||
760 | 129 |
qed_goalw "fst_conv" ZF.thy [fst_def] "fst(<a,b>) = a" |
0 | 130 |
(fn _=> [ (rtac split 1) ]); |
131 |
||
760 | 132 |
qed_goalw "snd_conv" ZF.thy [snd_def] "snd(<a,b>) = b" |
0 | 133 |
(fn _=> [ (rtac split 1) ]); |
134 |
||
135 |
||
136 |
(*** split for predicates: result type o ***) |
|
137 |
||
138 |
goalw ZF.thy [fsplit_def] "!!R a b. R(a,b) ==> fsplit(R, <a,b>)"; |
|
139 |
by (REPEAT (ares_tac [refl,exI,conjI] 1)); |
|
760 | 140 |
qed "fsplitI"; |
0 | 141 |
|
142 |
val major::prems = goalw ZF.thy [fsplit_def] |
|
143 |
"[| fsplit(R,z); !!x y. [| z = <x,y>; R(x,y) |] ==> P |] ==> P"; |
|
144 |
by (cut_facts_tac [major] 1); |
|
145 |
by (REPEAT (eresolve_tac (prems@[asm_rl,exE,conjE]) 1)); |
|
760 | 146 |
qed "fsplitE"; |
0 | 147 |
|
148 |
goal ZF.thy "!!R a b. fsplit(R,<a,b>) ==> R(a,b)"; |
|
149 |
by (REPEAT (eresolve_tac [asm_rl,fsplitE,Pair_inject,ssubst] 1)); |
|
760 | 150 |
qed "fsplitD"; |
0 | 151 |
|
152 |
val pair_cs = upair_cs |
|
153 |
addSIs [SigmaI] |
|
154 |
addSEs [SigmaE2, SigmaE, Pair_inject, make_elim succ_inject, |
|
155 |
Pair_neq_0, sym RS Pair_neq_0, succ_neq_0, sym RS succ_neq_0]; |
|
156 |
||
533
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
157 |
|
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
158 |
(*** Basic simplification for ZF; see simpdata.ML for full version ***) |
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
159 |
|
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
160 |
fun prove_fun s = |
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
161 |
(writeln s; prove_goal ZF.thy s |
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
162 |
(fn prems => [ (cut_facts_tac prems 1), (fast_tac pair_cs 1) ])); |
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
163 |
|
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
164 |
(*INCLUDED IN ZF_ss*) |
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
165 |
val mem_simps = map prove_fun |
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
166 |
[ "a : 0 <-> False", |
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
167 |
"a : A Un B <-> a:A | a:B", |
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
168 |
"a : A Int B <-> a:A & a:B", |
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
169 |
"a : A-B <-> a:A & ~a:B", |
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
170 |
"<a,b>: Sigma(A,B) <-> a:A & b:B(a)", |
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
171 |
"a : Collect(A,P) <-> a:A & P(a)" ]; |
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
172 |
|
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
173 |
goal ZF.thy "{x.x:A} = A"; |
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
174 |
by (fast_tac (pair_cs addSIs [equalityI]) 1); |
760 | 175 |
qed "triv_RepFun"; |
533
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
176 |
|
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
177 |
(*INCLUDED: should be??*) |
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
178 |
val bquant_simps = map prove_fun |
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
179 |
[ "(ALL x:0.P(x)) <-> True", |
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
180 |
"(EX x:0.P(x)) <-> False", |
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
181 |
"(ALL x:succ(i).P(x)) <-> P(i) & (ALL x:i.P(x))", |
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
182 |
"(EX x:succ(i).P(x)) <-> P(i) | (EX x:i.P(x))" ]; |
7357160bc56a
ZF/pair.ML: moved some definitions here from simpdata.ML
lcp
parents:
437
diff
changeset
|
183 |