elim a.
clear a.left.left.
reflexivity.
-clear H.clear H1.clear a.right.
- exists.exact s.exists.exact s1.reflexivity.
clear H.clear a.left.right.
exists.exact s.reflexivity.
+clear H.clear H1.clear a.right.
+ exists.exact s.exists.exact s1.reflexivity.
qed.
theorem t: 0=0 \to stupidtype.
(\lambda a,b,K. y=a \to O=b \to
match K with [ (k a b p) \Rightarrow a ] = x)
? ? ? H).
+ goal 16.
simplify. intros.
generalize in match H1.
rewrite < H2; rewrite < H3.intro.