AFTD Auto-Formalizing Theoretical Domains

is_corner_crossed

def

A diagram given as a finite set D : Finset (ℕ × ℕ) is corner-crossed if for any two northwest corners u, v : ℕ × ℕ of D—cells in D having no cells of D anywhere above them in the same column and no cells of D anywhere to their left in the same row—if u has strictly smaller row index than v (u.1 < v.1), then v has strictly smaller column index than u (v.2 < u.2).

Statement

def is_corner_crossed (D : Finset (ℕ × ℕ)) : Prop
Defined in
arXiv:2611.07715, Definition 3.9
Verified
06 Nov 2026
Axioms
none listed

Read back from the Lean

A finite set $D$ of pairs of natural numbers is defined to be "corner crossed" if for all pairs of natural numbers $u = (u_1, u_2)$ and $v = (v_1, v_2)$, if: 1. $u \in D$, and for every $i < u_1$, $(i, u_2) \notin D$, and for every $j < u_2$, $(u_1, j) \notin D$; 2. $v \in D$, and for every $i < v_1$, $(i, v_2) \notin D$, and for every $j < v_2$, $(v_1, j) \notin D$; and 3. $u_1 < v_1$, then $v_2 < u_2$.

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 diagram is corner-crossed if any two northwest corners form a crossing (column indices strictly decrease as row indices increase). -/
def is_corner_crossed (D : Finset (ℕ × ℕ)) : Prop := ∀ ⦃u v : ℕ × ℕ⦄, (u ∈ D ∧ (∀ i < u.1, (i, u.2) ∉ D) ∧ (∀ j < u.2, (u.1, j) ∉ D)) →
                 (v ∈ D ∧ (∀ i < v.1, (i, v.2) ∉ D) ∧ (∀ j < v.2, (v.1, j) ∉ D)) →
                 u.1 < v.1 → v.2 < u.2
See it in the graphDiscuss this resultChallenge it