How to make the assumption of the second case of an Isabelle/Isar proof by cases explicit right in place?
Idiomatic Proof by Contradiction in Isabelle?
Is there a way to prove a program has no bug?
Proof of Loop Invariant and Algorithm
How can I prove the correctness of the following algorithm?
Apply a method if and only if it solves the current goal
Core of Verifier in Isabelle/HOL
In Coq, which tactic to change the goal from `S x = S y` to `x = y`
Proof on less than and less or equal on nat
Homework - Prove Big-Omega
Proof - Coq - Do I need induction?
Using coq, trying to prove a simple lemma on trees
Proving lemma with implication based on functions
Proving correctness in formal logic
I need a proof for a function postcondition
Help with Big Omega Proof?