Thu, 10 Nov 1994 11:06:44 +0100 updated pathnames
lcp [Thu, 10 Nov 1994 11:06:44 +0100] rev 699
updated pathnames
Wed, 09 Nov 1994 15:47:11 +0100 updated discussion of congruence rules in first section
lcp [Wed, 09 Nov 1994 15:47:11 +0100] rev 698
updated discussion of congruence rules in first section
Wed, 09 Nov 1994 13:50:59 +0100 changed warning for extremely ambiguous expressions
clasohm [Wed, 09 Nov 1994 13:50:59 +0100] rev 697
changed warning for extremely ambiguous expressions
Thu, 03 Nov 1994 16:52:19 +0100 Pure/goals/prepare_proof/mkresult: now smashes flexflex pairs in the final
lcp [Thu, 03 Nov 1994 16:52:19 +0100] rev 696
Pure/goals/prepare_proof/mkresult: now smashes flexflex pairs in the final result.
Thu, 03 Nov 1994 16:39:41 +0100 ZF/ex/Ramsey,Rmap,misc.ML: modified for new definition of Pi(A,B)
lcp [Thu, 03 Nov 1994 16:39:41 +0100] rev 695
ZF/ex/Ramsey,Rmap,misc.ML: modified for new definition of Pi(A,B)
Thu, 03 Nov 1994 16:05:22 +0100 ZF/ex/Ramsey,Rmap,misc.ML: modified for new definition of Pi(A,B)
lcp [Thu, 03 Nov 1994 16:05:22 +0100] rev 694
ZF/ex/Ramsey,Rmap,misc.ML: modified for new definition of Pi(A,B)
Thu, 03 Nov 1994 13:42:39 +0100 ZF/Perm/inj_converse_fun: tidied; removed uses of PiI/E
lcp [Thu, 03 Nov 1994 13:42:39 +0100] rev 693
ZF/Perm/inj_converse_fun: tidied; removed uses of PiI/E ZF/Perm/comp_fun: tidied; removed use of PiI
Thu, 03 Nov 1994 12:43:42 +0100 ZF/InfDatatype/fun_Vcsucc: removed use of PiE
lcp [Thu, 03 Nov 1994 12:43:42 +0100] rev 692
ZF/InfDatatype/fun_Vcsucc: removed use of PiE
Thu, 03 Nov 1994 12:39:39 +0100 ZF/func: tidied many proofs, using new definition of Pi(A,B)
lcp [Thu, 03 Nov 1994 12:39:39 +0100] rev 691
ZF/func: tidied many proofs, using new definition of Pi(A,B) ZF/func/PiI,PiE: removed ZF/func/Pi_iff_old: new ZF/func/Pi_memberD: new; simpler, replaces memberPiE
Thu, 03 Nov 1994 12:35:41 +0100 ZF: NEW DEFINITION OF PI(A,B)
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
(0) -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip