coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: Adam Chlipala <adamc AT hcoop.net>
- To: Edsko de Vries <devriese AT cs.tcd.ie>
- Cc: coq-club <coq-club AT pauillac.inria.fr>
- Subject: Re: [Coq-Club] Dependent rewrite question (probably simple answer! :)
- Date: Fri, 20 Feb 2009 10:11:14 -0500
- List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>
Edsko de Vries wrote:
Thanks for taking the time to reply. However, I'm not sure your answer generalizes to the real proof I'm attempting, since you are taking advantage of the fact that I only introduced one constructor for T.
Here's a proof of [bar] that uses your [a_is_b]:
Lemma bar : X (U + 1 - 1) b = X U a.
generalize a_is_b; generalize b; rewrite foo;
intros; match goal with
| [ H : _ |- _ ] => rewrite H
end; reflexivity.
Qed.
- [Coq-Club] Dependent rewrite question (probably simple answer! :), Edsko de Vries
- Re: [Coq-Club] Dependent rewrite question (probably simple answer! :),
Adam Chlipala
- Re: [Coq-Club] Dependent rewrite question (probably simple answer! :),
Edsko de Vries
- Re: [Coq-Club] Dependent rewrite question (probably simple answer! :), Adam Chlipala
- Re: [Coq-Club] Dependent rewrite question (probably simple answer! :),
Edsko de Vries
- Re: [Coq-Club] Dependent rewrite question (probably simple answer! :),
Adam Chlipala
Archive powered by MhonArc 2.6.16.