Dependent Pair Types...

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

Understanding nat_ind2 in Logical Foundations...

How do I apply (S n' <=? m) = true to S n' <= m?...

Software Foundations (lf): proving leb_plus_exists and plus_leb_exists...

Software Foundations Basics - Theorem lower_grade_lowers need to prove implication Eq = Lt -> Eq ...

Software Foundations Basics Exercise - How do I access letter from grade?...

Cannot focus on a remaining unfocused goal in Coq...

Check cnat. and got Type return...

Proving MStar' in Logical Foundations (IndProp.v)...

How can I prove `add_le_cases` (`forall n m p q, n + m <= p + q -> n <= p \/ m <= q`)...

Mix-up of bool and Datatypes.bool after Require Import coq libraries...

Coq proving nonsensical inductive property implication?...

How does the grading script of the LF series work for manually graded exercises?...

Quick Chick eqBoolArrowA_correct theorem...

Coq: unary to binary convertion...

Instance of Ord typeclass for option...

IndProp: prove that Prop is not provable...

Mix-up of bool and Datatypes.bool after Require Import Omega...

Coq: help to formalize an informal proof...

How to apply a lemma to 2 hypothesis...

coq Basics: bin_to_nat function...

Rel: le_antisymmetric comprehension...

Rev.v le_antisymmetric...

Software Foundations: apply ... with ... tactic...

Software Foundations: proving leb_complete and leb_correct...

Logic: auxilliry lemma for tr_rev_correct...

Tactics: stuck in eqb_trans...

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

How to set implicit parameters for constructor...