9791
|
1 |
(* Title: HOL/BCV/Listn.ML
|
|
2 |
ID: $Id$
|
|
3 |
Author: Tobias Nipkow
|
|
4 |
Copyright 2000 TUM
|
|
5 |
*)
|
|
6 |
|
|
7 |
Addsimps [set_update_subsetI];
|
|
8 |
|
|
9 |
Goalw [lesub_def] "xs <=[r] ys == Listn.le r xs ys";
|
|
10 |
by (Simp_tac 1);
|
|
11 |
qed "unfold_lesub_list";
|
|
12 |
|
|
13 |
Goalw [lesub_def,Listn.le_def] "([] <=[r] ys) = (ys = [])";
|
|
14 |
by (Simp_tac 1);
|
|
15 |
qed "Nil_le_conv";
|
|
16 |
|
|
17 |
Goalw [lesub_def,Listn.le_def] "~ x#xs <=[r] []";
|
|
18 |
by (Simp_tac 1);
|
|
19 |
qed "Cons_notle_Nil";
|
|
20 |
|
|
21 |
AddIffs [Nil_le_conv,Cons_notle_Nil];
|
|
22 |
|
|
23 |
Goalw [lesub_def,Listn.le_def] "x#xs <=[r] y#ys = (x <=_r y & xs <=[r] ys)";
|
10172
|
24 |
by (Simp_tac 1);
|
9791
|
25 |
qed "Cons_le_Cons";
|
|
26 |
AddIffs [Cons_le_Cons];
|
|
27 |
|
|
28 |
Goalw [lesssub_def] "order r ==> \
|
|
29 |
\ x#xs <_(Listn.le r) y#ys = \
|
|
30 |
\ (x <_r y & xs <=[r] ys | x = y & xs <_(Listn.le r) ys)";
|
|
31 |
by (Blast_tac 1);
|
|
32 |
qed "Cons_less_Cons";
|
|
33 |
Addsimps [Cons_less_Cons];
|
|
34 |
|
|
35 |
Goalw [unfold_lesub_list]
|
|
36 |
"[| i<size xs; xs <=[r] ys; x <=_r y |] ==> xs[i:=x] <=[r] ys[i:=y]";
|
10172
|
37 |
by (rewtac Listn.le_def);
|
9791
|
38 |
by (asm_full_simp_tac (simpset() addsimps [list_all2_conv_all_nth,nth_list_update]) 1);
|
|
39 |
qed "list_update_le_cong";
|
|
40 |
|
|
41 |
|
|
42 |
Goalw [Listn.le_def,lesub_def]
|
|
43 |
"[| xs <=[r] ys; p < size xs |] ==> xs!p <=_r ys!p";
|
|
44 |
by (asm_full_simp_tac (simpset() addsimps [list_all2_conv_all_nth]) 1);
|
|
45 |
qed "le_listD";
|
|
46 |
|
|
47 |
Goalw [unfold_lesub_list] "!x. x <=_r x ==> xs <=[r] xs";
|
|
48 |
by (asm_simp_tac (simpset() addsimps [Listn.le_def,list_all2_conv_all_nth]) 1);
|
|
49 |
qed "le_list_refl";
|
|
50 |
|
|
51 |
Goalw [unfold_lesub_list]
|
|
52 |
"[| order r; xs <=[r] ys; ys <=[r] zs |] ==> xs <=[r] zs";
|
|
53 |
by (asm_full_simp_tac(simpset()addsimps[Listn.le_def,list_all2_conv_all_nth])1);
|
|
54 |
by (Clarify_tac 1);
|
|
55 |
by (Asm_full_simp_tac 1);
|
|
56 |
by (blast_tac (claset() addIs [order_trans]) 1);
|
|
57 |
qed "le_list_trans";
|
|
58 |
|
|
59 |
Goalw [unfold_lesub_list]
|
|
60 |
"[| order r; xs <=[r] ys; ys <=[r] xs |] ==> xs = ys";
|
|
61 |
by (asm_full_simp_tac(simpset()addsimps[Listn.le_def,list_all2_conv_all_nth])1);
|
10172
|
62 |
by (rtac nth_equalityI 1);
|
9791
|
63 |
by (Blast_tac 1);
|
|
64 |
by (Clarify_tac 1);
|
|
65 |
by (Asm_full_simp_tac 1);
|
|
66 |
by (blast_tac (claset() addIs [order_antisym]) 1);
|
|
67 |
qed "le_list_antisym";
|
|
68 |
|
|
69 |
Goal "order r ==> order(Listn.le r)";
|
10172
|
70 |
by (stac order_def 1);
|
|
71 |
by (blast_tac (claset() addIs [le_list_refl,le_list_trans,le_list_antisym]
|
9791
|
72 |
addDs [order_refl]) 1);
|
|
73 |
qed "order_listI";
|
|
74 |
Addsimps [order_listI];
|
|
75 |
AddSIs [order_listI];
|
|
76 |
|
|
77 |
|
|
78 |
Goalw [Listn.le_def,lesub_def] "xs <=[r] ys ==> size ys = size xs";
|
|
79 |
by (asm_full_simp_tac(simpset()addsimps[list_all2_conv_all_nth])1);
|
|
80 |
qed "lesub_list_impl_same_size";
|
|
81 |
Addsimps [lesub_list_impl_same_size];
|
|
82 |
|
|
83 |
Goalw [lesssub_def] "xs <_(Listn.le r) ys ==> size ys = size xs";
|
10172
|
84 |
by (Auto_tac);
|
9791
|
85 |
qed "lesssub_list_impl_same_size";
|
|
86 |
|
|
87 |
Goalw [list_def] "[| length xs = n; set xs <= A |] ==> xs : list n A";
|
10172
|
88 |
by (Blast_tac 1);
|
9791
|
89 |
qed "listI";
|
|
90 |
|
|
91 |
Goalw [list_def] "xs : list n A ==> length xs = n";
|
|
92 |
by (Blast_tac 1);
|
|
93 |
qed "listE_length";
|
|
94 |
Addsimps [listE_length];
|
|
95 |
|
|
96 |
Goal "[| xs : list n A; p < n |] ==> p < length xs";
|
10172
|
97 |
by (Asm_simp_tac 1);
|
9791
|
98 |
qed "less_lengthI";
|
|
99 |
|
|
100 |
Goalw [list_def] "xs : list n A ==> set xs <= A";
|
|
101 |
by (Blast_tac 1);
|
|
102 |
qed "listE_set";
|
|
103 |
Addsimps [listE_set];
|
|
104 |
|
|
105 |
Goalw [list_def] "list 0 A = {[]}";
|
|
106 |
by (Auto_tac);
|
|
107 |
qed "list_0";
|
|
108 |
Addsimps [list_0];
|
|
109 |
|
|
110 |
Goalw [list_def]
|
|
111 |
"(xs : list (Suc n) A) = (? y:A. ? ys:list n A. xs = y#ys)";
|
|
112 |
by (case_tac "xs" 1);
|
|
113 |
by (Auto_tac);
|
|
114 |
qed "in_list_Suc_iff";
|
|
115 |
|
|
116 |
Goal "(x#xs : list (Suc n) A) = (x:A & xs : list n A)";
|
|
117 |
by (simp_tac (simpset() addsimps [in_list_Suc_iff]) 1);
|
|
118 |
by (Blast_tac 1);
|
|
119 |
qed "Cons_in_list_Suc";
|
|
120 |
AddIffs [Cons_in_list_Suc];
|
|
121 |
|
|
122 |
Goal "? a. a:A ==> ? xs. xs : list n A";
|
|
123 |
by (induct_tac "n" 1);
|
|
124 |
by (Simp_tac 1);
|
|
125 |
by (asm_simp_tac (simpset() addsimps [in_list_Suc_iff]) 1);
|
|
126 |
by (Blast_tac 1);
|
|
127 |
qed "list_not_empty";
|
|
128 |
|
|
129 |
|
|
130 |
Goal "!i n. length xs = n --> set xs <= A --> i < n --> (xs!i) : A";
|
|
131 |
by (induct_tac "xs" 1);
|
|
132 |
by (Simp_tac 1);
|
|
133 |
by (asm_full_simp_tac (simpset() addsimps [nth_Cons] addsplits [nat.split]) 1);
|
|
134 |
qed_spec_mp "nth_in";
|
|
135 |
Addsimps [nth_in];
|
|
136 |
|
|
137 |
Goal "[| xs : list n A; i < n |] ==> (xs!i) : A";
|
|
138 |
by (blast_tac (HOL_cs addIs [nth_in,listE_length,listE_set]) 1);
|
|
139 |
qed "listE_nth_in";
|
|
140 |
|
|
141 |
Goalw [list_def]
|
|
142 |
"[| xs : list n A; x:A |] ==> xs[i := x] : list n A";
|
|
143 |
by (Asm_full_simp_tac 1);
|
|
144 |
qed "list_update_in_list";
|
|
145 |
Addsimps [list_update_in_list];
|
|
146 |
AddSIs [list_update_in_list];
|
|
147 |
|
|
148 |
Goalw [plussub_def,map2_def] "[] +[f] xs = []";
|
|
149 |
by (Simp_tac 1);
|
|
150 |
qed "plus_list_Nil";
|
|
151 |
Addsimps [plus_list_Nil];
|
|
152 |
|
|
153 |
Goal
|
|
154 |
"(x#xs) +[f] ys = (case ys of [] => [] | y#ys => (x +_f y)#(xs +[f] ys))";
|
|
155 |
by (simp_tac (simpset() addsimps [plussub_def,map2_def] addsplits [list.split]) 1);
|
|
156 |
qed "plus_list_Cons";
|
|
157 |
Addsimps [plus_list_Cons];
|
|
158 |
|
|
159 |
Goal "!ys. length(xs +[f] ys) = min(length xs) (length ys)";
|
|
160 |
by (induct_tac "xs" 1);
|
|
161 |
by (Simp_tac 1);
|
10172
|
162 |
by (Clarify_tac 1);
|
9791
|
163 |
by (asm_simp_tac (simpset() addsplits [list.split]) 1);
|
|
164 |
qed_spec_mp "length_plus_list";
|
|
165 |
Addsimps [length_plus_list];
|
|
166 |
|
|
167 |
Goal
|
|
168 |
"!xs ys i. length xs = n --> length ys = n --> i<n --> \
|
|
169 |
\ (xs +[f] ys)!i = (xs!i) +_f (ys!i)";
|
|
170 |
by (induct_tac "n" 1);
|
|
171 |
by (Simp_tac 1);
|
|
172 |
by (Clarify_tac 1);
|
|
173 |
by (case_tac "xs" 1);
|
|
174 |
by (Asm_full_simp_tac 1);
|
|
175 |
by (force_tac (claset(),simpset() addsimps [nth_Cons]
|
|
176 |
addsplits [list.split,nat.split]) 1);
|
|
177 |
qed_spec_mp "nth_plus_list";
|
|
178 |
Addsimps [nth_plus_list];
|
|
179 |
|
|
180 |
Goalw [unfold_lesub_list]
|
|
181 |
"[| semilat(A,r,f); set xs <= A; set ys <= A; size xs = size ys |] \
|
|
182 |
\ ==> xs <=[r] xs +[f] ys";
|
|
183 |
by (asm_full_simp_tac(simpset()addsimps[Listn.le_def,list_all2_conv_all_nth])1);
|
|
184 |
qed_spec_mp "plus_list_ub1";
|
|
185 |
|
|
186 |
Goalw [unfold_lesub_list]
|
|
187 |
"[| semilat(A,r,f); set xs <= A; set ys <= A; size xs = size ys |] \
|
|
188 |
\ ==> ys <=[r] xs +[f] ys";
|
|
189 |
by (asm_full_simp_tac(simpset()addsimps[Listn.le_def,list_all2_conv_all_nth])1);
|
|
190 |
qed_spec_mp "plus_list_ub2";
|
|
191 |
|
|
192 |
Goalw [unfold_lesub_list]
|
|
193 |
"semilat(A,r,f) ==> !xs ys zs. set xs <= A --> set ys <= A --> set zs <= A \
|
|
194 |
\ --> size xs = n & size ys = n --> \
|
|
195 |
\ xs <=[r] zs & ys <=[r] zs --> xs +[f] ys <=[r] zs";
|
|
196 |
by (asm_full_simp_tac(simpset()addsimps[Listn.le_def,list_all2_conv_all_nth])1);
|
|
197 |
qed_spec_mp "plus_list_lub";
|
|
198 |
|
|
199 |
Goalw [unfold_lesub_list]
|
|
200 |
"[| semilat(A,r,f); x:A |] ==> set xs <= A --> \
|
|
201 |
\ (!i. i<size xs --> xs <=[r] xs[i := x +_f xs!i])";
|
|
202 |
by (simp_tac(simpset()addsimps[Listn.le_def,list_all2_conv_all_nth])1);
|
|
203 |
by (induct_tac "xs" 1);
|
|
204 |
by (Simp_tac 1);
|
|
205 |
by (asm_simp_tac (simpset() addsimps [in_list_Suc_iff]) 1);
|
|
206 |
by (Clarify_tac 1);
|
|
207 |
by (asm_simp_tac (simpset() addsimps [nth_Cons] addsplits [nat.split]) 1);
|
|
208 |
qed_spec_mp "list_update_incr";
|
|
209 |
|
|
210 |
Goalw [acc_def] "[| order r; acc r |] ==> acc(Listn.le r)";
|
10172
|
211 |
by (subgoal_tac
|
9791
|
212 |
"wf(UN n. {(ys,xs). size xs = n & size ys = n & xs <_(Listn.le r) ys})" 1);
|
10172
|
213 |
by (etac wf_subset 1);
|
|
214 |
by (blast_tac (claset() addIs [lesssub_list_impl_same_size]) 1);
|
|
215 |
by (rtac wf_UN 1);
|
9791
|
216 |
by (Clarify_tac 2);
|
10172
|
217 |
by (rename_tac "m n" 2);
|
|
218 |
by (case_tac "m=n" 2);
|
|
219 |
by (Asm_full_simp_tac 2);
|
|
220 |
by (rtac conjI 2);
|
|
221 |
by (fast_tac (claset() addSIs [equals0I] addDs [not_sym]) 2);
|
|
222 |
by (fast_tac (claset() addSIs [equals0I] addDs [not_sym]) 2);
|
9791
|
223 |
by (Clarify_tac 1);
|
10172
|
224 |
by (rename_tac "n" 1);
|
9791
|
225 |
by (induct_tac "n" 1);
|
|
226 |
by (simp_tac (simpset() addsimps [lesssub_def] addcongs [conj_cong]) 1);
|
10172
|
227 |
by (rename_tac "k" 1);
|
9791
|
228 |
by (asm_full_simp_tac (simpset() addsimps [wf_eq_minimal]) 1);
|
|
229 |
by (simp_tac (simpset() addsimps [length_Suc_conv] addcongs [conj_cong]) 1);
|
|
230 |
by (Clarify_tac 1);
|
|
231 |
by (rename_tac "M m" 1);
|
|
232 |
by (case_tac "? x xs. size xs = k & x#xs : M" 1);
|
|
233 |
by (etac thin_rl 2);
|
|
234 |
by (etac thin_rl 2);
|
|
235 |
by (Blast_tac 2);
|
|
236 |
by (eres_inst_tac [("x","{a. ? xs. size xs = k & a#xs:M}")] allE 1);
|
|
237 |
by (etac impE 1);
|
|
238 |
by (Blast_tac 1);
|
|
239 |
by (thin_tac "? x xs. ?P x xs" 1);
|
|
240 |
by (Clarify_tac 1);
|
|
241 |
by (rename_tac "maxA xs" 1);
|
|
242 |
by (eres_inst_tac [("x","{ys. size ys = size xs & maxA#ys : M}")] allE 1);
|
10172
|
243 |
by (etac impE 1);
|
|
244 |
by (Blast_tac 1);
|
9791
|
245 |
by (Clarify_tac 1);
|
|
246 |
by (thin_tac "m : M" 1);
|
|
247 |
by (thin_tac "maxA#xs : M" 1);
|
|
248 |
by (rtac bexI 1);
|
10172
|
249 |
by (assume_tac 2);
|
9791
|
250 |
by (Clarify_tac 1);
|
10172
|
251 |
by (Asm_full_simp_tac 1);
|
|
252 |
by (Blast_tac 1);
|
9791
|
253 |
qed "acc_le_listI";
|
|
254 |
AddSIs [acc_le_listI];
|
|
255 |
|
|
256 |
|
|
257 |
Goalw [closed_def]
|
|
258 |
"closed S f ==> closed (list n S) (map2 f)";
|
10172
|
259 |
by (induct_tac "n" 1);
|
|
260 |
by (Simp_tac 1);
|
|
261 |
by (Clarify_tac 1);
|
9791
|
262 |
by (asm_full_simp_tac (simpset() addsimps [in_list_Suc_iff]) 1);
|
10172
|
263 |
by (Clarify_tac 1);
|
|
264 |
by (Simp_tac 1);
|
9791
|
265 |
by (Blast_tac 1);
|
|
266 |
qed "closed_listI";
|
|
267 |
|
|
268 |
|
|
269 |
Goalw [Listn.sl_def]
|
|
270 |
"!!L. semilat L ==> semilat (Listn.sl n L)";
|
10172
|
271 |
by (split_all_tac 1);
|
10918
|
272 |
by (simp_tac (HOL_basic_ss addsimps [semilat_Def, split_conv]) 1);
|
10172
|
273 |
by (rtac conjI 1);
|
|
274 |
by (Asm_simp_tac 1);
|
|
275 |
by (rtac conjI 1);
|
|
276 |
by (asm_simp_tac(HOL_basic_ss addsimps [semilatDclosedI,closed_listI]) 1);
|
|
277 |
by (simp_tac (HOL_basic_ss addsimps [list_def]) 1);
|
9791
|
278 |
by (asm_simp_tac (simpset() addsimps [plus_list_ub1,plus_list_ub2,plus_list_lub]) 1);
|
|
279 |
qed "semilat_Listn_sl";
|
|
280 |
|
|
281 |
|
|
282 |
Goal "!xes. xes : list n (err A) --> coalesce xes : err(list n A)";
|
10172
|
283 |
by (induct_tac "n" 1);
|
|
284 |
by (Simp_tac 1);
|
|
285 |
by (Clarify_tac 1);
|
9791
|
286 |
by (asm_full_simp_tac (simpset() addsimps [in_list_Suc_iff]) 1);
|
10172
|
287 |
by (Clarify_tac 1);
|
9791
|
288 |
by (simp_tac (simpset() addsimps [plussub_def,Err.sup_def,lift2_def] addsplits [err.split]) 1);
|
10172
|
289 |
by (Force_tac 1);
|
9791
|
290 |
qed_spec_mp "coalesce_in_err_list";
|
|
291 |
|
|
292 |
|
|
293 |
Goal "x +_(op #) xs = x#xs";
|
|
294 |
by (simp_tac (simpset() addsimps [plussub_def]) 1);
|
|
295 |
val lemma = result();
|
|
296 |
|
|
297 |
Goal
|
|
298 |
"semilat(err A, Err.le r, lift2 f) ==> \
|
|
299 |
\ !xs. xs : list n A --> (!ys. ys : list n A --> \
|
|
300 |
\ (!zs. coalesce (xs +[f] ys) = OK zs --> xs <=[r] zs))";
|
10172
|
301 |
by (induct_tac "n" 1);
|
|
302 |
by (Simp_tac 1);
|
|
303 |
by (Clarify_tac 1);
|
9791
|
304 |
by (asm_full_simp_tac (simpset() addsimps [in_list_Suc_iff]) 1);
|
10172
|
305 |
by (Clarify_tac 1);
|
9791
|
306 |
by (full_simp_tac (simpset() addsplits [err.split_asm] addsimps [lemma,Err.sup_def,lift2_def]) 1);
|
10172
|
307 |
by (force_tac (claset(), simpset() addsimps [semilat_le_err_OK1]) 1);
|
9791
|
308 |
qed_spec_mp "coalesce_eq_OK1_D";
|
|
309 |
|
|
310 |
Goal
|
|
311 |
"semilat(err A, Err.le r, lift2 f) ==> \
|
|
312 |
\ !xs. xs : list n A --> (!ys. ys : list n A --> \
|
|
313 |
\ (!zs. coalesce (xs +[f] ys) = OK zs --> ys <=[r] zs))";
|
10172
|
314 |
by (induct_tac "n" 1);
|
|
315 |
by (Simp_tac 1);
|
|
316 |
by (Clarify_tac 1);
|
9791
|
317 |
by (asm_full_simp_tac (simpset() addsimps [in_list_Suc_iff]) 1);
|
10172
|
318 |
by (Clarify_tac 1);
|
9791
|
319 |
by (full_simp_tac (simpset() addsplits [err.split_asm] addsimps [lemma,Err.sup_def,lift2_def]) 1);
|
10172
|
320 |
by (force_tac (claset(), simpset() addsimps [semilat_le_err_OK2]) 1);
|
9791
|
321 |
qed_spec_mp "coalesce_eq_OK2_D";
|
|
322 |
|
|
323 |
Goalw [semilat_Def,plussub_def,err_def]
|
|
324 |
"[| semilat(err A, Err.le r, lift2 f); x:A; y:A; x +_f y = OK z; \
|
|
325 |
\ u:A; x <=_r u; y <=_r u |] ==> z <=_r u";
|
10172
|
326 |
by (asm_full_simp_tac (simpset() addsimps [lift2_def]) 1);
|
|
327 |
by (Clarify_tac 1);
|
|
328 |
by (rotate_tac ~3 1);
|
|
329 |
by (etac thin_rl 1);
|
|
330 |
by (etac thin_rl 1);
|
|
331 |
by (Force_tac 1);
|
9791
|
332 |
qed "lift2_le_ub";
|
|
333 |
|
|
334 |
Goal
|
|
335 |
"semilat(err A, Err.le r, lift2 f) ==> \
|
|
336 |
\ !xs. xs : list n A --> (!ys. ys : list n A --> \
|
|
337 |
\ (!zs us. coalesce (xs +[f] ys) = OK zs & xs <=[r] us & ys <=[r] us \
|
|
338 |
\ & us : list n A --> zs <=[r] us))";
|
10172
|
339 |
by (induct_tac "n" 1);
|
|
340 |
by (Simp_tac 1);
|
|
341 |
by (Clarify_tac 1);
|
9791
|
342 |
by (asm_full_simp_tac (simpset() addsimps [in_list_Suc_iff]) 1);
|
10172
|
343 |
by (Clarify_tac 1);
|
9791
|
344 |
by (full_simp_tac (simpset() addsplits [err.split_asm] addsimps [lemma,Err.sup_def,lift2_def]) 1);
|
10172
|
345 |
by (Clarify_tac 1);
|
|
346 |
by (rtac conjI 1);
|
|
347 |
by (Blast_tac 2);
|
|
348 |
by (blast_tac (claset() addIs [lift2_le_ub]) 1);
|
9791
|
349 |
qed_spec_mp "coalesce_eq_OK_ub_D";
|
|
350 |
|
|
351 |
Goal
|
|
352 |
"[| x +_f y = Err; semilat(err A, Err.le r, lift2 f); x:A; y:A |] \
|
|
353 |
\ ==> ~(? u:A. x <=_r u & y <=_r u)";
|
10172
|
354 |
by (asm_simp_tac (simpset() addsimps [OK_plus_OK_eq_Err_conv RS iffD1]) 1);
|
9791
|
355 |
qed "lift2_eq_ErrD";
|
|
356 |
|
|
357 |
Goal
|
|
358 |
"[| semilat(err A, Err.le r, lift2 f) \
|
|
359 |
\ |] ==> !xs. xs:list n A --> (!ys. ys:list n A --> \
|
|
360 |
\ coalesce (xs +[f] ys) = Err --> \
|
|
361 |
\ ~(? zs:list n A. xs <=[r] zs & ys <=[r] zs))";
|
10172
|
362 |
by (induct_tac "n" 1);
|
|
363 |
by (Simp_tac 1);
|
|
364 |
by (Clarify_tac 1);
|
9791
|
365 |
by (asm_full_simp_tac (simpset() addsimps [in_list_Suc_iff]) 1);
|
10172
|
366 |
by (Clarify_tac 1);
|
9791
|
367 |
by (full_simp_tac (simpset() addsplits [err.split_asm] addsimps [lemma,Err.sup_def,lift2_def]) 1);
|
10172
|
368 |
by (blast_tac (claset() addDs [lift2_eq_ErrD]) 1);
|
|
369 |
by (Blast_tac 1);
|
9791
|
370 |
qed_spec_mp "coalesce_eq_Err_D";
|
|
371 |
|
|
372 |
|
|
373 |
Goalw [closed_def]
|
|
374 |
"closed (err A) (lift2 f) = (!x:A. !y:A. x +_f y : err A)";
|
10172
|
375 |
by (simp_tac (simpset() addsimps [err_def]) 1);
|
9791
|
376 |
qed "closed_err_lift2_conv";
|
|
377 |
|
|
378 |
Goalw [map2_def]
|
|
379 |
"closed (err A) (lift2 f) ==> \
|
|
380 |
\ !xs. xs : list n A --> (!ys. ys : list n A --> \
|
|
381 |
\ map2 f xs ys : list n (err A))";
|
10172
|
382 |
by (induct_tac "n" 1);
|
|
383 |
by (Simp_tac 1);
|
|
384 |
by (Clarify_tac 1);
|
9791
|
385 |
by (asm_full_simp_tac (simpset() addsimps [in_list_Suc_iff]) 1);
|
10172
|
386 |
by (Clarify_tac 1);
|
9791
|
387 |
by (full_simp_tac (simpset() addsimps [plussub_def,closed_err_lift2_conv]) 1);
|
10172
|
388 |
by (Blast_tac 1);
|
9791
|
389 |
qed_spec_mp "closed_map2_list";
|
|
390 |
|
|
391 |
Goal
|
|
392 |
"closed (err A) (lift2 f) ==> \
|
|
393 |
\ closed (err (list n A)) (lift2 (sup f))";
|
10172
|
394 |
by (fast_tac (claset() addss (simpset() addsimps
|
9791
|
395 |
[closed_def,plussub_def,sup_def,lift2_def,
|
|
396 |
coalesce_in_err_list,closed_map2_list]
|
|
397 |
addsplits [err.split])) 1);
|
|
398 |
qed "closed_lift2_sup";
|
|
399 |
|
|
400 |
Goalw [Err.sl_def]
|
|
401 |
"err_semilat (A,r,f) ==> \
|
|
402 |
\ err_semilat (list n A, Listn.le r, sup f)";
|
10918
|
403 |
by (asm_full_simp_tac (HOL_basic_ss addsimps [split_conv]) 1);
|
10172
|
404 |
by (simp_tac (HOL_basic_ss addsimps [semilat_Def,plussub_def]) 1);
|
|
405 |
by (asm_simp_tac(HOL_basic_ss addsimps [semilatDclosedI,closed_lift2_sup]) 1);
|
|
406 |
by (rtac conjI 1);
|
|
407 |
by (dtac semilatDorderI 1);
|
|
408 |
by (Asm_full_simp_tac 1);
|
|
409 |
by (simp_tac (HOL_basic_ss addsimps
|
9791
|
410 |
[unfold_lesub_err,Err.le_def,err_def,sup_def,lift2_def]) 1);
|
|
411 |
by (asm_simp_tac (simpset() addsimps
|
|
412 |
[coalesce_eq_OK1_D,coalesce_eq_OK2_D] addsplits [err.split]) 1);
|
10172
|
413 |
by (blast_tac (claset()addIs[coalesce_eq_OK_ub_D] addDs [coalesce_eq_Err_D]) 1);
|
9791
|
414 |
qed "err_semilat_sup";
|
|
415 |
|
|
416 |
Goalw [Listn.upto_esl_def]
|
|
417 |
"!!L. err_semilat L ==> err_semilat(upto_esl m L)";
|
10172
|
418 |
by (split_all_tac 1);
|
|
419 |
by (Asm_full_simp_tac 1);
|
|
420 |
by (fast_tac (claset()
|
9791
|
421 |
addSIs [err_semilat_UnionI,err_semilat_sup]
|
|
422 |
addDs [lesub_list_impl_same_size] addss (simpset()
|
|
423 |
addsimps [plussub_def,Listn.sup_def])) 1);
|
|
424 |
qed "err_semilat_upto_esl";
|