Lean verification record
Checked Artifact: Compactness Theorem for First-Order Logic (mathlib)
Proof Atlas collected build, no-sorry, axiom, and clean-source evidence directly from the pinned upstream declaration.
Verification result
The recorded Lean checks passed
- Build replaypassed with retained transcript
- Unfinished stepsNone found
- Source identityPinned commit and file recorded
- Dependency profileAxiom closure recorded
Reproducibility details
What the checker recorded
- Declaration checked
FirstOrder.Language.Theory.isSatisfiable_iff_isFinitelySatisfiable- Module
Mathlib.ModelTheory.Satisfiability- Source file checked
Mathlib/ModelTheory/Satisfiability.lean- Package commit
5e932f97dd25535344f80f9dd8da3aab83df0fe6- Build transcript
- passed · retained with this record
- Unfinished proof steps
- None found by the recorded no-sorry scan
- Axiom closure
- Classical.choice, Quot.sound, propext
- Collection provenance
- Clean source state recorded
ProofAtlas record
What has been checked
Upstream indexedPinned source bytes verified locally
Locally reproducedExact upstream declaration replayed
Reviewed pageCurrent public presentation reviewed
Accepted Atlas resultNot recorded for the preferred artifact
Mathlib is the source of the theorem; the local Lean replay and page review are separate.
Evidence boundary
Exact formal statement only
This target indexes Mathlib's semantic compactness theorem for arbitrary first-order languages. Here finite satisfiability means that every finite set of sentences contained in the theory has some nonempty model; those finite models need not be the same. The endpoint is not a theorem about compact topological spaces.
This checker record does not establish novelty, transfer a historical acceptance decision, or authorize publication.