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

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

diff --git a/helm/software/matita/contribs/ng_TPTP/COL021-1.ma b/helm/software/matita/contribs/ng_TPTP/COL021-1.ma
index 08ffe6a60abba1bab8fd3bf1aed8517282d3f601..c51a4752d827d8b3a2b6ef0ca663adac4496e6e9 100644 (file)
--- a/helm/software/matita/contribs/ng_TPTP/COL021-1.ma
+++ b/helm/software/matita/contribs/ng_TPTP/COL021-1.ma
@@ -52,7 +52,7 @@ 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.
@@ -60,25 +60,24 @@ ntheorem prove_fixed_point:
 ∀v:Univ.
 ∀H0:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (apply (apply (apply v X) Y) Z) (apply (apply Z X) Y).
 ∀H1:∀X:Univ.eq Univ (apply m X) (apply X X).
-∀H2:∀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)
+∀H2:∀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.
-#m.
-#v.
-#H0.
-#H1.
-#H2.
-napply ex_intro[
-nid2:
-nauto by H0,H1,H2;
-nid|
-skip]
+#Univ ##.
+#X ##.
+#Y ##.
+#Z ##.
+#apply ##.
+#b ##.
+#combinator ##.
+#m ##.
+#v ##.
+#H0 ##.
+#H1 ##.
+#H2 ##.
+napply (ex_intro ? ? ? ?) ##[
+##2:
+nauto by H0,H1,H2 ##;
+##| ##skip ##]
 nqed.
 
 (* -------------------------------------------------------------------------- *)