AFTD Auto-Formalizing Theoretical Domains

pyranim_remove

def

The position resulting from removing chip c = (i, j) from X, which removes c and all chips (a, b) in X that contain (i, j) (satisfying a ≤ i and j ≤ b).

Statement

def pyranim_remove (X : Finset (ℕ × ℕ)) (c : ℕ × ℕ) : Finset (ℕ × ℕ)
Defined in
arXiv:2611.16153 Sec. 1.1
Verified
13 Nov 2026
Axioms
none listed
Used by 2
  • pyranim_optionsFor a position X : Finset (ℕ × ℕ), pyranim_options X is the finite set of successor positions obtained by applying pyranim_remove X c for…
  • pyranim_mem_remove_iffA chip x survives the removal of chip c, i.e. x ∈ pyranim_remove X c, if and only if x ∈ X and c is not contained in x: removing a chip…

Read back from the Lean

Given a finite set X of pairs of natural numbers and a pair of natural numbers c = (c₁, c₂), pyranim_remove X c is defined as the subset of pairs (a, b) ∈ X that do not satisfy both a ≤ c₁ and c₂ ≤ b (that is, such that ¬(a ≤ c.1 ∧ c.2 ≤ b)).

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

/-- The position resulting from removing chip c and all chips containing it. -/
def pyranim_remove (X : Finset (ℕ × ℕ)) (c : ℕ × ℕ) : Finset (ℕ × ℕ) := X.filter (fun ⟨a, b⟩ => ¬ (a ≤ c.1 ∧ c.2 ≤ b))
See it in the graphDiscuss this resultChallenge it