From e1e0f4f7f3c549fd3d5677b67c6b13ed687e6f12 Mon Sep 17 00:00:00 2001 From: Hugo Herbelin Date: Tue, 3 Jun 2014 17:15:40 +0200 Subject: Make standard library independent of the names generated by induction/elim over a dependent elimination principle for Prop arguments. --- theories/Program/Subset.v | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'theories/Program') diff --git a/theories/Program/Subset.v b/theories/Program/Subset.v index 35521ec6d..10561aaa2 100644 --- a/theories/Program/Subset.v +++ b/theories/Program/Subset.v @@ -65,8 +65,8 @@ Ltac pi := repeat f_equal ; apply proof_irrelevance. Lemma subset_eq : forall A (P : A -> Prop) (n m : sig P), n = m <-> `n = `m. Proof. - induction n. - induction m. + destruct n as (x,p). + destruct m as (x',p'). simpl. split ; intros ; subst. -- cgit v1.2.3