Kaminski's equation
ProvedFamousTheorems.kaminski_equation_boolKaminski's equation. For every function and every Boolean ,
There are only four Boolean functions: the identity, negation and the two constants. The identity holds for each of them. It is a well-known small benchmark for automated reasoning, because it cannot be proved by equational rewriting alone and needs a case split on the finitely many values.
Formalization note. Mathlib's Bool.apply_apply_apply.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems theorem kaminski_equation_bool (f : Bool → Bool) (x : Bool) : f (f (f x)) = f x := by sorry end FamousTheorems
Source
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Bool.apply_apply_apply`. Proof here reduces to that Mathlib result.