coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: Adam Chlipala <adamc AT hcoop.net>
- To: fdabrows AT irisa.fr
- Cc: coq-club AT pauillac.inria.fr
- Subject: Re: [Coq-Club] Proof Help
- Date: Mon, 13 Apr 2009 15:28:24 -0400
- List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>
fdabrows AT irisa.fr
wrote:
Hello,ask but I am hoping someone can help me. I am having trouble with what I
I am fairly new to Coq and I am not sure if this is the right place to
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. ;-)
- [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.