  Mathematical proofs are a cornerstone of control theory, and it is important
to get them right. Deduction systems can help with this by mechanically
checking the proofs. However, the structure and level of detail at which a
proof is represented in a deduction system differ significantly from a proof
read and written by mathematicians and engineers, hampering understanding and
adoption of these systems.
  This paper aims at helping to bridge the gap between machine-checked proofs
and proofs in engineering and mathematics by presenting a machine-checked proof
for stability using Lyapunov's theorem in a human-readable way. The structure
of the proof is analyzed in detail, and potential benefits of such a proof are
discussed, such as generalizability, reusability and increased trust in
correctness.
