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