How do I prove a "seemingly obvious" fact when relevant types are abstracted by a lambda i...

Pattern matching not specialising types...

Idris Dec vs Maybe...

Replace subexpression in equality proof in Idris...

Avoiding quantifiers in Z3...

Adding complete disjunctive assumption in Coq...

Getting a stronger induction principle in Coq...

Coq proof that the Selection monad is an applicative and a monad...

How can I read Coq's definition of proj1_sig?...

Isabelle: Unsupported recursive occurrence of a datatype via type constructor "Set.set"...

What constitutes a valid type in lean?...

How do I define partially ordered sets in Lean?...

Reals and theorem proving with Coq...

Subsets of list nat in coq...

Defining Maybe monad in Coq...

Inequality reasoning in Isabelle...

Relationship between existential and universal quantifier in an inductive Coq definition...

Is the QF_NRA logic in SMT-LIB decidable?...

Is division by zero included in QF_NRA?...

Simple identity in Coq...

Idris simple proof with lists...

Why does simp "fail to apply initial proof method" where blast succeeds with the same fact...

Proving Not (Elem x xs) when x and xs are statically known...

Z3 giving unexpected UNSAT for forall formulas...

Proofs about functions that depend on the ordering of their alternatives...

Struggling with rewrite tactic in Idris...

Idempotents of a commutatitive ring in Lean proof assistant...

Is Z3's search time sensitive to formula order?...

Is there a way to use SMT solvers for finding out how to compose functions?...

How to present negative number in bitvector?...