### coq

Coq - dependent type error in rewrite

Is it possible to jointly recurse on a pair of variables in Coq?

How to repeat proof tactics in case in Coq?

How to formalize the termination of a term reduction relation in Coq?

Coq losing information from if-statement when doing recursive function with Program

Coq: remove constructor from both sides of goal

Split conjunction goal into subgoals

Idiomatically expressing “The Following Are Equivalent” in Coq

What are the possible ways to define parallel composition in Coq apart from using list?

Defining a finite automata Coq

Proving even + even = even with mutual induction using tactics

Rewriting hypothesis with a more concrete expression

Coq rewriting using lambda arguments

How to rewrite a goal using function definition?

coqtop -lv (version 8.6) no longer displaying proof subgoals?

Coq beginner - Prove a basic lemma

How to do induction differently?

Is is possible to implement a Coq tactic that inspects a HintDb? If so, how?

Need help on proving proposition in Coq

A special case of Lob's theorem using Coq

How can I implement a coq tactic that iterates over the hypotheses?

How can I automate counting within proofs in Coq?

How to get data from an inductive type Coq

Proof that references the conclusion of a previous proof in Coq

Problems with dependent types in Coq proof assistant

Proof on booleans, false = true

How to define finite set of N elements in Coq?

Proof involving unfolding two recursive functions in COQ

Proving using contradiction technique

Coq how to pretty-print a term constructed using tactics?

No implicits in dependent “match” pattern with ssreflect

Getting a stronger induction principle in Coq

Stuck in infinite inversion loop Coq

Example for different equality proofs

apply tactic cannot find an instance for a variable

Introducing new hypothesis in the premises

Adding complete disjunctive assumption in Coq

Can´t destruct exists in hypothesis

Re-writing without using symmetry tactic

Inversion on large types with impredicative-set enabled

How does the discriminate tactic work?

Smart modification of Coq environment

Lexicographical comparison of tuples of nats

Multiple Where-clauses for Reserved Notation in Coq?

Writing well-founded programs in Coq using Fix or Program Fixpoint

Pigeonhole proof without decidable equality or excluded middle

Can I use a notation for an Inductive type to define that type in Coq?

Applying apply tactic to premises instead of the goal

Coq Real numbers -lexing and parsing 3.14

Supplying section arguments for examples

Definition function without using a helper function

Coquelicot library for basic undergraduate calculus

### Related Links

Simple identity in Coq

Unfold a notation within a scope

Error: Cannot coerce to an evaluable reference in coq

Proof in COQ that equality is reflexivity

How to express “there exists a unique X” in Coq?

Step by step simplification in coq?

Typeclass resolution and autorewrite

Need finding the right tactic over Int.lt

'else' in definitions - Coq

Solving equality / inequality in goal, coq code

Where did lt_index go?

How to unfold a Coq Fixpoint literally

Coq: Insufficient Justification error

How to express subset relation in Coq?

What is the downside of using functional extensionality in COQ

What's the difference between well-founded induction and recursion in Coq.Init.Wf?