(* -------------------------------------------------------------------------- *)
-(* File : COL052-1 : TPTP v3.2.0. Released v1.0.0. *)
+(* File : COL052-1 : TPTP v3.7.0. Released v1.0.0. *)
(* Domain : Combinatory Logic *)
(* ---- -(response(A,v) = response(odd_bird,v)). *)
ntheorem prove_a_is_agreeable:
- ∀Univ:Type.∀V:Univ.∀W:Univ.∀X:Univ.∀Y:Univ.
+ (∀Univ:Type.∀V:Univ.∀W:Univ.∀X:Univ.∀Y:Univ.
∀a:Univ.
∀c:Univ.
∀common_bird:∀_:Univ.Univ.
∀odd_bird:Univ.
∀response:∀_:Univ.∀_:Univ.Univ.
∀H0:∀X:Univ.eq Univ (response c (common_bird X)) (response X (common_bird X)).
-∀H1:∀W:Univ.∀X:Univ.∀Y:Univ.eq Univ (response (compose X Y) W) (response X (response Y W)).∃V:Univ.eq Univ (response a V) (response odd_bird V)
+∀H1:∀W:Univ.∀X:Univ.∀Y:Univ.eq Univ (response (compose X Y) W) (response X (response Y W)).∃V:Univ.eq Univ (response a V) (response odd_bird V))
.
-#Univ.
-#V.
-#W.
-#X.
-#Y.
-#a.
-#c.
-#common_bird.
-#compose.
-#odd_bird.
-#response.
-#H0.
-#H1.
-napply ex_intro[
-nid2:
-nauto by H0,H1;
-nid|
-skip]
+#Univ ##.
+#V ##.
+#W ##.
+#X ##.
+#Y ##.
+#a ##.
+#c ##.
+#common_bird ##.
+#compose ##.
+#odd_bird ##.
+#response ##.
+#H0 ##.
+#H1 ##.
+napply (ex_intro ? ? ? ?) ##[
+##2:
+nauto by H0,H1 ##;
+##| ##skip ##]
+ntry (nassumption) ##;
nqed.
(* ----C composes A with B. WHY is this here? *)