lcp [Thu, 03 Nov 1994 12:35:41 +0100] rev 690
ZF: NEW DEFINITION OF PI(A,B)
Was Pi(A,B) == {f: Pow(Sigma(A,B)). ALL x:A. EX! y. <x,y>: f}
Now function(r) == ALL x y. <x,y>:r --> (ALL y'. <x,y'>:r --> y=y')
Pi(A,B) == {f: Pow(Sigma(A,B)). A<=domain(f) & function(f)}"
This simplifies many proofs, since (a) the top-level definition has fewer
bound variables (b) the "total" and "function" properties are separated
(c) the awkward EX! quantifier is eliminated.
ZF/ZF.thy/function: new definition
lcp [Thu, 03 Nov 1994 12:30:55 +0100] rev 689
ZF/Fixedpt/subset_cs: moved to ZF/subset.ML
lcp [Thu, 03 Nov 1994 12:26:59 +0100] rev 688
ZF/Fixedpt/subset0_cs: moved to ZF/ZF.ML