Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] making a proof done with assert transparent

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] making a proof done with assert transparent


Chronological Thread 
  • From: Daniel de Rauglaudre <daniel.de_rauglaudre AT inria.fr>
  • To: coq-club AT inria.fr
  • Subject: Re: [Coq-Club] making a proof done with assert transparent
  • Date: Mon, 12 Oct 2015 14:12:16 +0200

Ah yes, exactly what I meant in my previous message. Then what I need.
I do that.

On Mon, Oct 12, 2015 at 02:06:57PM +0200, Pierre-Marie Pédrot wrote:
> On 12/10/2015 13:39, Daniel de Rauglaudre wrote:
> > When I end an assert, the type is put in the hypotheses, but not the
> > proof term. For example, when I write
> > assert (p : 2 + 2 = 4) by reflexivity.
> > the line
> > p : 2 + 2 = 4
> > is added in the hypotheses but not the contains of p.
> >
> > I would like to have the proof term also, i.e.:
> > p := eq_refl 4 : 2 + 2 = 4
>
> If you're using 8.5, you can use the refine tactic as follows.
>
> refine (let p : 2 + 2 = 4 := _ in _).
>
> With a bit of tactic notations, you should be able to simulate a
> transparent assert. Actually, this has been requested already:
>
> https://coq.inria.fr/bugs/show_bug.cgi?id=3551

--
Daniel de Rauglaudre
http://pauillac.inria.fr/~ddr/



Archive powered by MHonArc 2.6.18.

Top of Page