Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] Induction/destruct over a type with extra structure, redux

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] Induction/destruct over a type with extra structure, redux


chronological Thread 
  • From: Adam Chlipala <adamc AT csail.mit.edu>
  • To: "Edward Z. Yang" <ezyang AT MIT.EDU>
  • Cc: coq-club <coq-club AT inria.fr>
  • Subject: Re: [Coq-Club] Induction/destruct over a type with extra structure, redux
  • Date: Thu, 03 Nov 2011 17:52:54 -0400

Edward Z. Yang wrote:
Excerpts from Adam Chlipala's message of Thu Nov 03 16:27:13 -0400 2011:
This is a common issue that is usually solved by proving (inductively) lemmas with extra variables and equalities. In your example here, you could also prove [forall x y, cop' x y -> cop x y] and then derive [cop'_op] as an easy corollary of [cop_op].

OK, I could see how that works.  But barring a major benefit I would
probably not bother with cop' then, and always write out my equalities
in the long form...

That is one reasonable choice. I find the equality-free inductive type definitions easier to read, which makes it easier to convince yourself in the end that you proved the right theorem. For that reason, I favor extra work with lemmas and equalities.



Archive powered by MhonArc 2.6.16.

Top of Page