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

[helm.git] / helm / software / matita / contribs / ng_TPTP / COL075-2.ma

diff --git a/helm/software/matita/contribs/ng_TPTP/COL075-2.ma b/helm/software/matita/contribs/ng_TPTP/COL075-2.ma
index 7c1e12d2d7ff44e9c6d16ab69e1f7e7004414c9f..a8cacceadd6e17ba2bdfc8deb88716dbc2a919fb 100644 (file)
--- a/helm/software/matita/contribs/ng_TPTP/COL075-2.ma
+++ b/helm/software/matita/contribs/ng_TPTP/COL075-2.ma
@@ -66,31 +66,30 @@ include "logic/equality.ma".
 
 (* ----Subsitution axioms  *)
 ntheorem prove_diagonal_combinator:
- ∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
+ (∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
 ∀abstraction:Univ.
 ∀apply:∀_:Univ.∀_:Univ.Univ.
 ∀b:∀_:Univ.Univ.
 ∀c:∀_:Univ.Univ.
 ∀k:Univ.
 ∀H0:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (apply (apply (apply abstraction X) Y) Z) (apply (apply X (apply k Z)) (apply Y Z)).
-∀H1:∀X:Univ.∀Y:Univ.eq Univ (apply (apply k X) Y) X.∃Y:Univ.eq Univ (apply (apply Y (b Y)) (c Y)) (apply (b Y) (b Y))
+∀H1:∀X:Univ.∀Y:Univ.eq Univ (apply (apply k X) Y) X.∃Y:Univ.eq Univ (apply (apply Y (b Y)) (c Y)) (apply (b Y) (b Y)))
 .
-#Univ.
-#X.
-#Y.
-#Z.
-#abstraction.
-#apply.
-#b.
-#c.
-#k.
-#H0.
-#H1.
-napply ex_intro[
-nid2:
-nauto by H0,H1;
-nid|
-skip]
+#Univ ##.
+#X ##.
+#Y ##.
+#Z ##.
+#abstraction ##.
+#apply ##.
+#b ##.
+#c ##.
+#k ##.
+#H0 ##.
+#H1 ##.
+napply (ex_intro ? ? ? ?) ##[
+##2:
+nauto by H0,H1 ##;
+##| ##skip ##]
 nqed.
 
 (* -------------------------------------------------------------------------- *)