AFTD Auto-Formalizing Theoretical Domains

inst_fintype_orderHom

instance

The type of order-preserving maps between two finite partial orders is finite.

Statement

noncomputable instance inst_fintype_orderHom {α β : Type*} [Fintype α] [Fintype β] [PartialOrder α] [PartialOrder β] : Fintype (α →o β)
Source
step towards op314_poset_tower_two_cancellation
Verified
25 Oct 2026
Axioms
none listed
Used by 3

Lean source view module on GitHub

/-- Finiteness of the poset of order-preserving maps between finite partial orders. Mathlib has no such instance, so cardinalities of `α →o β` cannot currently be written; this supplies one. -/
noncomputable instance inst_fintype_orderHom {α β : Type*} [Fintype α] [Fintype β] [PartialOrder α] [PartialOrder β] : Fintype (α →o β) := letI := Classical.decEq α
     Fintype.ofInjective (fun f : α →o β => (f : α → β)) (fun f g h => DFunLike.coe_injective h)
See it in the graphDiscuss this resultChallenge it