is mentioned by
[sfa_doc_fun_ext] | |
[sfa_doc_bool_vs_decidable_fun] | |
[sfa_doc_bool_vs_decidable] | |
Thm* P:((A List)Prop). Thm* (P(nil) Q) & (a:A, x:A List. P(a.x) R(a,x,P(x))) | [sfa_doc_listind_via_so] |
[sfa_doc_equal_via_so] | |
[sfa_doc_some_via_so] | |
[sfa_doc_false_via_so] | |
[sfa_doc_iff_via_so] | |
[sfa_doc_not_via_so] | |
[sfa_doc_or_via_so] | |
[sfa_doc_and_via_so] |
In prior sections: core well fnd int 1 bool 1 rel 1 fun 1 int 2 list 1
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html