coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: Rui Baptista <rpgcbaptista AT gmail.com>
- To: Adam Chlipala <adamc AT csail.mit.edu>
- Cc: "coq-club AT inria.fr" <coq-club AT inria.fr>
- Subject: Re: [Coq-Club] eq_rect_eq can be proved
- Date: Mon, 21 Oct 2013 02:05:33 +0100
Oops... My bad. I didn't realize JMeq_rect had been tampered with.
On Mon, Oct 21, 2013 at 1:53 AM, Adam Chlipala <adamc AT csail.mit.edu> wrote:
On 10/20/2013 08:50 PM, Rui Baptista wrote:Try running [Print Assumptions] on some of your definitions. Even this first one is already depending on the axiom [JMeq_eq], which is used to define [JMeq_rect].
I'm confused. Why does it say it can't be proved in chapter "Reasoning About Equality Proofs" of "Certified Programming with Dependent Types".
Require Import JMeq.
Definition jmeq_eq : forall (t1 : Type) (x1 x2 : t1), JMeq x1 x2 -> x1 = x2.
Proof.
refine (fun t1 x1 => _).
refine (JMeq_rect _ _).
refine eq_refl.
Defined.
- [Coq-Club] eq_rect_eq can be proved, Rui Baptista, 10/21/2013
- Re: [Coq-Club] eq_rect_eq can be proved, Adam Chlipala, 10/21/2013
- Re: [Coq-Club] eq_rect_eq can be proved, Rui Baptista, 10/21/2013
- Re: [Coq-Club] eq_rect_eq can be proved, Adam Chlipala, 10/21/2013
Archive powered by MHonArc 2.6.18.