--- a/Nominal/Test.thy	Thu Mar 18 10:05:36 2010 +0100
+++ b/Nominal/Test.thy	Thu Mar 18 10:12:41 2010 +0100
@@ -191,7 +191,6 @@
 
 thm lam_bp_fv[simplified supp_fv(1)[symmetric] supp_fv(2)[THEN conjunct1, symmetric]]
 
-ML {* val _ = cheat_alpha_eqvt := true *}
 ML {* val _ = recursive := true *}
 
 nominal_datatype lam' =

--- a/TODO	Thu Mar 18 10:05:36 2010 +0100
+++ b/TODO	Thu Mar 18 10:12:41 2010 +0100
@@ -17,5 +17,7 @@
 
 - strong induction rules
 
+- show support equations
 
-What are the proofs that are still proved by sorry?
\ No newline at end of file
+- automate the proofs that are currently proved with sorry:
+  alpha_equivp, fv_rsp, alpha_bn_rsp, alpha_bn_reflp