berghofe@5181
|
1 |
(* Title: HOL/Datatype.thy
|
wenzelm@20819
|
2 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory
|
wenzelm@11954
|
3 |
Author: Stefan Berghofer and Markus Wenzel, TU Muenchen
|
berghofe@5181
|
4 |
*)
|
berghofe@5181
|
5 |
|
haftmann@33967
|
6 |
header {* Datatype package: constructing datatypes from Cartesian Products and Disjoint Sums *}
|
wenzelm@11954
|
7 |
|
nipkow@15131
|
8 |
theory Datatype
|
haftmann@33958
|
9 |
imports Product_Type Sum_Type Nat
|
haftmann@33958
|
10 |
uses
|
haftmann@33962
|
11 |
("Tools/Datatype/datatype.ML")
|
haftmann@33958
|
12 |
("Tools/inductive_realizer.ML")
|
haftmann@33958
|
13 |
("Tools/Datatype/datatype_realizer.ML")
|
nipkow@15131
|
14 |
begin
|
wenzelm@11954
|
15 |
|
haftmann@41215
|
16 |
subsection {* Prelude: lifting over function space *}
|
haftmann@41215
|
17 |
|
haftmann@41752
|
18 |
enriched_type map_fun: map_fun
|
haftmann@41215
|
19 |
by (simp_all add: fun_eq_iff)
|
haftmann@41215
|
20 |
|
haftmann@41215
|
21 |
|
haftmann@33958
|
22 |
subsection {* The datatype universe *}
|
haftmann@33958
|
23 |
|
wenzelm@20819
|
24 |
typedef (Node)
|
wenzelm@20819
|
25 |
('a,'b) node = "{p. EX f x k. p = (f::nat=>'b+nat, x::'a+nat) & f k = Inr 0}"
|
wenzelm@20819
|
26 |
--{*it is a subtype of @{text "(nat=>'b+nat) * ('a+nat)"}*}
|
wenzelm@20819
|
27 |
by auto
|
wenzelm@20819
|
28 |
|
wenzelm@20819
|
29 |
text{*Datatypes will be represented by sets of type @{text node}*}
|
wenzelm@20819
|
30 |
|
wenzelm@20819
|
31 |
types 'a item = "('a, unit) node set"
|
wenzelm@20819
|
32 |
('a, 'b) dtree = "('a, 'b) node set"
|
wenzelm@20819
|
33 |
|
wenzelm@20819
|
34 |
consts
|
wenzelm@20819
|
35 |
Push :: "[('b + nat), nat => ('b + nat)] => (nat => ('b + nat))"
|
wenzelm@20819
|
36 |
|
wenzelm@20819
|
37 |
Push_Node :: "[('b + nat), ('a, 'b) node] => ('a, 'b) node"
|
wenzelm@20819
|
38 |
ndepth :: "('a, 'b) node => nat"
|
wenzelm@20819
|
39 |
|
wenzelm@20819
|
40 |
Atom :: "('a + nat) => ('a, 'b) dtree"
|
wenzelm@20819
|
41 |
Leaf :: "'a => ('a, 'b) dtree"
|
wenzelm@20819
|
42 |
Numb :: "nat => ('a, 'b) dtree"
|
wenzelm@20819
|
43 |
Scons :: "[('a, 'b) dtree, ('a, 'b) dtree] => ('a, 'b) dtree"
|
wenzelm@20819
|
44 |
In0 :: "('a, 'b) dtree => ('a, 'b) dtree"
|
wenzelm@20819
|
45 |
In1 :: "('a, 'b) dtree => ('a, 'b) dtree"
|
wenzelm@20819
|
46 |
Lim :: "('b => ('a, 'b) dtree) => ('a, 'b) dtree"
|
wenzelm@20819
|
47 |
|
wenzelm@20819
|
48 |
ntrunc :: "[nat, ('a, 'b) dtree] => ('a, 'b) dtree"
|
wenzelm@20819
|
49 |
|
wenzelm@20819
|
50 |
uprod :: "[('a, 'b) dtree set, ('a, 'b) dtree set]=> ('a, 'b) dtree set"
|
wenzelm@20819
|
51 |
usum :: "[('a, 'b) dtree set, ('a, 'b) dtree set]=> ('a, 'b) dtree set"
|
wenzelm@20819
|
52 |
|
wenzelm@20819
|
53 |
Split :: "[[('a, 'b) dtree, ('a, 'b) dtree]=>'c, ('a, 'b) dtree] => 'c"
|
wenzelm@20819
|
54 |
Case :: "[[('a, 'b) dtree]=>'c, [('a, 'b) dtree]=>'c, ('a, 'b) dtree] => 'c"
|
wenzelm@20819
|
55 |
|
wenzelm@20819
|
56 |
dprod :: "[(('a, 'b) dtree * ('a, 'b) dtree)set, (('a, 'b) dtree * ('a, 'b) dtree)set]
|
wenzelm@20819
|
57 |
=> (('a, 'b) dtree * ('a, 'b) dtree)set"
|
wenzelm@20819
|
58 |
dsum :: "[(('a, 'b) dtree * ('a, 'b) dtree)set, (('a, 'b) dtree * ('a, 'b) dtree)set]
|
wenzelm@20819
|
59 |
=> (('a, 'b) dtree * ('a, 'b) dtree)set"
|
wenzelm@20819
|
60 |
|
wenzelm@20819
|
61 |
|
wenzelm@20819
|
62 |
defs
|
wenzelm@20819
|
63 |
|
wenzelm@20819
|
64 |
Push_Node_def: "Push_Node == (%n x. Abs_Node (apfst (Push n) (Rep_Node x)))"
|
wenzelm@20819
|
65 |
|
wenzelm@20819
|
66 |
(*crude "lists" of nats -- needed for the constructions*)
|
wenzelm@20819
|
67 |
Push_def: "Push == (%b h. nat_case b h)"
|
wenzelm@20819
|
68 |
|
wenzelm@20819
|
69 |
(** operations on S-expressions -- sets of nodes **)
|
wenzelm@20819
|
70 |
|
wenzelm@20819
|
71 |
(*S-expression constructors*)
|
wenzelm@20819
|
72 |
Atom_def: "Atom == (%x. {Abs_Node((%k. Inr 0, x))})"
|
wenzelm@20819
|
73 |
Scons_def: "Scons M N == (Push_Node (Inr 1) ` M) Un (Push_Node (Inr (Suc 1)) ` N)"
|
wenzelm@20819
|
74 |
|
wenzelm@20819
|
75 |
(*Leaf nodes, with arbitrary or nat labels*)
|
wenzelm@20819
|
76 |
Leaf_def: "Leaf == Atom o Inl"
|
wenzelm@20819
|
77 |
Numb_def: "Numb == Atom o Inr"
|
wenzelm@20819
|
78 |
|
wenzelm@20819
|
79 |
(*Injections of the "disjoint sum"*)
|
wenzelm@20819
|
80 |
In0_def: "In0(M) == Scons (Numb 0) M"
|
wenzelm@20819
|
81 |
In1_def: "In1(M) == Scons (Numb 1) M"
|
wenzelm@20819
|
82 |
|
wenzelm@20819
|
83 |
(*Function spaces*)
|
wenzelm@20819
|
84 |
Lim_def: "Lim f == Union {z. ? x. z = Push_Node (Inl x) ` (f x)}"
|
wenzelm@20819
|
85 |
|
wenzelm@20819
|
86 |
(*the set of nodes with depth less than k*)
|
wenzelm@20819
|
87 |
ndepth_def: "ndepth(n) == (%(f,x). LEAST k. f k = Inr 0) (Rep_Node n)"
|
wenzelm@20819
|
88 |
ntrunc_def: "ntrunc k N == {n. n:N & ndepth(n)<k}"
|
wenzelm@20819
|
89 |
|
wenzelm@20819
|
90 |
(*products and sums for the "universe"*)
|
wenzelm@20819
|
91 |
uprod_def: "uprod A B == UN x:A. UN y:B. { Scons x y }"
|
wenzelm@20819
|
92 |
usum_def: "usum A B == In0`A Un In1`B"
|
wenzelm@20819
|
93 |
|
wenzelm@20819
|
94 |
(*the corresponding eliminators*)
|
wenzelm@20819
|
95 |
Split_def: "Split c M == THE u. EX x y. M = Scons x y & u = c x y"
|
wenzelm@20819
|
96 |
|
wenzelm@20819
|
97 |
Case_def: "Case c d M == THE u. (EX x . M = In0(x) & u = c(x))
|
wenzelm@20819
|
98 |
| (EX y . M = In1(y) & u = d(y))"
|
wenzelm@20819
|
99 |
|
wenzelm@20819
|
100 |
|
wenzelm@20819
|
101 |
(** equality for the "universe" **)
|
wenzelm@20819
|
102 |
|
wenzelm@20819
|
103 |
dprod_def: "dprod r s == UN (x,x'):r. UN (y,y'):s. {(Scons x y, Scons x' y')}"
|
wenzelm@20819
|
104 |
|
wenzelm@20819
|
105 |
dsum_def: "dsum r s == (UN (x,x'):r. {(In0(x),In0(x'))}) Un
|
wenzelm@20819
|
106 |
(UN (y,y'):s. {(In1(y),In1(y'))})"
|
wenzelm@20819
|
107 |
|
wenzelm@20819
|
108 |
|
wenzelm@20819
|
109 |
|
wenzelm@20819
|
110 |
lemma apfst_convE:
|
wenzelm@20819
|
111 |
"[| q = apfst f p; !!x y. [| p = (x,y); q = (f(x),y) |] ==> R
|
wenzelm@20819
|
112 |
|] ==> R"
|
wenzelm@20819
|
113 |
by (force simp add: apfst_def)
|
wenzelm@20819
|
114 |
|
wenzelm@20819
|
115 |
(** Push -- an injection, analogous to Cons on lists **)
|
wenzelm@20819
|
116 |
|
wenzelm@20819
|
117 |
lemma Push_inject1: "Push i f = Push j g ==> i=j"
|
nipkow@39535
|
118 |
apply (simp add: Push_def fun_eq_iff)
|
wenzelm@20819
|
119 |
apply (drule_tac x=0 in spec, simp)
|
wenzelm@20819
|
120 |
done
|
wenzelm@20819
|
121 |
|
wenzelm@20819
|
122 |
lemma Push_inject2: "Push i f = Push j g ==> f=g"
|
nipkow@39535
|
123 |
apply (auto simp add: Push_def fun_eq_iff)
|
wenzelm@20819
|
124 |
apply (drule_tac x="Suc x" in spec, simp)
|
wenzelm@20819
|
125 |
done
|
wenzelm@20819
|
126 |
|
wenzelm@20819
|
127 |
lemma Push_inject:
|
wenzelm@20819
|
128 |
"[| Push i f =Push j g; [| i=j; f=g |] ==> P |] ==> P"
|
wenzelm@20819
|
129 |
by (blast dest: Push_inject1 Push_inject2)
|
wenzelm@20819
|
130 |
|
wenzelm@20819
|
131 |
lemma Push_neq_K0: "Push (Inr (Suc k)) f = (%z. Inr 0) ==> P"
|
nipkow@39535
|
132 |
by (auto simp add: Push_def fun_eq_iff split: nat.split_asm)
|
wenzelm@20819
|
133 |
|
wenzelm@20819
|
134 |
lemmas Abs_Node_inj = Abs_Node_inject [THEN [2] rev_iffD1, standard]
|
wenzelm@20819
|
135 |
|
wenzelm@20819
|
136 |
|
wenzelm@20819
|
137 |
(*** Introduction rules for Node ***)
|
wenzelm@20819
|
138 |
|
wenzelm@20819
|
139 |
lemma Node_K0_I: "(%k. Inr 0, a) : Node"
|
wenzelm@20819
|
140 |
by (simp add: Node_def)
|
wenzelm@20819
|
141 |
|
wenzelm@20819
|
142 |
lemma Node_Push_I: "p: Node ==> apfst (Push i) p : Node"
|
wenzelm@20819
|
143 |
apply (simp add: Node_def Push_def)
|
wenzelm@20819
|
144 |
apply (fast intro!: apfst_conv nat_case_Suc [THEN trans])
|
wenzelm@20819
|
145 |
done
|
wenzelm@20819
|
146 |
|
wenzelm@20819
|
147 |
|
wenzelm@20819
|
148 |
subsection{*Freeness: Distinctness of Constructors*}
|
wenzelm@20819
|
149 |
|
wenzelm@20819
|
150 |
(** Scons vs Atom **)
|
wenzelm@20819
|
151 |
|
wenzelm@20819
|
152 |
lemma Scons_not_Atom [iff]: "Scons M N \<noteq> Atom(a)"
|
huffman@35208
|
153 |
unfolding Atom_def Scons_def Push_Node_def One_nat_def
|
huffman@35208
|
154 |
by (blast intro: Node_K0_I Rep_Node [THEN Node_Push_I]
|
wenzelm@20819
|
155 |
dest!: Abs_Node_inj
|
wenzelm@20819
|
156 |
elim!: apfst_convE sym [THEN Push_neq_K0])
|
wenzelm@20819
|
157 |
|
haftmann@21407
|
158 |
lemmas Atom_not_Scons [iff] = Scons_not_Atom [THEN not_sym, standard]
|
haftmann@21407
|
159 |
|
wenzelm@20819
|
160 |
|
wenzelm@20819
|
161 |
(*** Injectiveness ***)
|
wenzelm@20819
|
162 |
|
wenzelm@20819
|
163 |
(** Atomic nodes **)
|
wenzelm@20819
|
164 |
|
wenzelm@20819
|
165 |
lemma inj_Atom: "inj(Atom)"
|
wenzelm@20819
|
166 |
apply (simp add: Atom_def)
|
wenzelm@20819
|
167 |
apply (blast intro!: inj_onI Node_K0_I dest!: Abs_Node_inj)
|
wenzelm@20819
|
168 |
done
|
wenzelm@20819
|
169 |
lemmas Atom_inject = inj_Atom [THEN injD, standard]
|
wenzelm@20819
|
170 |
|
wenzelm@20819
|
171 |
lemma Atom_Atom_eq [iff]: "(Atom(a)=Atom(b)) = (a=b)"
|
wenzelm@20819
|
172 |
by (blast dest!: Atom_inject)
|
wenzelm@20819
|
173 |
|
wenzelm@20819
|
174 |
lemma inj_Leaf: "inj(Leaf)"
|
wenzelm@20819
|
175 |
apply (simp add: Leaf_def o_def)
|
wenzelm@20819
|
176 |
apply (rule inj_onI)
|
wenzelm@20819
|
177 |
apply (erule Atom_inject [THEN Inl_inject])
|
wenzelm@20819
|
178 |
done
|
wenzelm@20819
|
179 |
|
haftmann@21407
|
180 |
lemmas Leaf_inject [dest!] = inj_Leaf [THEN injD, standard]
|
wenzelm@20819
|
181 |
|
wenzelm@20819
|
182 |
lemma inj_Numb: "inj(Numb)"
|
wenzelm@20819
|
183 |
apply (simp add: Numb_def o_def)
|
wenzelm@20819
|
184 |
apply (rule inj_onI)
|
wenzelm@20819
|
185 |
apply (erule Atom_inject [THEN Inr_inject])
|
wenzelm@20819
|
186 |
done
|
wenzelm@20819
|
187 |
|
haftmann@21407
|
188 |
lemmas Numb_inject [dest!] = inj_Numb [THEN injD, standard]
|
wenzelm@20819
|
189 |
|
wenzelm@20819
|
190 |
|
wenzelm@20819
|
191 |
(** Injectiveness of Push_Node **)
|
wenzelm@20819
|
192 |
|
wenzelm@20819
|
193 |
lemma Push_Node_inject:
|
wenzelm@20819
|
194 |
"[| Push_Node i m =Push_Node j n; [| i=j; m=n |] ==> P
|
wenzelm@20819
|
195 |
|] ==> P"
|
wenzelm@20819
|
196 |
apply (simp add: Push_Node_def)
|
wenzelm@20819
|
197 |
apply (erule Abs_Node_inj [THEN apfst_convE])
|
wenzelm@20819
|
198 |
apply (rule Rep_Node [THEN Node_Push_I])+
|
wenzelm@20819
|
199 |
apply (erule sym [THEN apfst_convE])
|
wenzelm@20819
|
200 |
apply (blast intro: Rep_Node_inject [THEN iffD1] trans sym elim!: Push_inject)
|
wenzelm@20819
|
201 |
done
|
wenzelm@20819
|
202 |
|
wenzelm@20819
|
203 |
|
wenzelm@20819
|
204 |
(** Injectiveness of Scons **)
|
wenzelm@20819
|
205 |
|
wenzelm@20819
|
206 |
lemma Scons_inject_lemma1: "Scons M N <= Scons M' N' ==> M<=M'"
|
huffman@35208
|
207 |
unfolding Scons_def One_nat_def
|
huffman@35208
|
208 |
by (blast dest!: Push_Node_inject)
|
wenzelm@20819
|
209 |
|
wenzelm@20819
|
210 |
lemma Scons_inject_lemma2: "Scons M N <= Scons M' N' ==> N<=N'"
|
huffman@35208
|
211 |
unfolding Scons_def One_nat_def
|
huffman@35208
|
212 |
by (blast dest!: Push_Node_inject)
|
wenzelm@20819
|
213 |
|
wenzelm@20819
|
214 |
lemma Scons_inject1: "Scons M N = Scons M' N' ==> M=M'"
|
wenzelm@20819
|
215 |
apply (erule equalityE)
|
wenzelm@20819
|
216 |
apply (iprover intro: equalityI Scons_inject_lemma1)
|
wenzelm@20819
|
217 |
done
|
wenzelm@20819
|
218 |
|
wenzelm@20819
|
219 |
lemma Scons_inject2: "Scons M N = Scons M' N' ==> N=N'"
|
wenzelm@20819
|
220 |
apply (erule equalityE)
|
wenzelm@20819
|
221 |
apply (iprover intro: equalityI Scons_inject_lemma2)
|
wenzelm@20819
|
222 |
done
|
wenzelm@20819
|
223 |
|
wenzelm@20819
|
224 |
lemma Scons_inject:
|
wenzelm@20819
|
225 |
"[| Scons M N = Scons M' N'; [| M=M'; N=N' |] ==> P |] ==> P"
|
wenzelm@20819
|
226 |
by (iprover dest: Scons_inject1 Scons_inject2)
|
wenzelm@20819
|
227 |
|
wenzelm@20819
|
228 |
lemma Scons_Scons_eq [iff]: "(Scons M N = Scons M' N') = (M=M' & N=N')"
|
wenzelm@20819
|
229 |
by (blast elim!: Scons_inject)
|
wenzelm@20819
|
230 |
|
wenzelm@20819
|
231 |
(*** Distinctness involving Leaf and Numb ***)
|
wenzelm@20819
|
232 |
|
wenzelm@20819
|
233 |
(** Scons vs Leaf **)
|
wenzelm@20819
|
234 |
|
wenzelm@20819
|
235 |
lemma Scons_not_Leaf [iff]: "Scons M N \<noteq> Leaf(a)"
|
huffman@35208
|
236 |
unfolding Leaf_def o_def by (rule Scons_not_Atom)
|
wenzelm@20819
|
237 |
|
haftmann@21407
|
238 |
lemmas Leaf_not_Scons [iff] = Scons_not_Leaf [THEN not_sym, standard]
|
wenzelm@20819
|
239 |
|
wenzelm@20819
|
240 |
(** Scons vs Numb **)
|
wenzelm@20819
|
241 |
|
wenzelm@20819
|
242 |
lemma Scons_not_Numb [iff]: "Scons M N \<noteq> Numb(k)"
|
huffman@35208
|
243 |
unfolding Numb_def o_def by (rule Scons_not_Atom)
|
wenzelm@20819
|
244 |
|
haftmann@21407
|
245 |
lemmas Numb_not_Scons [iff] = Scons_not_Numb [THEN not_sym, standard]
|
wenzelm@20819
|
246 |
|
wenzelm@20819
|
247 |
|
wenzelm@20819
|
248 |
(** Leaf vs Numb **)
|
wenzelm@20819
|
249 |
|
wenzelm@20819
|
250 |
lemma Leaf_not_Numb [iff]: "Leaf(a) \<noteq> Numb(k)"
|
wenzelm@20819
|
251 |
by (simp add: Leaf_def Numb_def)
|
wenzelm@20819
|
252 |
|
haftmann@21407
|
253 |
lemmas Numb_not_Leaf [iff] = Leaf_not_Numb [THEN not_sym, standard]
|
wenzelm@20819
|
254 |
|
wenzelm@20819
|
255 |
|
wenzelm@20819
|
256 |
(*** ndepth -- the depth of a node ***)
|
wenzelm@20819
|
257 |
|
wenzelm@20819
|
258 |
lemma ndepth_K0: "ndepth (Abs_Node(%k. Inr 0, x)) = 0"
|
wenzelm@20819
|
259 |
by (simp add: ndepth_def Node_K0_I [THEN Abs_Node_inverse] Least_equality)
|
wenzelm@20819
|
260 |
|
wenzelm@20819
|
261 |
lemma ndepth_Push_Node_aux:
|
wenzelm@20819
|
262 |
"nat_case (Inr (Suc i)) f k = Inr 0 --> Suc(LEAST x. f x = Inr 0) <= k"
|
wenzelm@20819
|
263 |
apply (induct_tac "k", auto)
|
wenzelm@20819
|
264 |
apply (erule Least_le)
|
wenzelm@20819
|
265 |
done
|
wenzelm@20819
|
266 |
|
wenzelm@20819
|
267 |
lemma ndepth_Push_Node:
|
wenzelm@20819
|
268 |
"ndepth (Push_Node (Inr (Suc i)) n) = Suc(ndepth(n))"
|
wenzelm@20819
|
269 |
apply (insert Rep_Node [of n, unfolded Node_def])
|
wenzelm@20819
|
270 |
apply (auto simp add: ndepth_def Push_Node_def
|
wenzelm@20819
|
271 |
Rep_Node [THEN Node_Push_I, THEN Abs_Node_inverse])
|
wenzelm@20819
|
272 |
apply (rule Least_equality)
|
wenzelm@20819
|
273 |
apply (auto simp add: Push_def ndepth_Push_Node_aux)
|
wenzelm@20819
|
274 |
apply (erule LeastI)
|
wenzelm@20819
|
275 |
done
|
wenzelm@20819
|
276 |
|
wenzelm@20819
|
277 |
|
wenzelm@20819
|
278 |
(*** ntrunc applied to the various node sets ***)
|
wenzelm@20819
|
279 |
|
wenzelm@20819
|
280 |
lemma ntrunc_0 [simp]: "ntrunc 0 M = {}"
|
wenzelm@20819
|
281 |
by (simp add: ntrunc_def)
|
wenzelm@20819
|
282 |
|
wenzelm@20819
|
283 |
lemma ntrunc_Atom [simp]: "ntrunc (Suc k) (Atom a) = Atom(a)"
|
wenzelm@20819
|
284 |
by (auto simp add: Atom_def ntrunc_def ndepth_K0)
|
wenzelm@20819
|
285 |
|
wenzelm@20819
|
286 |
lemma ntrunc_Leaf [simp]: "ntrunc (Suc k) (Leaf a) = Leaf(a)"
|
huffman@35208
|
287 |
unfolding Leaf_def o_def by (rule ntrunc_Atom)
|
wenzelm@20819
|
288 |
|
wenzelm@20819
|
289 |
lemma ntrunc_Numb [simp]: "ntrunc (Suc k) (Numb i) = Numb(i)"
|
huffman@35208
|
290 |
unfolding Numb_def o_def by (rule ntrunc_Atom)
|
wenzelm@20819
|
291 |
|
wenzelm@20819
|
292 |
lemma ntrunc_Scons [simp]:
|
wenzelm@20819
|
293 |
"ntrunc (Suc k) (Scons M N) = Scons (ntrunc k M) (ntrunc k N)"
|
huffman@35208
|
294 |
unfolding Scons_def ntrunc_def One_nat_def
|
huffman@35208
|
295 |
by (auto simp add: ndepth_Push_Node)
|
wenzelm@20819
|
296 |
|
wenzelm@20819
|
297 |
|
wenzelm@20819
|
298 |
|
wenzelm@20819
|
299 |
(** Injection nodes **)
|
wenzelm@20819
|
300 |
|
wenzelm@20819
|
301 |
lemma ntrunc_one_In0 [simp]: "ntrunc (Suc 0) (In0 M) = {}"
|
wenzelm@20819
|
302 |
apply (simp add: In0_def)
|
wenzelm@20819
|
303 |
apply (simp add: Scons_def)
|
wenzelm@20819
|
304 |
done
|
wenzelm@20819
|
305 |
|
wenzelm@20819
|
306 |
lemma ntrunc_In0 [simp]: "ntrunc (Suc(Suc k)) (In0 M) = In0 (ntrunc (Suc k) M)"
|
wenzelm@20819
|
307 |
by (simp add: In0_def)
|
wenzelm@20819
|
308 |
|
wenzelm@20819
|
309 |
lemma ntrunc_one_In1 [simp]: "ntrunc (Suc 0) (In1 M) = {}"
|
wenzelm@20819
|
310 |
apply (simp add: In1_def)
|
wenzelm@20819
|
311 |
apply (simp add: Scons_def)
|
wenzelm@20819
|
312 |
done
|
wenzelm@20819
|
313 |
|
wenzelm@20819
|
314 |
lemma ntrunc_In1 [simp]: "ntrunc (Suc(Suc k)) (In1 M) = In1 (ntrunc (Suc k) M)"
|
wenzelm@20819
|
315 |
by (simp add: In1_def)
|
wenzelm@20819
|
316 |
|
wenzelm@20819
|
317 |
|
wenzelm@20819
|
318 |
subsection{*Set Constructions*}
|
wenzelm@20819
|
319 |
|
wenzelm@20819
|
320 |
|
wenzelm@20819
|
321 |
(*** Cartesian Product ***)
|
wenzelm@20819
|
322 |
|
wenzelm@20819
|
323 |
lemma uprodI [intro!]: "[| M:A; N:B |] ==> Scons M N : uprod A B"
|
wenzelm@20819
|
324 |
by (simp add: uprod_def)
|
wenzelm@20819
|
325 |
|
wenzelm@20819
|
326 |
(*The general elimination rule*)
|
wenzelm@20819
|
327 |
lemma uprodE [elim!]:
|
wenzelm@20819
|
328 |
"[| c : uprod A B;
|
wenzelm@20819
|
329 |
!!x y. [| x:A; y:B; c = Scons x y |] ==> P
|
wenzelm@20819
|
330 |
|] ==> P"
|
wenzelm@20819
|
331 |
by (auto simp add: uprod_def)
|
wenzelm@20819
|
332 |
|
wenzelm@20819
|
333 |
|
wenzelm@20819
|
334 |
(*Elimination of a pair -- introduces no eigenvariables*)
|
wenzelm@20819
|
335 |
lemma uprodE2: "[| Scons M N : uprod A B; [| M:A; N:B |] ==> P |] ==> P"
|
wenzelm@20819
|
336 |
by (auto simp add: uprod_def)
|
wenzelm@20819
|
337 |
|
wenzelm@20819
|
338 |
|
wenzelm@20819
|
339 |
(*** Disjoint Sum ***)
|
wenzelm@20819
|
340 |
|
wenzelm@20819
|
341 |
lemma usum_In0I [intro]: "M:A ==> In0(M) : usum A B"
|
wenzelm@20819
|
342 |
by (simp add: usum_def)
|
wenzelm@20819
|
343 |
|
wenzelm@20819
|
344 |
lemma usum_In1I [intro]: "N:B ==> In1(N) : usum A B"
|
wenzelm@20819
|
345 |
by (simp add: usum_def)
|
wenzelm@20819
|
346 |
|
wenzelm@20819
|
347 |
lemma usumE [elim!]:
|
wenzelm@20819
|
348 |
"[| u : usum A B;
|
wenzelm@20819
|
349 |
!!x. [| x:A; u=In0(x) |] ==> P;
|
wenzelm@20819
|
350 |
!!y. [| y:B; u=In1(y) |] ==> P
|
wenzelm@20819
|
351 |
|] ==> P"
|
wenzelm@20819
|
352 |
by (auto simp add: usum_def)
|
wenzelm@20819
|
353 |
|
wenzelm@20819
|
354 |
|
wenzelm@20819
|
355 |
(** Injection **)
|
wenzelm@20819
|
356 |
|
wenzelm@20819
|
357 |
lemma In0_not_In1 [iff]: "In0(M) \<noteq> In1(N)"
|
huffman@35208
|
358 |
unfolding In0_def In1_def One_nat_def by auto
|
wenzelm@20819
|
359 |
|
haftmann@21407
|
360 |
lemmas In1_not_In0 [iff] = In0_not_In1 [THEN not_sym, standard]
|
wenzelm@20819
|
361 |
|
wenzelm@20819
|
362 |
lemma In0_inject: "In0(M) = In0(N) ==> M=N"
|
wenzelm@20819
|
363 |
by (simp add: In0_def)
|
wenzelm@20819
|
364 |
|
wenzelm@20819
|
365 |
lemma In1_inject: "In1(M) = In1(N) ==> M=N"
|
wenzelm@20819
|
366 |
by (simp add: In1_def)
|
wenzelm@20819
|
367 |
|
wenzelm@20819
|
368 |
lemma In0_eq [iff]: "(In0 M = In0 N) = (M=N)"
|
wenzelm@20819
|
369 |
by (blast dest!: In0_inject)
|
wenzelm@20819
|
370 |
|
wenzelm@20819
|
371 |
lemma In1_eq [iff]: "(In1 M = In1 N) = (M=N)"
|
wenzelm@20819
|
372 |
by (blast dest!: In1_inject)
|
wenzelm@20819
|
373 |
|
wenzelm@20819
|
374 |
lemma inj_In0: "inj In0"
|
wenzelm@20819
|
375 |
by (blast intro!: inj_onI)
|
wenzelm@20819
|
376 |
|
wenzelm@20819
|
377 |
lemma inj_In1: "inj In1"
|
wenzelm@20819
|
378 |
by (blast intro!: inj_onI)
|
wenzelm@20819
|
379 |
|
wenzelm@20819
|
380 |
|
wenzelm@20819
|
381 |
(*** Function spaces ***)
|
wenzelm@20819
|
382 |
|
wenzelm@20819
|
383 |
lemma Lim_inject: "Lim f = Lim g ==> f = g"
|
wenzelm@20819
|
384 |
apply (simp add: Lim_def)
|
wenzelm@20819
|
385 |
apply (rule ext)
|
wenzelm@20819
|
386 |
apply (blast elim!: Push_Node_inject)
|
wenzelm@20819
|
387 |
done
|
wenzelm@20819
|
388 |
|
wenzelm@20819
|
389 |
|
wenzelm@20819
|
390 |
(*** proving equality of sets and functions using ntrunc ***)
|
wenzelm@20819
|
391 |
|
wenzelm@20819
|
392 |
lemma ntrunc_subsetI: "ntrunc k M <= M"
|
wenzelm@20819
|
393 |
by (auto simp add: ntrunc_def)
|
wenzelm@20819
|
394 |
|
wenzelm@20819
|
395 |
lemma ntrunc_subsetD: "(!!k. ntrunc k M <= N) ==> M<=N"
|
wenzelm@20819
|
396 |
by (auto simp add: ntrunc_def)
|
wenzelm@20819
|
397 |
|
wenzelm@20819
|
398 |
(*A generalized form of the take-lemma*)
|
wenzelm@20819
|
399 |
lemma ntrunc_equality: "(!!k. ntrunc k M = ntrunc k N) ==> M=N"
|
wenzelm@20819
|
400 |
apply (rule equalityI)
|
wenzelm@20819
|
401 |
apply (rule_tac [!] ntrunc_subsetD)
|
wenzelm@20819
|
402 |
apply (rule_tac [!] ntrunc_subsetI [THEN [2] subset_trans], auto)
|
wenzelm@20819
|
403 |
done
|
wenzelm@20819
|
404 |
|
wenzelm@20819
|
405 |
lemma ntrunc_o_equality:
|
wenzelm@20819
|
406 |
"[| !!k. (ntrunc(k) o h1) = (ntrunc(k) o h2) |] ==> h1=h2"
|
wenzelm@20819
|
407 |
apply (rule ntrunc_equality [THEN ext])
|
nipkow@39535
|
408 |
apply (simp add: fun_eq_iff)
|
wenzelm@20819
|
409 |
done
|
wenzelm@20819
|
410 |
|
wenzelm@20819
|
411 |
|
wenzelm@20819
|
412 |
(*** Monotonicity ***)
|
wenzelm@20819
|
413 |
|
wenzelm@20819
|
414 |
lemma uprod_mono: "[| A<=A'; B<=B' |] ==> uprod A B <= uprod A' B'"
|
wenzelm@20819
|
415 |
by (simp add: uprod_def, blast)
|
wenzelm@20819
|
416 |
|
wenzelm@20819
|
417 |
lemma usum_mono: "[| A<=A'; B<=B' |] ==> usum A B <= usum A' B'"
|
wenzelm@20819
|
418 |
by (simp add: usum_def, blast)
|
wenzelm@20819
|
419 |
|
wenzelm@20819
|
420 |
lemma Scons_mono: "[| M<=M'; N<=N' |] ==> Scons M N <= Scons M' N'"
|
wenzelm@20819
|
421 |
by (simp add: Scons_def, blast)
|
wenzelm@20819
|
422 |
|
wenzelm@20819
|
423 |
lemma In0_mono: "M<=N ==> In0(M) <= In0(N)"
|
huffman@35208
|
424 |
by (simp add: In0_def Scons_mono)
|
wenzelm@20819
|
425 |
|
wenzelm@20819
|
426 |
lemma In1_mono: "M<=N ==> In1(M) <= In1(N)"
|
huffman@35208
|
427 |
by (simp add: In1_def Scons_mono)
|
wenzelm@20819
|
428 |
|
wenzelm@20819
|
429 |
|
wenzelm@20819
|
430 |
(*** Split and Case ***)
|
wenzelm@20819
|
431 |
|
wenzelm@20819
|
432 |
lemma Split [simp]: "Split c (Scons M N) = c M N"
|
wenzelm@20819
|
433 |
by (simp add: Split_def)
|
wenzelm@20819
|
434 |
|
wenzelm@20819
|
435 |
lemma Case_In0 [simp]: "Case c d (In0 M) = c(M)"
|
wenzelm@20819
|
436 |
by (simp add: Case_def)
|
wenzelm@20819
|
437 |
|
wenzelm@20819
|
438 |
lemma Case_In1 [simp]: "Case c d (In1 N) = d(N)"
|
wenzelm@20819
|
439 |
by (simp add: Case_def)
|
wenzelm@20819
|
440 |
|
wenzelm@20819
|
441 |
|
wenzelm@20819
|
442 |
|
wenzelm@20819
|
443 |
(**** UN x. B(x) rules ****)
|
wenzelm@20819
|
444 |
|
wenzelm@20819
|
445 |
lemma ntrunc_UN1: "ntrunc k (UN x. f(x)) = (UN x. ntrunc k (f x))"
|
wenzelm@20819
|
446 |
by (simp add: ntrunc_def, blast)
|
wenzelm@20819
|
447 |
|
wenzelm@20819
|
448 |
lemma Scons_UN1_x: "Scons (UN x. f x) M = (UN x. Scons (f x) M)"
|
wenzelm@20819
|
449 |
by (simp add: Scons_def, blast)
|
wenzelm@20819
|
450 |
|
wenzelm@20819
|
451 |
lemma Scons_UN1_y: "Scons M (UN x. f x) = (UN x. Scons M (f x))"
|
wenzelm@20819
|
452 |
by (simp add: Scons_def, blast)
|
wenzelm@20819
|
453 |
|
wenzelm@20819
|
454 |
lemma In0_UN1: "In0(UN x. f(x)) = (UN x. In0(f(x)))"
|
wenzelm@20819
|
455 |
by (simp add: In0_def Scons_UN1_y)
|
wenzelm@20819
|
456 |
|
wenzelm@20819
|
457 |
lemma In1_UN1: "In1(UN x. f(x)) = (UN x. In1(f(x)))"
|
wenzelm@20819
|
458 |
by (simp add: In1_def Scons_UN1_y)
|
wenzelm@20819
|
459 |
|
wenzelm@20819
|
460 |
|
wenzelm@20819
|
461 |
(*** Equality for Cartesian Product ***)
|
wenzelm@20819
|
462 |
|
wenzelm@20819
|
463 |
lemma dprodI [intro!]:
|
wenzelm@20819
|
464 |
"[| (M,M'):r; (N,N'):s |] ==> (Scons M N, Scons M' N') : dprod r s"
|
wenzelm@20819
|
465 |
by (auto simp add: dprod_def)
|
wenzelm@20819
|
466 |
|
wenzelm@20819
|
467 |
(*The general elimination rule*)
|
wenzelm@20819
|
468 |
lemma dprodE [elim!]:
|
wenzelm@20819
|
469 |
"[| c : dprod r s;
|
wenzelm@20819
|
470 |
!!x y x' y'. [| (x,x') : r; (y,y') : s;
|
wenzelm@20819
|
471 |
c = (Scons x y, Scons x' y') |] ==> P
|
wenzelm@20819
|
472 |
|] ==> P"
|
wenzelm@20819
|
473 |
by (auto simp add: dprod_def)
|
wenzelm@20819
|
474 |
|
wenzelm@20819
|
475 |
|
wenzelm@20819
|
476 |
(*** Equality for Disjoint Sum ***)
|
wenzelm@20819
|
477 |
|
wenzelm@20819
|
478 |
lemma dsum_In0I [intro]: "(M,M'):r ==> (In0(M), In0(M')) : dsum r s"
|
wenzelm@20819
|
479 |
by (auto simp add: dsum_def)
|
wenzelm@20819
|
480 |
|
wenzelm@20819
|
481 |
lemma dsum_In1I [intro]: "(N,N'):s ==> (In1(N), In1(N')) : dsum r s"
|
wenzelm@20819
|
482 |
by (auto simp add: dsum_def)
|
wenzelm@20819
|
483 |
|
wenzelm@20819
|
484 |
lemma dsumE [elim!]:
|
wenzelm@20819
|
485 |
"[| w : dsum r s;
|
wenzelm@20819
|
486 |
!!x x'. [| (x,x') : r; w = (In0(x), In0(x')) |] ==> P;
|
wenzelm@20819
|
487 |
!!y y'. [| (y,y') : s; w = (In1(y), In1(y')) |] ==> P
|
wenzelm@20819
|
488 |
|] ==> P"
|
wenzelm@20819
|
489 |
by (auto simp add: dsum_def)
|
wenzelm@20819
|
490 |
|
wenzelm@20819
|
491 |
|
wenzelm@20819
|
492 |
(*** Monotonicity ***)
|
wenzelm@20819
|
493 |
|
wenzelm@20819
|
494 |
lemma dprod_mono: "[| r<=r'; s<=s' |] ==> dprod r s <= dprod r' s'"
|
wenzelm@20819
|
495 |
by blast
|
wenzelm@20819
|
496 |
|
wenzelm@20819
|
497 |
lemma dsum_mono: "[| r<=r'; s<=s' |] ==> dsum r s <= dsum r' s'"
|
wenzelm@20819
|
498 |
by blast
|
wenzelm@20819
|
499 |
|
wenzelm@20819
|
500 |
|
wenzelm@20819
|
501 |
(*** Bounding theorems ***)
|
wenzelm@20819
|
502 |
|
wenzelm@20819
|
503 |
lemma dprod_Sigma: "(dprod (A <*> B) (C <*> D)) <= (uprod A C) <*> (uprod B D)"
|
wenzelm@20819
|
504 |
by blast
|
wenzelm@20819
|
505 |
|
wenzelm@20819
|
506 |
lemmas dprod_subset_Sigma = subset_trans [OF dprod_mono dprod_Sigma, standard]
|
wenzelm@20819
|
507 |
|
wenzelm@20819
|
508 |
(*Dependent version*)
|
wenzelm@20819
|
509 |
lemma dprod_subset_Sigma2:
|
wenzelm@20819
|
510 |
"(dprod (Sigma A B) (Sigma C D)) <=
|
wenzelm@20819
|
511 |
Sigma (uprod A C) (Split (%x y. uprod (B x) (D y)))"
|
wenzelm@20819
|
512 |
by auto
|
wenzelm@20819
|
513 |
|
wenzelm@20819
|
514 |
lemma dsum_Sigma: "(dsum (A <*> B) (C <*> D)) <= (usum A C) <*> (usum B D)"
|
wenzelm@20819
|
515 |
by blast
|
wenzelm@20819
|
516 |
|
wenzelm@20819
|
517 |
lemmas dsum_subset_Sigma = subset_trans [OF dsum_mono dsum_Sigma, standard]
|
wenzelm@20819
|
518 |
|
wenzelm@20819
|
519 |
|
haftmann@24162
|
520 |
text {* hides popular names *}
|
wenzelm@36176
|
521 |
hide_type (open) node item
|
wenzelm@36176
|
522 |
hide_const (open) Push Node Atom Leaf Numb Lim Split Case
|
wenzelm@20819
|
523 |
|
haftmann@33962
|
524 |
use "Tools/Datatype/datatype.ML"
|
wenzelm@20819
|
525 |
|
haftmann@33958
|
526 |
use "Tools/inductive_realizer.ML"
|
haftmann@33958
|
527 |
setup InductiveRealizer.setup
|
wenzelm@20819
|
528 |
|
haftmann@33958
|
529 |
use "Tools/Datatype/datatype_realizer.ML"
|
haftmann@33967
|
530 |
setup Datatype_Realizer.setup
|
berghofe@13635
|
531 |
|
berghofe@5181
|
532 |
end
|