How to prove in Coq ~~(P \/ ~P)...

Why Coq doesn't allow inversion, destruct, etc. when the goal is a Type?...

Coq: trying to use dependent induction...

Import <Module> vs. Include <Module> in Coq Module system...

Addition of natural numbers in Coq...

Check cnat. and got Type return...

How to prove an absurd rule in Coq...

Coq - Coercion of list nat...

Is it possible to remove/override an existing coercion?...

Why Coq does not infer the type parameter...

Relations with dependent types in Coq...

How do you define an ordered pair in Coq?...

How can I write a tactic which works both in a goal and a hypothesis?...

How to prove shorter nat comparisons like 10000 > 1 for sigma types in Coq?...

Coq's proof #Coq...

How to save the current goal / subgoal as an `assert` lemma...

How can I proove forall a b, a <=? b = true -> a <=? S b = true in Coq...

Trace inclusion between program and state machine...

Proving S (n + m) = n + (S m), how to rewrite n+1 = S(n)?...

Cannot rewrite goal with assertion?...

Understanding the intros keyword work in Coq...

How can I prove excluded middle with the given hypothesis (forall P Q : Prop, (P -> Q) -> (~P ...

Double induction in Coq...

Why is UIP unprovable in Coq? Why does the match construct generalize types?...

What does the term "?T@{x:=t}", or a type with a question mark and at sign surrounding it ...

How to Import Coq library HoTT in CoqIde...

Proving a theorem containing not exists...

Is there a shorter proof to this Coq theorem?...

Coq: Associativity of relational composition...

Are those two proofs equivalent?...