*** empty log message ***
authorwenzelm
Wed Jan 27 17:11:12 1999 +0100 (1999-01-27)
changeset 61560d52e7cbff29
parent 6155 e387d188d0ca
child 6157 29942d3a1818
*** empty log message ***
doc-src/ZF/logics-ZF.ind
doc-src/ZF/logics-ZF.rao
     1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/doc-src/ZF/logics-ZF.ind	Wed Jan 27 17:11:12 1999 +0100
     1.3 @@ -0,0 +1,582 @@
     1.4 +\begin{theindex}
     1.5 +
     1.6 +  \item {\tt\#*} symbol, 45
     1.7 +  \item {\tt\#+} symbol, 45
     1.8 +  \item {\tt\#-} symbol, 45
     1.9 +  \item {\tt\&} symbol, 5
    1.10 +  \item {\tt *} symbol, 25
    1.11 +  \item {\tt +} symbol, 41
    1.12 +  \item {\tt -} symbol, 24
    1.13 +  \item {\tt -->} symbol, 5
    1.14 +  \item {\tt ->} symbol, 25
    1.15 +  \item {\tt -``} symbol, 24
    1.16 +  \item {\tt :} symbol, 24
    1.17 +  \item {\tt <->} symbol, 5
    1.18 +  \item {\tt <=} symbol, 24
    1.19 +  \item {\tt =} symbol, 5
    1.20 +  \item {\tt `} symbol, 24
    1.21 +  \item {\tt ``} symbol, 24
    1.22 +  \item {\tt |} symbol, 5
    1.23 +
    1.24 +  \indexspace
    1.25 +
    1.26 +  \item {\tt 0} constant, 24
    1.27 +
    1.28 +  \indexspace
    1.29 +
    1.30 +  \item {\tt add_0} theorem, 45
    1.31 +  \item {\tt add_mult_dist} theorem, 45
    1.32 +  \item {\tt add_succ} theorem, 45
    1.33 +  \item {\tt ALL} symbol, 5, 25
    1.34 +  \item {\tt All} constant, 5
    1.35 +  \item {\tt all_dupE} theorem, 3, 7
    1.36 +  \item {\tt all_impE} theorem, 7
    1.37 +  \item {\tt allE} theorem, 3, 7
    1.38 +  \item {\tt allI} theorem, 6
    1.39 +  \item {\tt and_def} theorem, 41
    1.40 +  \item {\tt apply_def} theorem, 29
    1.41 +  \item {\tt apply_equality} theorem, 38, 39, 69
    1.42 +  \item {\tt apply_equality2} theorem, 38
    1.43 +  \item {\tt apply_iff} theorem, 38
    1.44 +  \item {\tt apply_Pair} theorem, 38, 69
    1.45 +  \item {\tt apply_type} theorem, 38
    1.46 +  \item {\tt Arith} theory, 42
    1.47 +  \item assumptions
    1.48 +    \subitem contradictory, 14
    1.49 +
    1.50 +  \indexspace
    1.51 +
    1.52 +  \item {\tt Ball} constant, 24, 27
    1.53 +  \item {\tt ball_cong} theorem, 31, 32
    1.54 +  \item {\tt Ball_def} theorem, 28
    1.55 +  \item {\tt ballE} theorem, 31, 32
    1.56 +  \item {\tt ballI} theorem, 31
    1.57 +  \item {\tt beta} theorem, 38, 39
    1.58 +  \item {\tt Bex} constant, 24, 27
    1.59 +  \item {\tt bex_cong} theorem, 31, 32
    1.60 +  \item {\tt Bex_def} theorem, 28
    1.61 +  \item {\tt bexCI} theorem, 31
    1.62 +  \item {\tt bexE} theorem, 31
    1.63 +  \item {\tt bexI} theorem, 31
    1.64 +  \item {\tt bij} constant, 44
    1.65 +  \item {\tt bij_converse_bij} theorem, 44
    1.66 +  \item {\tt bij_def} theorem, 44
    1.67 +  \item {\tt bij_disjoint_Un} theorem, 44
    1.68 +  \item {\tt Blast_tac}, 15, 67, 68
    1.69 +  \item {\tt blast_tac}, 16, 17, 19
    1.70 +  \item {\tt bnd_mono_def} theorem, 43
    1.71 +  \item {\tt Bool} theory, 39
    1.72 +  \item {\tt bool_0I} theorem, 41
    1.73 +  \item {\tt bool_1I} theorem, 41
    1.74 +  \item {\tt bool_def} theorem, 41
    1.75 +  \item {\tt boolE} theorem, 41
    1.76 +  \item {\tt bspec} theorem, 31
    1.77 +
    1.78 +  \indexspace
    1.79 +
    1.80 +  \item {\tt case} constant, 41
    1.81 +  \item {\tt case_def} theorem, 41
    1.82 +  \item {\tt case_Inl} theorem, 41
    1.83 +  \item {\tt case_Inr} theorem, 41
    1.84 +  \item {\tt coinduct} theorem, 43
    1.85 +  \item {\tt coinductive}, 57--62
    1.86 +  \item {\tt Collect} constant, 24, 25, 30
    1.87 +  \item {\tt Collect_def} theorem, 28
    1.88 +  \item {\tt Collect_subset} theorem, 35
    1.89 +  \item {\tt CollectD1} theorem, 32, 33
    1.90 +  \item {\tt CollectD2} theorem, 32, 33
    1.91 +  \item {\tt CollectE} theorem, 32, 33
    1.92 +  \item {\tt CollectI} theorem, 33
    1.93 +  \item {\tt comp_assoc} theorem, 44
    1.94 +  \item {\tt comp_bij} theorem, 44
    1.95 +  \item {\tt comp_def} theorem, 44
    1.96 +  \item {\tt comp_func} theorem, 44
    1.97 +  \item {\tt comp_func_apply} theorem, 44
    1.98 +  \item {\tt comp_inj} theorem, 44
    1.99 +  \item {\tt comp_surj} theorem, 44
   1.100 +  \item {\tt comp_type} theorem, 44
   1.101 +  \item {\tt cond_0} theorem, 41
   1.102 +  \item {\tt cond_1} theorem, 41
   1.103 +  \item {\tt cond_def} theorem, 41
   1.104 +  \item congruence rules, 32
   1.105 +  \item {\tt conj_cong}, 4
   1.106 +  \item {\tt conj_impE} theorem, 7, 8
   1.107 +  \item {\tt conjE} theorem, 7
   1.108 +  \item {\tt conjI} theorem, 6
   1.109 +  \item {\tt conjunct1} theorem, 6
   1.110 +  \item {\tt conjunct2} theorem, 6
   1.111 +  \item {\tt cons} constant, 23, 24
   1.112 +  \item {\tt cons_def} theorem, 29
   1.113 +  \item {\tt Cons_iff} theorem, 47
   1.114 +  \item {\tt consCI} theorem, 34
   1.115 +  \item {\tt consE} theorem, 34
   1.116 +  \item {\tt ConsI} theorem, 47
   1.117 +  \item {\tt consI1} theorem, 34
   1.118 +  \item {\tt consI2} theorem, 34
   1.119 +  \item {\tt converse} constant, 24, 37
   1.120 +  \item {\tt converse_def} theorem, 29
   1.121 +  \item {\tt cut_facts_tac}, 17
   1.122 +
   1.123 +  \indexspace
   1.124 +
   1.125 +  \item {\tt datatype}, 48--55
   1.126 +  \item {\tt Diff_cancel} theorem, 40
   1.127 +  \item {\tt Diff_contains} theorem, 35
   1.128 +  \item {\tt Diff_def} theorem, 28
   1.129 +  \item {\tt Diff_disjoint} theorem, 40
   1.130 +  \item {\tt Diff_Int} theorem, 40
   1.131 +  \item {\tt Diff_partition} theorem, 40
   1.132 +  \item {\tt Diff_subset} theorem, 35
   1.133 +  \item {\tt Diff_Un} theorem, 40
   1.134 +  \item {\tt DiffD1} theorem, 34
   1.135 +  \item {\tt DiffD2} theorem, 34
   1.136 +  \item {\tt DiffE} theorem, 34
   1.137 +  \item {\tt DiffI} theorem, 34
   1.138 +  \item {\tt disj_impE} theorem, 7, 8, 12
   1.139 +  \item {\tt disjCI} theorem, 9
   1.140 +  \item {\tt disjE} theorem, 6
   1.141 +  \item {\tt disjI1} theorem, 6
   1.142 +  \item {\tt disjI2} theorem, 6
   1.143 +  \item {\tt div} symbol, 45
   1.144 +  \item {\tt div_def} theorem, 45
   1.145 +  \item {\tt domain} constant, 24, 37
   1.146 +  \item {\tt domain_def} theorem, 29
   1.147 +  \item {\tt domain_of_fun} theorem, 38
   1.148 +  \item {\tt domain_subset} theorem, 37
   1.149 +  \item {\tt domain_type} theorem, 38
   1.150 +  \item {\tt domainE} theorem, 37
   1.151 +  \item {\tt domainI} theorem, 37
   1.152 +  \item {\tt double_complement} theorem, 40
   1.153 +  \item {\tt dresolve_tac}, 66
   1.154 +
   1.155 +  \indexspace
   1.156 +
   1.157 +  \item {\tt empty_subsetI} theorem, 31
   1.158 +  \item {\tt emptyE} theorem, 31
   1.159 +  \item {\tt eq_mp_tac}, \bold{8}
   1.160 +  \item {\tt equalityD1} theorem, 31
   1.161 +  \item {\tt equalityD2} theorem, 31
   1.162 +  \item {\tt equalityE} theorem, 31
   1.163 +  \item {\tt equalityI} theorem, 31, 65
   1.164 +  \item {\tt equals0D} theorem, 31
   1.165 +  \item {\tt equals0I} theorem, 31
   1.166 +  \item {\tt eresolve_tac}, 14
   1.167 +  \item {\tt eta} theorem, 38, 39
   1.168 +  \item {\tt EX} symbol, 5, 25
   1.169 +  \item {\tt Ex} constant, 5
   1.170 +  \item {\tt EX!} symbol, 5
   1.171 +  \item {\tt ex/Term} theory, 49
   1.172 +  \item {\tt Ex1} constant, 5
   1.173 +  \item {\tt ex1_def} theorem, 6
   1.174 +  \item {\tt ex1E} theorem, 7
   1.175 +  \item {\tt ex1I} theorem, 7
   1.176 +  \item {\tt ex_impE} theorem, 7
   1.177 +  \item {\tt exCI} theorem, 9, 13
   1.178 +  \item {\tt excluded_middle} theorem, 9
   1.179 +  \item {\tt exE} theorem, 6
   1.180 +  \item {\tt exhaust_tac}, \bold{51}
   1.181 +  \item {\tt exI} theorem, 6
   1.182 +  \item {\tt extension} theorem, 28
   1.183 +
   1.184 +  \indexspace
   1.185 +
   1.186 +  \item {\tt False} constant, 5
   1.187 +  \item {\tt FalseE} theorem, 6
   1.188 +  \item {\tt field} constant, 24
   1.189 +  \item {\tt field_def} theorem, 29
   1.190 +  \item {\tt field_subset} theorem, 37
   1.191 +  \item {\tt fieldCI} theorem, 37
   1.192 +  \item {\tt fieldE} theorem, 37
   1.193 +  \item {\tt fieldI1} theorem, 37
   1.194 +  \item {\tt fieldI2} theorem, 37
   1.195 +  \item {\tt Fin.consI} theorem, 46
   1.196 +  \item {\tt Fin.emptyI} theorem, 46
   1.197 +  \item {\tt Fin_induct} theorem, 46
   1.198 +  \item {\tt Fin_mono} theorem, 46
   1.199 +  \item {\tt Fin_subset} theorem, 46
   1.200 +  \item {\tt Fin_UnI} theorem, 46
   1.201 +  \item {\tt Fin_UnionI} theorem, 46
   1.202 +  \item first-order logic, 3--21
   1.203 +  \item {\tt Fixedpt} theory, 42
   1.204 +  \item {\tt flat} constant, 47
   1.205 +  \item {\tt FOL} theory, 3, 9
   1.206 +  \item {\tt FOL_cs}, \bold{9}, 48
   1.207 +  \item {\tt FOL_ss}, \bold{4}, 46
   1.208 +  \item {\tt foundation} theorem, 28
   1.209 +  \item {\tt fst} constant, 24, 30
   1.210 +  \item {\tt fst_conv} theorem, 36
   1.211 +  \item {\tt fst_def} theorem, 29
   1.212 +  \item {\tt fun_disjoint_apply1} theorem, 38, 69
   1.213 +  \item {\tt fun_disjoint_apply2} theorem, 38
   1.214 +  \item {\tt fun_disjoint_Un} theorem, 38, 70
   1.215 +  \item {\tt fun_empty} theorem, 38
   1.216 +  \item {\tt fun_extension} theorem, 38, 39
   1.217 +  \item {\tt fun_is_rel} theorem, 38
   1.218 +  \item {\tt fun_single} theorem, 38
   1.219 +  \item function applications
   1.220 +    \subitem in \ZF, 24
   1.221 +
   1.222 +  \indexspace
   1.223 +
   1.224 +  \item {\tt gfp_def} theorem, 43
   1.225 +  \item {\tt gfp_least} theorem, 43
   1.226 +  \item {\tt gfp_mono} theorem, 43
   1.227 +  \item {\tt gfp_subset} theorem, 43
   1.228 +  \item {\tt gfp_Tarski} theorem, 43
   1.229 +  \item {\tt gfp_upperbound} theorem, 43
   1.230 +  \item {\tt Goalw}, 16, 17
   1.231 +
   1.232 +  \indexspace
   1.233 +
   1.234 +  \item {\tt hyp_subst_tac}, 4
   1.235 +
   1.236 +  \indexspace
   1.237 +
   1.238 +  \item {\textit {i}} type, 23
   1.239 +  \item {\tt id} constant, 44
   1.240 +  \item {\tt id_def} theorem, 44
   1.241 +  \item {\tt if} constant, 24
   1.242 +  \item {\tt if_def} theorem, 16, 28
   1.243 +  \item {\tt if_not_P} theorem, 34
   1.244 +  \item {\tt if_P} theorem, 34
   1.245 +  \item {\tt ifE} theorem, 17
   1.246 +  \item {\tt iff_def} theorem, 6
   1.247 +  \item {\tt iff_impE} theorem, 7
   1.248 +  \item {\tt iffCE} theorem, 9
   1.249 +  \item {\tt iffD1} theorem, 7
   1.250 +  \item {\tt iffD2} theorem, 7
   1.251 +  \item {\tt iffE} theorem, 7
   1.252 +  \item {\tt iffI} theorem, 7, 17
   1.253 +  \item {\tt ifI} theorem, 17
   1.254 +  \item {\tt IFOL} theory, 3
   1.255 +  \item {\tt IFOL_ss}, \bold{4}
   1.256 +  \item {\tt image_def} theorem, 29
   1.257 +  \item {\tt imageE} theorem, 37
   1.258 +  \item {\tt imageI} theorem, 37
   1.259 +  \item {\tt imp_impE} theorem, 7, 12
   1.260 +  \item {\tt impCE} theorem, 9
   1.261 +  \item {\tt impE} theorem, 7, 8
   1.262 +  \item {\tt impI} theorem, 6
   1.263 +  \item {\tt in} symbol, 26
   1.264 +  \item {\tt induct} theorem, 43
   1.265 +  \item {\tt induct_tac}, \bold{51}
   1.266 +  \item {\tt inductive}, 57--62
   1.267 +  \item {\tt Inf} constant, 24, 30
   1.268 +  \item {\tt infinity} theorem, 29
   1.269 +  \item {\tt inj} constant, 44
   1.270 +  \item {\tt inj_converse_inj} theorem, 44
   1.271 +  \item {\tt inj_def} theorem, 44
   1.272 +  \item {\tt Inl} constant, 41
   1.273 +  \item {\tt Inl_def} theorem, 41
   1.274 +  \item {\tt Inl_inject} theorem, 41
   1.275 +  \item {\tt Inl_neq_Inr} theorem, 41
   1.276 +  \item {\tt Inr} constant, 41
   1.277 +  \item {\tt Inr_def} theorem, 41
   1.278 +  \item {\tt Inr_inject} theorem, 41
   1.279 +  \item {\tt INT} symbol, 25, 27
   1.280 +  \item {\tt Int} symbol, 24
   1.281 +  \item {\tt Int_absorb} theorem, 40
   1.282 +  \item {\tt Int_assoc} theorem, 40
   1.283 +  \item {\tt Int_commute} theorem, 40
   1.284 +  \item {\tt Int_def} theorem, 28
   1.285 +  \item {\tt INT_E} theorem, 33
   1.286 +  \item {\tt Int_greatest} theorem, 35, 65, 66
   1.287 +  \item {\tt INT_I} theorem, 33
   1.288 +  \item {\tt Int_lower1} theorem, 35, 65
   1.289 +  \item {\tt Int_lower2} theorem, 35, 65
   1.290 +  \item {\tt Int_Un_distrib} theorem, 40
   1.291 +  \item {\tt Int_Union_RepFun} theorem, 40
   1.292 +  \item {\tt IntD1} theorem, 34
   1.293 +  \item {\tt IntD2} theorem, 34
   1.294 +  \item {\tt IntE} theorem, 34, 66
   1.295 +  \item {\tt Inter} constant, 24
   1.296 +  \item {\tt Inter_def} theorem, 28
   1.297 +  \item {\tt Inter_greatest} theorem, 35
   1.298 +  \item {\tt Inter_lower} theorem, 35
   1.299 +  \item {\tt Inter_Un_distrib} theorem, 40
   1.300 +  \item {\tt InterD} theorem, 33
   1.301 +  \item {\tt InterE} theorem, 33
   1.302 +  \item {\tt InterI} theorem, 32, 33
   1.303 +  \item {\tt IntI} theorem, 34
   1.304 +  \item {\tt IntPr.best_tac}, \bold{9}
   1.305 +  \item {\tt IntPr.fast_tac}, \bold{8}, 11
   1.306 +  \item {\tt IntPr.inst_step_tac}, \bold{8}
   1.307 +  \item {\tt IntPr.safe_step_tac}, \bold{8}
   1.308 +  \item {\tt IntPr.safe_tac}, \bold{8}
   1.309 +  \item {\tt IntPr.step_tac}, \bold{8}
   1.310 +
   1.311 +  \indexspace
   1.312 +
   1.313 +  \item {\tt lam} symbol, 25, 27
   1.314 +  \item {\tt lam_def} theorem, 29
   1.315 +  \item {\tt lam_type} theorem, 38
   1.316 +  \item {\tt Lambda} constant, 24, 27
   1.317 +  \item $\lambda$-abstractions
   1.318 +    \subitem in \ZF, 25
   1.319 +  \item {\tt lamE} theorem, 38, 39
   1.320 +  \item {\tt lamI} theorem, 38, 39
   1.321 +  \item {\tt le_cs}, \bold{48}
   1.322 +  \item {\tt left_comp_id} theorem, 44
   1.323 +  \item {\tt left_comp_inverse} theorem, 44
   1.324 +  \item {\tt left_inverse} theorem, 44
   1.325 +  \item {\tt length} constant, 47
   1.326 +  \item {\tt Let} constant, 23, 24
   1.327 +  \item {\tt let} symbol, 26
   1.328 +  \item {\tt Let_def} theorem, 23, 28
   1.329 +  \item {\tt lfp_def} theorem, 43
   1.330 +  \item {\tt lfp_greatest} theorem, 43
   1.331 +  \item {\tt lfp_lowerbound} theorem, 43
   1.332 +  \item {\tt lfp_mono} theorem, 43
   1.333 +  \item {\tt lfp_subset} theorem, 43
   1.334 +  \item {\tt lfp_Tarski} theorem, 43
   1.335 +  \item {\tt list} constant, 47
   1.336 +  \item {\tt List.induct} theorem, 47
   1.337 +  \item {\tt list_case} constant, 47
   1.338 +  \item {\tt list_mono} theorem, 47
   1.339 +  \item {\tt logic} class, 3
   1.340 +
   1.341 +  \indexspace
   1.342 +
   1.343 +  \item {\tt map} constant, 47
   1.344 +  \item {\tt map_app_distrib} theorem, 47
   1.345 +  \item {\tt map_compose} theorem, 47
   1.346 +  \item {\tt map_flat} theorem, 47
   1.347 +  \item {\tt map_ident} theorem, 47
   1.348 +  \item {\tt map_type} theorem, 47
   1.349 +  \item {\tt mem_asym} theorem, 34, 35
   1.350 +  \item {\tt mem_irrefl} theorem, 34
   1.351 +  \item {\tt mk_cases}, 54, 61
   1.352 +  \item {\tt mod} symbol, 45
   1.353 +  \item {\tt mod_def} theorem, 45
   1.354 +  \item {\tt mod_quo_equality} theorem, 45
   1.355 +  \item {\tt mp} theorem, 6
   1.356 +  \item {\tt mp_tac}, \bold{8}
   1.357 +  \item {\tt mult_0} theorem, 45
   1.358 +  \item {\tt mult_assoc} theorem, 45
   1.359 +  \item {\tt mult_commute} theorem, 45
   1.360 +  \item {\tt mult_succ} theorem, 45
   1.361 +  \item {\tt mult_type} theorem, 45
   1.362 +
   1.363 +  \indexspace
   1.364 +
   1.365 +  \item {\tt Nat} theory, 42
   1.366 +  \item {\tt nat} constant, 45
   1.367 +  \item {\tt nat_0I} theorem, 45
   1.368 +  \item {\tt nat_case} constant, 45
   1.369 +  \item {\tt nat_case_0} theorem, 45
   1.370 +  \item {\tt nat_case_def} theorem, 45
   1.371 +  \item {\tt nat_case_succ} theorem, 45
   1.372 +  \item {\tt nat_def} theorem, 45
   1.373 +  \item {\tt nat_induct} theorem, 45
   1.374 +  \item {\tt nat_succI} theorem, 45
   1.375 +  \item {\tt Nil_Cons_iff} theorem, 47
   1.376 +  \item {\tt NilI} theorem, 47
   1.377 +  \item {\tt Not} constant, 5
   1.378 +  \item {\tt not_def} theorem, 6, 41
   1.379 +  \item {\tt not_impE} theorem, 7
   1.380 +  \item {\tt notE} theorem, 7, 8
   1.381 +  \item {\tt notI} theorem, 7
   1.382 +  \item {\tt notnotD} theorem, 9
   1.383 +
   1.384 +  \indexspace
   1.385 +
   1.386 +  \item {\tt O} symbol, 44
   1.387 +  \item {\textit {o}} type, 3
   1.388 +  \item {\tt or_def} theorem, 41
   1.389 +
   1.390 +  \indexspace
   1.391 +
   1.392 +  \item {\tt Pair} constant, 24, 25
   1.393 +  \item {\tt Pair_def} theorem, 29
   1.394 +  \item {\tt Pair_inject} theorem, 36
   1.395 +  \item {\tt Pair_inject1} theorem, 36
   1.396 +  \item {\tt Pair_inject2} theorem, 36
   1.397 +  \item {\tt Pair_neq_0} theorem, 36
   1.398 +  \item {\tt pairing} theorem, 33
   1.399 +  \item {\tt Perm} theory, 42
   1.400 +  \item {\tt Pi} constant, 24, 27, 39
   1.401 +  \item {\tt Pi_def} theorem, 29
   1.402 +  \item {\tt Pi_type} theorem, 38, 39
   1.403 +  \item {\tt Pow} constant, 24
   1.404 +  \item {\tt Pow_iff} theorem, 28
   1.405 +  \item {\tt Pow_mono} theorem, 65
   1.406 +  \item {\tt PowD} theorem, 31, 66
   1.407 +  \item {\tt PowI} theorem, 31, 66
   1.408 +  \item {\tt primrec}, 55--57
   1.409 +  \item {\tt PrimReplace} constant, 24, 30
   1.410 +  \item priorities, 1
   1.411 +  \item {\tt PROD} symbol, 25, 27
   1.412 +  \item {\tt prop_cs}, \bold{9}
   1.413 +
   1.414 +  \indexspace
   1.415 +
   1.416 +  \item {\tt qcase_def} theorem, 42
   1.417 +  \item {\tt qconverse} constant, 39
   1.418 +  \item {\tt qconverse_def} theorem, 42
   1.419 +  \item {\tt qed_spec_mp}, 54
   1.420 +  \item {\tt qfsplit_def} theorem, 42
   1.421 +  \item {\tt QInl_def} theorem, 42
   1.422 +  \item {\tt QInr_def} theorem, 42
   1.423 +  \item {\tt QPair} theory, 39
   1.424 +  \item {\tt QPair_def} theorem, 42
   1.425 +  \item {\tt QSigma} constant, 39
   1.426 +  \item {\tt QSigma_def} theorem, 42
   1.427 +  \item {\tt qsplit} constant, 39
   1.428 +  \item {\tt qsplit_def} theorem, 42
   1.429 +  \item {\tt qsum_def} theorem, 42
   1.430 +  \item {\tt QUniv} theory, 46
   1.431 +
   1.432 +  \indexspace
   1.433 +
   1.434 +  \item {\tt range} constant, 24
   1.435 +  \item {\tt range_def} theorem, 29
   1.436 +  \item {\tt range_of_fun} theorem, 38, 39
   1.437 +  \item {\tt range_subset} theorem, 37
   1.438 +  \item {\tt range_type} theorem, 38
   1.439 +  \item {\tt rangeE} theorem, 37
   1.440 +  \item {\tt rangeI} theorem, 37
   1.441 +  \item {\tt rank} constant, 62
   1.442 +  \item recursion
   1.443 +    \subitem primitive, 57
   1.444 +  \item recursive functions, \see{recursion}{55}
   1.445 +  \item {\tt refl} theorem, 6
   1.446 +  \item {\tt RepFun} constant, 24, 27, 30, 32
   1.447 +  \item {\tt RepFun_def} theorem, 28
   1.448 +  \item {\tt RepFunE} theorem, 33
   1.449 +  \item {\tt RepFunI} theorem, 33
   1.450 +  \item {\tt Replace} constant, 24, 25, 30, 32
   1.451 +  \item {\tt Replace_def} theorem, 28
   1.452 +  \item {\tt ReplaceE} theorem, 33
   1.453 +  \item {\tt ReplaceI} theorem, 33
   1.454 +  \item {\tt replacement} theorem, 28
   1.455 +  \item {\tt restrict} constant, 24, 30
   1.456 +  \item {\tt restrict} theorem, 38
   1.457 +  \item {\tt restrict_bij} theorem, 44
   1.458 +  \item {\tt restrict_def} theorem, 29
   1.459 +  \item {\tt restrict_type} theorem, 38
   1.460 +  \item {\tt rev} constant, 47
   1.461 +  \item {\tt rew_tac}, 17
   1.462 +  \item {\tt rewrite_rule}, 17
   1.463 +  \item {\tt right_comp_id} theorem, 44
   1.464 +  \item {\tt right_comp_inverse} theorem, 44
   1.465 +  \item {\tt right_inverse} theorem, 44
   1.466 +
   1.467 +  \indexspace
   1.468 +
   1.469 +  \item {\tt separation} theorem, 33
   1.470 +  \item set theory, 22--70
   1.471 +  \item {\tt Sigma} constant, 24, 27, 30, 36
   1.472 +  \item {\tt Sigma_def} theorem, 29
   1.473 +  \item {\tt SigmaE} theorem, 36
   1.474 +  \item {\tt SigmaE2} theorem, 36
   1.475 +  \item {\tt SigmaI} theorem, 36
   1.476 +  \item simplification
   1.477 +    \subitem of conjunctions, 4
   1.478 +  \item {\tt singletonE} theorem, 34
   1.479 +  \item {\tt singletonI} theorem, 34
   1.480 +  \item {\tt snd} constant, 24, 30
   1.481 +  \item {\tt snd_conv} theorem, 36
   1.482 +  \item {\tt snd_def} theorem, 29
   1.483 +  \item {\tt spec} theorem, 6
   1.484 +  \item {\tt split} constant, 24, 30
   1.485 +  \item {\tt split} theorem, 36
   1.486 +  \item {\tt split_def} theorem, 29
   1.487 +  \item {\tt ssubst} theorem, 7
   1.488 +  \item {\tt Step_tac}, 20
   1.489 +  \item {\tt step_tac}, 21
   1.490 +  \item {\tt subset_def} theorem, 28
   1.491 +  \item {\tt subset_refl} theorem, 31
   1.492 +  \item {\tt subset_trans} theorem, 31
   1.493 +  \item {\tt subsetCE} theorem, 31
   1.494 +  \item {\tt subsetD} theorem, 31, 68
   1.495 +  \item {\tt subsetI} theorem, 31, 66, 67
   1.496 +  \item {\tt subst} theorem, 6
   1.497 +  \item {\tt succ} constant, 24, 30
   1.498 +  \item {\tt succ_def} theorem, 29
   1.499 +  \item {\tt succ_inject} theorem, 34
   1.500 +  \item {\tt succ_neq_0} theorem, 34
   1.501 +  \item {\tt succCI} theorem, 34
   1.502 +  \item {\tt succE} theorem, 34
   1.503 +  \item {\tt succI1} theorem, 34
   1.504 +  \item {\tt succI2} theorem, 34
   1.505 +  \item {\tt SUM} symbol, 25, 27
   1.506 +  \item {\tt Sum} theory, 39
   1.507 +  \item {\tt sum_def} theorem, 41
   1.508 +  \item {\tt sum_InlI} theorem, 41
   1.509 +  \item {\tt sum_InrI} theorem, 41
   1.510 +  \item {\tt SUM_Int_distrib1} theorem, 40
   1.511 +  \item {\tt SUM_Int_distrib2} theorem, 40
   1.512 +  \item {\tt SUM_Un_distrib1} theorem, 40
   1.513 +  \item {\tt SUM_Un_distrib2} theorem, 40
   1.514 +  \item {\tt sumE2} theorem, 41
   1.515 +  \item {\tt surj} constant, 44
   1.516 +  \item {\tt surj_def} theorem, 44
   1.517 +  \item {\tt swap} theorem, 9
   1.518 +  \item {\tt swap_res_tac}, 14
   1.519 +  \item {\tt sym} theorem, 7
   1.520 +
   1.521 +  \indexspace
   1.522 +
   1.523 +  \item {\tt term} class, 3
   1.524 +  \item {\tt THE} symbol, 25, 27, 35
   1.525 +  \item {\tt The} constant, 24, 27, 30
   1.526 +  \item {\tt the_def} theorem, 28
   1.527 +  \item {\tt the_equality} theorem, 34, 35
   1.528 +  \item {\tt theI} theorem, 34, 35
   1.529 +  \item {\tt trace_induct}, \bold{59}
   1.530 +  \item {\tt trans} theorem, 7
   1.531 +  \item {\tt True} constant, 5
   1.532 +  \item {\tt True_def} theorem, 6
   1.533 +  \item {\tt TrueI} theorem, 7
   1.534 +  \item {\tt Trueprop} constant, 5
   1.535 +
   1.536 +  \indexspace
   1.537 +
   1.538 +  \item {\tt UN} symbol, 25, 27
   1.539 +  \item {\tt Un} symbol, 24
   1.540 +  \item {\tt Un_absorb} theorem, 40
   1.541 +  \item {\tt Un_assoc} theorem, 40
   1.542 +  \item {\tt Un_commute} theorem, 40
   1.543 +  \item {\tt Un_def} theorem, 28
   1.544 +  \item {\tt UN_E} theorem, 33
   1.545 +  \item {\tt UN_I} theorem, 33
   1.546 +  \item {\tt Un_Int_distrib} theorem, 40
   1.547 +  \item {\tt Un_Inter_RepFun} theorem, 40
   1.548 +  \item {\tt Un_least} theorem, 35
   1.549 +  \item {\tt Un_upper1} theorem, 35
   1.550 +  \item {\tt Un_upper2} theorem, 35
   1.551 +  \item {\tt UnCI} theorem, 32, 34
   1.552 +  \item {\tt UnE} theorem, 34
   1.553 +  \item {\tt UnI1} theorem, 32, 34, 69
   1.554 +  \item {\tt UnI2} theorem, 32, 34
   1.555 +  \item {\tt Union} constant, 24
   1.556 +  \item {\tt Union_iff} theorem, 28
   1.557 +  \item {\tt Union_least} theorem, 35
   1.558 +  \item {\tt Union_Un_distrib} theorem, 40
   1.559 +  \item {\tt Union_upper} theorem, 35
   1.560 +  \item {\tt UnionE} theorem, 33, 67
   1.561 +  \item {\tt UnionI} theorem, 33, 67
   1.562 +  \item {\tt Univ} theory, 42
   1.563 +  \item {\tt Upair} constant, 23, 24, 30
   1.564 +  \item {\tt Upair_def} theorem, 28
   1.565 +  \item {\tt UpairE} theorem, 33
   1.566 +  \item {\tt UpairI1} theorem, 33
   1.567 +  \item {\tt UpairI2} theorem, 33
   1.568 +
   1.569 +  \indexspace
   1.570 +
   1.571 +  \item {\tt vimage_def} theorem, 29
   1.572 +  \item {\tt vimageE} theorem, 37
   1.573 +  \item {\tt vimageI} theorem, 37
   1.574 +
   1.575 +  \indexspace
   1.576 +
   1.577 +  \item {\tt xor_def} theorem, 41
   1.578 +
   1.579 +  \indexspace
   1.580 +
   1.581 +  \item {\tt ZF} theory, 22
   1.582 +  \item {\tt ZF_cs}, \bold{48}
   1.583 +  \item {\tt ZF_ss}, \bold{46}
   1.584 +
   1.585 +\end{theindex}
     2.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     2.2 +++ b/doc-src/ZF/logics-ZF.rao	Wed Jan 27 17:11:12 1999 +0100
     2.3 @@ -0,0 +1,54 @@
     2.4 +% This file was generated by 'rail' from 'logics-ZF.rai'
     2.5 +\rail@i {1}{ datatype : ( 'datatype' | 'codatatype' ) datadecls; \par datadecls: ( '"' id arglist '"' '=' (constructor + '|') ) + 'and' ; constructor : name ( () | consargs ) ( () | ( '(' mixfix ')' ) ) ; consargs : '(' ('"' var ':' term '"' + ',') ')' ; }
     2.6 +\rail@o {1}{
     2.7 +\rail@begin{2}{datatype}
     2.8 +\rail@bar
     2.9 +\rail@term{datatype}[]
    2.10 +\rail@nextbar{1}
    2.11 +\rail@term{codatatype}[]
    2.12 +\rail@endbar
    2.13 +\rail@nont{datadecls}[]
    2.14 +\rail@end
    2.15 +\rail@begin{3}{datadecls}
    2.16 +\rail@plus
    2.17 +\rail@term{"}[]
    2.18 +\rail@nont{id}[]
    2.19 +\rail@nont{arglist}[]
    2.20 +\rail@term{"}[]
    2.21 +\rail@term{=}[]
    2.22 +\rail@plus
    2.23 +\rail@nont{constructor}[]
    2.24 +\rail@nextplus{1}
    2.25 +\rail@cterm{|}[]
    2.26 +\rail@endplus
    2.27 +\rail@nextplus{2}
    2.28 +\rail@cterm{and}[]
    2.29 +\rail@endplus
    2.30 +\rail@end
    2.31 +\rail@begin{2}{constructor}
    2.32 +\rail@nont{name}[]
    2.33 +\rail@bar
    2.34 +\rail@nextbar{1}
    2.35 +\rail@nont{consargs}[]
    2.36 +\rail@endbar
    2.37 +\rail@bar
    2.38 +\rail@nextbar{1}
    2.39 +\rail@term{(}[]
    2.40 +\rail@nont{mixfix}[]
    2.41 +\rail@term{)}[]
    2.42 +\rail@endbar
    2.43 +\rail@end
    2.44 +\rail@begin{2}{consargs}
    2.45 +\rail@term{(}[]
    2.46 +\rail@plus
    2.47 +\rail@term{"}[]
    2.48 +\rail@nont{var}[]
    2.49 +\rail@term{:}[]
    2.50 +\rail@nont{term}[]
    2.51 +\rail@term{"}[]
    2.52 +\rail@nextplus{1}
    2.53 +\rail@cterm{,}[]
    2.54 +\rail@endplus
    2.55 +\rail@term{)}[]
    2.56 +\rail@end
    2.57 +}