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