(* -------------------------------------------------------------------------- *)
-(* File : COL007-1 : TPTP v3.2.0. Released v1.0.0. *)
+(* File : COL007-1 : TPTP v3.7.0. Released v1.0.0. *)
(* Domain : Combinatory Logic *)
(* -------------------------------------------------------------------------- *)
ntheorem prove_fixed_point:
- ∀Univ:Type.∀X:Univ.∀Y:Univ.
+ (∀Univ:Type.∀X:Univ.∀Y:Univ.
∀apply:∀_:Univ.∀_:Univ.Univ.
∀combinator:Univ.
∀l:Univ.
-∀H0:∀X:Univ.∀Y:Univ.eq Univ (apply (apply l X) Y) (apply X (apply Y Y)).∃Y:Univ.eq Univ Y (apply combinator Y)
+∀H0:∀X:Univ.∀Y:Univ.eq Univ (apply (apply l X) Y) (apply X (apply Y Y)).∃Y:Univ.eq Univ Y (apply combinator Y))
.
-#Univ.
-#X.
-#Y.
-#apply.
-#combinator.
-#l.
-#H0.
-napply ex_intro[
-nid2:
-nauto by H0;
-nid|
-skip]
+#Univ ##.
+#X ##.
+#Y ##.
+#apply ##.
+#combinator ##.
+#l ##.
+#H0 ##.
+napply (ex_intro ? ? ? ?) ##[
+##2:
+nauto by H0 ##;
+##| ##skip ##]
+ntry (nassumption) ##;
nqed.
(* -------------------------------------------------------------------------- *)