coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: Guillaume Melquiond <guillaume.melquiond AT inria.fr>
- To: coq-club AT inria.fr
- Subject: Re: [Coq-Club] Newbie question on dependent well founded recursion
- Date: Tue, 29 Jun 2010 09:26:37 +0200
Le 29/06/2010 08:52, Sidi a écrit :
> With this definition of div_aux, my question is how can I proof this
> simple lemma :
>
> Lemma div0 : forall y (H : Acc lt 0), div_aux 0 y H = 0.
> Proof.
> intros.
You have to destruct H, yet it appears in a dependent position in the
goal, so
now dependent inversion H.
Best regards,
Guillaume
- [Coq-Club] Newbie question on dependent well founded recursion, Sidi
- Re: [Coq-Club] Newbie question on dependent well founded recursion, Guillaume Melquiond
- Re: [Coq-Club] Newbie question on dependent well founded recursion, Jean-Francois Monin
- Re: [Coq-Club] Newbie question on dependent well founded recursion, David Pichardie
- Re: [Coq-Club] Newbie question on dependent well founded recursion, David Pichardie
Archive powered by MhonArc 2.6.16.