AFTD Auto-Formalizing Theoretical Domains

chore_opposite_pair_card

theoremverified

Given implicit natural numbers m and n, a hypothesis h2n : 2 * n ≤ m, and an element j : Fin n, the cardinality of chore_opposite_pair h2n j is equal to 2.

Statement

lemma chore_opposite_pair_card {m n : ℕ} (h2n : 2 * n ≤ m) (j : Fin n) :
    (chore_opposite_pair h2n j).card = 2
Source
arXiv:2611.04884, Section 4, line 731
Verified
05 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • chore_opposite_pairGiven implicit natural numbers m and n, a hypothesis h2n : 2 * n ≤ m, and an element j : Fin n, chore_opposite_pair is defined as the…

Read back from the Lean

For any natural numbers $m$ and $n$, given a proof that $2n \le m$, and for any element $j \in \mathrm{Fin}(n)$, the finite set chore_opposite_pair h2n j has cardinality 2.

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

The chore opposite pair of j is defined as the set {j, 2 * n - 1 - j}. By Finset.card_pair, this set has cardinality 2 provided the two elements are distinct. If they were equal, their values would satisfy 2 * j = 2 * n - 1, which contradicts j < n because an even number cannot equal the odd number 2 * n - 1.

  1. To show that the pair has cardinality 2, it suffices to show that the two chores j and 2 * n - 1 - j are distinct.

    Unfolding the definition of chore_opposite_pair reveals the set {⟨j, …⟩, ⟨2 * n - 1 - j, …⟩}. By Finset.card_pair, a pair {a, b} has cardinality 2 whenever a ≠ b, leaving the goal to prove that these two elements of Fin m are not equal.

    lines 4–6

    uses Finset.card_pair

      unfold chore_opposite_pair
      dsimp only
      rw [Finset.card_pair]
  2. Assuming for contradiction that the two chores are equal, their underlying natural numbers satisfy j = 2 * n - 1 - j.

    We assume for contradiction that the two elements are equal (intro h). By Fin.mk.injEq, two elements of Fin m are equal if and only if their underlying natural numbers are equal, simplifying the hypothesis h to j = 2 * n - 1 - j.

    lines 7–8

    uses Fin.mk.injEq

      intro h
      simp only [Fin.mk.injEq] at h
  3. The equality j = 2 * n - 1 - j contradicts j < n.

    Because j is an element of Fin n, its numerical value satisfies j < n (from j.isLt). But the relation j = 2 * n - 1 - j implies 2 * j = 2 * n - 1, which has no solution in natural numbers since 2 * j ≤ 2 * n - 2 < 2 * n - 1 (or because 2 * j is even while 2 * n - 1 is odd). Linear integer arithmetic (omega) derives False from these conflicting constraints and completes the proof.

    lines 9–10

      have hj : (j : ℕ) < n := j.isLt
      omega
Finset.card_pair
A set {a, b} has cardinality 2 if a ≠ b.
Fin.mk.injEq
Two elements of Fin n are equal if and only if their underlying natural values are equal.

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

/-- Every opposite pair contains exactly two distinct chores. -/lemma chore_opposite_pair_card {m n : ℕ} (h2n : 2 * n ≤ m) (j : Fin n) :    (chore_opposite_pair h2n j).card = 2 := by  unfold chore_opposite_pair  dsimp only  rw [Finset.card_pair]  intro h  simp only [Fin.mk.injEq] at h  have hj : (j : ℕ) < n := j.isLt  omega
See it in the graphDiscuss this resultChallenge it