Technical Lean evidence record
Checked Artifact: Hall's Marriage Theorem (Mathlib)
Proof Atlas collected build, no-sorry, axiom, and clean-source evidence directly from the pinned upstream declaration.
Four separate status axes
Upstream indexedPinned source bytes verified locally
Locally reproducedExact upstream declaration replayed
Reviewed pageCurrent public presentation reviewed
Accepted Atlas resultNot recorded for the preferred artifact
These states distinguish upstream identity, local reproduction, review, and Atlas acceptance. This page is part of the public, read-only Mathlib landmark collection.
Mechanical evidence
- Declaration checked
Finset.all_card_le_biUnion_card_iff_exists_injective- Module
Mathlib.Combinatorics.Hall.Basic- Source file checked
Mathlib/Combinatorics/Hall/Basic.lean- Package commit
5e932f97dd25535344f80f9dd8da3aab83df0fe6- Build
- passed · transcript retained
- Unfinished proof steps
- None found by the recorded no-sorry scan
- Axiom closure
- Classical.choice, Quot.sound, propext
- Clean collection provenance
- Recorded
Evidence boundary
This is Mathlib's indexed-Finset equivalence. It concerns finite member sets t i, checks every finite subfamily s, and concludes the existence of an injective representative function; the page does not substitute a different graph-theoretic formulation.
This checker record is evidence for the exact formal statement only. It does not establish novelty, transfer a historical acceptance decision, or authorize publication.