coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: Guillaume Melquiond <guillaume.melquiond AT inria.fr>
- To: coq-club AT inria.fr
- Subject: Re: [Coq-Club] setoid rewriting on arrow types
- Date: Wed, 10 Dec 2014 23:03:45 +0100
On 10/12/2014 20:04, Vadim Zaliva wrote:
Lemma test (A:Type) `{Setoid A, Mult A} (x:A):
equiv (testF A A (mult x)) (testF A A (fun (x0:A) => mult x x0)) .
Proof.
setoid_replace (fun (x0:A) => mult x x0) with (mult x).
Qed.
How one would define Proper instance to make this possible?
It looks like I need something like FunctionalExtensionality.
Thanks!
P.S. Obviously this is artificial example just to demonstrate the kind
of rewriting I am trying to do.
You presumably simplified your example too much, because this is a case of eta-conversion. So the "change" tactic will happily do the replacement. You do not need any setoid rewriting there.
Best regards,
Guillaume
- [Coq-Club] setoid rewriting on arrow types, Vadim Zaliva, 12/10/2014
- Re: [Coq-Club] setoid rewriting on arrow types, Guillaume Melquiond, 12/10/2014
- Re: [Coq-Club] setoid rewriting on arrow types, Vadim Zaliva, 12/10/2014
- Re: [Coq-Club] setoid rewriting on arrow types, Vadim Zaliva, 12/10/2014
- Re: [Coq-Club] setoid rewriting on arrow types, Guillaume Melquiond, 12/11/2014
- Re: [Coq-Club] setoid rewriting on arrow types, Vadim Zaliva, 12/11/2014
- Re: [Coq-Club] setoid rewriting on arrow types, Vadim Zaliva, 12/12/2014
- Re: [Coq-Club] setoid rewriting on arrow types, Guillaume Melquiond, 12/12/2014
- Re: [Coq-Club] setoid rewriting on arrow types, Vadim Zaliva, 12/12/2014
- Re: [Coq-Club] setoid rewriting on arrow types, Guillaume Melquiond, 12/12/2014
- Re: [Coq-Club] setoid rewriting on arrow types, Vadim Zaliva, 12/10/2014
- Re: [Coq-Club] setoid rewriting on arrow types, Guillaume Melquiond, 12/10/2014
Archive powered by MHonArc 2.6.18.