0

1 
(* Title: ZF/univ.thy


2 
ID: $Id$


3 
Author: Lawrence C Paulson, Cambridge University Computer Laboratory


4 
Copyright 1992 University of Cambridge


5 


6 
The cumulative hierarchy and a small universe for recursive types


7 


8 
Standard notation for Vset(i) is V(i), but users might want V for a variable


9 
*)


10 

124

11 
Univ = Arith + Sum + "mono" +

0

12 
consts

435

13 
Vfrom :: "[i,i]=>i"


14 
Vset :: "i=>i"


15 
Vrec :: "[i, [i,i]=>i] =>i"


16 
univ :: "i=>i"

0

17 


18 
translations


19 
"Vset(x)" == "Vfrom(0,x)"


20 


21 
rules


22 
Vfrom_def "Vfrom(A,i) == transrec(i, %x f. A Un (UN y:x. Pow(f`y)))"


23 


24 
Vrec_def


25 
"Vrec(a,H) == transrec(rank(a), %x g. lam z: Vset(succ(x)). \


26 
\ H(z, lam w:Vset(x). g`rank(w)`w)) ` a"


27 


28 
univ_def "univ(A) == Vfrom(A,nat)"


29 


30 
end
