What is Isabelle/HOL command for Compute in Coq?...

Infinite recursive types in Coq (for Bananas and Lenses)...

How to define an affine set in coq...

Coq: Proving relation between < and ≤...

Coq: Proving simple theorem using Fixpoints and Induction...

Software Foundations: proving leb_complete and leb_correct...

Logic: auxilliry lemma for tr_rev_correct...

Tactics: stuck in eqb_trans...

Using a 3 symbols notation [constr:operconstr] expected after [constr:operconstr]...

proof Lemma which based on Fixpoint definitions...

Solving linear equation systems in Coq...

Proof Process busy on combine_split...

How to prove `(fun _ : nat => False) = Empty_set nat` in Coq?...

Induction on a datatype with non-uniform type parameters produces ill-typed terms...

Simpler proof of `0<a -> 1<a+1`...

How to reason across equality proofs?...

How to use 'apply ... with' and 'apply ... in' together?...

How can I create a polymorphic "map xs f" function?...

Trouble in implementing dependently typed lookup in Coq using Equations...

Coq: Create a super-type of boolean and nat...

Defining recursive function over product type...

DeMorgan's law for quantifiers in Coq...

Proving that a reversible list is a palindrome in Coq...

Lemma about list and rev(list)...

How to set implicit parameters for constructor...

How to avoid necessity to put module prefix...

Understanding specialize tactic...

Coq: About "%" and "mod" as a notation symbol...

I want to prove some properties about list, but am stuck at induction...

use module signature definition in module implementation...