Prove a recursive function in Isabelle...

What is the reason to axiomatize "undefined" in Isabelle/HOL?...

Ignore missing pattern in Isabelle...

If statement doesn't evaluate...

How to refer to variables in induction...

Proof over cases for which set element is included in...

Unable to figure out induct rule for mutually recursive predicates...

How to apply standard to all subgoals in Isabelle?...

Using prefer_tac correctly...

How to lift a transitive relation from elements to lists?...

Induct on two variables?...

Can I construct a while structure algebraically using class and locale?...

What does Metis: Unused theorems mean in this context?...

Inductive predicates, transitive closure, and code generation...

Expanding all definitions in Isabelle lemma...

How to write bigvee and big wedge in Isabelle...

How to let Isabelle "compute" THE output of an inductive predicate...

Trying to prove that a type is an instance of `euclidean_semiring` (in Isabelle)...

How can I prove "(⋀x. PROP ?P x) ⟹ PROP ?P ?x" in Isabelle?...

How do I remove duplicate subgoals in Isabelle?...

Getting a function from a forall exists fact...

Can resolution proofs be traced in Isabelle?...

Subst refl closing duplicate subgoals. What's going on?...

Skolem functions in SMT and ATPs...

How does a z3 certificate look like?...

Find Lemmas used by simp/auto/clarify...

How does Sledgehammer translate lambda-abstractions to ATPs?...

In Isabelle, how to print the state (i.e. subgoals to prove) in other formats (like S-expression, Js...

Isabelle proving with translation issue...

Locale definition produces two parse trees...