theorem eq_elim_r:
\forall A:Type.\forall x:A. \forall P: A \to Prop.
P x \to \forall y:A. y=x \to P y.
-intros. elim sym_eq ? ? ? H1.assumption.
+intros. elim (sym_eq ? ? ? H1).assumption.
qed.
default "equality"
x1=x2 \to y1=y2 \to f x1 y1 = f x2 y2.
intros.elim H1.elim H.reflexivity.
qed.
+
+(*
+theorem a:\forall x.x=x\land True.
+[
+2:intros;
+ split;
+ [
+ exact (refl_eq Prop x);
+ |
+ exact I;
+ ]
+1:
+ skip
+]
+qed.
+*)
+