tacticals are really tactics now, they have an AST at the same level of

[helm.git] / helm / software / matita / contribs / ng_TPTP / COL009-1.ma

diff --git a/helm/software/matita/contribs/ng_TPTP/COL009-1.ma b/helm/software/matita/contribs/ng_TPTP/COL009-1.ma
index 14d0418f6673e603640ff52e4a54e4eb3a224bcb..42c6ea098ac0629fc2804cf19098f40feef3524f 100644 (file)
--- a/helm/software/matita/contribs/ng_TPTP/COL009-1.ma
+++ b/helm/software/matita/contribs/ng_TPTP/COL009-1.ma
@@ -52,29 +52,28 @@ include "logic/equality.ma".
 
 (* -------------------------------------------------------------------------- *)
 ntheorem prove_fixed_point:
- ∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
+ (∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
 ∀apply:∀_:Univ.∀_:Univ.Univ.
 ∀b:Univ.
 ∀combinator:Univ.
 ∀l2:Univ.
 ∀H0:∀X:Univ.∀Y:Univ.eq Univ (apply (apply l2 X) Y) (apply Y (apply X X)).
-∀H1:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).∃Y:Univ.eq Univ Y (apply combinator Y)
+∀H1:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).∃Y:Univ.eq Univ Y (apply combinator Y))
 .
-#Univ.
-#X.
-#Y.
-#Z.
-#apply.
-#b.
-#combinator.
-#l2.
-#H0.
-#H1.
-napply ex_intro[
-nid2:
-nauto by H0,H1;
-nid|
-skip]
+#Univ ##.
+#X ##.
+#Y ##.
+#Z ##.
+#apply ##.
+#b ##.
+#combinator ##.
+#l2 ##.
+#H0 ##.
+#H1 ##.
+napply (ex_intro ? ? ? ?) ##[
+##2:
+nauto by H0,H1 ##;
+##| ##skip ##]
 nqed.
 
 (* -------------------------------------------------------------------------- *)