Subset_of_Well_Ordered_Set_is_Well_Ordered
Provedproofwikiwell-orderings
Every non-empty subset of a well-ordered set has a least element (is itself well-ordered).
Preamble
import Mathlib.Order.WellFounded import Mathlib.Data.Set.Basic import Mathlib.Order.Basic
Formal statement
theorem Subset_of_Well_Ordered_Set_is_Well_Ordered {α : Type _} [LinearOrder α] [IsWellOrder α (· < ·)] (S : Set α) (hS : S.Nonempty) : ∃ m ∈ S, ∀ x ∈ S, m ≤ x := by sorrySource