]> matita.cs.unibo.it Git - helm.git/blobdiff - helm/software/matita/contribs/ng_TPTP/GRP147-1.ma
tacticals are really tactics now, they have an AST at the same level of
[helm.git] / helm / software / matita / contribs / ng_TPTP / GRP147-1.ma
index 3a13169d6a5f46648e2efcff593d90cc585a5536..1e1696011a0a0695e47999485f5e5a1840983e7b 100644 (file)
@@ -172,7 +172,7 @@ include "logic/equality.ma".
 
 (* -------------------------------------------------------------------------- *)
 ntheorem prove_ax_lub1b:
- ∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
(∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
 ∀a:Univ.
 ∀b:Univ.
 ∀c:Univ.
@@ -197,38 +197,38 @@ ntheorem prove_ax_lub1b:
 ∀H13:∀X:Univ.∀Y:Univ.eq Univ (greatest_lower_bound X Y) (greatest_lower_bound Y X).
 ∀H14:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (multiply (multiply X Y) Z) (multiply X (multiply Y Z)).
 ∀H15:∀X:Univ.eq Univ (multiply (inverse X) X) identity.
-∀H16:∀X:Univ.eq Univ (multiply identity X) X.eq Univ (greatest_lower_bound (least_upper_bound a b) c) (least_upper_bound a b)
+∀H16:∀X:Univ.eq Univ (multiply identity X) X.eq Univ (greatest_lower_bound (least_upper_bound a b) c) (least_upper_bound a b))
 .
-#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.
-#H15.
-#H16.
-nauto by H0,H1,H2,H3,H4,H5,H6,H7,H8,H9,H10,H11,H12,H13,H14,H15,H16;
+#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 ##.
+#H15 ##.
+#H16 ##.
+nauto by H0,H1,H2,H3,H4,H5,H6,H7,H8,H9,H10,H11,H12,H13,H14,H15,H16 ##;
 nqed.
 
 (* -------------------------------------------------------------------------- *)