author | paulson |
Thu, 09 Apr 1998 12:31:35 +0200 | |
changeset 4803 | 8428d4699d58 |
parent 4503 | 5ed72705c201 |
child 4877 | 7a046198610e |
permissions | -rw-r--r-- |
2665 | 1 |
\begin{theindex} |
2 |
||
4503 | 3 |
\item {\tt !} symbol, 60, 62, 69, 70, 82 |
3962 | 4 |
\item {\tt[]} symbol, 82 |
5 |
\item {\tt\#} symbol, 82 |
|
6 |
\item {\tt\#*} symbol, 47, 128 |
|
7 |
\item {\tt\#+} symbol, 47, 128 |
|
3213 | 8 |
\item {\tt\#-} symbol, 47 |
3962 | 9 |
\item {\tt\&} symbol, 7, 60, 105 |
10 |
\item {\tt *} symbol, 26, 61, 79, 119 |
|
3213 | 11 |
\item {\tt *} type, 76 |
3962 | 12 |
\item {\tt +} symbol, 43, 61, 79, 119 |
3213 | 13 |
\item {\tt +} type, 76 |
3962 | 14 |
\item {\tt -} symbol, 25, 61, 79, 128 |
15 |
\item {\tt -->} symbol, 7, 60, 105, 119 |
|
3213 | 16 |
\item {\tt ->} symbol, 26 |
17 |
\item {\tt -``} symbol, 25 |
|
18 |
\item {\tt :} symbol, 25, 68 |
|
3962 | 19 |
\item {\tt <} constant, 80 |
20 |
\item {\tt <} symbol, 79 |
|
21 |
\item {\tt <->} symbol, 7, 105 |
|
22 |
\item {\tt <=} constant, 80 |
|
3213 | 23 |
\item {\tt <=} symbol, 25, 68 |
3962 | 24 |
\item {\tt =} symbol, 7, 60, 105, 119 |
3213 | 25 |
\item {\tt ?} symbol, 60, 62, 69, 70 |
26 |
\item {\tt ?!} symbol, 60 |
|
3962 | 27 |
\item {\tt\at} symbol, 60, 82 |
28 |
\item {\tt `} symbol, 25, 119 |
|
3213 | 29 |
\item {\tt ``} symbol, 25, 68 |
30 |
\item \verb'{}' symbol, 68 |
|
3962 | 31 |
\item {\tt |} symbol, 7, 60, 105 |
32 |
\item {\tt |-|} symbol, 128 |
|
2665 | 33 |
|
34 |
\indexspace |
|
35 |
||
3962 | 36 |
\item {\tt 0} constant, 25, 79, 117 |
2665 | 37 |
|
38 |
\indexspace |
|
39 |
||
3962 | 40 |
\item {\tt absdiff_def} theorem, 128 |
41 |
\item {\tt add_assoc} theorem, 128 |
|
42 |
\item {\tt add_commute} theorem, 128 |
|
43 |
\item {\tt add_def} theorem, 47, 128 |
|
44 |
\item {\tt add_inverse_diff} theorem, 128 |
|
45 |
\item {\tt add_mp_tac}, \bold{126} |
|
46 |
\item {\tt add_mult_dist} theorem, 47, 128 |
|
47 |
\item {\tt add_safes}, \bold{111} |
|
48 |
\item {\tt add_typing} theorem, 128 |
|
49 |
\item {\tt add_unsafes}, \bold{111} |
|
50 |
\item {\tt addC0} theorem, 128 |
|
51 |
\item {\tt addC_succ} theorem, 128 |
|
4068 | 52 |
\item {\tt addsplits}, \bold{76}, 81, 87 |
3962 | 53 |
\item {\tt ALL} symbol, 7, 26, 60, 62, 69, 70, 105 |
54 |
\item {\tt All} constant, 7, 60, 105 |
|
3213 | 55 |
\item {\tt All_def} theorem, 64 |
56 |
\item {\tt all_dupE} theorem, 5, 9, 66 |
|
57 |
\item {\tt all_impE} theorem, 9 |
|
58 |
\item {\tt allE} theorem, 5, 9, 66 |
|
59 |
\item {\tt allI} theorem, 8, 66 |
|
3962 | 60 |
\item {\tt allL} theorem, 107, 110 |
61 |
\item {\tt allL_thin} theorem, 108 |
|
62 |
\item {\tt allR} theorem, 107 |
|
3213 | 63 |
\item {\tt and_def} theorem, 42, 64 |
64 |
\item {\tt app_def} theorem, 49 |
|
65 |
\item {\tt apply_def} theorem, 31 |
|
66 |
\item {\tt apply_equality} theorem, 39, 40, 57 |
|
67 |
\item {\tt apply_equality2} theorem, 39 |
|
68 |
\item {\tt apply_iff} theorem, 39 |
|
69 |
\item {\tt apply_Pair} theorem, 39, 57 |
|
70 |
\item {\tt apply_type} theorem, 39 |
|
71 |
\item {\tt arg_cong} theorem, 65 |
|
3962 | 72 |
\item {\tt Arith} theory, 46, 80, 127 |
2665 | 73 |
\item assumptions |
3213 | 74 |
\subitem contradictory, 16 |
3962 | 75 |
\subitem in {\CTT}, 116, 126 |
2665 | 76 |
|
77 |
\indexspace |
|
78 |
||
3213 | 79 |
\item {\tt Ball} constant, 25, 29, 68, 70 |
80 |
\item {\tt ball_cong} theorem, 32, 33 |
|
81 |
\item {\tt Ball_def} theorem, 30, 71 |
|
82 |
\item {\tt ballE} theorem, 32, 33, 72 |
|
83 |
\item {\tt ballI} theorem, 33, 72 |
|
3962 | 84 |
\item {\tt basic} theorem, 107 |
85 |
\item {\tt basic_defs}, \bold{124} |
|
86 |
\item {\tt best_tac}, \bold{112} |
|
3213 | 87 |
\item {\tt beta} theorem, 39, 40 |
88 |
\item {\tt Bex} constant, 25, 29, 68, 70 |
|
89 |
\item {\tt bex_cong} theorem, 32, 33 |
|
90 |
\item {\tt Bex_def} theorem, 30, 71 |
|
91 |
\item {\tt bexCI} theorem, 33, 70, 72 |
|
92 |
\item {\tt bexE} theorem, 33, 72 |
|
93 |
\item {\tt bexI} theorem, 33, 70, 72 |
|
94 |
\item {\tt bij} constant, 45 |
|
95 |
\item {\tt bij_converse_bij} theorem, 45 |
|
96 |
\item {\tt bij_def} theorem, 45 |
|
97 |
\item {\tt bij_disjoint_Un} theorem, 45 |
|
98 |
\item {\tt Blast_tac}, 54--56 |
|
99 |
\item {\tt blast_tac}, 18, 20, 21 |
|
100 |
\item {\tt bnd_mono_def} theorem, 44 |
|
101 |
\item {\tt Bool} theory, 40 |
|
3498 | 102 |
\item {\textit {bool}} type, 61 |
3213 | 103 |
\item {\tt bool_0I} theorem, 42 |
104 |
\item {\tt bool_1I} theorem, 42 |
|
105 |
\item {\tt bool_def} theorem, 42 |
|
106 |
\item {\tt boolE} theorem, 42 |
|
107 |
\item {\tt box_equals} theorem, 65, 67 |
|
108 |
\item {\tt bspec} theorem, 33, 72 |
|
3962 | 109 |
\item {\tt butlast} constant, 82 |
2665 | 110 |
|
111 |
\indexspace |
|
112 |
||
3213 | 113 |
\item {\tt case} constant, 43 |
3962 | 114 |
\item {\tt case} symbol, 63, 80, 81, 87 |
3213 | 115 |
\item {\tt case_def} theorem, 43 |
116 |
\item {\tt case_Inl} theorem, 43 |
|
117 |
\item {\tt case_Inr} theorem, 43 |
|
118 |
\item {\tt case_tac}, \bold{67} |
|
3096 | 119 |
\item {\tt CCL} theory, 1 |
3213 | 120 |
\item {\tt ccontr} theorem, 66 |
121 |
\item {\tt classical} theorem, 66 |
|
122 |
\item {\tt coinduct} theorem, 44 |
|
3962 | 123 |
\item {\tt coinductive}, 96--99 |
3213 | 124 |
\item {\tt Collect} constant, 25, 26, 29, 68, 70 |
125 |
\item {\tt Collect_def} theorem, 30 |
|
126 |
\item {\tt Collect_mem_eq} theorem, 70, 71 |
|
127 |
\item {\tt Collect_subset} theorem, 36 |
|
3962 | 128 |
\item {\tt CollectD} theorem, 72, 102 |
3213 | 129 |
\item {\tt CollectD1} theorem, 32, 34 |
130 |
\item {\tt CollectD2} theorem, 32, 34 |
|
131 |
\item {\tt CollectE} theorem, 32, 34, 72 |
|
3962 | 132 |
\item {\tt CollectI} theorem, 34, 72, 102 |
3213 | 133 |
\item {\tt comp_assoc} theorem, 45 |
134 |
\item {\tt comp_bij} theorem, 45 |
|
135 |
\item {\tt comp_def} theorem, 45 |
|
136 |
\item {\tt comp_func} theorem, 45 |
|
137 |
\item {\tt comp_func_apply} theorem, 45 |
|
138 |
\item {\tt comp_inj} theorem, 45 |
|
3962 | 139 |
\item {\tt comp_rls}, \bold{124} |
3213 | 140 |
\item {\tt comp_surj} theorem, 45 |
141 |
\item {\tt comp_type} theorem, 45 |
|
142 |
\item {\tt Compl} constant, 68 |
|
143 |
\item {\tt Compl_def} theorem, 71 |
|
144 |
\item {\tt Compl_disjoint} theorem, 74 |
|
145 |
\item {\tt Compl_Int} theorem, 74 |
|
146 |
\item {\tt Compl_partition} theorem, 74 |
|
147 |
\item {\tt Compl_Un} theorem, 74 |
|
148 |
\item {\tt ComplD} theorem, 73 |
|
149 |
\item {\tt ComplI} theorem, 73 |
|
3962 | 150 |
\item {\tt concat} constant, 82 |
3213 | 151 |
\item {\tt cond_0} theorem, 42 |
152 |
\item {\tt cond_1} theorem, 42 |
|
153 |
\item {\tt cond_def} theorem, 42 |
|
154 |
\item {\tt cong} theorem, 65 |
|
155 |
\item congruence rules, 32 |
|
156 |
\item {\tt conj_cong}, 6, 75 |
|
157 |
\item {\tt conj_impE} theorem, 9, 10 |
|
158 |
\item {\tt conjE} theorem, 9, 65 |
|
159 |
\item {\tt conjI} theorem, 8, 65 |
|
3962 | 160 |
\item {\tt conjL} theorem, 107 |
161 |
\item {\tt conjR} theorem, 107 |
|
3213 | 162 |
\item {\tt conjunct1} theorem, 8, 65 |
163 |
\item {\tt conjunct2} theorem, 8, 65 |
|
3962 | 164 |
\item {\tt conL} theorem, 108 |
165 |
\item {\tt conR} theorem, 108 |
|
3213 | 166 |
\item {\tt cons} constant, 25, 26 |
167 |
\item {\tt cons_def} theorem, 31 |
|
168 |
\item {\tt Cons_iff} theorem, 49 |
|
169 |
\item {\tt consCI} theorem, 35 |
|
170 |
\item {\tt consE} theorem, 35 |
|
171 |
\item {\tt ConsI} theorem, 49 |
|
172 |
\item {\tt consI1} theorem, 35 |
|
173 |
\item {\tt consI2} theorem, 35 |
|
3962 | 174 |
\item Constructive Type Theory, 116--138 |
175 |
\item {\tt contr} constant, 117 |
|
3213 | 176 |
\item {\tt converse} constant, 25, 39 |
177 |
\item {\tt converse_def} theorem, 31 |
|
3962 | 178 |
\item {\tt could_res}, \bold{109} |
179 |
\item {\tt could_resolve_seq}, \bold{110} |
|
180 |
\item {\tt CTT} theory, 1, 116 |
|
3096 | 181 |
\item {\tt Cube} theory, 1 |
3962 | 182 |
\item {\tt cut} theorem, 107 |
3213 | 183 |
\item {\tt cut_facts_tac}, 18, 19, 56 |
3962 | 184 |
\item {\tt cutL_tac}, \bold{109} |
185 |
\item {\tt cutR_tac}, \bold{109} |
|
2665 | 186 |
|
187 |
\indexspace |
|
188 |
||
3962 | 189 |
\item {\tt datatype}, 86--91 |
3213 | 190 |
\item {\tt deepen_tac}, 16 |
3962 | 191 |
\item {\tt diff_0_eq_0} theorem, 128 |
3213 | 192 |
\item {\tt Diff_cancel} theorem, 41 |
193 |
\item {\tt Diff_contains} theorem, 36 |
|
194 |
\item {\tt Diff_def} theorem, 30 |
|
3962 | 195 |
\item {\tt diff_def} theorem, 47, 128 |
3213 | 196 |
\item {\tt Diff_disjoint} theorem, 41 |
197 |
\item {\tt Diff_Int} theorem, 41 |
|
198 |
\item {\tt Diff_partition} theorem, 41 |
|
3962 | 199 |
\item {\tt diff_self_eq_0} theorem, 128 |
3213 | 200 |
\item {\tt Diff_subset} theorem, 36 |
3962 | 201 |
\item {\tt diff_succ_succ} theorem, 128 |
202 |
\item {\tt diff_typing} theorem, 128 |
|
3213 | 203 |
\item {\tt Diff_Un} theorem, 41 |
3962 | 204 |
\item {\tt diffC0} theorem, 128 |
3213 | 205 |
\item {\tt DiffD1} theorem, 35 |
206 |
\item {\tt DiffD2} theorem, 35 |
|
207 |
\item {\tt DiffE} theorem, 35 |
|
208 |
\item {\tt DiffI} theorem, 35 |
|
209 |
\item {\tt disj_impE} theorem, 9, 10, 14 |
|
210 |
\item {\tt disjCI} theorem, 11, 66 |
|
211 |
\item {\tt disjE} theorem, 8, 65 |
|
212 |
\item {\tt disjI1} theorem, 8, 65 |
|
213 |
\item {\tt disjI2} theorem, 8, 65 |
|
3962 | 214 |
\item {\tt disjL} theorem, 107 |
215 |
\item {\tt disjR} theorem, 107 |
|
216 |
\item {\tt div} symbol, 47, 79, 128 |
|
217 |
\item {\tt div_def} theorem, 47, 128 |
|
218 |
\item {\tt div_geq} theorem, 80 |
|
219 |
\item {\tt div_less} theorem, 80 |
|
220 |
\item {\tt Divides} theory, 80 |
|
3213 | 221 |
\item {\tt domain} constant, 25, 39 |
222 |
\item {\tt domain_def} theorem, 31 |
|
223 |
\item {\tt domain_of_fun} theorem, 39 |
|
224 |
\item {\tt domain_subset} theorem, 38 |
|
225 |
\item {\tt domain_type} theorem, 39 |
|
226 |
\item {\tt domainE} theorem, 38, 39 |
|
227 |
\item {\tt domainI} theorem, 38, 39 |
|
228 |
\item {\tt double_complement} theorem, 41, 74 |
|
229 |
\item {\tt dresolve_tac}, 53 |
|
3962 | 230 |
\item {\tt drop} constant, 82 |
231 |
\item {\tt dropWhile} constant, 82 |
|
2665 | 232 |
|
233 |
\indexspace |
|
234 |
||
3962 | 235 |
\item {\tt Elem} constant, 117 |
236 |
\item {\tt elim_rls}, \bold{124} |
|
237 |
\item {\tt elimL_rls}, \bold{124} |
|
3213 | 238 |
\item {\tt empty_def} theorem, 71 |
3962 | 239 |
\item {\tt empty_pack}, \bold{110} |
3213 | 240 |
\item {\tt empty_subsetI} theorem, 33 |
241 |
\item {\tt emptyE} theorem, 33, 73 |
|
242 |
\item {\tt Eps} constant, 60, 62 |
|
3962 | 243 |
\item {\tt Eq} constant, 117 |
244 |
\item {\tt eq} constant, 117, 122 |
|
3213 | 245 |
\item {\tt eq_mp_tac}, \bold{10} |
3962 | 246 |
\item {\tt EqC} theorem, 123 |
247 |
\item {\tt EqE} theorem, 123 |
|
248 |
\item {\tt Eqelem} constant, 117 |
|
249 |
\item {\tt EqF} theorem, 123 |
|
250 |
\item {\tt EqFL} theorem, 123 |
|
251 |
\item {\tt EqI} theorem, 123 |
|
252 |
\item {\tt Eqtype} constant, 117 |
|
253 |
\item {\tt equal_tac}, \bold{125} |
|
254 |
\item {\tt equal_types} theorem, 120 |
|
255 |
\item {\tt equal_typesL} theorem, 120 |
|
4068 | 256 |
\item {\tt equalityCE} theorem, 70, 72, 102, 103 |
3213 | 257 |
\item {\tt equalityD1} theorem, 33, 72 |
258 |
\item {\tt equalityD2} theorem, 33, 72 |
|
259 |
\item {\tt equalityE} theorem, 33, 72 |
|
260 |
\item {\tt equalityI} theorem, 33, 52, 72 |
|
261 |
\item {\tt equals0D} theorem, 33 |
|
262 |
\item {\tt equals0I} theorem, 33 |
|
263 |
\item {\tt eresolve_tac}, 16 |
|
264 |
\item {\tt eta} theorem, 39, 40 |
|
3962 | 265 |
\item {\tt EX} symbol, 7, 26, 60, 62, 69, 70, 105 |
266 |
\item {\tt Ex} constant, 7, 60, 105 |
|
3213 | 267 |
\item {\tt EX!} symbol, 7, 60 |
268 |
\item {\tt Ex1} constant, 7, 60 |
|
269 |
\item {\tt Ex1_def} theorem, 64 |
|
270 |
\item {\tt ex1_def} theorem, 8 |
|
271 |
\item {\tt ex1E} theorem, 9, 66 |
|
272 |
\item {\tt ex1I} theorem, 9, 66 |
|
273 |
\item {\tt Ex_def} theorem, 64 |
|
274 |
\item {\tt ex_impE} theorem, 9 |
|
275 |
\item {\tt exCI} theorem, 11, 15, 66 |
|
276 |
\item {\tt excluded_middle} theorem, 11, 66 |
|
277 |
\item {\tt exE} theorem, 8, 66 |
|
3962 | 278 |
\item {\tt exhaust_tac}, \bold{89} |
3213 | 279 |
\item {\tt exI} theorem, 8, 66 |
3962 | 280 |
\item {\tt exL} theorem, 107 |
281 |
\item {\tt Exp} theory, 100 |
|
282 |
\item {\tt expand_if} theorem, 66, 76 |
|
283 |
\item {\tt expand_split} theorem, 77 |
|
284 |
\item {\tt expand_sum_case} theorem, 79 |
|
285 |
\item {\tt exR} theorem, 107, 110, 112 |
|
286 |
\item {\tt exR_thin} theorem, 108, 112, 113 |
|
3213 | 287 |
\item {\tt ext} theorem, 63, 64 |
288 |
\item {\tt extension} theorem, 30 |
|
2665 | 289 |
|
290 |
\indexspace |
|
291 |
||
3962 | 292 |
\item {\tt F} constant, 117 |
293 |
\item {\tt False} constant, 7, 60, 105 |
|
3213 | 294 |
\item {\tt False_def} theorem, 64 |
295 |
\item {\tt FalseE} theorem, 8, 65 |
|
3962 | 296 |
\item {\tt FalseL} theorem, 107 |
297 |
\item {\tt fast_tac}, \bold{112} |
|
298 |
\item {\tt FE} theorem, 123, 127 |
|
299 |
\item {\tt FEL} theorem, 123 |
|
300 |
\item {\tt FF} theorem, 123 |
|
3213 | 301 |
\item {\tt field} constant, 25 |
302 |
\item {\tt field_def} theorem, 31 |
|
303 |
\item {\tt field_subset} theorem, 38 |
|
304 |
\item {\tt fieldCI} theorem, 38 |
|
305 |
\item {\tt fieldE} theorem, 38 |
|
306 |
\item {\tt fieldI1} theorem, 38 |
|
307 |
\item {\tt fieldI2} theorem, 38 |
|
3962 | 308 |
\item {\tt filseq_resolve_tac}, \bold{110} |
309 |
\item {\tt filt_resolve_tac}, 110, 125 |
|
310 |
\item {\tt filter} constant, 82 |
|
3213 | 311 |
\item {\tt Fin.consI} theorem, 48 |
312 |
\item {\tt Fin.emptyI} theorem, 48 |
|
313 |
\item {\tt Fin_induct} theorem, 48 |
|
314 |
\item {\tt Fin_mono} theorem, 48 |
|
315 |
\item {\tt Fin_subset} theorem, 48 |
|
316 |
\item {\tt Fin_UnI} theorem, 48 |
|
317 |
\item {\tt Fin_UnionI} theorem, 48 |
|
318 |
\item first-order logic, 5--22 |
|
319 |
\item {\tt Fixedpt} theory, 42 |
|
320 |
\item {\tt flat} constant, 49 |
|
321 |
\item {\tt flat_def} theorem, 49 |
|
3962 | 322 |
\item flex-flex constraints, 104 |
323 |
\item {\tt FOL} theory, 1, 5, 11, 126 |
|
3213 | 324 |
\item {\tt FOL_cs}, \bold{11} |
325 |
\item {\tt FOL_ss}, \bold{6} |
|
3962 | 326 |
\item {\tt foldl} constant, 82 |
327 |
\item {\tt form_rls}, \bold{124} |
|
328 |
\item {\tt formL_rls}, \bold{124} |
|
329 |
\item {\tt forms_of_seq}, \bold{109} |
|
3213 | 330 |
\item {\tt foundation} theorem, 30 |
3962 | 331 |
\item {\tt fst} constant, 25, 32, 77, 117, 122 |
332 |
\item {\tt fst_conv} theorem, 37, 77 |
|
333 |
\item {\tt fst_def} theorem, 31, 122 |
|
3213 | 334 |
\item {\tt Fun} theory, 75 |
3498 | 335 |
\item {\textit {fun}} type, 61 |
3213 | 336 |
\item {\tt fun_cong} theorem, 65 |
337 |
\item {\tt fun_disjoint_apply1} theorem, 40, 56 |
|
338 |
\item {\tt fun_disjoint_apply2} theorem, 40 |
|
339 |
\item {\tt fun_disjoint_Un} theorem, 40, 58 |
|
340 |
\item {\tt fun_empty} theorem, 40 |
|
341 |
\item {\tt fun_extension} theorem, 39, 40 |
|
342 |
\item {\tt fun_is_rel} theorem, 39 |
|
343 |
\item {\tt fun_single} theorem, 40 |
|
2665 | 344 |
\item function applications |
3962 | 345 |
\subitem in \CTT, 119 |
3213 | 346 |
\subitem in \ZF, 25 |
2665 | 347 |
|
348 |
\indexspace |
|
349 |
||
3213 | 350 |
\item {\tt gfp_def} theorem, 44 |
351 |
\item {\tt gfp_least} theorem, 44 |
|
352 |
\item {\tt gfp_mono} theorem, 44 |
|
353 |
\item {\tt gfp_subset} theorem, 44 |
|
354 |
\item {\tt gfp_Tarski} theorem, 44 |
|
355 |
\item {\tt gfp_upperbound} theorem, 44 |
|
356 |
\item {\tt goalw}, 18 |
|
2665 | 357 |
|
358 |
\indexspace |
|
359 |
||
4803
8428d4699d58
Clearer description of recdef, including use of {}
paulson
parents:
4503
diff
changeset
|
360 |
\item {\tt hd} constant, 82, 94 |
3962 | 361 |
\item higher-order logic, 59--103 |
3213 | 362 |
\item {\tt HOL} theory, 1, 59 |
363 |
\item {\sc hol} system, 59, 62 |
|
364 |
\item {\tt HOL_basic_ss}, \bold{75} |
|
365 |
\item {\tt HOL_cs}, \bold{76} |
|
366 |
\item {\tt HOL_quantifiers}, \bold{62}, 70 |
|
367 |
\item {\tt HOL_ss}, \bold{75} |
|
3096 | 368 |
\item {\tt HOLCF} theory, 1 |
3962 | 369 |
\item {\tt hyp_rew_tac}, \bold{126} |
3213 | 370 |
\item {\tt hyp_subst_tac}, 6, 75 |
2665 | 371 |
|
372 |
\indexspace |
|
373 |
||
3962 | 374 |
\item {\textit {i}} type, 24, 116 |
3213 | 375 |
\item {\tt id} constant, 45 |
376 |
\item {\tt id_def} theorem, 45 |
|
377 |
\item {\tt If} constant, 60 |
|
378 |
\item {\tt if} constant, 25 |
|
379 |
\item {\tt if_def} theorem, 17, 30, 64 |
|
380 |
\item {\tt if_not_P} theorem, 35, 66 |
|
381 |
\item {\tt if_P} theorem, 35, 66 |
|
382 |
\item {\tt ifE} theorem, 19 |
|
383 |
\item {\tt iff} theorem, 63, 64 |
|
3962 | 384 |
\item {\tt iff_def} theorem, 8, 107 |
3213 | 385 |
\item {\tt iff_impE} theorem, 9 |
386 |
\item {\tt iffCE} theorem, 11, 66, 70 |
|
387 |
\item {\tt iffD1} theorem, 9, 65 |
|
388 |
\item {\tt iffD2} theorem, 9, 65 |
|
389 |
\item {\tt iffE} theorem, 9, 65 |
|
390 |
\item {\tt iffI} theorem, 9, 19, 65 |
|
3962 | 391 |
\item {\tt iffL} theorem, 108, 114 |
392 |
\item {\tt iffR} theorem, 108 |
|
3213 | 393 |
\item {\tt ifI} theorem, 19 |
394 |
\item {\tt IFOL} theory, 5 |
|
395 |
\item {\tt IFOL_ss}, \bold{6} |
|
396 |
\item {\tt image_def} theorem, 31, 71 |
|
397 |
\item {\tt imageE} theorem, 38, 73 |
|
398 |
\item {\tt imageI} theorem, 38, 73 |
|
399 |
\item {\tt imp_impE} theorem, 9, 14 |
|
400 |
\item {\tt impCE} theorem, 11, 66 |
|
401 |
\item {\tt impE} theorem, 9, 10, 65 |
|
402 |
\item {\tt impI} theorem, 8, 63 |
|
3962 | 403 |
\item {\tt impL} theorem, 107 |
404 |
\item {\tt impR} theorem, 107 |
|
3213 | 405 |
\item {\tt in} symbol, 27, 61 |
3962 | 406 |
\item {\textit {ind}} type, 80 |
3213 | 407 |
\item {\tt induct} theorem, 44 |
4068 | 408 |
\item {\tt induct_tac}, 81, \bold{89} |
3962 | 409 |
\item {\tt inductive}, 96--99 |
3213 | 410 |
\item {\tt Inf} constant, 25, 29 |
411 |
\item {\tt infinity} theorem, 31 |
|
412 |
\item {\tt inj} constant, 45, 75 |
|
413 |
\item {\tt inj_converse_inj} theorem, 45 |
|
414 |
\item {\tt inj_def} theorem, 45, 75 |
|
3962 | 415 |
\item {\tt inj_Inl} theorem, 79 |
416 |
\item {\tt inj_Inr} theorem, 79 |
|
3213 | 417 |
\item {\tt inj_onto} constant, 75 |
418 |
\item {\tt inj_onto_def} theorem, 75 |
|
3962 | 419 |
\item {\tt inj_Suc} theorem, 79 |
420 |
\item {\tt Inl} constant, 43, 79 |
|
421 |
\item {\tt inl} constant, 117, 122, 132 |
|
3213 | 422 |
\item {\tt Inl_def} theorem, 43 |
423 |
\item {\tt Inl_inject} theorem, 43 |
|
424 |
\item {\tt Inl_neq_Inr} theorem, 43 |
|
3962 | 425 |
\item {\tt Inl_not_Inr} theorem, 79 |
426 |
\item {\tt Inr} constant, 43, 79 |
|
427 |
\item {\tt inr} constant, 117, 122 |
|
3213 | 428 |
\item {\tt Inr_def} theorem, 43 |
429 |
\item {\tt Inr_inject} theorem, 43 |
|
430 |
\item {\tt insert} constant, 68 |
|
431 |
\item {\tt insert_def} theorem, 71 |
|
432 |
\item {\tt insertE} theorem, 73 |
|
433 |
\item {\tt insertI1} theorem, 73 |
|
434 |
\item {\tt insertI2} theorem, 73 |
|
435 |
\item {\tt INT} symbol, 26, 28, 68--70 |
|
436 |
\item {\tt Int} symbol, 25, 68 |
|
437 |
\item {\tt Int_absorb} theorem, 41, 74 |
|
438 |
\item {\tt Int_assoc} theorem, 41, 74 |
|
439 |
\item {\tt Int_commute} theorem, 41, 74 |
|
440 |
\item {\tt INT_D} theorem, 73 |
|
441 |
\item {\tt Int_def} theorem, 30, 71 |
|
442 |
\item {\tt INT_E} theorem, 34, 73 |
|
443 |
\item {\tt Int_greatest} theorem, 36, 52, 54, 74 |
|
444 |
\item {\tt INT_I} theorem, 34, 73 |
|
445 |
\item {\tt Int_Inter_image} theorem, 74 |
|
446 |
\item {\tt Int_lower1} theorem, 36, 53, 74 |
|
447 |
\item {\tt Int_lower2} theorem, 36, 53, 74 |
|
448 |
\item {\tt Int_Un_distrib} theorem, 41, 74 |
|
449 |
\item {\tt Int_Union} theorem, 74 |
|
450 |
\item {\tt Int_Union_RepFun} theorem, 41 |
|
451 |
\item {\tt IntD1} theorem, 35, 73 |
|
452 |
\item {\tt IntD2} theorem, 35, 73 |
|
453 |
\item {\tt IntE} theorem, 35, 53, 73 |
|
454 |
\item {\tt INTER} constant, 68 |
|
455 |
\item {\tt Inter} constant, 25, 68 |
|
456 |
\item {\tt INTER1} constant, 68 |
|
457 |
\item {\tt INTER1_def} theorem, 71 |
|
458 |
\item {\tt INTER_def} theorem, 71 |
|
459 |
\item {\tt Inter_def} theorem, 30, 71 |
|
460 |
\item {\tt Inter_greatest} theorem, 36, 74 |
|
461 |
\item {\tt Inter_lower} theorem, 36, 74 |
|
462 |
\item {\tt Inter_Un_distrib} theorem, 41, 74 |
|
463 |
\item {\tt InterD} theorem, 34, 73 |
|
464 |
\item {\tt InterE} theorem, 34, 73 |
|
465 |
\item {\tt InterI} theorem, 32, 34, 73 |
|
466 |
\item {\tt IntI} theorem, 35, 73 |
|
467 |
\item {\tt IntPr.best_tac}, \bold{11} |
|
468 |
\item {\tt IntPr.fast_tac}, \bold{10}, 13 |
|
469 |
\item {\tt IntPr.inst_step_tac}, \bold{10} |
|
470 |
\item {\tt IntPr.safe_step_tac}, \bold{10} |
|
471 |
\item {\tt IntPr.safe_tac}, \bold{10} |
|
472 |
\item {\tt IntPr.step_tac}, \bold{10} |
|
3962 | 473 |
\item {\tt intr_rls}, \bold{124} |
474 |
\item {\tt intr_tac}, \bold{125}, 134, 135 |
|
475 |
\item {\tt intrL_rls}, \bold{124} |
|
3213 | 476 |
\item {\tt inv} constant, 75 |
477 |
\item {\tt inv_def} theorem, 75 |
|
2665 | 478 |
|
479 |
\indexspace |
|
480 |
||
3962 | 481 |
\item {\tt lam} symbol, 26, 28, 119 |
3213 | 482 |
\item {\tt lam_def} theorem, 31 |
483 |
\item {\tt lam_type} theorem, 39 |
|
3498 | 484 |
\item {\tt Lambda} constant, 25, 29 |
3962 | 485 |
\item {\tt lambda} constant, 117, 119 |
2665 | 486 |
\item $\lambda$-abstractions |
3962 | 487 |
\subitem in \CTT, 119 |
3213 | 488 |
\subitem in \ZF, 26 |
489 |
\item {\tt lamE} theorem, 39, 40 |
|
490 |
\item {\tt lamI} theorem, 39, 40 |
|
3962 | 491 |
\item {\tt last} constant, 82 |
3096 | 492 |
\item {\tt LCF} theory, 1 |
3213 | 493 |
\item {\tt le_cs}, \bold{23} |
3962 | 494 |
\item {\tt LEAST} constant, 61, 62, 80 |
3213 | 495 |
\item {\tt Least} constant, 60 |
496 |
\item {\tt Least_def} theorem, 64 |
|
497 |
\item {\tt left_comp_id} theorem, 45 |
|
498 |
\item {\tt left_comp_inverse} theorem, 45 |
|
499 |
\item {\tt left_inverse} theorem, 45 |
|
3962 | 500 |
\item {\tt length} constant, 49, 82 |
3213 | 501 |
\item {\tt length_def} theorem, 49 |
3962 | 502 |
\item {\tt less_induct} theorem, 81 |
3213 | 503 |
\item {\tt Let} constant, 24, 25, 60, 63 |
504 |
\item {\tt let} symbol, 27, 61, 63 |
|
505 |
\item {\tt Let_def} theorem, 24, 30, 63, 64 |
|
3962 | 506 |
\item {\tt LFilter} theory, 100 |
3213 | 507 |
\item {\tt lfp_def} theorem, 44 |
508 |
\item {\tt lfp_greatest} theorem, 44 |
|
509 |
\item {\tt lfp_lowerbound} theorem, 44 |
|
510 |
\item {\tt lfp_mono} theorem, 44 |
|
511 |
\item {\tt lfp_subset} theorem, 44 |
|
512 |
\item {\tt lfp_Tarski} theorem, 44 |
|
3962 | 513 |
\item {\tt List} theory, 81, 82 |
514 |
\item {\textit {list}} type, 100 |
|
515 |
\item {\textit{list}} type, 81 |
|
3213 | 516 |
\item {\tt list} constant, 49 |
517 |
\item {\tt List.induct} theorem, 49 |
|
518 |
\item {\tt list_case} constant, 49 |
|
519 |
\item {\tt list_mono} theorem, 49 |
|
520 |
\item {\tt list_rec} constant, 49 |
|
521 |
\item {\tt list_rec_Cons} theorem, 49 |
|
522 |
\item {\tt list_rec_def} theorem, 49 |
|
523 |
\item {\tt list_rec_Nil} theorem, 49 |
|
3962 | 524 |
\item {\tt LK} theory, 1, 104, 108 |
525 |
\item {\tt LK_dup_pack}, \bold{110}, 112 |
|
526 |
\item {\tt LK_pack}, \bold{110} |
|
527 |
\item {\tt LList} theory, 100 |
|
3213 | 528 |
\item {\tt logic} class, 5 |
2665 | 529 |
|
530 |
\indexspace |
|
531 |
||
3962 | 532 |
\item {\tt map} constant, 49, 82 |
3213 | 533 |
\item {\tt map_app_distrib} theorem, 49 |
534 |
\item {\tt map_compose} theorem, 49 |
|
535 |
\item {\tt map_def} theorem, 49 |
|
536 |
\item {\tt map_flat} theorem, 49 |
|
537 |
\item {\tt map_ident} theorem, 49 |
|
538 |
\item {\tt map_type} theorem, 49 |
|
3962 | 539 |
\item {\tt max} constant, 61, 80 |
540 |
\item {\tt mem} symbol, 82 |
|
3213 | 541 |
\item {\tt mem_asym} theorem, 35, 36 |
542 |
\item {\tt mem_Collect_eq} theorem, 70, 71 |
|
543 |
\item {\tt mem_irrefl} theorem, 35 |
|
3962 | 544 |
\item {\tt min} constant, 61, 80 |
3213 | 545 |
\item {\tt minus} class, 61 |
3962 | 546 |
\item {\tt mod} symbol, 47, 79, 128 |
547 |
\item {\tt mod_def} theorem, 47, 128 |
|
548 |
\item {\tt mod_geq} theorem, 80 |
|
549 |
\item {\tt mod_less} theorem, 80 |
|
3213 | 550 |
\item {\tt mod_quo_equality} theorem, 47 |
3096 | 551 |
\item {\tt Modal} theory, 1 |
3213 | 552 |
\item {\tt mono} constant, 61 |
553 |
\item {\tt mp} theorem, 8, 63 |
|
3962 | 554 |
\item {\tt mp_tac}, \bold{10}, \bold{126} |
3213 | 555 |
\item {\tt mult_0} theorem, 47 |
3962 | 556 |
\item {\tt mult_assoc} theorem, 47, 128 |
557 |
\item {\tt mult_commute} theorem, 47, 128 |
|
558 |
\item {\tt mult_def} theorem, 47, 128 |
|
3213 | 559 |
\item {\tt mult_succ} theorem, 47 |
560 |
\item {\tt mult_type} theorem, 47 |
|
3962 | 561 |
\item {\tt mult_typing} theorem, 128 |
562 |
\item {\tt multC0} theorem, 128 |
|
563 |
\item {\tt multC_succ} theorem, 128 |
|
2665 | 564 |
|
565 |
\indexspace |
|
566 |
||
3962 | 567 |
\item {\tt N} constant, 117 |
568 |
\item {\tt n_not_Suc_n} theorem, 79 |
|
569 |
\item {\tt Nat} theory, 46, 80 |
|
4068 | 570 |
\item {\textit {nat}} type, 79, 80, 89 |
3962 | 571 |
\item {\textit{nat}} type, 80--81 |
3213 | 572 |
\item {\tt nat} constant, 47 |
573 |
\item {\tt nat_0I} theorem, 47 |
|
574 |
\item {\tt nat_case} constant, 47 |
|
575 |
\item {\tt nat_case_0} theorem, 47 |
|
576 |
\item {\tt nat_case_def} theorem, 47 |
|
577 |
\item {\tt nat_case_succ} theorem, 47 |
|
578 |
\item {\tt nat_def} theorem, 47 |
|
3962 | 579 |
\item {\tt nat_induct} theorem, 47, 79 |
580 |
\item {\tt nat_rec} constant, 81 |
|
3213 | 581 |
\item {\tt nat_succI} theorem, 47 |
3962 | 582 |
\item {\tt NatDef} theory, 80 |
583 |
\item {\tt NC0} theorem, 121 |
|
584 |
\item {\tt NC_succ} theorem, 121 |
|
585 |
\item {\tt NE} theorem, 120, 121, 129 |
|
586 |
\item {\tt NEL} theorem, 121 |
|
587 |
\item {\tt NF} theorem, 121, 130 |
|
588 |
\item {\tt NI0} theorem, 121 |
|
589 |
\item {\tt NI_succ} theorem, 121 |
|
590 |
\item {\tt NI_succL} theorem, 121 |
|
3213 | 591 |
\item {\tt Nil_Cons_iff} theorem, 49 |
592 |
\item {\tt NilI} theorem, 49 |
|
3962 | 593 |
\item {\tt NIO} theorem, 129 |
594 |
\item {\tt Not} constant, 7, 60, 105 |
|
3213 | 595 |
\item {\tt not_def} theorem, 8, 42, 64 |
596 |
\item {\tt not_impE} theorem, 9 |
|
597 |
\item {\tt not_sym} theorem, 65 |
|
598 |
\item {\tt notE} theorem, 9, 10, 65 |
|
599 |
\item {\tt notI} theorem, 9, 65 |
|
3962 | 600 |
\item {\tt notL} theorem, 107 |
3213 | 601 |
\item {\tt notnotD} theorem, 11, 66 |
3962 | 602 |
\item {\tt notR} theorem, 107 |
603 |
\item {\tt null} constant, 82 |
|
2665 | 604 |
|
605 |
\indexspace |
|
606 |
||
3213 | 607 |
\item {\tt O} symbol, 45 |
3962 | 608 |
\item {\textit {o}} type, 5, 104 |
3213 | 609 |
\item {\tt o} symbol, 60, 71 |
610 |
\item {\tt o_def} theorem, 64 |
|
611 |
\item {\tt of} symbol, 63 |
|
612 |
\item {\tt or_def} theorem, 42, 64 |
|
613 |
\item {\tt Ord} theory, 61 |
|
3962 | 614 |
\item {\tt ord} class, 61, 62, 80 |
615 |
\item {\tt order} class, 61, 80 |
|
2665 | 616 |
|
617 |
\indexspace |
|
618 |
||
3962 | 619 |
\item {\tt pack} ML type, 110 |
620 |
\item {\tt Pair} constant, 25, 26, 77 |
|
621 |
\item {\tt pair} constant, 117 |
|
3213 | 622 |
\item {\tt Pair_def} theorem, 31 |
3962 | 623 |
\item {\tt Pair_eq} theorem, 77 |
624 |
\item {\tt Pair_inject} theorem, 37, 77 |
|
3213 | 625 |
\item {\tt Pair_inject1} theorem, 37 |
626 |
\item {\tt Pair_inject2} theorem, 37 |
|
627 |
\item {\tt Pair_neq_0} theorem, 37 |
|
3962 | 628 |
\item {\tt PairE} theorem, 77 |
3213 | 629 |
\item {\tt pairing} theorem, 34 |
3962 | 630 |
\item {\tt pc_tac}, \bold{111}, \bold{127}, 133, 134 |
3213 | 631 |
\item {\tt Perm} theory, 42 |
632 |
\item {\tt Pi} constant, 25, 28, 40 |
|
633 |
\item {\tt Pi_def} theorem, 31 |
|
634 |
\item {\tt Pi_type} theorem, 39, 40 |
|
635 |
\item {\tt plus} class, 61 |
|
3962 | 636 |
\item {\tt PlusC_inl} theorem, 123 |
637 |
\item {\tt PlusC_inr} theorem, 123 |
|
638 |
\item {\tt PlusE} theorem, 123, 127, 131 |
|
639 |
\item {\tt PlusEL} theorem, 123 |
|
640 |
\item {\tt PlusF} theorem, 123 |
|
641 |
\item {\tt PlusFL} theorem, 123 |
|
642 |
\item {\tt PlusI_inl} theorem, 123, 132 |
|
643 |
\item {\tt PlusI_inlL} theorem, 123 |
|
644 |
\item {\tt PlusI_inr} theorem, 123 |
|
645 |
\item {\tt PlusI_inrL} theorem, 123 |
|
3213 | 646 |
\item {\tt Pow} constant, 25, 68 |
647 |
\item {\tt Pow_def} theorem, 71 |
|
648 |
\item {\tt Pow_iff} theorem, 30 |
|
649 |
\item {\tt Pow_mono} theorem, 52 |
|
650 |
\item {\tt PowD} theorem, 33, 53, 73 |
|
651 |
\item {\tt PowI} theorem, 33, 53, 73 |
|
3962 | 652 |
\item {\tt primrec}, 92--93 |
653 |
\item {\tt primrec} symbol, 80 |
|
3213 | 654 |
\item {\tt PrimReplace} constant, 25, 29 |
2665 | 655 |
\item priorities, 2 |
3962 | 656 |
\item {\tt PROD} symbol, 26, 28, 118, 119 |
657 |
\item {\tt Prod} constant, 117 |
|
3213 | 658 |
\item {\tt Prod} theory, 76 |
3962 | 659 |
\item {\tt ProdC} theorem, 121, 137 |
660 |
\item {\tt ProdC2} theorem, 121 |
|
661 |
\item {\tt ProdE} theorem, 121, 134, 136, 138 |
|
662 |
\item {\tt ProdEL} theorem, 121 |
|
663 |
\item {\tt ProdF} theorem, 121 |
|
664 |
\item {\tt ProdFL} theorem, 121 |
|
665 |
\item {\tt ProdI} theorem, 121, 127, 129 |
|
666 |
\item {\tt ProdIL} theorem, 121 |
|
3213 | 667 |
\item {\tt prop_cs}, \bold{11}, \bold{76} |
3962 | 668 |
\item {\tt prop_pack}, \bold{110} |
2665 | 669 |
|
670 |
\indexspace |
|
671 |
||
3213 | 672 |
\item {\tt qcase_def} theorem, 43 |
673 |
\item {\tt qconverse} constant, 42 |
|
674 |
\item {\tt qconverse_def} theorem, 43 |
|
4068 | 675 |
\item {\tt qed_spec_mp}, 90 |
3213 | 676 |
\item {\tt qfsplit_def} theorem, 43 |
677 |
\item {\tt QInl_def} theorem, 43 |
|
678 |
\item {\tt QInr_def} theorem, 43 |
|
679 |
\item {\tt QPair} theory, 42 |
|
680 |
\item {\tt QPair_def} theorem, 43 |
|
681 |
\item {\tt QSigma} constant, 42 |
|
682 |
\item {\tt QSigma_def} theorem, 43 |
|
683 |
\item {\tt qsplit} constant, 42 |
|
684 |
\item {\tt qsplit_def} theorem, 43 |
|
685 |
\item {\tt qsum_def} theorem, 43 |
|
686 |
\item {\tt QUniv} theory, 46 |
|
2665 | 687 |
|
688 |
\indexspace |
|
689 |
||
3962 | 690 |
\item {\tt range} constant, 25, 68, 101 |
3213 | 691 |
\item {\tt range_def} theorem, 31, 71 |
692 |
\item {\tt range_of_fun} theorem, 39, 40 |
|
693 |
\item {\tt range_subset} theorem, 38 |
|
694 |
\item {\tt range_type} theorem, 39 |
|
4068 | 695 |
\item {\tt rangeE} theorem, 38, 73, 102 |
3213 | 696 |
\item {\tt rangeI} theorem, 38, 73 |
697 |
\item {\tt rank} constant, 48 |
|
698 |
\item {\tt rank_ss}, \bold{23} |
|
3962 | 699 |
\item {\tt rec} constant, 47, 117, 120 |
3213 | 700 |
\item {\tt rec_0} theorem, 47 |
701 |
\item {\tt rec_def} theorem, 47 |
|
702 |
\item {\tt rec_succ} theorem, 47 |
|
3962 | 703 |
\item {\tt recdef}, 93--96 |
3498 | 704 |
\item recursion |
3962 | 705 |
\subitem general, 93--96 |
706 |
\subitem primitive, 92--93 |
|
707 |
\item recursive functions, \see{recursion}{91} |
|
708 |
\item {\tt red_if_equal} theorem, 120 |
|
709 |
\item {\tt Reduce} constant, 117, 120, 126 |
|
710 |
\item {\tt refl} theorem, 8, 63, 107 |
|
711 |
\item {\tt refl_elem} theorem, 120, 124 |
|
712 |
\item {\tt refl_red} theorem, 120 |
|
713 |
\item {\tt refl_type} theorem, 120, 124 |
|
714 |
\item {\tt REPEAT_FIRST}, 125 |
|
715 |
\item {\tt repeat_goal_tac}, \bold{111} |
|
3213 | 716 |
\item {\tt RepFun} constant, 25, 28, 29, 32 |
717 |
\item {\tt RepFun_def} theorem, 30 |
|
718 |
\item {\tt RepFunE} theorem, 34 |
|
719 |
\item {\tt RepFunI} theorem, 34 |
|
720 |
\item {\tt Replace} constant, 25, 28, 29, 32 |
|
721 |
\item {\tt Replace_def} theorem, 30 |
|
3962 | 722 |
\item {\tt replace_type} theorem, 124, 136 |
3213 | 723 |
\item {\tt ReplaceE} theorem, 34 |
724 |
\item {\tt ReplaceI} theorem, 34 |
|
725 |
\item {\tt replacement} theorem, 30 |
|
3962 | 726 |
\item {\tt reresolve_tac}, \bold{111} |
3213 | 727 |
\item {\tt res_inst_tac}, 62 |
728 |
\item {\tt restrict} constant, 25, 32 |
|
729 |
\item {\tt restrict} theorem, 39 |
|
730 |
\item {\tt restrict_bij} theorem, 45 |
|
731 |
\item {\tt restrict_def} theorem, 31 |
|
732 |
\item {\tt restrict_type} theorem, 39 |
|
3962 | 733 |
\item {\tt rev} constant, 49, 82 |
3213 | 734 |
\item {\tt rev_def} theorem, 49 |
3962 | 735 |
\item {\tt rew_tac}, 18, \bold{126} |
3213 | 736 |
\item {\tt rewrite_rule}, 19 |
737 |
\item {\tt right_comp_id} theorem, 45 |
|
738 |
\item {\tt right_comp_inverse} theorem, 45 |
|
739 |
\item {\tt right_inverse} theorem, 45 |
|
3962 | 740 |
\item {\tt RL}, 131 |
741 |
\item {\tt RS}, 136, 138 |
|
2665 | 742 |
|
743 |
\indexspace |
|
744 |
||
3962 | 745 |
\item {\tt safe_goal_tac}, \bold{112} |
746 |
\item {\tt safe_tac}, \bold{127} |
|
747 |
\item {\tt safestep_tac}, \bold{127} |
|
2665 | 748 |
\item search |
3962 | 749 |
\subitem best-first, 103 |
3213 | 750 |
\item {\tt select_equality} theorem, 64, 66 |
751 |
\item {\tt selectI} theorem, 63, 64 |
|
752 |
\item {\tt separation} theorem, 34 |
|
3962 | 753 |
\item {\tt Seqof} constant, 105 |
754 |
\item sequent calculus, 104--115 |
|
3213 | 755 |
\item {\tt Set} theory, 67, 70 |
3962 | 756 |
\item {\tt set} constant, 82 |
3213 | 757 |
\item {\tt set} type, 67 |
758 |
\item set theory, 23--58 |
|
3962 | 759 |
\item {\tt set_current_thy}, 103 |
3213 | 760 |
\item {\tt set_diff_def} theorem, 71 |
761 |
\item {\tt show_sorts}, 62 |
|
762 |
\item {\tt show_types}, 62 |
|
3962 | 763 |
\item {\tt Sigma} constant, 25, 28, 29, 37, 77 |
764 |
\item {\tt Sigma_def} theorem, 31, 77 |
|
765 |
\item {\tt SigmaE} theorem, 37, 77 |
|
3213 | 766 |
\item {\tt SigmaE2} theorem, 37 |
3962 | 767 |
\item {\tt SigmaI} theorem, 37, 77 |
2665 | 768 |
\item simplification |
3213 | 769 |
\subitem of conjunctions, 6, 75 |
770 |
\item {\tt singletonE} theorem, 35 |
|
771 |
\item {\tt singletonI} theorem, 35 |
|
4068 | 772 |
\item {\tt size} constant, 88 |
3962 | 773 |
\item {\tt snd} constant, 25, 32, 77, 117, 122 |
774 |
\item {\tt snd_conv} theorem, 37, 77 |
|
775 |
\item {\tt snd_def} theorem, 31, 122 |
|
776 |
\item {\tt sobj} type, 106 |
|
3213 | 777 |
\item {\tt spec} theorem, 8, 66 |
3962 | 778 |
\item {\tt split} constant, 25, 32, 77, 117, 131 |
779 |
\item {\tt split} theorem, 37, 77 |
|
4068 | 780 |
\item {\tt split_$t$_case} theorem, 87 |
3962 | 781 |
\item {\tt split_all_tac}, \bold{78} |
3213 | 782 |
\item {\tt split_def} theorem, 31 |
4068 | 783 |
\item {\tt split_list_case} theorem, 81 |
3213 | 784 |
\item {\tt ssubst} theorem, 9, 65, 67 |
785 |
\item {\tt stac}, \bold{75} |
|
786 |
\item {\tt Step_tac}, 22 |
|
3962 | 787 |
\item {\tt step_tac}, 22, \bold{112}, \bold{127} |
3213 | 788 |
\item {\tt strip_tac}, \bold{67} |
789 |
\item {\tt subset_def} theorem, 30, 71 |
|
790 |
\item {\tt subset_refl} theorem, 33, 72 |
|
791 |
\item {\tt subset_trans} theorem, 33, 72 |
|
792 |
\item {\tt subsetCE} theorem, 33, 70, 72 |
|
793 |
\item {\tt subsetD} theorem, 33, 55, 70, 72 |
|
794 |
\item {\tt subsetI} theorem, 33, 53, 54, 72 |
|
795 |
\item {\tt subst} theorem, 8, 63 |
|
3962 | 796 |
\item {\tt subst_elem} theorem, 120 |
797 |
\item {\tt subst_elemL} theorem, 120 |
|
798 |
\item {\tt subst_eqtyparg} theorem, 124, 136 |
|
799 |
\item {\tt subst_prodE} theorem, 122, 124 |
|
800 |
\item {\tt subst_type} theorem, 120 |
|
801 |
\item {\tt subst_typeL} theorem, 120 |
|
802 |
\item {\tt Suc} constant, 79 |
|
803 |
\item {\tt Suc_not_Zero} theorem, 79 |
|
804 |
\item {\tt succ} constant, 25, 29, 117 |
|
3213 | 805 |
\item {\tt succ_def} theorem, 31 |
806 |
\item {\tt succ_inject} theorem, 35 |
|
807 |
\item {\tt succ_neq_0} theorem, 35 |
|
808 |
\item {\tt succCI} theorem, 35 |
|
809 |
\item {\tt succE} theorem, 35 |
|
810 |
\item {\tt succI1} theorem, 35 |
|
811 |
\item {\tt succI2} theorem, 35 |
|
3962 | 812 |
\item {\tt SUM} symbol, 26, 28, 118, 119 |
813 |
\item {\tt Sum} constant, 117 |
|
814 |
\item {\tt Sum} theory, 42, 78 |
|
815 |
\item {\tt sum_case} constant, 79 |
|
816 |
\item {\tt sum_case_Inl} theorem, 79 |
|
817 |
\item {\tt sum_case_Inr} theorem, 79 |
|
3213 | 818 |
\item {\tt sum_def} theorem, 43 |
819 |
\item {\tt sum_InlI} theorem, 43 |
|
820 |
\item {\tt sum_InrI} theorem, 43 |
|
821 |
\item {\tt SUM_Int_distrib1} theorem, 41 |
|
822 |
\item {\tt SUM_Int_distrib2} theorem, 41 |
|
823 |
\item {\tt SUM_Un_distrib1} theorem, 41 |
|
824 |
\item {\tt SUM_Un_distrib2} theorem, 41 |
|
3962 | 825 |
\item {\tt SumC} theorem, 122 |
826 |
\item {\tt SumE} theorem, 122, 127, 131 |
|
827 |
\item {\tt sumE} theorem, 79 |
|
3213 | 828 |
\item {\tt sumE2} theorem, 43 |
3962 | 829 |
\item {\tt SumE_fst} theorem, 122, 124, 136, 137 |
830 |
\item {\tt SumE_snd} theorem, 122, 124, 138 |
|
831 |
\item {\tt SumEL} theorem, 122 |
|
832 |
\item {\tt SumF} theorem, 122 |
|
833 |
\item {\tt SumFL} theorem, 122 |
|
834 |
\item {\tt SumI} theorem, 122, 132 |
|
835 |
\item {\tt SumIL} theorem, 122 |
|
836 |
\item {\tt SumIL2} theorem, 124 |
|
3213 | 837 |
\item {\tt surj} constant, 45, 71, 75 |
838 |
\item {\tt surj_def} theorem, 45, 75 |
|
3962 | 839 |
\item {\tt surjective_pairing} theorem, 77 |
840 |
\item {\tt surjective_sum} theorem, 79 |
|
3213 | 841 |
\item {\tt swap} theorem, 11, 66 |
4068 | 842 |
\item {\tt swap_res_tac}, 16, 103 |
3962 | 843 |
\item {\tt sym} theorem, 9, 65, 107 |
844 |
\item {\tt sym_elem} theorem, 120 |
|
845 |
\item {\tt sym_type} theorem, 120 |
|
846 |
\item {\tt symL} theorem, 108 |
|
2665 | 847 |
|
848 |
\indexspace |
|
849 |
||
3962 | 850 |
\item {\tt T} constant, 117 |
851 |
\item {\textit {t}} type, 116 |
|
852 |
\item {\tt take} constant, 82 |
|
853 |
\item {\tt takeWhile} constant, 82 |
|
854 |
\item {\tt TC} theorem, 123 |
|
855 |
\item {\tt TE} theorem, 123 |
|
856 |
\item {\tt TEL} theorem, 123 |
|
857 |
\item {\tt term} class, 5, 61, 104 |
|
858 |
\item {\tt test_assume_tac}, \bold{125} |
|
859 |
\item {\tt TF} theorem, 123 |
|
860 |
\item {\tt THE} symbol, 26, 28, 36, 105 |
|
861 |
\item {\tt The} constant, 25, 28, 29, 105 |
|
862 |
\item {\tt The} theorem, 107 |
|
3213 | 863 |
\item {\tt the_def} theorem, 30 |
864 |
\item {\tt the_equality} theorem, 35, 36 |
|
865 |
\item {\tt theI} theorem, 35, 36 |
|
3962 | 866 |
\item {\tt thinL} theorem, 107 |
867 |
\item {\tt thinR} theorem, 107 |
|
868 |
\item {\tt TI} theorem, 123 |
|
3213 | 869 |
\item {\tt times} class, 61 |
3962 | 870 |
\item {\tt tl} constant, 82 |
2665 | 871 |
\item tracing |
3213 | 872 |
\subitem of unification, 62 |
3962 | 873 |
\item {\tt trans} theorem, 9, 65, 107 |
874 |
\item {\tt trans_elem} theorem, 120 |
|
875 |
\item {\tt trans_red} theorem, 120 |
|
876 |
\item {\tt trans_tac}, 81 |
|
877 |
\item {\tt trans_type} theorem, 120 |
|
878 |
\item {\tt True} constant, 7, 60, 105 |
|
879 |
\item {\tt True_def} theorem, 8, 64, 107 |
|
3213 | 880 |
\item {\tt True_or_False} theorem, 63, 64 |
881 |
\item {\tt TrueI} theorem, 9, 65 |
|
3962 | 882 |
\item {\tt Trueprop} constant, 7, 60, 105 |
883 |
\item {\tt TrueR} theorem, 108 |
|
884 |
\item {\tt tt} constant, 117 |
|
885 |
\item {\tt Type} constant, 117 |
|
886 |
\item type definition, \bold{84} |
|
887 |
\item {\tt typechk_tac}, \bold{125}, 130, 133, 137, 138 |
|
888 |
\item {\tt typedef}, 81 |
|
2665 | 889 |
|
890 |
\indexspace |
|
891 |
||
3213 | 892 |
\item {\tt UN} symbol, 26, 28, 68--70 |
893 |
\item {\tt Un} symbol, 25, 68 |
|
894 |
\item {\tt Un1} theorem, 70 |
|
895 |
\item {\tt Un2} theorem, 70 |
|
896 |
\item {\tt Un_absorb} theorem, 41, 74 |
|
897 |
\item {\tt Un_assoc} theorem, 41, 74 |
|
898 |
\item {\tt Un_commute} theorem, 41, 74 |
|
899 |
\item {\tt Un_def} theorem, 30, 71 |
|
900 |
\item {\tt UN_E} theorem, 34, 73 |
|
901 |
\item {\tt UN_I} theorem, 34, 73 |
|
902 |
\item {\tt Un_Int_distrib} theorem, 41, 74 |
|
903 |
\item {\tt Un_Inter} theorem, 74 |
|
904 |
\item {\tt Un_Inter_RepFun} theorem, 41 |
|
905 |
\item {\tt Un_least} theorem, 36, 74 |
|
906 |
\item {\tt Un_Union_image} theorem, 74 |
|
907 |
\item {\tt Un_upper1} theorem, 36, 74 |
|
908 |
\item {\tt Un_upper2} theorem, 36, 74 |
|
909 |
\item {\tt UnCI} theorem, 35, 36, 70, 73 |
|
910 |
\item {\tt UnE} theorem, 35, 73 |
|
911 |
\item {\tt UnI1} theorem, 35, 36, 57, 73 |
|
912 |
\item {\tt UnI2} theorem, 35, 36, 73 |
|
2665 | 913 |
\item unification |
3213 | 914 |
\subitem incompleteness of, 62 |
915 |
\item {\tt Unify.trace_types}, 62 |
|
916 |
\item {\tt UNION} constant, 68 |
|
917 |
\item {\tt Union} constant, 25, 68 |
|
918 |
\item {\tt UNION1} constant, 68 |
|
919 |
\item {\tt UNION1_def} theorem, 71 |
|
920 |
\item {\tt UNION_def} theorem, 71 |
|
921 |
\item {\tt Union_def} theorem, 71 |
|
922 |
\item {\tt Union_iff} theorem, 30 |
|
923 |
\item {\tt Union_least} theorem, 36, 74 |
|
924 |
\item {\tt Union_Un_distrib} theorem, 41, 74 |
|
925 |
\item {\tt Union_upper} theorem, 36, 74 |
|
926 |
\item {\tt UnionE} theorem, 34, 55, 73 |
|
927 |
\item {\tt UnionI} theorem, 34, 55, 73 |
|
3962 | 928 |
\item {\tt unit_eq} theorem, 78 |
3213 | 929 |
\item {\tt Univ} theory, 46 |
930 |
\item {\tt Upair} constant, 24, 25, 29 |
|
931 |
\item {\tt Upair_def} theorem, 30 |
|
932 |
\item {\tt UpairE} theorem, 34 |
|
933 |
\item {\tt UpairI1} theorem, 34 |
|
934 |
\item {\tt UpairI2} theorem, 34 |
|
2665 | 935 |
|
936 |
\indexspace |
|
937 |
||
3213 | 938 |
\item {\tt vimage_def} theorem, 31 |
939 |
\item {\tt vimageE} theorem, 38 |
|
940 |
\item {\tt vimageI} theorem, 38 |
|
2665 | 941 |
|
942 |
\indexspace |
|
943 |
||
3962 | 944 |
\item {\tt when} constant, 117, 122, 131 |
2665 | 945 |
|
946 |
\indexspace |
|
947 |
||
3213 | 948 |
\item {\tt xor_def} theorem, 42 |
2665 | 949 |
|
950 |
\indexspace |
|
951 |
||
3962 | 952 |
\item {\tt zero_ne_succ} theorem, 120, 121 |
3213 | 953 |
\item {\tt ZF} theory, 1, 23, 59 |
954 |
\item {\tt ZF_cs}, \bold{23} |
|
955 |
\item {\tt ZF_ss}, \bold{23} |
|
2665 | 956 |
|
957 |
\end{theindex} |