author | wenzelm |
Sat, 24 Nov 2001 16:54:32 +0100 | |
changeset 12282 | f98beaaa7c4f |
parent 124 | 858ab9a9b047 |
permissions | -rw-r--r-- |
(* Title: ZF/univ.thy ID: $Id$ Author: Lawrence C Paulson, Cambridge University Computer Laboratory Copyright 1993 University of Cambridge A small universe for lazy recursive types *) QUniv = Univ + QPair + "mono" + "equalities" + consts quniv :: "i=>i" rules quniv_def "quniv(A) == Pow(univ(eclose(A)))" end