AFTD Auto-Formalizing Theoretical Domains

isAdmissible_empty

theoremverified

The empty set is an admissible set of natural numbers.

Statement

theorem isAdmissible_empty : IsAdmissible ∅
Source
arXiv:2610.34372, text following Definition 1.1
Verified
30 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • IsAdmissibleA finite set A of positive integers is admissible if for any two subsets B and C of A, if the sum of elements in B equals the sum of…

Read back from the Lean

The empty set of natural numbers (as a Finset ℕ) satisfies IsAdmissible.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

A finite set of natural numbers is admissible if any two of its subsets with the same sum of elements have the same number of elements. For the empty set, the only subset is the empty set itself. Consequently, any two subsets must both be empty, making their cardinalities trivially equal.

  1. To show that ∅ is admissible, it suffices to prove that any two subsets B, C ⊆ ∅ with equal element sums have the same cardinality.

    Unfolding the definition of an admissible set, we fix arbitrary subsets B and C of ∅ and assume their element sums are equal.

    line 3

      intro B C hB hC _
  2. B and C have the same cardinality, completing the proof.

    By Finset.subset_empty, the only subset of the empty set is the empty set itself, which forces both B = ∅ and C = ∅. Substituting ∅ for B and C reduces the goal to |∅| = |∅|, which is an identity.

    lines 4–5

    uses Finset.subset_empty

      rw [Finset.subset_empty] at hB hC
      rw [hB, hC]
Finset.subset_empty
A finite set is a subset of the empty set if and only if it is the empty set itself.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- The empty set of natural numbers is admissible. -/theorem isAdmissible_empty : IsAdmissible ∅ := by  intro B C hB hC _  rw [Finset.subset_empty] at hB hC  rw [hB, hC]
See it in the graphDiscuss this resultChallenge it