AFTD Auto-Formalizing Theoretical Domains

IsAdmissible

def

A 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 elements in C, then B and C have the same cardinality.

Statement

def IsAdmissible (A : Finset ℕ) : Prop
Defined in
arXiv:2610.34372, Definition 1.1
Verified
29 Oct 2026
Axioms
none listed
Used by 5

Read back from the Lean

For a finite set of natural numbers $A$, IsAdmissible A is defined to hold if and only if for all finite sets of natural numbers $B$ and $C$, if $B \subseteq A$, $C \subseteq A$, and the sum of the elements of $B$ equals the sum of the elements of $C$, then the cardinality of $B$ equals the cardinality of $C$.

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

Lean source view module on GitHub

/-- A finite set of positive integers is admissible if any two subsets with the same sum have the same cardinality. -/
def IsAdmissible (A : Finset ℕ) : Prop := ∀ B C, B ⊆ A → C ⊆ A → B.sum id = C.sum id → B.card = C.card
See it in the graphDiscuss this resultChallenge it