AFTD Auto-Formalizing Theoretical Domains

poset_lt_pair_count

def

The number of comparable pairs (ordered pairs a < b) of an ordered set, as a natural number.

Statement

noncomputable def poset_lt_pair_count (P : Type*) [PartialOrder P] : Nat
Source
step towards poset_height_one_reconstructible
Verified
20 Oct 2026
Axioms
none listed
Used by 3

Lean source view module on GitHub

/-- The number of strict-comparable ordered pairs of an ordered set. -/
noncomputable def poset_lt_pair_count (P : Type*) [PartialOrder P] : Nat := Nat.card {p : P × P // p.1 < p.2}
See it in the graphDiscuss this resultChallenge it