Now def of apfst uses pattern-matching
authorpaulson
Fri, 08 Dec 1995 11:17:05 +0100
changeset 1396 48bcde67391b
parent 1395 7095d6b89734
child 1397 b010f04fcb9c
Now def of apfst uses pattern-matching
src/HOL/Univ.thy
--- a/src/HOL/Univ.thy	Fri Dec 08 10:47:25 1995 +0100
+++ b/src/HOL/Univ.thy	Fri Dec 08 11:17:05 1995 +0100
@@ -58,7 +58,7 @@
   Push_Node_def  "Push_Node == (%n x. Abs_Node (apfst (Push n) (Rep_Node x)))"
 
   (*crude "lists" of nats -- needed for the constructions*)
-  apfst_def  "apfst == (%f. split(%x y. (f(x),y)))"
+  apfst_def  "apfst == (%f (x,y). (f(x),y))"
   Push_def   "Push == (%b h. nat_case (Suc b) h)"
 
   (** operations on S-expressions -- sets of nodes **)