AFTD Auto-Formalizing Theoretical Domains

order_iso_of_bijective_order_reflecting

theoremverified

If a map α : P → Q between preordered types is bijective and satisfies α x ≤ α y ↔ x ≤ y for all x, y in P, then there exists an order isomorphism e : P ≃o Q whose underlying function is α.

Statement

theorem order_iso_of_bijective_order_reflecting
    {P Q : Type*} [Preorder P] [Preorder Q] (α : P → Q) (hα : Function.Bijective α)
    (h_rel : ∀ x y : P, α x ≤ α y ↔ x ≤ y) :
    ∃ e : P ≃o Q, ⇑e = α
Source
arXiv:2611.15540, Lemma 3.1: Solutions of the set-theoretic quantum Yang-Baxter equation arising from posets
Verified
16 Nov 2026
Axioms
Classical.choiceQuot.sound

Read back from the Lean

Let $P$ and $Q$ be preordered types, and let $\alpha : P \to Q$ be a function. If $\alpha$ is bijective and satisfies $\alpha(x) \le \alpha(y) \iff x \le y$ for all $x, y \in P$, then there exists an order isomorphism $e : P \simeqo Q$ whose underlying function equals $\alpha$.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

To show that α induces an order isomorphism, we promote the bijection α to an equivalence of types via `Equiv.ofBijective`, then bundle it into an order isomorphism using `RelIso.mk`. This leaves two subgoals: that the map preserves and reflects the preorder relation, which holds directly by the hypothesis h_rel, and that its underlying function is α, which holds definitionally.

  1. We provide as a witness the order isomorphism constructed from the bijection α.

    We promote the bijective function α to a type equivalence using `Equiv.ofBijective`, and bundle it into an order isomorphism with `RelIso.mk`. This reduces the existence claim to two subgoals: proving that the equivalence preserves and reflects the preorder relation ≤, and checking that its underlying function is α.

    line 6

    uses RelIso.mk, Equiv.ofBijective

      refine ⟨RelIso.mk (Equiv.ofBijective α hα) ?_, ?_⟩
  2. The equivalence preserves and reflects the preorder relation: for all a, b in P, α a ≤ α b ↔ a ≤ b.

    Let a and b be arbitrary elements of P. Since the underlying function of `Equiv.ofBijective α hα` is α, the condition simplifies to α a ≤ α b ↔ a ≤ b, which is exactly the hypothesis h_rel.

    lines 7–8

      · intro a b
        exact h_rel a b
  3. The underlying function of the constructed order isomorphism is α.

    By construction, the underlying function of the relation isomorphism formed from `Equiv.ofBijective α hα` is definitionally α, so the equality holds by reflexivity.

    line 9

      · rfl
RelIso.mk
Constructs a relation isomorphism between two types endowed with relations from an equivalence of types that preserves and reflects the relations.
Equiv.ofBijective
Constructs an equivalence between types from a function that is bijective.

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

/-- A bijective order-preserving and order-reflecting map lifts to an order isomorphism. -/theorem order_iso_of_bijective_order_reflecting    {P Q : Type*} [Preorder P] [Preorder Q] (α : P → Q) (hα : Function.Bijective α)    (h_rel : ∀ x y : P, α x ≤ α y ↔ x ≤ y) :    ∃ e : P ≃o Q, ⇑e = α := by  refine ⟨RelIso.mk (Equiv.ofBijective α hα) ?_, ?_⟩  · intro a b    exact h_rel a b  · rfl
See it in the graphDiscuss this resultChallenge it