Proof pearl: the marriage theorem

  • Authors:

  • Dongchen Jiang;Tobias Nipkow

  • Affiliations:

  • ,State Key Laboratory of Software Development Environment, Beihang University, China;Institut für Informatik, Technische Universität München, Germany

  • Venue:
  • CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe two formal proofs of the finite version of Hall's Marriage Theorem performed with the proof assistant Isabelle/HOL, one by Halmos and Vaughan and one by Rado. The distinctive feature of our formalisation is that instead of sequences (often found in statements of this theorem) we employ indexed families, thus avoiding tedious reindexing of sequences.