Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] How to talk about a restricted set of an inductive?

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] How to talk about a restricted set of an inductive?


Chronological Thread 
  • From: Robbert Krebbers <mailinglists AT robbertkrebbers.nl>
  • To: Fabien Renaud <Fabien.Renaud AT inria.fr>
  • Cc: coq-club AT inria.fr
  • Subject: Re: [Coq-Club] How to talk about a restricted set of an inductive?
  • Date: Thu, 03 Oct 2013 13:49:06 +0200

On 10/03/2013 01:40 PM, Fabien Renaud wrote:
I know that in my example the property is not true in general.

I would like to know if there is a way to restrict the statement on
NList_ which have been created by NList (for which the statement is true).
You should probably give a more illustrative example. Here, any sensible restriction is the same as the property you wish to prove.

The best result you well get in this case is:

Goal forall A (l : list A) n, NList_ n l -> n <= length l.
Proof. induction 1; simpl; auto with arith. Qed.



Archive powered by MHonArc 2.6.18.

Top of Page