Mathlib Map

Theorems · Theorem · order theory

ChainCompletePartialOrder.IsExtremePt.setOf_isExtremePt_eq_bot

Deprecated since 2026-07-09Use ChainCompletePartialOrder.IsExtremePt.setOfPred_isExtremePt_eq_bot instead.

∀ {α : Type u_1} [inst : ChainCompletePartialOrder α] {x : α} {f : α → α},
  (∀ (x : α), x ≤ f x) → {y | ChainCompletePartialOrder.IsExtremePt x f y} = ChainCompletePartialOrder.bot x f

Alias of ChainCompletePartialOrder.IsExtremePt.setOfPred_isExtremePt_eq_bot.

Defined in
Mathlib.Order.BourbakiWitt
Cited by
0 results in Mathlib
Foundations
Depth 66 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
ChainCompletePartialOrder

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites6

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.