author | wenzelm |
Fri, 17 Nov 2006 02:20:03 +0100 | |
changeset 21404 | eb85850d3eb7 |
parent 21233 | 5a5c8ea5f66a |
child 32960 | 69916a850301 |
permissions | -rw-r--r-- |
13505 | 1 |
(* Title: ZF/Constructible/Wellorderings.thy |
2 |
ID: $Id$ |
|
3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
|
4 |
*) |
|
5 |
||
13223 | 6 |
header {*Relativized Wellorderings*} |
7 |
||
16417 | 8 |
theory Wellorderings imports Relative begin |
13223 | 9 |
|
10 |
text{*We define functions analogous to @{term ordermap} @{term ordertype} |
|
11 |
but without using recursion. Instead, there is a direct appeal |
|
12 |
to Replacement. This will be the basis for a version relativized |
|
13 |
to some class @{text M}. The main result is Theorem I 7.6 in Kunen, |
|
14 |
page 17.*} |
|
15 |
||
16 |
||
17 |
subsection{*Wellorderings*} |
|
18 |
||
21233 | 19 |
definition |
21404
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21233
diff
changeset
|
20 |
irreflexive :: "[i=>o,i,i]=>o" where |
13299 | 21 |
"irreflexive(M,A,r) == \<forall>x[M]. x\<in>A --> <x,x> \<notin> r" |
13223 | 22 |
|
21404
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21233
diff
changeset
|
23 |
definition |
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21233
diff
changeset
|
24 |
transitive_rel :: "[i=>o,i,i]=>o" where |
13223 | 25 |
"transitive_rel(M,A,r) == |
13299 | 26 |
\<forall>x[M]. x\<in>A --> (\<forall>y[M]. y\<in>A --> (\<forall>z[M]. z\<in>A --> |
13223 | 27 |
<x,y>\<in>r --> <y,z>\<in>r --> <x,z>\<in>r))" |
28 |
||
21404
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21233
diff
changeset
|
29 |
definition |
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21233
diff
changeset
|
30 |
linear_rel :: "[i=>o,i,i]=>o" where |
13223 | 31 |
"linear_rel(M,A,r) == |
13299 | 32 |
\<forall>x[M]. x\<in>A --> (\<forall>y[M]. y\<in>A --> <x,y>\<in>r | x=y | <y,x>\<in>r)" |
13223 | 33 |
|
21404
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21233
diff
changeset
|
34 |
definition |
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21233
diff
changeset
|
35 |
wellfounded :: "[i=>o,i]=>o" where |
13223 | 36 |
--{*EVERY non-empty set has an @{text r}-minimal element*} |
37 |
"wellfounded(M,r) == |
|
13628
87482b5e3f2e
Various simplifications of the Constructible theories
paulson
parents:
13615
diff
changeset
|
38 |
\<forall>x[M]. x\<noteq>0 --> (\<exists>y[M]. y\<in>x & ~(\<exists>z[M]. z\<in>x & <z,y> \<in> r))" |
21404
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21233
diff
changeset
|
39 |
definition |
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21233
diff
changeset
|
40 |
wellfounded_on :: "[i=>o,i,i]=>o" where |
13223 | 41 |
--{*every non-empty SUBSET OF @{text A} has an @{text r}-minimal element*} |
42 |
"wellfounded_on(M,A,r) == |
|
13628
87482b5e3f2e
Various simplifications of the Constructible theories
paulson
parents:
13615
diff
changeset
|
43 |
\<forall>x[M]. x\<noteq>0 --> x\<subseteq>A --> (\<exists>y[M]. y\<in>x & ~(\<exists>z[M]. z\<in>x & <z,y> \<in> r))" |
13223 | 44 |
|
21404
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21233
diff
changeset
|
45 |
definition |
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21233
diff
changeset
|
46 |
wellordered :: "[i=>o,i,i]=>o" where |
13513 | 47 |
--{*linear and wellfounded on @{text A}*} |
13223 | 48 |
"wellordered(M,A,r) == |
49 |
transitive_rel(M,A,r) & linear_rel(M,A,r) & wellfounded_on(M,A,r)" |
|
50 |
||
51 |
||
52 |
subsubsection {*Trivial absoluteness proofs*} |
|
53 |
||
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
54 |
lemma (in M_basic) irreflexive_abs [simp]: |
13223 | 55 |
"M(A) ==> irreflexive(M,A,r) <-> irrefl(A,r)" |
56 |
by (simp add: irreflexive_def irrefl_def) |
|
57 |
||
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
58 |
lemma (in M_basic) transitive_rel_abs [simp]: |
13223 | 59 |
"M(A) ==> transitive_rel(M,A,r) <-> trans[A](r)" |
60 |
by (simp add: transitive_rel_def trans_on_def) |
|
61 |
||
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
62 |
lemma (in M_basic) linear_rel_abs [simp]: |
13223 | 63 |
"M(A) ==> linear_rel(M,A,r) <-> linear(A,r)" |
64 |
by (simp add: linear_rel_def linear_def) |
|
65 |
||
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
66 |
lemma (in M_basic) wellordered_is_trans_on: |
13223 | 67 |
"[| wellordered(M,A,r); M(A) |] ==> trans[A](r)" |
13505 | 68 |
by (auto simp add: wellordered_def) |
13223 | 69 |
|
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
70 |
lemma (in M_basic) wellordered_is_linear: |
13223 | 71 |
"[| wellordered(M,A,r); M(A) |] ==> linear(A,r)" |
13505 | 72 |
by (auto simp add: wellordered_def) |
13223 | 73 |
|
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
74 |
lemma (in M_basic) wellordered_is_wellfounded_on: |
13223 | 75 |
"[| wellordered(M,A,r); M(A) |] ==> wellfounded_on(M,A,r)" |
13505 | 76 |
by (auto simp add: wellordered_def) |
13223 | 77 |
|
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
78 |
lemma (in M_basic) wellfounded_imp_wellfounded_on: |
13223 | 79 |
"[| wellfounded(M,r); M(A) |] ==> wellfounded_on(M,A,r)" |
80 |
by (auto simp add: wellfounded_def wellfounded_on_def) |
|
81 |
||
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
82 |
lemma (in M_basic) wellfounded_on_subset_A: |
13269 | 83 |
"[| wellfounded_on(M,A,r); B<=A |] ==> wellfounded_on(M,B,r)" |
84 |
by (simp add: wellfounded_on_def, blast) |
|
85 |
||
13223 | 86 |
|
87 |
subsubsection {*Well-founded relations*} |
|
88 |
||
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
89 |
lemma (in M_basic) wellfounded_on_iff_wellfounded: |
13223 | 90 |
"wellfounded_on(M,A,r) <-> wellfounded(M, r \<inter> A*A)" |
91 |
apply (simp add: wellfounded_on_def wellfounded_def, safe) |
|
13780 | 92 |
apply force |
13299 | 93 |
apply (drule_tac x=x in rspec, assumption, blast) |
13223 | 94 |
done |
95 |
||
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
96 |
lemma (in M_basic) wellfounded_on_imp_wellfounded: |
13247 | 97 |
"[|wellfounded_on(M,A,r); r \<subseteq> A*A|] ==> wellfounded(M,r)" |
98 |
by (simp add: wellfounded_on_iff_wellfounded subset_Int_iff) |
|
99 |
||
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
100 |
lemma (in M_basic) wellfounded_on_field_imp_wellfounded: |
13269 | 101 |
"wellfounded_on(M, field(r), r) ==> wellfounded(M,r)" |
102 |
by (simp add: wellfounded_def wellfounded_on_iff_wellfounded, fast) |
|
103 |
||
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
104 |
lemma (in M_basic) wellfounded_iff_wellfounded_on_field: |
13269 | 105 |
"M(r) ==> wellfounded(M,r) <-> wellfounded_on(M, field(r), r)" |
106 |
by (blast intro: wellfounded_imp_wellfounded_on |
|
107 |
wellfounded_on_field_imp_wellfounded) |
|
108 |
||
13251
74cb2af8811e
new treatment of wfrec, replacing wf[A](r) by wf(r)
paulson
parents:
13247
diff
changeset
|
109 |
(*Consider the least z in domain(r) such that P(z) does not hold...*) |
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
110 |
lemma (in M_basic) wellfounded_induct: |
13251
74cb2af8811e
new treatment of wfrec, replacing wf[A](r) by wf(r)
paulson
parents:
13247
diff
changeset
|
111 |
"[| wellfounded(M,r); M(a); M(r); separation(M, \<lambda>x. ~P(x)); |
74cb2af8811e
new treatment of wfrec, replacing wf[A](r) by wf(r)
paulson
parents:
13247
diff
changeset
|
112 |
\<forall>x. M(x) & (\<forall>y. <y,x> \<in> r --> P(y)) --> P(x) |] |
74cb2af8811e
new treatment of wfrec, replacing wf[A](r) by wf(r)
paulson
parents:
13247
diff
changeset
|
113 |
==> P(a)"; |
74cb2af8811e
new treatment of wfrec, replacing wf[A](r) by wf(r)
paulson
parents:
13247
diff
changeset
|
114 |
apply (simp (no_asm_use) add: wellfounded_def) |
13299 | 115 |
apply (drule_tac x="{z \<in> domain(r). ~P(z)}" in rspec) |
116 |
apply (blast dest: transM)+ |
|
13251
74cb2af8811e
new treatment of wfrec, replacing wf[A](r) by wf(r)
paulson
parents:
13247
diff
changeset
|
117 |
done |
74cb2af8811e
new treatment of wfrec, replacing wf[A](r) by wf(r)
paulson
parents:
13247
diff
changeset
|
118 |
|
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
119 |
lemma (in M_basic) wellfounded_on_induct: |
13223 | 120 |
"[| a\<in>A; wellfounded_on(M,A,r); M(A); |
121 |
separation(M, \<lambda>x. x\<in>A --> ~P(x)); |
|
122 |
\<forall>x\<in>A. M(x) & (\<forall>y\<in>A. <y,x> \<in> r --> P(y)) --> P(x) |] |
|
123 |
==> P(a)"; |
|
124 |
apply (simp (no_asm_use) add: wellfounded_on_def) |
|
13299 | 125 |
apply (drule_tac x="{z\<in>A. z\<in>A --> ~P(z)}" in rspec) |
126 |
apply (blast intro: transM)+ |
|
13223 | 127 |
done |
128 |
||
129 |
||
130 |
subsubsection {*Kunen's lemma IV 3.14, page 123*} |
|
131 |
||
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
132 |
lemma (in M_basic) linear_imp_relativized: |
13223 | 133 |
"linear(A,r) ==> linear_rel(M,A,r)" |
134 |
by (simp add: linear_def linear_rel_def) |
|
135 |
||
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
136 |
lemma (in M_basic) trans_on_imp_relativized: |
13223 | 137 |
"trans[A](r) ==> transitive_rel(M,A,r)" |
138 |
by (unfold transitive_rel_def trans_on_def, blast) |
|
139 |
||
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
140 |
lemma (in M_basic) wf_on_imp_relativized: |
13223 | 141 |
"wf[A](r) ==> wellfounded_on(M,A,r)" |
142 |
apply (simp add: wellfounded_on_def wf_def wf_on_def, clarify) |
|
13339
0f89104dd377
Fixed quantified variable name preservation for ball and bex (bounded quants)
paulson
parents:
13306
diff
changeset
|
143 |
apply (drule_tac x=x in spec, blast) |
13223 | 144 |
done |
145 |
||
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
146 |
lemma (in M_basic) wf_imp_relativized: |
13223 | 147 |
"wf(r) ==> wellfounded(M,r)" |
148 |
apply (simp add: wellfounded_def wf_def, clarify) |
|
13339
0f89104dd377
Fixed quantified variable name preservation for ball and bex (bounded quants)
paulson
parents:
13306
diff
changeset
|
149 |
apply (drule_tac x=x in spec, blast) |
13223 | 150 |
done |
151 |
||
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
152 |
lemma (in M_basic) well_ord_imp_relativized: |
13223 | 153 |
"well_ord(A,r) ==> wellordered(M,A,r)" |
154 |
by (simp add: wellordered_def well_ord_def tot_ord_def part_ord_def |
|
155 |
linear_imp_relativized trans_on_imp_relativized wf_on_imp_relativized) |
|
156 |
||
157 |
||
158 |
subsection{* Relativized versions of order-isomorphisms and order types *} |
|
159 |
||
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
160 |
lemma (in M_basic) order_isomorphism_abs [simp]: |
13223 | 161 |
"[| M(A); M(B); M(f) |] |
162 |
==> order_isomorphism(M,A,r,B,s,f) <-> f \<in> ord_iso(A,r,B,s)" |
|
13352 | 163 |
by (simp add: apply_closed order_isomorphism_def ord_iso_def) |
13223 | 164 |
|
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
165 |
lemma (in M_basic) pred_set_abs [simp]: |
13223 | 166 |
"[| M(r); M(B) |] ==> pred_set(M,A,x,r,B) <-> B = Order.pred(A,x,r)" |
167 |
apply (simp add: pred_set_def Order.pred_def) |
|
168 |
apply (blast dest: transM) |
|
169 |
done |
|
170 |
||
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
171 |
lemma (in M_basic) pred_closed [intro,simp]: |
13223 | 172 |
"[| M(A); M(r); M(x) |] ==> M(Order.pred(A,x,r))" |
173 |
apply (simp add: Order.pred_def) |
|
13245 | 174 |
apply (insert pred_separation [of r x], simp) |
13223 | 175 |
done |
176 |
||
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
177 |
lemma (in M_basic) membership_abs [simp]: |
13223 | 178 |
"[| M(r); M(A) |] ==> membership(M,A,r) <-> r = Memrel(A)" |
179 |
apply (simp add: membership_def Memrel_def, safe) |
|
180 |
apply (rule equalityI) |
|
181 |
apply clarify |
|
182 |
apply (frule transM, assumption) |
|
183 |
apply blast |
|
184 |
apply clarify |
|
185 |
apply (subgoal_tac "M(<xb,ya>)", blast) |
|
186 |
apply (blast dest: transM) |
|
187 |
apply auto |
|
188 |
done |
|
189 |
||
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
190 |
lemma (in M_basic) M_Memrel_iff: |
13223 | 191 |
"M(A) ==> |
13298 | 192 |
Memrel(A) = {z \<in> A*A. \<exists>x[M]. \<exists>y[M]. z = \<langle>x,y\<rangle> & x \<in> y}" |
13223 | 193 |
apply (simp add: Memrel_def) |
194 |
apply (blast dest: transM) |
|
195 |
done |
|
196 |
||
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
197 |
lemma (in M_basic) Memrel_closed [intro,simp]: |
13223 | 198 |
"M(A) ==> M(Memrel(A))" |
199 |
apply (simp add: M_Memrel_iff) |
|
13245 | 200 |
apply (insert Memrel_separation, simp) |
13223 | 201 |
done |
202 |
||
203 |
||
204 |
subsection {* Main results of Kunen, Chapter 1 section 6 *} |
|
205 |
||
206 |
text{*Subset properties-- proved outside the locale*} |
|
207 |
||
208 |
lemma linear_rel_subset: |
|
209 |
"[| linear_rel(M,A,r); B<=A |] ==> linear_rel(M,B,r)" |
|
210 |
by (unfold linear_rel_def, blast) |
|
211 |
||
212 |
lemma transitive_rel_subset: |
|
213 |
"[| transitive_rel(M,A,r); B<=A |] ==> transitive_rel(M,B,r)" |
|
214 |
by (unfold transitive_rel_def, blast) |
|
215 |
||
216 |
lemma wellfounded_on_subset: |
|
217 |
"[| wellfounded_on(M,A,r); B<=A |] ==> wellfounded_on(M,B,r)" |
|
218 |
by (unfold wellfounded_on_def subset_def, blast) |
|
219 |
||
220 |
lemma wellordered_subset: |
|
221 |
"[| wellordered(M,A,r); B<=A |] ==> wellordered(M,B,r)" |
|
222 |
apply (unfold wellordered_def) |
|
223 |
apply (blast intro: linear_rel_subset transitive_rel_subset |
|
224 |
wellfounded_on_subset) |
|
225 |
done |
|
226 |
||
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
227 |
lemma (in M_basic) wellfounded_on_asym: |
13223 | 228 |
"[| wellfounded_on(M,A,r); <a,x>\<in>r; a\<in>A; x\<in>A; M(A) |] ==> <x,a>\<notin>r" |
229 |
apply (simp add: wellfounded_on_def) |
|
13299 | 230 |
apply (drule_tac x="{x,a}" in rspec) |
231 |
apply (blast dest: transM)+ |
|
13223 | 232 |
done |
233 |
||
13564
1500a2e48d44
renamed M_triv_axioms to M_trivial and M_axioms to M_basic
paulson
parents:
13513
diff
changeset
|
234 |
lemma (in M_basic) wellordered_asym: |
13223 | 235 |
"[| wellordered(M,A,r); <a,x>\<in>r; a\<in>A; x\<in>A; M(A) |] ==> <x,a>\<notin>r" |
236 |
by (simp add: wellordered_def, blast dest: wellfounded_on_asym) |
|
237 |
||
238 |
end |