Red-black tree in Lean 4 prover with everything proved
Summary
Lean 4 proof of a red-black tree with insertion and sorting properties. The author proves the tree remains sorted after insert, using inductive definitions for Black and Node; notes the insert_sorted proof is lengthy and suggests leveraging mathlib.