coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: Victor Porton <porton AT narod.ru>
- To: Coq <coq-club AT inria.fr>
- Subject: [Coq-Club] Replacing dependent structure condtions
- Date: Mon, 07 Nov 2011 02:44:14 +0400
- Envelope-from: porton AT yandex.ru
Let we have some dependent structure. I want several instance proofs every of
which requires a DIFFERENT but equivalent condition instead of a condition
specified in the dependent structure.
How to refactor these several proofs to refer to the different condition
instead of the condition specified in the definition of dependent structure?
An example to be clear:
[[[[
Parameter A: nat->Prop.
Parameter B: nat->Prop.
Axiom First: B O = True.
Axiom Second: B O <-> A O.
Class C := {
x: nat;
a: A x
}.
Instance I: C := { x:=O }.
Proof.
Admitted.
]]]]
Here I want to base the proof of I on the axiom First (that is on the
condition B instead of the condition A which appears in the definition of the
structure).
You may imagine that I want to prove it for several instances (in the script
above we have only one instance I, for an example).
--
Victor Porton - http://portonvictor.org
- [Coq-Club] Replacing dependent structure condtions, Victor Porton
- Re: [Coq-Club] Replacing dependent structure condtions, Gregory Malecha
Archive powered by MhonArc 2.6.16.