author | haftmann |
Sun, 13 Mar 2016 10:22:46 +0100 | |
changeset 62608 | 19f87fa0cfcb |
parent 61391 | 2332d9be352b |
child 63120 | 629a4c5e953e |
permissions | -rw-r--r-- |
17441 | 1 |
(* Title: CTT/CTT.thy |
0 | 2 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
3 |
Copyright 1993 University of Cambridge |
|
4 |
*) |
|
5 |
||
60770 | 6 |
section \<open>Constructive Type Theory\<close> |
0 | 7 |
|
17441 | 8 |
theory CTT |
9 |
imports Pure |
|
10 |
begin |
|
11 |
||
48891 | 12 |
ML_file "~~/src/Provers/typedsimp.ML" |
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
35762
diff
changeset
|
13 |
setup Pure_Thy.old_appl_syntax_setup |
26956
1309a6a0a29f
setup PureThy.old_appl_syntax_setup -- theory Pure provides regular application syntax by default;
wenzelm
parents:
26391
diff
changeset
|
14 |
|
17441 | 15 |
typedecl i |
16 |
typedecl t |
|
17 |
typedecl o |
|
0 | 18 |
|
19 |
consts |
|
20 |
(*Types*) |
|
17441 | 21 |
F :: "t" |
22 |
T :: "t" (*F is empty, T contains one element*) |
|
58977 | 23 |
contr :: "i\<Rightarrow>i" |
0 | 24 |
tt :: "i" |
25 |
(*Natural numbers*) |
|
26 |
N :: "t" |
|
58977 | 27 |
succ :: "i\<Rightarrow>i" |
28 |
rec :: "[i, i, [i,i]\<Rightarrow>i] \<Rightarrow> i" |
|
0 | 29 |
(*Unions*) |
58977 | 30 |
inl :: "i\<Rightarrow>i" |
31 |
inr :: "i\<Rightarrow>i" |
|
60555
51a6997b1384
support 'when' statement, which corresponds to 'presume';
wenzelm
parents:
59780
diff
changeset
|
32 |
"when" :: "[i, i\<Rightarrow>i, i\<Rightarrow>i]\<Rightarrow>i" |
0 | 33 |
(*General Sum and Binary Product*) |
58977 | 34 |
Sum :: "[t, i\<Rightarrow>t]\<Rightarrow>t" |
35 |
fst :: "i\<Rightarrow>i" |
|
36 |
snd :: "i\<Rightarrow>i" |
|
37 |
split :: "[i, [i,i]\<Rightarrow>i] \<Rightarrow>i" |
|
0 | 38 |
(*General Product and Function Space*) |
58977 | 39 |
Prod :: "[t, i\<Rightarrow>t]\<Rightarrow>t" |
14765 | 40 |
(*Types*) |
58977 | 41 |
Plus :: "[t,t]\<Rightarrow>t" (infixr "+" 40) |
0 | 42 |
(*Equality type*) |
58977 | 43 |
Eq :: "[t,i,i]\<Rightarrow>t" |
0 | 44 |
eq :: "i" |
45 |
(*Judgements*) |
|
58977 | 46 |
Type :: "t \<Rightarrow> prop" ("(_ type)" [10] 5) |
47 |
Eqtype :: "[t,t]\<Rightarrow>prop" ("(_ =/ _)" [10,10] 5) |
|
48 |
Elem :: "[i, t]\<Rightarrow>prop" ("(_ /: _)" [10,10] 5) |
|
49 |
Eqelem :: "[i,i,t]\<Rightarrow>prop" ("(_ =/ _ :/ _)" [10,10,10] 5) |
|
50 |
Reduce :: "[i,i]\<Rightarrow>prop" ("Reduce[_,_]") |
|
0 | 51 |
(*Types*) |
14765 | 52 |
|
0 | 53 |
(*Functions*) |
61391 | 54 |
lambda :: "(i \<Rightarrow> i) \<Rightarrow> i" (binder "\<^bold>\<lambda>" 10) |
58977 | 55 |
app :: "[i,i]\<Rightarrow>i" (infixl "`" 60) |
0 | 56 |
(*Natural numbers*) |
41310 | 57 |
Zero :: "i" ("0") |
0 | 58 |
(*Pairing*) |
58977 | 59 |
pair :: "[i,i]\<Rightarrow>i" ("(1<_,/_>)") |
0 | 60 |
|
14765 | 61 |
syntax |
61391 | 62 |
"_PROD" :: "[idt,t,t]\<Rightarrow>t" ("(3\<Prod>_:_./ _)" 10) |
63 |
"_SUM" :: "[idt,t,t]\<Rightarrow>t" ("(3\<Sum>_:_./ _)" 10) |
|
0 | 64 |
translations |
61391 | 65 |
"\<Prod>x:A. B" \<rightleftharpoons> "CONST Prod(A, \<lambda>x. B)" |
66 |
"\<Sum>x:A. B" \<rightleftharpoons> "CONST Sum(A, \<lambda>x. B)" |
|
19761 | 67 |
|
68 |
abbreviation |
|
61391 | 69 |
Arrow :: "[t,t]\<Rightarrow>t" (infixr "\<longrightarrow>" 30) where |
70 |
"A \<longrightarrow> B \<equiv> \<Prod>_:A. B" |
|
21404
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21210
diff
changeset
|
71 |
abbreviation |
61391 | 72 |
Times :: "[t,t]\<Rightarrow>t" (infixr "\<times>" 50) where |
73 |
"A \<times> B \<equiv> \<Sum>_:A. B" |
|
10467
e6e7205e9e91
x-symbol support for Pi, Sigma, -->, : (membership)
paulson
parents:
3837
diff
changeset
|
74 |
|
0 | 75 |
(*Reduction: a weaker notion than equality; a hack for simplification. |
76 |
Reduce[a,b] means either that a=b:A for some A or else that "a" and "b" |
|
77 |
are textually identical.*) |
|
78 |
||
79 |
(*does not verify a:A! Sound because only trans_red uses a Reduce premise |
|
80 |
No new theorems can be proved about the standard judgements.*) |
|
51308 | 81 |
axiomatization where |
82 |
refl_red: "\<And>a. Reduce[a,a]" and |
|
58977 | 83 |
red_if_equal: "\<And>a b A. a = b : A \<Longrightarrow> Reduce[a,b]" and |
84 |
trans_red: "\<And>a b c A. \<lbrakk>a = b : A; Reduce[b,c]\<rbrakk> \<Longrightarrow> a = c : A" and |
|
0 | 85 |
|
86 |
(*Reflexivity*) |
|
87 |
||
58977 | 88 |
refl_type: "\<And>A. A type \<Longrightarrow> A = A" and |
89 |
refl_elem: "\<And>a A. a : A \<Longrightarrow> a = a : A" and |
|
0 | 90 |
|
91 |
(*Symmetry*) |
|
92 |
||
58977 | 93 |
sym_type: "\<And>A B. A = B \<Longrightarrow> B = A" and |
94 |
sym_elem: "\<And>a b A. a = b : A \<Longrightarrow> b = a : A" and |
|
0 | 95 |
|
96 |
(*Transitivity*) |
|
97 |
||
58977 | 98 |
trans_type: "\<And>A B C. \<lbrakk>A = B; B = C\<rbrakk> \<Longrightarrow> A = C" and |
99 |
trans_elem: "\<And>a b c A. \<lbrakk>a = b : A; b = c : A\<rbrakk> \<Longrightarrow> a = c : A" and |
|
0 | 100 |
|
58977 | 101 |
equal_types: "\<And>a A B. \<lbrakk>a : A; A = B\<rbrakk> \<Longrightarrow> a : B" and |
102 |
equal_typesL: "\<And>a b A B. \<lbrakk>a = b : A; A = B\<rbrakk> \<Longrightarrow> a = b : B" and |
|
0 | 103 |
|
104 |
(*Substitution*) |
|
105 |
||
58977 | 106 |
subst_type: "\<And>a A B. \<lbrakk>a : A; \<And>z. z:A \<Longrightarrow> B(z) type\<rbrakk> \<Longrightarrow> B(a) type" and |
107 |
subst_typeL: "\<And>a c A B D. \<lbrakk>a = c : A; \<And>z. z:A \<Longrightarrow> B(z) = D(z)\<rbrakk> \<Longrightarrow> B(a) = D(c)" and |
|
0 | 108 |
|
58977 | 109 |
subst_elem: "\<And>a b A B. \<lbrakk>a : A; \<And>z. z:A \<Longrightarrow> b(z):B(z)\<rbrakk> \<Longrightarrow> b(a):B(a)" and |
17441 | 110 |
subst_elemL: |
58977 | 111 |
"\<And>a b c d A B. \<lbrakk>a = c : A; \<And>z. z:A \<Longrightarrow> b(z)=d(z) : B(z)\<rbrakk> \<Longrightarrow> b(a)=d(c) : B(a)" and |
0 | 112 |
|
113 |
||
114 |
(*The type N -- natural numbers*) |
|
115 |
||
51308 | 116 |
NF: "N type" and |
117 |
NI0: "0 : N" and |
|
58977 | 118 |
NI_succ: "\<And>a. a : N \<Longrightarrow> succ(a) : N" and |
119 |
NI_succL: "\<And>a b. a = b : N \<Longrightarrow> succ(a) = succ(b) : N" and |
|
0 | 120 |
|
17441 | 121 |
NE: |
58977 | 122 |
"\<And>p a b C. \<lbrakk>p: N; a: C(0); \<And>u v. \<lbrakk>u: N; v: C(u)\<rbrakk> \<Longrightarrow> b(u,v): C(succ(u))\<rbrakk> |
123 |
\<Longrightarrow> rec(p, a, \<lambda>u v. b(u,v)) : C(p)" and |
|
0 | 124 |
|
17441 | 125 |
NEL: |
58977 | 126 |
"\<And>p q a b c d C. \<lbrakk>p = q : N; a = c : C(0); |
127 |
\<And>u v. \<lbrakk>u: N; v: C(u)\<rbrakk> \<Longrightarrow> b(u,v) = d(u,v): C(succ(u))\<rbrakk> |
|
128 |
\<Longrightarrow> rec(p, a, \<lambda>u v. b(u,v)) = rec(q,c,d) : C(p)" and |
|
0 | 129 |
|
17441 | 130 |
NC0: |
58977 | 131 |
"\<And>a b C. \<lbrakk>a: C(0); \<And>u v. \<lbrakk>u: N; v: C(u)\<rbrakk> \<Longrightarrow> b(u,v): C(succ(u))\<rbrakk> |
132 |
\<Longrightarrow> rec(0, a, \<lambda>u v. b(u,v)) = a : C(0)" and |
|
0 | 133 |
|
17441 | 134 |
NC_succ: |
58977 | 135 |
"\<And>p a b C. \<lbrakk>p: N; a: C(0); \<And>u v. \<lbrakk>u: N; v: C(u)\<rbrakk> \<Longrightarrow> b(u,v): C(succ(u))\<rbrakk> \<Longrightarrow> |
136 |
rec(succ(p), a, \<lambda>u v. b(u,v)) = b(p, rec(p, a, \<lambda>u v. b(u,v))) : C(succ(p))" and |
|
0 | 137 |
|
61391 | 138 |
(*The fourth Peano axiom. See page 91 of Martin-Löf's book*) |
58977 | 139 |
zero_ne_succ: "\<And>a. \<lbrakk>a: N; 0 = succ(a) : N\<rbrakk> \<Longrightarrow> 0: F" and |
0 | 140 |
|
141 |
||
142 |
(*The Product of a family of types*) |
|
143 |
||
61391 | 144 |
ProdF: "\<And>A B. \<lbrakk>A type; \<And>x. x:A \<Longrightarrow> B(x) type\<rbrakk> \<Longrightarrow> \<Prod>x:A. B(x) type" and |
0 | 145 |
|
17441 | 146 |
ProdFL: |
61391 | 147 |
"\<And>A B C D. \<lbrakk>A = C; \<And>x. x:A \<Longrightarrow> B(x) = D(x)\<rbrakk> \<Longrightarrow> \<Prod>x:A. B(x) = \<Prod>x:C. D(x)" and |
0 | 148 |
|
17441 | 149 |
ProdI: |
61391 | 150 |
"\<And>b A B. \<lbrakk>A type; \<And>x. x:A \<Longrightarrow> b(x):B(x)\<rbrakk> \<Longrightarrow> \<^bold>\<lambda>x. b(x) : \<Prod>x:A. B(x)" and |
0 | 151 |
|
58977 | 152 |
ProdIL: "\<And>b c A B. \<lbrakk>A type; \<And>x. x:A \<Longrightarrow> b(x) = c(x) : B(x)\<rbrakk> \<Longrightarrow> |
61391 | 153 |
\<^bold>\<lambda>x. b(x) = \<^bold>\<lambda>x. c(x) : \<Prod>x:A. B(x)" and |
0 | 154 |
|
61391 | 155 |
ProdE: "\<And>p a A B. \<lbrakk>p : \<Prod>x:A. B(x); a : A\<rbrakk> \<Longrightarrow> p`a : B(a)" and |
156 |
ProdEL: "\<And>p q a b A B. \<lbrakk>p = q: \<Prod>x:A. B(x); a = b : A\<rbrakk> \<Longrightarrow> p`a = q`b : B(a)" and |
|
0 | 157 |
|
61391 | 158 |
ProdC: "\<And>a b A B. \<lbrakk>a : A; \<And>x. x:A \<Longrightarrow> b(x) : B(x)\<rbrakk> \<Longrightarrow> (\<^bold>\<lambda>x. b(x)) ` a = b(a) : B(a)" and |
0 | 159 |
|
61391 | 160 |
ProdC2: "\<And>p A B. p : \<Prod>x:A. B(x) \<Longrightarrow> (\<^bold>\<lambda>x. p`x) = p : \<Prod>x:A. B(x)" and |
0 | 161 |
|
162 |
||
163 |
(*The Sum of a family of types*) |
|
164 |
||
61391 | 165 |
SumF: "\<And>A B. \<lbrakk>A type; \<And>x. x:A \<Longrightarrow> B(x) type\<rbrakk> \<Longrightarrow> \<Sum>x:A. B(x) type" and |
166 |
SumFL: "\<And>A B C D. \<lbrakk>A = C; \<And>x. x:A \<Longrightarrow> B(x) = D(x)\<rbrakk> \<Longrightarrow> \<Sum>x:A. B(x) = \<Sum>x:C. D(x)" and |
|
0 | 167 |
|
61391 | 168 |
SumI: "\<And>a b A B. \<lbrakk>a : A; b : B(a)\<rbrakk> \<Longrightarrow> <a,b> : \<Sum>x:A. B(x)" and |
169 |
SumIL: "\<And>a b c d A B. \<lbrakk> a = c : A; b = d : B(a)\<rbrakk> \<Longrightarrow> <a,b> = <c,d> : \<Sum>x:A. B(x)" and |
|
0 | 170 |
|
61391 | 171 |
SumE: "\<And>p c A B C. \<lbrakk>p: \<Sum>x:A. B(x); \<And>x y. \<lbrakk>x:A; y:B(x)\<rbrakk> \<Longrightarrow> c(x,y): C(<x,y>)\<rbrakk> |
58977 | 172 |
\<Longrightarrow> split(p, \<lambda>x y. c(x,y)) : C(p)" and |
0 | 173 |
|
61391 | 174 |
SumEL: "\<And>p q c d A B C. \<lbrakk>p = q : \<Sum>x:A. B(x); |
58977 | 175 |
\<And>x y. \<lbrakk>x:A; y:B(x)\<rbrakk> \<Longrightarrow> c(x,y)=d(x,y): C(<x,y>)\<rbrakk> |
176 |
\<Longrightarrow> split(p, \<lambda>x y. c(x,y)) = split(q, \<lambda>x y. d(x,y)) : C(p)" and |
|
0 | 177 |
|
58977 | 178 |
SumC: "\<And>a b c A B C. \<lbrakk>a: A; b: B(a); \<And>x y. \<lbrakk>x:A; y:B(x)\<rbrakk> \<Longrightarrow> c(x,y): C(<x,y>)\<rbrakk> |
179 |
\<Longrightarrow> split(<a,b>, \<lambda>x y. c(x,y)) = c(a,b) : C(<a,b>)" and |
|
0 | 180 |
|
61391 | 181 |
fst_def: "\<And>a. fst(a) \<equiv> split(a, \<lambda>x y. x)" and |
182 |
snd_def: "\<And>a. snd(a) \<equiv> split(a, \<lambda>x y. y)" and |
|
0 | 183 |
|
184 |
||
185 |
(*The sum of two types*) |
|
186 |
||
58977 | 187 |
PlusF: "\<And>A B. \<lbrakk>A type; B type\<rbrakk> \<Longrightarrow> A+B type" and |
188 |
PlusFL: "\<And>A B C D. \<lbrakk>A = C; B = D\<rbrakk> \<Longrightarrow> A+B = C+D" and |
|
0 | 189 |
|
58977 | 190 |
PlusI_inl: "\<And>a A B. \<lbrakk>a : A; B type\<rbrakk> \<Longrightarrow> inl(a) : A+B" and |
191 |
PlusI_inlL: "\<And>a c A B. \<lbrakk>a = c : A; B type\<rbrakk> \<Longrightarrow> inl(a) = inl(c) : A+B" and |
|
0 | 192 |
|
58977 | 193 |
PlusI_inr: "\<And>b A B. \<lbrakk>A type; b : B\<rbrakk> \<Longrightarrow> inr(b) : A+B" and |
194 |
PlusI_inrL: "\<And>b d A B. \<lbrakk>A type; b = d : B\<rbrakk> \<Longrightarrow> inr(b) = inr(d) : A+B" and |
|
0 | 195 |
|
17441 | 196 |
PlusE: |
58977 | 197 |
"\<And>p c d A B C. \<lbrakk>p: A+B; |
198 |
\<And>x. x:A \<Longrightarrow> c(x): C(inl(x)); |
|
199 |
\<And>y. y:B \<Longrightarrow> d(y): C(inr(y)) \<rbrakk> \<Longrightarrow> when(p, \<lambda>x. c(x), \<lambda>y. d(y)) : C(p)" and |
|
0 | 200 |
|
17441 | 201 |
PlusEL: |
58977 | 202 |
"\<And>p q c d e f A B C. \<lbrakk>p = q : A+B; |
203 |
\<And>x. x: A \<Longrightarrow> c(x) = e(x) : C(inl(x)); |
|
204 |
\<And>y. y: B \<Longrightarrow> d(y) = f(y) : C(inr(y))\<rbrakk> |
|
205 |
\<Longrightarrow> when(p, \<lambda>x. c(x), \<lambda>y. d(y)) = when(q, \<lambda>x. e(x), \<lambda>y. f(y)) : C(p)" and |
|
0 | 206 |
|
17441 | 207 |
PlusC_inl: |
58977 | 208 |
"\<And>a c d A C. \<lbrakk>a: A; |
209 |
\<And>x. x:A \<Longrightarrow> c(x): C(inl(x)); |
|
210 |
\<And>y. y:B \<Longrightarrow> d(y): C(inr(y)) \<rbrakk> |
|
211 |
\<Longrightarrow> when(inl(a), \<lambda>x. c(x), \<lambda>y. d(y)) = c(a) : C(inl(a))" and |
|
0 | 212 |
|
17441 | 213 |
PlusC_inr: |
58977 | 214 |
"\<And>b c d A B C. \<lbrakk>b: B; |
215 |
\<And>x. x:A \<Longrightarrow> c(x): C(inl(x)); |
|
216 |
\<And>y. y:B \<Longrightarrow> d(y): C(inr(y))\<rbrakk> |
|
217 |
\<Longrightarrow> when(inr(b), \<lambda>x. c(x), \<lambda>y. d(y)) = d(b) : C(inr(b))" and |
|
0 | 218 |
|
219 |
||
220 |
(*The type Eq*) |
|
221 |
||
58977 | 222 |
EqF: "\<And>a b A. \<lbrakk>A type; a : A; b : A\<rbrakk> \<Longrightarrow> Eq(A,a,b) type" and |
223 |
EqFL: "\<And>a b c d A B. \<lbrakk>A = B; a = c : A; b = d : A\<rbrakk> \<Longrightarrow> Eq(A,a,b) = Eq(B,c,d)" and |
|
224 |
EqI: "\<And>a b A. a = b : A \<Longrightarrow> eq : Eq(A,a,b)" and |
|
225 |
EqE: "\<And>p a b A. p : Eq(A,a,b) \<Longrightarrow> a = b : A" and |
|
0 | 226 |
|
227 |
(*By equality of types, can prove C(p) from C(eq), an elimination rule*) |
|
58977 | 228 |
EqC: "\<And>p a b A. p : Eq(A,a,b) \<Longrightarrow> p = eq : Eq(A,a,b)" and |
0 | 229 |
|
230 |
(*The type F*) |
|
231 |
||
51308 | 232 |
FF: "F type" and |
58977 | 233 |
FE: "\<And>p C. \<lbrakk>p: F; C type\<rbrakk> \<Longrightarrow> contr(p) : C" and |
234 |
FEL: "\<And>p q C. \<lbrakk>p = q : F; C type\<rbrakk> \<Longrightarrow> contr(p) = contr(q) : C" and |
|
0 | 235 |
|
236 |
(*The type T |
|
61391 | 237 |
Martin-Löf's book (page 68) discusses elimination and computation. |
0 | 238 |
Elimination can be derived by computation and equality of types, |
239 |
but with an extra premise C(x) type x:T. |
|
240 |
Also computation can be derived from elimination. *) |
|
241 |
||
51308 | 242 |
TF: "T type" and |
243 |
TI: "tt : T" and |
|
58977 | 244 |
TE: "\<And>p c C. \<lbrakk>p : T; c : C(tt)\<rbrakk> \<Longrightarrow> c : C(p)" and |
245 |
TEL: "\<And>p q c d C. \<lbrakk>p = q : T; c = d : C(tt)\<rbrakk> \<Longrightarrow> c = d : C(p)" and |
|
246 |
TC: "\<And>p. p : T \<Longrightarrow> p = tt : T" |
|
0 | 247 |
|
19761 | 248 |
|
249 |
subsection "Tactics and derived rules for Constructive Type Theory" |
|
250 |
||
251 |
(*Formation rules*) |
|
252 |
lemmas form_rls = NF ProdF SumF PlusF EqF FF TF |
|
253 |
and formL_rls = ProdFL SumFL PlusFL EqFL |
|
254 |
||
255 |
(*Introduction rules |
|
256 |
OMITTED: EqI, because its premise is an eqelem, not an elem*) |
|
257 |
lemmas intr_rls = NI0 NI_succ ProdI SumI PlusI_inl PlusI_inr TI |
|
258 |
and intrL_rls = NI_succL ProdIL SumIL PlusI_inlL PlusI_inrL |
|
259 |
||
260 |
(*Elimination rules |
|
261 |
OMITTED: EqE, because its conclusion is an eqelem, not an elem |
|
262 |
TE, because it does not involve a constructor *) |
|
263 |
lemmas elim_rls = NE ProdE SumE PlusE FE |
|
264 |
and elimL_rls = NEL ProdEL SumEL PlusEL FEL |
|
265 |
||
266 |
(*OMITTED: eqC are TC because they make rewriting loop: p = un = un = ... *) |
|
267 |
lemmas comp_rls = NC0 NC_succ ProdC SumC PlusC_inl PlusC_inr |
|
268 |
||
269 |
(*rules with conclusion a:A, an elem judgement*) |
|
270 |
lemmas element_rls = intr_rls elim_rls |
|
271 |
||
272 |
(*Definitions are (meta)equality axioms*) |
|
273 |
lemmas basic_defs = fst_def snd_def |
|
274 |
||
275 |
(*Compare with standard version: B is applied to UNSIMPLIFIED expression! *) |
|
58977 | 276 |
lemma SumIL2: "\<lbrakk>c = a : A; d = b : B(a)\<rbrakk> \<Longrightarrow> <c,d> = <a,b> : Sum(A,B)" |
19761 | 277 |
apply (rule sym_elem) |
278 |
apply (rule SumIL) |
|
279 |
apply (rule_tac [!] sym_elem) |
|
280 |
apply assumption+ |
|
281 |
done |
|
282 |
||
283 |
lemmas intrL2_rls = NI_succL ProdIL SumIL2 PlusI_inlL PlusI_inrL |
|
284 |
||
285 |
(*Exploit p:Prod(A,B) to create the assumption z:B(a). |
|
286 |
A more natural form of product elimination. *) |
|
287 |
lemma subst_prodE: |
|
288 |
assumes "p: Prod(A,B)" |
|
289 |
and "a: A" |
|
58977 | 290 |
and "\<And>z. z: B(a) \<Longrightarrow> c(z): C(z)" |
19761 | 291 |
shows "c(p`a): C(p`a)" |
41526 | 292 |
apply (rule assms ProdE)+ |
19761 | 293 |
done |
294 |
||
295 |
||
60770 | 296 |
subsection \<open>Tactics for type checking\<close> |
19761 | 297 |
|
60770 | 298 |
ML \<open> |
19761 | 299 |
|
300 |
local |
|
301 |
||
56250 | 302 |
fun is_rigid_elem (Const(@{const_name Elem},_) $ a $ _) = not(is_Var (head_of a)) |
303 |
| is_rigid_elem (Const(@{const_name Eqelem},_) $ a $ _ $ _) = not(is_Var (head_of a)) |
|
304 |
| is_rigid_elem (Const(@{const_name Type},_) $ a) = not(is_Var (head_of a)) |
|
19761 | 305 |
| is_rigid_elem _ = false |
306 |
||
307 |
in |
|
308 |
||
309 |
(*Try solving a:A or a=b:A by assumption provided a is rigid!*) |
|
58963
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58889
diff
changeset
|
310 |
fun test_assume_tac ctxt = SUBGOAL(fn (prem,i) => |
19761 | 311 |
if is_rigid_elem (Logic.strip_assums_concl prem) |
58963
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58889
diff
changeset
|
312 |
then assume_tac ctxt i else no_tac) |
19761 | 313 |
|
58963
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58889
diff
changeset
|
314 |
fun ASSUME ctxt tf i = test_assume_tac ctxt i ORELSE tf i |
19761 | 315 |
|
316 |
end; |
|
317 |
||
60770 | 318 |
\<close> |
19761 | 319 |
|
320 |
(*For simplification: type formation and checking, |
|
321 |
but no equalities between terms*) |
|
322 |
lemmas routine_rls = form_rls formL_rls refl_type element_rls |
|
323 |
||
60770 | 324 |
ML \<open> |
19761 | 325 |
local |
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
26956
diff
changeset
|
326 |
val equal_rls = @{thms form_rls} @ @{thms element_rls} @ @{thms intrL_rls} @ |
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
26956
diff
changeset
|
327 |
@{thms elimL_rls} @ @{thms refl_elem} |
19761 | 328 |
in |
329 |
||
59164 | 330 |
fun routine_tac rls ctxt prems = |
331 |
ASSUME ctxt (filt_resolve_from_net_tac ctxt 4 (Tactic.build_net (prems @ rls))); |
|
19761 | 332 |
|
333 |
(*Solve all subgoals "A type" using formation rules. *) |
|
59164 | 334 |
val form_net = Tactic.build_net @{thms form_rls}; |
335 |
fun form_tac ctxt = |
|
336 |
REPEAT_FIRST (ASSUME ctxt (filt_resolve_from_net_tac ctxt 1 form_net)); |
|
19761 | 337 |
|
338 |
(*Type checking: solve a:A (a rigid, A flexible) by intro and elim rules. *) |
|
58963
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58889
diff
changeset
|
339 |
fun typechk_tac ctxt thms = |
59164 | 340 |
let val tac = |
341 |
filt_resolve_from_net_tac ctxt 3 |
|
342 |
(Tactic.build_net (thms @ @{thms form_rls} @ @{thms element_rls})) |
|
58963
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58889
diff
changeset
|
343 |
in REPEAT_FIRST (ASSUME ctxt tac) end |
19761 | 344 |
|
345 |
(*Solve a:A (a flexible, A rigid) by introduction rules. |
|
346 |
Cannot use stringtrees (filt_resolve_tac) since |
|
347 |
goals like ?a:SUM(A,B) have a trivial head-string *) |
|
58963
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58889
diff
changeset
|
348 |
fun intr_tac ctxt thms = |
59164 | 349 |
let val tac = |
350 |
filt_resolve_from_net_tac ctxt 1 |
|
351 |
(Tactic.build_net (thms @ @{thms form_rls} @ @{thms intr_rls})) |
|
58963
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58889
diff
changeset
|
352 |
in REPEAT_FIRST (ASSUME ctxt tac) end |
19761 | 353 |
|
354 |
(*Equality proving: solve a=b:A (where a is rigid) by long rules. *) |
|
58963
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58889
diff
changeset
|
355 |
fun equal_tac ctxt thms = |
59164 | 356 |
REPEAT_FIRST |
357 |
(ASSUME ctxt (filt_resolve_from_net_tac ctxt 3 (Tactic.build_net (thms @ equal_rls)))) |
|
0 | 358 |
|
17441 | 359 |
end |
60770 | 360 |
\<close> |
19761 | 361 |
|
60770 | 362 |
method_setup form = \<open>Scan.succeed (fn ctxt => SIMPLE_METHOD (form_tac ctxt))\<close> |
363 |
method_setup typechk = \<open>Attrib.thms >> (fn ths => fn ctxt => SIMPLE_METHOD (typechk_tac ctxt ths))\<close> |
|
364 |
method_setup intr = \<open>Attrib.thms >> (fn ths => fn ctxt => SIMPLE_METHOD (intr_tac ctxt ths))\<close> |
|
365 |
method_setup equal = \<open>Attrib.thms >> (fn ths => fn ctxt => SIMPLE_METHOD (equal_tac ctxt ths))\<close> |
|
19761 | 366 |
|
367 |
||
60770 | 368 |
subsection \<open>Simplification\<close> |
19761 | 369 |
|
370 |
(*To simplify the type in a goal*) |
|
58977 | 371 |
lemma replace_type: "\<lbrakk>B = A; a : A\<rbrakk> \<Longrightarrow> a : B" |
19761 | 372 |
apply (rule equal_types) |
373 |
apply (rule_tac [2] sym_type) |
|
374 |
apply assumption+ |
|
375 |
done |
|
376 |
||
377 |
(*Simplify the parameter of a unary type operator.*) |
|
378 |
lemma subst_eqtyparg: |
|
23467 | 379 |
assumes 1: "a=c : A" |
58977 | 380 |
and 2: "\<And>z. z:A \<Longrightarrow> B(z) type" |
19761 | 381 |
shows "B(a)=B(c)" |
382 |
apply (rule subst_typeL) |
|
383 |
apply (rule_tac [2] refl_type) |
|
23467 | 384 |
apply (rule 1) |
385 |
apply (erule 2) |
|
19761 | 386 |
done |
387 |
||
388 |
(*Simplification rules for Constructive Type Theory*) |
|
389 |
lemmas reduction_rls = comp_rls [THEN trans_elem] |
|
390 |
||
60770 | 391 |
ML \<open> |
19761 | 392 |
(*Converts each goal "e : Eq(A,a,b)" into "a=b:A" for simplification. |
393 |
Uses other intro rules to avoid changing flexible goals.*) |
|
59164 | 394 |
val eqintr_net = Tactic.build_net @{thms EqI intr_rls} |
58963
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58889
diff
changeset
|
395 |
fun eqintr_tac ctxt = |
59164 | 396 |
REPEAT_FIRST (ASSUME ctxt (filt_resolve_from_net_tac ctxt 1 eqintr_net)) |
19761 | 397 |
|
398 |
(** Tactics that instantiate CTT-rules. |
|
399 |
Vars in the given terms will be incremented! |
|
400 |
The (rtac EqE i) lets them apply to equality judgements. **) |
|
401 |
||
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
26956
diff
changeset
|
402 |
fun NE_tac ctxt sp i = |
60754 | 403 |
TRY (resolve_tac ctxt @{thms EqE} i) THEN |
59780 | 404 |
Rule_Insts.res_inst_tac ctxt [((("p", 0), Position.none), sp)] [] @{thm NE} i |
19761 | 405 |
|
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
26956
diff
changeset
|
406 |
fun SumE_tac ctxt sp i = |
60754 | 407 |
TRY (resolve_tac ctxt @{thms EqE} i) THEN |
59780 | 408 |
Rule_Insts.res_inst_tac ctxt [((("p", 0), Position.none), sp)] [] @{thm SumE} i |
19761 | 409 |
|
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
26956
diff
changeset
|
410 |
fun PlusE_tac ctxt sp i = |
60754 | 411 |
TRY (resolve_tac ctxt @{thms EqE} i) THEN |
59780 | 412 |
Rule_Insts.res_inst_tac ctxt [((("p", 0), Position.none), sp)] [] @{thm PlusE} i |
19761 | 413 |
|
414 |
(** Predicate logic reasoning, WITH THINNING!! Procedures adapted from NJ. **) |
|
415 |
||
416 |
(*Finds f:Prod(A,B) and a:A in the assumptions, concludes there is z:B(a) *) |
|
58963
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58889
diff
changeset
|
417 |
fun add_mp_tac ctxt i = |
60754 | 418 |
resolve_tac ctxt @{thms subst_prodE} i THEN assume_tac ctxt i THEN assume_tac ctxt i |
19761 | 419 |
|
61391 | 420 |
(*Finds P\<longrightarrow>Q and P in the assumptions, replaces implication by Q *) |
60754 | 421 |
fun mp_tac ctxt i = eresolve_tac ctxt @{thms subst_prodE} i THEN assume_tac ctxt i |
19761 | 422 |
|
423 |
(*"safe" when regarded as predicate calculus rules*) |
|
424 |
val safe_brls = sort (make_ord lessb) |
|
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
26956
diff
changeset
|
425 |
[ (true, @{thm FE}), (true,asm_rl), |
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
26956
diff
changeset
|
426 |
(false, @{thm ProdI}), (true, @{thm SumE}), (true, @{thm PlusE}) ] |
19761 | 427 |
|
428 |
val unsafe_brls = |
|
27208
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
26956
diff
changeset
|
429 |
[ (false, @{thm PlusI_inl}), (false, @{thm PlusI_inr}), (false, @{thm SumI}), |
5fe899199f85
proper context for tactics derived from res_inst_tac;
wenzelm
parents:
26956
diff
changeset
|
430 |
(true, @{thm subst_prodE}) ] |
19761 | 431 |
|
432 |
(*0 subgoals vs 1 or more*) |
|
433 |
val (safe0_brls, safep_brls) = |
|
434 |
List.partition (curry (op =) 0 o subgoals_of_brl) safe_brls |
|
435 |
||
58963
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58889
diff
changeset
|
436 |
fun safestep_tac ctxt thms i = |
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58889
diff
changeset
|
437 |
form_tac ctxt ORELSE |
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59164
diff
changeset
|
438 |
resolve_tac ctxt thms i ORELSE |
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59164
diff
changeset
|
439 |
biresolve_tac ctxt safe0_brls i ORELSE mp_tac ctxt i ORELSE |
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59164
diff
changeset
|
440 |
DETERM (biresolve_tac ctxt safep_brls i) |
19761 | 441 |
|
58963
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58889
diff
changeset
|
442 |
fun safe_tac ctxt thms i = DEPTH_SOLVE_1 (safestep_tac ctxt thms i) |
19761 | 443 |
|
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59164
diff
changeset
|
444 |
fun step_tac ctxt thms = safestep_tac ctxt thms ORELSE' biresolve_tac ctxt unsafe_brls |
19761 | 445 |
|
446 |
(*Fails unless it solves the goal!*) |
|
58963
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58889
diff
changeset
|
447 |
fun pc_tac ctxt thms = DEPTH_SOLVE_1 o (step_tac ctxt thms) |
60770 | 448 |
\<close> |
19761 | 449 |
|
60770 | 450 |
method_setup eqintr = \<open>Scan.succeed (SIMPLE_METHOD o eqintr_tac)\<close> |
451 |
method_setup NE = \<open> |
|
58975 | 452 |
Scan.lift Args.name_inner_syntax >> (fn s => fn ctxt => SIMPLE_METHOD' (NE_tac ctxt s)) |
60770 | 453 |
\<close> |
454 |
method_setup pc = \<open>Attrib.thms >> (fn ths => fn ctxt => SIMPLE_METHOD' (pc_tac ctxt ths))\<close> |
|
455 |
method_setup add_mp = \<open>Scan.succeed (SIMPLE_METHOD' o add_mp_tac)\<close> |
|
58972 | 456 |
|
48891 | 457 |
ML_file "rew.ML" |
60770 | 458 |
method_setup rew = \<open>Attrib.thms >> (fn ths => fn ctxt => SIMPLE_METHOD (rew_tac ctxt ths))\<close> |
459 |
method_setup hyp_rew = \<open>Attrib.thms >> (fn ths => fn ctxt => SIMPLE_METHOD (hyp_rew_tac ctxt ths))\<close> |
|
58972 | 460 |
|
19761 | 461 |
|
60770 | 462 |
subsection \<open>The elimination rules for fst/snd\<close> |
19761 | 463 |
|
58977 | 464 |
lemma SumE_fst: "p : Sum(A,B) \<Longrightarrow> fst(p) : A" |
19761 | 465 |
apply (unfold basic_defs) |
466 |
apply (erule SumE) |
|
467 |
apply assumption |
|
468 |
done |
|
469 |
||
470 |
(*The first premise must be p:Sum(A,B) !!*) |
|
471 |
lemma SumE_snd: |
|
472 |
assumes major: "p: Sum(A,B)" |
|
473 |
and "A type" |
|
58977 | 474 |
and "\<And>x. x:A \<Longrightarrow> B(x) type" |
19761 | 475 |
shows "snd(p) : B(fst(p))" |
476 |
apply (unfold basic_defs) |
|
477 |
apply (rule major [THEN SumE]) |
|
478 |
apply (rule SumC [THEN subst_eqtyparg, THEN replace_type]) |
|
58972 | 479 |
apply (typechk assms) |
19761 | 480 |
done |
481 |
||
482 |
end |