Warning : “Set this option from the IDE menu instead” in coq...

Concatenation of 2 lists in lambda-calculus...

Number of element in a list in lambd-calculus?...

how to create a polymorphe couple such as "( a : type A, b : type B ) " in lambda-calculus...

Creating Coq tactic: how to use a newly generated name?...

Why does Coq remove/clear my asserted lemmas in my proof after the base case is proved?...

How can I rewrite "+ 1" (plus one) to "S" (succ) in Coq?...

What is the right proof term so that the ssreflect tutorial work with the exact: hAiB example?...

How do you lookup the definition or implementation of Coq proof tactics?...

Proving Binary Tree Properties...

coq: Tactic to replace true hypothesis in 'and' statement...

Tactic for existential hypothesis...

Curly brace proof syntax: begin x. = { auto } y. []...

Why does this Coq Definition fail? Coq Namespace error for Inductive Type...

Problem with Dependent pattern matching in COQ...

Remove useless hypothesis from context...

How do you selectively simplify arguments to each time a function is called, without evaluating the ...

Are arrows in Coq aliases of universal quantifications?...

Coq: goal is just a type (when using theorems with unnecessary arguments)...

Coq: prove while is equivalent to repeat...

How to use HoTT path induction in Coq?...

"False" in goal: is that a an indication I am doing something wrong?...

Best practices for parametrized Coq libraries...

How to prove that another definition of permutation is the same as the Default Permutation Library f...

Coq: How are the equality tacticts symmetry and transitivity defined?...

Coq - Rewriting a FMap Within a Relation...

Coq: Cannot infer an internal placeholder of type "nat" in environment: ev : nat -> Pro...

Coq - Obtaining equality from match statement...

Problems adding new notation in Coq...

Proof of "less equal" transitive law in Coq...