AFTD Auto-Formalizing Theoretical Domains

poset_hypomorphic_card_reconstructible

theoremverified

Hypomorphic finite ordered sets have the same cardinality.

Statement

theorem poset_hypomorphic_card_reconstructible (P Q : Type) [Fintype P] [Fintype Q] [PartialOrder P] [PartialOrder Q] (h : poset_hypomorphic P Q) : Fintype.card P = Fintype.card Q
Source
step towards poset_height_one_reconstructible
Verified
25 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • poset_hypomorphicTwo ordered sets P and Q are hypomorphic (have the same deck) when there is a bijection σ : P → Q such that for every x the…

The proof, explained

In this formalization, two posets P and Q are defined to be hypomorphic if there exists a bijection σ : P ≃ Q whose point-deleted subposets are isomorphic. The proof simply unpacks this bijection σ from the hypomorphism hypothesis and applies the standard lemma that bijective finite types have identical cardinalities.

  1. There exists a bijection σ : P ≃ Q between the underlying types.

    By definition, `poset_hypomorphic P Q` asserts the existence of a bijection σ : P ≃ Q whose point-deleted subposets are pairwise order-isomorphic. We unpack this existential hypothesis to obtain the bijection σ, discarding the isomorphism condition on the cards since it is not needed.

    line 3

      obtain ⟨σ, -⟩ := h
  2. The cardinalities of P and Q are equal.

    Since σ is a bijection between the finite types P and Q, their cardinalities must be equal by `Fintype.card_congr`.

    line 4

    uses Fintype.card_congr

      exact Fintype.card_congr σ
Fintype.card_congr
If two finite types are in bijection, they have the same cardinality.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- Finite ordered sets with the same deck have the same number of elements. -/theorem poset_hypomorphic_card_reconstructible (P Q : Type) [Fintype P] [Fintype Q] [PartialOrder P] [PartialOrder Q] (h : poset_hypomorphic P Q) : Fintype.card P = Fintype.card Q := by  obtain ⟨σ, -⟩ := h  exact Fintype.card_congr σ
See it in the graphDiscuss this resultChallenge it