AFTD Auto-Formalizing Theoretical Domains

poset_downset

def

For a poset P and an element v in P, the strict downset D_P(v) is the set of all elements x in P strictly smaller than v.

Statement

def poset_downset {P : Type*} [PartialOrder P] (v : P) : Set P
Defined in
arXiv:2610.24774 Section 1
Verified
20 Oct 2026
Axioms
none listed
Used by 2

Read back from the Lean

For a partially ordered type P and an element v : P, poset_downset v is defined as the set of all elements x : P such that x < v (strictly less than v).

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 strict downset D_P(v) of an element v in a poset P. -/
def poset_downset {P : Type*} [PartialOrder P] (v : P) : Set P := {x | x < v}
See it in the graphDiscuss this resultChallenge it