(* -------------------------------------------------------------------------- *)
-(* File : COL053-1 : TPTP v3.2.0. Released v1.0.0. *)
+(* File : COL053-1 : TPTP v3.7.0. Released v1.0.0. *)
(* Domain : Combinatory Logic *)
(* ---- -[(u)f(u) = A(B((C)f(u)))]. *)
ntheorem prove_bird_exists:
- ∀Univ:Type.∀U:Univ.∀W:Univ.∀X:Univ.∀Y:Univ.
+ (∀Univ:Type.∀U:Univ.∀W:Univ.∀X:Univ.∀Y:Univ.
∀a:Univ.
∀b:Univ.
∀c:Univ.
∀compose:∀_:Univ.∀_:Univ.Univ.
∀f:∀_:Univ.Univ.
∀response:∀_:Univ.∀_:Univ.Univ.
-∀H0:∀W:Univ.∀X:Univ.∀Y:Univ.eq Univ (response (compose X Y) W) (response X (response Y W)).∃U:Univ.eq Univ (response U (f U)) (response a (response b (response c (f U))))
+∀H0:∀W:Univ.∀X:Univ.∀Y:Univ.eq Univ (response (compose X Y) W) (response X (response Y W)).∃U:Univ.eq Univ (response U (f U)) (response a (response b (response c (f U)))))
.
-#Univ.
-#U.
-#W.
-#X.
-#Y.
-#a.
-#b.
-#c.
-#compose.
-#f.
-#response.
-#H0.
-napply ex_intro[
-nid2:
-nauto by H0;
-nid|
-skip]
+#Univ ##.
+#U ##.
+#W ##.
+#X ##.
+#Y ##.
+#a ##.
+#b ##.
+#c ##.
+#compose ##.
+#f ##.
+#response ##.
+#H0 ##.
+napply (ex_intro ? ? ? ?) ##[
+##2:
+nauto by H0 ##;
+##| ##skip ##]
+ntry (nassumption) ##;
nqed.
(* -------------------------------------------------------------------------- *)