Is it possible to convert all higher-order logic and dependent type in Lean/Isabelle/Coq into first-...

Which vector library to use in coq?...

Equality of type with equal indices do not typecheck...

How to prove manually (using calc) a Dafny lemma with an existential variable?...

Kind of issue with two-steps recursion...

Coq: Associativity of relational composition...

How to scrutinize a `match` term with return type `a=b -> c`...

How to deal with potentially-aliased arguments in VST?...

How can one handle by case analysis a boolP expression in Coq/ssreflect?...

How can one handle dependent-type equality proofs (sigma types) in Coq?...

How can one translate a Coq proof using Nat to rationals (Rat)?...

Coq convert non exist to forall statement...

Unexpected message about "decreasing argument of fix"...

How to understand `(elimTF andP top)`?...

Providing and using proofs as arguments to a function in Rocq...

Deducing equality from existT equality...

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

How to temporarily disable notations in Coq...

Prove that an element of fin 1 is exactly 0...

Coq: Boolean Comparison of Integers...

In Coq (or Rocq), can't a lemma with a universal conclusion be applied to other premises?...

Rocq: Transparent aliased definition (that instance solver sees though)...

How can I rewrite or use my IH when Coq won't unify my goal with it?...

while_true_nonterm in Lean4...

How to reduce a cofix expression?...

Coq vector: shiftin, shiftout, and last...

Coq vector: equality of shiftin...

Why are logical connectives and booleans separate in Coq?...

What's the difference between Program Fixpoint and Function in Coq?...

Is there any difference between "parameters" and "indices" in Coq theorems?...