coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: Adam Chlipala <adamc AT hcoop.net>
- To: Balazs Vegvari <balazs.vegvari AT gmail.com>
- Cc: coq-club AT pauillac.inria.fr
- Subject: Re: [Coq-Club] newbie question
- Date: Wed, 27 Aug 2008 18:06:51 -0400
- List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>
Balazs Vegvari wrote:
I am just learning coq and I don't kow how to prove this:
forall x y : Z, x <= y + 1 -> x <= y \/ x = y + 1
Any suggestion is welcome.
Did you have a particular constraint on the proof technique in mind? Your theorem statement falls into the theory of "quantifier-free linear arithmetic," which is one of the most widely-used decidable theories. The [omega] tactic solves it instantly (after [intros]).
- [Coq-Club] newbie question, Balazs Vegvari
- Re: [Coq-Club] newbie question, Adam Chlipala
- Re: [Coq-Club] newbie question,
Balazs Vegvari
- Re: [Coq-Club] newbie question,
Balazs Vegvari
- Re: [Coq-Club] newbie question, Adam Chlipala
- Re: [Coq-Club] newbie question,
Yves Bertot
- Re: [Coq-Club] newbie question, Frédéric Besson
- Re: [Coq-Club] newbie question,
Balazs Vegvari
- Re: [Coq-Club] newbie question,
Balazs Vegvari
- Re: [Coq-Club] newbie question, Adam Chlipala
Archive powered by MhonArc 2.6.16.