From 99be46eb50213d1f35dfc4d30f35760ad5e75621 Mon Sep 17 00:00:00 2001 From: Hugo Herbelin Date: Fri, 1 Aug 2014 14:39:51 +0200 Subject: More proofs independent of the names generated by induction/elim over a dependent elimination principle for Prop arguments. --- plugins/micromega/ZCoeff.v | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) (limited to 'plugins/micromega/ZCoeff.v') diff --git a/plugins/micromega/ZCoeff.v b/plugins/micromega/ZCoeff.v index e30295e6a..d65c60167 100644 --- a/plugins/micromega/ZCoeff.v +++ b/plugins/micromega/ZCoeff.v @@ -41,19 +41,19 @@ Notation "x < y" := (rlt x y). Lemma req_refl : forall x, req x x. Proof. - destruct sor.(SORsetoid). + destruct sor.(SORsetoid) as (Equivalence_Reflexive,_,_). apply Equivalence_Reflexive. Qed. Lemma req_sym : forall x y, req x y -> req y x. Proof. - destruct sor.(SORsetoid). + destruct sor.(SORsetoid) as (_,Equivalence_Symmetric,_). apply Equivalence_Symmetric. Qed. Lemma req_trans : forall x y z, req x y -> req y z -> req x z. Proof. - destruct sor.(SORsetoid). + destruct sor.(SORsetoid) as (_,_,Equivalence_Transitive). apply Equivalence_Transitive. Qed. -- cgit v1.2.3