(* -------------------------------------------------------------------------- *)
-(* File : BOO033-1 : TPTP v3.2.0. Released v2.2.0. *)
+(* File : BOO033-1 : TPTP v3.7.0. Released v2.2.0. *)
(* Domain : Boolean Algebra *)
(* ----A simple propery of Boolean Algebra fails to hold. *)
ntheorem prove_inverse_involution:
- ∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
+ (∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
∀a:Univ.
∀add:∀_:Univ.∀_:Univ.Univ.
∀inverse:∀_:Univ.Univ.
∀H3:∀X:Univ.∀Y:Univ.eq Univ (multiply (add X (inverse X)) Y) Y.
∀H4:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (add (add (multiply X Y) (multiply Y Z)) Y) Y.
∀H5:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (add X (multiply Y (multiply X Z))) X.
-∀H6:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (add (multiply X Y) (add (multiply Y Z) (multiply Z X))) (multiply (add X Y) (multiply (add Y Z) (add Z X))).eq Univ (inverse (inverse a)) a
+∀H6:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (add (multiply X Y) (add (multiply Y Z) (multiply Z X))) (multiply (add X Y) (multiply (add Y Z) (add Z X))).eq Univ (inverse (inverse a)) a)
.
-#Univ.
-#X.
-#Y.
-#Z.
-#a.
-#add.
-#inverse.
-#multiply.
-#H0.
-#H1.
-#H2.
-#H3.
-#H4.
-#H5.
-#H6.
-nauto by H0,H1,H2,H3,H4,H5,H6;
+#Univ ##.
+#X ##.
+#Y ##.
+#Z ##.
+#a ##.
+#add ##.
+#inverse ##.
+#multiply ##.
+#H0 ##.
+#H1 ##.
+#H2 ##.
+#H3 ##.
+#H4 ##.
+#H5 ##.
+#H6 ##.
+nauto by H0,H1,H2,H3,H4,H5,H6 ##;
+ntry (nassumption) ##;
nqed.
(* -------------------------------------------------------------------------- *)