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

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

diff --git a/helm/software/matita/contribs/ng_TPTP/COL001-1.ma b/helm/software/matita/contribs/ng_TPTP/COL001-1.ma
index 26dc7e574a1e1aef6006f51d95c088f16670a75e..b8be44f85bd835711f5efef37ecdf38d55deb113 100644 (file)
--- a/helm/software/matita/contribs/ng_TPTP/COL001-1.ma
+++ b/helm/software/matita/contribs/ng_TPTP/COL001-1.ma
@@ -50,29 +50,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.
 ∀combinator:Univ.
 ∀k:Univ.
 ∀s:Univ.
 ∀H0:∀X:Univ.∀Y:Univ.eq Univ (apply (apply k X) Y) X.
-∀H1:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (apply (apply (apply s X) Y) Z) (apply (apply X Z) (apply Y Z)).∃Y:Univ.eq Univ Y (apply combinator Y)
+∀H1:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (apply (apply (apply s X) Y) Z) (apply (apply X Z) (apply Y Z)).∃Y:Univ.eq Univ Y (apply combinator Y))
 .
-#Univ.
-#X.
-#Y.
-#Z.
-#apply.
-#combinator.
-#k.
-#s.
-#H0.
-#H1.
-napply ex_intro[
-nid2:
-nauto by H0,H1;
-nid|
-skip]
+#Univ ##.
+#X ##.
+#Y ##.
+#Z ##.
+#apply ##.
+#combinator ##.
+#k ##.
+#s ##.
+#H0 ##.
+#H1 ##.
+napply (ex_intro ? ? ? ?) ##[
+##2:
+nauto by H0,H1 ##;
+##| ##skip ##]
 nqed.
 
 (* -------------------------------------------------------------------------- *)