How to match a “match” expression?
Inverting an obviously untrue hypothesis does not prove falsehood
COQ gets wrong by proving “forall n:nat, ( n <= 0) -> n=0”
How can I do intros in a different order without using generalize dependent in Coq?
Defining isomorphism classes in Coq
How to prove (forall n m : nat, (n <? m) = false -> m <= n) in Coq?
How to do pseudo polynomial divisions in Coq/Ssreflect
How to prove functions equal, knowing their bodies are equal?
Using dependent types in Coq (safe nth function)
Case based proof using nat comparisons in COQ
Change a function at one point
Apply a function to both sides of an equality in Coq?
Coq induction start at specific nat
Extraction of Type Scheme
Contracting nested let statments
How to prove this simple equation in Coq