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