author | paulson |
Fri, 21 Nov 2008 15:54:53 +0100 | |
changeset 28871 | 111bbd2b12db |
parent 28870 | 381a3b3139ae |
child 28872 | 686963dbf6cd |
doc-src/ZF/ZF.tex | file | annotate | diff | comparison | revisions |
--- a/doc-src/ZF/ZF.tex Fri Nov 21 14:21:42 2008 +0100 +++ b/doc-src/ZF/ZF.tex Fri Nov 21 15:54:53 2008 +0100 @@ -1665,6 +1665,7 @@ consts term :: "i=>i" datatype "term(A)" = Apply ("a \isasymin A", "l \isasymin list(term(A))") monos list_mono + type_elims list_univ [THEN subsetD, elim_format] \end{alltt*} is an example of nested recursion. (The theorem \isa{list_mono} is proved in theory \isa{List}, and the \isa{term} example is developed in