coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: Florian Haftmann <florian.haftmann AT informatik.tu-muenchen.de>
- To: coq-club AT pauillac.inria.fr
- Subject: Re: [Coq-Club] Cezar proof text transformation
- Date: Fri, 27 Mar 2009 10:23:32 +0100
- List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>
- Organization: TU München, Lehrstuhl Software and Systems Engineering
Hi Taral,
>> thus (S q + s = n)
>> using rewrite n_Sr; simpl; rewrite qsr; reflexivity.
>
> You probably need to have "by n_Sr, qsr". The using-clause only has
> the minimum number of assumptions available to it.
thanks for the answer. This doesn't work either.
I was thinking that
> focus on (S q + s = n). escape.
> rewrite n_Sr. simpl. rewrite qsr. reflexivity.
> return. end focus.
and
> thus (S q + s = n)
> using rewrite n_Sr; simpl; rewrite qsr; reflexivity.
are equivalent, or at least this is what I thought the documentation says.
It would be helpful to have an explicit hint what is going on here.
Thanks a lot again
Florian
--
Home:
http://wwwbroy.in.tum.de/~haftmann
PGP available:
http://home.informatik.tu-muenchen.de/haftmann/pgp/florian_haftmann_at_informatik_tu_muenchen_de
Attachment:
signature.asc
Description: OpenPGP digital signature
- [Coq-Club] Cezar proof text transformation, Florian Haftmann
- Re: [Coq-Club] Cezar proof text transformation,
Taral
- Re: [Coq-Club] Cezar proof text transformation, Florian Haftmann
- Re: [Coq-Club] Cezar proof text transformation,
Taral
- Re: [Coq-Club] Cezar proof text transformation, Florian Haftmann
- Re: [Coq-Club] Cezar proof text transformation,
Taral
- Re: [Coq-Club] Cezar proof text transformation, Florian Haftmann
- Re: [Coq-Club] Cezar proof text transformation,
Taral
Archive powered by MhonArc 2.6.16.