author | wenzelm |
Mon, 01 Oct 2001 15:46:35 +0200 | |
changeset 11649 | dfb59b9954a6 |
parent 11500 | a84130c7e6ab |
child 12169 | d4ed9802082a |
permissions | -rw-r--r-- |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
1 |
(* Title: HOL/ex/SList.ML |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
2 |
ID: $Id$ |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
4521 | 4 |
Copyright 1998 University of Cambridge |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
5 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
6 |
Definition of type 'a list by a least fixed point |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
7 |
*) |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
8 |
|
5977
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
9 |
|
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
10 |
Goalw [List_def] "x : list (range Leaf) ==> x : List"; |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
11 |
by (Asm_simp_tac 1); |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
12 |
qed "ListI"; |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
13 |
|
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
14 |
Goalw [List_def] "x : List ==> x : list (range Leaf)"; |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
15 |
by (Asm_simp_tac 1); |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
16 |
qed "ListD"; |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
17 |
|
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
18 |
val list_con_defs = [NIL_def, CONS_def]; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
19 |
|
7256 | 20 |
Goal "list(A) = usum {Numb(0)} (uprod A (list A))"; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
21 |
let val rew = rewrite_rule list_con_defs in |
4089 | 22 |
by (fast_tac (claset() addSIs (equalityI :: map rew list.intrs) |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
23 |
addEs [rew list.elim]) 1) |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
24 |
end; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
25 |
qed "list_unfold"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
26 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
27 |
(*This justifies using list in other recursive type definitions*) |
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
28 |
Goalw list.defs "A<=B ==> list(A) <= list(B)"; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
29 |
by (rtac lfp_mono 1); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
30 |
by (REPEAT (ares_tac basic_monos 1)); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
31 |
qed "list_mono"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
32 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
33 |
(*Type checking -- list creates well-founded sets*) |
5069 | 34 |
Goalw (list_con_defs @ list.defs) "list(sexp) <= sexp"; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
35 |
by (rtac lfp_lowerbound 1); |
4089 | 36 |
by (fast_tac (claset() addIs sexp.intrs@[sexp_In0I,sexp_In1I]) 1); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
37 |
qed "list_sexp"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
38 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
39 |
(* A <= sexp ==> list(A) <= sexp *) |
5977
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
40 |
bind_thm ("list_subset_sexp", [list_mono, list_sexp] MRS subset_trans); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
41 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
42 |
(*Induction for the type 'a list *) |
5977
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
43 |
val prems = Goalw [Nil_def,Cons_def] |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
44 |
"[| P(Nil); \ |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
45 |
\ !!x xs. P(xs) ==> P(x # xs) |] ==> P(l)"; |
5977
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
46 |
by (rtac (Rep_List_inverse RS subst) 1); (*types force good instantiation*) |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
47 |
by (rtac (Rep_List RS ListD RS list.induct) 1); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
48 |
by (REPEAT (ares_tac prems 1 |
5977
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
49 |
ORELSE eresolve_tac [rangeE, ssubst, |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
50 |
ListI RS Abs_List_inverse RS subst] 1)); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
51 |
qed "list_induct2"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
52 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
53 |
(** Distinctness of constructors **) |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
54 |
|
5069 | 55 |
Goalw list_con_defs "CONS M N ~= NIL"; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
56 |
by (rtac In1_not_In0 1); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
57 |
qed "CONS_not_NIL"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
58 |
bind_thm ("NIL_not_CONS", (CONS_not_NIL RS not_sym)); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
59 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
60 |
bind_thm ("CONS_neq_NIL", (CONS_not_NIL RS notE)); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
61 |
val NIL_neq_CONS = sym RS CONS_neq_NIL; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
62 |
|
5069 | 63 |
Goalw [Nil_def,Cons_def] "x # xs ~= Nil"; |
11500
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
64 |
by (stac (thm "Abs_List_inject") 1); |
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
65 |
by (REPEAT (resolve_tac (list.intrs @ [CONS_not_NIL, rangeI, |
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
66 |
Rep_List RS ListD, ListI]) 1)); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
67 |
qed "Cons_not_Nil"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
68 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
69 |
bind_thm ("Nil_not_Cons", Cons_not_Nil RS not_sym); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
70 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
71 |
(** Injectiveness of CONS and Cons **) |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
72 |
|
5069 | 73 |
Goalw [CONS_def] "(CONS K M=CONS L N) = (K=L & M=N)"; |
4089 | 74 |
by (fast_tac (claset() addSEs [Scons_inject, make_elim In1_inject]) 1); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
75 |
qed "CONS_CONS_eq"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
76 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
77 |
(*For reasoning about abstract list constructors*) |
5977
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
78 |
AddIs [Rep_List RS ListD, ListI]; |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
79 |
AddIs list.intrs; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
80 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
81 |
AddIffs [CONS_not_NIL, NIL_not_CONS, CONS_CONS_eq]; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
82 |
|
11500
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
83 |
AddSDs [Leaf_inject]; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
84 |
|
5069 | 85 |
Goalw [Cons_def] "(x#xs=y#ys) = (x=y & xs=ys)"; |
11500
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
86 |
by (stac (thm "Abs_List_inject") 1); |
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
87 |
by (auto_tac (claset(), simpset() addsimps [thm "Rep_List_inject"])); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
88 |
qed "Cons_Cons_eq"; |
5977
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
89 |
bind_thm ("Cons_inject2", Cons_Cons_eq RS iffD1 RS conjE); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
90 |
|
5977
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
91 |
Goal "CONS M N: list(A) ==> M: A & N: list(A)"; |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
92 |
by (etac setup_induction 1); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
93 |
by (etac list.induct 1); |
5977
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
94 |
by (ALLGOALS Fast_tac); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
95 |
qed "CONS_D"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
96 |
|
5977
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
97 |
Goalw [CONS_def,In1_def] "CONS M N: sexp ==> M: sexp & N: sexp"; |
4089 | 98 |
by (fast_tac (claset() addSDs [Scons_D]) 1); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
99 |
qed "sexp_CONS_D"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
100 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
101 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
102 |
(*Reasoning about constructors and their freeness*) |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
103 |
Addsimps list.intrs; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
104 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
105 |
AddIffs [Cons_not_Nil, Nil_not_Cons, Cons_Cons_eq]; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
106 |
|
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
107 |
Goal "N: list(A) ==> !M. N ~= CONS M N"; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
108 |
by (etac list.induct 1); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
109 |
by (ALLGOALS Asm_simp_tac); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
110 |
qed "not_CONS_self"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
111 |
|
11500
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
112 |
Goal "ALL x. l ~= x#l"; |
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
113 |
by (induct_thm_tac list_induct2 "l" 1); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
114 |
by (ALLGOALS Asm_simp_tac); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
115 |
qed "not_Cons_self2"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
116 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
117 |
|
5069 | 118 |
Goal "(xs ~= []) = (? y ys. xs = y#ys)"; |
11500
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
119 |
by (induct_thm_tac list_induct2 "xs" 1); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
120 |
by (Simp_tac 1); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
121 |
by (Asm_simp_tac 1); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
122 |
by (REPEAT(resolve_tac [exI,refl,conjI] 1)); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
123 |
qed "neq_Nil_conv2"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
124 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
125 |
(** Conversion rules for List_case: case analysis operator **) |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
126 |
|
5069 | 127 |
Goalw [List_case_def,NIL_def] "List_case c h NIL = c"; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
128 |
by (rtac Case_In0 1); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
129 |
qed "List_case_NIL"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
130 |
|
5069 | 131 |
Goalw [List_case_def,CONS_def] "List_case c h (CONS M N) = h M N"; |
4521 | 132 |
by (Simp_tac 1); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
133 |
qed "List_case_CONS"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
134 |
|
4521 | 135 |
Addsimps [List_case_NIL, List_case_CONS]; |
136 |
||
137 |
||
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
138 |
(*** List_rec -- by wf recursion on pred_sexp ***) |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
139 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
140 |
(* The trancl(pred_sexp) is essential because pred_sexp_CONS_I1,2 would not |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
141 |
hold if pred_sexp^+ were changed to pred_sexp. *) |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
142 |
|
5278 | 143 |
Goal "(%M. List_rec M c d) = wfrec (trancl pred_sexp) \ |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
144 |
\ (%g. List_case c (%x y. d x y (g y)))"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
145 |
by (simp_tac (HOL_ss addsimps [List_rec_def]) 1); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
146 |
val List_rec_unfold = standard |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
147 |
((wf_pred_sexp RS wf_trancl) RS ((result() RS eq_reflection) RS def_wfrec)); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
148 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
149 |
(*--------------------------------------------------------------------------- |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
150 |
* Old: |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
151 |
* val List_rec_unfold = [List_rec_def,wf_pred_sexp RS wf_trancl] MRS def_wfrec |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
152 |
* |> standard; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
153 |
*---------------------------------------------------------------------------*) |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
154 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
155 |
(** pred_sexp lemmas **) |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
156 |
|
5069 | 157 |
Goalw [CONS_def,In1_def] |
5148
74919e8f221c
More tidying and removal of "\!\!... from Goal commands
paulson
parents:
5143
diff
changeset
|
158 |
"[| M: sexp; N: sexp |] ==> (M, CONS M N) : pred_sexp^+"; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
159 |
by (Asm_simp_tac 1); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
160 |
qed "pred_sexp_CONS_I1"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
161 |
|
5069 | 162 |
Goalw [CONS_def,In1_def] |
5148
74919e8f221c
More tidying and removal of "\!\!... from Goal commands
paulson
parents:
5143
diff
changeset
|
163 |
"[| M: sexp; N: sexp |] ==> (N, CONS M N) : pred_sexp^+"; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
164 |
by (Asm_simp_tac 1); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
165 |
qed "pred_sexp_CONS_I2"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
166 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
167 |
val [prem] = goal SList.thy |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
168 |
"(CONS M1 M2, N) : pred_sexp^+ ==> \ |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
169 |
\ (M1,N) : pred_sexp^+ & (M2,N) : pred_sexp^+"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
170 |
by (rtac (prem RS (pred_sexp_subset_Sigma RS trancl_subset_Sigma RS |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
171 |
subsetD RS SigmaE2)) 1); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
172 |
by (etac (sexp_CONS_D RS conjE) 1); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
173 |
by (REPEAT (ares_tac [conjI, pred_sexp_CONS_I1, pred_sexp_CONS_I2, |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
174 |
prem RSN (2, trans_trancl RS transD)] 1)); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
175 |
qed "pred_sexp_CONS_D"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
176 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
177 |
(** Conversion rules for List_rec **) |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
178 |
|
5069 | 179 |
Goal "List_rec NIL c h = c"; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
180 |
by (rtac (List_rec_unfold RS trans) 1); |
4521 | 181 |
by (Simp_tac 1); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
182 |
qed "List_rec_NIL"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
183 |
|
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
184 |
Goal "[| M: sexp; N: sexp |] ==> \ |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
185 |
\ List_rec (CONS M N) c h = h M N (List_rec N c h)"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
186 |
by (rtac (List_rec_unfold RS trans) 1); |
4521 | 187 |
by (asm_simp_tac (simpset() addsimps [pred_sexp_CONS_I2]) 1); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
188 |
qed "List_rec_CONS"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
189 |
|
4521 | 190 |
Addsimps [List_rec_NIL, List_rec_CONS]; |
191 |
||
192 |
||
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
193 |
(*** list_rec -- by List_rec ***) |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
194 |
|
5977
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
195 |
val Rep_List_in_sexp = |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
196 |
[range_Leaf_subset_sexp RS list_subset_sexp, Rep_List RS ListD] |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
197 |
MRS subsetD; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
198 |
|
11500
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
199 |
val list_rec_simps = [ListI RS Abs_List_inverse, Rep_List_inverse, |
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
200 |
Rep_List RS ListD, rangeI, inj_Leaf, inv_f_f, |
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
201 |
sexp.LeafI, Rep_List_in_sexp]; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
202 |
|
11500
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
203 |
Goal "list_rec Nil c h = c"; |
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
204 |
by (simp_tac (simpset() addsimps list_rec_simps@ [list_rec_def, Nil_def]) 1); |
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
205 |
qed "list_rec_Nil"; |
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
206 |
|
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
207 |
|
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
208 |
Goal "list_rec (a#l) c h = h a l (list_rec l c h)"; |
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
209 |
by (simp_tac (simpset() addsimps list_rec_simps@ [list_rec_def,Cons_def]) 1); |
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
210 |
qed "list_rec_Cons"; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
211 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
212 |
Addsimps [List_rec_NIL, List_rec_CONS, list_rec_Nil, list_rec_Cons]; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
213 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
214 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
215 |
(*Type checking. Useful?*) |
5977
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
216 |
val major::A_subset_sexp::prems = |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
217 |
Goal "[| M: list(A); \ |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
218 |
\ A<=sexp; \ |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
219 |
\ c: C(NIL); \ |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
220 |
\ !!x y r. [| x: A; y: list(A); r: C(y) |] ==> h x y r: C(CONS x y) \ |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
221 |
\ |] ==> List_rec M c h : C(M :: 'a item)"; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
222 |
val sexp_ListA_I = A_subset_sexp RS list_subset_sexp RS subsetD; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
223 |
val sexp_A_I = A_subset_sexp RS subsetD; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
224 |
by (rtac (major RS list.induct) 1); |
5535 | 225 |
by (ALLGOALS(asm_simp_tac (simpset() addsimps [sexp_A_I,sexp_ListA_I]@prems))); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
226 |
qed "List_rec_type"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
227 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
228 |
(** Generalized map functionals **) |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
229 |
|
5069 | 230 |
Goalw [Rep_map_def] "Rep_map f Nil = NIL"; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
231 |
by (rtac list_rec_Nil 1); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
232 |
qed "Rep_map_Nil"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
233 |
|
5977
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
234 |
Goalw [Rep_map_def] "Rep_map f (x#xs) = CONS (f x) (Rep_map f xs)"; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
235 |
by (rtac list_rec_Cons 1); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
236 |
qed "Rep_map_Cons"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
237 |
|
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
238 |
val prems = Goalw [Rep_map_def] "(!!x. f(x): A) ==> Rep_map f xs: list(A)"; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
239 |
by (rtac list_induct2 1); |
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
240 |
by (ALLGOALS (asm_simp_tac (simpset() addsimps prems))); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
241 |
qed "Rep_map_type"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
242 |
|
5069 | 243 |
Goalw [Abs_map_def] "Abs_map g NIL = Nil"; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
244 |
by (rtac List_rec_NIL 1); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
245 |
qed "Abs_map_NIL"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
246 |
|
5977
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
247 |
Goalw [Abs_map_def] |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
248 |
"[| M: sexp; N: sexp |] ==> Abs_map g (CONS M N) = g(M) # Abs_map g N"; |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
249 |
by (REPEAT (ares_tac [List_rec_CONS] 1)); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
250 |
qed "Abs_map_CONS"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
251 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
252 |
(*These 2 rules ease the use of primitive recursion. NOTE USE OF == *) |
5977
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
253 |
val [rew] = |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
254 |
Goal "[| !!xs. f(xs) == list_rec xs c h |] ==> f([]) = c"; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
255 |
by (rewtac rew); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
256 |
by (rtac list_rec_Nil 1); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
257 |
qed "def_list_rec_Nil"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
258 |
|
5977
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
259 |
val [rew] = |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
260 |
Goal "[| !!xs. f(xs) == list_rec xs c h |] ==> f(x#xs) = h x xs (f xs)"; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
261 |
by (rewtac rew); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
262 |
by (rtac list_rec_Cons 1); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
263 |
qed "def_list_rec_Cons"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
264 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
265 |
fun list_recs def = |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
266 |
[standard (def RS def_list_rec_Nil), |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
267 |
standard (def RS def_list_rec_Cons)]; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
268 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
269 |
(*** Unfolding the basic combinators ***) |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
270 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
271 |
val [null_Nil, null_Cons] = list_recs null_def; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
272 |
val [_, hd_Cons] = list_recs hd_def; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
273 |
val [_, tl_Cons] = list_recs tl_def; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
274 |
val [ttl_Nil, ttl_Cons] = list_recs ttl_def; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
275 |
val [append_Nil3, append_Cons] = list_recs append_def; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
276 |
val [mem_Nil, mem_Cons] = list_recs mem_def; |
3649
e530286d4847
Renamed set_of_list to set, and relevant theorems too
paulson
parents:
3120
diff
changeset
|
277 |
val [set_Nil, set_Cons] = list_recs set_def; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
278 |
val [map_Nil, map_Cons] = list_recs map_def; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
279 |
val [list_case_Nil, list_case_Cons] = list_recs list_case_def; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
280 |
val [filter_Nil, filter_Cons] = list_recs filter_def; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
281 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
282 |
Addsimps |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
283 |
[null_Nil, ttl_Nil, |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
284 |
mem_Nil, mem_Cons, |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
285 |
list_case_Nil, list_case_Cons, |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
286 |
append_Nil3, append_Cons, |
3649
e530286d4847
Renamed set_of_list to set, and relevant theorems too
paulson
parents:
3120
diff
changeset
|
287 |
set_Nil, set_Cons, |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
288 |
map_Nil, map_Cons, |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
289 |
filter_Nil, filter_Cons]; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
290 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
291 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
292 |
(** @ - append **) |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
293 |
|
5069 | 294 |
Goal "(xs@ys)@zs = xs@(ys@zs)"; |
11500
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
295 |
by (induct_thm_tac list_induct2 "xs" 1); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
296 |
by (ALLGOALS Asm_simp_tac); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
297 |
qed "append_assoc2"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
298 |
|
5069 | 299 |
Goal "xs @ [] = xs"; |
11500
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
300 |
by (induct_thm_tac list_induct2 "xs" 1); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
301 |
by (ALLGOALS Asm_simp_tac); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
302 |
qed "append_Nil4"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
303 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
304 |
(** mem **) |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
305 |
|
5069 | 306 |
Goal "x mem (xs@ys) = (x mem xs | x mem ys)"; |
11500
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
307 |
by (induct_thm_tac list_induct2 "xs" 1); |
4686 | 308 |
by (ALLGOALS Asm_simp_tac); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
309 |
qed "mem_append2"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
310 |
|
5069 | 311 |
Goal "x mem [x:xs. P(x)] = (x mem xs & P(x))"; |
11500
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
312 |
by (induct_thm_tac list_induct2 "xs" 1); |
4686 | 313 |
by (ALLGOALS Asm_simp_tac); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
314 |
qed "mem_filter2"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
315 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
316 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
317 |
(** The functional "map" **) |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
318 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
319 |
Addsimps [Rep_map_Nil, Rep_map_Cons, Abs_map_NIL, Abs_map_CONS]; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
320 |
|
5977
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
321 |
val [major,A_subset_sexp,minor] = |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
322 |
Goal "[| M: list(A); A<=sexp; !!z. z: A ==> f(g(z)) = z |] \ |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
323 |
\ ==> Rep_map f (Abs_map g M) = M"; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
324 |
by (rtac (major RS list.induct) 1); |
5977
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
325 |
by (ALLGOALS |
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
326 |
(asm_simp_tac (simpset() addsimps [sexp_A_I,sexp_ListA_I,minor]))); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
327 |
qed "Abs_map_inverse"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
328 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
329 |
(*Rep_map_inverse is obtained via Abs_Rep_map and map_ident*) |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
330 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
331 |
(** list_case **) |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
332 |
|
5278 | 333 |
Goal "P(list_case a f xs) = ((xs=[] --> P(a)) & \ |
5977
9f0c8869cf71
tidied up list definitions, using type 'a option instead of
paulson
parents:
5535
diff
changeset
|
334 |
\ (!y ys. xs=y#ys --> P(f y ys)))"; |
11500
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
335 |
by (induct_thm_tac list_induct2 "xs" 1); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
336 |
by (ALLGOALS Asm_simp_tac); |
4831 | 337 |
qed "split_list_case2"; |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
338 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
339 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
340 |
(** Additional mapping lemmas **) |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
341 |
|
5069 | 342 |
Goal "map (%x. x) xs = xs"; |
11500
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
343 |
by (induct_thm_tac list_induct2 "xs" 1); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
344 |
by (ALLGOALS Asm_simp_tac); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
345 |
qed "map_ident2"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
346 |
|
5069 | 347 |
Goal "map f (xs@ys) = map f xs @ map f ys"; |
11500
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
348 |
by (induct_thm_tac list_induct2 "xs" 1); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
349 |
by (ALLGOALS Asm_simp_tac); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
350 |
qed "map_append2"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
351 |
|
5069 | 352 |
Goalw [o_def] "map (f o g) xs = map f (map g xs)"; |
11500
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
353 |
by (induct_thm_tac list_induct2 "xs" 1); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
354 |
by (ALLGOALS Asm_simp_tac); |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
355 |
qed "map_compose2"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
356 |
|
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
357 |
val prems = |
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
358 |
Goal "(!!x. f(x): sexp) ==> \ |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
359 |
\ Abs_map g (Rep_map f xs) = map (%t. g(f(t))) xs"; |
11500
a84130c7e6ab
Updated proofs to take advantage of additional theorems proved by "typedef"
paulson
parents:
9747
diff
changeset
|
360 |
by (induct_thm_tac list_induct2 "xs" 1); |
4521 | 361 |
by (ALLGOALS (asm_simp_tac(simpset() addsimps |
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
362 |
(prems@[Rep_map_type, list_sexp RS subsetD])))); |
3120
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
363 |
qed "Abs_Rep_map"; |
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
364 |
|
c58423c20740
New directory to contain examples of (co)inductive definitions
paulson
parents:
diff
changeset
|
365 |
Addsimps [append_Nil4, map_ident2]; |