X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Flibrary%2Flogic%2Fequality.ma;h=c26449c4261595031deaf05fd8b104816a384c18;hb=09a8511f70bc21c74beff39700dbbe01b2bf3235;hp=0675edc76bb94eb3144b905dbee0eb76da522119;hpb=6d32e0d926eabf01e941290399b8d6b0b812ecfa;p=helm.git

diff --git a/matita/library/logic/equality.ma b/matita/library/logic/equality.ma
index 0675edc76..c26449c42 100644
--- a/matita/library/logic/equality.ma
+++ b/matita/library/logic/equality.ma
@@ -60,23 +60,23 @@ theorem eq_elim_r:
 intros. elim (sym_eq ? ? ? H1).assumption.
 qed.
 
-default "equality"
- cic:/matita/logic/equality/eq.ind
- cic:/matita/logic/equality/sym_eq.con
- cic:/matita/logic/equality/trans_eq.con
- cic:/matita/logic/equality/eq_ind.con
- cic:/matita/logic/equality/eq_elim_r.con. 
- 
 theorem eq_f: \forall  A,B:Type.\forall f:A\to B.
 \forall x,y:A. x=y \to f x = f y.
 intros.elim H.reflexivity.
 qed.
 
-theorem eq_f1: \forall  A,B:Type.\forall f:A\to B.
-\forall x,y:A. x=y \to f y = f x.
-intros.elim H.reflexivity.
-qed.
+coercion cic:/matita/logic/equality/sym_eq.con.
+coercion cic:/matita/logic/equality/eq_f.con.
 
+default "equality"
+ cic:/matita/logic/equality/eq.ind
+ cic:/matita/logic/equality/sym_eq.con
+ cic:/matita/logic/equality/trans_eq.con
+ cic:/matita/logic/equality/eq_ind.con
+ cic:/matita/logic/equality/eq_elim_r.con
+ cic:/matita/logic/equality/eq_f.con
+ cic:/matita/logic/equality/eq_OF_eq.con. (* \x.sym (eq_f x) *)
+ 
 theorem eq_f2: \forall  A,B,C:Type.\forall f:A\to B \to C.
 \forall x1,x2:A. \forall y1,y2:B.
 x1=x2 \to y1=y2 \to f x1 y1 = f x2 y2.