### coq

Agda-like programming in Coq/Proof General?

{assumption, apply, intro} is sufficient for min prop logic

How to build a function implicitly in Coq?

How can I read Coq's definition of proj1_sig?

Pattern-match on type in order to implement equality for existentially typed constructor in Coq

Coq eapply generates a goal with a question mark while proving existence of a function

Universe inconsistency (because of strict positivity restriction?)

Why is it impossible to perform induction on a term that is used in conclusion?

How to destruct a exist in goal for coq

Stronger completeness axiom for real numbers in Coq

When is the first input to `list_rec` not a constant function?

what does the colon greater than sign mean in coq

Prove that a sequence of steps terminates

How to leverage auto's searching and hint databases in custom tactics?

How to use auto with repeat in custom tactics?

How to use Coq GenericMinMax to prove facts about the reals

Break “forall” hypothesis with conjunctions up into components?

How to write coq definitions with “subtypes”

Getting access to Coq's rich XML-like AST output

Define a 'head' for coinductive type stream in Coq(without pattern matching)

How to print all the defined symbols in Coq?

How can we use relational definition in proofs in Coq?

Stuck on a simple proof about regular expressions

How to prove the arithmetic equality `3 * S (i + j) + 1 = S (3 * i + 1) + S (3 * j + 1)` in Coq?

How to apply a rewrite to the right side of a conditional without splitting on it?

All-quantified type variable in (value) constructor cannot be explicitly typed as wanted

Coq: Remove all (nested) parentheses from a sum

How to prove binary commutavity with a different definition of bin?

Coq's mathematical proof language: Rewriting in if condition

How do Structures with Inheritance (:>) work in Coq?

How to understand Setoid definition of category?

Compatibility of impredicative Set and function extensionality

Relationship between existential and universal quantifier in an inductive Coq definition

Simple inversion using custom inversion

forward_call with local variables

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

The reference “X” was not found in the current environment

Coq can't discriminate between constructors for dependently typed inductive proposition

Reduction of terms with fix. (Coq)

Induction Principle for Propositions with Lists (or: LNR for expressions with nested lists)

Why can't I use `app` together with `fold_right` in Coq?

How to deal with a function with an exists on the right side?

Restating lambdas in Coq without extensional function equality?

Proving equality on coinductive lazy lists in Coq

comparing two unequal values in coq

Nonconstructive proofs in Coq?

How do I rewrite negb true to false in Coq?

In Coq, is there a way to get rid of “useless” preconditions in a hypothesis?

### Related Links

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