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

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

diff --git a/helm/software/matita/contribs/ng_TPTP/GRP179-1.ma b/helm/software/matita/contribs/ng_TPTP/GRP179-1.ma
index 2e41855c69ea7ddc63cd8455fd30ce55f076239d..2580773e6a0ce85508aeba64b0751e17de2a8f05 100644 (file)
--- a/helm/software/matita/contribs/ng_TPTP/GRP179-1.ma
+++ b/helm/software/matita/contribs/ng_TPTP/GRP179-1.ma
@@ -170,7 +170,7 @@ include "logic/equality.ma".
 
 (* -------------------------------------------------------------------------- *)
 ntheorem prove_p10:
- ∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
+ (∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
 ∀a:Univ.
 ∀b:Univ.
 ∀greatest_lower_bound:∀_:Univ.∀_:Univ.Univ.
@@ -192,35 +192,35 @@ ntheorem prove_p10:
 ∀H11:∀X:Univ.∀Y:Univ.eq Univ (greatest_lower_bound X Y) (greatest_lower_bound Y X).
 ∀H12:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (multiply (multiply X Y) Z) (multiply X (multiply Y Z)).
 ∀H13:∀X:Univ.eq Univ (multiply (inverse X) X) identity.
-∀H14:∀X:Univ.eq Univ (multiply identity X) X.eq Univ (inverse (least_upper_bound a b)) (greatest_lower_bound (inverse a) (inverse b))
+∀H14:∀X:Univ.eq Univ (multiply identity X) X.eq Univ (inverse (least_upper_bound a b)) (greatest_lower_bound (inverse a) (inverse b)))
 .
-#Univ.
-#X.
-#Y.
-#Z.
-#a.
-#b.
-#greatest_lower_bound.
-#identity.
-#inverse.
-#least_upper_bound.
-#multiply.
-#H0.
-#H1.
-#H2.
-#H3.
-#H4.
-#H5.
-#H6.
-#H7.
-#H8.
-#H9.
-#H10.
-#H11.
-#H12.
-#H13.
-#H14.
-nauto by H0,H1,H2,H3,H4,H5,H6,H7,H8,H9,H10,H11,H12,H13,H14;
+#Univ ##.
+#X ##.
+#Y ##.
+#Z ##.
+#a ##.
+#b ##.
+#greatest_lower_bound ##.
+#identity ##.
+#inverse ##.
+#least_upper_bound ##.
+#multiply ##.
+#H0 ##.
+#H1 ##.
+#H2 ##.
+#H3 ##.
+#H4 ##.
+#H5 ##.
+#H6 ##.
+#H7 ##.
+#H8 ##.
+#H9 ##.
+#H10 ##.
+#H11 ##.
+#H12 ##.
+#H13 ##.
+#H14 ##.
+nauto by H0,H1,H2,H3,H4,H5,H6,H7,H8,H9,H10,H11,H12,H13,H14 ##;
 nqed.
 
 (* -------------------------------------------------------------------------- *)