X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Flibrary%2Flegacy%2Fcoq.ma;h=9860c63e29137b8c4d1d409d6ac18486ea03574a;hb=69c5a60dfa385a3d0e270ed38eb0d970366792c5;hp=092a11c6ae3e7e38c7c6c083e55dc7a5c554ac56;hpb=5ae3baad87b9a92d0bc73192dfe2b4c82bd0b0ae;p=helm.git diff --git a/helm/software/matita/library/legacy/coq.ma b/helm/software/matita/library/legacy/coq.ma index 092a11c6a..9860c63e2 100644 --- a/helm/software/matita/library/legacy/coq.ma +++ b/helm/software/matita/library/legacy/coq.ma @@ -1,5 +1,5 @@ (**************************************************************************) -(* ___ *) +(* ___ *) (* ||M|| *) (* ||A|| A project by Andrea Asperti *) (* ||T|| *) @@ -19,9 +19,9 @@ default "equality" cic:/Coq/Init/Logic/sym_eq.con cic:/Coq/Init/Logic/trans_eq.con cic:/Coq/Init/Logic/eq_ind.con - cic:/Coq/Init/Logic/eq_ind_r.con - cic:/Coq/Init/Logic/f_equal.con - cic:/Coq/Init/Logic/f_equal1.con. + cic:/Coq/Init/Logic/eq_ind_r.con + cic:/Coq/Init/Logic/f_equal.con + cic:/matita/legacy/coq/f_equal1.con. default "true" cic:/Coq/Init/Logic/True.ind. @@ -75,22 +75,16 @@ interpretation "Coq's not equal to (leibnitz)" 'neq x y = (cic:/Coq/Init/Logic/n interpretation "Coq's natural 'not less or equal than'" 'nleq x y = (cic:/Coq/Init/Logic/not.con (cic:/Coq/Init/Peano/le.ind#xpointer(1/1) x y)). - + +theorem f_equal1 : \forall A,B:Type.\forall f:A\to B.\forall x,y:A. + x = y \to (f y) = (f x). + intros. + symmetry. + apply cic:/Coq/Init/Logic/f_equal.con. + assumption. +qed. (* aliases *) -alias id "or" = "cic:/Coq/Init/Logic/or.ind#xpointer(1/1)". -alias id "nat" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1)". -alias id "eq" = "cic:/Coq/Init/Logic/eq.ind#xpointer(1/1)". -alias id "plus" = "cic:/Coq/Init/Peano/plus.con". -alias id "le_trans" = "cic:/Coq/Arith/Le/le_trans.con". -alias id "le_plus_r" = "cic:/Coq/Arith/Plus/le_plus_r.con". -alias id "le" = "cic:/Coq/Init/Peano/le.ind#xpointer(1/1)". - -(* theorems *) - -theorem f_equal1 : - \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. +(* FG: This is because "and" is a reserved keyword of the parser *) +alias id "land" = "cic:/Coq/Init/Logic/and.ind#xpointer(1/1)".