src/ZF/QUniv.thy

Put in minimal simpset to avoid excessive simplification,
just as in revision 1.9 of HOL/indrule.ML

(*  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

defs
    quniv_def    "quniv(A) == Pow(univ(eclose(A)))"

end