Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] Proof Help

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] Proof Help


chronological Thread 
  • From: Roman Beslik <beroal AT ukr.net>
  • 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 10:49:45 +0300
  • List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>

Adam Chlipala wrote:
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. ;-)
It is new in Coq version 8.2, isn't it?

--
Best regards,
 Roman Beslik.





Archive powered by MhonArc 2.6.16.

Top of Page