]> matita.cs.unibo.it Git - helm.git/blobdiff - helm/software/matita/contribs/ng_TPTP/GRP164-1.ma
tacticals are really tactics now, they have an AST at the same level of
[helm.git] / helm / software / matita / contribs / ng_TPTP / GRP164-1.ma
index 0adb6f862c5e6ee87c1de6740e1f85708ab006c3..db03e8daf3a064b2f096c5967a350afcd5115d7b 100644 (file)
@@ -170,7 +170,7 @@ include "logic/equality.ma".
 
 (* -------------------------------------------------------------------------- *)
 ntheorem prove_distrnu:
- ∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
(∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
 ∀a:Univ.
 ∀b:Univ.
 ∀c:Univ.
@@ -193,36 +193,36 @@ ntheorem prove_distrnu:
 ∀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 (least_upper_bound a (greatest_lower_bound b c)) (greatest_lower_bound (least_upper_bound a b) (least_upper_bound a c))
+∀H14:∀X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound a (greatest_lower_bound b c)) (greatest_lower_bound (least_upper_bound a b) (least_upper_bound a c)))
 .
-#Univ.
-#X.
-#Y.
-#Z.
-#a.
-#b.
-#c.
-#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 ##.
+#c ##.
+#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.
 
 (* -------------------------------------------------------------------------- *)