AFTD Auto-Formalizing Theoretical Domains

poset_height_one

def

An ordered set has height one when its longest chains have exactly two elements: some two elements are comparable and there is no chain a < b < c.

Statement

def poset_height_one (P : Type*) [PartialOrder P] : Prop
Defined in
arXiv:2610.12690 (Reconstruction of Finite Posets of Width Three), Sec. 9 (ordered sets of height one).
Verified
13 Oct 2026
Axioms
none listed
Used by 2

Lean source view module on GitHub

/-- An order of height one: some two elements are comparable, and there is no chain
`a < b < c`. -/
def poset_height_one (P : Type*) [PartialOrder P] : Prop :=
  (∃ a b : P, a < b) ∧ ∀ a b c : P, ¬ (a < b ∧ b < c)
See it in the graphDiscuss this resultChallenge it