AFTD Auto-Formalizing Theoretical Domains

int_crescent_config_card

theoremverified

For every integer n ≥ 3, the cardinality of the finite set int_crescent_config n is n.

Statement

theorem int_crescent_config_card (n : ℕ) (hn : 3 ≤ n) :
    (int_crescent_config n).card = n
Source
arXiv:2610.38368 Section 3
Verified
08 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • int_crescent_configFor a natural number n, int_crescent_config n is the finite set in Finset (Fin 3 → ℤ) given by the image of Finset.univ under…
  • int_crescent_point_injectiveFor every integer n ≥ 3, the function int_crescent_point n from Fin n to Fin 3 → ℤ is injective.
  • int_crescent_pointFor a natural number n and an index j in Fin n, int_crescent_point n j is the integer vector of type Fin 3 → ℤ whose coordinate 0 is…

Read back from the Lean

For every natural number $n$ satisfying $3 \le n$, the cardinality of the finite set int_crescent_config n (a subset of Fin 3 → ℤ) is equal to $n$.

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

By definition, int_crescent_config n is the image of the universal set on Fin n under the mapping int_crescent_point n. Because this map is injective when n ≥ 3, the cardinality of the image equals the cardinality of Fin n. Since Fin n has n elements, the configuration has cardinality n.

  1. The cardinality of int_crescent_config n is n.

    By definition (int_crescent_config), the configuration is the image of the universal set Finset.univ on Fin n under the map int_crescent_point n. Because this map is injective for n ≥ 3 (by int_crescent_point_injective), Finset.card_image_of_injective reduces the cardinality of the image to the cardinality of Finset.univ. Finally, Finset.card_univ rewrites the cardinality of Finset.univ to Fintype.card (Fin n), which equals n by Fintype.card_fin.

    lines 4–5

    uses int_crescent_config, Finset.card_image_of_injective, int_crescent_point_injective, Finset.card_univ, Fintype.card_fin

      rw [int_crescent_config, Finset.card_image_of_injective _ (int_crescent_point_injective n hn),
        Finset.card_univ, Fintype.card_fin]
int_crescent_config
the definition stating that int_crescent_config n is the image of Finset.univ under int_crescent_point n
Finset.card_image_of_injective
the cardinality of the image of a finite set under an injective function equals the cardinality of the set
int_crescent_point_injective
for n ≥ 3, the point map int_crescent_point n is injective
Finset.card_univ
the cardinality of the universal finset on a finite type equals the cardinality of that type
Fintype.card_fin
the cardinality of the finite type Fin n is n

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 cardinality of int_crescent_config n is n for n ≥ 3. -/theorem int_crescent_config_card (n : ℕ) (hn : 3 ≤ n) :    (int_crescent_config n).card = n := by  rw [int_crescent_config, Finset.card_image_of_injective _ (int_crescent_point_injective n hn),    Finset.card_univ, Fintype.card_fin]
See it in the graphDiscuss this resultChallenge it