poset_downset_subset_min
In a poset of height two, every element strictly below any element v is minimal.
Statement
theorem poset_downset_subset_min {P : Type*} [PartialOrder P] (hP : poset_height_two P) (v : P) {x : P} (hx : x ∈ poset_downset v) : IsMin x
- Source
- arXiv:2610.24774 Section 3.3
- Verified
- 20 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- poset_height_twoA poset has height two when it contains no chain of three elements.
- poset_downsetFor a poset P and an element v in P, the strict downset D_P(v) is the set of all elements x in P strictly smaller than v.
Read back from the Lean
For any partially ordered type $P$ satisfying poset_height_two P (that is, there do not exist elements $a, b, c \in P$ such that $a < b < c$), and for any element $v \in P$ and any element $x \in P$, if $x \in \text{poset\_downset } v$ (that is, $x < v$), then $x$ is a minimal element of $P$ (IsMin x).
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 any element x in the strict downset of v is minimal, we suppose for contradiction that there is an element y < x. Because x < v, the three elements form a strict chain y < x < v, which directly contradicts the assumption that the poset has height two.
To show that x is minimal, it suffices to assume there is an element y < x and derive a contradiction.
By `isMin_iff_forall_not_lt`, an element x is minimal if and only if no element is strictly smaller than x. We then introduce an arbitrary element y and the hypothesis hy that y < x.
uses
isMin_iff_forall_not_ltrw [isMin_iff_forall_not_lt] intro y hy
The chain y < x < v contradicts the height-two condition, completing the proof.
Since x is in the strict downset of v, we have x < v. Combining this with y < x yields a two-step strict chain y < x < v, which contradicts the hypothesis hP that no three elements can satisfy a < b and b < c.
exact hP y x v ⟨hy, hx⟩
isMin_iff_forall_not_lt- An element in a preorder is minimal if and only if no element is strictly less than it.
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- In a poset of height two, every element in the downset of v is minimal. -/theorem poset_downset_subset_min {P : Type*} [PartialOrder P] (hP : poset_height_two P) (v : P) {x : P} (hx : x ∈ poset_downset v) : IsMin x := by rw [isMin_iff_forall_not_lt] intro y hy exact hP y x v ⟨hy, hx⟩