AFTD Auto-Formalizing Theoretical Domains

InImplicit

inductive

For a diagram given as a finite set D : Finset (ℕ × ℕ), a cell (i, j) : ℕ × ℕ is in the implicit closure InImplicit D (i, j) if it belongs to D, or lies in the same row weakly between two cells in the closure (with row i and column j₁ ≤ j ≤ j₂), or lies in the same column weakly between two cells in the closure (with column j and row i₁ ≤ i ≤ i₂).

Statement

inductive InImplicit (D : Finset (ℕ × ℕ)) : ℕ × ℕ → Prop
Defined in
arXiv:2611.07715, Definition 2.1
Verified
06 Nov 2026
Axioms
none listed
Used by 1
  • row_col_leFor a finite diagram D : Finset (ℕ × ℕ) and cells u, v : ℕ × ℕ, row_col_le D u v holds if there is a reflexive-transitive chain of unit…

Read back from the Lean

An inductive predicate InImplicit D : ℕ × ℕ → Prop, parameterized by a finite set of pairs of natural numbers D : Finset (ℕ × ℕ), defined by three rules: 1. base: for any pair x : ℕ × ℕ, if x ∈ D, then InImplicit D x holds. 2. row_between: for any natural numbers i, j₁, j₂, and j, if InImplicit D (i, j₁) and InImplicit D (i, j₂) hold, and j₁ ≤ j and j ≤ j₂, then InImplicit D (i, j) holds. 3. col_between: for any natural numbers i₁, i₂, j, and i, if InImplicit D (i₁, j) and InImplicit D (i₂, j) hold, and i₁ ≤ i and i ≤ i₂, then InImplicit D (i, j) holds.

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

/-- Predicate for cells in the smallest set containing D closed under row and column betweenness (implicit boxes). -/
inductive InImplicit (D : Finset (ℕ × ℕ)) : ℕ × ℕ → Prop | base {x} : x ∈ D → InImplicit D x
| row_between {i j₁ j₂ j} : InImplicit D (i, j₁) → InImplicit D (i, j₂) → j₁ ≤ j → j ≤ j₂ → InImplicit D (i, j)
| col_between {i₁ i₂ j i} : InImplicit D (i₁, j) → InImplicit D (i₂, j) → i₁ ≤ i → i ≤ i₂ → InImplicit D (i, j)
See it in the graphDiscuss this resultChallenge it