Skip to Content.
Sympa Menu

coq-club - [Coq-Club] Induction with seld-defined cases

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

[Coq-Club] Induction with seld-defined cases


chronological Thread 
  • From: Michael<michaelschausten AT googlemail.com>
  • To: coq-club AT inria.fr
  • Subject: [Coq-Club] Induction with seld-defined cases
  • Date: Wed, 1 Sep 2010 15:49:42 +0200

Hello,

I'd like to prove a Lemma (x : Z) with [induction x]. This gives me three
cases: x==0, x == Zpos p and x == Zneg p (p : positive).
However, I would like to have more self-defined cases, e.g.: x = Zneg p, x ==
0, 1 <= x <= 10, x == 11 and x > 11. I tried it with bindings (induction term
with bindings_list), but only received error. How can I do create those
self-defined cases?

Sincerely,



Archive powered by MhonArc 2.6.16.

Top of Page