Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] proof of overflow resistance adder

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] proof of overflow resistance adder


Chronological Thread 
  • From: Laurent Thery <Laurent.Thery AT inria.fr>
  • To: coq-club AT inria.fr
  • Subject: Re: [Coq-Club] proof of overflow resistance adder
  • Date: Wed, 7 Feb 2018 11:09:58 +0100



On 02/07/2018 10:56 AM,
fritjof AT uni-bremen.de
wrote:
> Can someone point me into the right direction or do I oversee something?

you have to prove an equivalence A <-> B, a way to do it is to prove A
-> B and B -> A. This is done by split


One direction is easy if None = Some _ -> _

this assumption is impossible , using the tactic discriminate for example


In the other direction we have a context that is contradictory
something like

h1 : a < b
h2 : b <= c

In this case you can point the contradiction by using the tactic
contradict (ccontradict h1 or contradict h2)

and use a theorem about order and negation.

Search _ (_ <= _) (~ _).


--
Laurent



Archive powered by MHonArc 2.6.18.

Top of Page