(* -------------------------------------------------------------------------- *)
ntheorem prove_fixed_point:
- ∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
+ (∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
∀apply:∀_:Univ.∀_:Univ.Univ.
∀combinator:Univ.
∀o:Univ.
∀q1:Univ.
∀H0:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (apply (apply (apply q1 X) Y) Z) (apply X (apply Z Y)).
-∀H1:∀X:Univ.∀Y:Univ.eq Univ (apply (apply o X) Y) (apply Y (apply X Y)).∃Y:Univ.eq Univ Y (apply combinator Y)
+∀H1:∀X:Univ.∀Y:Univ.eq Univ (apply (apply o X) Y) (apply Y (apply X Y)).∃Y:Univ.eq Univ Y (apply combinator Y))
.
-#Univ.
-#X.
-#Y.
-#Z.
-#apply.
-#combinator.
-#o.
-#q1.
-#H0.
-#H1.
-napply ex_intro[
-nid2:
-nauto by H0,H1;
-nid|
-skip]
+#Univ ##.
+#X ##.
+#Y ##.
+#Z ##.
+#apply ##.
+#combinator ##.
+#o ##.
+#q1 ##.
+#H0 ##.
+#H1 ##.
+napply (ex_intro ? ? ? ?) ##[
+##2:
+nauto by H0,H1 ##;
+##| ##skip ##]
nqed.
(* -------------------------------------------------------------------------- *)