coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: fdabrows AT irisa.fr
- To: "Adam Chlipala" <adamc AT hcoop.net>
- Cc: fdabrows AT irisa.fr, coq-club AT pauillac.inria.fr
- Subject: Re: [Coq-Club] Proof Help
- Date: Tue, 14 Apr 2009 01:19:15 +0200 (CEST)
- Importance: Normal
- List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>
Yep, you're right, I should have mentioned that one as well.
Still, for learning purpose, one should first avoid
the use of automatizing tactics.
> fdabrows AT irisa.fr
> wrote:
>>> Hello,
>>>
>>> I am fairly new to Coq and I am not sure if this is the right place to
>>>
>> ask but I am hoping someone can help me. I am having trouble with what I
>> think should be a simple proof. I am trying to solve the following
>>
>>> forall x, P x^Q x |- (forall x Px) ^(forall x Qx)
>>>
>
> I feel like I should jump in and bring up that the built-in [firstorder]
> tactic solves this goal, so that's the right way to do it in real
> developments. ;-)
>
> --------------------------------------------------------
> Bug reports: http://logical.saclay.inria.fr/coq-bugs
> Archives: http://pauillac.inria.fr/pipermail/coq-club
> http://pauillac.inria.fr/bin/wilma/coq-club
> Info: http://pauillac.inria.fr/mailman/listinfo/coq-club
>
- [Coq-Club] Proof Help, emily_p
- Re: [Coq-Club] Proof Help, Luke Palmer
- Re: [Coq-Club] Proof Help, muad
- <Possible follow-ups>
- Re: [Coq-Club] Proof Help,
fdabrows
- Re: [Coq-Club] Proof Help,
Adam Chlipala
- Re: [Coq-Club] Proof Help, fdabrows
- Re: [Coq-Club] Proof Help,
Roman Beslik
- Re: [Coq-Club] Proof Help,
Thomas Braibant
- Re: [Coq-Club] Proof Help, Adam Chlipala
- Re: [Coq-Club] Proof Help, Roman Beslik
- Re: [Coq-Club] Proof Help, Adam Chlipala
- Re: [Coq-Club] Proof Help,
Thomas Braibant
- Re: [Coq-Club] Proof Help,
Adam Chlipala
Archive powered by MhonArc 2.6.16.