AFTD Auto-Formalizing Theoretical Domains

k_submod_le

def

Componentwise partial order on assignments Fin n → Option (Fin k), where x ≤ y if for every element e, x e = none or x e = y e.

Statement

def k_submod_le {n k : ℕ} (x y : Fin n → Option (Fin k)) : Prop
Defined in
arXiv:2610.26677, line 106
Verified
21 Oct 2026
Axioms
none listed
Used by 7

Read back from the Lean

For natural numbers n and k, and functions x, y : Fin n → Option (Fin k), k_submod_le x y is defined to hold if and only if for every e : Fin n, either x e = none or x e = y e.

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

/-- Componentwise partial order on assignments Fin n → Option (Fin k). -/
def k_submod_le {n k : ℕ} (x y : Fin n → Option (Fin k)) : Prop := ∀ e, x e = none ∨ x e = y e
See it in the graphDiscuss this resultChallenge it